Guaranteed greedy routing in overlay networks

Milic, Dragan; Braun, Torsten (15 May 2013). Guaranteed greedy routing in overlay networks. In: Future Internet Communications (CFIC), 2013 Conference on. Coimbra, Portugal. May 15 - 16, 2013. 10.1109/CFIC.2013.6566327

[img] Text
milic1.pdf - Published Version
Restricted to registered users only
Available under License Publisher holds Copyright.

Download (349kB) | Request a copy

Greedy routing can be used in mobile ad-hoc networks as geographic routing protocol. This paper proposes to use greedy routing also in overlay networks by positioning overlay nodes into a multi-dimensional Euclidean space. Greedy routing can only be applied when a routing decision makes progress towards the final destination. Our proposed overlay network is built such that there will be always progress at each forwarding node. This is achieved by constructing at each node a so-called nearest neighbor convex set (NNCS). NNCSs can be used for various applications such as multicast routing, service discovery and Quality-of-Service routing. NNCS has been compared with Pastry, another topology-aware overlay network. NNCS has superior relative path stretches indicating the optimality of a path.

Item Type:

Conference or Workshop Item (Paper)

Division/Institute:

08 Faculty of Science > Institute of Computer Science (INF) > Communication and Distributed Systems (CDS)
08 Faculty of Science > Institute of Computer Science (INF)

UniBE Contributor:

Milic, Dragan and Braun, Torsten

Subjects:

000 Computer science, knowledge & systems
500 Science > 510 Mathematics

ISBN:

978‐1‐4799-0059-­6

Language:

English

Submitter:

Sayed Ali Marandi

Date Deposited:

19 Mar 2014 10:57

Last Modified:

08 Aug 2017 07:38

Publisher DOI:

10.1109/CFIC.2013.6566327

Uncontrolled Keywords:

convex programming;greedy algorithms;mobile ad hoc networks;overlay networks;routing protocols;NNCS;Quality of Service routing;geographic routing protocol;greedy routing;mobile ad hoc networks;multicast routing;multidimensional Euclidean space;nearest neighbor convex set;overlay networks;service discovery;topology aware overlay network;Artificial neural networks;Network topology;Overlay networks;Routing;Routing protocols;Topology;Unicast

BORIS DOI:

10.7892/boris.44042

URI:

https://boris.unibe.ch/id/eprint/44042

Actions (login required)

Edit item Edit item
Provide Feedback