On the performance of a dual round-robin switch

Author

Li, Yihan ; Panwar, Shivendra ; Chao, H. Jonathan

Author_Institution

Dept. of Electr. Eng., Polytech. Univ., Brooklyn, NY, USA

Volume

3

fYear

2001

fDate

2001

Firstpage

1688

Abstract

The dual round-robin matching (DRRM) switch has a scalable, low complexity architecture which allows for an aggregate bandwidth exceeding 1 Tb/s using current CMOS technology. In this paper we prove that the DRRM switch can achieve 100% throughput under i.i.d. and uniform traffic. The DRRM is the first practical matching scheme for which this property has been proved. The performance of the DRRM switch is then studied and compared with the iSLIP switch. The delay performance under uniform traffic and the hot-spot throughput of DRRM is better than that of iSLIP, while the throughput of iSLIP under some nonuniform traffic scenarios is slightly higher than that of DRRM. Since throughput drops below 100%, under nonuniform traffic, we also examine some variations of the DRRM matching scheme for nonuniform traffic

Keywords

packet switching; queueing theory; scheduling; telecommunication traffic; CMOS technology; DRRM matching scheme; DRRM switch; aggregate bandwidth; delay performance; dual round-robin matching switch; dual round-robin switch; hot-spot throughput; i.i.d. traffic; iSLIP switch; low complexity architecture; nonuniform traffic; scalable architecture; throughput performance; uniform traffic; virtual output queueing switch; Aggregates; CMOS technology; Chaos; Delay; Fabrics; Iterative algorithms; Switches; Telecommunication switching; Throughput; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE

Conference_Location

Anchorage, AK

ISSN

0743-166X

Print_ISBN

0-7803-7016-3

Type

conf

DOI

10.1109/INFCOM.2001.916666

Filename

916666