{"title":"Emulating output queueing with the Central-stage Buffered Clos packet switching network","authors":"Xiangjie Ma, Julong Lan, Baisheng Zhang","doi":"10.1109/HSPR.2008.4734428","DOIUrl":null,"url":null,"abstract":"Clos packet switching networks are the next step in scaling current Crossbar switches to large number of ports. The novel central-stage buffered Clos-network (CBC network) has the merit of fully memory-sharing among all inputs and outputs and was proved to emulate an FCFS-OQ switch with the central module count (i.e. m) about four times of the input modules count (i.e. n). This leads to high hardware complexity when designing a CBC network with high radices. This paper studies the graphic model of the CBC network, proposes analytical methods including the stable path set and the stable vertex pair set, and demonstrates that the CBC network can match an FCFS-OQ switch with the central module count m>=n. By comparison, the number of the central modules in our result is only a quarter of that in previous results, and therefore the implementation of a CBC network become much simpler in practical routers.","PeriodicalId":130484,"journal":{"name":"2008 International Conference on High Performance Switching and Routing","volume":"95 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on High Performance Switching and Routing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HSPR.2008.4734428","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Clos packet switching networks are the next step in scaling current Crossbar switches to large number of ports. The novel central-stage buffered Clos-network (CBC network) has the merit of fully memory-sharing among all inputs and outputs and was proved to emulate an FCFS-OQ switch with the central module count (i.e. m) about four times of the input modules count (i.e. n). This leads to high hardware complexity when designing a CBC network with high radices. This paper studies the graphic model of the CBC network, proposes analytical methods including the stable path set and the stable vertex pair set, and demonstrates that the CBC network can match an FCFS-OQ switch with the central module count m>=n. By comparison, the number of the central modules in our result is only a quarter of that in previous results, and therefore the implementation of a CBC network become much simpler in practical routers.