Download:
|
by Liang Guo, Ibrahim Matta
In Proceedings of the 19th International Conference on Distributed Computing Systems
http://www.ccs.neu.edu/home/matta/Papers/SSR98-TR.ps
Add To MetaCart
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. However, the problem of constrained shortest (least-cost) path routing is known to be NP-hard, 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 of the heuristic, or are too costly in terms of execution time to be applicable to large networks. In this paper, we focus on solving the delay-constrained minimum-cost path problem, and present a fast algorithm to find a near-optimal solution. This algorithm, namely DCCR (for Delay-Cost-Constrained Routing), is a variant of the k-shortest path algorithm. DCCR uses a new adaptive path weight function together with an additional constraint imposed on the path cost, to restrict the search space. Thus, DCCR can return a near-optimal solution in a very short time. Furthermore, we use the method proposed by Blokh and Gutin [1] to further reduce the search space by using a tighter bound on path cost. This makes our algorithm more accurate and even faster. We call this improved algorithm SSR+DCCR (for Search Space Reduction+DCCR). Through extensive simulations, we confirm that SSR+DCCR performs very well compared to the optimal but very expensive solution. 1
Citations
|
7709
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
5824
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 1990
|
|
578
|
An architecture for differentiated services
– Blake, Black, et al.
- 1998
|
|
473
|
Routing of multipoint connections
– Waxman
- 1988
|
|
217
|
Quality-of-service routing for supporting multimedia applications
– Wang, Crowcroft
- 1996
|
|
94
|
A.Orda, QoS Routing in Networks with Uncertain Parameters
– Lorenz
|
|
78
|
On finding multi-constrained paths
– Chen, Nahrstedt
- 1998
|
|
76
|
A Distributed Algorithm for Delay-Constrained Unicast Routing
– Salama, Reeves, et al.
- 1997
|
|
73
|
Algorithms for finding paths with multiple constraints
– Jaffe
|
|
60
|
An architecture for Di erentiated Services
– Blake
- 1998
|
|
59
|
The Design and Evaluation of Routing Algorithms for Real-Time Channels
– Widyono
- 1994
|
|
52
|
Quality-of-service routing for traffic with performance guarantees; IWQoS’97
– Ma, Steenkiste
- 1997
|
|
50
|
Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks
– Salama, Reeves, et al.
- 1997
|
|
19
|
An approximation algorithm for combinatorial optimization problems with two parameters
– Blokh, Gutin
- 1996
|
|
15
|
On finding single-source single-destination k shortest paths
– Chong, Maddila, et al.
- 1995
|
|
14
|
An Efficient Multicast Routing Algorithm for Delay-sensitive Applications with Dynamic Membership
– Hong, Lee, et al.
- 1998
|
|
14
|
A New Distributed Routing Algorithm with End-to-End Delay Guarantee
– Sun, Langendorfer
- 1997
|
|
1
|
node u has k records, (D; C; W;nd ; idx ; mark), which is stored in ND(u; idx), where nd points to the predecessor node on that path and idx points to the predecessor's record of that path. A min-heap MH is maintained in increasing weight order, each he
– Each
|
|
1
|
1)) /* Searching start from s
– HeapInsert
|
|
1
|
l2p c(l) /* trace back this new path p and compute its cost
– P
|
|
1
|
C(p), p best p
– best
|
|
1
|
idx):D + d(u; v), C(v) ND(u; idx):C + c(u; v
– ND
|
|
1
|
A Multiple Quality of Service Routing Algorithm for PNNI
– Neve, Miegeham
- 1998
|
|
1
|
node u has k records, (idx; D; C; W;��nd ; �� idx ), which is stored in ND(u). A min-heap MH is maintained in increasing weight order, each heap item has the form (n id; wgt; idx
– Each
|
|
1
|
ND(u; idx):D + d(u; v), C(v) / ND(u; idx):C + c(u; v
– unknown authors
|
|
1
|
node u has k
– Each
|
|
1
|
trace back this new path p and compute its cost
– unknown authors
|
|
1
|
πnd,πidx,mark
– ND
|
|
1
|
ND(u, idx).W )whereidx is the index of the path with maximum weight and ND(u, idx).mark = UNVISITED
– Return
|
