156 research outputs found
Exploration of RTP circuit breaker with applications to video streaming.
Live multimedia streaming is becoming one of the dominant sources of internet traffic, much of which is sent over best-effort networks, i.e. along paths with a wide variety of characteristics. The multimedia traffic should be transmitted using a robust and effective congestion control mechanism to protect the network from congestion collapse. The RTP Circuit Breaker (RTP-CB) is a candidate solution that causes a sender to cease transmission when RTCP message feedback indicates excessive congestion. This paper studies RTP/UDP video traffic and the impact of its bursty behaviour on the network. It considers the potential limitations of using a RTP-CB with video traffic. We found that the bursty nature of a typical video flow can cause the RTP-CB to either prematurely cease transmission or to react too late. To reduce the likelihood of this happening, we suggest the use of a smoothing buffer in conjunction with the RTP-CB and propose design criteria for this buffer. Our experiments confirm the effectiveness of the proposed approach for different video streams
TCP with Adaptive Pacing for Multihop Wireless Networks
In this paper, we introduce a novel congestion control algorithm for TCP over multihop IEEE 802.11 wireless networks implementing rate-based scheduling of transmissions within the TCP congestion window. We show how a TCP sender can adapt its transmission rate close to the optimum using an estimate of the current 4-hop propagation delay and the coefficient of variation of recently measured round-trip times. The novel TCP variant is denoted as TCP with Adaptive Pacing (TCP-AP). Opposed to previous proposals for improving TCP over multihop IEEE 802.11 networks, TCP-AP retains the end-to-end semantics of
TCP and does neither rely on modifications on the routing or the link layer nor requires cross-layer information from intermediate nodes along the path. A comprehensive simulation study using ns-2 shows that TCP-AP achieves up to 84% more goodput than TCP NewReno, provides excellent fairness in almost all scenarios, and is highly responsive to changing traffic conditions
Gateway Adaptive Pacing for TCP across Multihop Wireless Networks and the Internet
In this paper, we introduce an effective congestion control scheme for TCP over hybrid wireless/wired networks comprising a multihop wireless IEEE 802.11 network and the wired Internet. We propose an adaptive pacing scheme at the Internet gateway for wired-to-wireless TCP flows. Furthermore, we analyze the causes for the unfairness of oncoming TCP flows and propose a scheme to throttle aggressive wired-to-wireless TCP flows at the Internet gateway to achieve nearly optimal fairness. Thus, we denote the introduced congestion control scheme TCP with Gateway Adaptive Pacing (TCP-GAP). For wireless-to-wired flows, we propose an adaptive pacing scheme at the TCP sender. In contrast to previous work, TCP-GAP does not impose any control traffic overhead for achieving fairness among active TCP flows. Moreover, TCP-GAP can be incrementally deployed because it does not require any modifications of TCP in the wired part of the network and is fully TCP-compatible. Extensive simulations using ns-2 show that TCPGAP is highly responsive to varying traffic conditions, provides nearly optimal fairness in all scenarios and achieves up to 42% more goodput than TCP NewReno
Network level performance of differentiated services (diffserv) networks
The Differentiated Services (DiffServ) architecture is a promising means of providing Quality of Service (QoS) in Internet. In DiffServ networks, three service classes, or Per-hop Behaviors (PHBs), have been defined: Expedited Forwarding (EF), Assured Forwarding (AF) and Best Effort (BE).
In this dissertation, the performance of DiffServ networks at the network level, such as end-to-end QoS, network stability, and fairness of bandwidth allocation over the entire network have been extensively investigated.
It has been shown in literature that the end-to-end delay of EF traffic can go to infinity even in an over-provisioned network. In this dissertation, a simple scalable aggregate scheduling scheme, called Youngest Serve First (YSF) algorithm is proposed. YSF is not only able to guarantee finite end-to-end delay, but also to keep a low scheduling complexity.
With respect to the Best Effort traffic, Random Exponential Marking (REM), an existing AQM scheme is studied under a new continuous time model, and its local stable condition is presented. Next, a novel virtual queue and rate based AQM scheme (VQR) is proposed, and its local stability condition has been presented. Then, a new AQM framework, Edge-based AQM (EAQM) is proposed. EAQM is easier to implement, and it achieves similar or better performance than traditional AQM schemes.
With respect to the Assured Forwarding, a network-assist packet marking (NPM) scheme has been proposed. It has been demonstrated that NPM can fairly distribute bandwidth among AF aggregates based on their Committed Information Rates (CIRs) in both single and multiple bottleneck link networks
TCP RAPID: FROM THEORY TO PRACTICE
Delay and bandwidth-based alternatives to TCP congestion-control have been around for nearly
three decades and have seen a recent surge in interest. However, such designs have faced significant
resistance in being deployed on a wide-scale across the Internet—this has been mostly due to serious
concerns about noise in delay measurements, pacing inter-packet gaps, and required changes to the
standard TCP stack. With the advent of high-speed networking, some of these concerns become even
more significant.
This thesis considers Rapid, a recent proposal for ultra-high speed congestion control, which
perhaps stretches each of these challenges to the greatest extent. Rapid adopts a framework of
continuous fine-scale bandwidth probing and rate adapting. It requires finely-controlled inter-packet
gaps, high-precision timestamping of received packets, and reliance on fine-scale changes in interpacket
gaps. While simulation-based evaluations of Rapid show that it has outstanding performance
gains along several important dimensions, these will not translate to the real-world unless the above
challenges are addressed.
This thesis identifies the key challenges TCP Rapid faces on real high-speed networks, including
deployability in standard protocol stacks, precise inter-packet gap creation, achieving robust
bandwidth estimation in the presence of noise, and a stability/adaptability trade-off. A Linux implementation
of Rapid is designed and developed after carefully considering each of these challenges.
The evaluations on a 10Gbps testbed confirm that the implementation can indeed achieve the claimed
performance gains, and that it would not have been possible unless each of the above challenges was
addressed.Doctor of Philosoph
- …