Title: Exact wirelength of embedding chord graph into tree-based architectures

Authors: N. Parthiban; Joe Ryan; Indra Rajasingh; R. Sundara Rajan; L. Nirmala Rani

Addresses: School of Computing Sciences and Engineering, VIT University, Chennai, 600 127, India ' School of Electrical Engineering and Computer Science, University of Newcastle, Australia ' School of Advanced Sciences, VIT University, Chennai, 600 127, India ' Department of Mathematics, Anna University, Chennai, 600 025, India ' Department of Mathematics, School of Science and Humanities, Karunya University, Coimbatore, 641 114, India

Abstract: 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.

Keywords: embedding; congestion; wirelength; chord graph; binary tree; sibling tree.

DOI: 10.1504/IJNVO.2017.083547

International Journal of Networking and Virtual Organisations, 2017 Vol.17 No.1, pp.76 - 87

Received: 31 Jul 2015
Accepted: 17 Feb 2016

Published online: 31 Mar 2017 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article