Admission control for hard real-time connections in ATM LANs

A CAC algorithm must efficiently determine if a new connection can be admitted by verifying that its QoS requirements can be met without violating those of previously admitted connections. In hard real-time systems, the QoS requirements are specified in terms of end-to-end cell deadlines and no cell loss due to buffer overflow. A CAC algorithm must account for interdependencies among connections caused by statistical multiplexing of cells in ATM networks. Arbitrarity of network topology may lead to cyclic dependencies among various connections. We present an efficient CAC algorithm that addresses the above issues. The algorithm uses a traffic descriptor called the maximum traffic rate function to effectively compute bounds on end-to-end delays of connections and buffer requirements within the network. Our work differs from most previous work in that it does not require traffic restoration inside the network.

[1]  Srinivasan Keshav,et al.  Rate controlled servers for very high-speed networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

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

[3]  Jay K. Strosnider,et al.  Scheduling real-time communication on dual-link networks , 1992, [1992] Proceedings Real-Time Systems Symposium.

[4]  Wei Zhao,et al.  Real-time communications in atm networks , 1996 .

[5]  K ParekhAbhay,et al.  A generalized processor sharing approach to flow control in integrated services networks , 1993 .

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

[7]  Shirish S. Sathaye,et al.  Responsive aperiodic services in high-speed networks , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.

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

[9]  Domenico Ferrari,et al.  Rate-controlled static-priority queueing , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[10]  Kang G. Shin,et al.  On the ability of establishing real-time channels in point-to-point packet-switched networks , 1994, IEEE Trans. Commun..

[11]  Kang G. Shin,et al.  Real-Time Communication in ATM Networks , 1994, LCN.

[12]  Wei Zhao,et al.  Real-time schedulability of two token ring protocols , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.

[13]  Gary M. Koob,et al.  Foundations of Real-Time Computing: Scheduling and Resource Management , 1991 .

[14]  ZhangHui,et al.  Comparison of rate-based service disciplines , 1991 .

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

[16]  Jay K. Strosnider,et al.  Advanced real-time scheduling using the IEEE 802.5 token ring , 1988, Proceedings. Real-Time Systems Symposium.

[17]  L. Trajkovic,et al.  Congestion control for multimedia services , 1992, IEEE Network.

[18]  Andreas D. Bovopoulos,et al.  Real-time admission control algorithms with delay and loss guarantees in ATM networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[19]  S. Jamaloddin Golestani,et al.  A Framing Strategy for Congestion Management , 1991, IEEE J. Sel. Areas Commun..

[20]  Wei Zhao,et al.  Guaranteeing end-to-end deadlines in ATM networks , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

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

[22]  J.A. Stankovic,et al.  Misconceptions about real-time computing: a serious problem for next-generation systems , 1988, Computer.

[23]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[24]  Kang G. Shin,et al.  Real-time communication in multi-hop networks , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[25]  S. Jamaloddin Golestani.  A Stop-and-Go Queueing Framework for Congestion Management , 1990, SIGCOMM.

[26]  J.-P. Coudreuse,et al.  Spacing cells protects and enhances utilization of ATM network links , 1992, IEEE Network.

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

[28]  Wei Zhao,et al.  Using traffic regulation to meet end-to-end deadlines in ATM LANs , 1995, Proceedings of International Conference on Network Protocols.