Exact wirelength of embedding chord graph into tree-based architectures

N. Parthiban, Joe Ryan, Indra Rajasingh, R. Sundara Rajan and L. Nirmala Rani

International Journal of Networking and Virtual Organisations, 2017, vol. 17, issue 1, 76-87

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. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=83547 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijnvor:v:17:y:2017:i:1:p:76-87

Access Statistics for this article

More articles in International Journal of Networking and Virtual Organisations from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().