Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Algorithms for Failure Protection in Large IP-over-Fiber and Wireless Ad Hoc Networks|
|Citation:||Lecture Notes in Computer Science (LNCS) 4028: Dependable Systems: Software, Computing, Networks, 2006 / Kohlas, J., Meyer, B., Schiper, A. (ed./s), pp.231-259|
|Series/Report no.:||Lecture Notes in Computer Science ; Vol. 4028|
|Frederick Ducatelle, Luca Maria Gambardella, Maciej Kurant, Hung X. Nguyen and Patrick Thiran|
|Abstract:||We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in the presence of false and missing alarms. Next, we present two efficient algorithms for mapping an IP network on an optical network in such a way that it is protected against failures at the optical layer. The first algorithm offers a method to formally verify the existence of a solution, contrary to all other heuristics known to date. The second algorithm is a heuristic search that takes capacity constraints in account. Both algorithms are shown to be faster by orders of magnitude than existing solutions. Finally, we develop a new routing algorithm for wireless mobile ad hoc networks, adopting ideas from the Ant Colony Optimization metaheuristic. The routing scheme can adapt to network and traffic changes and uses multipath routing and an efficient local repair mechanism to improve failure resilience.|
|Appears in Collections:||Mathematical Sciences publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.