Scaling of buffer and capacity requirements of voice traffic in packet networks

21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future - Final Programme

Volumn , Issue , 2009, Pages

  Ciucu, Florin ^a   Hohlfeld, Oliver ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER OVERFLOWS; CAPACITY REQUIREMENT; DELAY BOUND; DELAY GUARANTEE; END TO END DELAY; FLOW CAPACITY; HIGH CAPACITY; NETWORK NODE; NETWORK RESOURCE; NUMERICAL EXAMPLE; PACKET LOSS PROBABILITY; PUBLIC SWITCHED TELEPHONE NETWORK; STATISTICAL MULTIPLEXING; VOICE COMMUNICATION; VOICE TRAFFIC;

PACKET LOSS; TELEPHONE; TELEPHONE CIRCUITS;

SWITCHING CIRCUITS;

EID: 70649083401     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. D. Anick, D. Mitra, and M. Sondhi. Stochastic theory of a datahandling system with multiple sources. Bell Systems Technical Journal, 61(8):1871-1894, Oct. 1982.
2. G. Appenzeller, I. Keslassy, and N. McKeown. Sizing router buffers. In Proceedings of ACM Sigcomm, pages 281-292, September 2004.
3. R. R. Bahadur and R. R. Rao. On deviations of the sample mean. AMS, 31(2):1015-1027, 1960.
4. R. Boorstyn, A. Burchard, J. Liebeherr, and C. Oottamakorn. Effective envelopes: Statistical bounds on multiplexed traffic in packet networks. In Proceedings of IEEE Infocom 2000, pages 1223-1232, Tel Aviv, Mar. 2000.
5. D. Botvich and N. Duffield. Large deviations, economies of scale, and the shape of the loss curve in large multiplexers. Queueing Systems, 20:293-320, 1995.
6. J. Y. L. Boudec and P. Thiran. Network Calculus. Springer Verlag, Lecture Notes in Computer Science, LNCS 2050, 2001.
7. E. Buffet and N. G. Duffield. Exponential upper bounds via martingales for multiplexers with Markovian arrivals. Journal of Applied Probability, 31(4):1049-1060, Dec. 1994.
8. C.-S. Chang. Stability, queue length, and delay of deterministic and stochastic queueing networks. IEEE Transactions on Automatic Control, 39(5):913-931, May 1994.
9. C.-S. Chang. Performance Guarantees in Communication Networks. Springer Verlag, 2000.
10. C.-S. Chang and J. Cheng. Computable exponential bounds for intree networks with routing. In Proceedings of IEEE Infocom, pages 197-204, 1995.
11. G. Choudhury, D. Lucantoni, and W. Whitt. Squeezing the most out of ATM. IEEE Transactions on Communications, 44(2):203-217, Feb. 1996.
12. th International Teletraffic Congress (ITC), June 2007.
13. F. Cicu and J. Liebeherr. A Case for Decomposition of FIFO Networks. To appear in Proceedings of IEEE Infocom 2009. Available from http://www.cs. virginia.edu/-fc9h/lib/fifo09.pdf.
14. C. Courcoubetis and R. Weber. Buffer overflow asymptotics for a buffer handling many traffic sources. Journal of Applied Probability, 33(3):886-903, 1996.
15. R. Cruz. A calculus for network delay, parts I and II. IEEE Transactions on Information Theory, 37(1):114-141, Jan. 1991.
16. R. L. Cruz. SCED+: Efficient management of quality of service guarantees. In Proceedings of IEEE Infocom, pages 625-634, Mar. 1998.
17. J. N. Daigle and J. D. Langford. Models for analysis of packet voice communications systems. IEEE Journal on Selected Areas in Communications, 4(6):847-855, Sept. 1986.
18. M. Enachescu, Y. Ganjali, A. Goel, N. Mckeown, and T. Roughgarden. Routers with very small buffers. In Proceedings of IEEE Infocom, 2006.
19. A. Erlang. The theory of probabilities and telephone conversations. Nyt Tidsskrift for Matematik B, 20:33-39, 1909 (in Danish).
20. A. Erlang. Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges. Elektrotkeknikeren, 13, 1917 (in Danish).
21. D. Y. Eun and N. B. Shroff. Network decomposition: theory and practice. IEEE/ACM Transactions on Networking, 13(3):526-539, 2005.
22. K. Feher. Telecommunications Measurements, Analysis, and Instrumen- tation. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1987.
23. th International Workshop on Quality of Service (IWQoS), pages 261-270, June 2006.
24. International Telecommunication Union. The E-model, a computational model for use in transmission planning. Recommendation G.107, Telecommunication Standardization Sector of ITU, 2005.
25. F. P. Kelly. Notes on effective bandwidths. In Stochastic Networks: Theory and Applications. (Editors: F.P. Kelly, S. Zachary and I.B. Ziedins) Royal Statistical Society Lecture Notes Series, 4, pages 141- 168. Oxford University Press, 1996.
26. E. W. Knightly. Second moment resource allocation in multi-service networks. In Proceedings of ACM Sigmetrics, pages 181-191, June 1997.
27. J. Liebeherr. A note on statistical multiplexing and scheduling in video networks at high data rates. In The Internet as a Large-Scale Complex System (Eds: K. Park, W. Willinger), pages 179-201. Oxford University Press, 2005.
28. N. B. Likhanov and R. Mazumdar. Cell loss asmptotics in buffer fed with large number of independent stationary sources. In Proceedings of IEEE Infocom, pages 339-346, 1998.
29. Z. Liu, P. Nain, and D. Towsley. Exponential bounds with applications to call admission. Journal of the ACM, 44(3):366-394, May 1997.
30. M. Montgomery and G. de Veciana. On the relevance of time scales in performance oriented traffic characterizations. In Proceedings of IEEE Infocom, pages 513-520, 1996.
31. M. Schwartz. Broadband Integrated Networks. Prentice Hall, 1996.
32. G. de Veciana and G. Kesidis. Bandwidth allocation for multiple qualities of service using generalized processor sharing. IEEE Transactions on Information Theory, 42(1):268-272, Jan. 1996.
33. C. Villamizar and C. Song. High performance TCP in ANSNET. SIGCOMM Computer Communication Review, 24(5):45-60, 1994.
34. M. Vojnovic and J.-Y. L. Boudec. Stochastic analysis of some expedited forwarding networks. In Proceedings of IEEE Infocom, pages 1004- 1013, June 2002.
35. D. Wischik. The output of a switch, or, effective bandwidths for networks. Queueing Systems, 32:383-396, 1999.
36. A. Wong. Queueing analysis for ATM switching of continuous bit oriented traffic - a recursive computation method. In Proceedings of IEEE Globecom, pages 1438 - 1444, 1990.
37. O. Yaron and M. Sidi. Performance and stability of communication networks via robust exponential bounds. IEEE/ACM Transactions on Networking, 1(3):372-385, June 1993.