首页> 外文期刊>Peer-to-peer networking and applications >General packet induced queueing schemes for reducing packet delays in ADSL routers with peer-to-peer file sharing applications - Springer
【24h】

General packet induced queueing schemes for reducing packet delays in ADSL routers with peer-to-peer file sharing applications - Springer

机译:使用点对点文件共享应用程序减少ADSL路由器中的数据包延迟的通用数据包诱导排队方案-Springer

获取原文
获取原文并翻译 | 示例

摘要

This paper proposes a class of queueing schemes named general packet induced queueing schemes (GPIQS) in ADSL routers to reduce the queueing delays of non-P2P packets. The objective of the proposed queueing schemes is to send out the general packets first as well as P2P packets are able to be sent in a bounded queueing delay. The proposed queueing schemes use the general packet to induce the transmission of P2P packets which are from the same client and arrived at the ADSL router before the general packet. The outbound order of the packets transmitted from a specific client is not altered in the proposed schemes. Two queueing schemes named general packet induced queueing scheme with single P2P queue (GPIQS-SQ) and general packet induced queueing scheme with multiple P2P queues (GPIQS-MQ) are proposed. The two proposed queueing schemes differ in the number of P2P queues. In order to prevent the unlimited waiting time of P2P packets, we introduced a variable called the largest number of preempting packets to send out the P2P packets in a bounded time. Simulation results show that the proposed queueing schemes may send out the packets from ADSL router efficiently and the average queueing delay is smaller than the common used first-come first-served algorithm. Specifically, the GPIQS-MQ performs better than the GPIQS-SQ method in terms of average queueing delay of non-P2P packets. We also found that the increased average queueing delay of P2P packets is small. Finally, the values of the largest number of preempting packets are discussed.
机译:本文提出了一种在ADSL路由器中称为通用数据包诱导排队方案(GPIQS)的排队方案,以减少非P2P数据包的排队延迟。所提出的排队方案的目的是首先发送通用分组以及能够在有限排队延迟中发送P2P分组。所提出的排队方案使用通用分组来引起P2P分组的传输,该P2P分组是从相同的客户端到达并且在通用分组之前到达ADSL路由器的。从特定客户端发送的数据包的出站顺序在提议的方案中没有改变。提出了两种排队方案,分别是具有单个P2P队列的通用分组诱导排队方案(GPIQS-SQ)和具有多个P2P队列的通用分组诱导排队方案(GPIQS-MQ)。两种建议的排队方案在P2P队列的数量上有所不同。为了避免P2P数据包的无限等待时间,我们引入了一个称为最大抢占数据包数的变量,以在一定时间内发送P2P数据包。仿真结果表明,所提出的排队方案可以有效地从ADSL路由器发送数据包,平均排队延迟小于常用的先到先得算法。具体而言,就非P2P数据包的平均排队延迟而言,GPIQS-MQ的性能优于GPIQS-SQ方法。我们还发现P2P数据包的平均排队延迟增加很小。最后,讨论了最大数量的抢占数据包的值。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号