A new concept-repackable networks

  title={A new concept-repackable networks},
  author={Andrzej Jajszczyk and Grzegorz Jekel},
  journal={IEEE Trans. Commun.},
The following classes of connecting networks, based on their combinatorial properties, have been previously defined: networks nonblocking in the strict sense, networks nonblocking in the wide sense, rearrangeable networks, and blocking networks. To these the authors add the class of repackable networks, i.e., networks in which blocking can be avoided by using call repacking control algorithms. The conditions under which a three-stage Clos network is repackable are formulated and proved. The… 

Figures and Tables from this paper

Nonblocking, repackable, and rearrangeable Clos networks: fifty years of the theory evolution

The article gives an overview of major theoretical issues associated with a switching network structure proposed by C. Clos (1953), showing the development of major research areas and a taxonomy of Clos switching networks.

Efficient Implementation of Symmetric Multistage Repackable Networks

  • A. ChakrabartyM. Collier
  • Computer Science
    2010 International Conference on Computational Intelligence and Communication Networks
  • 2010
This paper shows minimum number of links required to complement a repackable and thereby demonstrate its attractive scaling properties and proposes some future applications where these network can be applicable.

Lower Bounds for Wide-Sense Non-blocking Clos Network

For the multirate environment, it is shown that for large enough r any 3-stage Clos network needs at least 3n-2 center switches to guarantee wide-sense nonblocking.

Repackable multi-Log2N networks

Wide-sense nonblocking Clos networks under packing strategy

It is proved that the necessary and sufficient condition for a v(m, n, r) network to be nonblocking under packing strategy is m/spl ges/[(2-1/F/sub 2r-1/)n] where F/sub 3/ is the Fibonaaci number.

Rearrangeable and Repackable S-W-S Elastic Optical Networks for Connections with Limited Bandwidths

  • B. Lin
  • Physics
    Applied Sciences
  • 2020
This paper considers an optical node architecture that is similar to a three-stage Clos network for elastic optical networks and proposes a graph-theoretic approach and different routing algorithms to derive the sufficient conditions under which an S-W-S switching fabric will be rearrangeable non blocking and repackable nonblocking.

Lower bounds for WSNB multi-log/sub 2/N switching networks

  • W. KabacińskiM. Michalski
  • Computer Science
    Advanced Industrial Conference on Telecommunications/Service Assurance with Partial and Intermittent Resources Conference/E-Learning on Telecommunications Workshop (AICT/SAPIR/ELETE'05)
  • 2005
It is proved, that, for switching networks with an odd number of stages, the lower bound for wide-sense nonblocking operation is greater than the necessary and sufficient conditions for rearrangeable switching networks.

The Number of Rearrangements Performed via Extended Connection Chains for Rearrangeable Clos Networks

  • S. Ohta
  • Computer Science
  • 2021
A new upper bound on the number of rearrangements for Clos network is presented, derived from the extended connection chain concept proposed in a previous study, which is smaller than the previously known bounds for a certain range of m.



Dynamic Routing and Call Repacking in Circuit-Switched Networks

It is found that dynamic routing algorithms improve network performance by increasing the number of paths available for call connection over what would otherwise be available to a corresponding static routing.

Call Repacking in Connecting Networks

A method for increasing the traffic capacity of connecting networks is presented which involves rearrangement of calls while in progress, which has the advantage that the added control complexity is much less than required for rearranges in the normal sense.

Proposed use of rearrangement in multiexchange telecommunication networks

It is shown for two simple networks that rearrangement eliminates blocking and provides a better grade of service than conventional automatic alternative routing and should enable fewer trunks to be provided.

A Simple Control Algorithm for Rearrangeable Switching Networks with Time Division Multiplexed Links

  • S. Ohta
  • Computer Science
    IEEE J. Sel. Areas Commun.
  • 1987
A simple control algorithm is proposed for a three-stage rearrangeable switching network with time division multiplexed links that is efficient for broadband switching systems or cross-connect devices where nonblocking switches are needed.

Analytical and simulation study of simple rearrangeable multiexchange networks

Congestion probabilities for calls in simple three-exchange networks operated with and without rearrangements are determined analytically and by digital simulation. Load-loss curves are obtained,

A study of non-blocking switching networks

This paper describes a method of designing arrays of crosspoints for use in telephone switching systems in which it will always be possible to establish a connection from an idle inlet to an idle

Traffic Capacity of Cellular Mobile Communications Systems

  • D. Everitt
  • Computer Science, Business
    Comput. Networks ISDN Syst.
  • 1990

Mathematical Theory of Connecting Networks and Telephone Traffic.

Non-Blocking Rearrangeable Networks with Distributed Control