1st International ICST Conference on Communications and Networking in China

Research Article

TA-iSLIP: A Traffic Adaptive iSLIP Scheduling Algorithm

  • @INPROCEEDINGS{10.1109/CHINACOM.2006.344751,
        author={WANG   Jing-cun and WANG   Qin and XIE  Xin-ai and LIU Lan-jun and WANG  Yue and FAN  Yong},
        title={TA-iSLIP: A Traffic Adaptive iSLIP Scheduling Algorithm},
        proceedings={1st International ICST Conference on Communications and Networking in China},
        publisher={IEEE},
        proceedings_a={CHINACOM},
        year={2007},
        month={4},
        keywords={iSLIP TA-iSLIP traffic adaptive scheduling},
        doi={10.1109/CHINACOM.2006.344751}
    }
    
  • WANG Jing-cun
    WANG Qin
    XIE Xin-ai
    LIU Lan-jun
    WANG Yue
    FAN Yong
    Year: 2007
    TA-iSLIP: A Traffic Adaptive iSLIP Scheduling Algorithm
    CHINACOM
    IEEE
    DOI: 10.1109/CHINACOM.2006.344751
WANG Jing-cun1,*, WANG Qin1, XIE Xin-ai1, LIU Lan-jun1, WANG Yue1, FAN Yong1
  • 1: Information Engineering School, University of Science and Technology Beijing, Beijing, China 100083
*Contact email: wjc9804@163.com

Abstract

Today, iSLIP scheduling algorithm is widely employed in high performance switches and routers, but its performance decreases dramatically under the burst traffic. A traffic adaptive algorithm based on iSLIP, TA-iSLIP, which iterates the scheduling decision between slots, is proposed in this paper. To make good use of the matched resources and decrease the system matching overhead, this algorithm intelligently estimates the traffic type using queue length, and then adopts different processing methods accordingly. Simulation results show that TA-iSLIP can achieve high performance under both the uniform and non-uniform traffics.