Efficient flooding in peer-to-peer networks

Ai, Wu; Xin-song, Liu; Liu, Kejian

doi:10.1109/caidcd.2006.329410

Cited by 3 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Prior work also proposed feedback-based approaches to ooding [3,49]. However, we believe that to work e ciently (have a horizon larger than 1), this work would have unacceptable information leakage.…”

Section: Related Workmentioning

confidence: 98%

Bandwidth-Efficient Transaction Relay for Bitcoin

Naumenko¹,

Maxwell²,

Wuille³

et al. 2019

Preprint

View full text Add to dashboard Cite

Bitcoin is a top-ranked cryptocurrency that has experienced huge growth and survived numerous a acks. e protocols making up Bitcoin must therefore accommodate the growth of the network and ensure security.Security of the Bitcoin network depends on connectivity between the nodes. Higher connectivity yields be er security. In this paper we make two observations: (1) current connectivity in the Bitcoin network is too low for optimal security; (2) at the same time, increasing connectivity will substantially increase the bandwidth used by the transaction dissemination protocol, making it prohibitively expensive to operate a Bitcoin node. Half of the total bandwidth needed to operate a Bitcoin node is currently used to just announce transactions. Unlike block relay, transaction dissemination has received li le a ention in prior work.We propose a new transaction dissemination protocol, Erlay, that not only reduces the bandwidth consumption by 40% assuming current connectivity, but also keeps the bandwidth use almost constant as the connectivity increases. In contrast, the existing protocol increases the bandwidth consumption linearly with the number of connections. By allowing more connections at a small cost, Erlay improves the security of the Bitcoin network. And, as we demonstrate, Erlay also hardens the network against a acks that a empt to learn the origin node of a transaction. Erlay is currently being investigated by the Bitcoin community for future use with the Bitcoin protocol.

show abstract

Section: Related Workmentioning

confidence: 98%

Bandwidth-Efficient Transaction Relay for Bitcoin

Naumenko¹,

Maxwell²,

Wuille³

et al. 2019

Preprint

View full text Add to dashboard Cite

show abstract

“…Such an assumption is valid for most of the practical distributed networks in use. These networks usually employ techniques like the distributed hash table [15] or flooding [16] for resource lookout. To reduce lookout latency, these techniques make users store data files in demand across the network in their memory.…”

Section: Network Modelmentioning

confidence: 99%

“…The parameter G and T are set by the designer and c max is calculated using (16). The equations ( 23) and ( 24) provide the generic value of the model parameters.…”

Section: E Tuning Pi Controllermentioning

confidence: 99%

Adaptive Capacity Partitioning in Cooperative Computing to Maximize Received Resources

2020

View full text Add to dashboard Cite

Users in a cooperative computing environment always have a tendency to free-ride. One can employ incentive mechanisms to prevent such behavior. Some of the cooperative computing scenarios have the same access link shared between upload and download. In such a situation, increasing upload capacity decreases the download capacity and vice versa. Optimal partitioning of link capacity between upload and download needs to be done by each user to maximize its gain (i.e., download) from the network. We model this link capacity partitioning problem as a feedback control system, where feedback (resources received) decides the number of resources to be uploaded by a user. The resulting algorithm called adaptive step size (ASZ) dynamically adjusts the partitioning of link capacity to an optimal value. To compare this approach with others, a metric ''level of optimality (U )'' is introduced. U achieved by the ASZ is closer to the optimal level than the reputation-based resource allocation policy (existing scheme), thus resulting in its better performance. The ASZ is also integrated with BitTorrent, and the simulation results show that it increases the resources received by the users. The ASZ can provide an efficient solution to the problem of optimal partitioning in real-life distributed networks due to its distributed implementation, robustness to changes in network dynamics, and compatibility with the existing partitioning schemes.

show abstract

SmoothFlood: Decreasing redundant messages and increasing search quality of service in peer-to-peer networks

Barjini

Othman

2010

2010 International Conference on Information Retrieval &Amp; Knowledge Management (CAMP)

View full text Add to dashboard Cite

Flooding search is a basic searching scheme for unstructured peer-to-peer networks. This technique produces exponentially redundant messages in each hop. Subsequent growths of redundant messages will limit system scalability and will cause unnecessary traffic in network areas. To improve this searching scheme and reduce redundant messages, this paper proposed a novel algorithm (SmoothFlood) which divides flooding scheme into two stages. In first stage algorithm follows standard flooding by the limited number of hops, but in the next stage it will choose nosy nodes in each region. These nodes maintain the data index of all clients' nodes. This proposed algorithm extends the search quality by reducing redundant messages in each hop. Simulation results show it will decrease more than 65 percentages of redundant messages and will save up to 70 percentages of searching traffic.

show abstract

Efficient flooding in peer-to-peer networks

Cited by 3 publications

References 9 publications

Bandwidth-Efficient Transaction Relay for Bitcoin

Bandwidth-Efficient Transaction Relay for Bitcoin

Adaptive Capacity Partitioning in Cooperative Computing to Maximize Received Resources

SmoothFlood: Decreasing redundant messages and increasing search quality of service in peer-to-peer networks

Contact Info

Product

Resources

About