Decoupling different time scales of network QoS systems

Providing quality of service (QoS) in large-scale networks like the Internet inherently needs to deal with heterogeneous network QoS systems. Therefore, the interworking between different network QoS systems is of high importance. In this paper, the interworking with respect to a basic characteristic of network QoS systems, the time scale of the system, is under investigation. The time scale of a network QoS system is its speed of reaction to individual requests for differentiated treatment of units of service. A slow time scale system will prefer requests to arrive with a low frequency and persist unaltered for a substantial period of time while a fast one is able to support much higher arrival rates of requests and is thus more amenable for short-lived units of service. Obviously, when overlaying a slow time scale QoS system over a faster one, there is no problem. However, and that is a more likely case, for the overlay of a fast time scale system on a slow one, there is a mismatch to be mediated at the edge between the two. The technique that is applied at an edge device for this mediation is called decoupling of time scales. Decoupling can also be viewed as aggregation of requests in time in contrast to spatial aggregation on the data path. In the paper, we develop an adaptive heuristic scheme to deal with decoupling and evaluate this scheme by extensive simulations.

[1]  Henning Schulzrinne,et al.  BGRP: A Tree-Based Aggregation Protocol for Inter-domain Reservations , 1999 .

[2]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[3]  Jorge Arturo Cobb.  Preserving quality of service guarantees in spite of flow aggregation , 2002, TNET.

[4]  Lixia Zhang,et al.  A Framework for Integrated Services Operation over Diffserv Networks , 2000, RFC.

[5]  S. Salsano.  COPS Usage for Outsourcing Diffserv Resource Allocation , 2000 .

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

[7]  Ralf Steinmetz,et al.  On the aggregation of deterministic service flows , 2001, Comput. Commun..

[8]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[9]  Henning Schulzrinne,et al.  BGRP: Sink-tree-based aggregation for inter-domain reservations , 2000, Journal of Communications and Networks.

[10]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[11]  J. Walrand,et al.  RCBR: A Simple and Efficient Service for Multiple Time-Scale Traffic , 1995 .

[12]  Gerald Eichler,et al.  Implementing integrated and differentiated services for the Internet with ATM networks: a practical approach , 2000, IEEE Commun. Mag..

[13]  Jens B. Schmitt,et al.  Multi-Period Resource Allocation at System Edges , 2002 .

[14]  A. Terzis,et al.  A two-tier resource management model for the Internet , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[15]  Andreas Terzis,et al.  RSVP Operation Over IP Tunnels , 2000, RFC.

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

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

[18]  Philip E. Gill,et al.  Practical optimization , 1981 .

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

[20]  Uyless Black.  ATM foundation for broadband networks , 1995 .

[21]  Jorge Arturo Cobb,et al.  Preserving quality of service guarantees in spite of flow aggregation , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).