Research on input-queued slicing domain scheduling based on Crossbar in the reconfigurable network

Abstract

In order to solve the problem which was switching fabric could not meeting scale application of abundant differ-ent business in traditional technology system.The slicing domain scheduling viewpoint based on reconfigurable network technology system was proposed.It used selecting and closing part Crossbar switching points slicing model.It analyzed and deduced smoothed deficit round-robin(SDRR)scheduling algorithm in carrying group and longest queue first(LQF)sche-duling algorithm in scheduling domain.Then it contrasted complexity and time delay in switching performance evaluation system(SPES).The results show that the complexity of slicing domain LQF is less than traditional LQF.The more number of domains is,the less complexity of slicing domain LQF is.The time delay of slicing domain scheduling with three slices is less than others without slicing domain,and is close to time delay of fair output-queued scheduling algorithm.

Keywords

• reconfigurable network;service carrying network;slicing domain scheduling;longest queue first