BSB: Towards Demand-Aware Peer Selection With XOR-based Routing
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918147951427584 |
|---|---|
| author | Ji, Qingyun Melnyk, Darya Pourdamghani, Arash Schmid, Stefan |
| author_facet | Ji, Qingyun Melnyk, Darya Pourdamghani, Arash Schmid, Stefan |
| contents | Peer-to-peer networks, as a key enabler of modern networked and distributed systems, rely on peer-selection algorithms to optimize their scalability and performance. Peer-selection methods have been studied extensively in various aspects, including routing mechanisms and communication overhead. However, many state-of-the-art algorithms are oblivious to application-specific data traffic. This mismatch between design and demand results in underutilized connections, which inevitably leads to longer paths and increased latency. In this work, we propose a novel demand-aware peer-selection algorithm, called Binary Search in Buckets (BSB). Our demand-aware approach adheres to a local and greedy XOR-based routing mechanism, ensuring compatibility with existing protocols and mechanisms. We evaluate our solution against two prior algorithms by conducting simulations on real-world and synthetic communication network traces. The results of our evaluations show that BSB can offer up to a 43% improvement compared to two selected algorithms from the literature. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_20974 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | BSB: Towards Demand-Aware Peer Selection With XOR-based Routing Ji, Qingyun Melnyk, Darya Pourdamghani, Arash Schmid, Stefan Networking and Internet Architecture Peer-to-peer networks, as a key enabler of modern networked and distributed systems, rely on peer-selection algorithms to optimize their scalability and performance. Peer-selection methods have been studied extensively in various aspects, including routing mechanisms and communication overhead. However, many state-of-the-art algorithms are oblivious to application-specific data traffic. This mismatch between design and demand results in underutilized connections, which inevitably leads to longer paths and increased latency. In this work, we propose a novel demand-aware peer-selection algorithm, called Binary Search in Buckets (BSB). Our demand-aware approach adheres to a local and greedy XOR-based routing mechanism, ensuring compatibility with existing protocols and mechanisms. We evaluate our solution against two prior algorithms by conducting simulations on real-world and synthetic communication network traces. The results of our evaluations show that BSB can offer up to a 43% improvement compared to two selected algorithms from the literature. |
| title | BSB: Towards Demand-Aware Peer Selection With XOR-based Routing |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2509.20974 |