Abstract
In MPLS network multiple LSPs shares bandwidth of a physical link. In order to perform a traffic engineering function it is necessary to estimate allowed and available bandwidth within assigned virtual bandwidth for a LSP. The paper suggests a novel algorithm to compute the expected period exceeding assigned virtual bandwidth, which computes packet loss probability in transport system shared with multiple LSPs in MPLS. The algorithm is based on the discrete-time Markov BD process at burst level. And it uses the devised concepts from first passage time, and it is efficiently applied to the computation of packet loss statistics and call admission control in burst scale traffic model of MPLS network.
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.
Similar content being viewed by others
References
D. Anick, D. Mitra and M. M. Sondhi, “ Stochastic Theory of a Data-Handling Systems with Multiple Sources,” Bell Systems Technical Journal vol 61. No. 8 pp 1971–1894, Oct, 1982
S P Miller and C B Cotner, “The Quality Challenege... Now and For the Future...”, ICDSC, May 1995
Danel P. Heyman and Matthew J. Sobel, “Stochastic Models in Operations Research-Volume I,” McGraw Hill Book Company pp 38–104, 1982
Fumio Ishizaki and Testuya Takine, “Cell Loss probability Approximation and Their Application to call Admission Control,” Advances in Performamce Analysis Vol. 2 No. 3, pp225–258, 1999
Ilyoung Chong, “Cost Minimization Allocation (CMA) Algorithm”, Technical Report, Univ. of Massachusetts, 1992.
Ilyoung Chong, “Traffic Control at Burst Level”, Ph.D. Thesis, Univ. of Massachusetts, 1992
T. Kodama and T Fukuda, “Customer Premises Networks of the Future,” IEEE Communications Magazine, Feb. 1994
Roger C. F. Tucker, “Accurate Method for Analysis of a Packet Speech Multiplexer with Limited Delay,” IEEE Trans. On Communications, vol 36, No. 4, April 1988
Danel P. Heyman and Matthew J. Sobel, “Stochastic Models in Operations Research-Volume I,” McGraw Hill Book Company pp 38–104, 1982
Daniel P. Heyman and Mathew J. Sobel, “Stochastic Models in Operations Research-Volume I,” Mcgraw-Hill Book Company, pp 38–104, 1988
Hans Kroner, “Staictical Multiplexing of Sporadic Sources-Exact and Approximate Performance Aalysis, ” Proceedings of 13th ITC’ 91, pp723–729, 1991
Roch Guerin, Hamid Ahmadi and Mahmoud Naghshineh, “Equivalent Capacity and iys Aplication to Bandwidth Allocation in High Speed Networks,” IBM Research Report RC 16317, 1990
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chong, I., Lee, S. (2002). Approximated Overpassing Period to Virtual Capacity of LSP in MPLS. In: Chong, I. (eds) Information Networking: Wired Communications and Management. ICOIN 2002. Lecture Notes in Computer Science, vol 2343. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45803-4_5
Download citation
DOI: https://doi.org/10.1007/3-540-45803-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44256-1
Online ISBN: 978-3-540-45803-6
eBook Packages: Springer Book Archive