Admission control for hard real-time connections in ATM LANs

Authors:
Amitava Raha;Sanjay Kamat;Wei Zhao
Affiliations:
Department of Computer Science, Texas A & M University, College Station, TX;Department of Computer Science, Texas A & M University, College Station, TX;Department of Computer Science, Texas A & M University, College Station, TX
Venue:
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Year:
1996

Citing 11
Cited 11

Misconceptions About Real-Time Computing: A Serious Problem for Next-Generation Systems

Computer
Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Comparison of rate-based service disciplines

SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism

SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Hard real-time communication in multiple-access networks

Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Foundations of Real-Time Computing: Scheduling and Resource Management

Foundations of Real-Time Computing: Scheduling and Resource Management
Using traffic regulation to meet end-to-end deadlines in ATM LANs

ICNP '95 Proceedings of the 1995 International Conference on Network Protocols
Guaranteeing end-to-end deadlines in ATM networks

ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Real-time communications in atm networks

Real-time communications in atm networks

Using Traffic Regulation to Meet End-to-End Deadlines in ATM Networks

IEEE Transactions on Computers
On Developing Distributed Middleware Services for QoS-and Criticality-Based Resource Negotiation and Adaptation

Real-Time Systems
RT-CRM: Real-Time Channel-Based Reflective Memory

IEEE Transactions on Computers
Efficient delay computation methods for real-time traffic in an ATM network

Progress in computer research
Efficient delay computation methods for real-time traffic in an ATM network

Progress in computer research
Backbone Networks Using Rotation Counters

IEEE Transactions on Parallel and Distributed Systems
Stability in ATM Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
An Energy-Efficient Slack Distribution Technique for Multimode Distributed Real-Time Embedded Systems

IEEE Transactions on Parallel and Distributed Systems
Real-time intrusion detection and suppression in ATM networks

ID'99 Proceedings of the 1st conference on Workshop on Intrusion Detection and Network Monitoring - Volume 1
Guaranteeing hard real-time traffic constraints with ATM networks

Integrated Computer-Aided Engineering
An efficient admission control scheme for the real-time VBR traffic in the ATM network: deterministic bandwidth allocation

Computer Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 eficient 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.