Skip to main content
SpringerLink
Log in

General Connection Blocking Bounds and an Implication of Billing for Provisioned Label–Switched Routes in an MPLS Internet Cloud

  • Conference paper
Networking — ICN 2001 (ICN 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2094))

Included in the following conference series:

  • 440 Accesses

Abstract

Two related problems of traffic shaping are considered in this paper. Both are applicable to the context of provisioned MPLS labelswitched routes. The first involves a novel application of traffic shaping to connection-level arrival processes. A type of Erlang-B bound is derived. The second involves the transmission of secondary best-effort data traffic into a provisioned variable bit-rate (VBR) “channel” handling a primary (real-time) flow.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Baccelli and P. Bremaud. Elements of Queueing Theory. Springer-Verlag, Application of Mathematics: Stochastic Modelling and Applied Probability, No. 26, New York, NY, 1991.

    Google Scholar 

  2. K. Chakraborty, L. Tassiulas, and G. Kesidis. Reducing connection blocking likelihoods by traffic shaping. Technical report, University of Maryland I.S.R. Technical Report, 2000.

    Google Scholar 

  3. R.L. Cruz. Quality of service guarantees in virtual circuit switched networks. IEEE JSAC, Vol. 13, No. 6:pages 1048–1056, Aug. 1995.

    Google Scholar 

  4. M.W. Garret and W. Willinger. Analysis, modeling and generation of self-similar VBR video traffic. In Proc. ACM SIGCOMM, pages 269–280, 1994.

    Google Scholar 

  5. D. Heyman, A. Tabatabai, and T.V. Lakshman. Statistical analysis and simulation study of video teleconferencing traffic in ATM networks. IEEE Trans. Circuits and Systems for Video Tech., Vol. 2, No. 1:pages 49–59, March 1992.

    Article  Google Scholar 

  6. F.P. Kelly. Effective bandwidths of multi-class queues. Queueing Systems, Vol. 9, No. 1:pp. 5–16, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  7. F.P. Kelly. Charging and accounting for bursty connections. In Internet Economics (Editors L.W. McKnight and J.P. Bailey), pages 253–278. MIT Press, 1997.

    Google Scholar 

  8. G. Kesidis. ATM Network Performance. Kluwer Academic Publishers, Boston, MA, Second Edition, 1999.

    Google Scholar 

  9. G. Kesidis. Scalable resources management for MPLS over diffserv. In Proc. SPIE ITCom 2001, Denver, CO, Aug. 2001.

    Google Scholar 

  10. G. Kesidis, K. Chakraborty, and L. Tassiulas. Traffic shaping for a loss system. IEEE Communication Letters, Vol. 4, No. 12:pp. 417–419, Dec. 2000.

    Article  Google Scholar 

  11. G. Kesidis and T. Konstantopoulos. Extremal traffic and worst-case performance for a queue with shaped arrivals. In Analysis of Communication Networks: Call Centres, Traffic and Performance, edited by D.R. McDonald and S.R.E. Turnerat, Fields Institute Communications/AMS, ISBN 0-8218-1991-7, 2000 (proceedings of the Nov. 1998 conference at the Fields Institute, Toronto).

    Google Scholar 

  12. E. Livermore, R.P. Skillen, M. Beshai, and M. Wernik. Architecture and control of an adaptive high-capacity flat network. IEEE Communications Magazine, pages 106–112, May 1998.

    Google Scholar 

  13. J.M. McManus and K.W. Ross. A dynamic programming methodology for managing prerecorded VBR sources in packet-switched networks. Telecommunications Systems, 9, 1998.

    Google Scholar 

  14. K.W. Ross. Multiservice Loss Models for Broadband Telecommunication Networks. Springer-Verlag, London, 1995.

    MATH  Google Scholar 

  15. J. Salehi, Z.-L. Zhang, J. Kurose, and D. Towsley. Supporting stored video: Reducing variability and end-to-end resource requirements via optimal smoothing. In ACM SIGMETRICS, May 1996.

    Google Scholar 

  16. D. Songhurst and F.P. Kelly. Charging schemes for multiservice networks. In ITC-15, Washington, DC, V. Ramaswami and P.E. Wirth (Editors), pages 781–790. Elsevier Science, B.V., 1997.

    Google Scholar 

  17. P.P. Tang and T.-Y. C. Tai. Network traffic characterization using token bucket model. In Proc. IEEE INFOCOM’99, New York, April 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. EE and CS&E Depts, Pennsylvania State University, University Park, PA, 16802, USA

    George Kesidis

  2. E&CE Dept, University of Maryland, College Park, MD, 20742, USA

    Leandros Tassiulas

Authors
  1. George Kesidis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leandros Tassiulas
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kesidis, G., Tassiulas, L. (2001). General Connection Blocking Bounds and an Implication of Billing for Provisioned Label–Switched Routes in an MPLS Internet Cloud. In: Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47734-9_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-47734-9_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42303-4

  • Online ISBN: 978-3-540-47734-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation