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...
— 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...
—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...
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 ...
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...