We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Advanced Search
Volume 16 Issue 4
July  2001
Turn off MathJax
Article Contents
Abstract
Related Articles
WANG Youcheng, YU Shengsheng, ZHA Hui, ZHOU Jinli. Approximate Sorting of Packet-Scheduling in High-Speed Networks[J]. Journal of Computer Science and Technology, 2001, 16(4).
Citation: WANG Youcheng, YU Shengsheng, ZHA Hui, ZHOU Jinli. Approximate Sorting of Packet-Scheduling in High-Speed Networks[J]. Journal of Computer Science and Technology, 2001, 16(4).
shu

Approximate Sorting of Packet-Scheduling in High-Speed Networks

More Information
  • Published Date: July 14, 2001
    Abstract
  • Fairness, latency and computational complexity are three importantfactors in evaluating the performance of a scheduling algorithm. Fairnessmust be satisfied so that service can be distributed according to thereserved rate. Only when latency is irrelevant to the number ofconnections, is it possible to minimize the end-to-end delay throughcontrolling the reserved rate. Among existing scheduling algorithms,Round Robin is the least complex. However, conventional Round Robin isunable to ensure fairness, and the improved round robin algorithms likeDeficit Round Robin, Weighted Round Robin and Virtual Round Robin areunable to ensure that their latencies are irrelevant to the number ofconnections although they guarantee fairness. Potential Round Robindeveloped for analysis of fairness and latency reduction is thusproposed. It is based on the introduction of a new concept, RoundPotential Function. The function splits service time into a number ofservice round periods to guarantee fairness regardless of the servingprocess used in the period. In the analysis of latency, service roundperiods are re-split into multiple scanning cycles for further servicedistribution with approximate sorting between scanning cycles. As aresult, latency is no longer relevant to the number of connectionswhile the low complexity of round robin is kept.
    • FullText(HTML)
    • References (0)
    • Relative Articles

  • Related Articles

    [1]Gang Huang, Li Zhou, Xuan-Zhe Liu, Hong Mei, Shing-Chi Cheung. Performance Aware Service Pool in Dependable Service Oriented Architecture[J]. Journal of Computer Science and Technology, 2006, 21(4): 565-573.
    [2]Xiao-Ling Wang, Sheng Huang, Ao-Ying Zhou. QoS-Aware Composite Services Retrieval[J]. Journal of Computer Science and Technology, 2006, 21(4): 547-558.
    [3]Jing Wang, Li-Yong Zhang, Yan-Bo Han. Client-Centric Adaptive Scheduling of Service-Oriented Applications[J]. Journal of Computer Science and Technology, 2006, 21(4): 537-546.
    [4]Chang-Jun Jiang, Zhao-Hui Zhang, Guo-Sun Zeng et al.. Urban Traffic Information Service Application Grid[J]. Journal of Computer Science and Technology, 2005, 20(1).
    [5]Su-Bin Shen, Guan-Qun Gu, Shun-Yi Zhang. A Conceptual Model of Service Customization and Its Implementation[J]. Journal of Computer Science and Technology, 2004, 19(2).
    [6]HE XiaoShan, SUN XianHe, Gregor von Laszewski. QoS Guided Min-Min Heuristic for Grid Task Scheduling[J]. Journal of Computer Science and Technology, 2003, 18(4).
    [7]PANG Bin, SHAO HuaiRong, GAO Wen. An Admission Control Scheme for End-to-End Statistical QoS Provision in IP Networks[J]. Journal of Computer Science and Technology, 2003, 18(3).
    [8]MA Huadong, Kang G. Shin. Hybrid Broadcast for the Video-on-Demand Service[J]. Journal of Computer Science and Technology, 2002, 17(4).
    [9]WANG Chonggang, LONG Keping, YANG Jian, CHENG Shiduan. An Effective Feedback Control Mechanism for DiffServ Architecture[J]. Journal of Computer Science and Technology, 2002, 17(4).
    [10]ZOU Tao, WANG Jicheng, ZHANG Fuyan. Information Service Model with Mobile Agent Supported[J]. Journal of Computer Science and Technology, 2000, 15(2): 150-157.
    • Supplements (0)

Catalog

    Get Citation
    PDF
    XML
    Article views (11) PDF downloads (1401) Cited by()
    Related

    Copyright ©2025 JCST, All Rights Reserved     京ICP备05002829号-1

    Institute of Computing Technology, Chinese Academy of Sciences
    P.O. Box 2704, Beijing 100190, P.R. China

    Tel.: 86-10-62610746 E-mail: jcst@ict.ac.cn

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return