David Yates
ABSTRACT
A crucial problem facing the designers and deployers of future high-speed networks is providing applications with quality of service (QOS) guarantees. For soft real-time applications, which are delay sensitive but loss tolerant, delay distribution is an important QOS measure of interest. In this paper we study (through simulation) the end-to-end delay distribution seen by individual sessions under simple first-come first-served (FCFS) multiplexing in a network model with two significant features: (1) all traffic is connection-oriented, (2) cross traffic along routes is representative of that seen by calls in a moderately sized wide area network (i.e., less than 100 switches). We compare these delay distributions with the worst case point-valued analytic delay bounds predicted by three different techniques for providing such bounds (two of which require a more sophisticated link-level scheduling policy). We also consider the per-hop delay distributions seen as a session progresses "deeper" into the network and determine the sensitivity of these delay distributions to the manner in which the interfering traffic is modeled. Finally, we use our delay distribution results to examine the tradeoff between the QOS requested by a call, the manner in which the QOS guarantee is provided, and the number of calls that are admitted at the requested QOS.
- 1.BRADY, P. T. A statistical analysis of on-off patterns in 16 conversations. Bell System Technical Journal ~t 7, 1 (Jan. 1968), 73-91.Google Scholar
- 2.CHANG, C.-S. Stability, queue length, and delay, part I: Deterministic queueing networks. Research Report RC 17708, IBM T. J. Watson Research Center, Yorktown Heights, NY, Feb. 1992.Google Scholar
- 3.CHANG, C.-S. Stability, queue length, and delay, part II: Stochastic queueing networks. Research Report RC 17709, IBM T. J. Watson Research Center, Yorktown Heights, IVY, Feb. 1992.Google Scholar
- 4.CLARK, D. D., SHm~BR, S., AND ZHANG, L. Supporting real-time applications in an integrated services packet network: architecture and mechanism. In SI- GCOMM Symposium on Communications Architectures and Protocols (Baltimore, MD, Aug. 1992), ACM, pp. 14-26. Google ScholarDigital Library
- 5.CRUZ, R. L. A calculus for network delay, part I: Network elements in isolation. IEEE Teansaetions on Information Theory 37, 1 (Jan. 1991), 114-131.Google Scholar
- 6.CRuz, R. L. A calculus for network delay, part Ih Network analysis. IEEE Transactions on Information Theory 37, 1 (Jan. 1991), 132-141.Google Scholar
- 7.Dt~MERS, A., KBSHAV, S., AND SHENKER, S. Analysis and simulation of a fair queueing algorithm. Internetworking: Research and Ezperience 1, 1 (Jan. 1990), 3-26.Google Scholar
- 8.ELWALW, A. I., AND MITRA, D. Effective bandwidth of general markovian traffic sources and admission control of high-speed networks. IEEE/ACM Trunsactions on Networking i, 3 (June 1993). Google ScholarDigital Library
- 9.F~.RaAtU, D., AND VErandA, D. C. A scheme for real-tlme channel establishment in wide-area networks. iEEE Journal on Selected Areas in Communications 8, 3 (Apr. 1990), 368-379.Google Scholar
- 10.GOLBSTANI, S. J. Congestion-free communication in high-speed packet networks. IEEE Transactions on Communications 39, 12 (Dec. 1991), 1802-1812.Google Scholar
- 11.GOLESTANI, S. J. A framing strategy for congestion management. IEEE Journal on Selected Areas in Communications 9, 7 (Sept. 1991), 1064-1077.Google ScholarDigital Library
- 12.GP.~.NBBttG, A. G., AND MADRAS, N. Comparison of a fair queueing discipline to processor sharing. In Performance '90: 14th International Symposium on Computer Performance Modelling, Measurement and Evaluation (Edinburgh, Scotland, Sept. 1990), P. J. B. King, I. Mitrani, and R. J. Pooley, Eds., IFIP WG7.3, North- Holland, Amsterdam, Holland, pp. 193-20T. Google ScholarDigital Library
- 13.GmilUN, R., AHMADI, H., AND NAGHSHINEH, M. Equivalent capacity and its application to bandwidth allocation in high-speed networks. IEEE Journal on Selected Areas in Communications 9, 7 (Sept. 1991), 968-981.Google Scholar
- 14.HEFFES, H., AND LUCANTONI, D. M. A Markov modulated characterization of packetized voice and data traffic and related statistical multiplexer performance. IEEE Journal on Selected Areas in Communications SAC-g, 6 (Sept. 1986), 856-868.Google ScholarDigital Library
- 15.JAMn~, S., S~mNEBR, S., ZHANG, L., AND CLARK, D. D. An admission control algorithm for predictive real-time service (extended abstract). In Proceedingz of the Third International Workshop on Network and Operating System Support for Digital Audio and Video (San Diego, CA, Nov. 1992), IEEE, pp. 308-314. Google ScholarDigital Library
- 16.KAMITAKE, T., ANO StmA, T. Evaluation of an admission control scheme for an ATM network considering fluctuations in cell loss rate. In Proceeding8 of the Conference on Global Communications (GLOBECOM) (Dallas, Texas, Nov. 1989), IEEE, pp. 1774--1780.Google Scholar
- 17.KuttosB, J. On computing per-session performance bounds in high-speed multi-hop computer networks. In Sigmetricz 1991~ (New Port, Rhode Island, June 1992), ACM, pp. 128-139. Google Scholar
- 18.KI.~OSB, J. Open issues and challenges in providing quality of service guarantees in high-speed networks. A CM Computer Communication Review ~$, I (.Jan. 1993), 6-15. Google ScholarDigital Library
- 19.MITRA, D. Optimal design of windows for high speed data networks. In P~oceedings of the Con/erence on Computer Communications (IEEE Infocom) (San Francisco, CA, June 1990), IEEE, pp. 1156-1163.Google Scholar
- 20.MURATA, M., OIE, Y., SUDA, T., AND MIYAHAltA, H. Analysis of a discrete-time single-server queue with bursty inputs for traffic control in ATM networks. IEEE Journal on Selected Areas in Communications 8, 3 (Apr. 1990), 447-458.Google ScholarDigital Library
- 21.OHBA, Y., MUaATA, M., AND MIYAHARA, }I. Analysis of interdeparture processes for bursty traffic in ATM networks. IEEE Journal on Selected Areas in Communications 9, 3 (Apr. 1991), 468-476.Google ScholarDigital Library
- 22.PAl~_BKtt, A. K., AND GALLAGBP., R. G. A generalized processor sharing approach to flow control in integrated services networks -- the single node case. In Proceedings of the Conference on Computer Communications (IEEE Infocorn} (Florence, Italy, May 1992), vol. 2, IEEE, pp. 915-924 (7A.3). Google ScholarDigital Library
- 23.PAI~KH, A. K., AND GALLAGER, R. G. A generalized processor sharing approach to flow control in integrated services networks- the multiple node case. In Proceedings of the Conference on Computer Communications {IEEE In. focom) (San Francisco, CA, Mar. 1993), voI. 2, 1EEE, pp. 521-530 (SA.1).Google Scholar
- 24.PARBKH, A. K. J. A generalized processor sharing approach to fiotv control in integ~ted services nettvorlcz. PhD thcaiz, Massachusetts Institute of Technology, Cambridge, MA, Feb. 1992.Google Scholar
- 25.RASMUSSEN, C., AND SORBNSEN, J. A simple call acceptance procedure in an ATM network. Computer Net. tvorkz and ISDN Systems ttO, 1-5 (Dec. 1990), 197-202. ITC Specialist Seminar, 25-29 September 1989, Adelaide, Australia.Google Scholar
- 26.SAITO, H., AND SHiOMOTO, K. Dynamic call admission control in ATM networks. IEEE Journal on Selected Areas in Communications 9, 7 (Sept. 1991), 982-989.Google Scholar
- 27.SRIRAM, K., AND WHITT, W. Characterizing superposition arrival processes in packet multiplexers for voice and data. IEEE Journal on Selected Areas in Communications $AC-4, 6 (Sept. 1986), 833-846.Google Scholar
- 28.VE~, D. C., ZHANG, H., AND FBntt~I, D. Delay jitter control for real-time communication in a packet switching network. In Proceedings of Tricomm '9i (Chapel Hill, NC, Apr. 1991), IEEE.Google Scholar
- 29.WOODRm~F, G. M., A~'O KOSITPAmOON, R. Multimedis traffic management principles for guaranteed ATM network performance, iEEE Journal on Selected A~eas in Communications 8, 3 (Apr. 1990), 437-446.Google Scholar
- 30.YAP. ON, O., ANO SIp{, M. Calculating performance bounds in communication networks. In Proceedings o/ the Conference on Computer Communications (IEEE Infocom) (San Francisco, CA, Mar. 1993), vol. 2, IEEE, pp. sag-s46 (SA.a).Google Scholar
- 31.ZHANG, L. VirtualClock: A new traffic control algorithm for packet-~witchcd networks. A CM Tranzactionz on Computer S!tzternz 9, 2 (May 1991), 101-124. Google ScholarDigital Library
Index Terms
- On per-session end-to-end delay distributions and the call admission problem for real-time applications with QOS requirements
Recommendations
On Per-Session End-to-End Delay and the Call Admission Problem for Real-Time Applications with QOS Requirements
Quality of ServiceA crucial problem facing the designers and deployers of future high-speed networks is providing applications with quality of service (QOS) guarantees. For soft real-time applications, which are delay sensitive but loss tolerant, delay distribution is an ...
On per-session end-to-end delay distributions and the call admission problem for real-time applications with QOS requirements
A crucial problem facing the designers and deployers of future high-speed networks is providing applications with quality of service (QOS) guarantees. For soft real-time applications, which are delay sensitive but loss tolerant, delay distribution is an ...
Comments