skip to main content
research-article

Admission of QoS aware users in a smart network

Published: 27 March 2008 Publication History

Abstract

Smart networks have grown out of the need for stable, reliable, and predictable networks that will guarantee packet delivery under Quality of Service (QoS) constraints. In this article we present a measurement-based admission control algorithm that helps control traffic congestion and guarantee QoS throughout the lifetime of a connection. When a new user requests to enter the network, probe packets are sent from the source to the destination to estimate the impact that the new connection will have on the QoS of both the new and the existing users. The algorithm uses a novel algebra of QoS metrics, inspired by Warshall's algorithm, to look for a path with acceptable QoS values to accommodate the new flow. We describe the underlying mathematical principles and present experimental results obtained by evaluating the method in a large laboratory test-bed operating the Cognitive Packet Network (CPN) protocol.

References

[1]
Bianchi, G., Capone, A., and Petrioli, C. 2000. Throughput analysis of end-to-end measurement-based admission control in IP. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000). Tel Aviv, Israel, 1461--1470.
[2]
Breslau, L., Knightly, E. W., Shenker, S., Stoica, I., and Zhang, H. 2000. Endpoint admission control: architectural issues and performance. In Proceedings of ACM Special Interest Group on Data Communications (SIGCOMM 2000). Stockholm, Sweden, 57--70.
[3]
Cetinkaya, C. and Knightly, E. W. 2000. Egress admission control. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000). Tel Aviv, Israel, 1471--1480.
[4]
Chen, Z., Gao, L., and Kwiat, K. 2003. Modeling the spread of active worms. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003). San Francisco, CA, USA.
[5]
Elek, V., Karlsson, G., and Ronngren, R. 2000. Admission control based on end-to-end measurements. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2000). Vol. 2. Tel Aviv, Israel, 623--630.
[6]
Floyd, R. W. 1962. Algorithm 97: Shortest path. Comm. ACM 5, 6 (June), 345.
[7]
Floyd, S. 1996. Comments on measurement-based admissions control for controlled-load services. Tech. rep., Lawrence Berkeley Laboratory. (July).
[8]
Ganesh, A. J., Key, P., Polis, D., and Srikant, R. 2005. Congestion notification and probing mechanisms for endpoint admission control. IEEE/ACM Trans. Netw. 14, 3 (June), 568--578.
[9]
Gelenbe, E. 1993. Learning in the recurrent random neural network. Neural Computation 5, 1 (Jan.), 154--164.
[10]
Gelenbe, E., Gellman, M., Lent, R., Liu, P., and Su, P. 2004. Autonomous smart routing for network qos. In Proceedings of the First International Conference on Autonomic Computing (ICAC). New York, NY, 232--239.
[11]
Gelenbe, E., Lent, R., Montuori, A., and Xu, Z. 2002. Cognitive packet networks: QoS and performance. In Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02). IEEE Computer Society, Fort Worth, TX, 3--12. Opening Keynote Paper.
[12]
Gelenbe, E., Lent, R., and Xu, Z. 2001. Design and performance of cognitive packet networks. Performance Evaluation 46, 2-3 (Oct.), 155--176.
[13]
Gelenbe, E., Mang, X., and Oenvural, R. 1996. Diffusion based statistical call admission control in ATM. Performance Evaluation 27/28, (Oct.), 411--436.
[14]
Gelenbe, E., Sakellari, G., and D' Arienzo, M. 2007. Controlling access to preserve QoS in a self-aware network. In Proceedings of the First IEEE International Conference on Self-Adaptive and Self-Orgnizing Systems (SASO 2007). Boston, MA.
[15]
Gelenbe, E., Xu, Z., and Seref, E. 1999. Cognitive packet networks. In Proceedings of the 11th International Conference on Tools with Artificial Intelligence (ICTAI '99). IEEE Computer Society Press, Chicago, IL, 47--54.
[16]
Gibbens, R. J. and Kelly, F. 1999. Distributed connection acceptance control for a connectionless network. In Proceedings of the 16th International Teletraffic Congress (ITC 99). Vol. 2. Edinburgh, UK, 941--52.
[17]
Gibbens, R. J., Kelly, F. P., and Key, P. B. 1995. A decision-theoretic approach to call admission control in atm networks. IEEE J. Sel. Areas Comm. 13, 6 (Feb.), 1101--1114.
[18]
Guerin, R., Ahmadi, H., and Naghshineh, M. 1991. Equivalent capacity and its application to bandwidth allocation in high-speed networks. IEEE J. Sel. Areas Comm. 9, 7 (Sep.), 968--981.
[19]
Guerin, R. and Gun, L. 1992. A unified approach to bandwidth allocation and access control in fast packet-switched networks. In Proceeding of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'92). Vol. 1. Florence, Italy, 1--12.
[20]
ITU. 2001. End-user multimedia QoS categories. Tech. rep., ITU-T Recommendation G.1010. (Nov.).
[21]
Jamin, S., Danzig, P., Shenker, S., and Zhang, L. 1997a. A measurement-based admission control algorithm for integrated services packet networks. IEEE/ACM Trans. Netw. 5, 1 (Aug./Sep.), 56--70.
[22]
Jamin, S., Shenker, S. J., and Danzig, P. B. 1997b. Comparison of measurement-based admission control algorithms for controlled-load service. In Proceedings of the Conference on Computer Communications (IEEE INFOCOM '97). Vol. 3. IEEE Computer Society Press, Kobe, Japan, 973--980.
[23]
Perros, H. G. and Elsayed, K. M. 1996. Call admission control schemes: A review. IEEE Comm. Mag. 34, 11 (Nov.), 82--91.
[24]
Sakellari, G., D' Arienzo, M., and Gelenbe, E. 2006. Admission control in self aware networks. In Proceedings of the 49th Annual IEEE Global Telecommunications Conference (GLOBECOM 2006). San Francisco, CA.
[25]
Tse, D. and Grossglauser, M. 1997. Measurement-based call admission control: Analysis and simulation. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '97). Vol. 3. IEEE Computer Society Press, Kobe, Japan, 981--989.
[26]
Warshall, S. 1962. A theorem on Boolean matrices. J. ACM 9, 1 (Jan.), 11--12.

Cited By

View all

Index Terms

  1. Admission of QoS aware users in a smart network

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Transactions on Autonomous and Adaptive Systems
      ACM Transactions on Autonomous and Adaptive Systems  Volume 3, Issue 1
      March 2008
      118 pages
      ISSN:1556-4665
      EISSN:1556-4703
      DOI:10.1145/1342171
      Issue’s Table of Contents
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 27 March 2008
      Accepted: 01 November 2007
      Revised: 01 September 2007
      Received: 01 January 2007
      Published in TAAS Volume 3, Issue 1

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. Measurement-based admission control
      2. cognitive packet network
      3. quality of service
      4. self-aware

      Qualifiers

      • Research-article
      • Research
      • Refereed

      Funding Sources

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)3
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 06 Nov 2024

      Other Metrics

      Citations

      Cited By

      View all

      View Options

      Get Access

      Login options

      Full Access

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media