Real-time block transfer under a link-sharing hierarchy

Most application data units are too large to be carried in a single packet (or cell) and must be segmented for network delivery. To an application, the end-to-end delays and loss rate of its data units are much more relevant performance measures than ones specified for individual packets (or cells). The concept of a burst (or block) was introduced to represent a sequence of packets (or cells) that carry an application data unit. We describe how a real-time variable bit-rate (VBR) service, with quality of service (QoS) parameters for block transfer delay and block loss rate, can be provided by integrating concepts and delay guarantee results from our previous work on burst scheduling, together with ideas from asynchronous transfer mode (ATM) block transfer. Two new contributions are presented herein. First, we design an admission control algorithm to provide the following two classes of service: bounded-delay block transfer with no loss, and bounded-delay block transfer at a specified block loss rate. Secondly, we show how to extend existing end-to-end delay bounds to networks with hierarchical link sharing.

[1]  Sally Floyd,et al.  Dynamics of TCP traffic over ATM networks , 1994 .

[2]  Geoffrey G. Xie,et al.  Group priority scheduling , 1997, TNET.

[3]  ZhangLixia,et al.  Supporting real-time applications in an Integrated Services Packet Network , 1992 .

[4]  Geoffrey G. Xie,et al.  Burst Scheduling Networks , 1997, Perform. Evaluation.

[5]  James R. Davin,et al.  A simulation study of fair queueing and policy enforcement , 1990, CCRV.

[6]  Peter B. Danzig,et al.  A measurement-based admission control algorithm for integrated services packet networks , 1995, SIGCOMM '95.

[7]  Kam Lee,et al.  Performance bounds in communication networks with variable-rate links , 1995, SIGCOMM '95.

[8]  Edward W. Knightly,et al.  RED-VBR: a renegotiation-based approach to support delay-sensitive VBR video , 1997, Multimedia Systems.

[9]  G. Varghese.  Eecient Fair Queuing Using Deecit round Robin , 1995 .

[10]  Jon Crowcroft,et al.  Analysis of Burstiness and Jitter in Real-Time Communications , 1993, SIGCOMM.

[11]  Sally Floyd,et al.  Dynamics of TCP traffic over ATM networks , 1994, SIGCOMM 1994.

[12]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

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

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

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

[16]  Scott Shenker,et al.  Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism , 1992, SIGCOMM '92.

[17]  David Clark,et al.  Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism , 1992, SIGCOMM.

[18]  R DavinJames,et al.  A simulation study of fair queueing and policy enforcement , 1990 .

[19]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[20]  Geoffrey G. Xie,et al.  Real-time block transfer under a link sharing hierarchy , 1997, Proceedings of INFOCOM '97.

[21]  Jonathan S. Turner.  Maintaining high throughput during overload in ATM switches , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[22]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

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

[24]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.

[25]  Ramesh Nagarajan.  Quality-of-service issues in high-speed networks , 1993 .

[26]  Geoffrey G. Xie,et al.  Admission control and loss management for an application-level statistical service , 1997, Proceedings 1997 International Conference on Network Protocols.

[27]  NetworksAllyn Romanow,et al.  Dynamics of Tcp Traac over Atm Networks , 1994 .

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

[29]  Vijay K. Samalam,et al.  The available bit rate service for data in ATM networks , 1996 .

[30]  David Tse,et al.  RCBR: a simple and efficient service for multiple time-scale traffic , 1997, TNET.

[31]  Jean C. Walrand,et al.  Resource Management in Wide-Area ATM Networks Using Effective Bandwiths , 1995, IEEE J. Sel. Areas Commun..

[32]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

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

[34]  Pierre E. Boyer,et al.  A Reservation Principle with Applications to the ATM Traffic Control , 1992, Comput. Networks ISDN Syst..

[35]  T Itu,et al.  Traffic control and congestion control in b-isdn , 1993 .

[36]  Geoffrey G. Xie,et al.  Burst scheduling: architecture and algorithm for switching packet video , 1995, Proceedings of INFOCOM'95.

[37]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM '96.

[38]  Michel Loève,et al.  Probability Theory I , 1977 .

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

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

[41]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[42]  GoyalPawan,et al.  Start-time fair queueing , 1996 .

[43]  San-qi Li,et al.  Predictive Dynamic Bandwidth Allocation for Efficient Transport of Real-Time VBR Video over ATM , 1995, IEEE J. Sel. Areas Commun..