BSB: Towards Demand-Aware Peer Selection With XOR-based Routing Article Swipe

PDF

Qiong Ji , Darya Melnyk , Arash Pourdamghani , Stefan Schmid ·

YOU? · · 2025 · Open Access · · DOI: https://doi.org/10.48550/arxiv.2509.20974

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.

Related Topics

Concepts

No concepts available.

Metadata

Type: preprint
Language: en
Landing Page: http://arxiv.org/abs/2509.20974
PDF: https://arxiv.org/pdf/2509.20974
OA Status: green
OpenAlex ID: https://openalex.org/W4414789928

All OpenAlex metadata

Raw OpenAlex JSON

OpenAlex ID: https://openalex.org/W4414789928

Canonical identifier for this work in OpenAlex
DOI: https://doi.org/10.48550/arxiv.2509.20974

Digital Object Identifier
Title: BSB: Towards Demand-Aware Peer Selection With XOR-based Routing

Work title
Type: preprint

OpenAlex work type
Language: en

Primary language
Publication year: 2025

Year of publication
Publication date: 2025-09-25

Full publication date if available
Authors: Qiong Ji, Darya Melnyk, Arash Pourdamghani, Stefan Schmid

List of authors in order
Landing page: https://arxiv.org/abs/2509.20974

Publisher landing page
PDF URL: https://arxiv.org/pdf/2509.20974

Direct link to full text PDF
Open access: Yes

Whether a free full text is available
OA status: green

Open access status per OpenAlex
OA URL: https://arxiv.org/pdf/2509.20974

Direct OA link when available
Cited by: 0

Total citation count in OpenAlex

Full payload

id	https://openalex.org/W4414789928
doi	https://doi.org/10.48550/arxiv.2509.20974
ids.doi	https://doi.org/10.48550/arxiv.2509.20974
ids.openalex	https://openalex.org/W4414789928
fwci
type	preprint
title	BSB: Towards Demand-Aware Peer Selection With XOR-based Routing
biblio.issue
biblio.volume
biblio.last_page
biblio.first_page
topics[0].id	https://openalex.org/T10203
topics[0].field.id	https://openalex.org/fields/17
topics[0].field.display_name	Computer Science
topics[0].score	0.9814000129699707
topics[0].domain.id	https://openalex.org/domains/3
topics[0].domain.display_name	Physical Sciences
topics[0].subfield.id	https://openalex.org/subfields/1710
topics[0].subfield.display_name	Information Systems
topics[0].display_name	Recommender Systems and Techniques
topics[1].id	https://openalex.org/T10742
topics[1].field.id	https://openalex.org/fields/17
topics[1].field.display_name	Computer Science
topics[1].score	0.9785000085830688
topics[1].domain.id	https://openalex.org/domains/3
topics[1].domain.display_name	Physical Sciences
topics[1].subfield.id	https://openalex.org/subfields/1705
topics[1].subfield.display_name	Computer Networks and Communications
topics[1].display_name	Peer-to-Peer Network Technologies
topics[2].id	https://openalex.org/T10927
topics[2].field.id	https://openalex.org/fields/33
topics[2].field.display_name	Social Sciences
topics[2].score	0.9302999973297119
topics[2].domain.id	https://openalex.org/domains/2
topics[2].domain.display_name	Social Sciences
topics[2].subfield.id	https://openalex.org/subfields/3312
topics[2].subfield.display_name	Sociology and Political Science
topics[2].display_name	Access Control and Trust
is_xpac	False
apc_list
apc_paid
language	en
locations[0].id	pmh:oai:arXiv.org:2509.20974
locations[0].is_oa	True
locations[0].source.id	https://openalex.org/S4306400194
locations[0].source.issn
locations[0].source.type	repository
locations[0].source.is_oa	True
locations[0].source.issn_l
locations[0].source.is_core	False
locations[0].source.is_in_doaj	False
locations[0].source.display_name	arXiv (Cornell University)
locations[0].source.host_organization	https://openalex.org/I205783295
locations[0].source.host_organization_name	Cornell University
locations[0].source.host_organization_lineage	https://openalex.org/I205783295
locations[0].license
locations[0].pdf_url	https://arxiv.org/pdf/2509.20974
locations[0].version	submittedVersion
locations[0].raw_type	text
locations[0].license_id
locations[0].is_accepted	False
locations[0].is_published	False
locations[0].raw_source_name
locations[0].landing_page_url	http://arxiv.org/abs/2509.20974
locations[1].id	doi:10.48550/arxiv.2509.20974
locations[1].is_oa	True
locations[1].source.id	https://openalex.org/S4306400194
locations[1].source.issn
locations[1].source.type	repository
locations[1].source.is_oa	True
locations[1].source.issn_l
locations[1].source.is_core	False
locations[1].source.is_in_doaj	False
locations[1].source.display_name	arXiv (Cornell University)
locations[1].source.host_organization	https://openalex.org/I205783295
locations[1].source.host_organization_name	Cornell University
locations[1].source.host_organization_lineage	https://openalex.org/I205783295
locations[1].license
locations[1].pdf_url
locations[1].version
locations[1].raw_type	article
locations[1].license_id
locations[1].is_accepted	False
locations[1].is_published
locations[1].raw_source_name
locations[1].landing_page_url	https://doi.org/10.48550/arxiv.2509.20974
indexed_in	arxiv, datacite
authorships[0].author.id	https://openalex.org/A5079871108
authorships[0].author.orcid
authorships[0].author.display_name	Qiong Ji
authorships[0].author_position	first
authorships[0].raw_author_name	Ji, Qingyun
authorships[0].is_corresponding	False
authorships[1].author.id	https://openalex.org/A5073900481
authorships[1].author.orcid	https://orcid.org/0000-0001-5614-8563
authorships[1].author.display_name	Darya Melnyk
authorships[1].author_position	middle
authorships[1].raw_author_name	Melnyk, Darya
authorships[1].is_corresponding	False
authorships[2].author.id	https://openalex.org/A5082991441
authorships[2].author.orcid	https://orcid.org/0000-0002-9213-1512
authorships[2].author.display_name	Arash Pourdamghani
authorships[2].author_position	middle
authorships[2].raw_author_name	Pourdamghani, Arash
authorships[2].is_corresponding	False
authorships[3].author.id	https://openalex.org/A5066080641
authorships[3].author.orcid	https://orcid.org/0000-0002-7798-1711
authorships[3].author.display_name	Stefan Schmid
authorships[3].author_position	last
authorships[3].raw_author_name	Schmid, Stefan
authorships[3].is_corresponding	False
has_content.pdf	False
has_content.grobid_xml	False
is_paratext	False
open_access.is_oa	True
open_access.oa_url	https://arxiv.org/pdf/2509.20974
open_access.oa_status	green
open_access.any_repository_has_fulltext	False
created_date	2025-10-10T00:00:00
display_name	BSB: Towards Demand-Aware Peer Selection With XOR-based Routing
has_fulltext	False
is_retracted	False
updated_date	2025-11-06T06:51:31.235846
primary_topic.id	https://openalex.org/T10203
primary_topic.field.id	https://openalex.org/fields/17
primary_topic.field.display_name	Computer Science
primary_topic.score	0.9814000129699707
primary_topic.domain.id	https://openalex.org/domains/3
primary_topic.domain.display_name	Physical Sciences
primary_topic.subfield.id	https://openalex.org/subfields/1710
primary_topic.subfield.display_name	Information Systems
primary_topic.display_name	Recommender Systems and Techniques
cited_by_count	0
locations_count	2
best_oa_location.id	pmh:oai:arXiv.org:2509.20974
best_oa_location.is_oa	True
best_oa_location.source.id	https://openalex.org/S4306400194
best_oa_location.source.issn
best_oa_location.source.type	repository
best_oa_location.source.is_oa	True
best_oa_location.source.issn_l
best_oa_location.source.is_core	False
best_oa_location.source.is_in_doaj	False
best_oa_location.source.display_name	arXiv (Cornell University)
best_oa_location.source.host_organization	https://openalex.org/I205783295
best_oa_location.source.host_organization_name	Cornell University
best_oa_location.source.host_organization_lineage	https://openalex.org/I205783295
best_oa_location.license
best_oa_location.pdf_url	https://arxiv.org/pdf/2509.20974
best_oa_location.version	submittedVersion
best_oa_location.raw_type	text
best_oa_location.license_id
best_oa_location.is_accepted	False
best_oa_location.is_published	False
best_oa_location.raw_source_name
best_oa_location.landing_page_url	http://arxiv.org/abs/2509.20974
primary_location.id	pmh:oai:arXiv.org:2509.20974
primary_location.is_oa	True
primary_location.source.id	https://openalex.org/S4306400194
primary_location.source.issn
primary_location.source.type	repository
primary_location.source.is_oa	True
primary_location.source.issn_l
primary_location.source.is_core	False
primary_location.source.is_in_doaj	False
primary_location.source.display_name	arXiv (Cornell University)
primary_location.source.host_organization	https://openalex.org/I205783295
primary_location.source.host_organization_name	Cornell University
primary_location.source.host_organization_lineage	https://openalex.org/I205783295
primary_location.license
primary_location.pdf_url	https://arxiv.org/pdf/2509.20974
primary_location.version	submittedVersion
primary_location.raw_type	text
primary_location.license_id
primary_location.is_accepted	False
primary_location.is_published	False
primary_location.raw_source_name
primary_location.landing_page_url	http://arxiv.org/abs/2509.20974
publication_date	2025-09-25
publication_year	2025
referenced_works_count	0
abstract_inverted_index.a	3, 71, 87, 131
abstract_inverted_index.In	66
abstract_inverted_index.We	101
abstract_inverted_index.as	2
abstract_inverted_index.by	109
abstract_inverted_index.in	28, 54, 79
abstract_inverted_index.of	6, 121
abstract_inverted_index.on	13, 112
abstract_inverted_index.to	16, 43, 60, 86, 130, 135
abstract_inverted_index.up	129
abstract_inverted_index.we	69
abstract_inverted_index.43%	132
abstract_inverted_index.BSB	126
abstract_inverted_index.Our	82
abstract_inverted_index.The	119
abstract_inverted_index.and	9, 20, 34, 51, 63, 89, 99, 114
abstract_inverted_index.are	41
abstract_inverted_index.can	127
abstract_inverted_index.key	4
abstract_inverted_index.our	103, 122
abstract_inverted_index.the	140
abstract_inverted_index.two	106, 136
abstract_inverted_index.This	47
abstract_inverted_index.been	25
abstract_inverted_index.data	45
abstract_inverted_index.from	139
abstract_inverted_index.have	24
abstract_inverted_index.many	38
abstract_inverted_index.rely	12
abstract_inverted_index.show	124
abstract_inverted_index.that	125
abstract_inverted_index.this	67
abstract_inverted_index.with	96
abstract_inverted_index.leads	59
abstract_inverted_index.local	88
abstract_inverted_index.novel	72
abstract_inverted_index.offer	128
abstract_inverted_index.paths	62
abstract_inverted_index.prior	107
abstract_inverted_index.their	18
abstract_inverted_index.which	57
abstract_inverted_index.work,	68
abstract_inverted_index.(BSB).	81
abstract_inverted_index.Binary	77
abstract_inverted_index.Search	78
abstract_inverted_index.called	76
abstract_inverted_index.demand	52
abstract_inverted_index.design	50
abstract_inverted_index.greedy	90
abstract_inverted_index.longer	61
abstract_inverted_index.modern	7
abstract_inverted_index.Buckets	80
abstract_inverted_index.adheres	85
abstract_inverted_index.against	105
abstract_inverted_index.between	49
abstract_inverted_index.enabler	5
abstract_inverted_index.methods	23
abstract_inverted_index.network	117
abstract_inverted_index.propose	70
abstract_inverted_index.results	53, 120
abstract_inverted_index.routing	32, 92
abstract_inverted_index.studied	26
abstract_inverted_index.traces.	118
abstract_inverted_index.various	29
abstract_inverted_index.However,	37
abstract_inverted_index.approach	84
abstract_inverted_index.aspects,	30
abstract_inverted_index.compared	134
abstract_inverted_index.ensuring	94
abstract_inverted_index.evaluate	102
abstract_inverted_index.existing	97
abstract_inverted_index.latency.	65
abstract_inverted_index.mismatch	48
abstract_inverted_index.optimize	17
abstract_inverted_index.selected	137
abstract_inverted_index.solution	104
abstract_inverted_index.systems,	11
abstract_inverted_index.traffic.	46
abstract_inverted_index.XOR-based	91
abstract_inverted_index.including	31
abstract_inverted_index.increased	64
abstract_inverted_index.networked	8
abstract_inverted_index.networks,	1
abstract_inverted_index.oblivious	42
abstract_inverted_index.overhead.	36
abstract_inverted_index.protocols	98
abstract_inverted_index.synthetic	115
abstract_inverted_index.algorithm,	75
abstract_inverted_index.algorithms	15, 40, 108, 138
abstract_inverted_index.conducting	110
abstract_inverted_index.inevitably	58
abstract_inverted_index.mechanism,	93
abstract_inverted_index.mechanisms	33
abstract_inverted_index.real-world	113
abstract_inverted_index.distributed	10
abstract_inverted_index.evaluations	123
abstract_inverted_index.extensively	27
abstract_inverted_index.improvement	133
abstract_inverted_index.literature.	141
abstract_inverted_index.mechanisms.	100
abstract_inverted_index.scalability	19
abstract_inverted_index.simulations	111
abstract_inverted_index.Peer-to-peer	0
abstract_inverted_index.connections,	56
abstract_inverted_index.demand-aware	73, 83
abstract_inverted_index.performance.	21
abstract_inverted_index.communication	35, 116
abstract_inverted_index.compatibility	95
abstract_inverted_index.underutilized	55
abstract_inverted_index.Peer-selection	22
abstract_inverted_index.peer-selection	14, 74
abstract_inverted_index.state-of-the-art	39
abstract_inverted_index.application-specific	44
cited_by_percentile_year
countries_distinct_count	0
institutions_distinct_count	4
citation_normalized_percentile