Exact and Heuristic Algorithms for Multi-constrained Path Selection Problem

Authors:
Wen-Lin Yang
Affiliations:
-
Venue:
PCM '02 Proceedings of the Third IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Year:
2002

Citing 5
Cited 1

Internetworking with TCP/IP (2nd ed.), vol. I

Internetworking with TCP/IP (2nd ed.), vol. I
QoS based multicast routing algorithms for real time applications

Performance Evaluation - Special issue on performance and control of network systems
Routing with end-to-end QoS guarantees in broadband networks

IEEE/ACM Transactions on Networking (TON)
Solving the MCOP Problem Optimally

LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
An efficient algorithm for finding a path subject to two additive constraints

Computer Communications

A comparison of two optimal approaches for the MCOP problem

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multi-constrained path (MCP) selection problem occurs when the quality of services (QoS) are supported for point-to-point connections in the distributed multimedia applications deployed on the Internet. This NP-complete problem is concerned how to determine a feasible path between two end-points, so that a set of QoS path constraints can be satisfied simultaneously. Based on the branch-and-bound technology and tabu-searching strategy, an optimal algorithm and a heuristic algorithm are proposed in this paper. The experimental results show that our heuristic algorithm not only has very good performance on several different network topologies, but also is very efficient method for solving large-scale MCP problem.