Analysis on Memory-Space-Memory Clos Packet Switching Network
| Autor: | Xiangjie Ma, Junpeng Mao, Lian Guan, Julong Lan, Yuxiang Hu, Baisheng Zhang |
|---|---|
| Rok vydání: | 2007 |
| Předmět: | |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783540768364 APPT |
| DOI: | 10.1007/978-3-540-76837-1_25 |
| Popis: | Memory-Space-Memory (MSM) Clos packet switching networks are the next step in scaling current crossbar switches to many hundreds or few thousands of ports. Clos networks had been studied and applied quite well in circuit switching system, with much attentions paid to its non-blocking property to decrease call blocking rates. In contrast, for packet switching systems, more care is taken to per-packet based forwarding performance of the switching networks. MSM Clos network has the merit of keeping packet sequence and therefore is quiet adapt to packet switching fabric. By way of buffering architecture, MSM Clos network is quite similar to the CIOQ Crossbar based single stage switching fabric, which promotes us to extend the results of CIOQ matching an OQ switch [1] to MSM Clos networks. Meanwhile, although the CIOQ switch can emulate an OQ switch, it needs cell insertion algorithm and stable matching algorithm with high information complexity and computing complexity. This has prevented its application seriously in new generation of routers with high speed linking rates and large port numbers. So we propose a new method of Per-Input OQ Emulation (PIOE), including both new cell insertion and scheduling algorithm (PVPP-CIP and -CSP) with only per-input local information and new matching algorithm (S3) with computing complexity of O(1), which is more practical in both CIOQ Crossbar and MSM Clos networks. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|