Abstract
Probing is a well-known admission control technique that can achieve high utilization and per-flow quality of service in a scalable way. We have recently introduced an extension to the basic probing technique, called ε-probing, to overcome a resource stealing problem that impairs the use of probing in systems with multiple service classes. In this paper we describe an experimental system that was designed to evaluate the effectiveness of both probing and ε-probing techniques. We have developed a software module that implements the probing functionality, which can be inserted in end hosts or edge routers. Several tests were carried out to study the effect of various system parameters in the performance of the probing techniques. The results clearly show that both probing techniques are able to accurately perform admission control while achieving high utilization. Moreover, they also show that in environments with multiple service classes such as DiffServ, ε-probing can eliminate the resource stealing problem, providing an effective solution to support per flow QoS without signaling and without maintaining flow state at core routers.
Chapter PDF
Similar content being viewed by others
References
G. Bianchi et al. Throughput analysis of end-to-end measurement-based admission control in ip. In Proceedings of IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.
K. Nichols et al. Two-bit differentiated services architecture for the Internet. Internet RFC 2638, 1999.
L. Breslau et al. Comments on the performance of measurement-based admission control algorithms. In Proceedings of IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.
L. Breslau et al. Endpoint admission control: Architectural issues and performance. In Proceedings of ACM SIGCOMM 2000, Stockholm, Sweden, August 2000.
L. Zhang et al. Rsvp: A new resource reservation protocol. In IEEE Network, volume 7, pages 8–18, September 1993.
S. Blake et al. An architecture for differentiated services. Internet RFC 2475, 1998.
S. Sargento et al. Resource stealing in endpoint controlled multi-class networks. In Proceedings of International Workshop on Digital Communications (Invited Paper), Taormina, Italy, September 2001.
V. Elek et al. Admission control based on end-to-end measurements. In Proceedings of IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.
R. Gibbens and F. Kelly. Distributed connection acceptance control for a connectionless network. In Proceedings of ITC’ 99, Edinburgh, UK, June 1999.
E. Knightly and N. Shroff. Admission control for statistical qos: Theory and practice. In IEEE Network, volume 13, pages 20–29, March 1999.
J. Wroclawski. Specification of the controlled-load network element service. Internet RFC 2211, 1997.
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
Sargento, S., Salgado, R., Carmo, M., Marques, V., Valadas, R., Knightly, E. (2002). An Experimental Study of Probing-Based Admission Control for DiffServ Architectures. 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_4
Download citation
DOI: https://doi.org/10.1007/3-540-47906-6_4
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