Norival R. Figueira
ABSTRACT
Leave-in-Time is a new rate-based service discipline for packet-switching nodes in a connection-oriented data network. Leave-in-Time provides sessions with upper bounds on end-to-end delay, delay jitter, buffer space requirements, and an upper bound on the probability distribution of end-to-end delays. A Leave-in-Time session's guarantees are completely determined by the dynamic traffic behavior of that session, without influence from other sessions. This results in the desirable property that these guarantees are expressed as functions derivable simply from a single fixed-rate server (with rate equal to the session's reserved rate) serving only that session. Leave-in-Time has a non-work-conserving mode of operation for sessions desiring low end-to-end delay jitter. Finally, Leave-in-Time supports the notion of delay shifting, whereby the delay bounds of some sessions may be decreased at the expense of increasing those of other sessions. We present a set of admission control algorithms which support the ability to do delay shifting in a systematic way.
- 1.D. Clark, S. Shenker, and L. Zhang, "Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism," in Proceedings of ACM SIG- COMM '92, pp. 14-26, August 1992. Google Scholar
Digital Library
- 2.R.L. Cruz, "A Calculus for Network Delay, Part I: Network Elements in Isolation," In IEEE Transactions on Information Theory, Vol. 37, No. 1, pp. 114-131, January 1991.Google ScholarDigital Library
- 3.R.L. Cruz, "A Calculus for Network Delay, Part II: Network Analysis," In IEEE Transactions on Information Theory, Vol. 37, No. 1, pp. 132-141, January 1991.Google ScholarDigital Library
- 4.A. Demers, S. Keshav, and S. Shenker, "Analysis and Simulation of a Fair Queueing Algorithm," In Proceedings of ACM SIGCOMM '89, pp. 1-12, September 1989. Google ScholarDigital Library
- 5.D. Ferrari and D. Verma, "A Scheme for Real-Time Channel Establishment in Wide-Area Networks," In IEEE JSAC, Vol. 8, No. 4, pp. 368-379, April 1990.Google Scholar
- 6.N. R. Figueira, "A New Approach to the Control of Real- Time Traffic in Packet Switching Data Networks," Ph.D. Dissertation, Department of Computer Science and Engineering, University of California, San Diego, June 1995. Google ScholarDigital Library
- 7.N. R. Figueira and Joseph Pasquale, "An Upper Bound on Delay for the VirtualClock Service Discipline," IEEE/ACM Transactions on Networking, Vol. 3, No. 4, August 1995, (in press). Google ScholarDigital Library
- 8.N.R. Figueira and Joseph Pasquale, "Leave-in-Time: A Service Discipline for Real-Time Communications in a Packet Switching Network," Technical Report CSE95-426, University of California, San Diego, May 1995.Google Scholar
- 9.S. J. Golestani, "A Stop-and-Go Queueing Framework for Congestion Management," In Proceedings of ACM SIG- COMM '90, pp. 8-18, September 1990. Google ScholarDigital Library
- 10.S. J. Golestani, "Congestion-Free Transmission of Real-Time Traffic in Packet Networks," In Proceedings of IEEE INFO- COM '90, pp. 527-536, June 1990.Google Scholar
- 11.S. J. Golestani, "Duration-Limited Statistical Multiplexing of Delay-Sensitive Traffic in Packet Networks," in Proceedings oflEEE INFOCOM '91, pp. 323-332, April 1991.Google Scholar
- 12.S. J. Golestani, "A Self-Clocked Fair Queueing Scheme for Broadband Applications," In Proceedings of IEEE INFO- COM '94, pp. 636-646, June 1994.Google ScholarCross Ref
- 13.C. Kalmanek, H. Kanakia, and S. Keshav, "Rate Controlled Servers for Very High-Speed Networks," In Proceedings of IEEE GlobeCom '90, pp. 300.3.1-300.3.9, December 1990.Google Scholar
- 14.L. Kleinrock, Queueing Systems, VoI. 1. New York: Wiley, 1975. Google ScholarDigital Library
- 15.J. Kurose, "On Computing Per-session Performance Bounds in High-Speed Multi-hop Computer Networks," In ACM Sigmetrics '92, pp. 128-139, June 1992. Google ScholarDigital Library
- 16.A. M. Lee, Applied Queueing Theory. London: Macmillan, New York: St. Martin's Press, 1966.Google Scholar
- 17.A. K. Parekh, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks," Ph.D. Dissertation, Massachusetts Institute of Technology, LiDS-TH- 2089, February 1992.Google Scholar
- 18.A. K. Parekh, and G. Gallager, "A Generalized Processor Sharing Approach to Flow Control in integrated Services Networks -- The Single Node Case," In Proceedings of IEEE INFOCOM '92, Vol. 2, pp. 915-924, May 1992. Google ScholarDigital Library
- 19.A. K. Parekh, and G. Gallager, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks -- The Multiple Node Case," In Proceedings of IEEE INFOCOM '93, Vol. 2, pp. 521-530, March 1993.Google Scholar
- 20.A. K. Parekh, and G. Gallager, "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case," In iEEE/ACM Transactions on Networking, Vol. 1, No. 3, pp. 344-357, June 1993. Google ScholarDigital Library
- 21.J. R. Shelton, "Solution Methods for Waiting Line Problems," Journal of Industrial Engineering, pp. 293-303, July-August 1960.Google Scholar
- 22.D. Verma, H. Zhang, and D. Ferrari, "Delay Jitter Control for Real-Time Communication in a Packet Switching Network," In Proceedings of lEEE TriCom '91, pp. 35-43, April 1991.Google Scholar
- 23.R. W. Wolff, Stochastic Modelling and the Theory of Queues. Englewood Cliffs, NJ: Prentice Hall, 1989.Google Scholar
- 24.O. Yaron and M. Sidi, "Calculating Performance Bounds in Communication Networks," In Proceedings of IEEE INFO- COM '93, Vol. 2, pp. 539-545, March 1993.Google Scholar
- 25.D. Yates, J. Kurose, D. Towsley, and M. G. Hluchyj, "On Persession End-to-End Delay Distributions and The Call Admission Problem for Real-Time Applications with QOS Requirements,'' In Proceedings of ACM SIGCOMM '93, pp. 2-12, September 1993. Google ScholarDigital Library
- 26.H. Zhang and D. Ferrari, "Rate-Controlled Static-Priority Queueing," In Proceedings of IEEE INFOCOM '93, pp. 227- 236, March 1993.Google Scholar
- 27.H. Zhang and D. Ferrari, "Improving Utilization for Deterministic Service in Multimedia Communication," In Proceedings of the International Conference on Multimedia Computing and Systems, pp. 295-304, May 1994.Google Scholar
- 28.H. Zhang and S. Keshav, "Comparison of Rate-Based Service Disciplines," In Proceedings of ACM SIGCOMM '91, pp. 113-121, August 1991. Google ScholarDigital Library
- 29.L. Zhang, "VirtualCIock: A New Traffic Control Algorithm for Packet Switching Networks," In ACM Transactions on Computer Systems, Vol. 9, No. 2, pp. 101-124, May 1991. Also in Proceedings ofACM SIGCOMM '90, pp. 19-29, September 1990. Google ScholarDigital Library
Index Terms
- Leave-in-Time: a new service discipline for real-time communications in a packet-switching network
Recommendations
Leave-in-Time: a new service discipline for real-time communications in a packet-switching network
Leave-in-Time is a new rate-based service discipline for packet-switching nodes in a connection-oriented data network. Leave-in-Time provides sessions with upper bounds on end-to-end delay, delay jitter, buffer space requirements, and an upper bound on ...
A discrete-time queueing model with abandonments
QTNA '10: Proceedings of the 5th International Conference on Queueing Theory and Network ApplicationsThis paper presents a multi-server queueing model with abandonments in discrete time. In every time slot a generally distributed number (batch) of customers arrives. The different numbers of arrivals in consecutive slots are mutually independent. Each ...
Comments