Routing with guaranteed delivery on virtual coordinates

Mirela Ben-Chen; Craig Gotsman; Steven J. Gortler

Routing with guaranteed delivery on virtual coordinates

Mirela Ben-Chen, Craig Gotsman, Steven J. Gortler

Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work also for non-triangular graphs, and their virtual coordinates are easy to construct.

Original language	English (US)
State	Published - Jan 1 2006
Event	18th Annual Canadian Conference on Computational Geometry, CCCG 2006 - Kingston, Canada Duration: Aug 14 2006 → Aug 16 2006

Conference

Conference	18th Annual Canadian Conference on Computational Geometry, CCCG 2006
Country/Territory	Canada
City	Kingston
Period	8/14/06 → 8/16/06

All Science Journal Classification (ASJC) codes

Geometry and Topology
Computational Mathematics

Cite this

@conference{75f3973375934eba9c0bec53485a13ff,

title = "Routing with guaranteed delivery on virtual coordinates",

abstract = "We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work also for non-triangular graphs, and their virtual coordinates are easy to construct.",

author = "Mirela Ben-Chen and Craig Gotsman and Gortler, {Steven J.}",

year = "2006",

month = jan,

day = "1",

language = "English (US)",

note = "18th Annual Canadian Conference on Computational Geometry, CCCG 2006 ; Conference date: 14-08-2006 Through 16-08-2006",

}

TY - CONF

T1 - Routing with guaranteed delivery on virtual coordinates

AU - Ben-Chen, Mirela

AU - Gotsman, Craig

AU - Gortler, Steven J.

PY - 2006/1/1

Y1 - 2006/1/1

N2 - We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work also for non-triangular graphs, and their virtual coordinates are easy to construct.

AB - We propose four simple algorithms for routing on planar graphs using virtual coordinates. These algorithms are superior to existing algorithms in that they are oblivious, work also for non-triangular graphs, and their virtual coordinates are easy to construct.

UR - http://www.scopus.com/inward/record.url?scp=79952183688&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952183688&partnerID=8YFLogxK

M3 - Paper

T2 - 18th Annual Canadian Conference on Computational Geometry, CCCG 2006

Y2 - 14 August 2006 through 16 August 2006

ER -

Routing with guaranteed delivery on virtual coordinates

Abstract

Conference

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this