| Peer-Reviewed

Packet Switch Scheduler for Increasing Sending Packet

Received: 16 January 2015     Accepted: 19 January 2015     Published: 29 January 2015
Views:       Downloads:
Abstract

Recently, the need of the high speed packet switch is increased. The Re-2DRR scheduling algorithm based on 2DRR scheduling algorithm provides high throughput communication on a packet switch. However, computer network is using many cases, that huge data communication, complex, and other. This paper proposes a new method to increase choices in algorithm variation for three specific systems and more easily implementation than Re-2DRR. The effectiveness of the proposed algorithm is shown through simulation studies.

Published in International Journal of Intelligent Information Systems (Volume 4, Issue 2-1)

This article belongs to the Special Issue Logistics Optimization Using Evolutionary Computation Techniques

DOI 10.11648/j.ijiis.s.2015040201.12
Page(s) 7-12
Creative Commons

This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.

Copyright

Copyright © The Author(s), 2015. Published by Science Publishing Group

Keywords

Packet Switch Scheduling algorithm; 2DRR; High-Throughput

References
[1] M. Takajo, S. Kimura and Y. Ebihara, “A Proposal of Grouped Two-Dimensional Round Robin Schedulers for Multiaccess Communications,” The Transactions of the Institute of Electronics, Information and Communication Engineers B, Vol. J82-B, No. 4, 1999, pp. 560-568.
[2] Craig Partridge et al., “A 50-Gb/s IP Router,” IEEE/ACM Transactions of Networking, Vol. 6, No. 3, 1998, pp. 237-248.
[3] T. Tsuda, “Multimedia Communication System,” The Institute of Image Information and Television Engineers, Vol. 45, No. 1, 1991, pp. 31-34.
[4] K. Nishimura, T. Mori and Y. Ishibashi, “Video-on-Demand with Multiple Readouts,” The Institute of Image Information and Television Engineers, Vol.48, No. 3, 1994, pp. 287-294.
[5] ITU-T: ITU-T Recommendation I.371, 1993, pp.2-4.
[6] R. O. LaMaire, “Two-Dimensional Round-Robin Schedulers for Packet Switches with Multiple Input Queues,” IEEE/ACM Transactions on Networking, Vol. 2, No. 5, 1994, pp. 471-482.
[7] M. J .Karol, M. G. Hluchyj and S. P. Morgan, “Input versus output queueing on a space-division packet switch,” IEEE Trans. Commun., Vol. COM-35, 1987, pp. 1347-1356.
[8] J. Wong, J.p. Sauve, and J.S. Field, “A Study of Fairness in Packet Switching Networks,” IEEE Trans. Commun., col.COM-30, No.2, 1982, pp. 346-353.
[9] E. L. Hahne, “Round-Robin Scheduling for Mac-Min Fairness in Data Networks,” IEEE Journal on Selected Areas in Communications, Vol. 9, No. 7, 1991, pp. 1024-1039.
[10] K. Omori, M. Yoo , T. Yokoyama, “A Packet Switch Scheduler based on 2DRR for High-Throughput,” The 75th National Convention of IPSJ, 1L-4, 2013, pp. 205-206.
Cite This Article
  • APA Style

    Kazunori Omori, Myungryun Yoo, Takanori Yokoyama. (2015). Packet Switch Scheduler for Increasing Sending Packet. International Journal of Intelligent Information Systems, 4(2-1), 7-12. https://doi.org/10.11648/j.ijiis.s.2015040201.12

    Copy | Download

    ACS Style

    Kazunori Omori; Myungryun Yoo; Takanori Yokoyama. Packet Switch Scheduler for Increasing Sending Packet. Int. J. Intell. Inf. Syst. 2015, 4(2-1), 7-12. doi: 10.11648/j.ijiis.s.2015040201.12

    Copy | Download

    AMA Style

    Kazunori Omori, Myungryun Yoo, Takanori Yokoyama. Packet Switch Scheduler for Increasing Sending Packet. Int J Intell Inf Syst. 2015;4(2-1):7-12. doi: 10.11648/j.ijiis.s.2015040201.12

    Copy | Download

  • @article{10.11648/j.ijiis.s.2015040201.12,
      author = {Kazunori Omori and Myungryun Yoo and Takanori Yokoyama},
      title = {Packet Switch Scheduler for Increasing Sending Packet},
      journal = {International Journal of Intelligent Information Systems},
      volume = {4},
      number = {2-1},
      pages = {7-12},
      doi = {10.11648/j.ijiis.s.2015040201.12},
      url = {https://doi.org/10.11648/j.ijiis.s.2015040201.12},
      eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ijiis.s.2015040201.12},
      abstract = {Recently, the need of the high speed packet switch is increased. The Re-2DRR scheduling algorithm based on 2DRR scheduling algorithm provides high throughput communication on a packet switch. However, computer network is using many cases, that huge data communication, complex, and other. This paper proposes a new method to increase choices in algorithm variation for three specific systems and more easily implementation than Re-2DRR. The effectiveness of the proposed algorithm is shown through simulation studies.},
     year = {2015}
    }
    

    Copy | Download

  • TY  - JOUR
    T1  - Packet Switch Scheduler for Increasing Sending Packet
    AU  - Kazunori Omori
    AU  - Myungryun Yoo
    AU  - Takanori Yokoyama
    Y1  - 2015/01/29
    PY  - 2015
    N1  - https://doi.org/10.11648/j.ijiis.s.2015040201.12
    DO  - 10.11648/j.ijiis.s.2015040201.12
    T2  - International Journal of Intelligent Information Systems
    JF  - International Journal of Intelligent Information Systems
    JO  - International Journal of Intelligent Information Systems
    SP  - 7
    EP  - 12
    PB  - Science Publishing Group
    SN  - 2328-7683
    UR  - https://doi.org/10.11648/j.ijiis.s.2015040201.12
    AB  - Recently, the need of the high speed packet switch is increased. The Re-2DRR scheduling algorithm based on 2DRR scheduling algorithm provides high throughput communication on a packet switch. However, computer network is using many cases, that huge data communication, complex, and other. This paper proposes a new method to increase choices in algorithm variation for three specific systems and more easily implementation than Re-2DRR. The effectiveness of the proposed algorithm is shown through simulation studies.
    VL  - 4
    IS  - 2-1
    ER  - 

    Copy | Download

Author Information
  • Information Engineering, Tokyo City University, Tokyo, Japan

  • Information Engineering, Tokyo City University, Tokyo, Japan

  • Information Engineering, Tokyo City University, Tokyo, Japan

  • Sections