arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1810.11441cs.DC
收藏

共享信道中的能量有效对抗路由

Energy Efficient Adversarial Routing in Shared Channels

Bogdan S. Chlebus, Elijah Hradovich, Tomasz Jurdzinski, Marek Klonowski, Dariusz R. Kowalski

摘要:

我们研究路由网络建模为多个访问通道,当数据包不断注入。有一个能量上限,被理解为可以同时打开的站的数量的界限。每个数据包都被注入到某个站点,并需要通过信道传递到其目的地站点。当在信道上听到数据包时,为了接收数据包,必须打开站。每个站通过可编程唤醒机制管理其何时打开和关闭,该机制由路由算法调度。数据包注入由对抗模型控制,该模型确定注入速率和突发性的上限。我们开发确定性的分布式路由算法,并评估其性能在最坏情况下的意义。其中一种算法保持最大喷射速率1的有界队列仅服从能量上限3。该能量上限可证明是最佳的,因为用能量上限2获得相同的吞吐量是不可能的。我们给算法的最小能量上限为2,有等待时间多项式的总数量n为每个固定的对手的注入率小于1。如果在一轮中最多k个站被接通,并且对于每个站,预先确定它将被接通的轮,则算法是k能量无关的。我们给出了一个k-能量不经意算法,该算法对于注入率小于(k-1)/(n-1)的攻击者具有O(n)的包延迟,并证明了对于注入率大于k/n的攻击者不存在k-能量不经意的稳定算法.我们给出了一个k-能量不经意的算法,直接路由具有延迟O(n^2/k)的对手足够小的注入率是O(k^2/n^2)。我们表明,没有k-能量不经意的路由算法直接可以稳定对对手的注入率大于k(k-1)/n(n-1)。

英文摘要:

We investigate routing on networks modeled as multiple access channels, when packets are injected continually. There is an energy cap understood as a bound on the number of stations that can be switched on simultaneously. Each packet is injected into some station and needs to be delivered to its destination station via the channel. A station has to be switched on in order to receive a packet when it is heard on the channel. Each station manages when it is switched on and off by way of a programmable wakeup mechanism, which is scheduled by a routing algorithm. Packet injection is governed by adversarial models that determine upper bounds on injection rates and burstiness. We develop deterministic distributed routing algorithms and assess their performance in the worst-case sense. One of the algorithms maintains bounded queues for the maximum injection rate 1 subject only to the energy cap 3. This energy cap is provably optimal, in that obtaining the same throughput with the energy cap 2 is impossible. We give algorithms subject to the minimum energy cap 2 that have latency polynomial in the total number of stations n for each fixed adversary of injection rate less than 1. An algorithm is k-energy-oblivious if at most k stations are switched on in a round and for each station the rounds when it will be switched on are determined in advance. We give a k-energy-oblivious algorithm that has packet delay O(n) for adversaries of injection rates less than (k-1)/(n-1), and show that there is no k-energy-oblivious stable algorithm against adversaries with injection rates greater than k/n. We give a k-energy-oblivious algorithm routing directly that has latency O(n^2/k) for adversaries of sufficiently small injection rates that are O(k^2/n^2). We show that no k-energy-oblivious algorithm routing directly can be stable against adversaries with injection rates greater than k(k-1)/n(n-1).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑