Work

Brief Announcement: Robust and Scalable Renaming with Subquadratic Bits

Year: 2025

Type: conference-paper

Abstract: In the renaming problem, a set of n nodes, each with a unique identity from a large namespace [N], needs to obtain new unique identities in a smaller namespace [M]. A renaming algorithm is strong if M = n. There exist many time-efficient solutions for fault-tolerant renaming in synchronous message-passing systems. However, all previous algorithms send Ω(n2) messages, and many of them also send large messages each containing Ω(n) bits. Moreover, most algorithms' performance do not scale with the actual number of failures. These limitations restrict their practical performance.

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3732772.3733561

Authors: Sirui Bai, Xinyu Fu, Yuheng Wang, Yuyi Wang, Chaodong Zheng

Institutions: Nanjing University, TU Wien, China Railway Rolling Stock Corporation Zhuzhou Institute (China)

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Natural Science Foundation of China, Natural Science Foundation of Hunan Province

Awards: G2659216395, G7670239341