Optimally Efficient Multicast in Structured Peer-to-Peer Networks

Bradler, Dirk; Kangasharju, Jussi; Mühlhäuser, Max

doi:10.1109/ccnc.2009.4784805

Cited by 3 publications

(2 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is because of this that multipath redundancy is more often used to improve network reliability. Multipath redundancy can be provided by a superimposed network [8,10]. The simplest structure of a superimposed network is a single-layer tree.…”

Section: Multipath Redundancy Methodsmentioning

confidence: 99%

Dynamic routing protocols for wireless touch networks: a review

Sverdlova¹,

Zaporozhets²,

Bohachev³

et al. 2022

J. Edge Comp.

View full text Add to dashboard Cite

Wireless Touch Networks (WTN) have become increasingly important with the emergence of the Internet of Things (IoT) and are regarded as a class of self-organizing networks. This article presents an overview of the construction principles, routing protocols, quality of service parameters, traffic models, and characteristics of WTN. The article also explores the application of dynamic routing protocols for constructing a self-organizing network of autonomous IoT systems. Known dynamic routing protocols for mobile radio networks are reviewed and the advantages and disadvantages of proactive and reactive approaches are discussed.

show abstract

Section: Multipath Redundancy Methodsmentioning

confidence: 99%

Dynamic routing protocols for wireless touch networks: a review

Sverdlova¹,

Zaporozhets²,

Bohachev³

et al. 2022

J. Edge Comp.

View full text Add to dashboard Cite

show abstract

“…Other than DHT, several research e orts have explored the distributed keyword search problem [17], [39], [34], [36], [18], [6], [3], [4]. However, all of them attempt to address the keyword search problem in peer-to-peer systems, where performance requirements are more relaxed than in HPC systems.…”

Section: Introductionmentioning

confidence: 99%

Dart

Zhang

Tang

Byna

et al. 2018

Proceedings of the 27th International Conference on Parallel Architectures and Compilation Techniques

View full text Add to dashboard Cite

A x-based search is a fundamental functionality for storage systems. It allows users to nd desired datasets, where attributes of a dataset match an a x. While building inverted index to facilitate e cient a xbased keyword search is a common practice for standalone databases and for desktop le systems, building local indexes or adopting indexing techniques used in a standalone data store is insu cient for highperformance computing (HPC) systems due to the massive amount of data and distributed nature of the storage devices within a system. In this paper, we propose Distributed Adaptive Radix Tree (DART), to address the challenge of distributed a x-based keyword search on HPC systems. This trie-based approach is scalable in achieving ecient a x-based search and alleviating imbalanced keyword distribution and excessive requests on keywords at scale. Our evaluation at different scales shows that, comparing with the "full string hashing" use case of the most popular distributed indexing technique-Distributed Hash Table (DHT), DART achieves up to 55× better throughput with pre x search and with su x search, while achieving comparable throughput with exact and in x searches. Also, comparing to the "initial hashing" use case of DHT, DART maintains a balanced keyword distribution on distributed nodes and alleviates excessive query workload against popular keywords.

show abstract