INFOCOM
2002
IEEE
13 years 9 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
COSIT
2003
Springer
13 years 9 months ago
2003
Springer
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
SIGECOM
2005
ACM
13 years 10 months ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
COMPGEOM
2006
ACM
13 years 10 months ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
Abstract— In sensor network localization, multihop based approaches were proposed to approximate the shortest paths to Euclidean distances between pairwise sensors. A good approx...
TACAS
2007
Springer
13 years 10 months ago
2007
Springer
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
NETCOOP
2007
Springer
13 years 10 months ago
2007
Springer
In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This...
ICCTA
2007
IEEE
13 years 10 months ago
2007
IEEE
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
INFOCOM
2007
IEEE
13 years 10 months ago
2007
IEEE
— Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer li...
SLS
2009
Springer
13 years 11 months ago
2009
Springer
Ant Colony Optimization (ACO) is inspired by the ability of ant colonies to find shortest paths between their nest and a food source. We analyze the running time of different ACO...