On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings

M. Autenrieth, H. Frey, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 126–131.

Download
Restricted 509-06529245.pdf 197.05 KB
Conference Paper
Author
;
Department
Abstract
In this paper we will introduce a new d-dimensional graph for constructing geometric application layer overlay net-works. Our approach will use internet coordinates, embedded using the L∞ -metric. After describing the graph structure, we will show how it limits maintenance overhead by bounding each node’s out-degree and how it supports greedy routing using one-hop neighbourhood information in each routing step. We will further show that greedy routing can always compute a path in our graph and we will also prove that in each forwarding step the next hop is closer to the destination than the current node.
Publishing Year
Proceedings Title
Proceedings of the Conference on Networked Systems (NetSys)
Page
126-131
LibreCat-ID

Cite this

Autenrieth M, Frey H. On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings. In: Proceedings of the Conference on Networked Systems (NetSys). ; 2013:126-131. doi:10.1109/NetSys.2013.10
Autenrieth, M., & Frey, H. (2013). On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings. In Proceedings of the Conference on Networked Systems (NetSys) (pp. 126–131). https://doi.org/10.1109/NetSys.2013.10
@inproceedings{Autenrieth_Frey_2013, title={On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings}, DOI={10.1109/NetSys.2013.10}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Autenrieth, Marcus and Frey, Hannes}, year={2013}, pages={126–131} }
Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings.” In Proceedings of the Conference on Networked Systems (NetSys), 126–31, 2013. https://doi.org/10.1109/NetSys.2013.10.
M. Autenrieth and H. Frey, “On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings,” in Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 126–131.
Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings.” Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 126–31, doi:10.1109/NetSys.2013.10.
Main File(s)
File Name
509-06529245.pdf 197.05 KB
Access Level
Restricted Closed Access
Last Uploaded
2018-03-15T10:46:51Z


Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar