Time filter

Source Type

Sahhaf S.,Gaston Crommenlaan 8 Bus 201 | Tavernier W.,Gaston Crommenlaan 8 Bus 201 | Colle D.,Gaston Crommenlaan 8 Bus 201 | Pickavet M.,Gaston Crommenlaan 8 Bus 201 | Demeester P.,Gaston Crommenlaan 8 Bus 201
Computer Communications | Year: 2013

The scalability of current routing protocols is limited by the linearly increasing size of the corresponding routing tables. Greedy routing has been proposed as a solution to this scalability problem. In greedy routing, every node is assigned a coordinate. These coordinates are used in order to forward a packet to a neighbor which is closer to the destination. Current greedy methods cannot efficiently cope with failures in topology. Using methods which require large resources and have significant loss in the quality of the routing (stretch loss) makes greedy routing useless in large-scale networks. In this paper, local techniques for single and multiple link failure recovery are proposed. The methods require very limited resources and result into limited loss in routing quality. The proposed schemes allow fast switch-over and scale with the number of links in the spanning tree of the network. Scalability, simplicity and low overhead of the methods make them suitable for large networks. The proposed techniques are evaluated in an experimental environment. © 2013 Elsevier B.V. All rights reserved.

Loading Gaston Crommenlaan 8 Bus 201 collaborators
Loading Gaston Crommenlaan 8 Bus 201 collaborators