Optimizing robustness in geometric routing via embedding redundancy and regeneration. Issue 4 (25th August 2015)

• Record Type: Journal Article
• Authors: Houthooft, Rein; Sahhaf, Sahel; Tavernier, Wouter; De Turck, Filip; Colle, Didier; Pickavet, Mario
• Is Part Of: Networks. Volume 66:Issue 4(2015:Dec.)
• Page Start: 320
• Page End: 334
• Publication Date: 2015-08-25
• Subjects: geometric routing -- robustness -- forest routing; Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21630
• Languages: English
• ISSNs: 0028-3045

Abstract

Abstract : Geometric routing is an alternative to traditional routing algorithms in which traffic is no longer forwarded using lookup tables, but using coordinates in an embedding of the underlying network. A major downside of current geometric routing algorithms is their inability to handle network failures in a graceful manner. Moreover, they cannot deal with dynamic graph topologies. This article presents a geometric routing scheme that uses an embedding based on a spanning forest. Allowing nodes to select the optimal spanning tree leads to both shorter paths and natural traffic redirection in case of network failures. By constructing the forest in such a way that its disconnected components have low redundancy, their coverage is maximized. Results show that this system is able to operate gracefully in severe failure scenarios, without any form of path protection or restoration. By means of an embedding regeneration procedure, the routing scheme is able to continuously adapt to an altering network topology. This geometric routing algorithm effectively combines two key objectives, namely low path stretch and high robustness. © 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 66(4), 320–334 2015