Abstract—This paper describes the implementation of ARPPath (a.k.a. FastPath) bridges, a recently proposed concept for low latency bridges, in Linux/Soekris and OpenFlow/NetFPGA ...
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
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...
—This paper presents the CONTRACT framework to address a fundamental deficiency of the IP network control plane, namely the lack of coordination between an IGP and other control...
Zheng Cai, Florin Dinu, Jie Zheng, Alan L. Cox, T....
The result of a distance join operation on two sets of objects R, S on a spatial network G is a set P of object pairs <p, q>, p R, q S such that the distance of an object ...