QoS provisioning and tracking fluid policies in input queueing switches

The concept of tracking policies for fluid policies is extended to input queueing switches. It is considered that the speed up of the switch is 1. For the special case of 2/spl times/2 switches it is shown that tracking policy always exists. One of the interesting applications of the tracking policy in TDMA satellite switches is elaborated upon. For the general case of N/spl times/N switches a heuristic tracking policy is provided. The heuristic algorithm is based on two notions of port tracking and critical links. These notions can be employed in derivation of other heuristic tracking policies as well. Simulation results present the usefulness of the heuristic algorithm and the two basic concepts it relies upon.

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

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

[3]  Jane W. Liu,et al.  Scheduling real-time messages in packet-switched networks , 1996 .

[4]  Abhay Parekh,et al.  Optimal multiplexing on a single link: delay and buffer requirements , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[5]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

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

[7]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[8]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[9]  Nick McKeown,et al.  Matching output queueing with a combined input/output-queued switch , 1999, IEEE J. Sel. Areas Commun..

[10]  Maurizio A. Bonuccelli,et al.  EDD algorithm performance guarantee for periodic hard-real-time scheduling in distributed systems , 1999, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999.

[11]  T. Inukai,et al.  An Efficient SS/TDMA Time Slot Assignment Algorithm , 1979, IEEE Trans. Commun..

[12]  Nick McKeown,et al.  Matching output queueing with a combined input output queued switch , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[13]  Roch Guérin,et al.  Efficient network QoS provisioning based on per node traffic shaping , 1996, TNET.

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

[15]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

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

[17]  Nick McKeown,et al.  A practical scheduling algorithm to achieve 100% throughput in input-queued switches , 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.