When an ad hoc network with limited link capacities is used to transport high-rate, latency-constrained multimedia streams, it is important that routing algorithms not only yield high aggregated bandwidth, but also minimize network congestion to avoid excessive delay. We propose a distributed algorithm to achieve congestion-minimized multi-path routing. The optimal solution can be approximated by decomposing the total target rate into a sequence of rate increments, and using the classical Bellman-Ford algorithm to find a corresponding minimum-cost route for each increment. Simulation results for video streaming over an ad hoc network show that compared to a centralized scheme, the approximations introduced by the distributed algorithm lead to performance loss of less than 0.5 dB in PSNR of received video quality
展开▼
机译:当使用链路容量有限的ad hoc网络传输高速,受延迟限制的多媒体流时,重要的是路由算法不仅会产生较高的聚合带宽,而且还应尽量减少网络拥塞以避免过多的延迟。我们提出了一种分布式算法来实现拥塞最小化的多路径路由。可以通过将总目标速率分解为速率增量序列,然后使用经典的Bellman-Ford算法为每个增量找到相应的最小成本路径来估算最佳解决方案。 Ad hoc网络上视频流的仿真结果表明,与集中式方案相比,分布式算法引入的近似值导致接收视频质量的PSNR小于0.5 dB的性能损失
展开▼