Network coding is able to address output conflicts when fanout splitting is allowed for multicast switching.Hence,it successfully achieves a larger rate region than non-coding approaches in crossbar switches.However,n...Network coding is able to address output conflicts when fanout splitting is allowed for multicast switching.Hence,it successfully achieves a larger rate region than non-coding approaches in crossbar switches.However,network coding requires large coding buffers and a high computational cost on encoding and decoding.In this paper,we propose a novel Online Network Coding framework called Online NC for multicast switches,which is adaptive to constrained buffers.Moreover,it enjoys a much lower decoding complexity by a Vandermonde matrix based approach,as compared to conven-tional randomized network coding Our approach realizes online coding with one coding algo-rithm that synchronizes buffering and coding.Therefore,we significantly reduce requirements on buffer space,while also sustaining high throughputs.We confirm the superior advantages of our contributions using empirical studies.展开更多
The particular switch concerned here is a Three-Stage Time-space-time (TST)interconnection network and performs the time-division circuit switching. The input and outputstages are Time Slot Interchangers (TSI) . The c...The particular switch concerned here is a Three-Stage Time-space-time (TST)interconnection network and performs the time-division circuit switching. The input and outputstages are Time Slot Interchangers (TSI) . The central stage is a time-multiplexed switch with twoports per address. By exploiting the channel grouping at the central stage as well as reducing theaverage loading at each internal frame, the three-stage multicast switch has potential to removealmost all slot contention blockings.展开更多
A multicast replication algorithm is proposed for shared memory switches. It uses a dedicated FIFO to multicast by replicating cells at receiver and the FIFO is operating with shared memory in parallel. Speedup is use...A multicast replication algorithm is proposed for shared memory switches. It uses a dedicated FIFO to multicast by replicating cells at receiver and the FIFO is operating with shared memory in parallel. Speedup is used to promote loss and delay performance. A new queueing analytical model is developed based on a sub-timeslot approach. The system performance in terms of cell loss and delay is analyzed and verified by simulation.展开更多
Along with the unbounded speedup and exponential growth of virtual queues requirement aiming for 100% throughput of multicast scheduling as the size of the high-speed switches scale, the issues of low throughput of mu...Along with the unbounded speedup and exponential growth of virtual queues requirement aiming for 100% throughput of multicast scheduling as the size of the high-speed switches scale, the issues of low throughput of multicast under non-speedup or fixed crosspoint buffer size is addressed. Inspired by the load balance two-stage Birkhoff-von Neumann architecture that can provide 100% throughput for all kinds of unicast traffic, a novel 3-stage architecture, consisting of the first stage for multicast fan-out splitting, the second stage for load balancing, and the last stage for switching (FSLBS) is proposed. And the dedicated multicast fan-out splitting to unicast (M2U) scheduling algorithm is developed for the first stage, while the scheduling algorithms in the last two stages adopt the periodic permutation matrix. FSLBS can achieve 100% throughput for integrated uni- and multicast traffic without speedup employing the dedicated M2U and periodic permutation matrix scheduling algorithm. The operation is theoretically validated adopting the fluid model.展开更多
基金Supported by the National 863 Projects of China(2009AA01Z205)the Fund of National Laboratory(P080010)+2 种基金the Natural Science Foundation of China(60872010,60972016)the Program for New Century Excellent Talents in University (NCET070339)the Funds for Distinguished Young Scientists of Hubei,China(2009 CDA150)
文摘Network coding is able to address output conflicts when fanout splitting is allowed for multicast switching.Hence,it successfully achieves a larger rate region than non-coding approaches in crossbar switches.However,network coding requires large coding buffers and a high computational cost on encoding and decoding.In this paper,we propose a novel Online Network Coding framework called Online NC for multicast switches,which is adaptive to constrained buffers.Moreover,it enjoys a much lower decoding complexity by a Vandermonde matrix based approach,as compared to conven-tional randomized network coding Our approach realizes online coding with one coding algo-rithm that synchronizes buffering and coding.Therefore,we significantly reduce requirements on buffer space,while also sustaining high throughputs.We confirm the superior advantages of our contributions using empirical studies.
文摘The particular switch concerned here is a Three-Stage Time-space-time (TST)interconnection network and performs the time-division circuit switching. The input and outputstages are Time Slot Interchangers (TSI) . The central stage is a time-multiplexed switch with twoports per address. By exploiting the channel grouping at the central stage as well as reducing theaverage loading at each internal frame, the three-stage multicast switch has potential to removealmost all slot contention blockings.
文摘A multicast replication algorithm is proposed for shared memory switches. It uses a dedicated FIFO to multicast by replicating cells at receiver and the FIFO is operating with shared memory in parallel. Speedup is used to promote loss and delay performance. A new queueing analytical model is developed based on a sub-timeslot approach. The system performance in terms of cell loss and delay is analyzed and verified by simulation.
文摘Along with the unbounded speedup and exponential growth of virtual queues requirement aiming for 100% throughput of multicast scheduling as the size of the high-speed switches scale, the issues of low throughput of multicast under non-speedup or fixed crosspoint buffer size is addressed. Inspired by the load balance two-stage Birkhoff-von Neumann architecture that can provide 100% throughput for all kinds of unicast traffic, a novel 3-stage architecture, consisting of the first stage for multicast fan-out splitting, the second stage for load balancing, and the last stage for switching (FSLBS) is proposed. And the dedicated multicast fan-out splitting to unicast (M2U) scheduling algorithm is developed for the first stage, while the scheduling algorithms in the last two stages adopt the periodic permutation matrix. FSLBS can achieve 100% throughput for integrated uni- and multicast traffic without speedup employing the dedicated M2U and periodic permutation matrix scheduling algorithm. The operation is theoretically validated adopting the fluid model.
