Dominating problems in swapped networks

Authors:
Weidong Chen;Zaixin Lu;Weili Wu
Affiliations:
-;-;-
Venue:
Information Sciences: an International Journal
Year:
2014

Citing 25
Cited 0

An Extended Dominating Node Approach to Broadcast and Global Combine in Multiport Wormhole-Routed Mesh Networks

IEEE Transactions on Parallel and Distributed Systems
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Randomized Routing, Selection, and Sorting on the OTIS-Mesh

IEEE Transactions on Parallel and Distributed Systems
Image Processing on the OTIS-Mesh Optoelectronic Computer

IEEE Transactions on Parallel and Distributed Systems
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Optical transpose k-ary n-cube networks

Journal of Systems Architecture: the EUROMICRO Journal
Swapped interconnection networks: Topological, performance, and robustness attributes

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Swapped (OTIS) Networks Built of Connected Basis Networks Are Maximally Fault Tolerant

IEEE Transactions on Parallel and Distributed Systems
Load-balancing on swapped or OTIS networks

Journal of Parallel and Distributed Computing
Performance evaluation of broadcast and global combine operations in all-port wormhole-routed OTIS-Mesh interconnection networks

Cluster Computing
On the k-tuple domination of generalized de Brujin and Kautz digraphs

Information Sciences: an International Journal
New dominating sets in social networks

Journal of Global Optimization
An efficient algorithm for constructing a connected dominating set in mobile ad hoc networks

Journal of Parallel and Distributed Computing
Domination number of Cartesian products of directed cycles

Information Processing Letters
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks
Pancyclicity of OTIS (swapped) networks based on properties of the factor graph

Information Processing Letters
Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks

Journal of Parallel and Distributed Computing
Finding minimum weight connected dominating set in stochastic graph based on learning automata

Information Sciences: an International Journal
Fast algorithms for min independent dominating set

Discrete Applied Mathematics
On rainbow domination numbers of graphs

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

Swapped Networks (SNs) are a family of two-level interconnection networks, suitable for constructing large parallel and distributed systems. In this paper, the Minimum Dominating Set (MDS) problem and the Minimum Connected Dominating Set (MCDS) problem in SNs are investigated based on the connectivity rule of SNs. We prove the two problems in SNs are NP-hard, and present two efficient algorithms for building dominating sets and connected dominating sets in SNs. The proposed algorithms use as input a given (connected) dominating set of the factor network, and yield a good approximation of an MDS or MCDS for the SN provided that the input is a good approximation of an MDS or MCDS for the factor network. We also derive several non-trivial bounds on the (connected) domination parameters of SNs. We believe this work is of theoretical interest in graph theory since SNs form a family of graphs. It may also motivate further research on dominating problems in SNs with their potential applications.