(Enter summary)
Abstract: To provide real-time service, integrated networks require
the underlying routing algorithm to be able to
find low-cost paths that satisfy given Quality of Service
(QoS) constraints. The problem of constrained
shortest (least-cost) path routing is known to be NPhard,
and some heuristics have been proposed to find a
near-optimal solution. However, these heuristics either
impose relationships among the link metrics to reduce
the complexity of the problem which may limit the general
applicability... (Update)
Context of citations to this paper: More
...detects a feasible path. This can also be applied to bandwidth constrained least cost routing. Delay Cost Constrained Routing (DCCR) [27] rapidly generate a near optimal delayconstrained path, then, it employs the k shortest path algorithm proposed by Chong et al. with a new...
.... based on the combination of link weights and the given constraint, hoping that one of these paths is feasible and near optimal [24] [25], 26] 27] The value of k determines the performance and overhead of this approach; if k is large, the algorithm has good performance...
Cited by: More
Support for Service Composition in i3 - Karthik Lakshminarayanan Ion
(Correct)
Efficient Provisioning Algorithms for Network Resource.. - Gopalan (2003)
(Correct)
QoS routing: Average Complexity and Hopcount in m dimensions - Kuipers, Van Mieghem
(Correct)
Similar documents (at the sentence level):
67.9%: Search Space Reduction in QoS Routing - Guo, Matta (1998)
(Correct)
Related documents from co-citation: More All
7: Introduction to algorithms (context) - Cormen, Leiserson et al. - 1991
6: On finding multi-constrained paths
- Chen, Nahrstedt - 1998
5: A distributed algorithm for delay-constrained unicast routing
- Salama, Reeves et al. - 1997
BibTeX entry: (Update)
L. Guo and I. Matta. Search Space Reduction in QoS Routing. Technical Report NU-CCS-98-09, College of Computer Science, Northeastern University, October 1998. http://citeseer.ist.psu.edu/guo98search.html More
@inproceedings{ guo99search,
author = "Liang Guo and Ibrahim Matta",
title = "Search Space Reduction in QoS Routing",
booktitle = "International Conference on Distributed Computing Systems",
pages = "142-149",
year = "1999",
url = "citeseer.ist.psu.edu/guo98search.html" }
Citations not processed or no citations identified.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.bu.edu/groups/wing/Papers.html): More
Packing and Least-Loaded Based Routing in Multi-Rate Loss.. - Matta, Krunz (1997)
(Correct)
An Iterative Approach to Comprehensive Performance Evaluation .. - Matta, Shankar (1994)
(Correct)
Dynamic Routing of Real-Time Virtual Circuits - Matta, Shankar (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC