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