Timeslot Weighted Fair Scheduling in EPFTS
Ji Li · Journal of Software · 2006
introduces a new scheduling algorithm call TWFS (timeslot weighted fair scheduling) which could be implemented in EPFTS nodes to fit the requirement of fast data switching and QoS (quality of service) guarantee in SUPANET (single physical layer user-data platform architecture network). By analyzing merits and shortcomings of the typical scheduling techniques such as iSlip (iteration round-robin match with slip) and BvN-switch (Birkhoff-von neumann switch), TWFS utilizes the same iteration mechanism as iSlip and takes the total reserved timeslots of an I/O port pair as the weight (priority) for data switching, thus overcomes the shortcoming of the slow response to traffic fluctuation of BvN-switch, while keeping the same calculation complexity in iteration to O(log2N) as with iSlip. Simulation results have shown that TWFS can made an optimal balance among effectiveness、fairness, and complexity and is most suitable for future high-speed EPFTS nodes in SUPANET. Key words: scheduling algorithm; TWFS (timeslot weighted fair scheduling); EPFTS (ethernet-like physical frame timeslot switching); SUPANET (single physical layer user-data platform architecture network); input queuing 摘 要: 基 于 EPFTS(ethernet-like physical frame timeslot switching)交换技 术,提出了一种新型调度算法 TWFS(timeslot weighted fair scheduling),可实现 于 EPFTS(ethernet-like physical frame timeslot switching)交换节 点,满 足 SUPANET(single physical layer user-data platform architecture network)网络中具 备 QoS(quality of