Resource allocation rules for providing performance guarantees to traffic aggregates in a DiffServ environment

Authors:
D Di Sorte;G Reali
Affiliations:
Dipartimento di Ingegneria Elettronica e dell'Informazione, Universití degli Studi di Perugia, Via G. Duranti 93, 06125 Perugia, Italy;Dipartimento di Ingegneria Elettronica e dell'Informazione, Universití degli Studi di Perugia, Via G. Duranti 93, 06125 Perugia, Italy
Venue:
Computer Communications
Year:
2002

Citing 9
Cited 1

Link-sharing and resource management models for packet networks

IEEE/ACM Transactions on Networking (TON)
Quality-of-service in packet networks: basic mechanisms and directions

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on Internet telephony
Parsec: A Parallel Simulation Environment for Complex Systems

Computer
Internet QoS Routing Using the Bellman-Ford Algorithm

HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
Traffic Shaping at a Network Node: Theory, Optimum Design, Admission Control

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Application of network calculus to guaranteed service networks

IEEE Transactions on Information Theory
On deterministic traffic regulation and service guarantees: a systematic approach by filtering

IEEE Transactions on Information Theory
Internet QoS: a big picture

IEEE Network: The Magazine of Global Internetworking
Admission control for statistical QoS: theory and practice

IEEE Network: The Magazine of Global Internetworking

A mini-bandwidth guaranteed and differentiated service supporting bandwidth allocation algorithm for Multimedia Group Communication

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

The background of this paper is the Differentiated Services (DiffServ) approach to introduce quality of service in Internet. We consider connection admission control (CAC) protocols over the DiffServ layer for providing performance guarantees. The challenging aspect is that flows' statistics may change inside networks. Our analysis, based on Network Calculus, shows that if flows are shaped at edge routers only, it is possible to provide performance guarantees to traffic aggregates in terms of delay and losses. We have applied these results to two CAC techniques. The former guarantees hard performance, while the latter can capture the traffic fluctuations and allows overbooking during periods of source inactivity.