On the rearrangeablility of the 3-stage Clos network with 2-cast traffic
碩士 === 國立交通大學 === 應用數學系 === 90 === The 3-stage Clos network is one of the most common switching network studied in the literature. A switching network is called rearrangeable nonblocking if any set of disjoint pairs of inputs and output can be simultaneously connected assuming the network...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/15075631015329819419 |
| Summary: | 碩士 === 國立交通大學 === 應用數學系 === 90 === The 3-stage Clos network is one of the most common switching network studied in the literature. A switching network is called rearrangeable nonblocking if any set of disjoint pairs of inputs and output can be simultaneously connected assuming the network is empty.
In multicast traffic, where each input can request connection to many outputs, but no output can be requested by two inputs. The multicast traffic is called 2-cast if at most 2 outputs can be requested in each connection.
In this thesis, we study the rearrangeability of the 3-stage Clos network with 2-cast traffic.
|
|---|