Routing with end-to-end QoS guarantees in broadband networks
IEEE/ACM Transactions on Networking (TON)
An efficient algorithm for finding a path subject to two additive constraints
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Evaluating the impact of stale link state on quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Resource Allocation and Admission Control Styles in QoS DiffServ Networks
QoS-IP '01 Proceedings of the International Workshop on Quality of Service in Multiservice IP Networks
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
Routing and rate allocation in rate-based multi-class networks
Performance Evaluation
Reducing traffic fluctuations of link state QoS routing algorithms in virtual circuit networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Precomputation for intra-domain QoS routing
Computer Networks and ISDN Systems
Adaptive QoS provisioning by pricing incentive QoS routing for next generation networks
Computer Communications
Joint resource conserving and load distributing approaches for routing of survivable connections
Computer Communications
Finding a least hop(s) path subject to multiple additive constraints
Computer Communications
Precomputation for intra-domain QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In this paper we study QoS based routing algorithm for supporting resource reservation in high-speed Integrated Services Packet Network (ISPN). Recently, this problem was proved to be NP-complete. However, when the considered QoS constraints are bandwidth, delay, delay jitter, and loss free, we have shown that by employing Weighted Fair Queueing (WFQ) service discipline, the complexity of the problem could be reduced to that of shortest path routing without any QoS constraints. Then such a multiple QoS constrained route could be searched in polynomial time. We also present the routing algorithm (called "QoSR/sub BF/"), which is a modified version of Bellman-Ford shortest path algorithm. Simulation results show that QoSR/sub BF/ has better performance compared to the existing QoS routing algorithms.