802.11中基于随机网络演算的积压量边界有效性研究
On Effectiveness of Backlog Bounds Using Stochastic Network Calculus in 802.11
摘要:
网络演算是一种有效的描述网络传输过程的方法,具有广泛的应用前景,但目前将其应用于802.11网络的研究还很少。在本文中,我们采取的第一个步骤之一,使用随机网络演算分析的积压边界的802.11无线局域网。特别是,我们要讨论它在解决积压问题方面的有效性。我们的无线节点作为一个单一的服务器减损服务的基础上,在随机网络演算两个最著名的模型:江和Ciucu的。有趣的是,我们发现,这两个模型可以得到等效的随机服务曲线和积压边界在我们的研究情况。我们证明了网络演算界意味着稳定的积压,只要流量到达的平均速率小于服务,表明理论上的有效性,随机网络演算在绑定积压。从. Kumar的802.11模型,我们推导出具体的随机服务曲线的802.11节点和其积压的界限。我们比较了推导出的边界与ns-2模拟,发现前者是非常松散的,我们讨论了原因。我们证明了鞅和独立案例分析技术可以显着改善边界。我们的工作为随机网络演算在实际应用中提供了很好的参考。
英文摘要:
Network calculus is a powerful methodology of characterizing queueing processes and has wide applications, but few works on applying it to 802.11 by far. In this paper, we take one of the first steps to analyze the backlog bounds of an 802.11 wireless LAN using stochastic network calculus. In particular, we want to address its effectiveness on bounding backlogs. We model a wireless node as a single server with impairment service based on two best-known models in stochastic network calculus: Jiang's and Ciucu's. Interestingly, we find that the two models can derive equivalent stochastic service curves and backlog bounds in our studied case. We prove that the network-calculus bounds imply stable backlogs as long as the average rate of traffic arrival is less than that of service, indicating the theoretical effectiveness of stochastic network calculus in bounding backlogs. From A. Kumar's 802.11 model, we derive the concrete stochastic service curve of an 802.11 node and its backlog bounds. We compare the derived bounds with ns-2 simulations and find that the former are very loose and we discuss the reasons. And we show that the martingale and independent case analysis techniques can improve the bounds significantly. Our work offers a good reference to applying stochastic network calculus to practical scenarios.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。