Gerenciando Múltiplas Falhas Bizantinas em Redes Ópticas Roteadas por Algoritmos baseados em Otimização por Colônia de Formigas

  • Aldo Ventura da Silva UFABC
  • Gustavo Sousa Pavani UFABC

Abstract


Routing algorithms based on Ant Colony Optimization (ACO) are especially vulnerable to byzantine failures, where authenticated nodes behave in an arbitrary way and disrupt the routing on the network. In this work, we analyze the use of crankback re-routing extensions associated to the ACO algorithm to tackle byzantine failures that affect many nodes in a wavelengthswitched optical network. For the three types of byzantine failures assessed, misdirection of forward ants, dropping of forward ants and dropping of backward ants, simulations demonstrate that the crankback mechanism makes the network resilient to byzantine failures, mitigating the impact on the blocking probability for establishing lightpaths.

References

Awerbuch, B., Holmer, D., Nita-Rotaru, C., and Rubens, H. (2002). An on-demand secure In 1st ACM Workshop on Wireless routing protocol resilient to byzantine failures. Security (WiSE 2002), pages 21–30.

Awerbuch, B., Holmer, D., and Rubens, H. (2003). Provably Secure Competitive Routing against Proactive Byzantine Adversaries via Reinforcement Learning. Technical report, Johns Hopkins University, Department of Computer Science.

Berger, L. (2003). Generalized Multi-Protocol Label Switching (GMPLS) Signaling Resource ReserVation Protocol-Trafc Engineering (RSVP-TE) Extensions. RFC 3473 (Proposed Standard).

Di Caro, G. and Dorigo, M. (1998). AntNet: distributed stigmergetic control for communications networks. Journal of Articial Intelligence Research, 9:317–365.

Dorigo, M. and Stützle, T. (2004). Ant Colony Optimization. MIT Press.

Farrel, A., Satyanarayana, A., Iwata, A., Fujita, N., and Ash, G. (2007). Crankback Signaling Extensions for MPLS and GMPLS RSVP-TE. RFC 4920 (Proposed Standard).

Grassé, P. P. (1959). La reconstruction du nid et les coordinations inter-individuelles chez Bellicoitermes natalenis et Cubitermes sp. La théorie de la stigmergie: Essai d’interprétation des termites constructeurs. Insectes Sociaux, 6:41–81.

Le, F., Lee, S., Wong, T., Kim, H. S., and Newcomb, D. (2009). Detecting network-wide and router-specic miscongurations through data mining. IEEE/ACM Transactions on Networking, 17(1):66–79.

Mannie, E. (2004). Generalized Multi-Protocol Label Switching (GMPLS) Architecture. RFC 3945 (Proposed Standard).

Pavani, G. S., de França Queiroz, A., and Pellegrini, J. C. (2016). Analysis of ant colony optimization-based routing in optical networks in the presence of byzantine failures. Information Sciences, 340–341:27–40.

Pavani, G. S. and Waldman, H. (2006a). Evaluation of an ant-based architecture for all-optical networks. In 10th Conference on Optical Network Design and Modelling (ONDM’06), Copenhagen, Denmark.

Pavani, G. S. and Waldman, H. (2006b). Trafc engineering and restoration in optical packet switching networks by means of ant colony optimization. In Third International Conference on Broadband Communications, Network and Systems (BroadNets 2006), pages 1–9, San Jose, CA.

Pavani, G. S. and Waldman, H. (2008). Restoration in wavelength-routed optical networks by means of ant colony optimization. Photonic Network Communications, 16(1):83– 91.

Pavani, G. S. and Waldman, H. (2010). Routing and wavelength assignment with crankIEEE Journal on back re-routing extensions by means of ant colony optimization. Selected Areas in Communications, 28(4):532–541.

Perlman, R. (1988). Network Layer Protocols with Byzantine Robustness. PhD thesis, Massachusetts Institute of Technology.

Prehofer, C. and Bettstetter, C. (2005). Self-organization in communication networks: Principles and design paradigms. IEEE Communications Magazine, 43(7):78–85.

Rajendran, R. K., Misra, V., and Rubenstein, D. (2007). Theoretical bounds on controlplane self-monitoring in routing protocols. In ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2007), pages 325–336.

Wendlandt, D., Avramopoulos, I., Andersen, D., and Rexford, J. (2006). Donít secure routing protocols, secure data delivery. In 5th ACM Workshop on Hot Topics in Networks (HotNets-V), pages 7–12.

Zhong, W. and Evans, D. (2002). When ants attack: Security issues for stigmergic systems. Technical Report CS-2002-23, University of Virgina, Department of Computer Science.
Published
2018-05-10
SILVA, Aldo Ventura da; PAVANI, Gustavo Sousa. Gerenciando Múltiplas Falhas Bizantinas em Redes Ópticas Roteadas por Algoritmos baseados em Otimização por Colônia de Formigas. In: BRAZILIAN SYMPOSIUM ON COMPUTER NETWORKS AND DISTRIBUTED SYSTEMS (SBRC), 36. , 2018, Campos do Jordão. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2018 . p. 253-266. ISSN 2177-9384. DOI: https://doi.org/10.5753/sbrc.2018.2420.