Skip to Main content Skip to Navigation
Journal articles

Hardness Results and Heuristic for Multi-groups Interconnection

Abstract : This paper is dedicated to the connection, by a provider, of multiple groups of nodes spread over a network. The role of the provider is to interconnect the members of every group. For this purpose, it must distribute the available links of the network between the groups. The general aim then is to allocate these links in such a way that the communications latencies in the allocated structure are equivalent to the ones in the original (full) network for each group. We study two approaches constructing structures preserving the maximum latency (called the diameter). Unfortunately we show that the associated optimization graph problems are difficult (one cannot be approximated by a constant and the other is NP-complete). Due to these difficulties we relax the constraint on the diameter and propose to construct a unique tree connecting all the groups together. We give a heuristic to treat this problem and we propose several analytical results on its maximum and average latencies performance.
Document type :
Journal articles
Complete list of metadatas
Contributor : Frédéric Davesne <>
Submitted on : Saturday, November 26, 2011 - 7:29:32 PM
Last modification on : Tuesday, October 6, 2020 - 9:20:05 AM



Lélia Blin, Christian Laforest, Stephane Rovedakis, Nicolas Thibault. Hardness Results and Heuristic for Multi-groups Interconnection. The Computer Journal, Oxford University Press (UK), 2010, 53 (9), pp.1497--1507. ⟨10.1093/comjnl/bxp072⟩. ⟨hal-00645153⟩



Record views