Virtual clock: a new traffic control algorithm for packet switching networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Hierarchical packet fair queueing algorithms
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
Routing with end-to-end QoS guarantees in broadband networks
IEEE/ACM Transactions on Networking (TON)
Evaluating the impact of stale link state on quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Difficulties in simulating the internet
IEEE/ACM Transactions on Networking (TON)
Hop-by-hop quality of service routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Distributed Algorithm for Delay-Constrained Unicast Routing
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
QoS based routing algorithm in integrated services packet networks
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
Algorithms for packet classification
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Quality-of-service routing (QoSR), seeking to find a feasible path with multiple constraints, is an NP-complete problem. We propose a novel precomputation approach to multi-constrained intra-domain QoS routing (PMCP). It is assumed that a router maintains the link state information of the entire domain. PMCP cares each QoS weight to several degrees, and computes a number of QoS coefficients uniformly distributed in the multi-dimensional QoS metric space. Based on each coefficient, a linear QoS function is constructed to convert the multiple QoS metrics to a single QoS value. We then create a shortest path tree with respect to the QoS value by Dijkstra's algorithm. Finally, according to the multiple coefficients, different shortest path trees are calculated to compose the QoS routing table. We analyze linear QoS functions in the QoS metric space, and give a mathematical model to determine the feasibility of a QoS request in the space. After PMCP is introduced, we analyze its computational complexity and present a method of QoS routing table lookup. Extensive simulations evaluate the performance of the proposed algorithm and present a comparative study.