Reducing the user perceived delay of interactive TCP connections using a dynamic priority approach

Dimopoulos, Peter; Zeephongsekul, Panlop; Tari, Zahir

doi:10.1109/icccn.2005.1523901

Cited by 2 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example if the link capacity is 10 Mbps then a 1 Mbps result will be given the value 0.1. The buffer size, propagation delay, and threshold effect on queuing delay, packet loss probability and goodput for each of the priority classes have been analysed in [4] but we only provide a few interesting results. Code Points (CP) are used to denote the traffic types.…”

Section: Dprq Vs Rcbq Simulationmentioning

confidence: 99%

A dynamic priority approach to reducing delay in interactive TCP connections

2006

View full text Add to dashboard Cite

Many interactive applications require continuous user interaction, for example ssh and many web applications like online games. The TCP connections created by these applications are in a class called interactive. When interactive applications suffer from packet loss, packet retransmission time severely increases the user perceived delay. This work introduces a Dynamic Priority RED Queue (DPRQ) algorithm that dynamically changes the priority of queues instead of dropping packets when the interactive queue is overloaded. The algorithm reduces the user perceived delay by reducing packet loss in interactive TCP connections. The DPRQ is compared to an existing Class-Based Queue which incorporates RED (RCBQ) as would typically be used for Assured Forwarding. An analytical model of the DPRQ and RCBQ is presented with both experimental and analytical results. The DPRQ is found to decrease packet loss by up to eight times and therefore provide a lower user perceived delay even though queuing delay is increased by up to five times.

show abstract

Section: Dprq Vs Rcbq Simulationmentioning

confidence: 99%