Circuit-switching networks with priorities on a one-dimensional lattice

A method originating from statistical mechanics (low-density and high-temperature expansions) is used to prove the existence and uniqueness of a stationary regime for switching networks on finite or infinite graphs. The main assumption is that the message (customer) flows circulating through the network are ‘localized' in the sense that, for any message, the probability of having a long path is rapidly decreasing (and, moreover, a path of a ‘typical' message consists of one line). The switching rule combines message-switching and circuit-switching principles. The stationary regime for the network under consideration may be treated as a ‘small perturbation' of the ‘idealized' regime in the totally decoupled network where all the messages have single line paths.

Download Full-text

Perturbation theory approach for a class of hybrid switching networks with small transit flows

Advances in Applied Probability ◽

10.1017/s0001867800019418 ◽

1990 ◽

Vol 22 (01) ◽

pp. 211-229 ◽

Cited By ~ 1

Author(s):

M. Ya. Kelbert ◽

R. P. Kopeika ◽

R. N. Shamsiev ◽

Yu. M. Sukhov

Keyword(s):

Perturbation Theory ◽

High Temperature ◽

Existence And Uniqueness ◽

Stationary Regime ◽

Infinite Graphs ◽

Circuit Switching ◽

Low Density ◽

Theory Approach ◽

Switching Networks ◽

Hybrid Switching

A method originating from statistical mechanics (low-density and high-temperature expansions) is used to prove the existence and uniqueness of a stationary regime for switching networks on finite or infinite graphs. The main assumption is that the message (customer) flows circulating through the network are ‘localized' in the sense that, for any message, the probability of having a long path is rapidly decreasing (and, moreover, a path of a ‘typical' message consists of one line). The switching rule combines message-switching and circuit-switching principles. The stationary regime for the network under consideration may be treated as a ‘small perturbation' of the ‘idealized' regime in the totally decoupled network where all the messages have single line paths.

Download Full-text

Multi-stage Interconnection networks CLOS/BENES Parallel Routing Algorithms for circuit switching system

International Journal of Recent Technology and Engineering - 2 ◽

10.35940/ijrte.b1357.0982s1119 ◽

2019 ◽

Vol 8 (2S11) ◽

pp. 2864-2872

Keyword(s):

Interconnection Networks ◽

Routing Algorithms ◽

Switching Network ◽

Circuit Switching ◽

Switching Networks ◽

Low Area ◽

Switching Circuits ◽

Multi Stage ◽

High Area ◽

Benes Networks

This article approaches the design of parallel routing Clos and Benes switching networks in Communication Technology. In communication, the transmission of data with less traffic and low latency are the biggest challenges. The conventional packet switching circuits takes the more power and high area to overcome this problem parallel routing algorithms are proposed. Clos and Benes networks are designed for the circuit switching systems where the switching configuration will be rearranged and it’s relatively low speed. Most of the existing parallel routing algorithms are not practical those are fail to interconnects the inputs with the matched outputs with less traffic. In this article, we designed Clos and Benes network. Clos and Benes networks are the Non-blocking switching Networks. Clos Switching network provides the better results like low area and less delay when compare with the Benes Switching Network. Clos and Benes non-blocking switching circuits are designed by Verilog HDL, Synthesized and simulated by XILINX 12.1 tool

Download Full-text