Abstract
During the path establishment, states of switching elements in the switch network may need rearrangement. C.-T. Lea et. al [1] has first mentioned about the rearrangement behavior of the switching networks. He has analyzed the frequency of its occurrence using stochastic method. It is notable that rearrangement behavior of switching network includes rearrangement of connections and rearrangement of switching elements. Optimization of rearrangement cost of switching network can save both power and time, which in turn can increase the switching speed. This paper determines the rearrangement cost of strictly non-blocking Vertically Stacked Optical Banyan networks in terms of switching elements. We believe that our result will be helpful in designing, implementing and analyzing different algorithms of the networks.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2013 3rd IEEE International Advance Computing Conference (IACC) |
Editors | B. M. Kalra, Deepak Garg, Rajesh Prasad, Sachin Kumar |
Place of Publication | Piscataway, NJ |
Pages | 296-301 |
Number of pages | 6 |
ISBN (Electronic) | 9781467345293, 9781467345286 |
DOIs | |
Publication status | Published - 2013 |
Externally published | Yes |
Event | 2013 3rd IEEE International Advance Computing Conference, IACC 2013 - Ghaziabad, India Duration: 22 Feb 2013 → 23 Feb 2013 |
Other
Other | 2013 3rd IEEE International Advance Computing Conference, IACC 2013 |
---|---|
Country/Territory | India |
City | Ghaziabad |
Period | 22/02/13 → 23/02/13 |
Keywords
- Strictly non-blocking network
- Switching network
- Vertically Stacked Optical Banyan network
- Rearrangement cost