Filters








6,236 Hits in 6.1 sec

Searching for Black-Hole Faults in a Network Using Multiple Agents [chapter]

Colin Cooper, Ralf Klasing, Tomasz Radzik
2006 Lecture Notes in Computer Science  
A black hole is a faulty or malicious node in the network such that if an agent enters this node, then it immediately "dies."  ...  We are interested in designing an efficient communication algorithm for the agents to identify all black holes.  ...  Acknowledgements The authors would like to thank the anonymous referees for their very helpful comments and suggestions.  ... 
doi:10.1007/11945529_23 fatcat:gzixefns7zennhhd7hibnzahli

Faulty Node Repair and Dynamically Spawned Black Hole Search [chapter]

Wei Shi, Mengfei Peng, Jean-Pierre Corriveau, William Lee Croft
2017 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
We conclude that, using our proposed algorithm, b + 4 agents can repair all faulty nodes and locate the black hole infected by a virus v within finite time, when the black hole appears in the network before  ...  We refer to the task of repairing multiple faulty nodes and pointing out the location of the black hole as the Faulty Node Repair and Dynamically Spawned Black Hole Search.  ...  Multiple black hole search (MBHS for brevity) problem has been studied by Cooper et al. [7] in synchronous networks.  ... 
doi:10.1007/978-3-319-59608-2_8 fatcat:ercaxwwm3zb7nivqbbxivclygu

A Review of Computation Solutions by Mobile Agents in an Unsafe Environment

Anis Zarrad, Yassine Daadaa
2013 International Journal of Advanced Computer Science and Applications  
In the first case, the dangerous node is a called black hole, a node where incoming agents are trapped, and the problem is for the agents to locate it.  ...  In this paper, we present several solutions for a black-hole and network decontamination problems. Then, we analyze their efficiency.  ...  We would also like to thank the anonymous referees for their useful comments and suggestions.  ... 
doi:10.14569/ijacsa.2013.040415 fatcat:hf3ytez3arcwfkeqk7lrwf2tm4

Searching for Black Holes in Subways

Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro
2011 Theory of Computing Systems  
Current mobile agent algorithms for mapping faults in computer networks assume that the network is static.  ...  More precisely, we study the problem of a team of asynchronous computational entities (the mapping agents) determining the location of black holes in a highly dynamic graph, whose edges are defined by  ...  The authors would like to thank the anonymous referees for their helpful comments.  ... 
doi:10.1007/s00224-011-9341-8 fatcat:fjlsdx7mrbaepo3pa3yvs6zwdq

Finding Good Coffee in Paris [chapter]

Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro
2012 Lecture Notes in Computer Science  
Our solution is the first to deal with scattered agents searching for black holes in a dynamic network and is optimal both in terms of the team size and the number of carrier moves required to complete  ...  We map the problem to the black hole search problem in the subway model introduced by Flocchini et al. at Fun with Algorithms 2010.  ...  Our solution is the first to look at black hole search by scattered agents in a dynamic network.  ... 
doi:10.1007/978-3-642-30347-0_17 fatcat:zk3xr7nfw5buzpfotzvhhd3zdi

Fault-Tolerant Exploration of an Unknown Dangerous Graph by Scattered Agents [chapter]

Paola Flocchini, Matthew Kellett, Peter C. Mason, Nicola Santoro
2012 Lecture Notes in Computer Science  
Black hole search (Bhs) is the problem of mapping or exploring a network where there are dangerous sites (black holes) that eliminate any incoming searcher without leaving a discernible trace.  ...  We study the Dge problem under the following conditions: there are multiple black holes and black links, the network topology is unknown, the searchers are initially scattered in arbitrary locations, and  ...  Main Contributions: We consider a rather difficult setting: a network of arbitrary topology with a multiplicity of black holes and black links.  ... 
doi:10.1007/978-3-642-33536-5_30 fatcat:pisakpcnmra6pl7eseczwspt2y

Tight bounds for black hole search with scattered agents in synchronous rings

Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
2013 Theoretical Computer Science  
In contrast, the only known solutions for the case of scattered agents searching for a black hole, use stronger models where the agents have non-constant memory, can write messages in whiteboards located  ...  We study the problem of locating a particularly dangerous node, the so-called black hole in a synchronous anonymous ring network with mobile agents.  ...  Most of the previous results on black hole search used agents whose memory is at least logarithmic in the size of the network.  ... 
doi:10.1016/j.tcs.2013.02.010 fatcat:db6fbk2lffgzfgsj4gnb6w2xua

Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings [article]

Jérémie Chalopin , Euripides Markou
2011 arXiv   pre-print
In contrast, the only known solutions for the case of scattered agents searching for a black hole, use stronger models where the agents have non-constant memory, can write messages in whiteboards located  ...  We study the problem of locating a particularly dangerous node, the so-called black hole in a synchronous anonymous ring network with mobile agents.  ...  Most of the previous results on black hole search used agents whose memory is at least logarithmic in the size of the network.  ... 
arXiv:1104.5076v1 fatcat:asdkgw5xe5eddiui7mkehy7d3y

Cooperating Mobile Agents [chapter]

Sukumar Ghosh, Anurag Dasgupta
2012 Mobile Agents in Networking and Distributed Computing  
Black hole search. A black hole is a node that can potentially capture a visiting agent and thus, disrupt an application.  ...  Network mapping is also known as the topology discovery problem. Making such a discovery using a single mobile agent is equivalent to developing an efficient algorithm for graph traversal.  ...  BHS in Arbitrary Networks Dobrev et al. studied topology independent generic solutions [26] for black hole search.  ... 
doi:10.1002/9781118135617.ch5 fatcat:wifipc6og5hh3oqcenhemqmrfq

TIME OPTIMAL ALGORITHMS FOR BLACK HOLE SEARCH IN RINGS

B. BALAMOHAN, P. FLOCCHINI, A. MIRI, N. SANTORO
2011 Discrete Mathematics, Algorithms and Applications (DMAA)  
It is known that any algorithm for black-hole search in a ring requires at least 2(n − 2) time in the worst case.  ...  In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace.  ...  In this paper we consider the Black Hole Search problem in a ring network.  ... 
doi:10.1142/s1793830911001346 fatcat:smaquqw2izbrzk5xytg2zsgh2i

Time Optimal Algorithms for Black Hole Search in Rings [chapter]

Balasingham Balamohan, Paola Flocchini, Ali Miri, Nicola Santoro
2010 Lecture Notes in Computer Science  
It is known that any algorithm for black-hole search in a ring requires at least 2(n − 2) time in the worst case.  ...  In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace.  ...  In this paper we consider the Black Hole Search problem in a ring network.  ... 
doi:10.1007/978-3-642-17461-2_5 fatcat:3ufxoc2cxfgjbczkdexgbcducq

Pingmesh

Chuanxiong Guo, Hua Chen, Zhi-Wei Lin, Varugis Kurien, Lihua Yuan, Dong Xiang, Yingnong Dang, Ray Huang, Dave Maltz, Zhaoyi Liu, Vin Wang, Bin Pang
2015 Computer communication review  
In this paper we use the term "network latency" from application's point of view.  ...  The collected latency data can then be used to address a series of challenges: telling if an application perceived latency issue is caused by the network or not, defining and tracking network service level  ...  Further it is not clear how ATPG can deal with packet black-holes where the rules for black-holes cannot be determined in advance.  ... 
doi:10.1145/2829988.2787496 fatcat:tsfgh5c2jvf2bd3hc4chc7etpu

Pingmesh

Chuanxiong Guo, Hua Chen, Zhi-Wei Lin, Varugis Kurien, Lihua Yuan, Dong Xiang, Yingnong Dang, Ray Huang, Dave Maltz, Zhaoyi Liu, Vin Wang, Bin Pang
2015 Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication - SIGCOMM '15  
The collected latency data can then be used to address a series of challenges: telling if an application perceived latency issue is caused by the network or not, defining and tracking network service level  ...  Can we get network latency between any two servers at any time in large-scale data center networks?  ...  Further it is not clear how ATPG can deal with packet black-holes where the rules for black-holes cannot be determined in advance.  ... 
doi:10.1145/2785956.2787496 dblp:conf/sigcomm/GuoYXDHMLWPCLK15 fatcat:hqmqji4tsbhcffo2lyfhz2f4hu

Computing with Mobile Agents in Distributed Networks [chapter]

Evangelos Kranakis, Danny Krizanc, Sergio Rajsbaum
2007 Handbook of Parallel Computing  
Research of the third author was supported in part by PAPIIT-UNAM. References  ...  Acknowledgements Research of the first author was supported in part by NSERC (Natural Sciences and Engineering Research Council of Canada) and MITACS (Mathematics of Information Technology and Complex  ...  Network Decontamination and Black Holes 1-16 Mobile agents have been found to be useful in a number of network security applications.  ... 
doi:10.1201/9781420011296.ch8 fatcat:eyr4zqq2qrb43b5kvcofx2jfuq

A Hybrid Improved MVO and FNN for Identifying Collected Data Failure in Cluster Heads in WSN

Thi-Kien Dao, Jie Yu, Trong-The Nguyen, Truong-Giang Ngo
2020 IEEE Access  
This study proposes a new classifying approach for identifying collected failure data of cluster head (CH) in wireless sensor networks (WSN) based on hybridizing improved multi-verse optimizer (MVO) and  ...  An improvement of the MVO is proposed based on enhancing diversity agents for avoiding it's disadvanced of the local optimal.  ...  The black holes and white holes are considered to search for exploration strategy, while wormholes are used in search space for exploitation action.  ... 
doi:10.1109/access.2020.3005247 fatcat:nlxyrob7kzeifb4krt6m5h2euu
« Previous Showing results 1 — 15 out of 6,236 results