Sciweavers

27 search results - page 2 / 6
» Engineering Label-Constrained Shortest-Path Algorithms
Sort
View
GLOBECOM
2007
IEEE
13 years 11 months ago
LSP Setup Arrival Reordering Approach for MPLS-TE Routing
— In this paper, we evaluate a solution based on the preemption mechanism so as to improve performances of distributed Multi-Protocol Label Switching-Traffic Engineering (MPLS-T...
Imène Chaieb, Jean-Louis Le Roux, Bernard C...
PUK
2003
13 years 6 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
14 years 1 days ago
Accelerating Multi-modal Route Planning by Access-Nodes
Recent research on fast route planning algorithms focused either on road networks or on public transportation. However, on the long run, we are interested in planning routes in a m...
Daniel Delling, Thomas Pajor, Dorothea Wagner
ICFEM
2000
Springer
13 years 9 months ago
Formal Treatment of a Family of Fixed-Point Problems on Graphs by CafeOBJ
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
Tetsuo Tamai
ITCC
2003
IEEE
13 years 10 months ago
Alternate Path Routing Algorithm for Traffic Engineering in the Internet
In this paper, a new algorithm to route traffic efficiently is proposed. The proposed algorithm finds additional routes to the destination and identifies the critical links in the...
Shyam Subramanian, Muthukumar Venkatesan