—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Internet measurements have shown that network failures happen frequently, and that existing routing protocols can take multiple seconds, or even minutes, to converge after a failu...
Dan Pei, Lan Wang, Daniel Massey, Shyhtsun Felix W...
In this work we develop a new alternative to conventional maps for visualization of relatively short paths as they are frequently encountered in hotels, resorts or museums. Our app...
Patrick Degener, Ruwen Schnabel, Christopher Sch...
Resiliency to link failures in optical networks is becoming increasingly important due to the increasing data rate in the fiber. Path protection schemes attempt to guarantee a bac...
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...