Exact wirelength of embedding chord graph into tree-based architectures. (2017)

• Record Type: Journal Article
• Authors: Parthiban, N.; Ryan, Joe; Rajasingh, Indra; Rajan, R. Sundara; Rani, L. Nirmala
• Is Part Of: International journal of networking and virtual organisations. Volume 17:Number 1(2017)
• Page Start: 76
• Page End: 87
• Publication Date: 2017
• Subjects: embedding -- congestion -- wirelength -- chord graph -- binary tree -- sibling tree; Computer networks -- Periodicals; Information networks -- Periodicals; Virtual corporations -- Periodicals; Electronic commerce -- Periodicals; Management information systems -- Periodicals; Management -- Data processing -- Periodicals; 004.65
• Languages: English
• ISSNs: 1470-9503

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.