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

Authors:
Luciano Lenzini;Linda Martorini;Enzo Mingozzi;Giovanni Stea
Affiliations:
University of Pisa, Pisa, Italy;University of Pisa, Pisa, Italy;University of Pisa, Pisa, Italy;University of Pisa, Pisa, Italy
Venue:
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Year:
2006

Citing 10
Cited 5

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Performance Guarantees in Communication Networks

Performance Guarantees in Communication Networks
Efficient resource management for hard real-time communication over differentiated services architectures

RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Endpoint Admission Control: Network Based Approach

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
A parameter based admission control for differentiated services networks

Computer Networks: The International Journal of Computer and Telecommunications Networking - QoS in multiservice IP networks
Exploiting Network Calculus for Delay-Based Admission Control in a Sink-Tree Network

FIRB-PERF '05 Proceedings of the 2005 Workshop on Techniques, Methodologies and Tools for Performance Evaluation of Complex Systems
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks

Performance Evaluation
Delay bounds for FIFO aggregates: a case study

Computer Communications
Traffic engineering in a multipoint-to-point network

IEEE Journal on Selected Areas in Communications

Optimal routing for end-to-end guarantees using Network Calculus

Performance Evaluation
Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis

Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Efficient link scheduling for online admission control of real-time traffic in wireless mesh networks

Computer Communications
Worst-case delay analysis of master-slave switched ethernet networks

Proceeings of the 2nd International Workshop on Worst-Case Traversal Time
Design of network topology based on delay-cost sink tree

International Journal of Communication Networks and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate the problem of scalable admission control for real-time traffic in sink-tree networks employing per-aggregate resource management policies, like MPLS or DiffServ. Every traffic flow entering the network at an ingress node, and flowing towards a given egress node, specifies its leaky-bucket parameters and a required delay bound for traversing the network. We propose an algorithm that admits a new flow if a guarantee can be given that the required delay bound, besides those of other already established flows, are not exceeded. We identify properties of sink-tree networks based on which we considerably reduce the complexity of the proposed algorithm, and we show that the latter approaches the theoretical lower bound on the worst case complexity of any algorithm working under the same hypotheses. Finally, we show that the algorithm lends itself to a distributed implementation, thus allowing for better scalability.