Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping
IEEE/ACM Transactions on Networking (TON)
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
A framework for guaranteeing statistical QoS
IEEE/ACM Transactions on Networking (TON)
Optimal partition of QoS requirements on unicast paths and multicast trees
IEEE/ACM Transactions on Networking (TON)
Local Allocation of End-to-End Quality-of-Service in High-Speed Networks
Proceedings of the IFIP TC6 Task Group/WG6.4 International Workshop on Performance of Communication Systems: Modelling and Performance Evaluation of ATM Technology
Efficient provisioning algorithms for network resource virtualization with qos guarantees
Efficient provisioning algorithms for network resource virtualization with qos guarantees
Computer Networks: A Systems Approach, 3rd Edition
Computer Networks: A Systems Approach, 3rd Edition
Call admission and resource reservation for multicast sessions
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Routing virtual circuits with timing requirements in virtual path based ATM networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
An aggregate marker for bandwidth fairness in DiffServ
Journal of Network and Computer Applications
| Hi-index | 0.24 |
End-to-end delay guarantees are critical to many delay-sensitive applications. To ensure such a guarantee on a flow path, the existing approaches usually statically divide its end-to-end delay requirement into per-hop delay requirements. However, such static path-level resource allocations often cause unbalanced resource reservations and bottlenecks in a network as shown in this paper, limit the total number of sessions accommodated in the network, and result in low network utilization. To address this issue, we propose a Dynamic Allocation Adjustment (DAA) approach to improve bandwidth efficiency by spreading loads over a flow path and other related links not on the path. Our simulation results show that DAA is able to significantly increase the total number of flows admitted into a network by 30% or more, compared with the best existing solution. Furthermore, it efficiently utilizes bandwidth by greatly reducing the average flow reservation at a link and the total resources reserved for a flow on its entire path.