Abstract
It is widely recognized that the maximum number of heavy-tailed flows that can be admitted to a network link, while meeting QoS targets, can be much lower than in the case of markovian flows. In fact, the superposition of heavy-tailed flows shows long range dependence (self-similarity), which has a detrimental impact on network performance. In this paper, we show that long range dependence is significantly reduced when traffic is controlled by a Measurement-Based Admission Control (MBAC) algorithm. Our results appear to suggest that MBAC is a value added tool to improve performance in the presence of self-similar traffic, rather than a mere approximation for traditional (parameter-based) admission control schemes.
This research is supported by European Community and MIUR in the frame of the Pollens project (ITEA, if00011a).
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
W. Leland, M. Taqqu, W. Willinger, D. Wilson, “On the Self-Similar Nature of Ethernet Traffic”, Trans. on Networking, Vol. 2, No. 1, pp. 1–15, Feb. 1994.
J. Beran, R. Sherman, W. Willinger, and M.S. Taqqu, “Variable-bit-rate video traffic and long-range dependence”, IEEE Transactions on Communications, 1995
K. Park, G.T. Kim, M.E. Crovella, “On the Relationship Between File Sizes, Transport Protocols, and Self-Similar Network Traffic”, Proceedings of the International Conference on Network Protocols, pp. 171–180, October, 1996.
M.E. Crovella and A. Bestavros, “Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes”, Trans. on Networking, 5(6):835–846, Dec. 1997.
A. Feldmann, A.C. Gilbert, W. Willinger, “Data network as cascades: Investigating the multifractal nature of the Internet WAN Traffic”, Computer Communications Review 28 (1998)
W. Willinger, M. Taqqu, R. Sherman, D. Wilson, “Self-Similarity Through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level”, Trans. on Networking, Vol. 5, No. 1, pp. 71–86, Feb. 1997.
[edited by] K. Park and W. Willinger “Self-Similar Network Traffic and Performance Evaluation”, Wiley Inter-Science, 2000
R. Gibbens, F.P. Kelly, “Measurement-Based Connection Admission Control”, Proc. of 15th International Teletraffic Congress, June 1997
S. Jamin, P.B. Danzig, S. Shenker, L.A. Zhang, “A measurement-based admission control algorithm for integrated services packet networks”, Trans. on Networking Vol. 5, No. 1, Feb 1997, pp. 56–70.
M. Grossglauser, D. Tse, “A Framework for Robust Measurement Based Admission Control”, Trans. on Networking Vol. 7, No. 3, July 1999.
L. Breslau, S. Jamin, S. Shenker, “Comments on the Performance of Measurement Based Admission Control Algorithms”, Proc. of IEEE Infocom 2000, Tel Aviv, Israel, March 2000.
V. Bolotin, “Modeling Call Holding Time Distributions for CCS Network Design and Performance Analysis”, IEEE Journal on Selected Areas in Communications 12, 3 (Apr. 1994), 433–438.
J. Beran, “Statistics for long-memory processes”, Chapman & Hall, 1994
P. Abry, D. Veitch, “Wavelet Analysis of Long-Range Dependent Traffic”, IEEE Transactions on Information Theory, 44(1), pp. 2–15, January 1998.
M. Grossglauser and J. Bolot, “On the Relevance of Long Range Dependence in Network Traffic”, Trans. on Networking, 1998.
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
Bianchi, G., Mancuso, V., Neglia, G. (2002). Is Admission-Controlled Traffic Self-Similar?. In: Gregori, E., Conti, M., Campbell, A.T., Omidyar, G., Zukerman, M. (eds) NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications. NETWORKING 2002. Lecture Notes in Computer Science, vol 2345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47906-6_26
Download citation
DOI: https://doi.org/10.1007/3-540-47906-6_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43709-3
Online ISBN: 978-3-540-47906-2
eBook Packages: Springer Book Archive