A New Broadcast Model for Several Network Topologies

2025-10-20

AI Summary

Broadcast communication in large-scale systems (e.g., supercomputers) is constrained by network topology, bandwidth bottlenecks, and synchronization overhead. To address these challenges, this paper proposes the Balanced Saturated Broadcast (BBS) algorithm. BBS employs a topology-adaptive, precisely periodic scheduling scheme coupled with persistent node participation to construct a repeatable, progressive broadcast framework—achieving high node utilization while significantly reducing synchronization costs. Simulation results across representative topologies—including Mesh, Torus, and Fat-Tree—demonstrate that BBS reduces average broadcast latency by 23%–41% compared to standard algorithms such as MPI_Bcast and Binomial Tree, with superior scalability. Its core innovation lies in explicitly modeling “communication saturation” as an optimization objective for the first time, enabling topology-agnostic, efficient broadcast. This yields strong generality and robustness without requiring topology-specific tuning.

Technology Category

• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems
• Multiagent Systems: Agent Communication
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization

Application Category

• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments
• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs
• Social Networks and Social Media: Influence propagation, information diffusion, and the prediction on networks

Abstract

We present Broadcast by Balanced Saturation (BBS), a general broadcast algorithm designed to optimize communication efficiency across diverse network topologies. BBS maximizes node utilization, addressing challenges in broadcast operations such as topology constraints, bandwidth limitations, and synchronization overhead, particularly in large-scale systems like supercomputers. The algorithm ensures sustained activity with nodes throughout the broadcast, thereby enhancing data propagation and significantly reducing latency. Through a precise communication cycle, BBS provides a repeatable, streamlined, stepwise broadcasting framework. Simulation results across various topologies demonstrate that the BBS algorithm consistently outperforms common general broadcast algorithms, often by a substantial margin. These findings suggest that BBS is a versatile and robust framework with the potential to redefine broadcast strategies across network topologies.

Problem

• Optimizing broadcast efficiency across diverse network topologies
• Addressing topology constraints, bandwidth limits, and synchronization overhead
• Enhancing data propagation while significantly reducing latency

Innovation

• Balanced Saturation algorithm for diverse network topologies
• Maximizes node utilization to reduce latency significantly
• Provides repeatable stepwise broadcasting framework via communication cycles