The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we propose a novel load-balanced scheme-split aggregated flow (SAF) and design the buffering mechanism for two-stage self-routing switch. By grouping the signal lines with concentrators, the proposed scheme can obtain the statistical multiplex gain and reduce the complexity of computation. The mathematical analysis and simulations show that 100% throughput can be achieved for any admissible...
With the development of ASIC technology, buffered-crossbar (CICQ) switch is becoming more and more attractive, and many scheduling algorithms have been proposed based on this architecture. However, the existing schemes are either still a little complicated in hardware implementation or low efficient in scheduling performance. In this paper, we propose a simple and high efficient scheduling algorithm...
The CICQ switches have inherent advantages in supporting multicast traffic, and scheduling policies can be simplified to a great extent when distributed scheduling is applied. However, simulation results indicate that the increment of multicast will block unicast, and finally reduce the performance of the entire switch. To overcome this deficiency, the paper proposes a new switch called MCICQ (multicast...
The limitations in complexities and extensibilities of CICQ switchespsila scheduling policies are first analyzed. Then, based on this analysis, the guidelines for designing high extensible scheduling policies and the concept of virtual channel are proposed. Based on the guidelines and virtual channel, it comes up with a dynamic round robin scheduling algorithm-FDR (fair service and dynamic round robin),...
A novel two stage load-balanced multipath self-routing switch structure is introduced in this paper. Both stages use a multipath self-routing fabric. With simple algorithms and small buffers, the first stage fabric transforms the incoming traffic into uniform and the second stage fabric forwards the data in a self-routing manner to their final destinations. Compared with other similar structures,...
Recently, buffered crossbar (CICQ) switches are becoming more and more attractive to high performance routers/switches builders than bufferless schemes, as it can achieve throughput, rate and delay guarantees, and distributing scheduling algorithm can be easily implemented. In this article, we proposed a distributed scheduling algorithm (shorted by DS) supporting differentiated service model (DiffServ)...
Recently, buffered-crossbar (CICQ) switch is becoming more and more attractive, and many scheduling algorithms have been proposed based on this architecture. In this paper, we propose a multi-thresholds scheduling algorithm, shorted by MTS. The MTS algorithm combines the virtue of existing scheduling schemes, LQF-RR and SCBF, and uses a multi-thresholds manner to decrease the requirement of hardware...
With the development of ASIC technology, buffered crossbar is very popular for building switch architecture nowadays. This makes the combined input-crosspoint-queued (CICQ) switch a more attractive solution than the traditional input-queued (IQ) switch because of the simplicity of the CICQ switch scheduling. Recently, many distributed scheduling policies have been proposed based on this architecture...
This paper present a multiple input-crosspoint-output-queued (MICOQ) switch, and proved that the MICOQ switch with its dimension equal to two can exactly emulate OQ switch with no speedup. Furthermore, while increasing the dimension of MICOQ switch the multiple buffered crossbar of which can work under the line rate. All scheduling algorithms used in proving emulating OQ switch are distributed, thus...
Recently, buffered-crossbar (CICQ) switch is becoming more and more attractive to high performance router builders than bufferless schemes, because it can achieve throughput, rate and delay guarantees. In this article, we propose a practical scheduling scheme called the weighted quantitative queue longest and least scheduled first, shorted by WQ2L2SF. The main features of this scheduling algorithm...
It is well known that the buffered crossbar has simpler scheduling algorithms than an unbuffered crossbar. Buffered crossbar can be pipelined to run at a high speed, making it appealing for high performance switches and routers. Recent researches indicate that a buffered crossbar with modest speedup can exactly emulate an output queued (OQ) switch. As for per flow/priority guarantee, additional speedup...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.