Luoyi Fu, Xinbing Wang, P. R. Kumar

Slides:



Advertisements
Similar presentations
Routing Complexity of Faulty Networks Omer Angel Itai Benjamini Eran Ofek Udi Wieder The Weizmann Institute of Science.
Advertisements

Fundamental Relationship between Node Density and Delay in Wireless Ad Hoc Networks with Unreliable Links Shizhen Zhao, Luoyi Fu, Xinbing Wang Department.
Manipulation Planning. In 1995 Alami, Laumond and T. Simeon proposed to solve the problem by building and searching a ‘manipulation graph’.
Breadth-First Search Seminar – Networking Algorithms CS and EE Dept. Lulea University of Technology 27 Jan Mohammad Reza Akhavan.
Hierarchical Decompositions for Congestion Minimization in Networks Harald Räcke 1.
1 Internet Networking Spring 2006 Tutorial 6 Network Cost of Minimum Spanning Tree.
1 Parallel Algorithms III Topics: graph and sort algorithms.
1 Internet Networking Spring 2004 Tutorial 6 Network Cost of Minimum Spanning Tree.
The Shortest Path Problem
Critical Transmission Range for Mobile Clustered Wireless Networks Qi Wang, Liang Liu, Xinbing Wang Department of Electronic Engineering Shanghai Jiao.
Fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks Yuanzhong Xu, Xinbing Wang Shanghai Jiao Tong University, China.
Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang
Survivable Logical Topology Design in WDM Optical Ring Networks Hwajung Lee, Hongsik Choi, Suresh Subramaniam, and Hyeong-Ah Choi* The George Washington.
Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.
Function Computation over Heterogeneous Wireless Sensor Networks Xuanyu Cao, Xinbing Wang, Songwu Lu Department of Electronic Engineering Shanghai Jiao.
Delay-Throughput Tradeoff with Correlated Mobility in Ad-Hoc Networks Shuochao Yao*, Xinbing Wang*, Xiaohua Tian* ‡, Qian Zhang † *Department of Electronic.
1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi.
Scaling Laws for Cognitive Radio Network with Heterogeneous Mobile Secondary Users Yingzhe Li, Xinbing Wang, Xiaohua Tian Department of Electronic Engineering.
Lesson 2 How do electric circuits work?. Electric Circuits You know that electric circuits only work when the circuit is closed. OPEN.
On the Topology of Wireless Sensor Networks Sen Yang, Xinbing Wang, Luoyi Fu Department of Electronic Engineering, Shanghai Jiao Tong University, China.
Topics Paths and Circuits (11.2) A B C D E F G.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 15 Graph Theory.
Graphs. Introduction Graphs are a collection of vertices and edges Graphs are a collection of vertices and edges The solid circles are the vertices A,
Graph Theory. undirected graph node: a, b, c, d, e, f edge: (a, b), (a, c), (b, c), (b, e), (c, d), (c, f), (d, e), (d, f), (e, f) subgraph.
Fundamentals of Computer Networks ECE 478/578
Introduction to Multiple-multicast Routing Chu-Fu Wang.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 3: Search, A*
Cooperative Spectrum-Aware Opportunistic Routing in Cognitive Radio Ad Hoc Networks Cuimei Cui* †, Hong Man †, Yiming Wang* *School of Electronics and.
Biao Wang 1, Ge Chen 1, Luoyi Fu 1, Li Song 1, Xinbing Wang 1, Xue Liu 2 1 Shanghai Jiao Tong University 2 McGill University
Midwestern State University Minimum Spanning Trees Definition of MST Generic MST algorithm Kruskal's algorithm Prim's algorithm 1.
Optimal Determination of Source-destination Connectivity in Random Graphs Luoyi Fu, Xinbing Wang, P. R. Kumar Dept. of Electronic Engineering Shanghai.
Graphs – Breadth First Search
EE327 Final Representation Qianyang Peng F
Data Structures and Algorithms
1Carnegie Mellon University
Data Center Network Architectures
Graphs: Definitions and Basic Properties
Topics In Social Computing (67810)
Analysis of Algorithms
Spanning Trees.
Deadlock-free Packet Switching
CS4234 Optimiz(s)ation Algorithms
Community detection in graphs
CS 3343: Analysis of Algorithms
Basic Electrical Circuits
Unweighted Shortest Path Neil Tang 3/11/2010
Algorithms for Exploration
Peer-to-Peer and Social Networks
Graph Theory.
Lecture 16 Maximum Matching
Centralities (4) Ralucca Gera,
3.5 Minimum Cuts in Undirected Graphs
Performance Comparison of Tarry and Awerbuch Algorithms
Hannah Tang and Brian Tjaden Summer Quarter 2002
Md. Abul Kashem, Chowdhury Sharif Hasan, and Anupam Bhattacharjee
Problem Solving 4.
SPQR Tree.
Algorithms Lecture # 29 Dr. Sohail Aslam.
Mathematics for Computer Science MIT 6.042J/18.062J
Trevor Brown DC 2338, Office hour M3-4pm
Graphs.
COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan.
Circuits.
Circuits _____________ ______________
Basic Electrical Circuits
Robotics meet Computer Science
Constructing a m-connected k-Dominating Set in Unit Disc Graphs
Planting trees in random graphs (and finding them back)
For Friday Read chapter 9, sections 2-3 No homework
Presentation transcript:

Luoyi Fu, Xinbing Wang, P. R. Kumar Optimal Determination of Source-destination Connectivity in Random Graphs Luoyi Fu, Xinbing Wang, P. R. Kumar Dept. of Electronic Engineering Shanghai Jiao Tong University Dept. of Electrical & Computer Engineering Texas A&M University

Random Graph: G(n,p) Model N nodes Each edge exists with probability p Proposed by Gilbert in 1959 It can also be called ER graph 2/18

Are S and D Connected? Goal: Determine whether S and D are connected or not As quickly as possible i.e., by testing the fewest expected number of edges 3/18

2 3 6 4 5 1 Determined S-D connectivity in 6 number of edges By finding a path 2 3 6 4 5 1 edges tested 4/18

Determined S-D disconnectivity in 10 number of edges By finding a cut 10 2 9 7 3 6 4 8 5 1 edges tested 5/18

Sometimes, S and D may be connected. Sometimes, S and D may be disconnected. Termination time may be random. We want to determine whether S and D are connected or not By either finding a Path or a Cut By testing the fewest number of edges Quickest discovery of an S-D route has not been studied before. Finding a shortest path is not the goal here. Finding the shortest path is a well studied problem. 6/18

The Optimal Policy: A Five-node Example Test the direct edge between S and D Test a potential edge between S and a randomly chosen node Contract S and the node into a component if an edge exists between them Test the direct edge between CS and D 2 potential edges between nodes and D 3 potential edges between nodes and CS Test an edge between D and a randomly chosen node 2 potential edges between node 2 and CS 1 potential edges between node 3 and CS Test the edge between node 2 and D Similar rules in general CS S D CD 1 2 3 7/18

The Optimal Policy: General Case Rule 1: Test if edge exists between CS and CD. Policy terminates if the edge exists. Rule 2: List all the paths connecting CS to CD with the minimum number of potential edges. Not CS-C1-C2-CD But CS-C1-CD Find Set M that contains the minimum potential Cut between CS and CD. Rule 3: Sharpen Rule 2 by specifying which particular edge in M should be tested. Test any edges in M connecting CS to C1. CS CD C1 C2 ……. M Cr 8/18

Proof of Rule 1: Test If the Direct Edge Exists Testing the direct edge at the first step is better than testing at the second step. S D S D S D S D terminate S D S D S D terminate Terminate one step earlier! S D S D S D Same probability Induction on the number of edges tested before the direct edge is tested 9/18

Proof of Rule 3 S D 1 2 … … r Testing CS-C1 edge is better than testing CS-C2 edge. S D C1 C2 10/18

Proof of Rule 3 S D Take the graph on the right as example. 1 1 3 1 2 Two policies: S D S D S D S D C1 C1 C1 C1 C2 C2 C2 C2 Induction on the number of potential edges in the graph. 11/18

Proof of Rule 3 Stochastically couple edges under Agood and Abad. S D 1 Terminates earlier! 2 S D 1 2 12/18

Proof of Rule 2 Testing CS -C1 edge is better than testing C1-CD edge. Stochastic coupling argument Induction on the number of potential edges in the graph S D C1 In the set M 13/18

Proof of Rule 2 One step earlier! 14/18

Phase Transition 1000 nodes P~0: 999 edges from S P~1: 1 edge to D Phase transition: take a long time (around 15000 steps) to test Our policy is optimal for all p! 15/18

Extension to Slightly More General Graphs Series graphs Parallel graphs SP graphs PS graphs Series of parallel of series (SPS) graphs Parallel of series of parallel (PSP) graphs 16/18

Concluding Remarks Whether ER are connected graphs is very well studied topic. Quickly testing connectivity is not. (Surprisingly) We provide the optimal testing algorithm. Optimal for all p. 17/18

Thank you ! 18/18