Improved Sparse Covers for Graphs Excluding a Fixed Minor Ryan LaFortune (RPI), Costas Busch (LSU), and Srikanta Tirthapura (ISU)

Slides:



Advertisements
Similar presentations
Costas Busch Louisiana State University CCW08. Becomes an issue when designing algorithms The output of the algorithms may affect the energy efficiency.
Advertisements

Distance and Routing Labeling Schemes in Graphs
Competitive fault tolerant Distance Oracles and Routing Schemes Weizmann Open U Weizmann Bar Ilan Shiri Chechik Michael Langberg David Peleg Liam Roditty.
TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs Chenyu Yan, Yang Xiang, and Feodor F. Dragan (WADS 2009) Kent State University, Kent,
Beyond Trilateration: On the Localizability of Wireless Ad Hoc Networks Reported by: 莫斌.
Does Topology Control Reduce Interference? Martin Burkhart Pascal von Rickenbach Roger Wattenhofer Aaron Zollinger.
Information Dissemination in Highly Dynamic Graphs Regina O’Dell Roger Wattenhofer.
Ad-Hoc Networks Beyond Unit Disk Graphs
XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
Routing, Anycast, and Multicast for Mesh and Sensor Networks Roland Flury Roger Wattenhofer RAM Distributed Computing Group.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 21st Lecture Christian Schindelhauer.
A Robust Interference Model for Wireless Ad-Hoc Networks Pascal von Rickenbach Stefan Schmid Roger Wattenhofer Aaron Zollinger.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
A Unified Energy Efficient Topology for Unicast and Broadcast Xiang-Yang Li*, Wen-Zhang Song † and WeiZhao Wang* *Illinois Institute of Technology † Washington.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
A Constant Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar Anupam Gupta Tim Roughgarden Bell Labs CMU Cornell joint.
CS728 Lecture 17 Web Indexes III. Last Time Showed how build indexes for graph connectivity Based on 2-hop covers Today Look at more general problem of.
Geometric Spanners for Routing in Mobile Networks Jie Gao, Leonidas Guibas, John Hershberger, Li Zhang, An Zhu.
Dynamic Hypercube Topology Stefan Schmid URAW 2005 Upper Rhine Algorithms Workshop University of Tübingen, Germany.
Traveling with a Pez Dispenser (Or, Routing Issues in MPLS) Anupam Gupta Amit Kumar FOCS 2001 Rajeev Rastogi Iris Reinbacher COMP670P
Compact Routing Schemes Mikkel Thorup Uri Zwick AT&T Labs – Research Tel Aviv University.
Augmenting Paths, Witnesses and Improved Approximations for Bounded Degree MSTs K. Chaudhuri, S. Rao, S. Riesenfeld, K. Talwar UC Berkeley.
Collective Additive Tree Spanners of Homogeneously Orderable Graphs
Dept. of Computer Science Distributed Computing Group Asymptotically Optimal Mobile Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.
Collective Tree Spanners of Graphs with Bounded Parameters F.F. Dragan and C. Yan Kent State University, USA.
Collective Tree Spanners of Graphs F.F. Dragan, C. Yan, I. Lomonosov Kent State University, USA Hiram College, USA.
Collective Tree Spanners and Routing in AT-free Related Graphs F.F. Dragan, C. Yan, D. Corneil Kent State University University of Toronto.
1 Analysis of Link Reversal Routing Algorithms Srikanta Tirthapura (Iowa State University) and Costas Busch (Renssaeler Polytechnic Institute)
Greedy Routing with Bounded Stretch Roland Flury, Roger Wattenhofer (ETH Zurich), Sriram Pemmaraju (Iowa University) Published at IEEE Infocom 2009 Introduction.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
Scalability of Routing: Compactness and Dynamics Dmitri Krioukov (CAIDA) Kevin Fall (Intel Research) and kc claffy (CAIDA) IETF-67.
Distributed Algorithms on a Congested Clique Christoph Lenzen.
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
GRAPH SPANNERS by S.Nithya. Spanner Definition- Informal A geometric spanner network for a set of points is a graph G in which each pair of vertices is.
Expanders via Random Spanning Trees R 許榮財 R 黃佳婷 R 黃怡嘉.
1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi.
1 Optimal Oblivious Routing in Hole-Free Networks Costas Busch Louisiana State University Malik Magdon-Ismail Rensselaer Polytechnic Institute.
1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi.
Analysis of Link Reversal Routing Algorithms for Mobile Ad Hoc Networks Costas Busch (RPI) Srikanth Surapaneni (RPI) Srikanta Tirthapura (Iowa State University)
Separability and Topology Control of Quasi Unit Disk Graphs Philippe Giabbanelli CMPT 880 – Spring 2008.
Fault Tolerant Graph Structures Merav Parter ADGA 2015.
Role of Rigid Components in Protein Structure Pramod Abraham Kurian.
Retrieval-Guaranteed Location-Aware Information Brokerage Scheme in 3D Wireless Ad Hoc Networks.
Approximating the k Steiner Forest and Capacitated non preemptive dial a ride problems, with almost uniform weights Guy Kortsarz Joint work with Dinitz.
A light metric spanner Lee-Ad Gottlieb. Graph spanners A spanner for graph G is a subgraph H ◦ H contains vertices, subset of edges of G Some qualities.
Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. Fast.
1 Concurrent Counting is harder than Queuing Costas Busch Rensselaer Polytechnic Intitute Srikanta Tirthapura Iowa State University.
TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
Introduction Wireless Ad-Hoc Network  Set of transceivers communicating by radio.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
1 HEINZ NIXDORF INSTITUTE University of Paderborn Algorithms and Complexity Christian Schindelhauer Algorithms for Radio Networks Winter Term 2005/2006.
Succinct Routing Tables for Planar Graphs Compact Routing for Graphs Excluding a Fixed Minor Ittai Abraham (Hebrew Univ. of Jerusalem) Cyril Gavoille (LaBRI,
Does Topology Control Reduce Interference?
Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension
Efficient methods for finding low-stretch spanning trees
Know thy Neighbor’s Neighbor Better Routing for Skip Graphs and Small Worlds Moni Naor Udi Wieder.
Analysis of Link Reversal Routing Algorithms
Greedy Routing with Bounded Stretch
MST in Log-Star Rounds of Congested Clique
Research: algorithmic solutions for networking
Introduction Wireless Ad-Hoc Network
Compact Routing Schemes
Compact routing schemes with improved stretch
Distance-preserving Subgraphs of Interval Graphs
Routing in Networks with Low Doubling Dimension
Forbidden-set labelling in graphs
Presentation transcript:

Improved Sparse Covers for Graphs Excluding a Fixed Minor Ryan LaFortune (RPI), Costas Busch (LSU), and Srikanta Tirthapura (ISU)

Sparse Covers Distributed systems represented by graphs Fundamental data structure Numerous Applications – Name-independent compact routing schemes – Directories for mobile objects – Synchronizers

Definitions A cover is a collection of connected sets called clusters, where every node belongs to some cluster containing its entire k- neighborhood Locality parameter Radius and degree (latency and load) Sparse cover

Extreme Cases Large radius, small degree – G is one cluster Small radius, large degree – Every node forms a cluster

Sparse Cover for Arbitrary Graphs Impossible to achieve optimality in both metrics [Peleg: 2000] – Radius O(k) and degree O(1) Best known algorithm [Awerbuch and Peleg: FOCS 1990] – Radius O(k log n) and degree O(log n) – Based on coarsening Special graphs?

Contributions Improved algorithm for H-minor free graphs – Radius ≤ 4k and degree O(log n) Improved algorithm for planar graphs – Radius ≤ 24k - 8 and degree ≤ 18

Outline of Talk Consequences Related Work Shortest-Path Clustering P-Path Separable Algorithm Planar Algorithm Conclusions

Name-Independent Compact Routing Schemes Deliver a message given the ID of the destination node Cannot alter IDs Tradeoff between stretch and memory overhead General algorithm [Awerbuch and Peleg: FOCS 1990] – Stretch = O(log n) and memory = O(log 2 n) bits per node Planar algorithm – Stretch = O(1) and memory = O(log 2 n) bits per node H-minor free algorithm – Stretch = O(1) and memory = O(log 3 n) bits per node

Directories for Mobile Objects Given an object’s name, returns its location Wireless sensor networks, cellular phone networks Tradeoff between Stretch find and Stretch move General algorithm [Awerbuch and Peleg: JACM 1995] – Stretch find = O(log 2 n) and Stretch move = O(log 2 n) Planar algorithm – Stretch find = O(1) and Stretch move = O(log n) H-minor free algorithm – Stretch find = O(log n) and Stretch move = O(log n)

Synchronizers Distributed programs that allow the execution of synchronous algorithms in asynchronous systems Logical rounds simulate time rounds Tradeoff between time steps and average messages per node ZETA [Shabtay and Segall: WDAG 1994] – Time steps = O(log z n) and messages = O(z) per node Planar algorithm – Time steps = O(1) and messages = O(1) per node H-minor free algorithm – Time steps = O(1) and messages = O(log n) per node

Related Work Algorithm for graphs excluding K r,r – Diameter = 4(r + 1) 2 k and degree = O(1) [Abraham et al.: SPAA 2007] Algorithm for H-minor free graphs – Weak diameter = O(k) and degree = O(1) [Klein et al.: STOC 1993] Algorithm for graphs with doubling dimension a – Radius = O(k) and degree = 4 a [Abraham et al.: ICDCS 2006]

Shortest-Path Clustering If called with 2k, the path can be removed All nodes are satisfied, radius ≤ 4k, and deg ≤ 3

H-Minor Free Definitions The contraction of edge e = (u, v) is the replacement of u and v by a single vertex A minor of G (subgraph after contractions) H-minor free – Trees, exclude K 3 – Outerplanar graphs, exclude K 4 and K 2,3 – Series-parallel graphs, exclude K 4 – Planar graphs, exclude K 5 and K 3,3

P-Path Separable Algorithm Path Separator (shortest paths, components have at most n/2 nodes) Every H-minor free graph is P-path separable – P depends on the size of H – [Abraham, Gavoille: PODC 2006] Recursively cluster path separators

Initial graph, suppose k=1

Choose a path separator

Break the path separator up into sub-paths of length 2k = 2

Cluster 2k = 2 around the first sub-path

Radius = O(k) and degree ≤ 3

≤ n/2 nodes

Continue Recursively (terminates in a logarithmic number of steps)

Analysis Only satisfied nodes are removed, thus all nodes are satisfied Shortest-Path Cluster was always called with 2k, so clearly the radius is O(k) Degree is O(log n) due to the logarithmic number of steps

Planar Definitions The external face of a graph consists of the nodes and edges that surround it The depth of a node is the minimum distance to an external node

Planar Algorithm If depth(G) ≤ k, we only need to 2k-satisfy the external nodes to satisfy all of G Suppose that this is the case

2k 4k Step 1: Take a shortest path (initially a single node) Step 2: 4k-satisfy it Step 3: Remove the 2k-neighborhood

Continue recursively…

4k-satisfy the path Remove the 2k-neighborhood Discard A, and continue 4k 2k A

And so on … …

Analysis All nodes are satisfied because all external nodes are 2k-satisfied Shortest-Path Cluster was always called with 4k, so clearly the radius is O(k) Nodes are removed upon first or second clustering, so degree ≤ 6

If depth(G) > k Satisfy one zone S i = G(W i-1 U W i U W i+1 ) at a time Adjust for intra-band overlaps… W i- 1 WiWi W i+1 SiSi

Final Analysis We can now cluster an entire planar graph Radius increased due to the depth of the zones, but is still O(k) Overlaps between bands increase the degree by a factor of 3, degree ≤ 18

Conclusion We have significantly improved sparse cover construction techniques – H-minor free graphs – Planar graphs We can also construct optimal sparse covers for graphs with constant stretch spanners (unit disk graphs) Name-independent compact routing schemes, directories for mobile objects, and synchronizers