End-to-end differentiation of congestion and wireless losses

End-to-end differentiation of congestion and wireless losses
复制标题

DOI:
10.1117/12.449983
复制
发表时间:
2001-12
期刊:
--
影响因子:
--
通讯作者:
Song Cen;P. Cosman;G. Voelker
Song Cen;P. Cosman;G. Voelker
中科院分区:
其他
文献类型:
--
作者:
Song Cen;P. Cosman;G. Voelker

文献摘要

被引文献

相似文献

在本文中,我们探讨了端到端损失微分算法(lda)用于具有骨干网或最后一跳无线链路的网络的拥塞敏感视频传输协议。作为我们的基本视频传输协议,我们将UDP与通过LDA扩展的拥塞控制机制结合使用。对于拥塞控制,我们使用tcp友好速率控制(TFRC)算法。当一个连接在发送方和接收方之间的路径中至少使用一条无线链路时,我们将TFRC扩展为使用LDA。然后,我们在不同的无线网络拓扑、竞争流量和公平性场景下评估各种lda,以确定它们的有效性。除了评估从以前的工作中得到的LDA之外,我们还提出并评估了一种新的LDA, ZigZag和一种混合LDA, ZBS,它根据观察到的网络条件在基本LDA中进行选择。我们通过仿真评估了这些lda,并发现没有单一的基本算法在所有拓扑和竞争中表现良好。然而,混合算法在拓扑和竞争中表现良好,并且在某些情况下超过了给定场景的最佳基本LDA的性能。在与TCP竞争时,所有LDA都是相当公平的,它们在使用相同LDA的流之间的公平性取决于网络拓扑。一般来说,ZigZag和混合算法是所有lda中最公平的。
In this paper, we explore end-to-end loss differentiation algorithms (LDAs) for use with congestion-sensitive video transport protocols for networks with either backbone or last-hop wireless links. As our basic video transport protocol, we use UDP in conjunction with a congestion control mechanism extended with an LDA. For congestion control, we use the TCP-Friendly Rate Control (TFRC) algorithm. We extend TFRC to use an LDA when a connection uses at least one wireless link in the path between the sender and receiver. We then evaluate various LDAs under different wireless network topologies, competing traffic, and fairness scenarios to determine their effectiveness. In addition to evaluating LDAs derived from previous work, we also propose and evaluate a new LDA, ZigZag, and a hybrid LDA, ZBS, that selects among base LDAs depending upon observed network conditions.We evaluate these LDAs via simulation, and find that no single base algorithm performs well across all topologies and competition. However, the hybrid algorithm performs well across topologies and competition, and in some cases exceeds the performance of the best base LDA for a given scenario. All of the LDAs are reasonably fair when competing with TCP, and their fairness among flows using the same LDA depends on the network topology. In general, ZigZag and the hybrid algorithm are the fairest among all LDAs.