MPLS label stacking on the line network (2009)
Bermond, Jean-Claude, Coudert, David, Moulierac, Joanna, Perennes, Stephane, Rivano, Hervé, 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, Hervé, 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...
Degree-Constrained Subgraph Problems: Hardness and Approximation Results (2008)
Amini, Omid, Peleg, David, Perennes, Stephane, Sau Valls, Ignasi, Saurabh, Saket
A general instance of a Degree-Constrained Subgraph problem consists of an edge-weighted or vertex-weighted graph G and the objective is to find an optimal weighted subgraph, subject to certain...
Degree-Constrained Subgraph Problems: Hardness and Approximation Results (2008)
Amini, Omid, Peleg, David, Perennes, Stephane, Sau Valls, Ignasi, Saurabh, Saket
A general instance of a Degree-Constrained Subgraph problem consists of an edge-weighted or vertex-weighted graph G and the objective is to find an optimal weighted subgraph, subject to certain...
Shared Risk Resource Groups and Colored Graph: Polynomial Cases and Transformation Issues (2007)
Coudert, David, Perennes, Stephane, Rivano, Hervé, 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, Hervé, 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.
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...
Hardness and approximation of gathering in static radio networks (2006)
Bermond, Jean-Claude, Galtier, Jérôme, Klasing, Ralf, Morales, Nelson, Perennes, Stephane
In this paper, we address the problem of gathering information in a specific node (or \emph{sink}) of a radio network, where interference constraints are present. We take into account the fact that,...
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...
Hardness and approximation of gathering in static radio networks (2006)
Bermond, Jean-Claude, Galtier, Jérôme, Klasing, Ralf, Morales, Nelson, Perennes, Stephane
In this paper, we address the problem of gathering information in a specific node (or \emph{sink}) of a radio network, where interference constraints are present. We take into account the fact 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...
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...
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...
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....
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...
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...