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
Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architectures, Fourth Edition
Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architectures, Fourth Edition
Introduction to Algorithms
An improved FPTAS for restricted shortest path
Information Processing Letters
A taxonomy for multimedia service composition
Proceedings of the 12th annual ACM international conference on Multimedia
SpiderNet: An Integrated Peer-to-Peer Service Composition Framework
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Towards building large scale multimedia systems and applications: challenges and status
Proceedings of the first ACM international workshop on Multimedia service composition
Dynamic Service Composition in Pervasive Computing
IEEE Transactions on Parallel and Distributed Systems
Service-oriented multimedia delivery in pervasive space
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Distributed multimedia service composition with statistical QoS assurances
IEEE Transactions on Multimedia
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.01 |
A lot of network services and applications are being designed to support quality-of-service (QoS) routing. One of the key problems is to find a feasible path that satisfies multiple QoS requirements, i.e., Multi-Constrained Path (MCP) problem which is known to be NP-complete. Many heuristic and approximation algorithms have been proposed to solve this problem. However, most of them converted it into the classic shortest path problem by transforming multiple QoS weights into single weight. In this paper, we propose a binary graph reduction (BGR) algorithm to convert network graph into a simplified graph by removing redundant edges before constructing a routing path. BGR improves system performance from two aspects: i) BGR decreases the decision-making time, which then decreases the delay of end users; ii) BGR removes some abnormal anti-heuristic redundant edges from network graph, so that the actual routing algorithm could get a better result. We use a multimedia delivery system to illustrate these advantages in this paper. Simulation results also approve the efficiency of the proposed BGR algorithm.