Advance reservations of bandwidth in computer networks

In this thesis, the impact of using advance reservations of bandwidth in a computer network on the performance for both clients and operators of the network is examined. Based on an architecture that uses multi-protocol label switching (MPLS) controlled by bandwidth brokers, a number of services that compared to todays best-effort or immediate reservation networks provide an enhanced functionality for clients were developed. These services allow clients to specify requests in a less stringent way than currently necessary, for example, it is possible to define only the amount of data to be transmitted between two network endpoints and the management system then determines suitable transmission parameters such as start and stop time and transmission rate. This functionality provides reliable feedback to clients and can serve as a foundation for providing service-level agreements, e.g., guaranteeing deadlines for the transmission of a certain amount of data. The additional services can also be used by network operators to improve the overall utilization of the network. In addition, the various opportunities of using the additional temporal dimension of the advance reservation service are suitable to improve the network performance. It can be shown that the amount of blocked requests and bandwidth can be considerably decreased making use of both services and the additional information available in the given environment. Besides the achievable throughout and amount of admitted requests, the term performance in the context of advance reservation systems also covers other aspects such as failure recovery strategies and the processing time required by the network management system. In the thesis, several strategies to be applied in case of link failures are outlined and examined with respect to their applicability and achievable performance. For example, it can be shown that it is worthwhile to consider not only flows which are active at the time a failure occurs but also to take inactive but already admitted flows into account in order to achieve the best possible performance. In addition to failure recovery, also the processing speed of the management system is of importance. For that purpose, in particular the data structures used to store the current and future network status need to be examined since they dominate the processing time of the management system. Two data structures, arrays and a tree which was especially designed for this purpose were examined, showing that arrays are superior with respect to processing speed and memory consumption in almost any environment.

[1]  Yakov Rekhter,et al.  Mpls: Technology and Applications , 2000 .

[2]  Hamid Aghvami,et al.  Reliable RSVP path reservation for multimedia communications under an IP micromobility scenario , 2002, IEEE Wirel. Commun..

[3]  Peter Steenkiste,et al.  Quality-of-Service Routing for Traffic with Performance Guarantees , 1997 .

[4]  Alexander Schill,et al.  Design and evaluation of an advance reservation protocol on top of RSVP , 1998, Broadband Communications.

[5]  Ariel Orda,et al.  QoS routing: the precomputation perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  Keith McCloghrie,et al.  Protocol Operations for version 2 of the Simple Network Management Protocol (SNMPv2) , 1993, RFC.

[7]  S. Pink,et al.  Aggregating resource reservations over multiple routing domains , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

[8]  Mark Moran,et al.  Resource sharing for multi-party real-time communication , 1995, Proceedings of INFOCOM'95.

[9]  Parameswaran Ramanathan,et al.  A QoS architecture for future wireless IP networks , 2000 .

[10]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[11]  Sathish S. Vadhiyar,et al.  SRS: A Framework for Developing Malleable and Migratable Parallel Applications for Distributed Systems , 2003, Parallel Process. Lett..

[12]  Torsten Braun,et al.  Evaluation of bandwidth broker signaling , 1999, Proceedings. Seventh International Conference on Network Protocols.

[13]  Ibrahim Khalil,et al.  Implementation of a bandwidth broker for dynamic end-to-end resource reservation in outsourced virtual private networks , 2000, Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000.

[14]  R. Srikant,et al.  Resource sharing for book-ahead and instantaneous-request calls , 1999, TNET.

[15]  George Karakostas,et al.  Faster approximation schemes for fractional multicommodity flow problems , 2008, TALG.

[16]  Yakov Rekhter,et al.  Carrying Label Information in BGP-4 , 2001, RFC.

[17]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[18]  B. R. Badrinath,et al.  An edge router based protocol for fault tolerant handling of advance reservations , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[19]  Jim Boyle,et al.  Accept-Ranges : bytes Content-Length : 55967 Connection : close Content-Type : text / plain Internet Draft , 2012 .

[20]  Sally Floyd,et al.  Wide-area traffic: the failure of Poisson modeling , 1994 .

[21]  Henning Schulzrinne,et al.  Internet Quality of Service: An Overview , 2000 .

[22]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[23]  Ralf Steinmetz,et al.  Concepts for Resource Reservation in Advance , 2004, Multimedia Tools and Applications.

[24]  John Wroclawski,et al.  Specification of the Controlled-Load Network Element Service , 1997, RFC.

[25]  Peter Steenkiste,et al.  On path selection for traffic with bandwidth guarantees , 1997, Proceedings 1997 International Conference on Network Protocols.

[26]  Olov Schelén,et al.  Advance Reservations for Predictive Service , 1995, NOSSDAV.

[27]  Stephen S. Wolff,et al.  Network and computing research infrastructure: back to the future , 2004, CACM.

[28]  Giorgio Ventre,et al.  Distributed advance reservation of real-time connections , 1997, Multimedia Systems.

[29]  Chen-Nee Chuah,et al.  Analysis of link failures in an IP backbone , 2002, IMW '02.

[30]  Olov Schelén,et al.  Resource reservation agents in the Internet , 1998 .

[31]  Ian Foster,et al.  A quality of service architecture that combines resource reservation and application adaptation , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[32]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[33]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[34]  Klaus Jansen,et al.  Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme , 2004, Algorithmica.

[35]  Van Jacobson,et al.  A Two-bit Differentiated Services Architecture for the Internet , 1999, RFC.

[36]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[37]  Peter Steenkiste,et al.  Routing high-bandwidth traffic in max-min fair share networks , 1996, SIGCOMM '96.

[38]  Axel Keller,et al.  The virtual resource manager: an architecture for SLA-aware resource management , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[39]  Ian F. Akyildiz,et al.  A new preemption policy for DiffServ-aware traffic engineering to minimize rerouting , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[40]  Prasoon Tiwari,et al.  Scheduling malleable and nonmalleable parallel tasks , 1994, SODA '94.

[41]  Ralf Steinmetz,et al.  Issues ofReserving Resources in Advance , 1995, NOSSDAV.

[42]  Reinhard Lüling,et al.  An Architecture for a Scalable Video-on-Demand Server Network with Quality-of-Service Guarantees , 2000, IDMS.

[43]  Vladimir A. Bolotin.  Modeling call holding time distributions for CCS network design and performance analysis , 1994, IEEE J. Sel. Areas Commun..

[44]  Klara Nahrstedt,et al.  Hop-by-hop routing algorithms for premium-class traffic in DiffServ networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[45]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[46]  Vishal Sharma,et al.  Framework for Multi-Protocol Label Switching (MPLS)-based Recovery , 2003, RFC.

[47]  Bruce S. Davie,et al.  Computer Networks: A Systems Approach , 1996 .

[48]  Cees T. A. M. de Laat,et al.  TransLight: a global-scale LambdaGrid for e-science , 2003, CACM.

[49]  R. Steinmetz,et al.  A policy-based service specification for resource reservation in advance , 1999 .

[50]  Albert G. Greenberg,et al.  Admission control for booking ahead shared resources , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[51]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[52]  Xipeng Xiao,et al.  Internet QoS: a big picture , 1999, IEEE Netw..

[53]  Klara Nahrstedt,et al.  A distributed resource management architecture that supports advance reservations and co-allocation , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[54]  Jeffrey D. Case,et al.  Introduction and Applicability Statements for Internet-Standard Management Framework , 2002, RFC.

[55]  Lars-Olof Burchard.  On the performance of computer networks with advance reservation mechanisms , 2003, The 11th IEEE International Conference on Networks, 2003. ICON2003..

[56]  Keith McCloghrie,et al.  COPS Usage for Policy Provisioning (COPS-PR) , 2001, RFC.

[57]  Jonathan S. Turner,et al.  DRES: network resource management using deferred reservations , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[58]  Mario Gerla,et al.  Fault Tolerance and Load Balancing in QoS Provisioning with Multiple MPLS Paths , 2001, IWQoS.

[59]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[60]  Dan Grossman,et al.  New Terminology and Clarifications for Diffserv , 2002, RFC.

[61]  Volker Sander,et al.  Design and evaluation of a bandwidth broker that provides network quality of service for grid applications , 2002 .

[62]  Jean-Yves Le Boudec,et al.  An Expedited Forwarding PHB (Per-Hop Behavior) , 2002, RFC.

[63]  David L. Black,et al.  Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers , 1998, RFC.

[64]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[65]  Ram Dantu,et al.  Constraint-Based LSP Setup using LDP , 2002, RFC.

[66]  Lars-Olof Burchard,et al.  Fault tolerance in networks with an advance reservation service , 2003, IWQoS'03.

[67]  Thomas Erlebach,et al.  Call admission control for advance reservation requests with alternatives , 2002 .

[68]  Scott Shenker,et al.  Specification of Guaranteed Quality of Service , 1997, RFC.

[69]  B. R. Badrinath,et al.  MRSVP: A Resource Reservation Protocol for an Integrated Services Network with Mobile Hosts , 2001, Wirel. Networks.

[70]  Juan A. Garay,et al.  Call preemption in communication networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[71]  Murali S. Kodialam,et al.  Fast network re-optimization schemes for MPLS and optical networks , 2003, IWQoS'03.

[72]  Andreas Kirstädter,et al.  Engineering end-to-end IP resilience using resilience-differentiated QoS , 2002, IEEE Commun. Mag..

[73]  Fred Baker,et al.  Assured Forwarding PHB Group , 1999, RFC.

[74]  Ariel Orda,et al.  Networks with advance reservations: the routing perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[75]  Olov Schelén,et al.  An agent-based architecture for advance reservations , 1997, Proceedings of 22nd Annual Conference on Local Computer Networks.

[76]  David Eppstein,et al.  Finding the k Shortest Paths , 1999, SIAM J. Comput..

[77]  Henning Schulzrinne,et al.  Lightweight Resource Reservation Signaling: Design, Performance and Implementation , 2000 .

[78]  Wilko Reinhardt,et al.  Advance Resource Reservation and its Impact on Reservation Protocols1 , 1995 .

[79]  Axel Keller,et al.  Anatomy of a Resource Management System for HPC-Clusters , 2000 .

[80]  Vijay Srinivasan,et al.  RSVP-TE: Extensions to RSVP for LSP Tunnels , 2001, RFC.

[81]  Dieter Jungnickel,et al.  Graphs, Networks, and Algorithms , 1980 .

[82]  Lixia Zhang,et al.  Resource ReSerVation Protocol (RSVP) - Version 1 Functional Specification , 1997, RFC.

[83]  John Wroclawski,et al.  The Use of RSVP with IETF Integrated Services , 1997, RFC.

[84]  Joseph Naor,et al.  Routing and Admission Control in Networks with Advance Reservations , 2002, APPROX.

[85]  Anton Riedl,et al.  On The Design Of Resource Management Domains , 2002 .

[86]  Alexander Schill,et al.  Resource reservation in advance in heterogeneous networks with partial ATM infrastructures , 1997, Proceedings of INFOCOM '97.

[87]  D. Estrin,et al.  RSVP: a new resource reservation protocol , 1993, IEEE Communications Magazine.

[88]  S. Pink,et al.  Performance of QoS agents for provisioning network resources , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[89]  Anindo Banerjea,et al.  The Tenet real-time protocol suite: design, implementation, and experiences , 1996, TNET.