KLASING, R., MARKOU, E. & RADZIK, T. (2007). HARDNESS AND APPROXIMATION RESULTS FOR BLACK HOLE SEARCH IN ARBITRARY NETWORKS. THEOR. COMPUT. SCI., 384 (2-3),

Slides:

Advertisements

Similar presentations

Chapter 5: Tree Constructions

Advertisements

* Distributed Algorithms in Multi-channel Wireless Ad Hoc Networks under the SINR Model Dongxiao Yu Department of Computer Science The University of Hong.

Leader Election Breaking the symmetry in a system.

Lecture 8: Asynchronous Network Algorithms

Chapter 15 Basic Asynchronous Network Algorithms

Leader Election Let G = (V,E) define the network topology. Each process i has a variable L(i) that defines the leader.  i,j  V  i,j are non-faulty.

Gossip and its application Presented by Anna Kaplun.

Analysis of Algorithms Depth First Search. Graph A representation of set of objects Pairs of objects are connected Interconnected objects are called “vertices.

Lecture 7: Synchronous Network Algorithms

Graph Traversals Visit vertices of a graph G to determine some property: Is G connected? Is there a path from vertex a to vertex b? Does G have a cycle?

Chapter 8, Part I Graph Algorithms.

© 2006 Pearson Addison-Wesley. All rights reserved14 A-1 Chapter 14 excerpts Graphs (breadth-first-search)

Graphs By JJ Shepherd. Introduction Graphs are simply trees with looser restrictions – You can have cycles Historically hard to deal with in computers.

Graph Traversals Visit vertices of a graph G to determine some property: Is G connected? Is there a path from vertex a to vertex b? Does G have a cycle?

Minimum Spanning Trees

Dobrev, S., Flocchini, P., Prencipe, G., & Santoro, N. (2007). Mobile Search for a Black Hole in an Anonymous Ring. Mengfei Peng.

Using Scattered Mobile Agents to Locate a Black Hole in an Un-oriented Ring with Tokens Stefan Dobrev, Nicola Santoro, Wei Shi Mengfei Peng.

Information Dissemination in Highly Dynamic Graphs Regina O’Dell Roger Wattenhofer.

Routing and Scheduling in Wireless Grid Mesh Networks Abdullah-Al Mahmood Supervisor: Ehab Elmallah Graduate Students’ Workshop on Networks Research Department.

Università degli Studi dell’Aquila Academic Year 2009/2010 Course: Algorithms for Distributed Systems Instructor: Prof. Guido Proietti Time: Monday:

1 Complexity of Network Synchronization Raeda Naamnieh.

© nCode 2000 Title of Presentation goes here - go to Master Slide to edit - Slide 1 Reliable Communication for Highly Mobile Agents ECE 7995: Term Paper.

Network Design Adam Meyerson Carnegie-Mellon University.

Graphs. Graph definitions There are two kinds of graphs: directed graphs (sometimes called digraphs) and undirected graphs Birmingham Rugby London Cambridge.

1 Foundations of Software Design Fall 2002 Marti Hearst Lecture 25: Graph Traversal, DAGs, and Weighted Graphs.

Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings.

1 Brief Announcement: Distributed Broadcasting and Mapping Protocols in Directed Anonymous Networks Michael Langberg: Open University of Israel Moshe Schwartz:

Distributed systems Module 2 -Distributed algorithms Teaching unit 1 – Basic techniques Ernesto Damiani University of Bozen Lesson 4 – Consensus and reliable.

Alyce Brady CS 510: Computer Algorithms Depth-First Graph Traversal Algorithm.

Graphs Chapter 28 Copyright ©2012 by Pearson Education, Inc. All rights reserved.

Complexity of Bellman-Ford Theorem. The message complexity of Bellman-Ford algorithm is exponential. Proof outline. Consider a topology with an even number.

Theory of Computing Lecture 10 MAS 714 Hartmut Klauck.

Distributed Computing 5. Synchronization Shmuel Zaks ©

Written by Wei Shi, Joaquin Garcia-Alfaro, Jean-Pierre Corriveau Mengfei Peng Searching for a Black Hole in Interconnected Networks using Mobile Agents.

Social Network Analysis (1) LING 575 Fei Xia 01/04/2011.

Complexity of Bellman-Ford

The Power of Tokens: Rendezvous and Symmetry Detection for two Mobile Agents in a Ring J. Czyzovicz, Stefan Dobrev, E. Kranakis, D. Krizanc.

04/06/2016Applied Algorithmics - week101 Dynamic vs. Static Networks  Ideally, we would like distributed algorithms to be: dynamic, i.e., be able to.

Collaborative Sampling in Wireless Sensor Networks Minglei Huang Yu Hen Hu 2010 IEEE Global Telecommunications Conference 1.

A correction The definition of knot in page 147 is not correct. The correct definition is: A knot in a directed graph is a subgraph with the property that.

Data Structures & Algorithms Graphs

CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.

Lecture #14 Distributed Algorithms (II) CS492 Special Topics in Computer Science: Distributed Algorithms and Systems.

Data Structures and Algorithms in Parallel Computing Lecture 2.

Graphs A graphs is an abstract representation of a set of objects, called vertices or nodes, where some pairs of the objects are connected by links, called.

Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.

COSC 2007 Data Structures II

An Optimal Certificate Dispersal Algorithm for Mobile Ad Hoc Networks Nagoya Institute of Technology Hua Zheng Shingo Omura Jiro Uchida Koichi Wada.

Graphs Upon completion you will be able to:

Strongly Connected Components for Directed Graphs Kelley Louie Credits: graphs by /demo/graphwin/graphwin.

Mobile Agent Rendezvous Problem in a Ring Roberta Capuano,Vikas Kumar Jha.

Fundamentals of Computer Networks ECE 478/578

Graph Representations And Traversals. Graphs Graph : – Set of Vertices (Nodes) – Set of Edges connecting vertices (u, v) : edge connecting Origin: u Destination:

1 GRAPHS – Definitions A graph G = (V, E) consists of –a set of vertices, V, and –a set of edges, E, where each edge is a pair (v,w) s.t. v,w  V Vertices.

Graph Search Applications, Minimum Spanning Tree

Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder

Sections 8.7 – 8.8 Balancing a Binary Search Tree.

A Distributed Algorithm for Minimum-Weight Spanning Trees

Lecture 9: Asynchronous Network Algorithms

CS 3343: Analysis of Algorithms

Comp 245 Data Structures Graphs.

Concurrent Graph Exploration with Multiple Robots

CS200: Algorithm Analysis

Graphs Part 2 Adjacency Matrix

Lecture 13 CSE 331 Sep 27, 2017.

Lecture 8: Synchronous Network Algorithms

Pan Peng (University of Vienna, Austria)

Minimum Spanning Trees (MSTs)

Lecture 13 CSE 331 Sep 28, 2016.

EMIS 8374 Max-Flow in Undirected Networks Updated 18 March 2008

Presentation transcript:

KLASING, R., MARKOU, E. & RADZIK, T. (2007). HARDNESS AND APPROXIMATION RESULTS FOR BLACK HOLE SEARCH IN ARBITRARY NETWORKS. THEOR. COMPUT. SCI., 384 (2-3), MENGFEI PENG Hardness and Approximation Results for Black Hole Search in Arbitrary Networks

Assumptions Network: giving map; starting node is known to be safe; connected undirected graph. Agent: Two agent; synchronous, communicate only when in the same node(no token or whiteboard)

Basic idea Two agents Each agent explores half of the graph Explore one node then go together exchange information. Not realistic. Question: Compare to token model and whiteboard, what do you think of this idea? Is it a good agent model?

CHALOPIN, J., DAS, S. & SANTORO, N. (2007). RENDEZVOUS OF MOBILE AGENTS IN UNKNOWN GRAPHS WITH FAULTY LINKS. PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING, D33 (15), MENGFEI PENG Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links

Purpose: agent gathering—all survive agents meet at a safe node. Faulty link: an agent which goes into faulty links will disappear. K agents, R faulty links, so no more than k-r agents can rendezvous. Assumptions: Network size is unknown but given an upper bound bidirectional graph, edge-labeled, asynchronous, strongly connected symmetric graph. Agents: identical, dispersed Whiteboard model FIFO: first-in first-out

Algorithm Result: Rendezvous k-r agents in total O(m(m+k)) moves, m is edge number. Use tree to add new nodes. If a node the agent arrives has been visited before, the node becomes an edge.

Algorithm 1, Agents from the same node are in one team; if when an agent wakes up, its homebase already visited by someone else, then the agent just join the team. 2, Agents start to explore the graph(cautious walk), and traversal as many links as it can; 3, The team which explored more than half links in the graph becomes the leader, then all the other agents rendezvous at the leader’s homebase.

Questions What’s the difference between black hole and faulty links? All links lead to one node are faulty, then the node is a black hole. What’s the main idea of the second algorithm? Find a leader team, and gather all survive agents in its homebase.