Abstract
Scheduling ATM cell schemes for an (optical) ATM switch can dramatically influence the performance of the ATM communication network. In this work, we present an efficient scheduling algorithm that is based on perfect bipartite matching. The algorithm ensures fairness, providing a guaranteed latency bound for each arriving cell.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
