Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
312
Abstract D1HT: A Distributed One Hop Hash Table
, 2005
"... Distributed Hash Tables (DHTs) have been used in a variety of applications, but most DHTs so far have opted to solve lookups with multiple hops, which sacrifices performance in order to keep little routing information and minimize maintenance traffic. In this paper, we introduce D1HT, a novel single ..."
Abstract
- Add to MetaCart
that D1HT has reasonable maintenance bandwidth requirements even for multi-million node systems while presenting up to one order of magnitude less bandwidth overhead than previous single hop DHT. 1
D1HT: A Distributed One Hop Hash Table
- in Proc. of IPDPS, Apr 2006. [Online]. Available: http://www.lcp.coppe.ufrj.br
"... Distributed Hash Tables (DHTs) have been used in a variety of applications, but most DHTs so far have opted to solve lookups with multiple hops, which sacrifices performance in order to keep little routing information and minimize maintenance traffic. In this paper, we introduce D1HT, a novel single ..."
Abstract
-
Cited by 15 (2 self)
- Add to MetaCart
, and present a Quarantine-like mechanism to reduce the overhead caused by volatile peers. Our analyses show that D1HT has reasonable maintenance bandwidth requirements even for very large systems, while presenting at least twice less bandwidth overhead than previous single hop DHT. 1.
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
- In Proceedings of 13 th Annual International Symposium on Algorithms and Computation (ISAAC
, 2002
"... We consider the problem of waking up n processors in a completely broadcast system. We analyze this problem in both globally and locally synchronous models, with or without n being known to processors and with or without labeling of processors. The main question we answer is: how fast we can wake ..."
Abstract
-
Cited by 64 (0 self)
- Add to MetaCart
synchronization, no knowledge of n or labeling) the best waking time is O(n/logn). We also show logarithmic or polylogarithmic waking algorithms for all stronger models, which in some cases gives an exponential improvement over previous results.
Single-Hop Probing Asymptotics in Available Bandwidth Estimation: Sample-Path Analysis
- ACM IMC
, 2004
"... In this paper, we take the sample-path approach in analyzing the asymptotic behavior of single-hop bandwidth estimation under bursty cross-traffic and show that these results are provably different from those observed under fluid models of prior work. This difference, which we call the probing bias, ..."
Abstract
-
Cited by 50 (10 self)
- Add to MetaCart
In this paper, we take the sample-path approach in analyzing the asymptotic behavior of single-hop bandwidth estimation under bursty cross-traffic and show that these results are provably different from those observed under fluid models of prior work. This difference, which we call the probing bias
Distributed topology construction of bluetooth personal area networks,”
- in INFOCOM,
, 2001
"... Abstract--In recent years, wireless ad hoc networks have been a growing area of research. While there has been considerable research on the topic of routing in such networks, the topic of topology creation has not received due attention. This is because almost all ad hoc networks to date have been ..."
Abstract
-
Cited by 149 (0 self)
- Add to MetaCart
devices to form short-range wireless ad hoc networks and is based on a frequency hopping physical layer. This fact implies that hosts are not able to communicate unless they have previously discovered each other by synchronizing their frequency hopping patterns. Thus, even if all nodes are within direct
DelayBounded Range Queries in DHT-based Peer-to-Peer Systems
- In 26th IEEE International Conference on Distributed Computing Systems (ICDCS
, 2006
"... Many general range query schemes for DHT-based peer-to-peer (P2P) systems have been proposed, which do not need to modify the underlying DHTs. However, most existing works have the query delay depending on both the scale of the system and the size of the query space or the specific query, and thus c ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
the results for any range query within 2logN hops in a P2P system with N peers. Results of analysis and simulations show that the average delay of Armada is less than logN, and the average message cost of single-attribute range queries is about logN+2ní2 (n is the number of peers that intersect with the query
Dynamic and distributed reconciliation in p2p-dht networks
- In European Conf. on Parallel Computing (Euro-Par
, 2006
"... Abstract. Optimistic replication can provide high data availability for collaborative applications in large scale distributed systems (grid, P2P, and mobile systems). However, if data reconciliation is performed by a single node, data availability remains an important issue since the reconciler node ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
Abstract. Optimistic replication can provide high data availability for collaborative applications in large scale distributed systems (grid, P2P, and mobile systems). However, if data reconciliation is performed by a single node, data availability remains an important issue since the reconciler
Maximization of Single Hop Traffic with Greedy Heuristics
, 2002
"... Maximization of the single hop traffic has been proposed as an computationally feasible approximation to the logical topology design problem in wavelength routed networks. In this paper we consider a class of greedy heuristic algorithms for solving the maximization of the single hop traffic problem. ..."
Abstract
- Add to MetaCart
Maximization of the single hop traffic has been proposed as an computationally feasible approximation to the logical topology design problem in wavelength routed networks. In this paper we consider a class of greedy heuristic algorithms for solving the maximization of the single hop traffic problem
Routing Protocols for k-hop Networks
, 2003
"... Previous research has identified the scalability limitations of stand-alone wireless ad hoc networks. Shared access to a single wireless channel in the presence of a dense network leads to congestion and high channel contention. Increasing the diameter of the network introduces long paths that becom ..."
Abstract
-
Cited by 8 (2 self)
- Add to MetaCart
Previous research has identified the scalability limitations of stand-alone wireless ad hoc networks. Shared access to a single wireless channel in the presence of a dense network leads to congestion and high channel contention. Increasing the diameter of the network introduces long paths
Robustness of a P2P Community Management System based on Two-level Hierarchical DHT Overlays
"... Abstract — The popularity of community-centric applications has rapidly grown during the recent years. In this paper, we evaluate the robustness of a P2P community management system, where communities are established as autonomous DHT overlays that are advertised in a global DHT overlay. The evaluat ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
traffic load and average hop count. The P2P community management system was also compared against a flat DHT structure where all the community related activities are performed in a single DHT overlay. The evaluation results suggest that the P2P community management system performs very well
Results 1 - 10
of
312
