arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1001.1009cs.NIcs.LG
收藏

基于贝叶斯主动学习的多径概率可用带宽估计

Multi-path Probabilistic Available Bandwidth Estimation through Bayesian Active Learning

McGill University(麦吉尔大学)

Frederic Thouin, Mark Coates, Michael Rabbat

摘要:

当在视频流中选择传输速率或在对等应用中选择对等点时,知道可以在端到端路径上发送数据的最大速率,使得出口速率以高概率等于入口速率可能是非常实用的。我们引入概率可用带宽,这是定义在入口速率和出口速率的路径上的流量,而不是在容量和利用率的组成链路的路径,如标准的可用带宽度量。在本文中,我们描述了一个分布式算法,概率图模型和贝叶斯主动学习的基础上,同时估计通过网络的多条路径的概率可用带宽。我们的程序利用了这样一个事实,即每个包训练提供的信息,不仅关于它穿越的路径,但也有关于任何共享一个链接与监测path.Simulations和PlanetLab实验表明,这个过程可以显着减少所需的探针的数量,以产生准确的估计。

英文摘要:

Knowing the largest rate at which data can be sent on an end-to-end path such that the egress rate is equal to the ingress rate with high probability can be very practical when choosing transmission rates in video streaming or selecting peers in peer-to-peer applications. We introduce probabilistic available bandwidth, which is defined in terms of ingress rates and egress rates of traffic on a path, rather than in terms of capacity and utilization of the constituent links of the path like the standard available bandwidth metric. In this paper, we describe a distributed algorithm, based on a probabilistic graphical model and Bayesian active learning, for simultaneously estimating the probabilistic available bandwidth of multiple paths through a network. Our procedure exploits the fact that each packet train provides information not only about the path it traverses, but also about any path that shares a link with the monitored path. Simulations and PlanetLab experiments indicate that this process can dramatically reduce the number of probes required to generate accurate estimates.

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

↑