Scheduling algorithms for buffered crossbar switches

Abstract

Today s information technology is driven toward new directions by newlinemodern-day business requirements. Various computing platforms and data newlinecenters manage most of these requirements effectively. The networks and newlinetheir interconnections define the data centers. The challenge faced by the newlineinterconnection systems is to handle the huge Internet omni directional traffic newlinein real or non-real-time. Moreover, they must deliver optimal performance newlineirrespective of the scenarios they work on. Modern-day applications such as newlineonline gaming, Live TV, online classrooms, etc., demand high-speed newlineinterconnection support to transmit data of any size and type in desired time. newlineTo manage the situation, a high-speed switching system was deployed on the newlineinterconnection networks. Among the various types of switching newlinearchitectures, the input queued switching fabrics are very common among newlineInternet switches. This is due to its simplicity, adaptability, and flexibility in newlineswitching the packets at the required speed. These switching fabrics are also newlineused as cross-layer switches deployed in the data center racks. newlineThe functionality of a switching system is based on the working newlineprinciple of the scheduling algorithms. The schedulers have to increase the newlineswitching efficiency by scheduling a maximum number of packets at each newlinetime period. The objective of our research work is to propose a series of newlinescheduling algorithms for input queued switching architectures that can newlineachieve maximum performance. We proposed two iterative schedulers and newlineone non-iterative scheduler in our research work and their throughput-delay newlineperformance was assessed. newline