Data networks
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A stop-and-go queueing framework for congestion management
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
The Asynchronous Transfer Mode: a tutorial
Computer Networks and ISDN Systems - Special issue on the ATM—asynchronous transfer mode
Networking in distributed real-time systems
Networking in distributed real-time systems
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Optimizing the system of virtual paths
IEEE/ACM Transactions on Networking (TON)
The Tenet real-time protocol suite: design, implementation, and experiences
IEEE/ACM Transactions on Networking (TON)
Guaranteeing Synchronous Message Deadlines with the Timed Token Medium Access Control Protocol
IEEE Transactions on Computers
Distance-Constrained Scheduling and Its Applications to Real-Time Systems
IEEE Transactions on Computers
Real-Time Communication in Multihop Networks
IEEE Transactions on Parallel and Distributed Systems
Design of a Fast Restoration Mechanism for Virtual Path-Based ATM Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delay and Throughput Fairness
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Dynamic maintenance of the virtual path layout
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Virtual path bandwidth allocation in multi-user networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
SRP: A Resource Reservation Protocol for Guaranteed-Performance
SRP: A Resource Reservation Protocol for Guaranteed-Performance
Routing subject to quality of service constraints in integrated communication networks
IEEE Network: The Magazine of Global Internetworking
A new distributed QoS routing algorithm based on Fano's method
Computer Networks and ISDN Systems
A new distributed QoS routing algorithm based on Fano's method
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 14.98 |
Real-time communication with performance guarantees is expected to become an important feature of future computer networks used for embedded real-time systems and/or for interactive multimedia services. Given an ATM network topology, its virtual path (VP) layout, and its traffic demands, we consider in this paper the problem of selecting for each virtual circuit (VC) with user-specified end-to-end temporal QoS requirements a route (i.e., a sequence of VPs) along which sufficient resources are available to meet the delay requirements. Our objective is 1) to provide the temporal QoS guarantee for each VC to be established while not jeopardizing the QoS guarantees to other existing VCs and 2) to reduce the call blocking probability for future VCs by using the minimum possible resources. We adopt the real-time channel model [16], [33], [51] to characterize the traffic characteristics and the temporal QoS requirement of a VC. We impose a deterministic guarantee that every message generated at the source node be delivered to the destination node in a time period no longer than the relative deadline. We then propose a VC routing scheme based on the distributed Bellman-Ford algorithm [9], [41] to identify an 驴appropriate驴 route through the network. By 驴appropriate,驴 we mean that the route traverses a minimum number of VPs among all possible routes that have sufficient resources to fulfill the end-to-end temporal QoS requirement of the VC to be established. To ensure that sufficient bandwidth is available over all the VPs along the selected route, we incorporate in our proposed scheme a priority assignment method to calculate the worst-case delay which messages of a VC will experience on a VP along which the VC is routed. We study the performance of, and the message overhead incurred in, the proposed scheme. We also discuss how to extend the proposed routing scheme to accommodate multicast routing.