Sciweavers

970 search results - page 99 / 194
» On encodings of spanning trees
Sort
View
SPAA
2010
ACM
14 years 1 months ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...
WONS
2005
IEEE
14 years 2 months ago
The Pulse Protocol: Mobile Ad hoc Network Performance Evaluation
— We present a performance evaluation of the Pulse protocol operating in a peer-to-peer mobile ad hoc network environment. The Pulse protocol utilizes a periodic flood (the puls...
Baruch Awerbuch, David Holmer, Herbert Rubens
WOWMOM
2005
ACM
113views Multimedia» more  WOWMOM 2005»
14 years 2 months ago
High Throughput Routing in Hybrid Cellular and Ad-Hoc Networks
—Hybrid networks are a promising architecture that builds ad hoc, wireless networks around the existing cellular telephony infrastructure. In this paper we present DST, a routing...
Ioannis Ioannidis, Bogdan Carbunar, Cristina Nita-...
INFOCOM
2002
IEEE
14 years 1 months ago
Design and Scalability of NLS, a Scalable Naming and Location Service
This paper sketches the design, and presents a scalability analysis and evaluation of NLS, a scalable naming and location service. NLS resolves textual names to the nearest of a s...
Y. Charlie Hu, Daniel Rodney, Peter Druschel
COMPGEOM
1993
ACM
14 years 1 months ago
Worst-Case Bounds for Subadditive Geometric Graphs
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
Marshall W. Bern, David Eppstein