The convexity of loss rate in an Erland loss system and sojourn in an Erlang delay system with respect to arrival and service rates

@article{Krishnan1990TheCO,
  title={The convexity of loss rate in an Erland loss system and sojourn in an Erlang delay system with respect to arrival and service rates},
  author={K. R. Krishnan},
  journal={IEEE Trans. Communications},
  year={1990},
  volume={38},
  pages={1314-1316}
}
A bsfract-In studying performance optimization in queues, it is useful to know whether the performance measures possess properties of convexity or concavity with respect to variables such as arrival and service rates. In recent research, several authors have obtained results on the convexity, with respect to arrival and service rates, of the loss rate in an Erlang loss system and of the sojourn in an Erlang delay system. This paper presents a simple and straightforward alternative proof of… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 20 extracted citations

References

Publications referenced by this paper.
Showing 1-5 of 5 references

The convexity of the mean queue size of the MIMIC queue with respect to the traffic intensity

  • A. Harel
  • 1981

A note on the convexity of performance measures of MIMIC queueing systems

  • M. A. Cohen
  • 1974

Some properties of the Erlang loss function,

  • D. L. Jagerman
  • Bell Syst. Tech. J . ,
  • 1974

Proof of a convexity property of the Erlang B formula

  • J. Appl. Probab., E. J. Messerli
  • Bel / Syst . Tech . J .
  • 1972

Similar Papers

Loading similar papers…