Aug 2026· Electronics· Vol 15, pp. 3467· 0 citations· 32 references
TL;DR
ESMP, a multi-graph-based heuristic framework for efficient and stable multicast construction over heterogeneous parallel communication links, is presented and it is shown that an aggregate-edge-delay-constrained decision variant of the formulation is NP-hard.
Abstract
Modern communication networks may provide several heterogeneous links between the same pair of devices, including Wi-Fi, 5G, Bluetooth, and SparkLink. Existing multicast schemes often use simple-graph abstractions and therefore cannot distinguish these parallel links. We present ESMP, a multi-graph-based heuristic framework for efficient and stable multicast construction over heterogeneous parallel communication links. ESMP represents parallel channels as edges with delay and stability attributes. We show that an aggregate-edge-delay-constrained decision variant of the formulation is NP-hard. The framework includes six polynomial-time heuristics: delay-based DMA and DSMA, stability-based SMA and SDMA, and stability-delay-ratio-based RMA and MRMA. Each algorithm derives a metric-specific graph from the original multi-graph and constructs a tree according to its delay-stability preference. We also develop local adjustment strategies for vertex joins, vertex exits, and link dynamics. Experiments on connected synthetic multi-graphs reveal distinct metric preferences. Delay-oriented methods reduce delay, stability-oriented methods improve stability, and ratio-based methods provide stability-aware trade-offs at relatively low delay. In particular, RMA favors low delay, whereas MRMA uses pair-level average stability-delay information and shows comparatively favorable stability preservation and tree compactness in the evaluated scenarios. These findings characterize heuristic behavior in the evaluated synthetic settings and do not establish general optimality.
Heterogeneous-interface multihop wireless networks (Het-MuNets) are emerging as a promising paradigm for tactical networks and for infrastructure-light applications such as vehicular communications, wireless backhaul, and non-terrestrial connectivity. To exploit the diverse profiles of heterogeneous communication technologies in penetration, interference, and bandwidth, packet-to-interface assignment must be determined on a per-hop basis, making routing and scheduling highly complex. In this work, we develop a unified framework for joint packet routing, link scheduling, and interface assignment in Het-MuNets with multiple concurrent flows. By modeling packet-to-interface assignment as transmission between virtual subnodes, we transform interface assignment into intra-device virtual routing, which is solved jointly with physical routing and scheduling under a unified multi-layer shortest path-biased Backpressure (SP-BP) scheme. Numerical results demonstrate that the proposed framework outperforms SP-BP operating on other baseline graph models and non-backpressure routing schemes in goodput, latency, and packet delivery rate.
Yujun Ming, Zhong-Yuan Zhao, F. Dagefu et al.· 0 citations
The results support HON as a simple low-degree construction for structured inter-group communication, whereas higher-radix, adaptive, or more richly connected fabrics remain better suited to less structured traffic and larger bandwidth demand.
Han Ni Soe, Yao Zhang, Zhipeng Xu· Parallel Processing Letters· 0 citations
This work shows that efficient offline-optimized routing enables efficient MoE training and inference on direct-connect topologies without the need for MoE traffic matrix or dynamic topology reconfiguration.
Ori Cohen, Jakob Krebs, Daniel Amir et al.· arXiv.org· 0 citations
Ensuring security without compromising low-latency determinism is critical for modern time-sensitive (TS) applications. However, existing authentication mechanisms like Timed Efficient Stream Loss-Tolerant Authentication (TESLA) suitable for local-area real-time networks lack scalability for wide-area environments. We propose Det-TESLA, which integrates deterministic IP (DIP) networking with the TESLA protocol to ensure stable key disclosure latency. By decoupling multicast TS flows from key distribution (KD) flows, the framework provides superior scheduling flexibility for complex wide-area networks. We further develop a joint TS-KD scheduling model and an efficient online algorithm based on combinatorial auctions. Simulations reveal that Det-TESLA supports 2.9 times more low-latency flows than standard TESLA. Furthermore, our algorithm achieves an 11% performance improvement with only 20% of the execution time required by baseline algorithms.
Wei-Peng Tan, Binwei Wu, Shuo Wang et al.· International Conference on...· 0 citations
The proposed Multi-Path Multi-Level Feedback Queueing (MP-MLFQ) leverages the spatial diversity and regularity of DCNs to realize a scheduler with numerous logical priority levels while occupying as low as 2 physical priority queues within network switches.
Alessandro Cornacchia, Andrea Bianco, Paolo Giaccone et al.· 0 citations
Routing and task-scheduling in space–air–ground integrated networks (SAGINs) are usually time-dependent due to heterogeneous mobility, intermittent connectivity, and continuously-varying link rates. Existing studies mainly rely on the time-expanded graph (TEG) framework to accommodate mobile dynamics by discretizing continuous link variations into uniform time slots (segments). Consequently, overly coarse slots lead to information quantization loss, while overly fine slots result in a granularity mismatch with the minimum transmission unit and the scalability problem. To overcome these limitations, we propose a novel continuous-time graph (CTG) framework that directly characterizes link-rate functions in continuous time and thus eliminates the stringent dependence on slot granularity. Building upon this new framework, we develop a new CTG event-driven routing (CTG-EDR) algorithm that can perform multi-source, multi-task scheduling through event-driven verification of link and buffer calendars. Monte Carlo simulations demonstrate that our proposed new CTG-EDR scheme can achieve a significantly lower latency and a higher task-completion ratio than the representative baselines. Our simulation results justify that the proposed new CTG-EDR scheme is very promising for robust and scalable routing and task-scheduling in highly dynamic SAGIN environments.
Ke Zhao, Limei Peng, Jiyeon Lee et al.· IEEE Transactions on Communi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
