192 search results - page 10 / 39 » The Stretched Network: Properties, Routing, and Performance |
SIGCOMM
2004
ACM
14 years 4 months ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
FSTTCS
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
SIROCCO
2008
14 years 11 days ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
IPTPS
2004
Springer
14 years 4 months ago
2004
Springer
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...
INFOCOM
2006
IEEE
14 years 5 months ago
2006
IEEE
— In the context of IEEE 802.11b network testbeds, we examine the differences between unicast and broadcast link properties, and we show the inherent difficulties in precisely e...