An Algebra for Queueing Networks with Time-Varying Service and Its Application to the Analysis of Integrated Service Networks

Published Online:https://doi.org/10.1287/moor.1040.0117

References

  • Agrawal R., Rajan R. A general framework for analyzing schedulers and regulators in integrated services networks. Invited paper. Proc. 34th Allerton Conf. (1996a) Allerton, ILGoogle Scholar
  • Agrawal R., Rajan R. Performance bounds for guaranteed and adaptive services. (1996b) . Technical Report RC 20649, IBM Research DivisionGoogle Scholar
  • Baccelli F., Hong D. TCP is max-plus linear. Proc. Sigcomm 2000 (2000) Stockholm, Sweden(ACM, New York) 219–230Vol. 30 No. 4Google Scholar
  • Baccelli F., Liu Z. On a class of stochastic evolution equations. Ann. Probab. (1992) 20:350–374CrossrefGoogle Scholar
  • Baccelli F., Cohen G., Olsder G. J., Quadrat J. P. Wiley Series Probability and Mathematical Statistics. Synchronization and Linearity: An Algebra for Discrete Event Systems (1992) (John Wiley and Sons, New York) Google Scholar
  • Carmona R., Lacroix J.Spectral Theory of Random Schrödinger Operators (1990) (Birkhäuser, Boston, MA) CrossrefGoogle Scholar
  • Chang C. S. On deterministic traffic regulation and service guarantee: A systematic approach by filtering. Proc. IEEE INFOCOM'97 (1997) Kobe, JapanCrossrefGoogle Scholar
  • Chang C. S. Matrix extensions of the filtering theory for deterministic traffic regulation and service guarantees. IEEE J. Selected Areas Comm. (1998) 16:708–718CrossrefGoogle Scholar
  • Cohen G., Dubois D., Quadrat J. P., Viot M. A linear system-theoretic view of discrete event processes and its use for performance evaluation in manufacturing. IEEE Trans. Automatic Control (1985) 30:210–220CrossrefGoogle Scholar
  • Cruz R. L. A calculus for network delay part I: Network elements in isolation. IEEE Trans. Inform. Theory (1991) 37:114–131CrossrefGoogle Scholar
  • Harrison J. M., Reiman M. I. Reflected Brownian motion on an orthant. Ann. Probab. (1979) 9(2):302–308CrossrefGoogle Scholar
  • Kingman J. F. C. Subadditive ergodic theory. Ann. Probab. (1973) 1:883–909CrossrefGoogle Scholar
  • Le Boudec J. Y. Application of network calculus to guaranteed service networks. IEEE Trans. Inform. Theory (1998) 44:1087–1096CrossrefGoogle Scholar
  • Liu Z., Baccelli F. Generalized precedence based queueing systems. Math. Oper. Res. (1992) 17:615–639LinkGoogle Scholar
  • Loynes R. M. The stability of queues with nonindependent inter-arrival and service times. Proc. Cambridge Philos. Soc. (1962) 58:497–520CrossrefGoogle Scholar
  • Okino C., Agrawal R., Cruz R., Rajan R. Bounds for flow control protocols. IEEE/ACM Trans. Networking (1999) 7(3):310–323CrossrefGoogle Scholar
  • Rajan R., Agrawal R. Synchronous constrained fluid systems. (1995) . Technical Report RC 20313, IBM Research DivisionGoogle Scholar
  • Stiliadis D., Varma A. Latency-rate servers: A general model for analysis of traffic scheduling algorithms. Proc. IEEE INFOCOM'96 (1996) San Francisco, CA:111–119CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.