Embedding Circulant Networks into Butterfly and Benes Networks

2015 ◽  
pp. 298-306
Author(s):  
R. Sundara Rajan ◽  
Indra Rajasingh ◽  
Paul Manuel ◽  
T. M. Rajalaxmi ◽  
N. Parthiban
Keyword(s):  
Benes Networks ◽  
Circulant Networks

scholarly journals On the Secure Domination of Benes Networks

2021 ◽  
Vol 1770 (1) ◽  
pp. 012084
Author(s):  
D Angel ◽  
R Mary Jeya Jothi ◽  
R Revathi ◽  
A. Raja
Keyword(s):  
Benes Networks ◽  
Secure Domination

scholarly journals Design and Implementation of Rearrangable Non-Blocking Switching Network in VLSI

2019 ◽  
Vol 8 (2S11) ◽  
pp. 2858-2863
Keyword(s):  
Interconnection Network ◽  
The Other ◽  
Switching Network ◽  
Low Latency ◽  
Multistage Interconnection Network ◽  
Design And Implementation ◽  
Benes Network ◽  
Benes Networks

The main goal of this article is to implement an effective Non-Blocking Benes switching Network. Benes Switching Network is designed with the uncomplicated switch modules & it’s have so many advantages, small latency, less traffic and it’s required number of switch modules. Clos and Benes networks are play a key role in the class of multistage interconnection network because of their extensibility and mortality. Benes network provides a low latency when compare with the other networks. 8x8 Benes non blocking switching network is designed and synthesized with the using of Xilinx tool 12.1.

An optimal message routing algorithm for circulant networks

2006 ◽  
Vol 52 (5) ◽  
pp. 298-306 ◽  
Author(s):  
Tomaž Dobravec ◽  
Janez Žerovnik ◽  
Borut Robič
Keyword(s):  
Routing Algorithm ◽  
Message Routing ◽  
Circulant Networks

scholarly journals Monophonic wirelength on Circulant Networks

2018 ◽  
Vol 7 (3) ◽  
pp. 1154
Author(s):  
K Uma Samundesvari ◽  
Sindhuja G. Michael
Keyword(s):  
The Family ◽  
Vertex Set ◽  
Sum Of Distances ◽  
Circulant Networks

In this paper, we define the monophonic embedding of graph G into graph H and we present an algorithm for finding the monophonic wirelength of circulant networks into the family of grids M(n×2), n≥2.The monophonic embedding of a graph G into a graph H is an embedding denoted by fm is a bijective map from the vertex set of G into the vertex set of H and fm is a one-one mapping from the edge set (x, y) of G into Pm(H) where Pm(H) is the set of monophonic paths between fm(x) and fm(y) for every fm(x), fm(y) H. The monophonic wirelength of fm of G into H is the sum of distances of monophonic paths between two vertices fm(x) and fm(y) in H such that (x, y) E(G). This paper presents a monophonic algorithm to find the monophonic wirelength of circulant networks G(2n, ±S) , where S {1,2,3,…,n} into the family of grids M[n×2],n≥2. We also derived a Lemma to get the monophonic edge congestion MEC(G,H).  

Sign in / Sign up

Export Citation Format

Share Document