Access the full text.
Sign up today, get DeepDyve free for 14 days.
ACM Transactions on Autonomous and Adaptive Systems
(2007)
Received January
G. Sakellari, M. D'Arienzo, E. Gelenbe (2006)
Admission Control in Self Aware Networks
S. Warshall (1962)
A Theorem on Boolean MatricesJ. ACM, 9
E. Gelenbe, R. Lent, A. Montuori, Zhiguang Xu (2002)
Cognitive packet networks: QoS and performanceProceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems
A. Ganesh, P. Key, Damien Polis, R. Srikant (2006)
Congestion notification and probing mechanisms for endpoint admission controlIEEE/ACM Transactions on Networking, 14
L. Breslau, E. Knightly, S. Shenker, I. Stoica, Hui Zhang (2000)
Endpoint admission control: architectural issues and performance
R. Guérin, L. Gün (1992)
A unified approach to bandwidth allocation and access control in fast packet-switched networks[Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications
E. Gelenbe, R. Lent, Zhiguang Xu (2001)
Design and performance of cognitive packet networksPerform. Evaluation, 46
S. Jamin, S. Shenker, P. Danzig (1997)
Comparison of measurement-based admission control algorithms for controlled-load serviceProceedings of INFOCOM '97, 3
H. Perros, K. Elsayed (1996)
Call admission control schemes: a reviewIEEE Commun. Mag., 34
(2001)
End-user multimedia QoS categories
David Tse, M. Grossglauser (1997)
Measurement-based call admission control: analysis and simulationProceedings of INFOCOM '97, 3
R. Gibbens, F. Kelly, P. Key (1995)
A Decision-Theoretic Approach to Call Admission Control in ATM NetworksIEEE J. Sel. Areas Commun., 13
Zesheng Chen, Lixin Gao, K. Kwiat (2003)
Modeling the spread of active wormsIEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 3
E. Gelenbe (1992)
Learning in the Recurrent Random Neural NetworkNeural Computation, 5
V. Fodor, G. Karlsson, R. Rönngren (2000)
Admission control based on end-to-end measurementsProceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 2
E. Gelenbe, G. Sakellari, M. D'Arienzo (2007)
Controlling Access to Preserve QoS in a Self-Aware NetworkFirst International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007)
E. Gelenbe, M. Gellman, R. Lent, Peixiang Liu, Pu Su (2004)
Autonomous smart routing for network QoSInternational Conference on Autonomic Computing, 2004. Proceedings.
R. Floyd (1962)
Algorithm 97: Shortest pathCommunications of the ACM, 5
S. Jamin, P. Danzig, S. Shenker, Lixia Zhang (1995)
A measurement-based admission control algorithm for integrated services packet networks
(2008)
Article 4, Publication date
R. Gibbens, F. Kelly (1999)
Distributed connection acceptance control for a connectionless network
E. Gelenbe, Zhiguang Xu, Esin Seref (1999)
Cognitive packet networksProceedings 11th International Conference on Tools with Artificial Intelligence
G. Bianchi, A. Capone, C. Petrioli (2000)
Throughput analysis of end-to-end measurement-based admission control in IPProceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 3
R. Guérin, H. Ahmadi, M. Naghshineh (1991)
Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed NetworksIEEE J. Sel. Areas Commun., 9
E. Gelenbe, Xiaowen Mang, R. Onvural (1996)
Diffusion Based Statistical Call Admission Control in ATMPerform. Evaluation, 27/28
S. Jamin, P. Danzig, S. Shenker, Lixia Zhang (1997)
A measurement-based admission control algorithm for integrated service packet networksIEEE/ACM Trans. Netw., 5
Coskun Cetinkaya, E. Knightly (2000)
Egress admission controlProceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 3
S. Floyd (1996)
Comments on Measurement-based Admissions Control for Controlled-Load Services
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.
ACM Transactions on Autonomous and Adaptive Systems (TAAS) – Association for Computing Machinery
Published: Mar 1, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.