Bandwidth scheduling for wide-area ATM networks using virtual finishing times

The paper is concerned with the design of a class of bandwidth scheduling policies that are suitable for public, wide-area asynchronous transfer mode (ATM) networks. The authors specify design goals for such strategies including ease of implementation and the ability to guarantee minimum bandwidths to individual buffers. Packetized generalized processor sharing is briefly discussed and a minimum bandwidth result for self-clocked fair queueing is given. The authors revisit an approach originally proposed by Zhang (1991) and prove that it is appropriate for ATM. Some novel, related approaches are described and analyzed.

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

[2]  Joseph Pasquale,et al.  An upper bound on delay for the VirtualClock service discipline , 1995, TNET.

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

[4]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

[5]  James Roberts.  Virtual spacing for flexible traffic control , 1994 .

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

[7]  Atm Forum.  ATM user-network interface (UNI) specification : version 3.1 , 1993 .

[8]  G. de Veciana,et al.  Bandwidth allocation for multiple qualities of service using generalized processor sharing , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[9]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[10]  A. W. Kemp,et al.  Applied Probability and Queues , 1989 .

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

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

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

[14]  George Kesidis,et al.  End-to-End Delay Bounds and Buffer Sizing in ATM Networks , 1995 .

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

[16]  Rene L. Cruz,et al.  Service Burstiness and Dynamic Burstiness Measures: A Framework , 1992, J. High Speed Networks.