By Topic

Notice of Violation of IEEE Publication Principles
A Dynamic Distributed Diagnosis Algorithm for an Arbitrary Network Topology with Unreliable Nodes and Links

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

Notice of Violation of IEEE Publication Principles

"A Dynamic Distributed Diagnosis Algorithm for an Arbitrary Network Topology with Unreliable Nodes and Links,"
by Pabitra Mohan Khilar and Sudipta Mahapatra,
in the Proceedings of the International Conference on Advanced Computing and Communications, 2007. ADCOM, Dec. 2007, pp. 125-130

After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.

This paper contains significant portions of original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.

Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:

"A Distributed Network Connectivity Algorithm,"
By E. Procopio Duarte Jr. and A.Weber,
The Sixth International Symposium on Autonomous Decentralized Systems, 2003. ISADS 2003 April 2003, pp. 285-292

This paper presents a distributed network diagnosis (DND) algorithm for an arbitrary network topology where every node needs to record the status of every other nodes and links assuming the nodes and links are subjected to crash and value faults in a dynamic fault environment (the node's or link's status may change during execution of algorithm). The algorithm operates correctly in each connected component if the network is partitioned due to a set of faulty links or faulty nodes. The worst-case bounds for diagnostic latency is at most O(td) rounds where t is the number of dissemination trees and d is the diameter of the network. The proposed approach uses non-broadcasting method of message dissemination that has similar diagnostic latency with flooding [4] and similar message co- mplexity with Chinese Agent [14] method of message dissemination respectively.

Published in:

Advanced Computing and Communications, 2007. ADCOM 2007. International Conference on

Date of Conference:

18-21 Dec. 2007