NDLI: Searching for a black hole in arbitrary networks: optimal mobile agents protocols

Please wait, while we are loading the content...

Searching for a black hole in arbitrary networks: optimal mobile agents protocols

Content Provider	Springer Nature Link
Author	Dobrev, Stefan Flocchini, Paola Prencipe, Giuseppe Santoro, Nicola
Copyright Year	2006
Abstract	Consider a networked environment, supporting mobile agents, where there is a black hole: a harmful host that disposes of visiting agents upon their arrival, leaving no observable trace of such a destruction. The black hole search problem is the one of assembling a team of asynchronous mobile agents, executing the same protocol and communicating by means of whiteboards, to successfully identify the location of the black hole; we are concerned with solutions that are generic (i.e., topology-independent). We establish tight bounds on the size of the team (i.e., the number of agents), and the cost (i.e., the number of moves) of a size-optimal solution protocol. These bounds depend on the a priori knowledge the agents have about the network, and on the consistency of the local labelings. In particular, we prove that: with topological ignorance Δ+1 agents are needed and suffice, and the cost is Θ(n 2), where Δ is the maximal degree of a node and n is the number of nodes in the network; with topological ignorance but in presence of sense of direction only two agents suffice and the cost is Θ(n 2); and with complete topological knowledge only two agents suffice and the cost is Θ(n log n). All the upper-bound proofs are constructive.
Starting Page	1
Ending Page	99999
Page Count	99999
File Format	PDF
ISSN	01782770
Journal	Distributed Computing
Volume Number	19
Issue Number	1
e-ISSN	14320452
Language	English
Publisher	Springer-Verlag
Publisher Date	2006-02-21
Publisher Place	Berlin/Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Mobile agents Malicious host Distributed search Black hole Topological knowledge Theory of Computation Software Engineering/Programming and Operating Systems Computer Communication Networks Computer Systems Organization and Communication Networks Computer Hardware
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computer Networks and Communications Computational Theory and Mathematics Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Searching for a black hole in arbitrary networks: optimal mobile agent protocols

Searching for a Black Hole in Arbitrary Networks: Optimal Mobile Agent Protocols (2002)

Searching for a black hole in arbitrary networks: optimal mobile agents protocols (2006).

Distributed graph searching with a sense of direction

The cost of monotonicity in distributed graph searching

Leader election for anonymous asynchronous agents in arbitrary networks

Optimal propagation-based protocols implementing causal memories

Searching for a black hole in arbitrary networks (2002)

The Doomsday distributed termination detection protocol

Searching for a black hole in arbitrary networks: optimal mobile agents protocols

Similar Documents

Searching for a black hole in arbitrary networks: optimal mobile agent protocols

Searching for a Black Hole in Arbitrary Networks: Optimal Mobile Agent Protocols (2002)

Searching for a black hole in arbitrary networks: optimal mobile agents protocols (2006).

Distributed graph searching with a sense of direction

The cost of monotonicity in distributed graph searching

Leader election for anonymous asynchronous agents in arbitrary networks

Optimal propagation-based protocols implementing causal memories

Searching for a black hole in arbitrary networks (2002)

The Doomsday distributed termination detection protocol

Searching for a black hole in arbitrary networks: optimal mobile agents protocols