English  |  正體中文  |  简体中文  |  Items with full text/Total items : 64178/96951 (66%)
Visitors : 9759557      Online Users : 19098
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/121036


    Title: General packet induced queueing schemes for reducing packet delays in ADSL routers with peer-to-peer file sharing applications
    Authors: Wang, Sheng-Wei;Cheng, Yi-Chen
    Keywords: Peer-to-peer;File sharing application;ADSL;Queueing scheme;Queueing delay
    Date: 2013-02-03
    Issue Date: 2021-08-25 12:11:52 (UTC+8)
    Abstract: 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.
    Relation: Springer Peer-to-Peer Networking and Applications,7(2),p.188–198
    DOI: 10.1007/s12083-013-0197-3
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML69View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback