competitive routing on a bounded degree plane spanner
play

Competitive Routing on a Bounded-Degree Plane Spanner Prosenjit - PowerPoint PPT Presentation

Oct 04, 2023 •105 likes •690 views

Competitive Routing on a Bounded-Degree Plane Spanner Prosenjit Bose, Rolf Fagerberg, Andr e van Renssen and Sander Verdonschot Carleton University, University of Southern Denmark August 4, 2012 Sander Verdonschot (Carleton University)

  1. Competitive Routing on a Bounded-Degree Plane Spanner Prosenjit Bose, Rolf Fagerberg, Andr´ e van Renssen and Sander Verdonschot Carleton University, University of Southern Denmark August 4, 2012 Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 1 / 10

  2. Geometric Spanners Given: Goal: Set of points in the plane Approximate the complete Euclidean graph Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 2 / 10

  3. Geometric Spanners Given: Goal: Set of points in the plane Approximate the complete Euclidean graph Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 2 / 10

  4. Geometric Spanners Given: Goal: Set of points in the plane Approximate the complete Euclidean graph shortest path ≤ k · Euclidean distance Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 2 / 10

  5. Competitive Routing Given: Goal: Geometric spanner Find a short path between any two vertices Using only local information path length ≤ r · Euclidean distance Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 3 / 10

  6. Previous Work Half- θ 6 -graph (Bonichon et al. 2010) Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 4 / 10

  7. Previous Work Bounded-degree variants (Bonichon et al. 2010) Half- θ 6 -graph (Bonichon et al. 2010) Competitive routing (Bose et al. 2012) Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 4 / 10

  8. Previous Work Bounded-degree variants (Bonichon et al. 2010) Competitive routing on Half- θ 6 -graph bounded-degree variants (Bonichon et al. 2010) (This result) Competitive routing (Bose et al. 2012) Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 4 / 10

  9. Half- θ 6 -graph 6 Cones around each vertex: 3 positive, 3 negative Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 5 / 10

  10. Half- θ 6 -graph Connect to ‘closest’ vertex in each positive cone Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 5 / 10

  11. Half- θ 6 -graph Connect to ‘closest’ vertex in each positive cone Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 5 / 10

  12. Half- θ 6 -graph Connect to ‘closest’ vertex in each positive cone Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 5 / 10

  13. Bounded Degree Negative cones can have unbounded in-degree. Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 6 / 10

  14. Bounded Degree Negative cones can have unbounded in-degree. Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 6 / 10

  15. Bounded Degree Consecutive vertices are connected by a canonical path . Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 6 / 10

  16. Bounded Degree Keep the edge to the closest vertex... Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 6 / 10

  17. Bounded Degree Keep the edge to the closest vertex and the extreme edges. Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 6 / 10

  18. Bounded Degree Keep the edge to the closest vertex and the extreme edges. Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 6 / 10

  19. Bounded Degree Edges on the canonical path are always extreme. Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 6 / 10

  20. Bounded Degree There is an approximation path for every removed edge. Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 6 / 10

  21. Bounded Degree Result: A 3-spanner of the half- θ 6 -graph. Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 6 / 10

  22. Routing Algorithm If t lies in a positive cone: In the half- θ 6 -graph. Follow the edge in that cone Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 7 / 10

  23. Routing Algorithm If t lies in a positive cone: In the bounded-degree subgraph. Follow the edge in that cone Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 7 / 10

  24. Routing Algorithm If t lies in a positive cone: In the bounded-degree subgraph. Follow the edge in that cone Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 7 / 10

  25. Routing Algorithm If t lies in a positive cone: In the bounded-degree subgraph. Follow the edge in that cone Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 7 / 10

  26. Routing Algorithm If t lies in a positive cone: In the bounded-degree subgraph. Follow the edge in that cone Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 7 / 10

  27. Routing Algorithm If t lies in a positive cone: In the bounded-degree subgraph. Follow the edge in that cone Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 7 / 10

  28. Routing Algorithm If t lies in a positive cone: In the bounded-degree subgraph. Follow the edge in that cone Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 7 / 10

  29. Routing Algorithm If t lies in a positive cone: In the bounded-degree subgraph. Follow the edge in that cone Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 7 / 10

  30. Routing Algorithm If t lies in a negative cone and In the half- θ 6 -graph. we did not mark a side yet: Follow an edge in that cone Follow an edge to the shorter side Follow an edge to the longer side and mark the shorter side Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 8 / 10

  31. Routing Algorithm If t lies in a negative cone and In the half- θ 6 -graph. we did not mark a side yet: Follow an edge in that cone Follow an edge to the shorter side Follow an edge to the longer side and mark the shorter side Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 8 / 10

  32. Routing Algorithm If t lies in a negative cone and In the half- θ 6 -graph. we did not mark a side yet: Follow an edge in that cone Follow an edge to the shorter side Follow an edge to the longer side and mark the shorter side Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 8 / 10

  33. Routing Algorithm If t lies in a negative cone and In the half- θ 6 -graph. we did not mark a side yet: Follow an edge in that cone Follow an edge to the shorter side Follow an edge to the longer side and mark the shorter side Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 8 / 10

  34. Routing Algorithm If t lies in a negative cone and In the half- θ 6 -graph. we did not mark a side yet: Follow an edge in that cone Follow an edge to the shorter side Follow an edge to the longer side and mark the shorter side Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 8 / 10

  35. Routing Algorithm If t lies in a negative cone and In the bounded-degree subgraph. we did not mark a side yet: Follow an edge in that cone Follow an edge to the shorter side Follow an edge to the longer side and mark the shorter side Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 8 / 10

  36. Routing Algorithm If t lies in a negative cone and In the bounded-degree subgraph. we did not mark a side yet: Follow an edge in that cone Follow an edge to the shorter side Follow an edge to the longer side and mark the shorter side Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 8 / 10

  37. Routing Algorithm If t lies in a negative cone and In the bounded-degree subgraph. we did not mark a side yet: Follow an edge in that cone Follow an edge to the shorter side Follow an edge to the longer side and mark the shorter side Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 8 / 10

  38. Routing Algorithm If t lies in a negative cone and In the bounded-degree subgraph. we did not mark a side yet: Follow an edge in that cone Follow an edge to the shorter side Follow an edge to the longer side and mark the shorter side Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 8 / 10

  39. Routing Algorithm If t lies in a negative cone and In the bounded-degree subgraph. we did not mark a side yet: Follow an edge in that cone Follow an edge to the shorter side Follow an edge to the longer side and mark the shorter side Sander Verdonschot (Carleton University) Competitive Bounded-Degree Routing August 4, 2012 8 / 10

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Bounded Radius Routing Perform bounded PRIM algorithm Under = 0, = 0.5, and =

Bounded Radius Routing Perform bounded PRIM algorithm Under = 0, = 0.5, and =

Bounded Radius Routing Perform bounded PRIM algorithm Under = 0, = 0.5, and = Compare radius and wirelength Radius = 12 for this net Practical Problems in VLSI Physical Design Bounded Radius Routing (1/16) BPRIM Under

542 views • 16 slides
On Plane Constrained Bounded-Degree Spanners Prosenjit Bose, Rolf Fagerberg, Andr e van Renssen

On Plane Constrained Bounded-Degree Spanners Prosenjit Bose, Rolf Fagerberg, Andr e van Renssen

On Plane Constrained Bounded-Degree Spanners Prosenjit Bose, Rolf Fagerberg, Andr e van Renssen and Sander Verdonschot Carleton University, University of Southern Denmark April 15, 2012 Sander Verdonschot (Carleton University) Constrained

1.17k views • 48 slides
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree Steven

Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree Steven

Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree Steven Chaplick 1 , Ji Fiala 1 , Pim van t Hof 2 , r el Paulusma 3 , Marek Tesa r 1 Dani 1 Charles University, Czech Republic 2 University of

177 views • 17 slides
A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron

A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron

A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite or far from being bipartite.

562 views • 26 slides
Bounded Degree Spanning Tree using Iterative Relaxation Barna Saha March 11, 2015 Bounded

Bounded Degree Spanning Tree using Iterative Relaxation Barna Saha March 11, 2015 Bounded

Bounded Degree Spanning Tree using Iterative Relaxation Barna Saha March 11, 2015 Bounded Degree Spanning Tree Iterative Minimum Spanning Tree Algorithm Iterative Algorithm for Degree Bounded Spanning Tree Primal Dual Methods for Algorithm

873 views • 45 slides
On the Role of Routing in NDN Be ichua n Z ha ng T he U nive rsit y Of Arizona Control Plan

On the Role of Routing in NDN Be ichua n Z ha ng T he U nive rsit y Of Arizona Control Plan

On the Role of Routing in NDN Be ichua n Z ha ng T he U nive rsit y Of Arizona Control Plan and Data Plane Routing Routing RIB Protocol Updates Control Plane Data Table FIB Traffic Lookup Data Plane 1 IP Accept

375 views • 10 slides
Network Layer: Control Plane Part II Routing in the Internet: Intra vs. Inter-AS Routing

Network Layer: Control Plane Part II Routing in the Internet: Intra vs. Inter-AS Routing

Network Layer: Control Plane Part II Routing in the Internet: Intra vs. Inter-AS Routing Intra-AS: RIP and OSPF (quick recap) Inter-AS: BGP and Policy Routing Internet Control Message Protocol: ICMP network management

888 views • 61 slides
1 Background | Problems | Challenges | Design | Evaluation | Summary Control Plane Applications

1 Background | Problems | Challenges | Design | Evaluation | Summary Control Plane Applications

SPEED Resource-Ef+icient and High-Performance Deployment for Data Plane Programs Xiang Chen , Hongyan Liu, Qun Huang, Peiqiao Wang, Dong Zhang, Haifeng Zhou, Chunming Wu Control Plane Applications Monitor Security Routing Data Plane

826 views • 45 slides
Dependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and

Dependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and

Dependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and Branch-and-Bound Caio Corro, Joseph Le Roux, Mathieu Lacroix, Antoine Rozenknop and Roberto Wolfler-Calvo August 7-12 Universit Paris 13 LIPN

774 views • 53 slides
Building Spanner Better clocks stronger semantics Alex Lloyd Senior Staff Software Engineer

Building Spanner Better clocks stronger semantics Alex Lloyd Senior Staff Software Engineer

Building Spanner Better clocks stronger semantics Alex Lloyd Senior Staff Software Engineer How to build a planet-scale serializable database Build clocks with bounded absolute error, and integrate them with timestamp assignment:

722 views • 34 slides
Beating the random assignment for constraint satisfaction problems of bounded degree Prasad

Beating the random assignment for constraint satisfaction problems of bounded degree Prasad

Beating the random assignment for constraint satisfaction problems of bounded degree Prasad Raghavendra David Steurer Ankur Moitra Boaz Barak Ryan ODonnell University of California, Cornell University Massachusetts Institute of

914 views • 90 slides
Elliptic curves Bjorn Poonen MIT Arnold Ross Lecture May 31, 2019 Plane curves Degree 1

Elliptic curves Bjorn Poonen MIT Arnold Ross Lecture May 31, 2019 Plane curves Degree 1

Elliptic curves Bjorn Poonen MIT Arnold Ross Lecture May 31, 2019 Plane curves Degree 1 (lines) 3 x + 7 y + 6 = 0 Degree 2 (conics) 2 x 2 + 9 xy + 3 y 2 3 x + 7 y + 6 = 0 Degree 3 (cubic curves) 4 x 3 + 5 x 2 y + xy 2 + 8 y 3 2 x 2 + 9 xy

1.3k views • 99 slides
Lattice Simplices of Bounded Degree Einstein Workshop on Lattice Polytopes 2016 Johannes

Lattice Simplices of Bounded Degree Einstein Workshop on Lattice Polytopes 2016 Johannes

Lattice Simplices of Bounded Degree Einstein Workshop on Lattice Polytopes 2016 Johannes Hofscheier Otto-von-Guericke-Universit at Magdeburg joint with Akihiro Higashitani Tuesday 13 December 2016 Motivation LLS LSD Deg. 2 Appl. Basic

784 views • 77 slides
Spanner : Google's Globally-Distributed Database James Sedgwick and Kayhan Dursun Spanner - A

Spanner : Google's Globally-Distributed Database James Sedgwick and Kayhan Dursun Spanner - A

Spanner : Google's Globally-Distributed Database James Sedgwick and Kayhan Dursun Spanner - A multi-version, globally-distributed, synchronously-replicated database - First system to - Distribute data globally - Externally-consistent

619 views • 29 slides
Geometric Spanner Networks Spanner Networks M. Farshi Course Outline Mohammad Farshi Textbook

Geometric Spanner Networks Spanner Networks M. Farshi Course Outline Mohammad Farshi Textbook

Geometric Geometric Spanner Networks Spanner Networks M. Farshi Course Outline Mohammad Farshi Textbook Introduction Combinatorial and Geometric ALGorithms (CGALG) Lab., Algorithms Review Department of Computer Science, Greedy Algorithm

1.53k views • 103 slides
POLYTOPES IN THE 0/1-CUBE WITH BOUNDED CHV ATAL-GOMORY RANK Yohann Benchetrit, Samuel Fiorini,

POLYTOPES IN THE 0/1-CUBE WITH BOUNDED CHV ATAL-GOMORY RANK Yohann Benchetrit, Samuel Fiorini,

POLYTOPES IN THE 0/1-CUBE WITH BOUNDED CHV ATAL-GOMORY RANK Yohann Benchetrit, Samuel Fiorini, Tony Huynh Universit e Libre de Bruxelles Stefan Weltge ETH Z urich CUTTING-PLANE PROOFS AND CHV ATAL-GOMORY CLOSURES Cutting-plane

414 views • 22 slides
How do we remove aliasing ? Anti-Aliasing Techniques Cheaper solution : take multiple samples

How do we remove aliasing ? Anti-Aliasing Techniques Cheaper solution : take multiple samples

How do we remove aliasing ? Anti-Aliasing Techniques Cheaper solution : take multiple samples for each pixel and average them together supersampling. Can weight them towards the centre weighted average sampling Stochastic

626 views • 10 slides
Characterizations of symmetric cones by means of the basic relative invariants Hideto Nakashima

Characterizations of symmetric cones by means of the basic relative invariants Hideto Nakashima

Characterizations of symmetric cones by means of the basic relative invariants Hideto Nakashima Kyushu University 2015/6/24 RIMS, Kyoto university Hideto Nakashima (Kyushu Univ.) Characterizations of symmetric cones 2015/6/24 1 / 23

526 views • 23 slides
Convexity and Polyhedra Carlo Mannino (from Geir Dahl notes on convexity) University of Oslo,

Convexity and Polyhedra Carlo Mannino (from Geir Dahl notes on convexity) University of Oslo,

Convexity and Polyhedra Carlo Mannino (from Geir Dahl notes on convexity) University of Oslo, INF-MAT5360 - Autumn 2011 (Mathematical optimization) Convex Sets Set C R n is convex if (1- ) x 1 + x 2 C whenever x 1 , x 2 C 0

296 views • 27 slides
Tangent cones of K ahler-Einstein metrics Hans-Joachim Hein UMd College Park & Fordham

Tangent cones of K ahler-Einstein metrics Hans-Joachim Hein UMd College Park & Fordham

Tangent cones of K ahler-Einstein metrics Hans-Joachim Hein UMd College Park & Fordham University joint work with Song Sun Stony Brook University July 13, 2016 Calabi-Yau Theorem: Let X be a compact K ahler manifold of complex

392 views • 35 slides
Lectures on Lorentzian causality ESI-EMS-IAMP Summer School on Mathematical Relativity Gregory J.

Lectures on Lorentzian causality ESI-EMS-IAMP Summer School on Mathematical Relativity Gregory J.

Lectures on Lorentzian causality ESI-EMS-IAMP Summer School on Mathematical Relativity Gregory J. Galloway Department of Mathematics University of Miami August 4, 2014 Contents 1 Lorentzian manifolds 4 2 Futures and pasts 17 3 Achronal

831 views • 66 slides
Living on the Edge Phase Transitions in Convex Programs with Random Data Joel A. Tropp

Living on the Edge Phase Transitions in Convex Programs with Random Data Joel A. Tropp

Living on the Edge Phase Transitions in Convex Programs with Random Data Joel A. Tropp Michael B. McCoy Computing + Mathematical Sciences California Institute of Technology Joint with Dennis Amelunxen and Martin Lotz (Manchester)

494 views • 36 slides
Payload Integration What is a payload A payload can be anything from a small electronics box to

Payload Integration What is a payload A payload can be anything from a small electronics box to

Payload Integration What is a payload A payload can be anything from a small electronics box to a satellite. Payloads include satellites of all sizes, cameras, scientific instruments, communications equipment, sensors, and others. Payload

398 views • 15 slides
Challenges in Inferring Spoofed Traffic at IXPs Matthew Luckie Bradley Huffaker Lucas Mller

Challenges in Inferring Spoofed Traffic at IXPs Matthew Luckie Bradley Huffaker Lucas Mller

Challenges in Inferring Spoofed Traffic at IXPs Matthew Luckie Bradley Huffaker Lucas Mller University of Waikato CAIDA/UC San Diego UFRGS/CAIDA Kc Claffy Marinho Barcellos CAIDA/UC San Diego UFRGS/University of Waikato ACM CoNEXT

1.05k views • 82 slides

More recommend