Preserving quality of service guarantees in spite of flow aggregation

We investigate the preservation of quality of service guarantees to a flow of packets in the presence of flow aggregation. In flow aggregation, multiple flows, known as the constituent flows, are merged together resulting in a single aggregate flow. Packet schedulers located after the network point where the aggregation occurred 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. Furthermore, contrary to intuition, the quality of service guarantees of a flow may be better under flow aggregation than in the case where no aggregation is performed.

[1]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM 1996.

[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]  Didier Le Gall,et al.  MPEG: a video compression standard for multimedia applications , 1991, CACM.

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

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

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

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

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

[11]  Hui Zhang,et al.  Comparison of rate-based service disciplines , 1991, SIGCOMM '91.

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

[13]  Mohamed G. Gouda.  Protocol Verification Made Simple: A Tutorial , 1993, Comput. Networks ISDN Syst..

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

[15]  GoyalPawan,et al.  Generalized guaranteed rate scheduling algorithms , 1997 .

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

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

[18]  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.

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

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

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

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