Data networks
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Ant-based load balancing in telecommunications networks
Adaptive Behavior
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Graph theory and its applications
Graph theory and its applications
On the red-blue set cover problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Ant algorithms for discrete optimization
Artificial Life
Self-Organization in Biological Systems
Self-Organization in Biological Systems
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Design of a Survivable WDM Photonic Network
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Survivable Routing in WDM Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Survivable Mapping Algorithm by Ring Trimming (SMART) for Large IP-Over-WDM Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
A Scalable Algorithm for Survivable Routing in IP-Over-WDM Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Ant Agents for Hybrid Multipath Routing in Mobile Ad Hoc Networks
WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Survey on dependable IP over fiber networks
Dependable Systems
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Survivable routing in IP-over-WDM networks: An efficient and scalable local search algorithm
Optical Switching and Networking
Design protection for WDM optical networks
IEEE Journal on Selected Areas in Communications
Fault management in IP-over-WDM networks: WDM protection versus IP restoration
IEEE Journal on Selected Areas in Communications
Survivable lightpath routing: a new approach to the design of WDM-based networks
IEEE Journal on Selected Areas in Communications
IP restoration vs. WDM protection: is there an optimal choice?
IEEE Network: The Magazine of Global Internetworking
Feasibility of IP restoration in a tier 1 backbone
IEEE Network: The Magazine of Global Internetworking
Survey on dependable IP over fiber networks
Dependable Systems
Evolving robust networks for systems-of-systems
SSBSE'12 Proceedings of the 4th international conference on Search Based Software Engineering
Hi-index | 0.00 |
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.