Sciweavers

213 search results - page 26 / 43
» Alternate Path Routing for Multicast
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—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-...
Andrej Cvetkovski, Mark Crovella
DSN
2003
IEEE
14 years 26 days ago
A Study of Packet Delivery Performance during Routing Convergence
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...
VIS
2008
IEEE
91views Visualization» more  VIS 2008»
14 years 8 months ago
Effective Visualization of Short Routes
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...
DSN
2004
IEEE
13 years 11 months ago
On Failure Dependent Protection in Optical Grooming Networks
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...
Srinivasan Ramasubramanian
INFOCOM
2003
IEEE
14 years 25 days ago
Algorithms for Computing QoS Paths with Restoration
— 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...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...