Efficient resource management for hard real-time communication over differentiated services architectures

Authors:
B. Choi;R. Bettati
Affiliations:
-;-
Venue:
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Year:
2000

Citing 0
Cited 4

Endpoint Admission Control: Network Based Approach

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks

Performance Evaluation
A novel approach to scalable CAC for real-time traffic in sink-tree networks with aggregate scheduling

valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Mobile intelligent agent technology for QoS provisioning and network management

ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an efficient strategy for resource management for scalable QoS guaranteed real-time communication services. This strategy is based on sink trees, and is particularly well suited for differentiated-services based architectures. We first show that finding a set of sink-trees in a given network is NP-complete. Then we propose a heuristic algorithm that always efficiently produces a set of sink-trees for a given network. Sink-tree based resource management integrates routing and resource reservation along the routes, and therefore has a number of advantages over other resource management scheme, in terms of: admission probability, link resource utilization, flow set up latency, signaling overhead, and routing over-head. In this paper we show by simulation experiments that even for simple cases the sink-tree based approach shows excellent results in terms of admission probability.