{"abstract":[{"text":"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.","lang":"eng"}],"author":[{"full_name":"Autenrieth, Marcus","last_name":"Autenrieth","first_name":"Marcus"},{"first_name":"Hannes","full_name":"Frey, Hannes","last_name":"Frey"}],"file_date_updated":"2018-03-15T10:46:51Z","doi":"10.1109/NetSys.2013.10","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"ddc":["040"],"has_accepted_license":"1","year":"2013","status":"public","date_created":"2017-10-17T12:42:31Z","user_id":"15504","date_updated":"2022-01-06T07:01:37Z","file":[{"relation":"main_file","date_updated":"2018-03-15T10:46:51Z","access_level":"closed","file_name":"509-06529245.pdf","file_size":197048,"creator":"florida","file_id":"1304","success":1,"content_type":"application/pdf","date_created":"2018-03-15T10:46:51Z"}],"citation":{"chicago":"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.","ieee":"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.","ama":"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","bibtex":"@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} }","apa":"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","short":"M. Autenrieth, H. Frey, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 126–131.","mla":"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."},"type":"conference","department":[{"_id":"75"}],"page":"126-131","_id":"509","publication":"Proceedings of the Conference on Networked Systems (NetSys)","title":"On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings"}