Routing Reconfiguration/Process Number: Networks with Shared Bandwidth. (2009)
Coudert, David, Mazauric, Dorian, Nisse, Nicolas
In this paper, we address the problem of scheduling the switching of a set of connection requests one after the other from current routing to another pre-determined routing. We propose a model that...
Routing Reconfiguration/Process Number: Networks with Shared Bandwidth. (2009)
Coudert, David, Mazauric, Dorian, Nisse, Nicolas
In this paper, we address the problem of scheduling the switching of a set of connection requests one after the other from current routing to another pre-determined routing. We propose a model that...
MPLS label stacking on the line network (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Perennes, Stephane, Rivano, Herve, Sau, Ignasi, ...
All-Optical Label Switching (AOLS) is a new technology that performs forwarding with- out any Optical-Electrical-Optical (OEO) conversions. In this report, we study the problem of routing a set of...
MPLS label stacking on the line network (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Perennes, Stephane, Rivano, Herve, Sau, Ignasi, ...
All-Optical Label Switching (AOLS) is a new technology that performs forwarding with- out any Optical-Electrical-Optical (OEO) conversions. In this report, we study the problem of routing a set of...
Online Distributed Traffic Grooming on Path Networks (2009)
Bermond, Jean-Claude, Coudert, David, Peters, Joseph
The grooming factor C of a WDM optical network is the number of connections that can share the bandwidth of each wavelength and the process of grouping the requests that will share each wavelength is...
Online Distributed Traffic Grooming on Path Networks (2009)
Bermond, Jean-Claude, Coudert, David, Peters, Joseph
The grooming factor C of a WDM optical network is the number of connections that can share the bandwidth of each wavelength and the process of grouping the requests that will share each wavelength is...
GMPLS Routing Strategies based on the Design of Hypergraph Layouts (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Perennes, Stephane, Sau Valls, Ignasi, Solano Donado, Fernando
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) conversions. In this paper, we study the problem of routing a set...
GMPLS Routing Strategies based on the Design of Hypergraph Layouts (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Perennes, Stephane, Sau Valls, Ignasi, Solano Donado, Fernando
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) conversions. In this paper, we study the problem of routing a set...
Online Distributed Traffic Grooming on Path Networks (2009)
Bermond, Jean-Claude, Coudert, David, Peters, Joseph
The grooming factor C of a WDM optical network is the number of connections that can share the bandwidth of each wavelength and the process of grouping the requests that will share each wavelength is...
Online Distributed Traffic Grooming on Path Networks (2009)
Bermond, Jean-Claude, Coudert, David, Peters, Joseph
The grooming factor C of a WDM optical network is the number of connections that can share the bandwidth of each wavelength and the process of grouping the requests that will share each wavelength is...
MPLS label stacking on the line network (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Pérennes, Stéphane, Rivano, Hervé, Sau, Ignasi, ...
All-Optical Label Switching (AOLS) is a new technology that performs forwarding without any Optical-Electrical-Optical (OEO) conversions. In this report, we study the problem of routing a set of...
MPLS label stacking on the line network (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Pérennes, Stéphane, Rivano, Hervé, Sau, Ignasi, ...
All-Optical Label Switching (AOLS) is a new technology that performs forwarding without any Optical-Electrical-Optical (OEO) conversions. In this report, we study the problem of routing a set of...
Circuit visiting 10 ordered vertices in infinite grids (2009)
Coudert, David, Giroire, Frédéric, Sau Valls, Ignasi
A circuit in a simple undirected graph G=(V,E) is a sequence of vertices {v_1,v_2,...,v_{k+1}} such that v_1=v_{k+1} and {v_i,v_{i+1}} \in E for i=1,...,k. A circuit C is said to be edge-simple if no...
Circuit visiting 10 ordered vertices in infinite grids (2009)
Coudert, David, Giroire, Frédéric, Sau Valls, Ignasi
A circuit in a simple undirected graph G=(V,E) is a sequence of vertices {v_1,v_2,...,v_{k+1}} such that v_1=v_{k+1} and {v_i,v_{i+1}} \in E for i=1,...,k. A circuit C is said to be edge-simple if no...
Joint Optimization of Routing and Radio Configuration in Fixed Wireless Networks (2009)
Coudert, David, Nepomuceno, Napoleão, Rivano, Hervé
Nous étudions la minimisation de la consommation d'énergie des réseaux sans-fil fixes à transmission par liens microondes, par l'optimisation jointe du routage des flux de données et la...
Joint Optimization of Routing and Radio Configuration in Fixed Wireless Networks (2009)
Coudert, David, Nepomuceno, Napoleão, Rivano, Hervé
Nous étudions la minimisation de la consommation d'énergie des réseaux sans-fil fixes à transmission par liens microondes, par l'optimisation jointe du routage des flux de données et la...
Reconfiguration dans les réseaux optiques (2009)
Coudert, David, Huc, Florian, Mazauric, Dorian, Nisse, Nicolas, Sereni, Jean-Sébastien
L'évolution permanente du trafic, les opérations de maintenance et l'existence de pannes dans les réseaux WDM, obligent à rerouter régulièrement des connexions. Les nouvelles demandes de...
Reconfiguration dans les réseaux optiques (2009)
Coudert, David, Huc, Florian, Mazauric, Dorian, Nisse, Nicolas, Sereni, Jean-Sébastien
L'évolution permanente du trafic, les opérations de maintenance et l'existence de pannes dans les réseaux WDM, obligent à rerouter régulièrement des connexions. Les nouvelles demandes de...
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks (2009)
Cohen, Nathann, Coudert, David, Mazauric, Dorian, Nepomuceno, Napoleão, Nisse, Nicolas
In this report, we study the problem of rerouting a set of lightpaths in WDM networks. The reconfiguration issue arises for instance when it is necessary to improve the usage of resources or when a...
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks (2009)
Cohen, Nathann, Coudert, David, Mazauric, Dorian, Nepomuceno, Napoleão, Nisse, Nicolas
In this report, we study the problem of rerouting a set of lightpaths in WDM networks. The reconfiguration issue arises for instance when it is necessary to improve the usage of resources or when a...
GMPLS Label Space Minimization through Hypergraph Layouts (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Pérennes, Stéphane, Sau, Ignasi, Solano Donado, Fernando
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any optical-electrical-optical conversions. In this report, we study the problem of routing a set of...
GMPLS Label Space Minimization through Hypergraph Layouts (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Pérennes, Stéphane, Sau, Ignasi, Solano Donado, Fernando
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any optical-electrical-optical conversions. In this report, we study the problem of routing a set of...
Designing Hypergraph Layouts to GMPLS Routing Strategies (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Pérennes, Stéphane, Sau, Ignasi, Solano Donado, Fernando
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) conversions. In this paper, we study the problem of routing a set...
Designing Hypergraph Layouts to GMPLS Routing Strategies (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Pérennes, Stéphane, Sau, Ignasi, Solano Donado, Fernando
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) conversions. In this paper, we study the problem of routing a set...
Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids (2009)
Coudert, David, Giroire, Frederic, Sau, Ignasi
A circuit in a simple undirected graph G = (V , E) is a sequence of vertices {v1 , v2 , . . . , vk+1 } such that v1 = vk+1 and {vi , vi+i } ∈ E for i = 1, . . . , k. A circuit C is said to be...
Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids (2009)
Coudert, David, Giroire, Frederic, Sau, Ignasi
A circuit in a simple undirected graph G = (V , E) is a sequence of vertices {v1 , v2 , . . . , vk+1 } such that v1 = vk+1 and {vi , vi+i } ∈ E for i = 1, . . . , k. A circuit C is said to be...
MPLS label stacking on the line network (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Pérennes, Stéphane, Rivano, Hervé, Sau, Ignasi, ...
All-Optical Label Switching (AOLS) is a new technology that performs forwarding without any Optical-Electrical-Optical (OEO) conversions. In this report, we study the problem of routing a set of...
MPLS label stacking on the line network (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Pérennes, Stéphane, Rivano, Hervé, Sau, Ignasi, ...
All-Optical Label Switching (AOLS) is a new technology that performs forwarding without any Optical-Electrical-Optical (OEO) conversions. In this report, we study the problem of routing a set of...
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks (2009)
Cohen, Nathann, Coudert, David, Mazauric, Dorian, Nepomuceno, Napoleão, Nisse, Nicolas
In this report, we study the problem of rerouting a set of lightpaths in WDM networks. The reconfiguration issue arises for instance when it is necessary to improve the usage of resources or when a...
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks (2009)
Cohen, Nathann, Coudert, David, Mazauric, Dorian, Nepomuceno, Napoleão, Nisse, Nicolas
In this report, we study the problem of rerouting a set of lightpaths in WDM networks. The reconfiguration issue arises for instance when it is necessary to improve the usage of resources or when a...
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks (2009)
Cohen, Nathann, Coudert, David, Mazauric, Dorian, Nepomuceno, Napoleão, Nisse, Nicolas
In this report, we study the problem of rerouting a set of lightpaths in WDM networks. The reconfiguration issue arises for instance when it is necessary to improve the usage of resources or when a...
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks (2009)
Cohen, Nathann, Coudert, David, Mazauric, Dorian, Nepomuceno, Napoleão, Nisse, Nicolas
In this report, we study the problem of rerouting a set of lightpaths in WDM networks. The reconfiguration issue arises for instance when it is necessary to improve the usage of resources or when a...
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks (2009)
Cohen, Nathann, Coudert, David, Mazauric, Dorian, Nepomuceno, Napoleão, Nisse, Nicolas
In this report, we study the problem of rerouting a set of lightpaths in WDM networks. The reconfiguration issue arises for instance when it is necessary to improve the usage of resources or when a...
MPLS label stacking on the line network (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Pérennes, Stéphane, Rivano, Hervé, Sau, Ignasi, ...
All-Optical Label Switching (AOLS) is a new technology that performs forwarding without any Optical-Electrical-Optical (OEO) conversions. In this report, we study the problem of routing a set of...
Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids (2009)
Coudert, David, Giroire, Frederic, Sau, Ignasi
A circuit in a simple undirected graph G = (V , E) is a sequence of vertices {v1 , v2 , . . . , vk+1 } such that v1 = vk+1 and {vi , vi+i } ∈ E for i = 1, . . . , k. A circuit C is said to be...
Designing Hypergraph Layouts to GMPLS Routing Strategies (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Pérennes, Stéphane, Sau, Ignasi, Solano Donado, Fernando
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) conversions. In this paper, we study the problem of routing a set...
GMPLS Label Space Minimization through Hypergraph Layouts (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Pérennes, Stéphane, Sau, Ignasi, Solano Donado, Fernando
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any optical-electrical-optical conversions. In this report, we study the problem of routing a set of...
Joint Optimization of Routing and Radio Configuration in Fixed Wireless Networks (2009)
Coudert, David, Nepomuceno, Napoleão, Rivano, Hervé
Nous étudions la minimisation de la consommation d'énergie des réseaux sans-fil fixes à transmission par liens microondes, par l'optimisation jointe du routage des flux de données et la...
Reconfiguration dans les réseaux optiques (2009)
Coudert, David, Huc, Florian, Mazauric, Dorian, Nisse, Nicolas, Sereni, Jean-Sébastien
L'évolution permanente du trafic, les opérations de maintenance et l'existence de pannes dans les réseaux WDM, obligent à rerouter régulièrement des connexions. Les nouvelles demandes de...
Circuit visiting 10 ordered vertices in infinite grids (2009)
Coudert, David, Giroire, Frédéric, Sau Valls, Ignasi
A circuit in a simple undirected graph G=(V,E) is a sequence of vertices {v_1,v_2,...,v_{k+1}} such that v_1=v_{k+1} and {v_i,v_{i+1}} \in E for i=1,...,k. A circuit C is said to be edge-simple if no...
Online Distributed Traffic Grooming on Path Networks (2009)
Bermond, Jean-Claude, Coudert, David, Peters, Joseph
The grooming factor C of a WDM optical network is the number of connections that can share the bandwidth of each wavelength and the process of grouping the requests that will share each wavelength is...
GMPLS Routing Strategies based on the Design of Hypergraph Layouts (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Perennes, Stephane, Sau Valls, Ignasi, Solano Donado, Fernando
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) conversions. In this paper, we study the problem of routing a set...
MPLS label stacking on the line network (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Perennes, Stephane, Rivano, Herve, Sau, Ignasi, ...
All-Optical Label Switching (AOLS) is a new technology that performs forwarding with- out any Optical-Electrical-Optical (OEO) conversions. In this report, we study the problem of routing a set of...
Routing Reconfiguration/Process Number: Networks with Shared Bandwidth. (2009)
Coudert, David, Mazauric, Dorian, Nisse, Nicolas
In this paper, we address the problem of scheduling the switching of a set of connection requests one after the other from current routing to another pre-determined routing. We propose a model that...
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks (2009)
Cohen, Nathann, Coudert, David, Mazauric, Dorian, Nepomuceno, Napoleão, Nisse, Nicolas
In this report, we study the problem of rerouting a set of lightpaths in WDM networks. The reconfiguration issue arises for instance when it is necessary to improve the usage of resources or when a...
MPLS label stacking on the line network (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Pérennes, Stéphane, Rivano, Hervé, Sau, Ignasi, ...
All-Optical Label Switching (AOLS) is a new technology that performs forwarding without any Optical-Electrical-Optical (OEO) conversions. In this report, we study the problem of routing a set of...
Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids (2009)
Coudert, David, Giroire, Frederic, Sau, Ignasi
A circuit in a simple undirected graph G = (V , E) is a sequence of vertices {v1 , v2 , . . . , vk+1 } such that v1 = vk+1 and {vi , vi+i } ∈ E for i = 1, . . . , k. A circuit C is said to be...
Designing Hypergraph Layouts to GMPLS Routing Strategies (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Pérennes, Stéphane, Sau, Ignasi, Solano Donado, Fernando
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) conversions. In this paper, we study the problem of routing a set...
GMPLS Label Space Minimization through Hypergraph Layouts (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Pérennes, Stéphane, Sau, Ignasi, Solano Donado, Fernando
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any optical-electrical-optical conversions. In this report, we study the problem of routing a set of...
Joint Optimization of Routing and Radio Configuration in Fixed Wireless Networks (2009)
Coudert, David, Nepomuceno, Napoleão, Rivano, Hervé
Nous étudions la minimisation de la consommation d'énergie des réseaux sans-fil fixes à transmission par liens microondes, par l'optimisation jointe du routage des flux de données et la...
Reconfiguration dans les réseaux optiques (2009)
Coudert, David, Huc, Florian, Mazauric, Dorian, Nisse, Nicolas, Sereni, Jean-Sébastien
L'évolution permanente du trafic, les opérations de maintenance et l'existence de pannes dans les réseaux WDM, obligent à rerouter régulièrement des connexions. Les nouvelles demandes de...
Circuit visiting 10 ordered vertices in infinite grids (2009)
Coudert, David, Giroire, Frédéric, Sau Valls, Ignasi
A circuit in a simple undirected graph G=(V,E) is a sequence of vertices {v_1,v_2,...,v_{k+1}} such that v_1=v_{k+1} and {v_i,v_{i+1}} \in E for i=1,...,k. A circuit C is said to be edge-simple if no...
Online Distributed Traffic Grooming on Path Networks (2009)
Bermond, Jean-Claude, Coudert, David, Peters, Joseph
The grooming factor C of a WDM optical network is the number of connections that can share the bandwidth of each wavelength and the process of grouping the requests that will share each wavelength is...
GMPLS Routing Strategies based on the Design of Hypergraph Layouts (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Perennes, Stephane, Sau Valls, Ignasi, Solano Donado, Fernando
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) conversions. In this paper, we study the problem of routing a set...
MPLS label stacking on the line network (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Perennes, Stephane, Rivano, Herve, Sau, Ignasi, ...
All-Optical Label Switching (AOLS) is a new technology that performs forwarding with- out any Optical-Electrical-Optical (OEO) conversions. In this report, we study the problem of routing a set of...
Routing Reconfiguration/Process Number: Networks with Shared Bandwidth. (2009)
Coudert, David, Mazauric, Dorian, Nisse, Nicolas
In this paper, we address the problem of scheduling the switching of a set of connection requests one after the other from current routing to another pre-determined routing. We propose a model that...
Coudert, David, Nepomuceno, Napoleão, Rivano, Hervé
In this work, we investigate on minimizing the energy consumption of a wireless backhaul communication network through a joint optimization problem of data routing and radio configuration. The...
Algorithmique et optimisation de réseaux de communications optiques (2008)
Dans cette thèse, nous nous intéressons aux réseaux de communications optiques avec d'une part des réseaux en espace libre optique et d'autre part des réseaux à fibres optiques. Dans un premier...
Network Reconfiguration using Cops-and-Robber Games (2008)
Coudert, David, Mazauric, Dorian
The process number is the number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of view, it is...
Network Reconfiguration using Cops-and-Robber Games (2008)
Coudert, David, Mazauric, Dorian
The process number is the number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of view, it is...
Network Reconfiguration using Cops-and-Robber Games (2008)
Coudert, David, Mazauric, Dorian
The process number is the number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of view, it is...
Network Reconfiguration using Cops-and-Robber Games (2008)
Coudert, David, Mazauric, Dorian
The process number is the number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of view, it is...
A distributed algorithm for computing and updating the process number of a forest (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
In this paper, we present a distributed algorithm to compute various parameters of a tree such as the process number, the edge search number or the node search number and so the pathwidth. This...
Some Results on Non-deterministic Graph Searching in Trees ∗ (2008)
Omid Amini, David Coudert, Nicolas Nisse
Pathwidth and treewidth of graphs have been extensively studied for their important structural and algorithmic aspects. Determining these parameters is NP-complete in general, however it becomes...
Characterization of graphs and digraphs with small process number (2008)
Coudert, David, Sereni, Jean-Sebastien
The process number of a digraph has been introduced as a tool to study rerouting issues in WDM networks. We consider the recognition and the characterization of (di)graphs with process number at most...
Characterization of graphs and digraphs with small process number (2008)
Coudert, David, Sereni, Jean-Sebastien
The process number of a digraph has been introduced as a tool to study rerouting issues in WDM networks. We consider the recognition and the characterization of (di)graphs with process number at most...
A distributed algorithm for computing and updating the process number of a forest (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
In this paper, we present a distributed algorithm to compute various parameters of a tree such as the process number, the edge search number or the node search number and so the pathwidth. This...
A distributed algorithm for computing and updating the process number of a forest (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
In this paper, we present a distributed algorithm to compute various parameters of a tree such as the process number, the edge search number or the node search number and so the pathwidth. This...
Network Reconfiguration using Cops-and-Robber Games (2008)
Coudert, David, Mazauric, Dorian
The process number is the number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of view, it is...
Network Reconfiguration using Cops-and-Robber Games (2008)
Coudert, David, Mazauric, Dorian
The process number is the number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of view, it is...
Routing Reconfiguration/Process Number: Coping wih Two Classes of Services (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian, Nisse, Nicolas, Sereni, Jean-Sebastien
In WDM backbone networks, the traffic pattern evolves constantly due to the nature of the demand itself or because of equipment failures leading to reroute affected connections. In this...
Routing Reconfiguration/Process Number: Coping wih Two Classes of Services (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian, Nisse, Nicolas, Sereni, Jean-Sebastien
In WDM backbone networks, the traffic pattern evolves constantly due to the nature of the demand itself or because of equipment failures leading to reroute affected connections. In this...
Coudert, David, Nepomuceno, Napoleão, Rivano, Hervé
In this work, we investigate on minimizing the energy consumption of a wireless backhaul communication network through a joint optimization problem of data routing and radio configuration. The...
Coudert, David, Nepomuceno, Napoleão, Rivano, Hervé
In this work, we investigate on minimizing the energy consumption of a wireless backhaul communication network through a joint optimization of data routing and radio configuration. The backhaul...
Coudert, David, Nepomuceno, Napoleão, Rivano, Hervé
In this work, we investigate on minimizing the energy consumption of a wireless backhaul communication network through a joint optimization of data routing and radio configuration. The backhaul...
A distributed algorithm for computing and updating the process number of a forest (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
In this paper, we present a distributed algorithm to compute various parameters of a tree such as the process number, the edge search number or the node search number and so the pathwidth. This...
A distributed algorithm for computing and updating the process number of a forest (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
In this paper, we present a distributed algorithm to compute various parameters of a tree such as the process number, the edge search number or the node search number and so the pathwidth. This...
Algorithme générique pour les jeux de capture dans les arbres (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
Nous présentons un algorithme distribué simple calculant le process number des arbres en n étapes, avec un nombre total d'opérations en O(nlog(n)) et un total de O(nlog(n)) bits échangés. De...
Algorithme générique pour les jeux de capture dans les arbres (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
Nous présentons un algorithme distribué simple calculant le process number des arbres en n étapes, avec un nombre total d'opérations en O(nlog(n)) et un total de O(nlog(n)) bits échangés. De...
Computing and updating the process number in trees (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of...
Computing and updating the process number in trees (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of...
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring (2008)
Bermond, Jean-Claude, Coudert, David, Leveque, Benjamin
Traffic grooming in a WDM network consists of assigning to each request (lightpath) a wavelength with the constraint that a given wavelength can carry at most C requests or equivalently a request...
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring (2008)
Bermond, Jean-Claude, Coudert, David, Leveque, Benjamin
Traffic grooming in a WDM network consists of assigning to each request (lightpath) a wavelength with the constraint that a given wavelength can carry at most C requests or equivalently a request...
Computing and updating the process number in trees (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of...
Algorithme générique pour les jeux de capture dans les arbres (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
Nous présentons un algorithme distribué simple calculant le process number des arbres en n étapes, avec un nombre total d'opérations en O(nlog(n)) et un total de O(nlog(n)) bits échangés. De...
A distributed algorithm for computing and updating the process number of a forest (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
In this paper, we present a distributed algorithm to compute various parameters of a tree such as the process number, the edge search number or the node search number and so the pathwidth. This...
Coudert, David, Nepomuceno, Napoleão, Rivano, Hervé
In this work, we investigate on minimizing the energy consumption of a wireless backhaul communication network through a joint optimization of data routing and radio configuration. The backhaul...
Routing Reconfiguration/Process Number: Coping wih Two Classes of Services (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian, Nisse, Nicolas, Sereni, Jean-Sebastien
In WDM backbone networks, the traffic pattern evolves constantly due to the nature of the demand itself or because of equipment failures leading to reroute affected connections. In this context,...
Network Reconfiguration using Cops-and-Robber Games (2008)
Coudert, David, Mazauric, Dorian
The process number is the number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of view, it is...
Characterization of graphs and digraphs with small process number (2008)
Coudert, David, Sereni, Jean-Sebastien
The process number of a digraph has been introduced as a tool to study rerouting issues in WDM networks. We consider the recognition and the characterization of (di)graphs with process number at most...
A distributed algorithm for computing and updating the process number of a forest (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
In this paper, we present a distributed algorithm to compute various parameters of a tree such as the process number, the edge search number or the node search number and so the pathwidth. This...
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring (2008)
Bermond, Jean-Claude, Coudert, David, Leveque, Benjamin
Traffic grooming in a WDM network consists of assigning to each request (lightpath) a wavelength with the constraint that a given wavelength can carry at most C requests or equivalently a request...
Computing and updating the process number in trees (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of...
Algorithme générique pour les jeux de capture dans les arbres (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
Nous présentons un algorithme distribué simple calculant le process number des arbres en n étapes, avec un nombre total d'opérations en O(nlog(n)) et un total de O(nlog(n)) bits échangés. De...
A distributed algorithm for computing and updating the process number of a forest (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
In this paper, we present a distributed algorithm to compute various parameters of a tree such as the process number, the edge search number or the node search number and so the pathwidth. This...
Coudert, David, Nepomuceno, Napoleão, Rivano, Hervé
In this work, we investigate on minimizing the energy consumption of a wireless backhaul communication network through a joint optimization of data routing and radio configuration. The backhaul...
Routing Reconfiguration/Process Number: Coping wih Two Classes of Services (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian, Nisse, Nicolas, Sereni, Jean-Sebastien
In WDM backbone networks, the traffic pattern evolves constantly due to the nature of the demand itself or because of equipment failures leading to reroute affected connections. In this context,...
Network Reconfiguration using Cops-and-Robber Games (2008)
Coudert, David, Mazauric, Dorian
The process number is the number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph theory point of view, it is...
Characterization of graphs and digraphs with small process number (2008)
Coudert, David, Sereni, Jean-Sebastien
The process number of a digraph has been introduced as a tool to study rerouting issues in WDM networks. We consider the recognition and the characterization of (di)graphs with process number at most...
A distributed algorithm for computing and updating the process number of a forest (2008)
Coudert, David, Huc, Florian, Mazauric, Dorian
In this paper, we present a distributed algorithm to compute various parameters of a tree such as the process number, the edge search number or the node search number and so the pathwidth. This...
Unit Inria, Sophia Antipolis, David Coudert, David Coudert, Herv Rivano, Herv Rivano, ...
apport de recherche
Jean-claude Bermond, David Coudert, Mascotte Cnrs-is-inria, F- Sophia, Antipolis Cedex, Min-li Yu
This paper considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on sub-networks which are protected independently from...
F-06902 Sophia-Antipolis (2007)
David Coudert, Afonso Ferreira
Many results exist in the literature describing technological and theoretical advances in optical network topologies and design. However, an essential eoeort has yet to be done in linking those...
Contribution # l'implantation d'algorithmes g#om#triques sur machine parall#le (2007)
La carte des trap#zes est une structure couramment utilis#e en G#om#trie Algorithmique. Elle repr#sente l'arrangement d'un ensemble de segments dans le plan. A partir de cette carte, on...
David Coudert, Afonso Ferreira
Abstract. Advances in optical technology, such as low loss Optical Passive Star couplers (OPS) and the possibility of building tunable optical transmitters and receivers have increased the interest...
A Note on Cycle Covering [Extended Abstract] (2007)
Jean-claude Bermond, David Coudert, Projet Mascotte, F- Sophia-antipolis Cedex, Lilian Chacon, Franois Tillerot, ...
This study considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other.
Some Results on Non-deterministic Graph Searching in Trees (2007)
Amini, Omid, Coudert, David, Nisse, Nicolas
Pathwidth and treewidth of graphs have been extensively studied for their important structural and algorithmic aspects. Determining these parameters is NP-complete in general, however it becomes...
Characterization of graphs and digraphs with small process number (2007)
Coudert, David, Sereni, Jean-Sebastien
The process number of a digraph has been introduced as a tool to study rerouting issues in WDM networks. We consider the recognition and the characterization of (di)graphs with process number at most...
Characterization of graphs and digraphs with small process number (2007)
Coudert, David, Sereni, Jean-Sebastien
The process number of a digraph has been introduced as a tool to study rerouting issues in WDM networks. We consider the recognition and the characterization of (di)graphs with process number at most...
Characterization of graphs and digraphs with small process number (2007)
Coudert, David, Sereni, Jean-Sebastien
The process number of a digraph has been introduced as a tool to study rerouting issues in WDM networks. We consider the recognition and the characterization of (di)graphs with process number at most...
Characterization of graphs and digraphs with small process number (2007)
Coudert, David, Sereni, Jean-Sebastien
The process number of a digraph has been introduced as a tool to study rerouting issues in WDM networks. We consider the recognition and the characterization of (di)graphs with process number at most...
Characterization of graphs and digraphs with small process number (2007)
Coudert, David, Sereni, Jean-Sebastien
The process number of a digraph has been introduced as a tool to study rerouting issues in \wdm networks. We consider the recognition and the characterization of (di)graphs with process number at...
Characterization of graphs and digraphs with small process number (2007)
Coudert, David, Sereni, Jean-Sebastien
The process number of a digraph has been introduced as a tool to study rerouting issues in \wdm networks. We consider the recognition and the characterization of (di)graphs with process number at...
Some Results on Non-deterministic Graph Searching in Trees (2007)
Amini, Omid, Coudert, David, Nisse, Nicolas
Pathwidth and treewidth of graphs have been extensively studied for their important structural and algorithmic aspects. Determining these parameters is NP-complete in general, however it becomes...
Some Results on Non-deterministic Graph Searching in Trees (2007)
Amini, Omid, Coudert, David, Nisse, Nicolas
Pathwidth and treewidth of graphs have been extensively studied for their important structural and algorithmic aspects. Determining these parameters is NP-complete in general, however it becomes...
Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues (2007)
Coudert, David, Perennes, Stephane, Rivano, Herve, Voge, Marie-Emilie
In this paper, we characterize polynomial cases for several combinatorial optimization problems in the context of multilayer networks with shared risk resource groups.
Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues (2007)
Coudert, David, Perennes, Stephane, Rivano, Herve, Voge, Marie-Emilie
In this paper, we characterize polynomial cases for several combinatorial optimization problems in the context of multilayer networks with shared risk resource groups.
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring (2007)
Bermond, Jean-Claude, Coudert, David, Leveque, Benjamin
Traffic grooming in a WDM network consists of assigning to each request (lightpath) a wavelength with the constraint that a given wavelength can carry at most C requests or equivalently a request...
Coudert, David, Huc, Florian, Peix, Fabrice, Voge, Marie-Emilie
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Division Multiplexing...
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring (2007)
Bermond, Jean-Claude, Coudert, David, Leveque, Benjamin
Traffic grooming in a WDM network consists of assigning to each request (lightpath) a wavelength with the constraint that a given wavelength can carry at most C requests or equivalently a request...
Coudert, David, Huc, Florian, Peix, Fabrice, Voge, Marie-Emilie
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Division Multiplexing...
Traffic Grooming on the Path (2007)
Bermond, Jean-Claude, Braud, Laurent, Coudert, David
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we will say that...
Traffic Grooming on the Path (2007)
Bermond, Jean-Claude, Braud, Laurent, Coudert, David
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we will say that...
Path-width of Outerplanar Graphs (2007)
David Coudert, Florian Huc, Jean-sébastien Sereni
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved that the pathwidth...
Shared Risk Resource Group: Complexity and Approximability issues (2007)
Coudert, David, Datta, P., Pérennes, Stéphane, Rivano, Hervé, Voge, Marie-Emilie
This article investigates complexity and approximability properties of combinatorial optimization problems yielded by the notion of Shared Risk Resource Group (SRRG). SRRG has been introduced in...
Shared Risk Resource Group: Complexity and Approximability issues (2007)
Coudert, David, Datta, P., Pérennes, Stéphane, Rivano, Hervé, Voge, Marie-Emilie
This article investigates complexity and approximability properties of combinatorial optimization problems yielded by the notion of Shared Risk Resource Group (SRRG). SRRG has been introduced in...
Traffic Grooming on the Path (2007)
Bermond, Jean-Claude, Braud, Laurent, Coudert, David
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we will say that...
Some Results on Non-deterministic Graph Searching in Trees (2007)
Amini, Omid, Coudert, David, Nisse, Nicolas
Pathwidth and treewidth of graphs have been extensively studied for their important structural and algorithmic aspects. Determining these parameters is NP-complete in general, however it becomes...
Shared Risk Resource Group: Complexity and Approximability issues (2007)
Coudert, David, Datta, P., Pérennes, Stéphane, Rivano, Hervé, Voge, Marie-Emilie
This article investigates complexity and approximability properties of combinatorial optimization problems yielded by the notion of Shared Risk Resource Group (SRRG). SRRG has been introduced in...
Coudert, David, Huc, Florian, Peix, Fabrice, Voge, Marie-Emilie
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Division Multiplexing...
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring (2007)
Bermond, Jean-Claude, Coudert, David, Leveque, Benjamin
Traffic grooming in a WDM network consists of assigning to each request (lightpath) a wavelength with the constraint that a given wavelength can carry at most C requests or equivalently a request...
Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues (2007)
Coudert, David, Perennes, Stephane, Rivano, Herve, Voge, Marie-Emilie
In this paper, we characterize polynomial cases for several combinatorial optimization problems in the context of multilayer networks with shared risk resource groups.
Traffic Grooming on the Path (2007)
Bermond, Jean-Claude, Braud, Laurent, Coudert, David
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we will say that...
Some Results on Non-deterministic Graph Searching in Trees (2007)
Amini, Omid, Coudert, David, Nisse, Nicolas
Pathwidth and treewidth of graphs have been extensively studied for their important structural and algorithmic aspects. Determining these parameters is NP-complete in general, however it becomes...
Shared Risk Resource Group: Complexity and Approximability issues (2007)
Coudert, David, Datta, P., Pérennes, Stéphane, Rivano, Hervé, Voge, Marie-Emilie
This article investigates complexity and approximability properties of combinatorial optimization problems yielded by the notion of Shared Risk Resource Group (SRRG). SRRG has been introduced in...
Coudert, David, Huc, Florian, Peix, Fabrice, Voge, Marie-Emilie
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Division Multiplexing...
Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring (2007)
Bermond, Jean-Claude, Coudert, David, Leveque, Benjamin
Traffic grooming in a WDM network consists of assigning to each request (lightpath) a wavelength with the constraint that a given wavelength can carry at most C requests or equivalently a request...
Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues (2007)
Coudert, David, Perennes, Stephane, Rivano, Herve, Voge, Marie-Emilie
In this paper, we characterize polynomial cases for several combinatorial optimization problems in the context of multilayer networks with shared risk resource groups.
Pathwidth of outerplanar graphs (2006)
Coudert, David, Huc, Florian, Sereni, Jean-Sébastien
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin, after having proved that the pathwidth of...
Complexity and approximability issues of Shared Risk Resource Group (2006)
Coudert, David, Datta, Pallab, Pérennes, Stéphane, Rivano, Hervé, Voge, Marie-Emilie
This article investigates the consequences of the Shared Risk Ressource Groups (SRRG) model on classical combinatorial concepts of network survivability. It focuses on complexity and approximability...
Pathwidth of outerplanar graphs (2006)
Coudert, David, Huc, Florian, Sereni, Jean-Sébastien
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin, after having proved that the pathwidth of...
Optimal Solution of the Maximum All Request Path Grooming Problem (2006)
Bermond, Jean-Claude, Cosnard, Michel, Coudert, David, Pérennes, Stéphane
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of...
Traffic Grooming on the Path (2006)
Bermond, Jean-Claude, Braud, Laurent, Coudert, David
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most $1/C$ of the bandwidth of the wavelength, we will say that...
Complexity and approximability issues of Shared Risk Resource Group (2006)
Coudert, David, Datta, Pallab, Pérennes, Stéphane, Rivano, Hervé, Voge, Marie-Emilie
This article investigates the consequences of the Shared Risk Ressource Groups (SRRG) model on classical combinatorial concepts of network survivability. It focuses on complexity and approximability...
Pathwidth of outerplanar graphs (2006)
Coudert, David, Huc, Florian, Sereni, Jean-Sébastien
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin, after having proved that the pathwidth of...
Optimal Solution of the Maximum All Request Path Grooming Problem (2006)
Bermond, Jean-Claude, Cosnard, Michel, Coudert, David, Pérennes, Stéphane
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of...
Traffic Grooming on the Path (2006)
Bermond, Jean-Claude, Braud, Laurent, Coudert, David
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most $1/C$ of the bandwidth of the wavelength, we will say that...
Traffic grooming in bidirectional WDM ring networks (2006)
Jean-claude Bermond, David Coudert, Xavier Muñoz, Ignasi Sau
We study the minimization of ADMs (Add-Drop Multiplexers) in Optical WDM Networks with Bidirectional Ring topology considering symmetric shortest path routing and all-to-all unitary requests. We...
Shared Risk Resource Groups and Survivability in Multilayer Networks (2006)
Coudert, David, Pérennes, Stéphane, Rivano, Hervé, Voge, Marie-Emilie
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures are designed assuming single failure cases, which is not adequate in present day multilayer...
Traffic Grooming in Bidirectional WDM Ring Networks (2006)
Bermond, Jean-Claude, Coudert, David, Munoz, Xavier, Sau, Ignasi
We study the minimization of ADMs (Add-Drop Multiplexers) in Optical WDM Networks with Bidirectional Ring topology considering symmetric shortest path routing and all-to-all unitary requests. We...
Optimal Solution of the Maximum All Request Path Grooming Problem (2006)
Bermond, Jean-Claude, Cosnard, Michel, Coudert, David, Perennes, Stephane
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of...
Shared Risk Resource Groups and Survivability in Multilayer Networks (2006)
Coudert, David, Pérennes, Stéphane, Rivano, Hervé, Voge, Marie-Emilie
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures are designed assuming single failure cases, which is not adequate in present day multilayer...
Traffic Grooming in Bidirectional WDM Ring Networks (2006)
Bermond, Jean-Claude, Coudert, David, Munoz, Xavier, Sau, Ignasi
We study the minimization of ADMs (Add-Drop Multiplexers) in Optical WDM Networks with Bidirectional Ring topology considering symmetric shortest path routing and all-to-all unitary requests. We...
Optimal Solution of the Maximum All Request Path Grooming Problem (2006)
Bermond, Jean-Claude, Cosnard, Michel, Coudert, David, Perennes, Stephane
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of...
Pathwidth of outerplanar graphs (2006)
Coudert, David, Huc, Florian, Sereni, Jean-Sebastien
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved that the pathwidth...
Bermond, Jean-Claude, Coudert, David
State-of-the-art on traffic grooming with a design theory approach
Pathwidth of outerplanar graphs (2006)
Coudert, David, Huc, Florian, Sereni, Jean-Sebastien
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved that the pathwidth...
Bermond, Jean-Claude, Coudert, David
State-of-the-art on traffic grooming with a design theory approach
Shared Risk Resource Groups and Survivability in Multilayer Networks (2006)
Coudert, David, Pérennes, Stéphane, Rivano, Hervé, Voge, Marie-Emilie
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures are designed assuming single failure cases, which is not adequate in present day multilayer...
Traffic Grooming in Bidirectional WDM Ring Networks (2006)
Bermond, Jean-Claude, Coudert, David, Munoz, Xavier, Sau, Ignasi
We study the minimization of ADMs (Add-Drop Multiplexers) in Optical WDM Networks with Bidirectional Ring topology considering symmetric shortest path routing and all-to-all unitary requests. We...
Optimal Solution of the Maximum All Request Path Grooming Problem (2006)
Bermond, Jean-Claude, Cosnard, Michel, Coudert, David, Perennes, Stephane
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of...
Complexity and approximability issues of Shared Risk Resource Group (2006)
Coudert, David, Datta, Pallab, Pérennes, Stéphane, Rivano, Hervé, Voge, Marie-Emilie
This article investigates the consequences of the Shared Risk Ressource Groups (SRRG) model on classical combinatorial concepts of network survivability. It focuses on complexity and approximability...
Pathwidth of outerplanar graphs (2006)
Coudert, David, Huc, Florian, Sereni, Jean-Sébastien
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin, after having proved that the pathwidth of...
Traffic Grooming on the Path (2006)
Bermond, Jean-Claude, Braud, Laurent, Coudert, David
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most $1/C$ of the bandwidth of the wavelength, we will say that...
Optimal Solution of the Maximum All Request Path Grooming Problem (2006)
Bermond, Jean-Claude, Cosnard, Michel, Coudert, David, Pérennes, Stéphane
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of...
Pathwidth of outerplanar graphs (2006)
Coudert, David, Huc, Florian, Sereni, Jean-Sebastien
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved that the pathwidth...
Bermond, Jean-Claude, Coudert, David
State-of-the-art on traffic grooming with a design theory approach
Shared Risk Resource Groups and Survivability in Multilayer Networks (2006)
Coudert, David, Pérennes, Stéphane, Rivano, Hervé, Voge, Marie-Emilie
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures are designed assuming single failure cases, which is not adequate in present day multilayer...
Traffic Grooming in Bidirectional WDM Ring Networks (2006)
Bermond, Jean-Claude, Coudert, David, Munoz, Xavier, Sau, Ignasi
We study the minimization of ADMs (Add-Drop Multiplexers) in Optical WDM Networks with Bidirectional Ring topology considering symmetric shortest path routing and all-to-all unitary requests. We...
Optimal Solution of the Maximum All Request Path Grooming Problem (2006)
Bermond, Jean-Claude, Cosnard, Michel, Coudert, David, Perennes, Stephane
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of...
Complexity and approximability issues of Shared Risk Resource Group (2006)
Coudert, David, Datta, Pallab, Pérennes, Stéphane, Rivano, Hervé, Voge, Marie-Emilie
This article investigates the consequences of the Shared Risk Ressource Groups (SRRG) model on classical combinatorial concepts of network survivability. It focuses on complexity and approximability...
Pathwidth of outerplanar graphs (2006)
Coudert, David, Huc, Florian, Sereni, Jean-Sébastien
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin, after having proved that the pathwidth of...
Traffic Grooming on the Path (2006)
Bermond, Jean-Claude, Braud, Laurent, Coudert, David
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most $1/C$ of the bandwidth of the wavelength, we will say that...
Optimal Solution of the Maximum All Request Path Grooming Problem (2006)
Bermond, Jean-Claude, Cosnard, Michel, Coudert, David, Pérennes, Stéphane
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of...
Optimal Solution of the Maximum All Request Path Grooming Problem (2005)
Bermond, Jean-Claude, Cosnard, Michel, Coudert, David, Pérennes, Stéphane
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of...
Traffic Grooming on the Path (2005)
Bermond, Jean-Claude, Braud, Laurent, Coudert, David
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most $1/C$ of the bandwidth of the wavelength, we will say that...
Rerouting requests in WDM networks (2005)
Coudert, David, Perennes, Stephane, Pham, Quang-Cuong, Sereni, Jean-Sebastien
We model a problem related to routing reconfiguration in WDM networks. We establish some similarities and differ- ences with two other known problems: the pathwidth and the pursuit problem. We then...
Traffic Grooming on the Path (2005)
Bermond, Jean-Claude, Braud, Laurent, Coudert, David
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we will say that...
Rerouting requests in WDM networks (2005)
Coudert, David, Perennes, Stephane, Pham, Quang-Cuong, Sereni, Jean-Sebastien
We model a problem related to routing reconfiguration in WDM networks. We establish some similarities and differ- ences with two other known problems: the pathwidth and the pursuit problem. We then...
Traffic Grooming on the Path (2005)
Bermond, Jean-Claude, Braud, Laurent, Coudert, David
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we will say that...
Bermond, Jean-Claude, J. Colbourn, Charles, Coudert, David, Ge, Gennian, C. H. Ling, Alan, Munoz, Xavier
SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a grooming, consisting of unions of primitive rings. The cost of such a...
Bermond, Jean-Claude, J. Colbourn, Charles, Coudert, David, Ge, Gennian, C. H. Ling, Alan, Munoz, Xavier
SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a grooming, consisting of unions of primitive rings. The cost of such a...
Rerouting requests in WDM networks (2005)
Coudert, David, Perennes, Stephane, Pham, Quang-Cuong, Sereni, Jean-Sebastien
We model a problem related to routing reconfiguration in WDM networks. We establish some similarities and differ- ences with two other known problems: the pathwidth and the pursuit problem. We then...
Traffic Grooming on the Path (2005)
Bermond, Jean-Claude, Braud, Laurent, Coudert, David
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we will say that...
Bermond, Jean-Claude, J. Colbourn, Charles, Coudert, David, Ge, Gennian, C. H. Ling, Alan, Munoz, Xavier
SONET/WDM networks using wavelength add-drop multiplexing can be constructed using certain graph decompositions used to form a grooming, consisting of unions of primitive rings. The cost of such a...
Rerouting requests in WDM networks (2005)
Coudert, David, Perennes, Stephane, Pham, Quang-Cuong, Sereni, Jean-Sebastien
We model a problem related to routing reconfiguration in WDM networks. We establish some similarities and differ- ences with two other known problems: the pathwidth and the pursuit problem. We then...
Traffic Grooming on the Path (2005)
Bermond, Jean-Claude, Braud, Laurent, Coudert, David
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we will say that...
Traffic grooming in unidirectional WDM ring networks using design theory (2003)
Jean-claude Bermond, David Coudert, Ieee Member
We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. We show that this...
Traffic grooming in unidirectional WDM ring networks using design theory (2003)
Jean-claude Bermond, David Coudert, Ieee Member
We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. We show that this...
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem (2003)
David Coudert, Herve Rivano, Xavier Roche
This work is motivated by the need for approximation algorithms for the integral multicommodity ow problem which arise in numerous optimization scenarios, including the design of telecommunication...
Traffic Grooming in Unidirectional WDM Ring (2003)
Networks Using Design, Jean-claude Bermond, David Coudert, Ieee Member
We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. We show that this...
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem (2003)
Coudert, David, Rivano, Herve, Roche, Xavier
This work is motivated by the need for approximation algorithms for the integral multicommodity flow problem which arise in numerous optimization scenarios, including the design of telecommunication...
Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case (2003)
Bermond, Jean-Claude, Coudert, David, Munoz, Xavier
We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. This problem...
Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory (2003)
Bermond, Jean-Claude, Coudert, David
We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. We show that...
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem (2003)
Coudert, David, Rivano, Herve, Roche, Xavier
This work is motivated by the need for approximation algorithms for the integral multicommodity flow problem which arise in numerous optimization scenarios, including the design of telecommunication...
Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case (2003)
Bermond, Jean-Claude, Coudert, David, Munoz, Xavier
We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. This problem...
Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory (2003)
Bermond, Jean-Claude, Coudert, David
We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. We show that...
Graph Theory and Traffic Grooming in WDM Rings (2003)
This paper has a double purpose. In the first part of the paper we give an overview of different aspects of graph theory which can be applied in communication engineering, not trying to present...
On DRC-covering of Kn by cycles (2003)
Bermond, Jean-Claude, Coudert, David, Yu, Min-Li
This paper considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on INF-networks which are protected independently from...
Graph Theory and Traffic Grooming in WDM Rings (2003)
This paper has a double purpose. In the first part of the paper we give an overview of different aspects of graph theory which can be applied in communication engineering, not trying to present...
On DRC-covering of Kn by cycles (2003)
Bermond, Jean-Claude, Coudert, David, Yu, Min-Li
This paper considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on INF-networks which are protected independently from...
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem (2003)
Coudert, David, Rivano, Herve, Roche, Xavier
This work is motivated by the need for approximation algorithms for the integral multicommodity flow problem which arise in numerous optimization scenarios, including the design of telecommunication...
Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case (2003)
Bermond, Jean-Claude, Coudert, David, Munoz, Xavier
We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. This problem...
Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory (2003)
Bermond, Jean-Claude, Coudert, David
We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. We show that...
Graph Theory and Traffic Grooming in WDM Rings (2003)
This paper has a double purpose. In the first part of the paper we give an overview of different aspects of graph theory which can be applied in communication engineering, not trying to present...
On DRC-covering of Kn by cycles (2003)
Bermond, Jean-Claude, Coudert, David, Yu, Min-Li
This paper considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on INF-networks which are protected independently from...
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem (2003)
Coudert, David, Rivano, Herve, Roche, Xavier
This work is motivated by the need for approximation algorithms for the integral multicommodity flow problem which arise in numerous optimization scenarios, including the design of telecommunication...
Traffic Grooming in Unidirectional WDM Ring Networks: the all-to-all unitary case (2003)
Bermond, Jean-Claude, Coudert, David, Munoz, Xavier
We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. This problem...
Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory (2003)
Bermond, Jean-Claude, Coudert, David
We address the problem of traffic grooming in WDM rings with all-to-all uniform unitary traffic. We want to minimize the total number of SONET add-drop multiplexers (ADMs) required. We show that...
Lightpath assignment for multifibers wdm optical networks with wavelength translators (2002)
We consider the problem of finding a lightpath assignment for a given set of communication requests on a multifiber WDM optical network with wavelength translators. Given such a network, and w the...
Lightpath assignment for multifibers wdm optical networks with wavelength translators (2002)
We consider the problem of finding a lightpath assignment for a given set of communication requests on a multifiber WDM optical network with wavelength translators. Given such a network, and w the...
Lightpath assignment for multifibers wdm optical networks with wavelength translators (2002)
We consider the problem of finding a lightpath assignment for a given set of communication requests on a multifiber WDM optical network with wavelength translators. Given such a network, and w the...
Lightpath assignment for multifibers WDM optical networks with wavelength translators (2002)
David Coudert, Herve Rivano, Student Member, Student Member, A. Wdm Optical Routing
Abstract--- We consider the problem of finding a lightpath assignment for a given set of communication requests on a multifiber WDM optical network with wavelength translators. Given such a network,...
Lightpath assignment for multifibers wdm networks with wavelength translators (2002)
David Coudert, Herve Rivano, Student Member, Student Member
Abstract--- We consider the problem of finding a lightpath assignment for a given set of communication requests on a multifiber WDM optical network with wavelength translators. Given such a network,...
Routage optique dans les réseaux WDM multifibres avec conversion partielle (2002)
Nous considérons le problème du routage optique d'un ensemble donné de requêtes de communications dans un réseau WDM multifibres avec conversion partielle. Étant donné un tel réseau disposant...
Lightpath assignment for multifibers WDM networks with wavelength translators (2002)
We consider the problem of finding a lightpath assignment for a given set of communication requests on a multifiber WDM optical network with wavelength translators. Given such a network and w, the...
Routage optique dans les réseaux WDM multifibres avec conversion partielle (2002)
Nous considérons le problème du routage optique d'un ensemble donné de requêtes de communications dans un réseau WDM multifibres avec conversion partielle. Étant donné un tel réseau disposant...
Lightpath assignment for multifibers WDM networks with wavelength translators (2002)
We consider the problem of finding a lightpath assignment for a given set of communication requests on a multifiber WDM optical network with wavelength translators. Given such a network and w, the...
Isomorphisms of the De Bruijn digraph and free-space optical networks (2002)
Coudert, David, Ferreira, Afonso, Perennes, Stephane
The de Bruijn digraph B(d, D) has degree d, diameter D, dD vertices, and dD+1 arcs. It is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left-shift permutation...
Isomorphisms of the De Bruijn digraph and free-space optical networks (2002)
Coudert, David, Ferreira, Afonso, Perennes, Stephane
The de Bruijn digraph B(d, D) has degree d, diameter D, dD vertices, and dD+1 arcs. It is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left-shift permutation...
Routage optique dans les réseaux WDM multifibres avec conversion partielle (2002)
Nous considérons le problème du routage optique d'un ensemble donné de requêtes de communications dans un réseau WDM multifibres avec conversion partielle. Étant donné un tel réseau disposant...
Lightpath assignment for multifibers WDM networks with wavelength translators (2002)
We consider the problem of finding a lightpath assignment for a given set of communication requests on a multifiber WDM optical network with wavelength translators. Given such a network and w, the...
Lightpath assignment for multifibers wdm optical networks with wavelength translators (2002)
We consider the problem of finding a lightpath assignment for a given set of communication requests on a multifiber WDM optical network with wavelength translators. Given such a network, and w the...
Isomorphisms of the De Bruijn digraph and free-space optical networks (2002)
Coudert, David, Ferreira, Afonso, Perennes, Stephane
The de Bruijn digraph B(d, D) has degree d, diameter D, dD vertices, and dD+1 arcs. It is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left-shift permutation...
Routage optique dans les réseaux WDM multifibres avec conversion partielle (2002)
Nous considérons le problème du routage optique d'un ensemble donné de requêtes de communications dans un réseau WDM multifibres avec conversion partielle. Étant donné un tel réseau disposant...
Lightpath assignment for multifibers WDM networks with wavelength translators (2002)
We consider the problem of finding a lightpath assignment for a given set of communication requests on a multifiber WDM optical network with wavelength translators. Given such a network and w, the...
Lightpath assignment for multifibers wdm optical networks with wavelength translators (2002)
We consider the problem of finding a lightpath assignment for a given set of communication requests on a multifiber WDM optical network with wavelength translators. Given such a network, and w the...
Algorithmique et optimisation de réseaux de communications optiques (2001)
Dans cette thèse, nous nous intéressons aux réseaux de communications optiques avec d'une part des réseaux en espace libre optique et d'autre part des réseaux à fibres optiques. Dans un premier...
Algorithmique et optimisation de réseaux de communications optiques (2001)
Dans cette thèse, nous nous intéressons aux réseaux de communications optiques avec d'une part des réseaux en espace libre optique et d'autre part des réseaux à fibres optiques.Dans un premier...
Algorithmique et optimisation de réseaux de communications optiques (2001)
Dans cette thèse, nous nous intéressons aux réseaux de communications optiques avec d'une part des réseaux en espace libre optique et d'autre part des réseaux à fibres optiques.Dans un premier...
On DRC-Covering of K_n by Cycles (2001)
Bermond, Jean-Claude, Coudert, David, Yu, Min-Li
This work considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on sub-networks which are protected independently from each...
Algorithmique et optimisation de réseaux de communications optiques (2001)
Dans cette thèse, nous nous intéressons aux réseaux de communications optiques avec d'une part des réseaux en espace libre optique et d'autre part des réseaux à fibres optiques. Dans un premier...
On DRC-Covering of K_n by Cycles (2001)
Bermond, Jean-Claude, Coudert, David, Yu, Min-Li
This work considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on sub-networks which are protected independently from each...
Algorithmique et optimisation de réseaux de communications optiques (2001)
Dans cette thèse, nous nous intéressons aux réseaux de communications optiques avec d'une part des réseaux en espace libre optique et d'autre part des réseaux à fibres optiques. Dans un premier...
Algorithmique et optimisation de réseaux de communications optiques (2001)
Dans cette thèse, nous nous intéressons aux réseaux de communications optiques avec d'une part des réseaux en espace libre optique et d'autre part des réseaux à fibres optiques. Dans un premier...
How Graph Theory can help Communications Engineering (2001)
We give an overview of different aspects of graph theory which can be applied in communication engineering, not trying to present immediate results to be applied neither a complete survey of results,...
Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications (2001)
Cette étude s'intèresse à la planification de réseaux de télécommunications tolérants aux pannes. Nous cherchons à établir, pour chaque couple de noeuds du réseau, deux chemins de...
Bermond, Jean-Claude, Chacon, Lilian, Coudert, David, Tillerot, Francois
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on the case where the...
A note on cycle covering (2001)
Bermond, Jean-Claude, Coudert, David, Chacon, Lilian, Tillerot, Francois
This study considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other.
How Graph Theory can help Communications Engineering (2001)
We give an overview of different aspects of graph theory which can be applied in communication engineering, not trying to present immediate results to be applied neither a complete survey of results,...
Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications (2001)
Cette étude s'intèresse à la planification de réseaux de télécommunications tolérants aux pannes. Nous cherchons à établir, pour chaque couple de noeuds du réseau, deux chemins de...
Bermond, Jean-Claude, Chacon, Lilian, Coudert, David, Tillerot, Francois
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on the case where the...
A note on cycle covering (2001)
Bermond, Jean-Claude, Coudert, David, Chacon, Lilian, Tillerot, Francois
This study considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other.
Algorithmique et optimisation de réseaux de communications optiques (2001)
Dans cette thèse, nous nous intéressons aux réseaux de communications optiques avec d'une part des réseaux en espace libre optique et d'autre part des réseaux à fibres optiques.Dans un premier...
How Graph Theory can help Communications Engineering (2001)
We give an overview of different aspects of graph theory which can be applied in communication engineering, not trying to present immediate results to be applied neither a complete survey of results,...
Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications (2001)
Cette étude s'intèresse à la planification de réseaux de télécommunications tolérants aux pannes. Nous cherchons à établir, pour chaque couple de noeuds du réseau, deux chemins de...
Bermond, Jean-Claude, Chacon, Lilian, Coudert, David, Tillerot, Francois
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on the case where the...
A note on cycle covering (2001)
Bermond, Jean-Claude, Coudert, David, Chacon, Lilian, Tillerot, Francois
This study considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other.
On DRC-Covering of K_n by Cycles (2001)
Bermond, Jean-Claude, Coudert, David, Yu, Min-Li
This work considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on sub-networks which are protected independently from each...
Algorithmique et optimisation de réseaux de communications optiques (2001)
Dans cette thèse, nous nous intéressons aux réseaux de communications optiques avec d'une part des réseaux en espace libre optique et d'autre part des réseaux à fibres optiques.Dans un premier...
How Graph Theory can help Communications Engineering (2001)
We give an overview of different aspects of graph theory which can be applied in communication engineering, not trying to present immediate results to be applied neither a complete survey of results,...
Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications (2001)
Cette étude s'intèresse à la planification de réseaux de télécommunications tolérants aux pannes. Nous cherchons à établir, pour chaque couple de noeuds du réseau, deux chemins de...
Bermond, Jean-Claude, Chacon, Lilian, Coudert, David, Tillerot, Francois
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on the case where the...
A note on cycle covering (2001)
Bermond, Jean-Claude, Coudert, David, Chacon, Lilian, Tillerot, Francois
This study considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other.
On DRC-Covering of K_n by Cycles (2001)
Bermond, Jean-Claude, Coudert, David, Yu, Min-Li
This work considers the cycle covering of complete graphs motivated by the design of survivable WDM networks, where the requests are routed on sub-networks which are protected independently from each...
Algorithmique et optimisation de réseaux de communications optiques (2001)
Dans cette thèse, nous nous intéressons aux réseaux de communications optiques avec d'une part des réseaux en espace libre optique et d'autre part des réseaux à fibres optiques.Dans un premier...
De Bruijn isomorphisms and free space optical networks (2000)
Coudert, David, Ferreira, Afonso, Perennes, Stephane
The de Bruijn digraph B(d, D) is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left shift permutation on the words, after which the rightmost symbol is changed....
De Bruijn isomorphisms and free space optical networks (2000)
Coudert, David, Ferreira, Afonso, Perennes, Stephane
The de Bruijn digraph B(d, D) is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left shift permutation on the words, after which the rightmost symbol is changed....
A multihop multi-OPS optical interconnection network (2000)
Coudert, David, Ferreira, Afonso, Munoz, Xavier
In this paper, we study the design of regular multicast networks implemented with optical passive star (OPS) couplers. We focus on an architecture based on both Kautz graphs and stack-graphs, and...
Coudert, David, Ferreira, Afonso, Munoz, Xavier
Many results exist in the literature describing technological and theoretical advances in optical network topologies and design. However, an essential effort has yet to be done in linking those...
A multihop multi-OPS optical interconnection network (2000)
Coudert, David, Ferreira, Afonso, Munoz, Xavier
In this paper, we study the design of regular multicast networks implemented with optical passive star (OPS) couplers. We focus on an architecture based on both Kautz graphs and stack-graphs, and...
Coudert, David, Ferreira, Afonso, Munoz, Xavier
Many results exist in the literature describing technological and theoretical advances in optical network topologies and design. However, an essential effort has yet to be done in linking those...
Conception d'un réseau WDM protégé par sous-réseaux (2000)
Bermond, Jean-Claude, Chacon, Lilian, Coudert, David, Tillerot, Francois
Nous proposons une modélisation de la construction d'un réseau WDM protégé comme l'extension du problème classique de couverture des arêtes d'un graphe. Un ensemble de résultats est donné...
Conception d'un réseau WDM protégé par sous-réseaux (2000)
Bermond, Jean-Claude, Chacon, Lilian, Coudert, David, Tillerot, Francois
Nous proposons une modélisation de la construction d'un réseau WDM protégé comme l'extension du problème classique de couverture des arêtes d'un graphe. Un ensemble de résultats est donné...
Conception d'un réseau WDM protégé par sous-réseaux (2000)
Bermond, Jean-Claude, Chacon, Lilian, Coudert, David, Tillerot, Francois
Nous proposons une modélisation de la construction d'un réseau WDM protégé comme l'extension du problème classique de couverture des arêtes d'un graphe. Un ensemble de résultats est donné...
A multihop multi-OPS optical interconnection network (2000)
Coudert, David, Ferreira, Afonso, Munoz, Xavier
In this paper, we study the design of regular multicast networks implemented with optical passive star (OPS) couplers. We focus on an architecture based on both Kautz graphs and stack-graphs, and...
Coudert, David, Ferreira, Afonso, Munoz, Xavier
Many results exist in the literature describing technological and theoretical advances in optical network topologies and design. However, an essential effort has yet to be done in linking those...
De Bruijn isomorphisms and free space optical networks (2000)
Coudert, David, Ferreira, Afonso, Perennes, Stephane
The de Bruijn digraph B(d, D) is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left shift permutation on the words, after which the rightmost symbol is changed....
Conception d'un réseau WDM protégé par sous-réseaux (2000)
Bermond, Jean-Claude, Chacon, Lilian, Coudert, David, Tillerot, Francois
Nous proposons une modélisation de la construction d'un réseau WDM protégé comme l'extension du problème classique de couverture des arêtes d'un graphe. Un ensemble de résultats est donné...
A multihop multi-OPS optical interconnection network (2000)
Coudert, David, Ferreira, Afonso, Munoz, Xavier
In this paper, we study the design of regular multicast networks implemented with optical passive star (OPS) couplers. We focus on an architecture based on both Kautz graphs and stack-graphs, and...
Coudert, David, Ferreira, Afonso, Munoz, Xavier
Many results exist in the literature describing technological and theoretical advances in optical network topologies and design. However, an essential effort has yet to be done in linking those...
De Bruijn isomorphisms and free space optical networks (2000)
Coudert, David, Ferreira, Afonso, Perennes, Stephane
The de Bruijn digraph B(d, D) is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left shift permutation on the words, after which the rightmost symbol is changed....
Digraph Isomorphisms and Free Space Optical Networks (1999)
Coudert, David, Ferreira, Afonso, Pérennes, Stéphane
The de Bruijn digraph B(d,D) is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left shift permutation on the words, after which the rightmost symbol is changed....
Digraph Isomorphisms and Free Space Optical Networks (1999)
Coudert, David, Ferreira, Afonso, Pérennes, Stéphane
The de Bruijn digraph B(d,D) is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left shift permutation on the words, after which the rightmost symbol is changed....
Theoretical Aspects of the Optical Transpose Interconnecting System Architecture (1999)
Coudert, David, Ferreira, Afonso, Perennes, Stephane
An attractive way of implementing efficient local interconnection networks is to use the Optical Transpose Interconnecting System (OTIS) architecture proposed in [8]. This system allows to optically...
OTIS-Based Multi-Hop Multi-OPS Lightwave Networks (1999)
Coudert, David, Ferreira, Afonso, Munoz, Xavier
Advances in optical technology, such as low loss Optical Passive Star couplers (OPS) and the possibility of building tunable optical transmitters and receivers have increased the interest for...
Theoretical Aspects of the Optical Transpose Interconnecting System Architecture (1999)
Coudert, David, Ferreira, Afonso, Perennes, Stephane
An attractive way of implementing efficient local interconnection networks is to use the Optical Transpose Interconnecting System (OTIS) architecture proposed in [8]. This system allows to optically...
OTIS-Based Multi-Hop Multi-OPS Lightwave Networks (1999)
Coudert, David, Ferreira, Afonso, Munoz, Xavier
Advances in optical technology, such as low loss Optical Passive Star couplers (OPS) and the possibility of building tunable optical transmitters and receivers have increased the interest for...
Theoretical Aspects of the Optical Transpose Interconnecting System Architecture (1999)
Coudert, David, Ferreira, Afonso, Perennes, Stephane
An attractive way of implementing efficient local interconnection networks is to use the Optical Transpose Interconnecting System (OTIS) architecture proposed in [8]. This system allows to optically...
OTIS-Based Multi-Hop Multi-OPS Lightwave Networks (1999)
Coudert, David, Ferreira, Afonso, Munoz, Xavier
Advances in optical technology, such as low loss Optical Passive Star couplers (OPS) and the possibility of building tunable optical transmitters and receivers have increased the interest for...
Digraph Isomorphisms and Free Space Optical Networks (1999)
Coudert, David, Ferreira, Afonso, Pérennes, Stéphane
The de Bruijn digraph B(d,D) is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left shift permutation on the words, after which the rightmost symbol is changed....
Theoretical Aspects of the Optical Transpose Interconnecting System Architecture (1999)
Coudert, David, Ferreira, Afonso, Perennes, Stephane
An attractive way of implementing efficient local interconnection networks is to use the Optical Transpose Interconnecting System (OTIS) architecture proposed in [8]. This system allows to optically...
OTIS-Based Multi-Hop Multi-OPS Lightwave Networks (1999)
Coudert, David, Ferreira, Afonso, Munoz, Xavier
Advances in optical technology, such as low loss Optical Passive Star couplers (OPS) and the possibility of building tunable optical transmitters and receivers have increased the interest for...
Digraph Isomorphisms and Free Space Optical Networks (1999)
Coudert, David, Ferreira, Afonso, Pérennes, Stéphane
The de Bruijn digraph B(d,D) is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left shift permutation on the words, after which the rightmost symbol is changed....
David Coudert, Afonso Ferreira, Xavier Muoz
Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. In this paper we propose a passive...
David Coudert, Afonso Ferreira
Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. In this paper we propose a passive...
Coudert, David, Ferreira, Afonso, Munoz, Xavier
Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. We propose a passive star multi-hop...
Coudert, David, Ferreira, Afonso, Munoz, Xavier
Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. We propose a passive star multi-hop...
Coudert, David, Ferreira, Afonso, Munoz, Xavier
Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. We propose a passive star multi-hop...
Coudert, David, Ferreira, Afonso, Munoz, Xavier
Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. We propose a passive star multi-hop...