Introduction to algorithms
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
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
IEEE Network: The Magazine of Global Internetworking
Optimal and heuristic algorithms for quality-of-service routing with multiple constraints
Performance Evaluation
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
An efficient quality of service routing algorithm for delay-sensitive applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Sexual Elitist Genetic Algorithm for Providing QoS in Distributed Virtual Environment Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07
Reliability constrained routing in QoS networks
IEEE/ACM Transactions on Networking (TON)
Approximation Algorithms for Multiconstrained Quality-of-Service Routing
IEEE Transactions on Computers
Multi-constrained soft-QoS provisioning in wireless sensor networks
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
A distributed approach for multi-constrained path selection and routing optimization
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
A genetic approach for adding QoS to distributed virtual environments
Computer Communications
Simulated Annealing Based Multi-constrained QoS Routing in Mobile ad hoc Networks
Wireless Personal Communications: An International Journal
Finding a path subject to many additive QoS constraints
IEEE/ACM Transactions on Networking (TON)
Loop-free constrained path computation for hop-by-hop QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multiconstrained QoS Routing: A Norm Approach
IEEE Transactions on Computers
Finding multi-constrained feasible paths by using depth-first search
Wireless Networks
A Latency-Aware Partitioning Method for Distributed Virtual Environment Systems
IEEE Transactions on Parallel and Distributed Systems
Adaptive QoS provisioning by pricing incentive QoS routing for next generation networks
Computer Communications
Multiconstrained QoS multipath routing in wireless sensor networks
Wireless Networks
Polynomial time approximation algorithms for multi-constrained QoS routing
IEEE/ACM Transactions on Networking (TON)
Routing and scheduling connections in networks that support advance reservations
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Distributed Exact Solution to Compute Inter-domain Multi-constrained Paths
EUNICE '09 Proceedings of the 15th Open European Summer School and IFIP TC6.6 Workshop on The Internet of the Future
Cross-Layer Design for QoS in Wireless Mesh Networks
Wireless Personal Communications: An International Journal
Finding a least hop(s) path subject to multiple additive constraints
Computer Communications
A case for tree evolution in QoS multicasting
Computer Communications
On selecting the cost function for source routing
Computer Communications
An iterative distributed algorithm for multi-constraint multicast routing
Computer Communications
An efficient quality of service routing algorithm for delay-sensitive applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Precomputation for intra-domain QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
A multi-constrained quality of service routing algorithm based on vector converting
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Minimal traffic-constrained similarity-based SOAP multicast routing protocol
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Approximation algorithm for QoS routing with multiple additive constraints
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A survey on multi-constrained optimal path computation: Exact and approximate algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Joint multi-cost routing and power control in wireless ad hoc networks
Wireless Networks
Jitter-minimized reliability-maximized management of networks
International Journal of Network Management
Optimized multi constrained path quality of service routing protocol
WSEAS Transactions on Information Science and Applications
Lexicographical minimization of routing hops in telecommunication networks
INOC'11 Proceedings of the 5th international conference on Network optimization
Routing with multiple quality-of-services constraints: An approximation perspective
Journal of Network and Computer Applications
Improved limited path heuristic algorithm for multi-constrained qos routing
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An end-to-end qos provisioning architecture in IPv6 networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Energy efficient online routing of flows with additive constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
Exploring routing with multiple Quality of Service parameters in High-Speed Networks
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Reactive service selection in dynamic service environments
ESOCC'12 Proceedings of the First European conference on Service-Oriented and Cloud Computing
| Hi-index | 0.01 |
Multiconstrained quality-of-service (QoS) routing deals with finding routes that satisfy multiple independent QoS constraints. This problem is NP-hard. In this paper, two heuristics, the limited granularity heuristic and the limited path heuristic, are investigated. Both heuristics extend the Bellman-Ford shortest path algorithm and solve general k-constrained QoS routing problems. Analytical and simulation studies are conducted to compare the time/space requirements of the heuristics and the effectiveness of the heuristics in finding paths that satisfy the QoS constraints. The major results of this paper are the following. For an N-nodes and E-edges network with k (a small constant) independent QoS constraints, the limited granularity heuristic must maintain a table of size O(|N|k- 1) in each node to be effective, which results in a time complexity of O (|N|K|E|); while the limited path heuristic can achieve very high performance by maintaining O (|N|2lg(|N|)) entries in each node. These results indicate that the limited path heuristic is relatively insensitive to the number of constraints and is superior to the limited granularity heuristic in solving k-constrained QoS routing problems when k 3.