Sciweavers

581 search results - page 29 / 117
» Approximation algorithms for constructing wavelength routing...
Sort
View
INFOCOM
1995
IEEE
15 years 5 months ago
A Fast Bypass Algorithm for High-Speed Networks
In this work we suggest an algorithm that increases the reservation success probability for bursty tra c in high speed networks by adding exibility to the construction of the rout...
Israel Cidon, Raphael Rom, Yuval Shavitt
PERCOM
2007
ACM
15 years 7 months ago
An Adaptive Algorithm for Fault Tolerant Re-Routing in Wireless Sensor Networks
A substantial amount of research on routing in sensor networks has focused upon methods for constructing the best route, or routes, from data source to sink before sending the dat...
Michael Gregoire, Israel Koren
INFOCOM
2009
IEEE
15 years 8 months ago
Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
Satyajayant Misra, Guoliang Xue, Dejun Yang
INFOCOM
2003
IEEE
15 years 6 months 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...
EUC
2004
Springer
15 years 6 months ago
VChord: Constructing Peer-to-Peer Overlay Network by Exploiting Heterogeneity
High heterogeneity is an unignoring factor for large-scale peer-to-peer system which leads to the born of VChord. VChord is a peer-to-peer overlay network constructed on Chord aime...
Feng Hong, Minglu Li, Xinda Lu, Yi Wang, Jiadi Yu,...