End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms

This paper evaluates, via both analysis and simulation, the end-to-end (e2e) delay performance of aggregate scheduling with guaranteed-rate (GR) algorithms. Deterministic e2e delay bounds for a single aggregation are derived under the assumption that all incoming flows at an aggregator conform to the token bucket model. An aggregator can use any of three types of GR scheduling algorithms: stand-alone GR, two-level hierarchical GR, and rate-controlled two-level hierarchical GR. E2e delay bounds are also derived for the case of multiple aggregations within an aggregation region when aggregators use the rate-controlled two-level hierarchical GR. By using the GR scheduling algorithms for traffic aggregates, we show not only the existence of delay bounds for each flow, but also the fact that, under certain conditions (e.g., when the aggregate traverses a long path after the aggregation point), the bounds are smaller than that of per-flow scheduling. We then compare the analytic delay bounds numerically and conduct in-depth simulation to: 1) confirm the analytic results and 2) compare the e2e delays of aggregate and per-flow scheduling. The simulation results have shown that aggregate scheduling is very robust and can exploit statistical multiplexing gains. It performs better than per-flow scheduling in most of the simulation scenarios we considered. Overall, aggregate scheduling is shown theoretically to provide bounded e2e delays and practically to provide excellent e2e delay performance. Moreover, it incurs lower scheduling and state-maintenance overheads at routers than per-flow scheduling. All of these salient features make aggregate scheduling very attractive for use in Internet core networks.

[1]  Jean-Yves Le Boudec,et al.  Delay Bounds in a Network with Aggregate Scheduling , 2000, QofIS.

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

[3]  Lixia Zhang,et al.  Reservations for aggregate traffic: experiences from an RSVP tunnels implementation , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

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

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

[6]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

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

[8]  F. M. Chiussi,et al.  Implementing fair queueing in ATM switches. I. A practical methodology for the analysis of delay bounds , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

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

[10]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[11]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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

[13]  Hui Zhang,et al.  Implementing distributed packet fair queueing in a scalable switch architecture , 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.

[14]  Andrea Francini,et al.  Implementing fair queueing in ATM switches: the discrete-rate approach , 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.

[15]  G ShinKang,et al.  End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms , 2005 .

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

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

[18]  Martin Reisslein,et al.  MPEG-4 and H.263 video traces for network performance evaluation , 2001, IEEE Netw..

[19]  Albert G. Greenberg,et al.  Hardware-efficient fair queueing architectures for high-speed networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[20]  Yakov Rekhter,et al.  A Provider Architecture for Differentiated Services and Traffic Engineering (PASTE) , 1998, RFC.

[21]  J. J. Garcia-Luna-Aceves,et al.  A scalable architecture for providing deterministic guarantees , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

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

[23]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[24]  Fred Baker,et al.  Network Working Group Aggregation of Rsvp for Ipv4 and Ipv6 Reservations , 2002 .

[25]  Domenico Ferrari,et al.  Rate-Controlled Service Disciplines , 1994, J. High Speed Networks.

[26]  Huirong Fu,et al.  Aggregation and Scalable QoS: A Performance Study , 2001, IWQoS.

[27]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[28]  S. Berson,et al.  Aggregation of Internet Integrated Services state , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

[29]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[30]  J. Ehrensberger.  Resource demand of aggregated resource reservations , 2000, 1st European Conference on Universal Multiservice Networks. ECUMN'2000 (Cat. No.00EX423).

[31]  Riccardo Bettati,et al.  Scalable QoS guaranteed communication services for real-time applications , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[32]  Harrick M. Vin,et al.  Scheduling CBR Flows: FIFO or Per-flow Queuing? , 1999 .

[33]  Jens B. Schmitt,et al.  Aggregation of guaranteed service flows , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[34]  Adrian Popescu,et al.  Traffic Self-Similarity , 2001 .

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

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

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

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

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

[40]  Roch Guérin,et al.  Aggregation and conformance in differentiated service networks: a case study , 2001, CCRV.

[41]  K. Dolzer,et al.  A simulation study on traffic aggregation in multi-service networks , 2000, ATM 2000. Proceedings of the IEEE Conference on High Performance Switching and Routing (Cat. No.00TH8485).

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