论文信息 - Two Deterministic Strategies for Finding Shortest Pairs of Edge-disjoint Paths

Two Deterministic Strategies for Finding Shortest Pairs of Edge-disjoint Paths

Marina Girolimetto, Marcia H. M. Paiva, Rodrigo S. Tessinari, Claunir Pavan, Fabio O. Lima 1: LabTel – Laboratório de Telecomunicações, UFES, Vitória, Brazil, 29075-910; marina.girolimetto@aluno.ufes.br, marcia.paiva@ufes.br, stange@inf.ufes.br 2: Ciência da Computação, UFFS, Chapecó, Brazil, 89815-899; claunir.pavan@uffs.edu.br 3: Engenharia de Controle e Automação, IFES, Serra, Brazil, 29173-087; fabio.lima@ifes.edu.br

Rodrigo Stange Tessinari | Claunir Pavan | Marcia Helena Moreira Paiva | Marina Girolimetto | Fabio O. Lima

[1] Robert E. Tarjan,et al. A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[2] A. N. Pinto,et al. Statistical model for link lengths in optical transport networks , 2013, IEEE/OSA Journal of Optical Communications and Networking.

[3] Didier Colle,et al. ElasticO++: An Elastic Optical Network Simulation Framework for OMNeT++ , 2016, Opt. Switch. Netw..

[4] Paul Bonenfant,et al. The evolution of transport network survivability , 1999, IEEE Commun. Mag..