315 search results - page 12 / 63 » Dynamic vs. Oblivious Routing in Network Design |
CONEXT
2010
ACM
14 years 11 months ago
2010
ACM
We introduce a protocol which routes on flat, locationindependent identifiers with guaranteed scalability and low stretch. Our design builds on theoretical advances in the area of...
103
click to vote
PODC
2003
ACM
15 years 6 months ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
CONEXT
2008
ACM
15 years 3 months ago
2008
ACM
Today's Internet's routing paths are inefficient with respect to both connectivity and the market for interconnection. The former manifests itself via needlessly long pa...
121
click to vote
INFOCOM
2006
IEEE
15 years 7 months ago
2006
IEEE
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
SAC
2009
ACM
15 years 8 months ago
2009
ACM
Current mobile devices support multiple network technologies and network composition via such devices can enable service provisioning across heterogeneous networks. One of the key...