N. Parthiban

A Lower Bound for Dilation of an Embedding

Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. In this paper, we introduce a technique to obtain a lower bound for dilation of an embedding. Moreover, we give algorithms to compute exact dilation of embedding circulant network into a triangular grid, Tower of Hanoi graph and Sierpinski gasket graph, proving that the lower bound obtained is sharp.

Bothway embedding of circulant network into grid

Graph embedding is an important technique that maps a guest graph into a host graph, usually an interconnection network. In this paper, we compute the dilation and wirelength of embedding circulant network into grid and vice versa.

A Tight Bound for Congestion of an Embedding

Graph embedding has been known as a powerful tool for implementation of parallel algorithms or simulation of different interconnection networks. Congestion is one of the main optimization objectives in global routing. In this paper, we introduce a technique to obtain a tight bound for congestion of an embedding. Moreover, we give algorithms to compute exact congestion of embedding the hypercubes into the cylinder and the torus and prove that the bound obtained is sharp.

A note on minimum linear arrangement for BC graphs

A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper, we solve the minimum linear arrangement problem for bijective connection graphs (fo...

Performance Analysis of CREIDO Enhanced Chord Overlay Protocol for Wireless Sensor Networks

Wireless sensor networks (WSN) are alluring to the researchers because of its creditable and commendable wide variety of applications in the new era. The main and major impediment for sensor networks is its overall architecture and its coexistence with the other established networks. This paper discusses about the application of chord overlay protocol in mobile wireless sensor networks enhancing the robustness of overlay architecture for the betterment of packet delivery ratio by amending CREIDO packet that changes the traditional operation of stabilize function in the chord protocol. This has been extensively simulated by the help of OMNeT++ simulator and its additional frameworks for mobile wireless sensor networks and overlay networks. The result obtained from the simulation expounds that the enhanced chord accomplishes the traditional chord protocol’s packet delivery ratio by 13.7 %.

Exact wirelength of embedding chord graph into tree-based architectures

Graph embedding has gained importance in the field of interconnection networks and virtual networks to study the computational capabilities of networks. An overlay is a logical network on top of a physical network. The chord architecture is a powerful overlay network. In this paper we embed chord graphs into certain trees for minimising wirelength.

Analysis of Creido Enhanced Chord Overlay Protocol Under Different Movement Models in Delay Tolerant Networks

AbstractDelay Tolerant Network (DTN) is an enlivening area to delve in owing to its rudimentary characteristics like intermittent links, variable delays etc. and its physiognomies of applications wherever traditional networks like sparse and emergency mobile ad-hoc networks fails. These applications are aided extensively if the performance metrics are recuperated. In this article a novel plot to increase the end to end bundle delivery ratio by assimilating CREIDO bundles in chord overlay network. This periodic bundle invokes the stabilize function of chord overlay protocol to make the overlay topology robust during node join and exits. In this article, OverSim framework of OMNeT++ is used under different mobility models to analyse the performance metrics of CREIDO bundles. Thus the results obtained were encouraging and outsourced the existing protocol in aspects of Bundle Delivery Ratio and throughput.

Embedding of Recursive Circulants into Certain Necklace Graphs

Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. In this paper, we embed recursive circulants into certain necklace graphs for minimizing the wirelength.

Embedding Circulant Networks into Butterfly and Benes Networks

The dilation of an embedding is defined as the maximum distance between pairs of vertices of host graph that are images of adjacent vertices of guest graph. An embedding with a long dilation faces many problems, such as long communication delay, coupling problems and the existence of different types of uncontrolled noise. In this paper, we compute the minimum dilation of embedding circulant networks into butterfly and benes networks.