Sciweavers

763 search results - page 106 / 153
» Engineering Shortest Path Algorithms
Sort
View
ESA
2010
Springer
185views Algorithms» more  ESA 2010»
13 years 10 months ago
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robe...
INFOCOM
2007
IEEE
14 years 4 months ago
Routing with a Markovian Metric to Promote Local Mixing
— Routing protocols have traditionally been based on finding shortest paths under certain cost metrics. A conventional routing metric models the cost of a path as the sum of the...
Yunnan Wu, Saumitra M. Das, Ranveer Chandra
GLOBECOM
2007
IEEE
14 years 4 months ago
The Scalability and Performance of Common Vector Solution to Generalized Label Continuity Constraint in Hybrid Optical/Packet Ne
—In hybrid Optical/packet networks, wavelength and VLAN tag continuity along a Label Switched Path are two common constraints. These two types of constraints, referred to as Gene...
Shujia Gong, Bijan Jabbari
WWW
2009
ACM
14 years 10 months ago
Social search in "Small-World" experiments
The "algorithmic small-world hypothesis" states that not only are pairs of individuals in a large social network connected by short paths, but that ordinary individuals ...
Sharad Goel, Roby Muhamad, Duncan J. Watts
CCR
2004
157views more  CCR 2004»
13 years 9 months ago
Designing BGP-based outbound traffic engineering techniques for stub ASes
Today, most multi-connected autonomous systems (AS) need to control the flow of their interdomain traffic for both performance and economical reasons. This is usually done by manu...
Steve Uhlig, Olivier Bonaventure