The week's pick
Random Articles
Reseach Article
Design and Simulation of Output Queuing with the Middle stage Buffered (OQMB) Clos Packet Switching Network
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 79 - Number 10 |
| Year of Publication: 2013 |
| Authors: S. Rajeshwari, R. Bharathi |
10.5120/13778-1649
|
S. Rajeshwari, R. Bharathi . Design and Simulation of Output Queuing with the Middle stage Buffered (OQMB) Clos Packet Switching Network. International Journal of Computer Applications. 79, 10 ( October 2013), 26-33. DOI=10.5120/13778-1649
Abstract
Clos network, a family of multistage networks, are attractive alternative for constructing scalable packet switches because of its distributed and modular design. The clos packet switching networks are the next step in scaling current crossbar switches to large number of ports. This paper presents the design and simulation of buffer less- buffered-buffered - Clos Packet switching network architecture. This paper proposes a novel the output queuing with the middle stage buffered (OQMB) Clos Packet switching architecture that does not need any schedulers. This architecture employs an ID matching with OQMB packet switching and desynchronize static round robin (DSRR) scheme to achieve Maximum throughput under any admissible traffic. Our queuing analysis demonstrates that only small size buffers are needed in the central stage. The only trade off for the proposed (OQMB) architecture is to employ small extra resequencing buffers. Input modules with desynchronize static round robin (DSRR) scheme connection scheme guarantees no cell contention in input stages. As a result, the OQMB architecture can achieve very high performance, and high throughput under any admissible traffic.
References
- S. Borkar, "Thousand core chips—A technology perspective," in Proc. ACM/IEEE Design Autom. Conf. (DAC), 2007, pp. 746–749.
- P. -H. Pham, P. Mau, and C. Kim, "A 64-PE folded-torus intra-chip communication fabric for guaranteed throughput in network-on-chip based applications," in Proc. IEEE Custom Integr. Circuits Conf. (CICC), 2009, pp. 645–648.
- C. Neeb, M. J. Thul, and N. Wehn, "Network-on- chip-centric approach to interleaving in high throughput channel decoders," in Proc. IEEE Int. Symp. Circuits Syst. (ISCAS), 2005, pp. 1766–1769.
- H. Moussa, A. Baghdadi, and M. Jezequel, "Binary de Bruijn on-chip network for a flexible multiprocessor LDPC decoder," in Proc. ACM/ IEEE Design Autom. Conf. (DAC), 2008, pp. 429–434.
- H. Moussa, O. Muller, A. Baghdadi, and M. Jezequel, "Butterfly and Benes-based on-chip communication networks for multiprocessor turbo decoding," in Proc. Design, Autom. Test in Euro. (DATE), 2007
- S. R. Vangal, J. Howard, G. Ruhl, S. Dighe, H. Wilson, J. Tschanz, D. Finan, A. Singh, T. Jacob, S. Jain, V. Erraguntla, C. Roberts, Y. Hoskote, N. Borkar, and S. Borkar, "An 80-tile sub-100-w TeraFLOPS processor in 65-nm CMOS," IEEE J. Solid-State Circuits, Jan. 2008.
- W. J. Dally and B. Towles, Principles and Practices of Interconnection Networks: San Francisco, CA: Morgan Kaufmann, 2004.
- N. Michael, M. Nikolov, A. Tang, G. E. Suh, and C. Batten, "Analysis of application-aware on-chip routing under traffic uncertainty," in Proc. IEEE/ACM Int. Symp. Netw. Chip (NoCS), 2011.
- P. -H. Pham, J. Park, P. Mau, and C. Kim, "Design and implementation of backtracking wave-pipeline switch to support guaranteed throughput in network-on-chip," IEEE Trans. Very Large Scale Integr. (VLSI)Syst. ,
- D. Ludovici, F. Gilabert, S. Medardoni, C. Gomez, M. E. Gomez, P. Lopez, G. N. Gaydadjiev, and D. Bertozzi, "Assessing fat-tree topologies for regular network-on-chip design under nanoscale technology constraints," in Proc. Design, Autom.
- Y. Yang and J. Wang, "A fault-tolerant rearrangeable permutation network," IEEE Trans. Comput. , vol. 53, no. 4, Apr. 2004.
- P. T. Gaughan and S. Yalamanchili, "A family of fault-tolerant routing protocols for direct multiprocessor networks," IEEE Trans. ParallelDistrib. Syst. , vol. 6, no. 5, May 1995.
- V. E. Beneš, "Mathematical Theory of Connecting Networks and TelephoneTraffic". New York: Academic Press, 1965.
- F. Safaei a,c, A. Khonsari a,b, M. Fathy c, M. Ould-Khaoua "Pipelined circuit switching: Analysis for the torus with non-uniform traffic"
- Phi-Hung Pham, Junyoung Song, Jongsun Park, and Chulwoo KimDesign and Implementation of an On-Chip Permutation Network for Multiprocessor System On-Chip
- C. Clos, A Study of Non-Blocking Switching Networks, Bell Sys. Tech. Jour. , pp. 406-424, March 1953.
- F. M. Chiussi, J. G. Kneuer, and V. P. Kumar, Low-Cost Scalable Switching Solutions for Broadband Networking: the ATLANTA Architecture and Chipset, IEEE Commun. Mag. , pp. 44-53, vol. 35, issue 12, Dec 1997.
- K. Pun and M. Hamdi, Distro: A Distributed Static Round-Robin Scheduling Algorithm for Bufferless Clos-Network Switches, GLOBECOM '02, pp. 2298-2302, Vol. 3, Nov. 2002.
- E. Oki, Z. Jing, R. Rojas-Cessa, and J. chao, concurrent Round-Robin- Based Dispatching Schemes for Clos-Network Switches, IEEE Trans. On Networking, pp. 830-844, Vol. 10, issue 6, Dec 2002.
- Xin Li, Zhen Zhou and Mounir Hamdi "Space-Memory-Memory Architecture for Clos-Network Packet Switches"
Index Terms
Keywords