Guaranteeing real-time traffic through an ATM network

Presents a method for providing hard real-time guarantees for traffic through an asynchronous transfer mode (ATM) network. Guaranteed delivery also implies that we have to guarantee that no cells are lost due to over-full buffers in the network. By using priority queues in the output buffers, we allow urgent messages short end-to-end delays, while still guaranteeing end-to-end delays for low-priority messages. We can determine a priori if message deadlines will be met by calculating maximum end-to-end delays and buffer needs. The analysis is based on CPU schedulability analysis, which means that it provides a framework for analysing an entire system, including both CPU and network scheduling.

[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 multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[3]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[4]  Gunnar Karlsson.  Capacity reservation in ATM networks , 1996, Comput. Commun..

[5]  Wei Zhao,et al.  Hard real-time communications with weighted round robin service in ATM local area networks , 1995, Proceedings of First IEEE International Conference on Engineering of Complex Computer Systems. ICECCS'95.

[6]  Mikael Sjodin,et al.  Response-time Analysis for Atm Networks , 1997 .

[7]  N. Uzun,et al.  A VLSI sequencer chip for ATM traffic shaper and queue manager , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[8]  Alan Burns,et al.  Fixed Priority Scheduling of Hard Real-time Multi-media Disk Traffic , 1994, Comput. J..

[9]  Alan Burns,et al.  Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..

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

[11]  Andy J. Wellings,et al.  Analysing real-time communications: controller area network (CAN) , 1994, 1994 Proceedings Real-Time Systems Symposium.

[12]  D.E. Tolmie.  Gigabit networking , 1992, IEEE LTS.

[13]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[14]  S. J. Golestani.  A stop-and-go queueing framework for congestion management , 1990, SIGCOMM 1990.

[15]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[16]  Joe Armstrong,et al.  Concurrent programming in ERLANG , 1993 .

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