Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Finding edge-disjoint paths in networks by means of artificial ant colonies

Autor
Blesa, M.; Blum, C.
Tipus d'activitat
Document cientificotècnic
Data
2007-01
Codi
LSI-07-8-R
Repositori
http://hdl.handle.net/2117/86190 Obrir en finestra nova
Resum
One of the basic operations in communication networks consists in establishing routes for connection requests between physically separated network nodes. In many situations, either due to technical constraints or to quality-of-service and survivability requirements, it is required that no two routes interfere with each other. These requirements apply in particular to routing and admission control in large-scale, high-speed and optical networks. The same requirements also arise in a multitude of ...
Citació
Blesa, M., Blum, C. "Finding edge-disjoint paths in networks by means of artificial ant colonies". 2007.
Paraules clau
Ant Colony Optimization, Maximum Edge-disjoint Paths Problem
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius