Graphs and algorithms
Algorithmic graph theory
Solving k-shortest and constrained shortest path problems efficiently
Annals of Operations Research
Introduction to algorithms
Computers and Operations Research
Topology distribution cost vs. efficient routing in large networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Scalable inter-domain routing architecture
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Routing in multidomain networks
IEEE/ACM Transactions on Networking (TON)
Routing in communications networks
Routing in communications networks
Algorithm for efficient generation of link-state updates in ATM networks
Computer Networks and ISDN Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Distributed Multimedia and QOS: A Survey
IEEE MultiMedia
Adaptive source routing of real-time traffic in integrated services networks
Adaptive source routing of real-time traffic in integrated services networks
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
The viewserver hierarchy for interdomain routing: protocols and evaluation
IEEE Journal on Selected Areas in Communications
Routing subject to quality of service constraints in integrated communication networks
IEEE Network: The Magazine of Global Internetworking
Inter-domain QoS routing on Diffserv networks: a region-based approach
Computer Communications
Hi-index | 0.24 |
In this paper we propose a scalable QoS-based inter-domain routing scheme for distributed multimedia applications in a high speed wide area network. The problem of QoS-based routing is formulated as a multicriteria shortest path problem, known as NP-complete [1,2] [W.C. Lee, M.G. Hluchyj, P.A. Humbler, Routing subject to quality of service constraints in integrated communication networks, IEEE Network (July/August 1995) 46-55. Z. Wang, J. Crowcroft, Quality of service routing for supporting multimedia applications, IEEE J. Select. Areas Commun. Special Issues on Multimedia Systems]. Our scheme consists of two phases. In Phase 1, we present a way of mapping the network into a graph that contains a part of the network topology which is neglected completely or partially by existing routing schemes, thus maintaining more accurate topology information. In Phase 2, we develop a heuristic call-by-call algorithm, based on each edge's minimum normalized slackness to the QoS requested, for selecting a feasible path efficiently in depth first search (DFS)-like manner on the graph and tailoring to each application's QoS requirements. Note that our routing scheme is one of a few QoS-based hierarchical routing schemes that address explicitly the issue of selecting a path with multiple metrics.