Nonblocking Multirate Networks

@article{Melen1989NonblockingMN,
  title={Nonblocking Multirate Networks},
  author={Riccardo Melen and Jonathan S. Turner},
  journal={SIAM J. Comput.},
  year={1989},
  volume={18},
  pages={301-313}
}
An extension of the classical theory of connection networks is defined and studied. This extension models systems in which multiple connections of differing data rates share the links within a network. Conditions under which the Clos and Cantor networks are strictly nonblocking for multirate traffic are determined. The authors also determine conditions under which the Benes network and variants of the Cantor and Clos networks are rearrangeable. It is found that strictly nonblocking operation… 
Nonblocking multirate distribution networks
  • R. Melen, J. Turner
  • Computer Science
    Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration
  • 1990
TLDR
The authors derive conditions under which networks due to Y.P. Thompson, N. Pippenger, and J.S. Turner lead to nonblocking multirate distribution networks, which include both rearrangeable and wide-sense nonblocking networks.
Approximation Algorithms for Configuring Hierarchical Nonblocking Communication Networks
TLDR
A framework is given for specifying nonblocking traffic limits in a connection-oriented communications network, intended to model Asynchronous Transfer Mode networks and traffic.
Continuous bandwidth, nonblocking, multirate switching in 3-stage Clos networks
TLDR
The analysis presented in this paper determines the number of the second stage switches required for strictly nonblocking operation of generalised 3-stage Clos (1953) switching networks in the continuous bandwidth case.
Multirate non-blocking generalized three-stage Clos switching networks
TLDR
The analysis presented determines the minimum number of the second-stage switches required for strictly non-blocking operation of generalized three-stage Clos (1953) switching networks in the multirate environment.
Multirate Clos networks
TLDR
How Clos' results have been generalized to systems that support connections with varying bandwidth requirements has extended the application of Clos networks well beyond their original technological context and has led to a number of interesting new results, especially in connection with systems thatSupport multicast communication.
The strictly non-blocking condition for three-stage networks
DESIGN OF NONBLOCKINGATM NETWORKSJ
TLDR
This paper focuses on global traac constraints that simply limit the total entering and exiting traac at each switching system, and introduces a more realistic link cost model and develops a number of results using it.
Design of Nonblocking ATM Networks
TLDR
A more realistic link cost model is introduced, a technique for converting tree-structured networks to nonblocking hierarchical networks satisfying limits on the capacity of any single switch is described, and a number of results are developed using it.
Strictly nonblocking operation of 3-stage Clos switching networks
TLDR
This paper studies the nonblocking switching operation of 3–stage Clos networks in the multirate environment and determines bounds for the minimum number of middle-stage switches required for strictly nonblocking operation.
On rearrangeable multirate three-stage Clos networks
...
...

References

SHOWING 1-10 OF 23 REFERENCES
Blocking states in connecting networks made of square switches arranged in stages
  • V. Benes
  • Computer Science
    The Bell System Technical Journal
  • 1981
TLDR
This paper examines the blocking states of a network for two-sided connecting networks made of square switches arranged in stages, where a parallel pair is a pair of paths through the network that meet at no switch.
Fluid Flow Loading Analysis of Packet Switching Networks
TLDR
This paper addresses the problem of how the configuration of user connections affects the loading of the internal links of a switching fabric used for fast packet switching and introduces a sys­ tematic method of analyzing the effects of a given traffic configuration.
Performance of Processor-Memory Interconnections for Multiprocessors
  • J. Patel
  • Computer Science
    IEEE Transactions on Computers
  • 1981
TLDR
The analysis shows that delta networks have a far better performance per cost than crossbars in large multiprocessing systems.
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
A Two-Stage Rearrangeable Broadcast Switching Network
TLDR
The invention is based on an innovative approach of connecting each inlet channel to a multiplicity of first-stage switches according to a predetermined connection pattern, which provides a general solution for any nonblocking broadcast switching application.
On a class of rearrangeable switching networks part I: Control algorithm
TLDR
An algorithm is developed to control a class of rearrangeable switching networks, particularly with the base-2 structure, and system organization and processing time for rearranging the network are studied and are shown to be practical.
On non-blocking switching networks
TLDR
It is shown that σ(a, a) ⩽ C ae2√log a·log 2.2 shows the minimal number of switches necessary to connect a inputs to b outputs using a non-blocking network.
The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet Switching
TLDR
A new, high-performance packet-switching architecture, called the Knockout Switch, is proposed, which uses a novel concentrator design at each output to reduce the number of separate buffers needed to receive simultaneously arriving packets.
A Sampler of Circuit Switching Networks
This overview presents several different types of circuit switching networks: concentrators, connectors, expanders, partitioners, SIMD interconnectors, and sorters.
Graph Theory with Applications
TLDR
The burgeoning of Graph Theory was first aware when I studied the 1940 paper of Brooks, Smith, Stone and Tutte in the Duke Mathematical Journal, ostensibly on squared rectangles, all in the Quest of the Perfect Square.
...
...