Capacity Allocation for Voice over IP Networks Using Maximum Waiting Time Models

  • S. Sharafeddine
  • N. Kongtong
  • Z. Dawy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3124)


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.


Outage Probability Priority Queue Traffic Class Complementary Cumulative Distribution Function Capacity Allocation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Shenker, S., Partridge, C., Guerin, R.: Specification of Guaranteed Quality of Service. Request for Comments RFC 2212, IETF (September 1997)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Schmitt, J., Hurley, P., Hollick, M., Steinmetz, R.: Per-Flow Guarantees under Class- Based Priority Queuing. In: Proceedings of Globecom 2003 (December 2003)Google Scholar
  7. 7.
    Karam, M., Tobagi, F.: Analysis of the Delay and Jitter of Voice Traffic Over the Internet. In: Proceedings of Infocom 2001 (April 2001)Google Scholar
  8. 8.
    Kleinrock, L.: Queueing Systems: Computer Applications, vol. 2. John Wiley and Sons, New York (1975)Google Scholar
  9. 9.
    ITU-T Recommendation G.108: Application of the E-Model: A Planning Guide (September 1999) Google Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    Jacobson, V., Nichols, K., Poduri, K.: The Virtual Wire ‘Per-Domain Behavior’: Analysis and Extensions. Internet Engineering Task Force (July 2000)Google Scholar
  12. 12.
    Blake, S., Black, D., Carlson, M.: An Architecture for Differentiated Services. Request for Comments RFC 2475, IETF (December 1998)Google Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Eckberg: The Single Server Queue with Periodic Arrival Process and Deterministic Service Times. IEEE Transactions on Communications Com-27(3), 556–562 (1979)CrossRefGoogle Scholar
  15. 15.
    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)CrossRefGoogle Scholar
  16. 16.
    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)CrossRefGoogle Scholar
  17. 17.
    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)Google Scholar
  18. 18.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • S. Sharafeddine
    • 1
  • N. Kongtong
    • 1
  • Z. Dawy
    • 2
  1. 1.Institute of Communication NetworksMunich University of TechnologyMunichGermany
  2. 2.Institute for Communications EngineeringMunich University of TechnologyMunichGermany

Personalised recommendations