Token Based Scheduling Algorithm for Advanced IMOTS(N) Switch Architecture

Author

Zhang, Jianfei ; Fang, Zhiyi ; Chang, Hyung Jae ; Zheng, S.Q.

Author_Institution

Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun, China

fYear

2012

fDate

8-10 Aug. 2012

Firstpage

627

Lastpage

632

Abstract

In the previous papers, we presented a new mesh of trees based switch architecture, denoted as MOTS (N) switch, along with its variations IMOTS (N) and IMOTS-CT (N) switches. The analysis and simulation results were presented that all of them achieve 100% throughput and the mean cell delay of IMOTS-CT (N) is comparable to that of OQ switch with FIFO queues (FIFO-OQ). Especially, IMOTS-CT (N) was proposed for a way to reduce mean cell delay of IMOTS (N). In this paper, we propose advanced IMOTS (N), denoted as AIMOTS (N), with token based scheduling algorithm of it. It shows a way to reduce hardware complexity of IMOTS (N) and IMOTS-CT (N). Quantitative simulation results are presented to compare AMOTS (N) switch with others.

Keywords

IP networks; protocols; queueing theory; switches; switching networks; token networks; trees (mathematics); AMOTS(N) switch; FIFO queue; IMOTS(N) switch; IMOTS-CT(N) switch; mean cell delay; token based scheduling algorithm; trees based switch architecture; Computer architecture; Delay; Hardware; Microprocessors; Scheduling algorithms; Switches; IMOTS-CT(N);

fLanguage

English

Publisher

ieee

Conference_Titel

Software Engineering, Artificial Intelligence, Networking and Parallel & Distributed Computing (SNPD), 2012 13th ACIS International Conference on

Conference_Location

Kyoto

Print_ISBN

978-1-4673-2120-4

Type

conf

DOI

10.1109/SNPD.2012.133

Filename

6299347