Abstract

Based on the technology of EPFTS (ethernet-like physical frame timeslot switching), this paper 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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.