Abstract
As voice services impose stringent quality of service (QoS) guarantees to perform well over IP networks, large network resources should be allocated to their traffic class. It gets unaffordable when hard guarantees are required as in deterministic-based mechanisms such as the guaranteed services model of the integrated services (IntServ) architecture. However, the amount of network resources could be drastically decreased if only a small number of all voice connections are allowed to be negatively affected. In this work, a new capacity allocation method based on the maximum waiting time model is explored. It is established from the following concept: by providing statistical quality guarantees to those packets that experience the maximum waiting time among all packets of the active voice connections, all other packets are implicitly protected from excess delay and, thus, from service degradation. This method is investigated and mathematically analyzed for the voice service class in converged IP networks.
This work is funded by Siemens AG, ICN EN.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shenker, S., Partridge, C., Guerin, R.: Specification of Guaranteed Quality of Service. Request for Comments RFC 2212, IETF (September 1997)
Parekh, A.K., Gallager, R.G.: A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case. IEEE/ACM Transactions on Networking (April 1994)
Mandjes, M., van der Wal, K., Kooij, R., Bastiaansen, H.: End-to-End Delay Models for Interactive Services on a Large-Scale IP Network. In: Proceedings of the 7th IFIP Workshop on Modeling and Evaluation of ATM / IP Networks (June 1999)
Sharafeddine, S., Riedl, A., Totzke, J.: A Dimensioning Strategy for Almost Guaranteed Quality of Service in Voice over IP Networks. In: Proceedings of IEEE High Speed Networks and Multimedia Communications (HSNMC 2003) (July 2003)
Charny, Le Boudec, J.-Y.: Delay Bounds in a Network with Aggregate Scheduling. In: Proceedings of Quality of future Internet Services Workshop (QofIS 2000) (September 2000)
Schmitt, J., Hurley, P., Hollick, M., Steinmetz, R.: Per-Flow Guarantees under Class- Based Priority Queuing. In: Proceedings of Globecom 2003 (December 2003)
Karam, M., Tobagi, F.: Analysis of the Delay and Jitter of Voice Traffic Over the Internet. In: Proceedings of Infocom 2001 (April 2001)
Kleinrock, L.: Queueing Systems: Computer Applications, vol. 2. John Wiley and Sons, New York (1975)
ITU-T Recommendation G.108: Application of the E-Model: A Planning Guide (September 1999)
Sriram, K., Whitt, W.: Characterizing Superposition Arrival Processes in Packet Multiplexers for Voice and Data. IEEE Journal on Selected Areas in Communications SAC-4(6), 833–846 (1986)
Jacobson, V., Nichols, K., Poduri, K.: The Virtual Wire ‘Per-Domain Behavior’: Analysis and Extensions. Internet Engineering Task Force (July 2000)
Blake, S., Black, D., Carlson, M.: An Architecture for Differentiated Services. Request for Comments RFC 2475, IETF (December 1998)
Jia, W.-J., Wang, H.-X., Fang, J.-C., Zhao, W.: Delay Guarantees for Real-Time Traffic Flows with High Rate. In: Proceedings of ITC18 (August/September 2003)
Eckberg: The Single Server Queue with Periodic Arrival Process and Deterministic Service Times. IEEE Transactions on Communications Com-27(3), 556–562 (1979)
Humblet, P., Bhargava, A., Hluchyj, M.: Ballot Theorems Applied to the Transient Analysis of nD/D/1 Queues. IEEE/ACM Transactions on Networking 1(1), 81–95 (1993)
Roberts, J.W., Virtamo, J.T.: The Superposition of Periodic Cell Arrival Processes in an ATM Multiplexer. IEEE Transactions on Communications 39, 298–303 (1991)
Ott, T.J., Shantikumar, J.G.: On a Buffer Problem for Packetized Voice with N-Periodic Strongly Interchangeable Input Processes. Journal on Applied Probability, 630–646 (1991)
Hajek: A Queue with Periodic Arrivals and Constant Service Rate. In: Kelly, F.P. (ed.) Probability, Statistics and Optimization – A Tribute to Peter Whittle, pp. 147–158. John Wiley and Sons, Chichester (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sharafeddine, S., Kongtong, N., Dawy, Z. (2004). Capacity Allocation for Voice over IP Networks Using Maximum Waiting Time Models. In: de Souza, J.N., Dini, P., Lorenz, P. (eds) Telecommunications and Networking - ICT 2004. ICT 2004. Lecture Notes in Computer Science, vol 3124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27824-5_89
Download citation
DOI: https://doi.org/10.1007/978-3-540-27824-5_89
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22571-3
Online ISBN: 978-3-540-27824-5
eBook Packages: Springer Book Archive