返回
Throughput-Optimal Multi-Hop Broadcast Algorithms
DOI:10.1109/TNET.2017.2718534.png)
摘要
En 中文
We design throughput-optimal dynamic broadcast algorithms for multi-hop networks with arbitrary topologies. Most of the previous broadcast algorithms route packets along spanning trees. For large time-varying networks, computing and maintaining a set of spanning trees is not efficient, as the network-topology may change frequently. In this paper, we design a class of dynamic algorithms, which make simple packet-by-packet scheduling and routing decisions, and hence obviate the need for maintaining any global topological structures, such as spanning trees. Our algorithms may be conveniently understood as a non-trivial generalization of the familiar back-pressure algorithm for unicast traffic, which performs packet routing and scheduling based on queue lengths. However, in the broadcast setting, due to packet duplications, it is difficult to define appropriate queuing structures. We design and prove the optimality of a virtual queue-based algorithm, where virtual queues are defined for subsets of nodes. We then propose a multi-class broadcast policy, which combines the above scheduling algorithm with in-class-in-order packet forwarding, resulting in significant reduction in complexity. Finally, we evaluate the performance of the proposed algorithms via extensive numerical simulations.
Keyword:
Broadcasting
network control
queueing theory
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
暂无机构信息
引用论文
Spitz/Reed nevi: a review of clinical-dermatoscopic and histological correlationSpitz/Reed痣:临床-皮肤镜和病理学相关性综述
Zinc Deficiency with Acrodermatitis Enteropathica-like Eruption After Pancreaticoduodenectomy胰十二指肠切除术后伴发肢端皮炎样皮疹的锌缺乏症

