Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

The Performance Analysis of Two-Class Priority Queueing in MPLS-Enabled IP Network

  • Conference paper
Networking - ICN 2005 (ICN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3421))

Included in the following conference series:

  • 726 Accesses

Abstract

This paper presents analysis of the performance modeling of the mean queue length and the mean queueing delay in MPLS (Multiprotocol Label Switching) LER (Label Edge Router) through the application of GE/G/1. We consider traffic with inter-arrival times of external arrivals at queue having generalised exponential (GE) distribution. The choice of the GE distribution is motivated that measurements of actual traffic or service times may be generally limited and only few parameters can be computed reliably and GE has a pseudo-momoryless property which makes the solution of queueing system and network analysis easily controlled or dealt with. From the analytical results we obtain the mean queue length and the mean queueing delay in a non-preemptive HOL (Head of Line) with two priority classes. We provide a framework including closed expressions and compare the mean queue lengths and the mean queueing delays at different traffic intensities. These numerical results can be useful for determining the amount of traffic entering from the external network for an MPLS LER system.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Le Faucheur, F., et al.: MPLS Support of Differentiated Services. RFC3270 (May 2002)

    Google Scholar 

  2. Kouvatsos, D.: Entropy maximization and queueing network models. Annals of Operation Research 48, 63–126 (1994)

    Article  MATH  Google Scholar 

  3. Kouvatsos, D.: A maximum entropy analysis of the G/G/1 at equilibrium. J. Opl. Soc. 39, 183–200 (1988)

    MATH  Google Scholar 

  4. Hwang, G.U., Soharby, K.: Modelling and analysis of a buffer in an ATM-based MPLS LER system, CQRS-06-3, Taipei, Taiwan, Globecom (2002)

    Google Scholar 

  5. Soo, H.M., Chung, J.-M.: Analysis of non-preemptive priority queueing of MPLS networks with bulk arrivals, pp. 81–83. IEEE, Los Alamitos (2002)

    Google Scholar 

  6. Demetres, K., Nasreddine, T.: A maximum entropy priority approximation for a stable G/G/1 queue, Acta Information 27, pp. 247-286 (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, YL., Chen, C. (2005). The Performance Analysis of Two-Class Priority Queueing in MPLS-Enabled IP Network. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31957-3_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25338-9

  • Online ISBN: 978-3-540-31957-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics