Prioritized resource allocation for stressed networks
IEEE/ACM Transactions on Networking (TON)
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Loss probabilities of hand-in traffic under various protocols: II. model comparisons
Performance Evaluation
Dynamic inter-SLA resource sharing in path-oriented differentiated services networks
IEEE/ACM Transactions on Networking (TON)
Efficient resource allocation for policy-based wireless/wireline interworking
Mobile Networks and Applications
Preemptive and delay-based mechanisms to provide preference to emergency traffic
Computer Networks and ISDN Systems
A generic architecture for autonomic service and network management
Computer Communications
EURASIP Journal on Applied Signal Processing
Bandwidth Management for Supporting Differentiated Service Aware Traffic Engineering
IEEE Transactions on Parallel and Distributed Systems
Hybrid optimization for QoS control in IP Virtual Private Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Self-similar simulation of IP traffic for wireless networks
International Journal of Mobile Network Design and Innovation
Maximizing the capacity of mobile cellular networks with heterogeneous traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking
Preemptive and delay-based mechanisms to provide preference to emergency traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling and simulation of self-similar wireless IP network traffic
WTS'09 Proceedings of the 2009 conference on Wireless Telecommunications Symposium
Control plane architecture for QoS in OBS networks using dynamic wavelength assignment
Art-QoS'03 Proceedings of the 2003 international conference on Architectures for quality of service in the internet
Multi-level dynamic guard channels for priority access in cellular systems
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
DDP: A Dynamic Dimensioning and Partitioning model of Virtual Private Networks resources
Computer Communications
| Hi-index | 0.07 |
We consider virtual partitioning (VP), which is a scheme for sharing a resource among several traffic classes in an efficient, fair, and robust manner. In the preliminary design stage, each traffic class is allocated a nominal capacity, which is based on expected offered traffic and required quality of service. During operations, if the current capacity usage by a class exceeds its nominal allocation, then it is declared to be in “overload,” and a state-dependent trunk reservation mechanism gives it lower priority in the admission of new calls. We develop efficient computational algorithms for the case of heterogeneous traffic, and perform extensive numerical experiments to demonstrate the accuracy of the various approximations. The performance of VP is examined and compared to that of complete sharing and complete partitioning. Particular weight is placed on robustness, meaning that traffic classes with arrival rates conforming to the design continue to receive the required quality of service, despite the presence of misbehaving classes with excessive arrival rates. We adopt a reward-penalty paradigm as a combined measure for efficiency and fairness, and show that not only is the revenue generated by VP extremely close to the maximum achievable value, but that the structural form of the optimal policy also closely resembles that of VP. The numerical results confirm that the scheme is efficient, fair, and very robust