Conference Paper

Network condition detection for video transport over wireless Internet

Dept. of Electr. Eng., Washington Univ., Seattle, WA
DOI: 10.1109/ISCAS.2006.1693279 Conference: Circuits and Systems, 2006. ISCAS 2006. Proceedings. 2006 IEEE International Symposium on
Source: DBLP


Real-time video transport over wireless Internet faces many challenges due to the heterogeneous network environment. A robust network condition classification algorithm using multiple end-to-end metrics and support vector machine (SVM) is proposed to classify different network events and model the transition pattern of network conditions. End-to-end quality-of-service (QoS) mechanisms like congestion control, error control, and power control can benefit from the network condition information and react to different network situations appropriately. The proposed network condition classification algorithm uses SVM as a classifier to cluster different end-to-end metrics such as end-to-end delay, delay jitter, throughput and packet loss-rate for the HDP traffic with TCP-friendly rate control (TFRC), which is used for video transport. The algorithm is also flexible to classify different numbers of states representing different levels of network events such as wireline congestion and wireless channel loss. Simulation results using ns2 show the effectiveness of the proposed scheme

14 Reads
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Transport protocol design for supporting multimedia streaming in mobile ad hoc networks is challenging because of unique issues, including mobility-induced disconnection, reconnection, and high out-of-order delivery ratios; channel errors and network congestion. In this paper, we describe the design and implementation of a transmission control protocol (TCP)-friendly transport protocol for ad hoc networks. Our key design novelty is to perform multimetric joint identification for packet and connection behaviors based on end-to-end measurements. Our NS-2 simulations show significant performance improvement over wired TCP friendly congestion control and TCP with explicit-link-failure-notification support in ad hoc networks.
    IEEE Journal on Selected Areas in Communications 01/2004; 21(10-21):1615 - 1626. DOI:10.1109/JSAC.2003.816461 · 3.45 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: 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.
    IEEE/ACM Transactions on Networking 10/2003; 11(5):703-717. DOI:10.1109/TNET.2003.818187 · 1.81 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: We present a simple scheme which enables a TCP receiver to distinguish congestion losses from corruption losses. The scheme works in the case where the last hop to the receiver is a wireless link and has the smallest bandwidth among all links on the connection path. We added our mechanism to TCP-Reno to evaluate the performance improvement. We compared our scheme against Ideal TCP-Reno which is TCP-Reno that can perfectly (but artificially) distinguish between congestion losses and wireless transmission losses. Under favourable conditions, our scheme performs similar to Ideal TCP-Reno and can lead to significant throughput improvement
    Application-Specific Systems and Software Engineering and Technology, 1999. ASSET '99. Proceedings. 1999 IEEE Symposium on; 02/1999
Show more

Preview (3 Sources)

14 Reads
Available from