Multicast Cell Scheduling Methods Based on Cube Addressing Scheme

• Main Authors: Hung-Pin Chen, 陳弘斌
• Other Authors: Wen-Tsuen Chen
• Format: Others
• Language: en_US
• Published: 1995
• Online Access: http://ndltd.ncl.edu.tw/handle/28654433080070179938

碩士 === 國立清華大學 === 資訊科學學系 === 83 === There are several schemes proposed to provide multicast function in the ATM switching system. Those schemes can be classified into two main design approaches to duplicate cells. One employed multistage interconnection networks to duplicate cells, e.g. broadcast Banyan networks (BBN), while the other employed a shared buffer to duplicate cells. However, there are some disadvantages in the two design approaches. The requested copy number of the former design approach is con- strained by the switch size and the latter required advanced technique to speed up buffer access time. In this thesis, a new simple multicast switching architecture is proposed to achieve high performance. Our proposed architecture employs input queuing and the cube concept is introduced and used as the output address encoding scheme. We propose two algorithms, greedy and switching vector, to schedule cells. The output contention can be completely solved by our scheduling schemes, but the internal contention still exists. Hence, A tandem of a Batcher network, Banyan network and broadcast Banyan network, called cube multicast network, is also proposed to avoid in- ternal contention without any output contention. The design of cube multicast network is based on the blocking free property of the cube addressing scheme. Some simulations are evaluated and the throughput of the switch system can reach 0.98.