A new concept-repackable networks

Jajszczyk, Andrzej; Jekel, G.

doi:10.1109/26.231967

Cited by 28 publications

(20 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here the random routing and packing strategy are considered. Packing strategy is a commonly used routing control strategy for MINs [1], [2], [4], and it is generally believed that packing can improve network performance and reduce network cost. Under the packing strategy for a VSOB network, a connection is realized on a path found by trying the most used plane of the network first and least used plane last [7].…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Blocking behaviors of crosstalk-free optical banyan networks on vertical stacking

Jiang

Shen

Khandker

et al. 2003

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Banyan networks are attractive for constructing directional coupler (DC)-based optical switching networks for their small depth and self-routing capability. Crosstalk between optical signals passing through the same DC is an intrinsic drawback in DC-based optical networks. Vertical stacking of multiple copies of an optical banyan network is a novel scheme for building nonblcoking (crosstalk-free) optical switching networks. The resulting network, namely vertically stacked optical banyan (VSOB) network, preserves all the properties of the banyan network, but increases the hardware cost significantly. Though much work has been done for determining the minimum number of stacked copies (planes) required for a nonblocking VSOB network, little is known on analyzing the blocking probabilities of VSOB networks that do not meet the nonblcoking condition (i.e., with fewer stacked copies than required by the nonblocking condition). In this paper, we analyze the blocking probabilities of VSOB networks and develop their upper and lower bounds with respect to the number of planes in the networks. These bounds depict accurately the overall blocking behaviors of VSOB networks and agree with the conditions of strictly nonblocking and rearrangeably nonblocking VSOB networks respectively. Extensive simulation on a network simulator with both random routing and packing strategy has shown that the blocking probabilities of both strategies fall nicely within our bounds, and the blocking probability of packing strategy actually matches the lower bound. The proposed bounds are significant because they reveal the inherent relationships between blocking probability and network hardware cost in terms of the number of planes, and provide network developers a quantitative guidance to trade blocking probability for hardware cost. In particular, our bounds provide network designers an effective tool to estimate the minimum and maximum blocking probabilities of VSOB networks in which different routing strategies may be applied. An interesting conclusion drawn from our work that has practical applications is that the hardware cost of a VSOB network can be reduced dramatically if a predictable and almost negligible nonzero blocking probability is allowed.Index Terms-Banyan networks, blocking probability, multistage interconnection networks (MINs), switching networks, vertical stacking.

show abstract

Section: Resultsmentioning

confidence: 99%

“…It is interesting to find out the probability that the worst-case scenario could occur. Let the probability that an input (output) port is busy be and denote by the probability that the 1 In this paper log means logarithm to the base 2.…”

Section: Deterministic Condition For Strictly Nonblockingmentioning

confidence: 99%

Blocking behaviors of crosstalk-free optical banyan networks on vertical stacking

Jiang

Shen

Khandker

et al. 2003

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…At later time, that request is again pulled back to the mostly used subnetwork. Jajszczyk et al [16] provided the basic condition for a 3-stage Clos network to be repackable. According to them if n and m being the input and output for each switching elements respectively then repackable condition is, m ≥ 2n− n/(r −1) .…”

Section: A Related Workmentioning

confidence: 99%

“…

…”

mentioning

confidence: 99%

Efficient Implementation of Symmetric Multistage Repackable Networks

Chakrabarty

Collier

2010

2010 International Conference on Computational Intelligence and Communication Networks

View full text Add to dashboard Cite

We revisited the problem of efficient implementation of large scale switching systems using repackable networks [16], which offer performance approaching that of strict sense nonblocking networks. In particular, we study repackable networks with more than three stages. Our method uses bypass path(s) for designing the repackable network to maintain path continuity while at repacking. This is essential if networks are not to be limited to time-slatted operations. We investigate the minimum number of bypass links required for different network sizes. The required minimum number of bypass links for a network depends on the number of links forming a rearrangement chain [2]. This paper shows minimum number of links required to complement a repackable and thereby demonstrate its attractive scaling properties. It also proposes some future applications where these network can be applicable.

show abstract

“…Repackings, as well as the first repacking algorithms, have been proposed by Ackroyd [5]. The class of repackable networks was defined by Jajszczyk and Jekel [6]. Generally speaking, RPNB networks contain less hardware than SSNB and WSNB, but more hardware than RRNB networks, which can be built using a theoretical minimum number of crosspoints [3].…”

Section: Introductionmentioning

confidence: 99%

Packet dispatching using module matching in the modified MSM Clos-network switch

Kleban

2017

Telecommun Syst

View full text Add to dashboard Cite

A modified memory-space-memory (MSM) Closnetwork switch, called MCNS, with a module-level matching packet dispatching scheme, is presented in the paper. The MCNS is a modification of the MSM Clos-network switch proposed to simplify the packet dispatching scheme. In this paper, we evaluate the combinatorial properties of the MCNS, as well as a new module-level matching packet dispatching algorithm. We also show how this algorithm can be implemented in an field-programmable gate array chip. Selected simulation results obtained for the MCNS are compared with the results obtained for the MSM Clos-network switch using other module-level matching algorithms.

show abstract

A new concept-repackable networks

Cited by 28 publications

References 9 publications

Blocking behaviors of crosstalk-free optical banyan networks on vertical stacking

Blocking behaviors of crosstalk-free optical banyan networks on vertical stacking

Efficient Implementation of Symmetric Multistage Repackable Networks

Packet dispatching using module matching in the modified MSM Clos-network switch

Contact Info

Product

Resources

About