Routing in Simple Polygons

Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Paul Seiferth; Yannik Stein; Birgit Vogtenhuber; Max Willert

Routing in Simple Polygons

Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, Max Willert

Institute of Software Technology (7160)

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

Abstract

A routing scheme $R$ in a network $G=(V,E)$ is an algorithm that allows to send messages from one node to another in the network. We are first allowed a preprocessing phase in which we assign a unique label to each node $pin V$ and a routing table with additional information. After this preprocessing, the routing algorithm itself must be local (i.e., we can only use the information from the label of the target and the routing table of the node that we are currently at). We present a routing scheme for routing in simple polygons: for any $varepsilon > 0$ the routing scheme provides a stretch of $1+, labels have $O(log n)$ bits, the corresponding routing tables are of size $O(-1log n)$, and the preprocessing time is $O(n^2+-1n)$. This improves the best known strategies for general graphs by Roditty and Tov (Distributed Computing 2016).

Original language	English
Title of host publication	Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG$$2017)
Place of Publication	Malmö, Sweden
Pages	17-20
Number of pages	4
Publication status	Published - 2017
Event	33rd European Workshop on Computational Geometry: EuroCG 2017 - Malmö, Sweden Duration: 5 Apr 2017 → 7 Apr 2017

Conference

Conference	33rd European Workshop on Computational Geometry
Abbreviated title	EuroCG 2017
Country/Territory	Sweden
City	Malmö
Period	5/04/17 → 7/04/17

Cite this

@inproceedings{c2c876ee3336457ebb3c025bea8cdfab,

title = "Routing in Simple Polygons",

abstract = "A routing scheme $R$ in a network $G=(V,E)$ is an algorithm that allows to send messages from one node to another in the network. We are first allowed a preprocessing phase in which we assign a unique label to each node $pin V$ and a routing table with additional information. After this preprocessing, the routing algorithm itself must be local (i.e., we can only use the information from the label of the target and the routing table of the node that we are currently at). We present a routing scheme for routing in simple polygons: for any $varepsilon > 0$ the routing scheme provides a stretch of $1+, labels have $O(log n)$ bits, the corresponding routing tables are of size $O(-1log n)$, and the preprocessing time is $O(n^2+-1n)$. This improves the best known strategies for general graphs by Roditty and Tov (Distributed Computing 2016).",

author = "Matias Korman and Wolfgang Mulzer and Renssen, {Andr{\'e} van} and Marcel Roeloffzen and Paul Seiferth and Yannik Stein and Birgit Vogtenhuber and Max Willert",

year = "2017",

language = "English",

pages = "17--20",

booktitle = "Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG$$2017)",

note = "33rd European Workshop on Computational Geometry : EuroCG 2017, EuroCG 2017 ; Conference date: 05-04-2017 Through 07-04-2017",

}

TY - GEN

T1 - Routing in Simple Polygons

AU - Korman, Matias

AU - Mulzer, Wolfgang

AU - Renssen, André van

AU - Roeloffzen, Marcel

AU - Seiferth, Paul

AU - Stein, Yannik

AU - Vogtenhuber, Birgit

AU - Willert, Max

PY - 2017

Y1 - 2017

N2 - A routing scheme $R$ in a network $G=(V,E)$ is an algorithm that allows to send messages from one node to another in the network. We are first allowed a preprocessing phase in which we assign a unique label to each node $pin V$ and a routing table with additional information. After this preprocessing, the routing algorithm itself must be local (i.e., we can only use the information from the label of the target and the routing table of the node that we are currently at). We present a routing scheme for routing in simple polygons: for any $varepsilon > 0$ the routing scheme provides a stretch of $1+, labels have $O(log n)$ bits, the corresponding routing tables are of size $O(-1log n)$, and the preprocessing time is $O(n^2+-1n)$. This improves the best known strategies for general graphs by Roditty and Tov (Distributed Computing 2016).

AB - A routing scheme $R$ in a network $G=(V,E)$ is an algorithm that allows to send messages from one node to another in the network. We are first allowed a preprocessing phase in which we assign a unique label to each node $pin V$ and a routing table with additional information. After this preprocessing, the routing algorithm itself must be local (i.e., we can only use the information from the label of the target and the routing table of the node that we are currently at). We present a routing scheme for routing in simple polygons: for any $varepsilon > 0$ the routing scheme provides a stretch of $1+, labels have $O(log n)$ bits, the corresponding routing tables are of size $O(-1log n)$, and the preprocessing time is $O(n^2+-1n)$. This improves the best known strategies for general graphs by Roditty and Tov (Distributed Computing 2016).

M3 - Conference paper

SP - 17

EP - 20

BT - Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG$$2017)

CY - Malmö, Sweden

T2 - 33rd European Workshop on Computational Geometry

Y2 - 5 April 2017 through 7 April 2017

ER -