Sciweavers

763 search results - page 75 / 153
» Engineering Shortest Path Algorithms
Sort
View
INFOCOM
2000
IEEE
15 years 5 months ago
Minimum Interference Routing with Applications to MPLS Traffic Engineering
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding...
Murali S. Kodialam, T. V. Lakshman
123
Voted
INFOCOM
2002
IEEE
15 years 7 months ago
Routing Restorable Bandwidth Guaranteed Connections using Maximum 2-Route Flows
Abstract—Routing with service restorability is of much importance in Multi-Protocol Label Switched (MPLS) networks, and is a necessity in optical networks. For restoration, each ...
Koushik Kar, Murali S. Kodialam, T. V. Lakshman
110
Voted
CCCG
2007
15 years 3 months ago
Optimal Schedules for 2-guard Room Search
We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the g...
Stephen Bahun, Anna Lubiw
INFORMATICALT
2006
80views more  INFORMATICALT 2006»
15 years 2 months ago
Scheduling Trajectories on a Planar Surface with Moving Obstacles
An algorithm for scheduling the trajectory of a point object, which moves on a plane surface comprising of moving obstacles, is introduced. Different quantitative criteria may be m...
Emmanuel Stefanakis
113
Voted
FASE
2009
Springer
15 years 6 months ago
Algorithms for Automatically Computing the Causal Paths of Failures
We have proposed an automated debugging technique that explains a failure by computing its causal path leading from the root cause to the failure. Given a failing execution, the te...
William N. Sumner, Xiangyu Zhang