Time-aware admission control on top of time-unaware network infrastructures

Authors:
S. D'Antonio;M. Esposito;S. P. Romano;G. Ventre
Affiliations:
University of Napoli 'Federico II', Computer Science, Via Claudio 21, 80124 Napoli, Italy;University of Napoli 'Federico II', Computer Science, Via Claudio 21, 80124 Napoli, Italy;University of Napoli 'Federico II', Computer Science, Via Claudio 21, 80124 Napoli, Italy;University of Napoli 'Federico II', Computer Science, Via Claudio 21, 80124 Napoli, Italy
Venue:
Computer Communications
Year:
2005

Citing 8
Cited 0

Resource sharing in advance reservation agents

Journal of High Speed Networks - Special issue on multimedia networking
Concepts for Resource Reservation in Advance

Multimedia Tools and Applications
Distributed Advance Reservation of Real-Time Connections

NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
Deploying Diffserv at the Network Edge for Tight SLAs, Part 1

IEEE Internet Computing
Call admission control schemes: a review

IEEE Communications Magazine
A management and control architecture for providing IP differentiated services in MPLS-based networks

IEEE Communications Magazine
Cadenus: creation and deployment of end-user services in premium IP networks

IEEE Communications Magazine
Equivalent capacity and its application to bandwidth allocation in high-speed networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Users conceive advance negotiation as the most natural way to subscribe to a service with quality guarantees. Regrettably, the existing network infrastructures are unable to process requests involving time as a Quality of Service parameter. Rather than designing a new integrated approach to time-aware resource management, in this paper we show how to build time-aware admission control on top of existing time-unaware solutions. Reuse of current achievements in the field of admission control is made possible by exploiting the orthogonality, which exists between the time dimension and the resource plane. Decomposition of functions and separation of concerns are the key aspects of our algorithm. The approach and the algorithm are presented in a formal way, and then analysed by means of practical examples. A scalability analysis is also conducted, which helps set the limits of applicability of our approach.