A framework for admission control and path allocation in DiffServ networks

Authors:
M. Ajmone Marsan;C. Casetti;G. Mardente;M. Mellia
Affiliations:
Dipartimento di Elettronica, Politecnico di Torino, Corso Duca degli Abruzzi, 24, I-10129 Torino, Italy;Dipartimento di Elettronica, Politecnico di Torino, Corso Duca degli Abruzzi, 24, I-10129 Torino, Italy;Dipartimento di Elettronica, Politecnico di Torino, Corso Duca degli Abruzzi, 24, I-10129 Torino, Italy;Dipartimento di Elettronica, Politecnico di Torino, Corso Duca degli Abruzzi, 24, I-10129 Torino, Italy
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2007

Citing 6
Cited 2

Steiner problem in networks: a survey

Networks
Multicast tree generation in networks with asymmetric links

IEEE/ACM Transactions on Networking (TON)
A flexible model for resource management in virtual private networks

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Endpoint admission control: architectural issues and performance

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Adaptive provisioning of differentiated services networks based on reinforcement learning

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Call admission control schemes: a review

IEEE Communications Magazine

A novel admission control mechanism in GMPLS-based IP over optical networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Joint routing and admission control problem under statistical delay and jitter constraints in MPLS networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a Differentiated Service Domain, in which the domain administrator has to decide if to accept or to reject Bandwidth Reservation Requests (BRRs) requested by users. We first define an analytical approach and a methodology to determine the set of SLAs that can be effectively supported by a DiffServ IP network. We consider the Assured Forwarding Per Hop Behavior, and, based on the BRR probabilistic description, we derive a worst-case mathematical formulation for the overbooking probability, i.e., the probability that the traffic crossing any link of a source-destination path exceeds the link capacity. Next, we focus our attention to the problem of routing traffic arising from BRRs, i.e., the selection of paths along which traffic may flow. In particular, we show that the construction of an optimal set of paths is equivalent to the construction of a multicast tree, or a Steiner Tree, which is know to be an NP-hard problem. We therefore propose a class of simple heuristics, whose performance are assessed by simulations. Results show the effectiveness of the admission control criterium proposed, and that it is possible to increase up to 40% the amount of capacity a network provider can reserve to BRRs without violating the QoS constraints or to reduce the BRR blocking probability by a order of magnitude by using the proposed optimization algorithm.