Sciweavers

478 search results - page 2 / 96
» Diameter and Center Computations in Networks
Sort
View
CONEXT
2007
ACM
13 years 10 months ago
The diameter of opportunistic mobile networks
Portable devices have more data storage and increasing communication capabilities everyday. In addition to classic infrastructure based communication, these devices can exploit hu...
Augustin Chaintreau, Abderrahmen Mtibaa, Laurent M...
PODC
2004
ACM
13 years 11 months ago
Compact routing on euclidian metrics
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
Ittai Abraham, Dahlia Malkhi
INFOCOM
2009
IEEE
14 years 18 days ago
FiConn: Using Backup Port for Server Interconnection in Data Centers
Abstract— The goal of data center networking is to interconnect a large number of server machines with low equipment cost, high and balanced network capacity, and robustness to l...
Dan Li, Chuanxiong Guo, Haitao Wu, Kun Tan, Songwu...
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
14 years 1 days ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
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...
Beat Gfeller, Nicola Santoro, Peter Widmayer