Multicast routing with bandwidth requirement in the case of incomplete information as a Steiner tree problemReportar como inadecuado




Multicast routing with bandwidth requirement in the case of incomplete information as a Steiner tree problem - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 IRMAR - Institut de Recherche Mathématique de Rennes 2 BUTE - Budapest University of Technology and Economics Budapest 3 ARMOR - Architectures and network models IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes, Ecole Nationale Supérieure des Télécommunications de Bretagne

Abstract : This paper is concerned with developing novel algorithms for multicast routing in packet switched communication networks. First, multicast routing with bandwidth requirement in the case of incomplete information is reduced to a deterministic Steiner tree problem. Then taboo search algorithms are used to provide high quality, sub-optimal solutions for multicast routing in polynomial time.

Keywords : ENUMERATION ALGORITHM TABOO SEARCH STEINER TREE PROBLEM MULTICAST NETWORKING





Autor: Patrice Leguesdron - János Levendovszky - Miklos Molnar - Csaba Végsö -

Fuente: https://hal.archives-ouvertes.fr/



DESCARGAR PDF




Documentos relacionados