A queueing scheme for reducing packet queueing delays in ADSL routers with P2P file sharing applications
Sheng‐Wei Wang, Yi-Chen Cheng
Abstract
Sheng‐Wei Wang, Yi-Chen Cheng
Abstract
Most of Internet traffics are generated by peer-to-peer(P2P) file sharing applications. The main idea of P2P file sharing applications is that when a peer contributes a file with higher rate, the rate that the peer is able to download files from other peers will also be high. The mechanism works well in a bandwidth symmetric network. However, when a peer shares a large amount of files to other peers via asymmetric networks such as ADSL networks, the queueing delay of general packets will be very long due to the shortage of upload bandwidth. When the ADSL router connects more than one client, one client which contributes the P2P files may cause the packets from other clients wait for a very long time in the ADSL router. Furthermore, the packets may be timeout. In this paper, we proposed a queueing scheme in ADSL router to solve the problem. The main idea of the proposed queueing scheme is to send out the general packets first as well as P2P packets are able to be sent in a bounded queueing delay. Simulation results show that the proposed queueing scheme may send out the packets efficiently and the average queueing delay is smaller than the first-come first-served algorithm. We also show that the throughput of the proposed queueing scheme is higher than other queueing schemes proposed before.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Most of Internet traffics are generated by peer-to-peer(P2P) file sharing applications. The main idea of P2P file sharing applications is that when a peer contributes a file with higher rate, the rate that the peer is able to download files from other peers will also be high. The mechanism works well in a bandwidth symmetric network. However, when a peer shares a large amount of files to other peers via asymmetric networks such as ADSL networks, the queueing delay of general packets will be very long due to the shortage of upload bandwidth. When the ADSL router connects more than one client, one client which contributes the P2P files may cause the packets from other clients wait for a very long time in the ADSL router. Furthermore, the packets may be timeout. In this paper, we proposed a queueing scheme in ADSL router to solve the problem. The main idea of the proposed queueing scheme is to send out the general packets first as well as P2P packets are able to be sent in a bounded queueing delay. Simulation results show that the proposed queueing scheme may send out the packets efficiently and the average queueing delay is smaller than the first-come first-served algorithm. We also show that the throughput of the proposed queueing scheme is higher than other queueing schemes proposed before.
Key concepts: Asymmetric digital subscriber line, Computer science, Computer network, Queueing theory, Network packet, Router, Weighted fair queueing, Layered queueing network