Decentralized network connection preemption algorithms
Computer Networks and ISDN Systems
An efficient rate allocation algorithm for ATM networks providing max-min fairness
Proceedings of the IFIP Sixth International Conference on High Performance Networking VI
A Core Stateless Bandwidth Broker Architecture for Scalable Support of Guaranteed Services
IEEE Transactions on Parallel and Distributed Systems
On Generalized Max-Min Rate Allocation and Distributed Convergence Algorithm for Packet Networks
IEEE Transactions on Parallel and Distributed Systems
Distributed Admission Control for Anycast Flows
IEEE Transactions on Parallel and Distributed Systems
TEAM: A traffic engineering automated manager for DiffServ-based MPLS networks
IEEE Communications Magazine
Virtual partitioning for robust resource sharing: computational techniques for heterogeneous traffic
IEEE Journal on Selected Areas in Communications
The structure and management of service level agreements in networks
IEEE Journal on Selected Areas in Communications
Internet2 QBone: building a testbed for differentiated services
IEEE Network: The Magazine of Global Internetworking
Routing subject to quality of service constraints in integrated communication networks
IEEE Network: The Magazine of Global Internetworking
ITU-T RACF implementation for application-driven QoS control in MPLS networks
IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
Multiple path selection algorithm for DiffServ-aware MPLS traffic engineering
Computer Communications
RCFT: A Termination Method for Simple PCN-Based Flow Control
Journal of Network and Systems Management
| Hi-index | 0.00 |
This paper presents a bandwidth management framework for the support of the differentiated service aware traffic engineering (DS-TE) in the multiprotocol label switching (MPLS) networks. Our bandwidth management framework contains both bandwidth allocation and preemption mechanisms, in which the link bandwidth is managed in two dimensions: class type and preemption priority. We put forward a Max- Min bandwidth constraint model, in which we propose a novel "use it or lend it" strategy. The new model is able to guarantee a minimum bandwidth for each class type without causing resource fragmentation. Furthermore, we design three new bandwidth preemption algorithms for three bandwidth constraint models, respectively. An extensive simulation study is carried out to evaluate the effectiveness of the bandwidth constraint models and preemption algorithms. Comparing with the existing constraint models and preemption rules, the proposed Max-Min constraint model and preemption algorithms improve not only bandwidth efficiency, but also robustness and fairness. They achieve significant performance improvement for the well-behaving traffic classes, in terms of bandwidth utilization, bandwidth blocking and preemption probability. We also provide guidelines for selecting different DS-TE bandwidth management mechanisms.