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

随机接入网络中减小幂律时延的代价

The Cost of Mitigating Power Law Delay in Random Access Networks

Suzhi Bi, Ying Jun Zhang

摘要:

指数退避(EB)是一种广泛应用于以太网和无线局域网(WLAN)等随机接入网络的冲突解决机制。EB的突出主要归因于其渐近吞吐量稳定性,即使当网络中的用户数量达到无穷大时,也能确保非零吞吐量。然而,最近的研究表明,EB是从根本上不适合的应用程序是敏感的大延迟和延迟抖动,因为它会导致发散的二阶和高阶矩的介质访问延迟。本质上,介质访问延迟遵循幂律分布,重尾分布的一个子类。为了理解和缓解这个问题,本文系统地分析了一般退避函数的尾部延迟分布,EB是一种特殊情况。特别是,我们建立了一个折衷之间的尾部衰减率的介质访问延迟分布和吞吐量的稳定性。更具体地说,仅当退避函数$g(k)$比指数函数增长得慢时,才可获得收敛延迟时刻,即,当$g(k)\in o(r^k)$用于所有$r>1$时。另一方面,只有当回退函数至少像指数函数一样快地增长时,才能达到非零渐近吞吐量,即,$g(k)\inΩ(r^k)$用于某些$r>1$。这意味着有界延迟时刻和稳定的吞吐量不能同时实现。对于实际的实现,我们表明,多项式退避(PB),其中$g(k)$是一个多项式,增长速度比指数函数慢,获得有限的延迟时刻和良好的吞吐量性能在同一时间内的实际范围内的用户人口。这使得PB比EB更适合于具有严格延迟要求的多媒体应用。

英文摘要:

Exponential backoff (EB) is a widely adopted collision resolution mechanism in many popular random-access networks including Ethernet and wireless LAN (WLAN). The prominence of EB is primarily attributed to its asymptotic throughput stability, which ensures a non-zero throughput even when the number of users in the network goes to infinity. Recent studies, however, show that EB is fundamentally unsuitable for applications that are sensitive to large delay and delay jitters, as it induces divergent second- and higher-order moments of medium access delay. Essentially, the medium access delay follows a power law distribution, a subclass of heavy-tailed distribution. To understand and alleviate the issue, this paper systematically analyzes the tail delay distribution of general backoff functions, with EB being a special case. In particular, we establish a tradeoff between the tail decaying rate of medium access delay distribution and the stability of throughput. To be more specific, convergent delay moments are attainable only when the backoff functions $g(k)$ grows slower than exponential functions, i.e., when $g(k)\in o(r^k)$ for all $r>1$. On the other hand, non-zero asymptotic throughput is attainable only when backoff functions grow at least as fast as an exponential function, i.e., $g(k)\inΩ(r^k)$ for some $r>1$. This implies that bounded delay moments and stable throughput cannot be achieved at the same time. For practical implementation, we show that polynomial backoff (PB), where $g(k)$ is a polynomial that grows slower than exponential functions, obtains finite delay moments and good throughput performance at the same time within a practical range of user population. This makes PB a better alternative than EB for multimedia applications with stringent delay requirements.

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

↑