Routing in Histograms

02/18/2019
by   Man-Kwun Chiu, et al.
0

Let P be an x-monotone orthogonal polygon with n vertices. We call P a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizontal chord from the left boundary to the right boundary. Two points p and q in P are co-visible if and only if the (axis-parallel) rectangle spanned by p and q completely lies in P. In the r-visibility graph G(P) of P, we connect two vertices of P with an edge if and only if they are co-visible. We consider routing with preprocessing in G(P). We may preprocess P to obtain a label and a routing table for each vertex of P. Then, we must be able to route a packet between any two vertices s and t of P, where each step may use only the label of the target node t, the routing table and neighborhood of the current node, and the packet header. We present a routing scheme for double histograms that sends any data packet along a path whose length is at most twice the (unweighted) shortest path distance between the endpoints. In our scheme, the labels, routing tables, and headers need O( n) bits. For the case of simple histograms, we obtain a routing scheme with optimal routing paths, O( n)-bit labels, one-bit routing tables, and no headers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/25/2020

Routing in Unit Disk Graphs without Dynamic Headers

Let V⊂ℝ^2 be a set of n sites in the plane. The unit disk graph DG(V) of...
research
12/03/2020

Multi-Path Routing on the Jellyfish Networks

The Jellyfish network has recently be proposed as an alternate to the fa...
research
01/08/2020

XOR-based Source Routing

We introduce a XOR-based source routing (XSR) scheme as a novel approach...
research
10/02/2021

Optimized Graph Based Routing Algorithm for the Angara Interconnect

JSC NICEVT has developed the Angara high-speed interconnect with 4D toru...
research
01/17/2018

Packet Routing in 3D Nanonetworks: A Lightweight, Linear-path Scheme

Packet routing in nanonetworks requires novel approaches, which can cope...
research
03/14/2020

Shorter Labels for Routing in Trees

A routing labeling scheme assigns a binary string, called a label, to ea...
research
05/04/2023

Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs

We consider the problem of computing compact routing tables for a (weigh...

Please sign up or login with your details

Forgot password? Click here to reset