Browse DORAS
Browse Theses
Search
Latest Additions
Creative Commons License
Except where otherwise noted, content on this site is licensed for use under a:

RSVP reservation gaps: problems and solutions

Dharmalingam, Kalaiarul and Kowalik, Karol and Collier, Martin (2003) RSVP reservation gaps: problems and solutions. In: ICC 2003 - IEEE International Conference on Communications, 11-15 May 2003, Anchorage, Alaska, USA. ISBN 0-7803-7802-4

Full text available as:

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
245Kb

Abstract

High-end networking applications such as e-commerce, multimedia, distributed data analysis and advanced collaborative environments feature demanding end-to-end quality of service (QoS) requirements. Due to the heterogeneity exhibited by the Internet, a route from source to destination for such a flow may not be available which is comprised exclusively of QoS supporting path segments. Hence the flow must traverse one or more non-QoS path segments referred to here as reservation gaps. In this paper we study the problem of reservation gaps and their impact on QoS and present a solution to address the deficiencies caused by such gaps, using an active network approach based on the mobile agent paradigm. Furthermore, to improve the reliability in path selection and to minimise the influence of reservation gaps along the path of a QoS flow, we propose two routing algorithms, the most reliable shortest path (MS-R) algorithm and the shortest - most reliable path (S-MR) algorithm, that select paths with the minimum number of reservation gaps. The active network based solution we propose works autonomously and scales to large networks such as the Internet. We demonstrate the advantages of such a solution using simulations which compares operational characteristics of QoS flows when traversing non-managed and actively managed reservation gaps. We also demonstrate the benefits of employing a routing algorithm such as MR-S or S-MR that accounts for reservation gaps in place of conventional shortest-path routing algorithms.

Item Type:Conference or Workshop Item (Paper)
Event Type:Conference
Refereed:Yes
Uncontrolled Keywords:Internet; mobile agents; quality of service; routing protocols; telecommunication network management;
Subjects:Engineering > Telecommunication
DCU Faculties and Centres:Research Initiatives and Centres > Research Institute for Networks and Communications Engineering (RINCE)
Published in:Proceedings of the IEEE International Conference on Communications, 2003. . Institute of Electrical and Electronics Engineers. ISBN 0-7803-7802-4
Publisher:Institute of Electrical and Electronics Engineers
Official URL:http://dx.doi.org/10.1109/ICC.2003.1203870
Copyright Information:©2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
ID Code:15510
Deposited On:19 Jul 2010 14:30 by DORAS Administrator. Last Modified 19 Jul 2010 14:30

Download statistics

Archive Staff Only: edit this record