Abstract
Consideration is given to the scheduling problem for avoiding output conflicts in time-division multiplex (TDM) switching systems. In many applications, if a source transmits a packet to a destination in a frame, it is highly probable that it will also transmit another packet to the same destination in the next frame. So it is not necessary to schedule incoming packets for every frame if all the switching patterns for the nearest scheduled frame can be preserved and the patterns updated appropriately according to changes in traffic demand. An adaptive algorithm of a lower time complexity which assigns time slots to packets according to the changes in traffic demands is given. This algorithm has the worst case time complexity O(N/sup 2/L), where L is the TDM frame length and N is the switch size. Simulation results show that the algorithm is efficient for interdependent traffic and for random traffic. >
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.
