Preserving quality of service guarantees in spite of flow aggregation

We investigate how quality of service may be guaranteed to a flow of packets in the presence of flow aggregation. For efficiency, multiple flows, known as the constituent flows, are merged together resulting in a single aggregate flow. After the network node where the aggregation occurs, packet schedulers are aware of the aggregate flow, but are unaware of its constituent flows. In spite of this, we show that quality of service may be guaranteed to the constituent flows, provided the aggregation is performed fairly. When the delay bound of a flow is de-coupled from the flow's reserved rate, flow aggregation preserves the delay bound. When the delay bound of a flow is coupled to the flow's reserved rate, flow aggregation preserves, and in some cases improves, the delay bound.

[1]  C. Luchini,et al.  [High speed]. , 1969, Revista De La Escuela De Odontologia, Universidad Nacional De Tucuman, Facultad De Medicina.

[2]  Srinivasan Keshav.  A control-theoretic approach to flow control , 1991, SIGCOMM 1991.

[3]  Ion Stoica,et al.  Providing guaranteed services without per flow management , 1999, SIGCOMM '99.

[4]  Kang G. Shin,et al.  On the ability of establishing real-time channels in point-to-point packet-switched networks , 1994, IEEE Trans. Commun..

[5]  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).

[6]  Harrick M. Vin,et al.  Generalized guaranteed rate scheduling algorithms: a framework , 1997, TNET.

[7]  Srinivasan Keshav,et al.  Comparison of rate-based service disciplines , 1991, SIGCOMM '91.

[8]  Geert Jan Olsder,et al.  Synchronization and Linearity: An Algebra for Discrete Event Systems , 1994 .

[9]  Cheng-Shang Chang,et al.  A general framework for deterministic service guarantees in telecommunication networks with variable length packets , 2001, IEEE Trans. Autom. Control..

[10]  Lixia Zhang,et al.  Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks , 1990, SIGCOMM.

[11]  Rene L. Cruz,et al.  SCED+: efficient management of quality of service guarantees , 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.

[12]  Andrew S. Tanenbaum,et al.  Computer networks, third edition , 1996 .

[13]  Mohamed G. Gouda,et al.  Time-shift scheduling—fair scheduling of flows in high-speed networks , 1998, TNET.

[14]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[15]  Joseph Pasquale,et al.  Leave-in-Time: a new service discipline for real-time communications in a packet-switching network , 1995, SIGCOMM '95.

[16]  Geoffrey G. Xie,et al.  Delay guarantee of virtual clock server , 1995, TNET.

[17]  George C. Polyzos,et al.  A service-curve approach to performance guarantees in integrated-service networks , 1996 .

[18]  Lixia Zhang.  VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks , 1991, ACM Trans. Comput. Syst..

[19]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[20]  Harrick M. Vin,et al.  Determining end-to-end delay bounds in heterogeneous networks , 1995, Multimedia Systems.

[21]  Jean-Yves Le Boudec,et al.  Application of Network Calculus to Guaranteed Service Networks , 1998, IEEE Trans. Inf. Theory.

[22]  Cheng-Shang Chang.  On Deterministic Traffic Regulation and Service Guarantees : A Systematic Approach by Filtering , 1998, IEEE Trans. Inf. Theory.

[23]  Rene L. Cruz,et al.  Quality of Service Guarantees in Virtual Circuit Switched Networks , 1995, IEEE J. Sel. Areas Commun..

[24]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[25]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

[26]  Lixia Zhang,et al.  VirtualClock: a new traffic control algorithm for packet-switched networks , 1991, TOCS.

[27]  Anujan Varma,et al.  A general methodology for designing efficient traffic scheduling and shaping algorithms , 1997, Proceedings of INFOCOM '97.

[28]  Mohamed G. Gouda,et al.  Flow theory , 1997, TNET.

[29]  Jean-Yves Le Boudec,et al.  Network Calculus viewed as a Min-plus System Theory applied to Communication Networks , 1998 .

[30]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[31]  D. Legall,et al.  MPEG : A video compression standard for multimedia applications , 1991 .

[32]  George Varghese,et al.  Leap forward virtual clock: a new fair queuing scheme with guaranteed delays and throughput fairness , 1997, PODC '97.

[33]  Jorge Arturo Cobb,et al.  An in-depth look at flow aggregation for efficient quality of service , 1999, Proceedings. Seventh International Conference on Network Protocols.

[34]  Hui Zhang,et al.  High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks , 1997, Proceedings 1997 International Conference on Network Protocols.

[35]  Mohamed G. Gouda.  Elements of network protocol design , 1998 .

[36]  Didier Le Gall,et al.  MPEG: a video compression standard for multimedia applications , 1991, CACM.

[37]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM '96.