Sciweavers

3 search results - page 1 / 1
» Papillon: Greedy Routing in Rings
Sort
View
WDAG
2005
Springer
102views Algorithms» more  WDAG 2005»
13 years 10 months ago
Papillon: Greedy Routing in Rings
We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such ...
Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku
TKDE
2008
128views more  TKDE 2008»
13 years 4 months ago
A Virtual Ring Method for Building Small-World Structured P2P Overlays
This paper presents a general virtual ring method to design and analyze small-world structured P2P networks on the base es embedded in ID spaces with distance metric. Its basic ide...
Hai Zhuge, Xiaoping Sun
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
13 years 10 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang