Christelle Caillouet, Florian Huc, Nicolas Nisse, Stéphane Pérennes, Hervé Rivano
Abstract—In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local algorithm that...
P2P Storage Systems: Data Life Time for Different Placement Policies (2010)
Caron, Stéphane, Giroire, Frédéric, Mazauric, Dorian, Monteiro, Julian, Pérennes, Stéphane
Peer-to-peer systems are foreseen as an efficient solution to achieve reliable data storage at low cost. To deal with common P2P problems such as peer failures or churn, such systems encode the user...
P2P Storage Systems: Data Life Time for Different Placement Policies (2010)
Caron, Stéphane, Giroire, Frédéric, Mazauric, Dorian, Monteiro, Julian, Pérennes, Stéphane
Peer-to-peer systems are foreseen as an efficient solution to achieve reliable data storage at low cost. To deal with common P2P problems such as peer failures or churn, such systems encode the user...
P2P Storage Systems: Data Life Time for Different Placement Policies (2010)
Caron, Stéphane, Giroire, Frédéric, Mazauric, Dorian, Monteiro, Julian, Pérennes, Stéphane
Peer-to-peer systems are foreseen as an efficient solution to achieve reliable data storage at low cost. To deal with common P2P problems such as peer failures or churn, such systems encode the user...
P2P Storage Systems: Data Life Time for Different Placement Policies (2010)
Caron, Stéphane, Giroire, Frédéric, Mazauric, Dorian, Monteiro, Julian, Pérennes, Stéphane
Peer-to-peer systems are foreseen as an efficient solution to achieve reliable data storage at low cost. To deal with common P2P problems such as peer failures or churn, such systems encode the user...
Computing the average path length and a label-based routing in a small-world graph (2010)
Giabbanelli, Philippe, Mazauric, Dorian, Pérennes, Stéphane
We study two characteristics of a small-world graph proposed by Zhang et al. to model complex networks. Our study relies on the recursive structure of the graph. Firstly, we use it to design a...
Computing the average path length and a label-based routing in a small-world graph (2010)
Giabbanelli, Philippe, Mazauric, Dorian, Pérennes, Stéphane
We study two characteristics of a small-world graph proposed by Zhang et al. to model complex networks. Our study relies on the recursive structure of the graph. Firstly, we use it to design a...
P2P Storage Systems: Data Life Time for Different Placement Policies (2010)
Caron, Stéphane, Giroire, Frédéric, Mazauric, Dorian, Monteiro, Julian, Pérennes, Stéphane
Les systèmes pair-à-pair à grande échelle représentent un moyen fiable pour stocker des données à faible coût. Afin d'assurer la pérennité des données des utilisateurs, il est nécessaire...
P2P Storage Systems: Data Life Time for Different Placement Policies (2010)
Caron, Stéphane, Giroire, Frédéric, Mazauric, Dorian, Monteiro, Julian, Pérennes, Stéphane
Les systèmes pair-à-pair à grande échelle représentent un moyen fiable pour stocker des données à faible coût. Afin d'assurer la pérennité des données des utilisateurs, il est nécessaire...
Minimal selectors and fault tolerant networks (2010)
Amini, Omid, Giroire, Frédéric, Huc, Florian, Pérennes, Stéphane
In this paper we study a combinatorial optimization problem issued from on-board networks in satellites. In this kind of networks the entering signals (inputs) should be routed to amplifiers...
Minimal selectors and fault tolerant networks (2010)
Amini, Omid, Giroire, Frédéric, Huc, Florian, Pérennes, Stéphane
In this paper we study a combinatorial optimization problem issued from on-board networks in satellites. In this kind of networks the entering signals (inputs) should be routed to amplifiers...
P2P Storage Systems: How Much Locality Can They Tolerate? (2009)
Giroire, Frederic, Monteiro, Julian, Pérennes, Stéphane
Large scale peer-to-peer systems are foreseen as a way to provide highly reliable data storage at low cost. To achieve high durability, such P2P systems encode the user data in a set of redundant...
P2P Storage Systems: How Much Locality Can They Tolerate? (2009)
Giroire, Frederic, Monteiro, Julian, Pérennes, Stéphane
Large scale peer-to-peer systems are foreseen as a way to provide highly reliable data storage at low cost. To achieve high durability, such P2P systems encode the user data in a set of redundant...
Stability of a local greedy distributed routing algorithm (2009)
Huc, Florian, Molle, Christelle, Nisse, Nicolas, Pérennes, Stéphane, Rivano, Hervé
In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We provide a distributed and local algorithm that transmits...
Stability of a local greedy distributed routing algorithm (2009)
Huc, Florian, Molle, Christelle, Nisse, Nicolas, Pérennes, Stéphane, Rivano, Hervé
In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We provide a distributed and local algorithm that transmits...
Fractional Path Coloring in Bounded Degree Trees with Applications (2009)
Caragiannis, I., Ferreira, Afonso, Kaklamanis, C., Pérennes, Stéphane, Rivano, Hervé
This paper studies the natural linear programming relaxation of the path coloring problem. We prove constructively that finding an optimal fractional path coloring is Fixed Parameter Tractable (FPT),...
Fractional Path Coloring in Bounded Degree Trees with Applications (2009)
Caragiannis, I., Ferreira, Afonso, Kaklamanis, C., Pérennes, Stéphane, Rivano, Hervé
This paper studies the natural linear programming relaxation of the path coloring problem. We prove constructively that finding an optimal fractional path coloring is Fixed Parameter Tractable (FPT),...
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...
Analyse des Corrélations entre Pannes dans les Systèmes de Stockage Pair-à-Pair (2009)
Dalle, Olivier, Giroire, Frédéric, Monteiro, Julian, Pérennes, Stéphane
Dans cet article, nous présentons et étudions des modèles analytiques de systèmes de stockage pair-à-pair fiables à long terme. Les pairs sont sujets à des pannes définitives (défaillance du...
Analyse des Corrélations entre Pannes dans les Systèmes de Stockage Pair-à-Pair (2009)
Dalle, Olivier, Giroire, Frédéric, Monteiro, Julian, Pérennes, Stéphane
Dans cet article, nous présentons et étudions des modèles analytiques de systèmes de stockage pair-à-pair fiables à long terme. Les pairs sont sujets à des pannes définitives (défaillance du...
Directed acyclic graphs with the unique dipath property (2009)
Bermond, Jean-Claude, Cosnard, Michel, Pérennes, Stéphane
Let P be a family of dipaths of a DAG (Directed Acyclic Graph) G. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G,...
Directed acyclic graphs with the unique dipath property (2009)
Bermond, Jean-Claude, Cosnard, Michel, Pérennes, Stéphane
Let P be a family of dipaths of a DAG (Directed Acyclic Graph) G. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G,...
P2P Storage Systems: How Much Locality Can They Tolerate? (2009)
Giroire, Frédéric, Monteiro, Julian, Pérennes, Stéphane
Large scale peer-to-peer systems are foreseen as a way to provide highly reliable data storage at low cost. To achieve high durability, such P2P systems encode the user data in a set of redundant...
P2P Storage Systems: How Much Locality Can They Tolerate? (2009)
Giroire, Frédéric, Monteiro, Julian, Pérennes, Stéphane
Large scale peer-to-peer systems are foreseen as a way to provide highly reliable data storage at low cost. To achieve high durability, such P2P systems encode the user data in a set of redundant...
Stability of a local greedy distributed routing algorithm (2009)
Huc, Florian, Molle, Christelle, Nisse, Nicolas, Pérennes, Stéphane, Rivano, Hervé
In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We provide a distributed and local algorithm that transmits...
Stability of a local greedy distributed routing algorithm (2009)
Huc, Florian, Molle, Christelle, Nisse, Nicolas, Pérennes, Stéphane, Rivano, Hervé
In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We provide a distributed and local algorithm that transmits...
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...
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...
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...
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...
Stability of a local greedy distributed routing algorithm (2009)
Huc, Florian, Molle, Christelle, Nisse, Nicolas, Pérennes, Stéphane, Rivano, Hervé
In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We provide a distributed and local algorithm that transmits...
P2P Storage Systems: How Much Locality Can They Tolerate? (2009)
Giroire, Frédéric, Monteiro, Julian, Pérennes, Stéphane
Large scale peer-to-peer systems are foreseen as a way to provide highly reliable data storage at low cost. To achieve high durability, such P2P systems encode the user data in a set of redundant...
Directed acyclic graphs with the unique dipath property (2009)
Bermond, Jean-Claude, Cosnard, Michel, Pérennes, Stéphane
Let P be a family of dipaths of a DAG (Directed Acyclic Graph) G. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G,...
Analyse des Corrélations entre Pannes dans les Systèmes de Stockage Pair-à-Pair (2009)
Dalle, Olivier, Giroire, Frédéric, Monteiro, Julian, Pérennes, Stéphane
Dans cet article, nous présentons et étudions des modèles analytiques de systèmes de stockage pair-à-pair fiables à long terme. Les pairs sont sujets à des pannes définitives (défaillance du...
Fractional Path Coloring in Bounded Degree Trees with Applications (2009)
Caragiannis, I., Ferreira, Afonso, Kaklamanis, C., Pérennes, Stéphane, Rivano, Hervé
This paper studies the natural linear programming relaxation of the path coloring problem. We prove constructively that finding an optimal fractional path coloring is Fixed Parameter Tractable (FPT),...
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...
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...
Stability of a local greedy distributed routing algorithm (2009)
Huc, Florian, Molle, Christelle, Nisse, Nicolas, Pérennes, Stéphane, Rivano, Hervé
In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We provide a distributed and local algorithm that transmits...
P2P Storage Systems: How Much Locality Can They Tolerate? (2009)
Giroire, Frédéric, Monteiro, Julian, Pérennes, Stéphane
Large scale peer-to-peer systems are foreseen as a way to provide highly reliable data storage at low cost. To achieve high durability, such P2P systems encode the user data in a set of redundant...
Directed acyclic graphs with the unique dipath property (2009)
Bermond, Jean-Claude, Cosnard, Michel, Pérennes, Stéphane
Let P be a family of dipaths of a DAG (Directed Acyclic Graph) G. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G,...
Analyse des Corrélations entre Pannes dans les Systèmes de Stockage Pair-à-Pair (2009)
Dalle, Olivier, Giroire, Frédéric, Monteiro, Julian, Pérennes, Stéphane
Dans cet article, nous présentons et étudions des modèles analytiques de systèmes de stockage pair-à-pair fiables à long terme. Les pairs sont sujets à des pannes définitives (défaillance du...
Fractional Path Coloring in Bounded Degree Trees with Applications (2009)
Caragiannis, I., Ferreira, Afonso, Kaklamanis, C., Pérennes, Stéphane, Rivano, Hervé
This paper studies the natural linear programming relaxation of the path coloring problem. We prove constructively that finding an optimal fractional path coloring is Fixed Parameter Tractable (FPT),...
Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems (2009)
Dalle, Olivier, Giroire, Frédéric, Monteiro, Julian, Pérennes, Stéphane
Peer-to-peer storage systems aim to provide a reliable long-term storage at low cost. In such systems, peers fail continuously, hence, the necessity of self-repairing mechanisms to achieve high...
Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems (2009)
Dalle, Olivier, Giroire, Frédéric, Monteiro, Julian, Pérennes, Stéphane
Peer-to-peer storage systems aim to provide a reliable long-term storage at low cost. In such systems, peers fail continuously, hence, the necessity of self-repairing mechanisms to achieve high...
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...
Fractional Path Coloring in Bounded Degree Trees with Applications (2009)
Caragiannis, I., Ferreira, Afonso, Kaklamanis, C., Pérennes, Stéphane, Rivano, Hervé
This paper studies the natural linear programming relaxation of the path coloring problem. We prove constructively that finding an optimal fractional path coloring is Fixed Parameter Tractable (FPT),...
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Information (2008)
Molle, Christelle, Peix, Fabrice, Pérennes, Stéphane, Rivano, Hervé
Wireless mesh network performance issues have been modeled by the Joint Routing and Scheduling Problem (JRSP) in which a maximum per-flow throughput is computed. A classical relaxation of JRSP,...
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Information (2008)
Molle, Christelle, Peix, Fabrice, Pérennes, Stéphane, Rivano, Hervé
Wireless mesh network performance issues have been modeled by the Joint Routing and Scheduling Problem (JRSP) in which a maximum per-flow throughput is computed. A classical relaxation of JRSP,...
Formulation en Coupe/Rounds pour le Routage dans les réseaux radio maillés (2008)
Molle, Christelle, Peix, Fabrice, Pérennes, Stéphane, Rivano, Hervé
Un des problèmes au coeur de l'optimisation des réseaux radio maillés est le routage et l'ordonnancement d'appels. Dans cet article, nous étudions une relaxation classique de ce problème qui...
Formulation en Coupe/Rounds pour le Routage dans les réseaux radio maillés (2008)
Molle, Christelle, Peix, Fabrice, Pérennes, Stéphane, Rivano, Hervé
Un des problèmes au coeur de l'optimisation des réseaux radio maillés est le routage et l'ordonnancement d'appels. Dans cet article, nous étudions une relaxation classique de ce problème qui...
Sébastien Choplin, Aubin Jarry, Stéphane Pérennes, Projet Mascotte Is/inria/unsa
We consider a problem motivated by the design of ATM (Asynchronous Transfer Mode) networks. Given a physical network and an All-to-All traffic, the problem consists in designing a virtual network...
Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks (2008)
Gomes, Cristiana, Pérennes, Stéphane, Rivano, Hervé
In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (Time Division Multiple Access) based wireless...
Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks (2008)
Gomes, Cristiana, Pérennes, Stéphane, Rivano, Hervé
In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (Time Division Multiple Access) based wireless...
Formulation en Coupe/Rounds pour le Routage dans les réseaux radio maillés (2008)
Molle, Christelle, Peix, Fabrice, Pérennes, Stéphane, Rivano, Hervé
Un des problèmes au coeur de l'optimisation des réseaux radio maillés est le routage et l'ordonnancement d'appels. Dans cet article, nous étudions une relaxation classique de ce problème qui...
Formulation en Coupe/Rounds pour le Routage dans les réseaux radio maillés (2008)
Molle, Christelle, Peix, Fabrice, Pérennes, Stéphane, Rivano, Hervé
Un des problèmes au coeur de l'optimisation des réseaux radio maillés est le routage et l'ordonnancement d'appels. Dans cet article, nous étudions une relaxation classique de ce problème qui...
Analysis of Failure Correlation in Peer-to-Peer Storage Systems (2008)
Dalle, Olivier, Giroire, Frédéric, Monteiro, Julian, Pérennes, Stéphane
In this paper, we propose and study analytical models of self-repairing peer-to-peer storage systems subject to failures. The failures correspond to the simultaneous loss of multiple data blocks due...
Analysis of Failure Correlation in Peer-to-Peer Storage Systems (2008)
Dalle, Olivier, Giroire, Frédéric, Monteiro, Julian, Pérennes, Stéphane
In this paper, we propose and study analytical models of self-repairing peer-to-peer storage systems subject to failures. The failures correspond to the simultaneous loss of multiple data blocks due...
Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks (2008)
Gomes, Cristiana, Pérennes, Stéphane, Rivano, Hervé
In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (Time Division Multiple Access) based wireless...
Bandwidth Allocation in Radio Grid Networks (2008)
Gomes, Cristiana, Pérennes, Stéphane, Reyes, Patricio, Rivano, Hervé
In this paper we give exact or almost exact bounds for the continuous gathering problem on grids. Under very general hypothesis on the traffic demand, we mainly prove that the throughput is...
Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks (2008)
Gomes, Cristiana, Pérennes, Stéphane, Rivano, Hervé
In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (Time Division Multiple Access) based wireless...
Bandwidth Allocation in Radio Grid Networks (2008)
Gomes, Cristiana, Pérennes, Stéphane, Reyes, Patricio, Rivano, Hervé
In this paper we give exact or almost exact bounds for the continuous gathering problem on grids. Under very general hypothesis on the traffic demand, we mainly prove that the throughput is...
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Information (2008)
Molle, Christelle, Peix, Fabrice, Pérennes, Stéphane, Rivano, Hervé
Wireless mesh network performance issues have been modeled by the Joint Routing and Scheduling Problem (JRSP) in which a maximum per-flow throughput is computed. A classical relaxation of JRSP,...
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Information (2008)
Molle, Christelle, Peix, Fabrice, Pérennes, Stéphane, Rivano, Hervé
Wireless mesh network performance issues have been modeled by the Joint Routing and Scheduling Problem (JRSP) in which a maximum per-flow throughput is computed. A classical relaxation of JRSP,...
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Information (2008)
Molle, Christelle, Peix, Fabrice, Pérennes, Stéphane, Rivano, Hervé
Wireless mesh network performance issues have been modeled by the Joint Routing and Scheduling Problem (JRSP) in which a maximum per-flow throughput is computed. A classical relaxation of JRSP,...
Formulation en Coupe/Rounds pour le Routage dans les réseaux radio maillés (2008)
Molle, Christelle, Peix, Fabrice, Pérennes, Stéphane, Rivano, Hervé
Un des problèmes au coeur de l'optimisation des réseaux radio maillés est le routage et l'ordonnancement d'appels. Dans cet article, nous étudions une relaxation classique de ce problème qui...
Sur la Conjecture des Jeux Uniques (2008)
Pérennes, Stéphane, Sau Valls, Ignasi
La plupart des problèmes d'optimisation combinatoire sont NP-difficiles, c'est-à-dire qu'ils ne peuvent être résolus en temps polynomial que si les classes P et NP sont identiques. Pour ces...
Bandwidth Allocation in Radio Grid Networks (2008)
Gomes, Cristiana, Pérennes, Stéphane, Reyes, Patricio, Rivano, Hervé
In this paper we give exact or almost exact bounds for the continuous gathering problem on grids. Under very general hypothesis on the traffic demand, we mainly prove that the throughput is...
Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks (2008)
Gomes, Cristiana, Pérennes, Stéphane, Rivano, Hervé
In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (Time Division Multiple Access) based wireless...
Analysis of Failure Correlation in Peer-to-Peer Storage Systems (2008)
Dalle, Olivier, Giroire, Frédéric, Monteiro, Julian, Pérennes, Stéphane
In this paper, we propose and study analytical models of self-repairing peer-to-peer storage systems subject to failures. The failures correspond to the simultaneous loss of multiple data blocks due...
Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks (2008)
Gomes, Cristiana, Pérennes, Stéphane, Rivano, Hervé
In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (Time Division Multiple Access) based wireless...
Sur la Conjecture des Jeux Uniques (2008)
Pérennes, Stéphane, Sau Valls, Ignasi
La plupart des problèmes d'optimisation combinatoire sont NP-difficiles, c'est-à-dire qu'ils ne peuvent être résolus en temps polynomial que si les classes P et NP sont identiques. Pour ces...
Bandwidth Allocation in Radio Grid Networks (2008)
Gomes, Cristiana, Pérennes, Stéphane, Reyes, Patricio, Rivano, Hervé
In this paper we give exact or almost exact bounds for the continuous gathering problem on grids. Under very general hypothesis on the traffic demand, we mainly prove that the throughput is...
Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks (2008)
Gomes, Cristiana, Pérennes, Stéphane, Rivano, Hervé
In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (Time Division Multiple Access) based wireless...
Analysis of Failure Correlation in Peer-to-Peer Storage Systems (2008)
Dalle, Olivier, Giroire, Frédéric, Monteiro, Julian, Pérennes, Stéphane
In this paper, we propose and study analytical models of self-repairing peer-to-peer storage systems subject to failures. The failures correspond to the simultaneous loss of multiple data blocks due...
Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks (2008)
Gomes, Cristiana, Pérennes, Stéphane, Rivano, Hervé
In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (Time Division Multiple Access) based wireless...
Bandwidth Allocation in Radio Grid Networks (2008)
Gomes, Cristiana, Pérennes, Stéphane, Reyes, Patricio, Rivano, Hervé
In this paper we give exact or almost exact bounds for the continuous gathering problem on grids. Under very general hypothesis on the traffic demand, we mainly prove that the throughput is...
Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks (2008)
Gomes, Cristiana, Pérennes, Stéphane, Rivano, Hervé
In this paper, we address the routing and call scheduling problem in which one has to find a minimum-length schedule of selected links in a TDMA (Time Division Multiple Access) based wireless...
Distance Labeling in Graphs (Extended Abstract) (2007)
Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz
We consider the problem of labeling the nodes of a graph in a way that will allow one to compute the distance between any two nodes directly from their labels (without using any additional...
Hardness and Approximation of Traffic Grooming (2007)
Amini, Omid, Pérennes, Stéphane, Sau, Ignasi
Traffic grooming is a central problem in optical networks. It refers to pack low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. In WDM...
Hardness and Approximation of Traffic Grooming (2007)
Amini, Omid, Pérennes, Stéphane, Sau, Ignasi
Traffic grooming is a central problem in optical networks. It refers to pack low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. In WDM...
Hardness and Approximation of Traffic Grooming (2007)
Amini, Omid, Pérennes, Stéphane, Sau, Ignasi
Traffic grooming is a central problem in optical networks. It refers to pack low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. In WDM...
Hardness and Approximation of Traffic Grooming (2007)
Amini, Omid, Pérennes, Stéphane, Sau, Ignasi
Traffic grooming is a central problem in optical networks. It refers to pack low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. In WDM...
Hardness and Approximation of Traffic Grooming (2007)
Amini, Omid, Pérennes, Stéphane, Sau, Ignasi
Traffic grooming is a central problem in optical networks. It refers to pack low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. In WDM...
Hardness and Approximation of Traffic Grooming (2007)
Amini, Omid, Pérennes, Stéphane, Sau, Ignasi
Traffic grooming is a central problem in optical networks. It refers to pack low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. In WDM...
Hardness and approximation of traffic grooming (2007)
Omid Amini, Stéphane Pérennes, Ignasi Sau, École Polytechnique Palaiseau
Abstract Traffic grooming is a central problem in optical networks. It refers to pack low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. 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...
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...
Neighbourhood Broadcasting in Hypercubes (2007)
Bermond, Jean-Claude, Ferreira, Afonso, Pérennes, Stéphane, Peters, Joseph
In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbor at a time, broadcasting takes at least $\lceil...
Neighbourhood Broadcasting in Hypercubes (2007)
Bermond, Jean-Claude, Ferreira, Afonso, Pérennes, Stéphane, Peters, Joseph
In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbor at a time, broadcasting takes at least $\lceil...
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...
Hardness and Approximation of Traffic Grooming (2007)
Amini, Omid, Pérennes, Stéphane, Sau, Ignasi
Traffic grooming is a central problem in optical networks. It refers to pack low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. In WDM...
Neighbourhood Broadcasting in Hypercubes (2007)
Bermond, Jean-Claude, Ferreira, Afonso, Pérennes, Stéphane, Peters, Joseph
In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbor at a time, broadcasting takes at least $\lceil...
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...
Hardness and Approximation of Traffic Grooming (2007)
Amini, Omid, Pérennes, Stéphane, Sau, Ignasi
Traffic grooming is a central problem in optical networks. It refers to pack low rate signals into higher speed streams, in order to improve bandwidth utilization and reduce network cost. In WDM...
Neighbourhood Broadcasting in Hypercubes (2007)
Bermond, Jean-Claude, Ferreira, Afonso, Pérennes, Stéphane, Peters, Joseph
In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbor at a time, broadcasting takes at least $\lceil...
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...
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...
Design of fault-tolerant on-board network (2006)
Delmas, Olivier, Montassier, Mickael, Havet, Frédéric, Pérennes, Stéphane
An $(n,k,r)$-network is a triple $N=(G,in,out)$ where $G=(V,E)$ is a graph and $in,out$ are integral functions defined on $V$ called input and output functions, such that for any $v \inV$,...
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...
On the Pathwidth of Planar Graphs (2006)
Amini, Omid, Huc, Florian, Pérennes, Stéphane
Fomin and Thilikos in \cite{FoTh06} conjectured that there is a constant $c$ such that, for every $2$-connected planar graph $G$, $\text{pw}(G^*) \leq 2\text{pw}(G)+c$ (the same question was asked...
Minimal Selectors and Fault Tolerant Networks (2006)
Amini, Omid, Giroire, Frédéric, Huc, Florian, Pérennes, Stéphane
Un r\'eseau $\plk$ est un graphe non orient\'e avec $p + \lambda$ entr\'ees, $p + k$ sorties et des noeuds internes de degr\'e $4$. Un r\'eseau $\plk$ est valide si pour n'importe quel choix de $p$...
On the Pathwidth of Planar Graphs (2006)
Amini, Omid, Huc, Florian, Pérennes, Stéphane
Fomin and Thilikos in [5] conjectured that there is a constant $c$ such that, for every $2$-connected planar graph $G$, {pw}(G^*) \leq 2\text{pw}(G)+c$ (the same question was asked simutaneously by...
Minimal Selectors and Fault Tolerant Networks (2006)
Amini, Omid, Giroire, Frédéric, Huc, Florian, Pérennes, Stéphane
Un reseau $\plk$ est un graphe non oriente avec $p + \lambda$ entrees, $p + k$ sorties et des noeuds internes de degre $4$. Un reseau $\plk$ est valide si pour n'importe quel choix de $p$ entrees et...
Evaluation stochastique et simulation des réseaux radio (2006)
Méheut, Guillaume, Pérennes, Stéphane, Rivano, Hervé
La capacité d'un réseau ad hoc sans fil passe mal à l'échelle lorsque le nombre $N$ de noeuds du réseau augmente. Si chaque noeud choisit un interlocuteur parmi les autres noeuds, le débit avec...
Evaluation stochastique et simulation des réseaux radio (2006)
Méheut, Guillaume, Pérennes, Stéphane, Rivano, Hervé
La capacité d'un réseau ad hoc sans fil passe mal à l'échelle lorsque le nombre $N$ de noeuds du réseau augmente. Si chaque noeud choisit un interlocuteur parmi les autres noeuds, le débit avec...
Evaluation stochastique et simulation des réseaux radio (2006)
Méheut, Guillaume, Pérennes, Stéphane, Rivano, Hervé
La capacité d'un réseau ad hoc sans fil passe mal à l'échelle lorsque le nombre $N$ de noeuds du réseau augmente. Si chaque noeud choisit un interlocuteur parmi les autres noeuds, le débit avec...
Evaluation stochastique et simulation des réseaux radio (2006)
Méheut, Guillaume, Pérennes, Stéphane, Rivano, Hervé
La capacité d'un réseau ad hoc sans fil passe mal à l'échelle lorsque le nombre $N$ de noeuds du réseau augmente. Si chaque noeud choisit un interlocuteur parmi les autres noeuds, le débit avec...
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...
Design of fault-tolerant on-board network (2006)
Delmas, Olivier, Montassier, Mickael, Havet, Frédéric, Pérennes, Stéphane
An $(n,k,r)$-network is a triple $N=(G,in,out)$ where $G=(V,E)$ is a graph and $in,out$ are integral functions defined on $V$ called input and output functions, such that for any $v \inV$,...
Evaluation stochastique et simulation des réseaux radio (2006)
Méheut, Guillaume, Pérennes, Stéphane, Rivano, Hervé
La capacité d'un réseau ad hoc sans fil passe mal à l'échelle lorsque le nombre $N$ de noeuds du réseau augmente. Si chaque noeud choisit un interlocuteur parmi les autres noeuds, le débit avec...
On the Pathwidth of Planar Graphs (2006)
Amini, Omid, Huc, Florian, Pérennes, Stéphane
Fomin and Thilikos in [5] conjectured that there is a constant $c$ such that, for every $2$-connected planar graph $G$, {pw}(G^*) \leq 2\text{pw}(G)+c$ (the same question was asked simutaneously by...
Minimal Selectors and Fault Tolerant Networks (2006)
Amini, Omid, Giroire, Frédéric, Huc, Florian, Pérennes, Stéphane
Un reseau $\plk$ est un graphe non oriente avec $p + \lambda$ entrees, $p + k$ sorties et des noeuds internes de degre $4$. Un reseau $\plk$ est valide si pour n'importe quel choix de $p$ entrees et...
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...
Minimal selectors and fault tolerant networks. Networks (2006)
Omid Amini, Stéphane Pérennes, Projet Algorithmes, Inria Rocquencourt
In this paper we study a combinatorial optimization problem arising from on-board networks in satellites. In these kind of networks the entering signals (inputs) should be routed to amplifiers...
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...
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...
Hardness and approximation of Gathering in static radio networks (2006)
Bermond, Jean-Claude, Galtier, Jérôme, Klasing, Ralf, Morales, Nelson, Pérennes, Stéphane
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,...
Hardness and approximation of Gathering in static radio networks (2006)
Bermond, Jean-Claude, Galtier, Jérôme, Klasing, Ralf, Morales, Nelson, Pérennes, Stéphane
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,...
Hardness and approximation of Gathering in static radio networks (2006)
Bermond, Jean-Claude, Galtier, Jérôme, Klasing, Ralf, Morales, Nelson, Pérennes, Stéphane
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,...
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...
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...
Design of fault-tolerant on-board network (2006)
Delmas, Olivier, Montassier, Mickael, Havet, Frédéric, Pérennes, Stéphane
An $(n,k,r)$-network is a triple $N=(G,in,out)$ where $G=(V,E)$ is a graph and $in,out$ are integral functions defined on $V$ called input and output functions, such that for any $v \inV$,...
Evaluation stochastique et simulation des réseaux radio (2006)
Méheut, Guillaume, Pérennes, Stéphane, Rivano, Hervé
La capacité d'un réseau ad hoc sans fil passe mal à l'échelle lorsque le nombre $N$ de noeuds du réseau augmente. Si chaque noeud choisit un interlocuteur parmi les autres noeuds, le débit avec...
On the Pathwidth of Planar Graphs (2006)
Amini, Omid, Huc, Florian, Pérennes, Stéphane
Fomin and Thilikos in [5] conjectured that there is a constant $c$ such that, for every $2$-connected planar graph $G$, {pw}(G^*) \leq 2\text{pw}(G)+c$ (the same question was asked simutaneously by...
Minimal Selectors and Fault Tolerant Networks (2006)
Amini, Omid, Giroire, Frédéric, Huc, Florian, Pérennes, Stéphane
Un reseau $\plk$ est un graphe non oriente avec $p + \lambda$ entrees, $p + k$ sorties et des noeuds internes de degre $4$. Un reseau $\plk$ est valide si pour n'importe quel choix de $p$ entrees et...
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...
Hardness and approximation of Gathering in static radio networks (2006)
Bermond, Jean-Claude, Galtier, Jérôme, Klasing, Ralf, Morales, Nelson, Pérennes, Stéphane
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,...
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...
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...
Design of fault-tolerant on-board network (2006)
Delmas, Olivier, Montassier, Mickael, Havet, Frédéric, Pérennes, Stéphane
An $(n,k,r)$-network is a triple $N=(G,in,out)$ where $G=(V,E)$ is a graph and $in,out$ are integral functions defined on $V$ called input and output functions, such that for any $v \inV$,...
Evaluation stochastique et simulation des réseaux radio (2006)
Méheut, Guillaume, Pérennes, Stéphane, Rivano, Hervé
La capacité d'un réseau ad hoc sans fil passe mal à l'échelle lorsque le nombre $N$ de noeuds du réseau augmente. Si chaque noeud choisit un interlocuteur parmi les autres noeuds, le débit avec...
On the Pathwidth of Planar Graphs (2006)
Amini, Omid, Huc, Florian, Pérennes, Stéphane
Fomin and Thilikos in [5] conjectured that there is a constant $c$ such that, for every $2$-connected planar graph $G$, {pw}(G^*) \leq 2\text{pw}(G)+c$ (the same question was asked simutaneously by...
Minimal Selectors and Fault Tolerant Networks (2006)
Amini, Omid, Giroire, Frédéric, Huc, Florian, Pérennes, Stéphane
Un reseau $\plk$ est un graphe non oriente avec $p + \lambda$ entrees, $p + k$ sorties et des noeuds internes de degre $4$. Un reseau $\plk$ est valide si pour n'importe quel choix de $p$ entrees et...
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...
Optimal concave costs in the SDH context (2004)
Choplin, Sébastien, Galtier, Jérôme, Pérennes, Stéphane
We address a problem of network design with minimum cost, and uniform all-to-all demands between the vertices. We deal with the case of concave increasing link cost function f depending of the...
Optimal concave costs in the SDH context (2004)
Choplin, Sébastien, Galtier, Jérôme, Pérennes, Stéphane
We address a problem of network design with minimum cost, and uniform all-to-all demands between the vertices. We deal with the case of concave increasing link cost function f depending of the...
Optimal concave costs in the SDH context (2004)
Choplin, Sébastien, Galtier, Jérôme, Pérennes, Stéphane
We address a problem of network design with minimum cost, and uniform all-to-all demands between the vertices. We deal with the case of concave increasing link cost function f depending of the...
Approximate Constrained Bipartite Edge Coloring (2004)
Caragiannis, Ioannis, Ferreira, Afonso, Kaklamanis, Christos, Pérennes, Stéphane, Persiano, Pino, Rivano, Hervé
We study the following Constrained Bipartite Edge Coloring (CBEC) problem: We are given a bipartite graph G(U,V,E) of maximum degree l with n vertices, in which some of the edges have been legally...
Approximate Constrained Bipartite Edge Coloring (2004)
Caragiannis, Ioannis, Ferreira, Afonso, Kaklamanis, Christos, Pérennes, Stéphane, Persiano, Pino, Rivano, Hervé
We study the following Constrained Bipartite Edge Coloring (CBEC) problem: We are given a bipartite graph G(U,V,E) of maximum degree l with n vertices, in which some of the edges have been legally...
Approximate Constrained Bipartite Edge Coloring (2004)
Caragiannis, Ioannis, Ferreira, Afonso, Kaklamanis, Christos, Pérennes, Stéphane, Persiano, Pino, Rivano, Hervé
We study the following Constrained Bipartite Edge Coloring (CBEC) problem: We are given a bipartite graph G(U,V,E) of maximum degree l with n vertices, in which some of the edges have been legally...
Optimal concave costs in the SDH context (2004)
Choplin, Sébastien, Galtier, Jérôme, Pérennes, Stéphane
We address a problem of network design with minimum cost, and uniform all-to-all demands between the vertices. We deal with the case of concave increasing link cost function f depending of the...
Approximate Constrained Bipartite Edge Coloring (2004)
Caragiannis, Ioannis, Ferreira, Afonso, Kaklamanis, Christos, Pérennes, Stéphane, Persiano, Pino, Rivano, Hervé
We study the following Constrained Bipartite Edge Coloring (CBEC) problem: We are given a bipartite graph G(U,V,E) of maximum degree l with n vertices, in which some of the edges have been legally...
Optimal concave costs in the SDH context (2004)
Choplin, Sébastien, Galtier, Jérôme, Pérennes, Stéphane
We address a problem of network design with minimum cost, and uniform all-to-all demands between the vertices. We deal with the case of concave increasing link cost function f depending of the...
Approximate Constrained Bipartite Edge Coloring (2004)
Caragiannis, Ioannis, Ferreira, Afonso, Kaklamanis, Christos, Pérennes, Stéphane, Persiano, Pino, Rivano, Hervé
We study the following Constrained Bipartite Edge Coloring (CBEC) problem: We are given a bipartite graph G(U,V,E) of maximum degree l with n vertices, in which some of the edges have been legally...
Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks (2003)
Ferreira, Afonso, Pérennes, Stéphane, Richa, A. W., Rivano, Hervé, Stier Moses, N.
In this paper, we study multi-fiber optical networks with wavelength division multiplexing (WDM). We extend the definition of the well-known Wavelength Assignment Problem (WAP) to the case of k...
Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks (2003)
Ferreira, Afonso, Pérennes, Stéphane, Richa, A. W., Rivano, Hervé, Stier Moses, N.
In this paper, we study multi-fiber optical networks with wavelength division multiplexing (WDM). We extend the definition of the well-known Wavelength Assignment Problem (WAP) to the case of k...
Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks (2003)
Ferreira, Afonso, Pérennes, Stéphane, Richa, A. W., Rivano, Hervé, Stier Moses, N.
In this paper, we study multi-fiber optical networks with wavelength division multiplexing (WDM). We extend the definition of the well-known Wavelength Assignment Problem (WAP) to the case of k...
Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks (2003)
Ferreira, Afonso, Pérennes, Stéphane, Richa, A. W., Rivano, Hervé, Stier Moses, N.
In this paper, we study multi-fiber optical networks with wavelength division multiplexing (WDM). We extend the definition of the well-known Wavelength Assignment Problem (WAP) to the case of k...
Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks (2003)
Ferreira, Afonso, Pérennes, Stéphane, Richa, A. W., Rivano, Hervé, Stier Moses, N.
In this paper, we study multi-fiber optical networks with wavelength division multiplexing (WDM). We extend the definition of the well-known Wavelength Assignment Problem (WAP) to the case of k...
On the design of multifiber WDM networks (2002)
Ferreira, Afonso, Pérennes, Stéphane, Richa, A. W., Rivano, Hervé, Stier Moses, N.
In this paper, we address multifiber optical networks with Wavelength Division Multiplexing (\wdm). Assuming that the lightpaths use the same wavelength from source to destination, we extend the...
On the design of multifiber WDM networks (2002)
Ferreira, Afonso, Pérennes, Stéphane, Richa, A. W., Rivano, Hervé, Stier Moses, N.
In this paper, we address multifiber optical networks with Wavelength Division Multiplexing (\wdm). Assuming that the lightpaths use the same wavelength from source to destination, we extend the...
Baskiotis, Nicolas, Pérennes, Stéphane, Rivano, Hervé
Ces travaux s'attachent à définir le problème du routage optique multifibres ainsi qu'une modélisation en terme de multiflot entier. Cette modélisation permet d'envisager de bonnes...
Baskiotis, Nicolas, Pérennes, Stéphane, Rivano, Hervé
Ces travaux s'attachent à définir le problème du routage optique multifibres ainsi qu'une modélisation en terme de multiflot entier. Cette modélisation permet d'envisager de bonnes...
Baskiotis, Nicolas, Pérennes, Stéphane, Rivano, Hervé
Ces travaux s'attachent à définir le problème du routage optique multifibres ainsi qu'une modélisation en terme de multiflot entier. Cette modélisation permet d'envisager de bonnes...
On the design of multifiber WDM networks (2002)
Ferreira, Afonso, Pérennes, Stéphane, Richa, A. W., Rivano, Hervé, Stier Moses, N.
In this paper, we address multifiber optical networks with Wavelength Division Multiplexing (\wdm). Assuming that the lightpaths use the same wavelength from source to destination, we extend the...
On the design of multifiber WDM networks (2002)
Ferreira, Afonso, Pérennes, Stéphane, Richa, A. W., Rivano, Hervé, Stier Moses, N.
In this paper, we address multifiber optical networks with Wavelength Division Multiplexing (\wdm). Assuming that the lightpaths use the same wavelength from source to destination, we extend the...
On the design of multifiber WDM networks (2002)
Ferreira, Afonso, Pérennes, Stéphane, Richa, A. W., Rivano, Hervé, Stier Moses, N.
In this paper, we address multifiber optical networks with Wavelength Division Multiplexing (\wdm). Assuming that the lightpaths use the same wavelength from source to destination, we extend the...
Baskiotis, Nicolas, Pérennes, Stéphane, Rivano, Hervé
Ces travaux s'attachent à définir le problème du routage optique multifibres ainsi qu'une modélisation en terme de multiflot entier. Cette modélisation permet d'envisager de bonnes...
Baskiotis, Nicolas, Pérennes, Stéphane, Rivano, Hervé
Ces travaux s'attachent à définir le problème du routage optique multifibres ainsi qu'une modélisation en terme de multiflot entier. Cette modélisation permet d'envisager de bonnes...
Fractional path coloring on bounded degree trees (2001)
Caragiannis, Ioannis, Ferreira, Afonso, Kaklamanis, Christos, Pérennes, Stéphane, Rivano, Hervé
This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a symmetric directed graph with a minimum number of colors, in such a way that...
Fractional path coloring on bounded degree trees (2001)
Caragiannis, Ioannis, Ferreira, Afonso, Kaklamanis, Christos, Pérennes, Stéphane, Rivano, Hervé
This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a symmetric directed graph with a minimum number of colors, in such a way that...
Fractional Coloring of Bounded Degree Trees (2001)
Ferreira, Afonso, Pérennes, Stéphane, Rivano, Hervé
We study the dipath-coloring problem in bounded degree and treewidth symmetric digraphs, in which one needs to color the dipaths with a minimum number of colors, in such a way that dipaths using the...
Fractional Coloring of Bounded Degree Trees (2001)
Ferreira, Afonso, Pérennes, Stéphane, Rivano, Hervé
We study the dipath-coloring problem in bounded degree and treewidth symmetric digraphs, in which one needs to color the dipaths with a minimum number of colors, in such a way that dipaths using the...
Fractional Coloring of Bounded Degree Trees (2001)
Ferreira, Afonso, Pérennes, Stéphane, Rivano, Hervé
We study the dipath-coloring problem in bounded degree and treewidth symmetric digraphs, in which one needs to color the dipaths with a minimum number of colors, in such a way that dipaths using the...
Fractional Path Coloring with Applications to WDM Networks (2001)
Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stéphane Pérennes, Hervé Rivano
This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a symmetric directed graph with a minimum number of colors, in such a way that...
Fractional path coloring on bounded degree trees (2001)
Caragiannis, Ioannis, Ferreira, Afonso, Kaklamanis, Christos, Pérennes, Stéphane, Rivano, Hervé
This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a symmetric directed graph with a minimum number of colors, in such a way that...
Fractional path coloring on bounded degree trees (2001)
Caragiannis, Ioannis, Ferreira, Afonso, Kaklamanis, Christos, Pérennes, Stéphane, Rivano, Hervé
This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a symmetric directed graph with a minimum number of colors, in such a way that...
Fractional path coloring on bounded degree trees (2001)
Caragiannis, Ioannis, Ferreira, Afonso, Kaklamanis, Christos, Pérennes, Stéphane, Rivano, Hervé
This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a symmetric directed graph with a minimum number of colors, in such a way that...
Fractional Coloring of Bounded Degree Trees (2001)
Ferreira, Afonso, Pérennes, Stéphane, Rivano, Hervé
We study the dipath-coloring problem in bounded degree and treewidth symmetric digraphs, in which one needs to color the dipaths with a minimum number of colors, in such a way that dipaths using the...
Fractional Coloring of Bounded Degree Trees (2001)
Ferreira, Afonso, Pérennes, Stéphane, Rivano, Hervé
We study the dipath-coloring problem in bounded degree and treewidth symmetric digraphs, in which one needs to color the dipaths with a minimum number of colors, in such a way that dipaths using the...
Assigning Labels in Unknown Anonymous Networks (2000)
Pierre Fraigniaud, Andrzej Pelc, David Peleg, Stéphane Pérennes
We consider the task of distributedly assigning distinct labels to nodes of an unknown anonymous network. A priori, nodes do not have any identities (anonymous network) and do not know the topology...
Tight Bounds for Broadcasting in the Linear Cost Model (1999)
Beauquier, Bruno, Delmas, Olivier, Pérennes, Stéphane
This work considers broadcast protocols made of successive communication rounds in the linear cost model: the time needed to send a message of length L is defined as \alpha +L\tau. In this model,...
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....
All-to-All Routing and Coloring in Weighted Trees of Rings (1999)
Beauquier, Bruno, Pérennes, Stéphane, Tóth, David
A tree of rings is an undirected graph obtained from the union of rings, which intersect two by two in at most one node, such that any two nodes are connected by exactly two edge-disjoint paths. In...
Cayley Graphs with Complete Rotations (1999)
Heydemann, Marie-Claude, Marlin, Nausica, Pérennes, Stéphane
As it is introduced by Bermond, Pérennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs, including most popular models for interconnection networks, admit a special automorphism, called...
Efficient Communication in Unknown Networks (1999)
Gargano, Luisa, Pelc, Andrzej, Pérennes, Stéphane, Vaccaro, Ugo
We consider the problem of disseminating messages in networks whose topology and size are not known to nodes. Three communication tasks of increasing difficulty are studied. In blind broadcasting...
Symmetric flows and broadcasting in hypercubes (1999)
Bermond, Jean-Claude, Bonnecaze, A., Kodate, T., Pérennes, Stéphane, Solé, Patrick
Tight Bounds for Broadcasting in the Linear Cost Model (1999)
Beauquier, Bruno, Delmas, Olivier, Pérennes, Stéphane
This work considers broadcast protocols made of successive communication rounds in the linear cost model: the time needed to send a message of length L is defined as \alpha +L\tau. In this model,...
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....
All-to-All Routing and Coloring in Weighted Trees of Rings (1999)
Beauquier, Bruno, Pérennes, Stéphane, Tóth, David
A tree of rings is an undirected graph obtained from the union of rings, which intersect two by two in at most one node, such that any two nodes are connected by exactly two edge-disjoint paths. In...
Cayley Graphs with Complete Rotations (1999)
Heydemann, Marie-Claude, Marlin, Nausica, Pérennes, Stéphane
As it is introduced by Bermond, Pérennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs, including most popular models for interconnection networks, admit a special automorphism, called...
Efficient Communication in Unknown Networks (1999)
Gargano, Luisa, Pelc, Andrzej, Pérennes, Stéphane, Vaccaro, Ugo
We consider the problem of disseminating messages in networks whose topology and size are not known to nodes. Three communication tasks of increasing difficulty are studied. In blind broadcasting...
Tight Bounds for Broadcasting in the Linear Cost Model (1999)
Beauquier, Bruno, Delmas, Olivier, Pérennes, Stéphane
This work considers broadcast protocols made of successive communication rounds in the linear cost model: the time needed to send a message of length L is defined as \alpha +L\tau. In this model,...
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....
All-to-All Routing and Coloring in Weighted Trees of Rings (1999)
Beauquier, Bruno, Pérennes, Stéphane, Tóth, David
A tree of rings is an undirected graph obtained from the union of rings, which intersect two by two in at most one node, such that any two nodes are connected by exactly two edge-disjoint paths. In...
Cayley Graphs with Complete Rotations (1999)
Heydemann, Marie-Claude, Marlin, Nausica, Pérennes, Stéphane
As it is introduced by Bermond, Pérennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs, including most popular models for interconnection networks, admit a special automorphism, called...
Efficient Communication in Unknown Networks (1999)
Gargano, Luisa, Pelc, Andrzej, Pérennes, Stéphane, Vaccaro, Ugo
We consider the problem of disseminating messages in networks whose topology and size are not known to nodes. Three communication tasks of increasing difficulty are studied. In blind broadcasting...
Cayley Graphs with Complete Rotations (1999)
Stéphane Pérennes, Unit Inria, Sophia Antipolis, Marie-claude Heydemann, Marie-claude Heydemann, Nausica Marlin, ...
As it is introduced by Bermond, Pérennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs, including most popular models for interconnection networks, admit a special automorphism, called...
All-to-All Routing and Coloring in Weighted Trees of Rings (1999)
Beauquier, Bruno, Pérennes, Stéphane, Tóth, David
A tree of rings is an undirected graph obtained from the union of rings, which intersect two by two in at most one node, such that any two nodes are connected by exactly two edge-disjoint paths. In...
Cayley Graphs with Complete Rotations (1999)
Heydemann, Marie-Claude, Marlin, Nausica, Pérennes, Stéphane
As it is introduced by Bermond, Pérennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs, including most popular models for interconnection networks, admit a special automorphism, called...
Efficient Communication in Unknown Networks (1999)
Gargano, Luisa, Pelc, Andrzej, Pérennes, Stéphane, Vaccaro, Ugo
We consider the problem of disseminating messages in networks whose topology and size are not known to nodes. Three communication tasks of increasing difficulty are studied. In blind broadcasting...
Tight Bounds for Broadcasting in the Linear Cost Model (1999)
Beauquier, Bruno, Delmas, Olivier, Pérennes, Stéphane
This work considers broadcast protocols made of successive communication rounds in the linear cost model: the time needed to send a message of length L is defined as \alpha +L\tau. In this model,...
All-to-All Routing and Coloring in Weighted Trees of Rings (1999)
Beauquier, Bruno, Pérennes, Stéphane, Tóth, David
A tree of rings is an undirected graph obtained from the union of rings, which intersect two by two in at most one node, such that any two nodes are connected by exactly two edge-disjoint paths. In...
Cayley Graphs with Complete Rotations (1999)
Heydemann, Marie-Claude, Marlin, Nausica, Pérennes, Stéphane
As it is introduced by Bermond, Pérennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs, including most popular models for interconnection networks, admit a special automorphism, called...
Efficient Communication in Unknown Networks (1999)
Gargano, Luisa, Pelc, Andrzej, Pérennes, Stéphane, Vaccaro, Ugo
We consider the problem of disseminating messages in networks whose topology and size are not known to nodes. Three communication tasks of increasing difficulty are studied. In blind broadcasting...
Tight Bounds for Broadcasting in the Linear Cost Model (1999)
Beauquier, Bruno, Delmas, Olivier, Pérennes, Stéphane
This work considers broadcast protocols made of successive communication rounds in the linear cost model: the time needed to send a message of length L is defined as \alpha +L\tau. In this model,...
Optimal Wavelength-Routed Multicasting (1997)
Beauquier, Bruno, Hell, Pavol, Pérennes, Stéphane
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which can be coloured by...
Graph Problems Arising from Wavelength-Routing in All-Optical Networks (1997)
Beauquier, Bruno, Bermond, Jean-Claude, Gargano, Luisa, Hell, Pavol, Pérennes, Stéphane, Vaccaro, Ugo
We survey the theoretical results obtained for wavelength routing in all--optical networks, present some new results and propose several open problems. In all--optical networks the vast bandwidth...
Optimal Wavelength-Routed Multicasting (1997)
Beauquier, Bruno, Hell, Pavol, Pérennes, Stéphane
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which can be coloured by...
Graph Problems Arising from Wavelength-Routing in All-Optical Networks (1997)
Beauquier, Bruno, Bermond, Jean-Claude, Gargano, Luisa, Hell, Pavol, Pérennes, Stéphane, Vaccaro, Ugo
We survey the theoretical results obtained for wavelength routing in all--optical networks, present some new results and propose several open problems. In all--optical networks the vast bandwidth...
Optimal Wavelength-Routed Multicasting (1997)
Beauquier, Bruno, Hell, Pavol, Pérennes, Stéphane
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which can be coloured by...
Graph Problems Arising from Wavelength-Routing in All-Optical Networks (1997)
Beauquier, Bruno, Bermond, Jean-Claude, Gargano, Luisa, Hell, Pavol, Pérennes, Stéphane, Vaccaro, Ugo
We survey the theoretical results obtained for wavelength routing in all--optical networks, present some new results and propose several open problems. In all--optical networks the vast bandwidth...
Cayley graphs with complete rotations (1997)
Nausica Marlin, Stéphane Pérennes, Marie-claude Heydemann, Marie-claude Heydemann, Nausica Marlin Y, Stéphane Pérennes Z, ...
apport de recherche
Optimal Wavelength-Routed Multicasting (1997)
Bruno Beauquier, Bruno Beauquier, Pavol Hell, Pavol Hell, Stéphane Pérennes, Stphane Prennes, ...
: Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which can be coloured by...
Cayley Graphs with Complete Rotations (1997)
Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes
As it is introduced in [4] and [13], some Cayley graphs, including most popular models for interconnection networks, admit a special automorphism, called complete rotation. Such an automorphism is...
Graph Problems Arising from Wavelength-Routing in All-Optical Networks (1997)
Beauquier, Bruno, Bermond, Jean-Claude, Gargano, Luisa, Hell, Pavol, Pérennes, Stéphane, Vaccaro, Ugo
We survey the theoretical results obtained for wavelength routing in all--optical networks, present some new results and propose several open problems. In all--optical networks the vast bandwidth...
Optimal Wavelength-Routed Multicasting (1997)
Beauquier, Bruno, Hell, Pavol, Pérennes, Stéphane
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which can be coloured by...
Graph Problems Arising from Wavelength-Routing in All-Optical Networks (1997)
Beauquier, Bruno, Bermond, Jean-Claude, Gargano, Luisa, Hell, Pavol, Pérennes, Stéphane, Vaccaro, Ugo
We survey the theoretical results obtained for wavelength routing in all--optical networks, present some new results and propose several open problems. In all--optical networks the vast bandwidth...
Optimal Wavelength-Routed Multicasting (1997)
Beauquier, Bruno, Hell, Pavol, Pérennes, Stéphane
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which can be coloured by...
Neighbourhood Broad-casting in Hypercubes (1991)
Jean-claude Bermond, Afonso Ferreira, Stéphane Pérennes, Joseph G. Peters
In the broadcasting problem, one node needs to broadcast a message to all other nodes in a network. If nodes can only communicate with one neighbour at a time, broadcasting takes at least ⌈log 2 N...