Summary: [16] F. P. Kelly. Reversability and stochastic networks. Wiley, New York, 1979.
[17] J. Liebeherr, D. Wrege, and D. Ferrari. Exact admission control for networks with a bounded
delay service. IEEE/ACM Transactions on Networking, 4(6):885 -- 901, December 1996.
[18] S. H. Lu and P. R. Kumar. Distributed scheduling based on due dates and buffer priorities.
IEEE Transactions on Automatic Control, 36(12):1406 -- 1416, 1991.
[19] A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in
integrated services networks: The single­node case. IEEE/ACM Transactions on Networking,
1(3):344 -- 357, 1993.
[20] A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow con­
trol in integrated services networks: The multiple­node case. IEEE/ACM Transactions on
Networking, 2(2):137 -- 150, 1994.
[21] S. Rybko and A. Stolyar. Ergodicity of stochastic processes describing the functioning of open
queueing networks. Problems of Information Transmission, 28:199 -- 220, 1992.
[22] T. I. Seidman. `First come, first served' can be unstable! IEEE Transactions on Automatic
Control, 39:2166 -- 2171, 1994.
[23] D. Stiliadis. Traffic scheduling in packet­switched networks: analysis design and implementa­
tion. PhD thesis, UCSC, 1996.
[24] J. Turner. New directions in communications, or Which way to the information age? IEEE
Communications Magazine, 24:8 -- 15, 1986.
[25] D. Wrege and J. Liebeherr. A near­optimal packet scheduler for QoS networks. In Proceedings

Source: Andrews, Matthew - Mathematics of Networks and Systems, Mathematical Sciences Research Center, Bell Laboratories

Collections: Mathematics; Computer Technologies and Information Sciences