Admission of QoS aware users in a smart network

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: Lee Breslau , Edward W. Knightly , Scott Shenker , Ion Stoica , Hui Zhang, Endpoint admission control: architectural issues and performance, Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, p.57-69, August 28-September 01, 2000, Stockholm, Sweden
• 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: Robert W. Floyd, Algorithm 97: Shortest path, Communications of the ACM, v.5 n.6, p.345, June 1962 [doi>10.1145/367766.368168]
• 7: Floyd, S. 1996. Comments on measurement-based admissions control for controlled-load services. Tech. rep., Lawrence Berkeley Laboratory. (July).
• 8: Ayalvadi J. Ganesh , Peter B. Key , Damien Polis , R. Srikant, Congestion notification and probing mechanisms for endpoint admission control, IEEE/ACM Transactions on Networking (TON), v.14 n.3, p.568-578, June 2006 [doi>10.1109/TNET.2006.876180]
• 9: Erol Gelenbe, Learning in the recurrent random neural network, Neural Computation, v.5 n.1, p.154-164, Jan. 1993 [doi>10.1162/neco.1993.5.1.154]
• 10: Erol Gelenbe, Autonomous Smart Routing for Network QoS, Proceedings of the First International Conference on Autonomic Computing, p.232-239, May 17-18, 2004
• 11: E. Gelenbe , R. Lent , A. Montuori , Z. Xu, Cognitive Packet Networks: QoS and Performance, Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02), p.3, October 11-16, 2002
• 12: Erol Gelenbe , Ricardo Lent , Zhiguang Xu, Design and performance of cognitive packet networks, Performance Evaluation, v.46 n.2-3, p.155-176, October 2001 [doi>10.1016/S0166-5316(01)00042-6 ]
• 13: Erol Gelenbe , Xiaowen Mang , Raif Önvural, Diffusion based statistical call admission control in ATM, Performance Evaluation, 27-28, p.411-436, Oct. 1996 [doi>10.1016/0166-5316(96)00033-8 ]
• 14: Erol Gelenbe , Georgia Sakellari , Maurizio D'Arienzo, Controlling Access to Preserve QoS in a Self-Aware Network, Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems, p.205-213, July 09-11, 2007 [doi>10.1109/SASO.2007.15]
• 15: Erol Gelenbe , Zhiguang Xu , Esin Seref, Cognitive Packet Networks, Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence, p.47, November 08-10, 1999
• 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: Roch Guérin , Levent Gün, A unified approach to bandwidth allocation and access control in fast packet-switched networks, Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1), p.1-12, May 1992, Florence, Italy
• 20: ITU. 2001. End-user multimedia QoS categories. Tech. rep., ITU-T Recommendation G.1010. (Nov.).
• 21: Sugih Jamin , Peter B. Danzig , Scott J. Shenker , Lixia Zhang, A measurement-based admission control algorithm for integrated service packet networks, IEEE/ACM Transactions on Networking (TON), v.5 n.1, p.56-70, Feb. 1997 [doi>10.1109/90.554722]
• 22: Sugih Jamin , Scott J. Shenker , Peter B. Danzig, Comparison of Measurement-based Admission Control Algorithms for Controlled-Load Service, Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, p.973, April 09-11, 1997
• 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: D. Tse , M. Grossglauser, Measurement-Based Call Admission Control: Analysis and Simulation, Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, p.981, April 09-11, 1997
• 26: Stephen Warshall, A Theorem on Boolean Matrices, Journal of the ACM (JACM), v.9 n.1, p.11-12, Jan. 1962 [doi>10.1145/321105.321107]

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.3 Network Operations

General Terms:
Algorithms, Measurement, Performance

Keywords:
Measurement-based admission control, cognitive packet network, quality of service, self-aware