Deterministic Broadcast on Multiple Access Channels
Deterministic Broadcast on Multiple Access Channels
复制标题
DOI：
10.1109/infcom.2010.5462256
复制
发表时间：
2010-03
期刊：
影响因子：
--
通讯作者：
Lakshmi Anantharamu;Bogdan S. Chlebus;D. Kowalski;Mariusz A. Rokicki
中科院分区：
文献类型：
--
作者：
Lakshmi Anantharamu;Bogdan S. Chlebus;D. Kowalski;Mariusz A. Rokicki
研究了基于确定性分布式协议的多址信道广播。数据到达是由对手控制的。攻击者的能力受到数据注入的平均速率和在一轮中可以注入的不同数据包数量的限制。注入速率最多为1，防止攻击者超载通道。我们考虑了一些确定性协议。对于它们中的每一个，我们给出了最坏情况下数据包延迟的上界，作为对对手施加约束的函数。我们通过模拟实验比较了确定性协议和退退型随机协议的数据包延迟。实验是在一个模拟环境中进行的，通过由有源站的比例和有源站与无源站之间状态变化的速率定义的可接受条件来捕获数据注入的突发性和由此产生的流量。
We study broadcasting on multiple access channels by deterministic distributed protocols. Data arrivals are governed by an adversary. The power of the adversary is constrained by the average rate of data injection and a bound on the number of different packets that can be injected in one round. The injection rate is at most 1, which forbids the adversary from overloading the channel. We consider a number of deterministic protocols. For each of them we give an upper bound on the worst-case packet latency, as a function of the constraints imposed on the adversary. We present results of experiments by simulations to compare packet latency of the deterministic protocols and of backoff-type randomized protocols. The experiments are carried out in a simulation environment that captures the burstiness of data injection and the resulting traffic by admissibility condition defined by the fraction of active stations and the rate of changing the status of active versus passive among the stations.