Efa: an efficient content routing algorithm in large peer-to-peer overlay networks

Vuong, Son T.; Li, J.

doi:10.1109/ptp.2003.1231532

Cited by 17 publications

(9 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Structured peer-to-peer networks. Unlike the peer-topeer gossip networks employed in decentralized blockchain systems, structured peer-to-peer networks are also extensively used in another series of systems that leverage topology information to make efficient routing decisions, including tree-based multicast protocols [9,10,54] and Distributed Hash Tables (DHTs) [11,37,49,53,55]. However, these designs make the protocols leak information about the structure of the network and introduce security vulnerabilities in adversarial environments.…”

Section: Related Workmentioning

confidence: 99%

Shrec

Han¹,

et al. 2020

Proceedings of the 11th ACM Symposium on Cloud Computing

View full text Add to dashboard Cite

The success of Bitcoin and Ethereum has attracted many efforts to build high-throughput blockchain systems. This paper focuses on transaction dissemination-a rather overlooked issue in these systems. We argue that efficient transaction dissemination is the key for a blockchain system to sustain at high-throughput-usually thousands of transactions per second-and the existing solutions fell short at doing so. This paper presents Shrec, a novel transaction relay protocol for high-throughput blockchain systems built around a hybrid transaction hashing scheme that has a low hash collision rate, is resilient to collision attacks, and is fast to construct. Our experiments demonstrate that when propagating transactions, Shrec utilizes network efficiently: compared to alternative designs, Shrec reduces the bandwidth consumption by 60% at modest CPU overhead and improves the system throughput by up to 90%. CCS Concepts • Networks → Peer-to-peer protocols; Network performance analysis; • Computer systems organization → Faulttolerant network topologies; Distributed architectures.

show abstract

Section: Related Workmentioning

confidence: 99%

Shrec

Han¹,

et al. 2020

Proceedings of the 11th ACM Symposium on Cloud Computing

View full text Add to dashboard Cite

show abstract

“…Reference [11]uses constrained flooding routingalgorithm to reduce traffic in unstructured P2P system.…”

Section: Related Workmentioning

confidence: 99%

INS: A Novel P2P Semantic Search Approach Using Interest Attenuation Policy

Zhuoya

2014

Proceedings of the 3rd International Conference on Computer Science and Service System

View full text Add to dashboard Cite

Abstract-Semantic overlay could improve query performance in peer-to-peer (P2P) systems. When peers join or leave frequently, it will lead to network traffic surge, since most semantic search methods maintaining a large number of routing tables. In this paper, we address these problems by proposing Interest Attenuation Search(INS), a novel efficient peer-to-peer semantic search approach based on interest attenuation policy. In INS, the interest attenuation policy is introduced to help peers decide whether to forward messages. Before peer floods the request in semantic overlay network(SON), it will check the history information about the request message, then uses INS to make forwarding decision. Simulation results show that INS significantly improves query performance and reduces the traffic overhead generated by unstable network environment.

show abstract

“…Because there are multiple paths between nodes, there are a large number of duplicated messages propagated in the network. There are many technologies [24,11] to control duplicated messages by cutting flooding paths. However, in a schema-heterogeneous PDMS network, optimization cannot be done by simply cutting the flooding paths.…”

Section: Problems Of Query Evaluationmentioning

confidence: 99%

Efficient Data Sharing over Large-Scale Distributed Communities

Khan

et al. 2011

Intelligent Decision Systems in Large-Scale Distributed Environments

View full text Add to dashboard Cite

Data sharing in large-scale Peer Data Management Systems (PDMS) is challenging due to the excessive number of data sites, their autonomous nature, and the heterogeneity of their schema. Existing PDMS query applications have difficulty to simultaneously achieve high recall rate and scalability. In this chapter, we propose an ontology-based sharing framework to improve the quality of data sharing and querying over large-scale distributed communities. In particular, we add a semantic layer to the PDMSs, which alleviates the semantic heterogeneity and assists the system to adjust its topology so that semantically related data sources can be connected. Moreover, we propose a comprehensive query routing and optimization

show abstract

Efa: an efficient content routing algorithm in large peer-to-peer overlay networks

Cited by 17 publications

References 4 publications

Shrec

Shrec

INS: A Novel P2P Semantic Search Approach Using Interest Attenuation Policy

Efficient Data Sharing over Large-Scale Distributed Communities

Contact Info

Product

Resources

About