On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings Autenrieth, Marcus Frey, Hannes ddc:040 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. 2013 info:eu-repo/semantics/conferenceObject doc-type:conferenceObject text http://purl.org/coar/resource_type/c_5794 https://ris.uni-paderborn.de/record/509 Autenrieth M, Frey H. On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings. In: <i>Proceedings of the Conference on Networked Systems (NetSys)</i>. ; 2013:126-131. doi:<a href="https://doi.org/10.1109/NetSys.2013.10">10.1109/NetSys.2013.10</a> info:eu-repo/semantics/altIdentifier/doi/10.1109/NetSys.2013.10 info:eu-repo/semantics/closedAccess