Abstract
Abstract The paper deals with the problem of traffic scheduling in a crossbar switch node used in communication networks. In particular, we study the non-conflict scheduling in sub matrices of the connection matrix of an Algorithm with diagonal activations of joint sub matrices (ADAJS) and propose a scheduling algorithm which is optimal in terms of performance and the necessary memory. For comparison, we have examined six algorithms with their software models.
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.
