1061 search results - page 115 / 213 » On Compact Routing for the Internet |
WDAG
2007
Springer
15 years 4 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
WADS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
CCS
2010
ACM
14 years 10 months ago
2010
ACM
A network latency estimation scheme associates a "position" to every peer in a distributed network such that the latency between any two nodes can be accurately estimate...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
— For both technological and economic reasons, the default path between two end systems in the wide-area Internet can be suboptimal. This observation has motivated a number of sy...
SSS
2009
Springer
15 years 4 months ago
2009
Springer
The emergence of large-scale distributed applications based on many-to-many communication models, e.g., broadcast and decentralized group communication, has an important impact on ...