• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Li Ji, Zeng Huaxin, Xu Dengyuan. A New Service Guaranteed Scheduling Policy for Buffered Crossbar Switches[J]. Journal of Computer Research and Development, 2007, 44(11): 1873-1880.
Citation: Li Ji, Zeng Huaxin, Xu Dengyuan. A New Service Guaranteed Scheduling Policy for Buffered Crossbar Switches[J]. Journal of Computer Research and Development, 2007, 44(11): 1873-1880.

A New Service Guaranteed Scheduling Policy for Buffered Crossbar Switches

More Information
  • Published Date: November 14, 2007
  • Fast scheduler with service guarantee performance is preferred in high speed switching networks. Based on the features of EPFTS (Ethernet-oriented physical frame timeslot switching) and CICQ (combined input-crosspoint-queued), a new scheduling policy called timeslot reservation weighted fair scheduling (TRWFS) is introduced. In order to provide bandwidth guarantee service to guarantee-required (GR) traffic, TRWFS takes the total reserved timeslots of aggregated GR traffic on each I/O port pair as the basic scheduling weight and forwards traffic according to the following principles: 1) Giving dispatching priority to GR traffic and 2) Trying to balance the surplus timeslots (defined as service discrepancy between the actual packetized system and the idealized fluid system) for GR-traffic on each I/O port pair. In order to apply TRWFS and decrease the implementation complexity of TRWFS to constant time complexity O(1), two scheduling algorithms—TRWFS_I and TRWFS_II are further presented. Analysis and simulation results demonstrate that the two TRWFS algorithms both reach the design objective. Moreover, simulation results show that TRWFS/round-robin combined scheduling scheme in CICQ switches require fewer crosspoint buffer compared with other schemes.
  • Related Articles

    [1]Xu Ming, Fan Yimeng, Jiang Changjun. Time-Varying Underwater Acoustic Channel Based Physical Layer Secret Key Generation Scheme[J]. Journal of Computer Research and Development, 2019, 56(12): 2660-2670. DOI: 10.7544/issn1000-1239.2019.20190040
    [2]Zhu Mengying, Zheng Xiaolin, Wang Chaohui. Investment Recommendation Based on Risk and Surplus in P2P Lending[J]. Journal of Computer Research and Development, 2016, 53(12): 2708-2720. DOI: 10.7544/issn1000-1239.2016.20160608
    [3]Zhou Jingang, Zhao Dazhe, Xu Li, Liu Jiren. Frame Refinement: Combining Frame-Based Software Development with Stepwise Refinement[J]. Journal of Computer Research and Development, 2013, 50(4): 711-721.
    [4]Chen Ting, Li Jiandong, Zhong Shaobo, Li Changle. A Fair-Oriented Two-Level Scheduling Scheme for QoS Guarantee in WiMAX[J]. Journal of Computer Research and Development, 2009, 46(7): 1094-1101.
    [5]Sun Yantao, Shi Zhiqiang, Wu Zhimei. Automatic Discovery of Physical Topology in Switched Ethernets[J]. Journal of Computer Research and Development, 2007, 44(2): 208-215.
    [6]Lee Yong, Luo Junzhou, Wu Jun. A High-Throughput Scheduling Algorithm with Small Crosspoint Buffers for CICQ Switches[J]. Journal of Computer Research and Development, 2006, 43(12): 2033-2040.
    [7]Zheng Yanfeng, Sun Shutao, He Simin, Gao Wen. A Dual Round-Robin Algorithm for Combined Input-Crosspoint-Queued Switches[J]. Journal of Computer Research and Development, 2006, 43(7): 1225-1232.
    [8]Sun Shutao, He Simin, Zheng Yanfeng, Gao Wen. Multicast Scheduling in Buffered Crossbar Switches with Multiple Input Queues[J]. Journal of Computer Research and Development, 2006, 43(6): 1036-1043.
    [9]Liao Yuan, Huai Xiaoyong, Li Mingshu. QuCOM: A QoS Management Model for Component System[J]. Journal of Computer Research and Development, 2005, 42(10): 1802-1808.
    [10]Song Meina, Song Junde, and Zhan Xiaosu. An Efficient Queuing and Switching Scheme for Multicast in High-Speed Routers[J]. Journal of Computer Research and Development, 2005, 42(5): 810-817.

Catalog

    Article views (603) PDF downloads (477) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return