Improper colouring of weighted grid and hexagonal graphs (2010)
Bermond, Jean-Claude, Havet, Frédéric, Huc, Florian, Linhares Sales, Claudia
We study a weighted improper colouring problem on graph, and in particular of triangular and hexagonal grid graphs. This problem is motivated by a frequency allocation problem. We propose...
Improper colouring of weighted grid and hexagonal graphs (2010)
Bermond, Jean-Claude, Havet, Frédéric, Huc, Florian, Linhares Sales, Claudia
We study a weighted improper colouring problem on graph, and in particular of triangular and hexagonal grid graphs. This problem is motivated by a frequency allocation problem. We propose...
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks (2010)
Eitan Altman, Jean-claude Bermond
Abstract — This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes forms a...
DROP COST AND WAVELENGTH OPTIMAL TWO-PERIOD GROOMING WITH RATIO 4∗ (2010)
Bermond, Jean-Claude, Colbourn, Charles J., Gionfriddo, Lucia, Quattrocchi, Gaetano, Sau, Ignasi
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-period grooming...
DROP COST AND WAVELENGTH OPTIMAL TWO-PERIOD GROOMING WITH RATIO 4∗ (2010)
Bermond, Jean-Claude, Colbourn, Charles J., Gionfriddo, Lucia, Quattrocchi, Gaetano, Sau, Ignasi
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-period grooming...
Drop cost and wavelength optimal two-period grooming with ratio 4 (2009)
Bermond, Jean-Claude, Colbourn, Charles J., Gionfriddo, Lucia, Quattrocchi, Gaetano, Valls, Ignasi Sau
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-period grooming...
Traffic Grooming in Bidirectional WDM Ring Networks (2009)
Bermond, Jean-Claude, Muñoz, Xavier, Valls, Ignasi Sau
We study the minimization of ADMs (Add-Drop Multiplexers) in optical WDM bidirectional rings considering symmetric shortest path routing and all-to-all unitary requests. We precisely formulate the...
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...
Fast Data Gathering in Radio Grid Networks (2009)
Bermond, Jean-Claude, Nisse, Nicolas, Reyes, Patricio, Rivano, Hervé
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the...
Fast Data Gathering in Radio Grid Networks (2009)
Bermond, Jean-Claude, Nisse, Nicolas, Reyes, Patricio, Rivano, Hervé
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the...
Fast Data Gathering in Radio Grid Networks (2009)
Bermond, Jean-Claude, Nisse, Nicolas, Reyes, Patricio, Rivano, Hervé
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the...
Fast Data Gathering in Radio Grid Networks (2009)
Bermond, Jean-Claude, Nisse, Nicolas, Reyes, Patricio, Rivano, Hervé
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the...
Fast Data Gathering in Radio Grid Networks (2009)
Bermond, Jean-Claude, Nisse, Nicolas, Reyes, Patricio, Rivano, Hervé
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the...
Fast Data Gathering in Radio Grid Networks (2009)
Bermond, Jean-Claude, Nisse, Nicolas, Reyes, Patricio, Rivano, Hervé
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the...
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...
Fast Data Gathering in Radio Grid Networks (2009)
Bermond, Jean-Claude, Nisse, Nicolas, Reyes, Patricio, Rivano, Hervé
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the...
Fast Data Gathering in Radio Grid Networks (2009)
Bermond, Jean-Claude, Nisse, Nicolas, Reyes, Patricio, Rivano, Hervé
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the...
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...
Fast Data Gathering in Radio Grid Networks (2009)
Bermond, Jean-Claude, Nisse, Nicolas, Reyes, Patricio, Rivano, Hervé
Nous présentons des algorithmes efficaces pour la collecte d'informations par une station de base au sein d'un réseau sans-fil multi sauts en présence d'interférences. Nous nous focalisons sur...
Fast Data Gathering in Radio Grid Networks (2009)
Bermond, Jean-Claude, Nisse, Nicolas, Reyes, Patricio, Rivano, Hervé
Nous présentons des algorithmes efficaces pour la collecte d'informations par une station de base au sein d'un réseau sans-fil multi sauts en présence d'interférences. Nous nous focalisons sur...
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,...
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...
Optimal Gathering Protocols on Paths under Interference Constraints (2009)
Bermond, Jean-Claude, Correa, Ricardo, Yu, Min-Li
We study the problem of gathering information from the nodes of a multi-hop radio network into a predefined destination node under reachability and interference constraints. In such a network, a node...
Optimal Gathering Protocols on Paths under Interference Constraints (2009)
Bermond, Jean-Claude, Correa, Ricardo, Yu, Min-Li
We study the problem of gathering information from the nodes of a multi-hop radio network into a predefined destination node under reachability and interference constraints. In such a network, a node...
Traffic Grooming in Bidirectional WDM Ring Networks (2009)
Bermond, Jean-Claude, Muñoz, Xavier, Sau Valls, Ignasi
We study the minimization of ADMs (Add-Drop Multiplexers) in optical WDM bidirectional rings considering symmetric shortest path routing and all-to-all unitary requests. We precisely formulate the...
Traffic Grooming in Bidirectional WDM Ring Networks (2009)
Bermond, Jean-Claude, Muñoz, Xavier, Sau Valls, Ignasi
We study the minimization of ADMs (Add-Drop Multiplexers) in optical WDM bidirectional rings considering symmetric shortest path routing and all-to-all unitary requests. We precisely formulate the...
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...
Drop cost and wavelength optimal two-period grooming with ratio 4 (2009)
Bermond, Jean-Claude, Colbourn, Charles J., Gionfriddo, Lucia, Quattrocchi, Gaetano, Sau Valls, Ignasi
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-period grooming...
Drop cost and wavelength optimal two-period grooming with ratio 4 (2009)
Bermond, Jean-Claude, Colbourn, Charles J., Gionfriddo, Lucia, Quattrocchi, Gaetano, Sau Valls, Ignasi
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-period grooming...
Drop cost and wavelength optimal two-period grooming with ratio 4 (2009)
Bermond, Jean-Claude, Colbourn, Charles J., Gionfriddo, Lucia, Quattrocchi, Gaetano, Sau Valls, Ignasi
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-period grooming...
Optimal Gathering Protocols on Paths under Interference Constraints (2009)
Bermond, Jean-Claude, Correa, Ricardo, Yu, Min-Li
We study the problem of gathering information from the nodes of a multi-hop radio network into a predefined destination node under reachability and interference constraints. In such a network, a node...
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...
Traffic Grooming in Bidirectional WDM Ring Networks (2009)
Bermond, Jean-Claude, Muñoz, Xavier, Sau Valls, Ignasi
We study the minimization of ADMs (Add-Drop Multiplexers) in optical WDM bidirectional rings considering symmetric shortest path routing and all-to-all unitary requests. We precisely formulate the...
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...
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,...
Fast Data Gathering in Radio Grid Networks (2009)
Bermond, Jean-Claude, Nisse, Nicolas, Reyes, Patricio, Rivano, Hervé
Nous présentons des algorithmes efficaces pour la collecte d'informations par une station de base au sein d'un réseau sans-fil multi sauts en présence d'interférences. Nous nous focalisons sur...
Fast Data Gathering in Radio Grid Networks (2009)
Bermond, Jean-Claude, Nisse, Nicolas, Reyes, Patricio, Rivano, Hervé
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the...
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, Stéphane, 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, 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...
Drop cost and wavelength optimal two-period grooming with ratio 4 (2009)
Bermond, Jean-Claude, Colbourn, Charles J., Gionfriddo, Lucia, Quattrocchi, Gaetano, Sau Valls, Ignasi
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-period grooming...
Optimal Gathering Protocols on Paths under Interference Constraints (2009)
Bermond, Jean-Claude, Correa, Ricardo, Yu, Min-Li
We study the problem of gathering information from the nodes of a multi-hop radio network into a predefined destination node under reachability and interference constraints. In such a network, a node...
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...
Traffic Grooming in Bidirectional WDM Ring Networks (2009)
Bermond, Jean-Claude, Muñoz, Xavier, Sau Valls, Ignasi
We study the minimization of ADMs (Add-Drop Multiplexers) in optical WDM bidirectional rings considering symmetric shortest path routing and all-to-all unitary requests. We precisely formulate the...
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...
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,...
Fast Data Gathering in Radio Grid Networks (2009)
Bermond, Jean-Claude, Nisse, Nicolas, Reyes, Patricio, Rivano, Hervé
Nous présentons des algorithmes efficaces pour la collecte d'informations par une station de base au sein d'un réseau sans-fil multi sauts en présence d'interférences. Nous nous focalisons sur...
Fast Data Gathering in Radio Grid Networks (2009)
Bermond, Jean-Claude, Nisse, Nicolas, Reyes, Patricio, Rivano, Hervé
The aim of this paper is to design efficient gathering algorithms (data collection) in a Base Station of a wireless multi hop grid network when interferences constraints are present. We suppose the...
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, Stéphane, 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, 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, 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...
Distributed Call Scheduling in Wireless Networks (2008)
Bermond, Jean-Claude, Mazauric, Dorian, Nain, Philippe
We consider in this paper the distributed call scheduling problem in wireless networks. Due to interference in this kind of network, active links have to respect interference constraints. For example...
Distributed Call Scheduling in Wireless Networks (2008)
Bermond, Jean-Claude, Mazauric, Dorian, Nain, Philippe
We consider in this paper the distributed call scheduling problem in wireless networks. Due to interference in this kind of network, active links have to respect interference constraints. For example...
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks (2008)
Altman, Eitan, Nain, Philippe, Bermond, Jean-Claude
This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes forms a delay tolerant...
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks (2008)
Altman, Eitan, Nain, Philippe, Bermond, Jean-Claude
This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes forms a delay tolerant...
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks (2008)
Altman, Eitan, Nain, Philippe, Bermond, Jean-Claude
This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes forms a delay tolerant...
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks (2008)
Altman, Eitan, Nain, Philippe, Bermond, Jean-Claude
This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes forms a delay tolerant...
Gathering with Minimum Delay in Sensor Networks (2008)
Bermond, Jean-Claude, Gargano Adele Rescigno, Luisa
Data gathering is a fundamental operation in wireless sensor networks in which data packets generated at sensor nodes are to be collected at a base station. The network is a multi-hop wireless...
Gathering with Minimum Delay in Sensor Networks (2008)
Bermond, Jean-Claude, Gargano Adele Rescigno, Luisa
Data gathering is a fundamental operation in wireless sensor networks in which data packets generated at sensor nodes are to be collected at a base station. The network is a multi-hop wireless...
Distributed Call Scheduling in Wireless Networks (2008)
Bermond, Jean-Claude, Mazauric, Dorian, Misra, Vishal, Nain, Philippe
This work investigates distributed transmission scheduling in wireless networks. Due to interference constraints, "neighboring links'' cannot be simultaneously activated, otherwise transmissions will...
Distributed Call Scheduling in Wireless Networks (2008)
Bermond, Jean-Claude, Mazauric, Dorian, Nain, Philippe
This work investigates distributed call scheduling in wireless (mesh) networks in presence of random arrivals on each link. In these networks, interference phenomena prevent 'neighboring' links to be...
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks (2008)
Altman, Eitan, Nain, Philippe, Bermond, Jean-Claude
This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes forms a delay tolerant...
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks (2008)
Altman, Eitan, Nain, Philippe, Bermond, Jean-Claude
This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes forms a delay tolerant...
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...
Distributed Call Scheduling in Wireless Networks (2008)
Bermond, Jean-Claude, Mazauric, Dorian, Misra, Vishal, Nain, Philippe
This work investigates distributed transmission scheduling in wireless networks. Due to interference constraints, "neighboring links'' cannot be simultaneously activated, otherwise transmissions will...
Distributed Call Scheduling in Wireless Networks (2008)
Bermond, Jean-Claude, Mazauric, Dorian, Misra, Vishal, Nain, Philippe
This work investigates distributed transmission scheduling in wireless networks. Due to interference constraints, "neighboring links'' cannot be simultaneously activated, otherwise transmissions will...
Distributed Call Scheduling in Wireless Networks (2008)
Bermond, Jean-Claude, Mazauric, Dorian, Misra, Vishal, Nain, Philippe
This work investigates distributed transmission scheduling in wireless networks. Due to interference constraints, "neighboring links'' cannot be simultaneously activated, otherwise transmissions will...
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...
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks (2008)
Altman, Eitan, Nain, Philippe, Bermond, Jean-Claude
This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes forms a delay tolerant...
Gathering with Minimum Delay in Sensor Networks (2008)
Bermond, Jean-Claude, Gargano Adele Rescigno, Luisa
Data gathering is a fundamental operation in wireless sensor networks in which data packets generated at sensor nodes are to be collected at a base station. The network is a multi-hop wireless...
Distributed Call Scheduling in Wireless Networks (2008)
Bermond, Jean-Claude, Mazauric, Dorian, Misra, Vishal, Nain, Philippe
This work investigates distributed transmission scheduling in wireless networks. Due to interference constraints, "neighboring links'' cannot be simultaneously activated, otherwise transmissions will...
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...
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks (2008)
Altman, Eitan, Nain, Philippe, Bermond, Jean-Claude
This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes forms a delay tolerant...
Gathering with Minimum Delay in Sensor Networks (2008)
Bermond, Jean-Claude, Gargano Adele Rescigno, Luisa
Data gathering is a fundamental operation in wireless sensor networks in which data packets generated at sensor nodes are to be collected at a base station. The network is a multi-hop wireless...
Theme 1--- Reseaux et systemes (2007)
Jean-claude Bermond, Jean-claude Bermond, Eric Darrot, Eric Darrot, Olivier Delmas, Olivier Delmas, ...
apport de recherche
Directed Virtual Path Layouts in (2007)
Stphane Prenns, Unit Inria, Sophia Antipolis, Jean-claude Bermond, Jean-claude Bermond, Nausica Marlin, ...
apport de recherche
Nausica Marlin, David Peleg, Stéphane Pérennès, Jean-claude Bermond, Jean-claude Bermond, Nausica Marlin Y, ...
apport de recherche Directed Virtual Path Layouts
Acyclic Orientations for Deadlock Prevention in Usual Networks (2007)
Jean-Claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
Deadlock prevention for routing messages has a central role in communication networks, since it directly influences the correctness of distributed and parallel systems. In this paper we extend some...
Design of fault-tolerant networks on satellites (TWTA redundancy) (2007)
Jean-Claude Bermond, Eric Darrot, Olivier Delmas
This article deals with the design of networks to be loaded on satellites. These networks should connect inputs (corresponding to signals arriving on the satellite) to outputs (corresponding to...
Broadcasting and NP-completeness (2007)
Jean-Claude Bermond, Pierre Fraigniaud
In this note, we answer two questions arising in broadcasting problems in networks. We first describe a new family of minimum broadcast graphs. Then we give a proof due to Alon of the NP-completeness...
Deadlock Prevention by Acyclic Orientations (2007)
Miriam And Michele Flammini, Jean-claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
Deadlock prevention for routing messages has a central role in communication networks, since it directly influences the correctness of parallel and distributed systems. In this paper we extend some...
A Note on Knödel Graphs (2007)
Jean-Claude Bermond, Arthur L. Liestman, Stephane Perennes
In this note, we show that the edges of the modified Knödel graph behave similarly to the dimensions in hypercubes.
Simulation within a Parallel Object-Oriented Language (2007)
Jean-claude Bermond, Denis Caromel
Introduction We give an overview of the SLOOP system. A synthetic view of each system component and organization is then presented. 2 The SLOOP system Our group (INRIA--I3S/CNRS--Univ. of Nice) works...
Induced Broadcasting Algorithms in Iterated Line Digraphs (2007)
Jean-Claude Bermond, Xavier Muñoz, Alberto Marchetti-spaccamela
We propose broadcasting algorithms for line digraphs in the telephone model. The new protocols use a broadcasting protocol for a graph G to obtain a broadcasting protocol for the graph L k (G), the...
Jean-claude Bermond, David Coudert, Mascotte Cnrs-is-inria, 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...
A Note on Cycle Covering [Extended Abstract] (2007)
Jean-claude Bermond, David Coudert, Projet Mascotte, 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.
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...
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...
Allocation de fréquences et coloration impropre des graphes hexagonaux pondérés (2007)
Bermond, Jean-Claude, Havet, Frederic, Huc, Florian, Linhares-Sales, Claudia
Motivés par un problème d'allocation de fréquences, nous étudions la coloration impropre des graphes pondérés et plus particulièrement des graphes hexagonaux pondérés. Nous donnons des...
Allocation de fréquences et coloration impropre des graphes hexagonaux pondérés (2007)
Bermond, Jean-Claude, Havet, Frederic, Huc, Florian, Linhares-Sales, Claudia
Motivés par un problème d'allocation de fréquences, nous étudions la coloration impropre des graphes pondérés et plus particulièrement des graphes hexagonaux pondérés. Nous donnons des...
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...
Vertex disjoint routings of cycles over tori (2007)
Bermond, Jean-Claude, Yu, Min-Li
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consider here the case...
Vertex disjoint routings of cycles over tori (2007)
Bermond, Jean-Claude, Yu, Min-Li
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consider here the case...
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...
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...
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...
Vertex disjoint routings of cycles over tori (2007)
Bermond, Jean-Claude, Yu, Min-Li
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consider here the case...
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...
Allocation de fréquences et coloration impropre des graphes hexagonaux pondérés (2007)
Bermond, Jean-Claude, Havet, Frederic, Huc, Florian, Linhares-Sales, Claudia
Motivés par un problème d'allocation de fréquences, nous étudions la coloration impropre des graphes pondérés et plus particulièrement des graphes hexagonaux pondérés. Nous donnons des...
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...
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...
Vertex disjoint routings of cycles over tori (2007)
Bermond, Jean-Claude, Yu, Min-Li
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consider here the case...
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...
Allocation de fréquences et coloration impropre des graphes hexagonaux pondérés (2007)
Bermond, Jean-Claude, Havet, Frederic, Huc, Florian, Linhares-Sales, Claudia
Motivés par un problème d'allocation de fréquences, nous étudions la coloration impropre des graphes pondérés et plus particulièrement des graphes hexagonaux pondérés. Nous donnons des...
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...
Nombre Chromatique Total Du Graphe R-Parti Complet (2006)
In the article [3], R. Laskar and W. Hare pose a conjecture concerning the total chromatic number of the complete r-partite balanced graph Kr×n. In this paper we determine the exact value of this...
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...
Hardness and approximation of gathering in static radio networks (2006)
Bermond, Jean-Claude, Galtier, Jerome, 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,...
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,...
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, 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...
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...
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...
Bermond, Jean-Claude, Coudert, David
State-of-the-art on traffic grooming with a design theory approach
Bermond, Jean-Claude, Coudert, David
State-of-the-art on traffic grooming with a design theory approach
Fault tolerant on board networks with priorities (2006)
Bermond, Jean-Claude, Havet, Frédéric, Toth, C.D.
We consider on-board networks in satellites interconnecting entering signals (inputs) to amplifiers (outputs). The connections are made via expensive switches, each of which has four available links....
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,...
Fault tolerant on board networks with priorities (2006)
Bermond, Jean-Claude, Havet, Frédéric, Toth, C.D.
We consider on-board networks in satellites interconnecting entering signals (inputs) to amplifiers (outputs). The connections are made via expensive switches, each of which has four available links....
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,...
Fault tolerant on board networks with priorities (2006)
Bermond, Jean-Claude, Havet, Frédéric, Toth, C.D.
We consider on-board networks in satellites interconnecting entering signals (inputs) to amplifiers (outputs). The connections are made via expensive switches, each of which has four available links....
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,...
Bermond, Jean-Claude, Coudert, David
State-of-the-art on traffic grooming with a design theory approach
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...
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,...
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...
Fault tolerant on board networks with priorities (2006)
Bermond, Jean-Claude, Havet, Frédéric, Toth, C.D.
We consider on-board networks in satellites interconnecting entering signals (inputs) to amplifiers (outputs). The connections are made via expensive switches, each of which has four available links....
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,...
Bermond, Jean-Claude, Coudert, David
State-of-the-art on traffic grooming with a design theory approach
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...
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,...
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...
Efficient gathering in radio grids with interference (2005)
Jean-claude Bermond, Joseph Peters, Sophia Antipolis Cedex
We study the problem of gathering information from the nodes of a radio network into a central destination node. A transmission can be received by a node if it is sent from a distance of at most dT...
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 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...
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...
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...
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...
Fault tolerant on-board networks with priorities (2004)
Bermond, Jean-Claude, Havet, Frédéric, Tóth, Csaba
We consider on-board networks in satellites interconnecting entering signals (inputs) to amplifiers (outputs). The connections are made via expensive switches with four links available. The paths...
Fault tolerant on-board networks with priorities (2004)
Bermond, Jean-Claude, Havet, Frédéric, Tóth, Csaba
We consider on-board networks in satellites interconnecting entering signals (inputs) to amplifiers (outputs). The connections are made via expensive switches with four links available. The paths...
Fault tolerant on-board networks with priorities (2004)
Bermond, Jean-Claude, Havet, Frédéric, Tóth, Csaba
We consider on-board networks in satellites interconnecting entering signals (inputs) to amplifiers (outputs). The connections are made via expensive switches with four links available. The paths...
Fault tolerant on-board networks with priorities (2004)
Bermond, Jean-Claude, Havet, Frédéric, Tóth, Csaba
We consider on-board networks in satellites interconnecting entering signals (inputs) to amplifiers (outputs). The connections are made via expensive switches with four links available. The paths...
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...
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...
Jean-claude Bermond, Inria Sophia-antipolis, Robert Cypher, Johns Hopkins Univ, Tom Leighton Mit, Art Liestman
IWIN 2003 is the 7th edition of the series of International Workshops on Interconnection Networks, holding every two years. After Marseilles (France) in 1991-95, Prague (Czech Rep.) in 1997,
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...
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...
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...
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...
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...
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...
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...
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...
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3 (2002)
Bermond, Jean-Claude, Ceroi, Stephan
We consider traffic grooming in WDM unidirectional rings with all-to-all uniform unitary traffic. We determine the minimum number of SONET/SDH add-drop multiplexers (ADMs) required when the grooming...
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3 (2002)
Bermond, Jean-Claude, Ceroi, Stephan
We consider traffic grooming in WDM unidirectional rings with all-to-all uniform unitary traffic. We determine the minimum number of SONET/SDH add-drop multiplexers (ADMs) required when the grooming...
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3 (2002)
Bermond, Jean-Claude, Ceroi, Stephan
We consider traffic grooming in WDM unidirectional rings with all-to-all uniform unitary traffic. We determine the minimum number of SONET/SDH add-drop multiplexers (ADMs) required when the grooming...
Design of Fault-Tolerant Networks for Satellites (TWTA) Redundancy (2002)
Jean-Claude Bermond, Eric Darrot, Olivier Delmas
This article deals with the design of networks to be placed on satellites. These networks should connect inputs (corresponding to signals arriving at the satellite) to outputs (corresponding to...
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3 (2002)
Bermond, Jean-Claude, Ceroi, Stephan
We consider traffic grooming in WDM unidirectional rings with all-to-all uniform unitary traffic. We determine the minimum number of SONET/SDH add-drop multiplexers (ADMs) required when the grooming...
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3 (2002)
Bermond, Jean-Claude, Ceroi, Stephan
We consider traffic grooming in WDM unidirectional rings with all-to-all uniform unitary traffic. We determine the minimum number of SONET/SDH add-drop multiplexers (ADMs) required when the grooming...
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...
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...
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...
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...
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.
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.
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.
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.
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é...
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é...
Directed Virtual Path Layouts in ATM Networks (1999)
Bermond, Jean-Claude, Marlin, Nausica, Peleg, David, Pérennès, Stéphane
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in...
Symmetric flows and broadcasting in hypercubes (1999)
Bermond, Jean-Claude, Bonnecaze, A., Kodate, T., Pérennes, Stéphane, Solé, Patrick
Directed Virtual Path Layouts in ATM Networks (1999)
Bermond, Jean-Claude, Marlin, Nausica, Peleg, David, Pérennès, Stéphane
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in...
Directed Virtual Path Layouts in ATM Networks (1999)
Bermond, Jean-Claude, Marlin, Nausica, Peleg, David, Pérennès, Stéphane
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in...
Virtual path layouts with low congestion or low diameter in ATM networks (1999)
Jean-claude Bermond, Nausica Marlin, David Peleg
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in...
Optimal Orientations of Annular Networks (1999)
Jean-Claude Bermond, Johny Bond, Carole Martin, Aleksandar Pekec, Fred S. Roberts
Annular Network AN(c, s) is a graph representing a c × s grid in polar coordinates. We give lower bounds for the diameter of orientations of AN(c, s) and provide orientations which show that bounds...
Directed Virtual Path Layouts in ATM Networks (1999)
Bermond, Jean-Claude, Marlin, Nausica, Peleg, David, Pérennès, Stéphane
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in...
Directed Virtual Path Layouts in ATM Networks (1999)
Bermond, Jean-Claude, Marlin, Nausica, Peleg, David, Pérennès, Stéphane
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in...
Directed Virtual Path Layouts in ATM Networks (1998)
Jean-Claude Bermond, Nausica Marlin, David Peleg, Stéphane Perennes
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in...
Optimal Sequential Gossiping by Short Messages (1998)
Jean-Claude Bermond, Sophia Antipolis, Luisa Gargano, Stephane Perennes
Gossiping is the process of information diffusion in which each node of a network holds a block that must be communicated to all the other nodes in the network. We consider the problem of gossiping...
Optimal Sequential Gossiping by Short Messages (1998)
Jean-Claude Bermond, Sophia Antipolis, Sophia Antipolis Cedex, Luisa Gargano, Stephane Perennes
Gossiping is the process of information diffusion in which each node of a network holds a block that must be communicated to all the other nodes in the network. We consider the problem of gossiping...
Directed Virtual Path Layouts in ATM Networks (Extended Abstract) (1998)
Jean-Claude Bermond, Nausica Marlin, David Peleg, Stéphane Perennes
This article investigates the problem of designing virtual dipaths (VPs) in a directed ATM model, in which the flow of information in the two directions of a link are not identical. On top of a given...
Directed Virtual Path Layouts in ATM networks (1998)
Jean-claude Bermond, Nausica Marlin, David Peleg
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in...
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...
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...
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...
Acyclic orientations for deadlock prevention in interconnection networks (1997)
Jean-claude Bermond, Miriam Di Ianni, Michele Flammini, Stephane Perennes
In this paper we extend some of the computational results presented in [6] on the determination of an acyclic orientation of a graph which minimizes the maximum number of changes of orientations...
Graph Problems Arising from Wavelength-Routing in All-Optical Networks (1997)
Bruno Beauquier, Jean-claude Bermond, Sophia Antipolis Cedex, Sophia Antipolis Cedex, ...
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...
Graph Problems Arising from Wavelength-Routing in All-Optical Networks (1997)
Jean-Claude Bermond, Bruno Beauquier, Bruno Beauquier, Luisa Gargano, Stéphane Pérennes, Luisa Gargano, ...
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...
Graph Problems Arising from Wavelength-Routing in All-Optical Networks (1997)
Bruno Beauquier, Jean-Claude Bermond, Luisa Gargano, Pavol Hell, Stephane Perennes, Ugo Vaccaro
This paper surveys the theoretical results obtained for wavelength--routing all--optical networks, presents some new results and proposes several open problems. In all--optical networks the vast...
A Note on the Dimensionality of Modified Knödel Graphs (1997)
Jean-Claude Bermond, Hovhannes A. Harutyunyan, Arthur L. Liestman, Stephane Perennes
We show that the edges of the modified Knödel graph can be grouped into dimensions which are similar to the dimensions of hypercubes. In particular, routing, broadcasting and gossiping, can be done...
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...
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...
Hamilton Circuits in the Directed Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly digraph $\vec{{\cal WBF}}(d,n)$ of degree $d$ and dimension $n$ contains at least $d-1$ arc-disjoint Hamilton circuits, answering a conjecture of D....
Hamilton Cycle Decomposition of the Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly graph ${\cal WBF}(d,n)$ of degree $d$ and \linebreak dimension $n$ is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and...
Hamilton Circuits in the Directed Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly digraph $\vec{{\cal WBF}}(d,n)$ of degree $d$ and dimension $n$ contains at least $d-1$ arc-disjoint Hamilton circuits, answering a conjecture of D....
Hamilton Cycle Decomposition of the Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly graph ${\cal WBF}(d,n)$ of degree $d$ and \linebreak dimension $n$ is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and...
Hamilton Circuits in the Directed Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly digraph $\vec{{\cal WBF}}(d,n)$ of degree $d$ and dimension $n$ contains at least $d-1$ arc-disjoint Hamilton circuits, answering a conjecture of D....
Hamilton Cycle Decomposition of the Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly graph ${\cal WBF}(d,n)$ of degree $d$ and \linebreak dimension $n$ is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and...
Hamilton circuits in the directed Butterfly network (1996)
Jean-Claude Bermond, Eric Darrot, Olivier Delmas, Stéphane Perennes, Projet Sloop, Unite Inria, ...
In this paper, we prove that the wrapped Butterfly digraph ~ WBF(d,n) of degree d and dimension n contains at least d \Gamma 1 arc-disjoint Hamilton circuits, answering a conjecture of D. Barth. We...
Hamilton circuits in the directed Butterfly network (1996)
Jean-Claude Bermond, Jean-claude Bermond, Eric Darrot, Eric Darrot, Olivier Delmas, Olivier Delmas, ...
In this paper, we prove that the wrapped Butterfly digraph ~ WBF(d;n) of degree d and dimension n contains at least d \Gamma 1 arc-disjoint Hamilton circuits, answering a conjecture of D. Barth. We...
Efficient Collective Communication in Optical Networks (1996)
Jean-Claude Bermond, Sophia Antipolis Cedex, Luisa Gargano, Stephan Perennes, Is Cnrs, Is Cnrs, ...
This paper studies the problems of One--to--All and All--to--All Communication in optical networks. In such networks the vast bandwidth available is utilized through wavelength division multiplexing:...
Bus Interconnection Networks (1996)
Jean-Claude Bermond, Fahir Ö. Ergincan, O. Ergincan
In bus interconnection networks every bus provides a communication medium between a set of processors. These networks are modeled by hypergraphs where vertices represent the processors and edges...
Hamilton circuits in the directed wrapped Butterfly network (1996)
Jean-Claude Bermond, Jean-claude Bermond, Eric Darrot, Eric Darrot, Olivier Delmas, Olivier Delmas, ...
In this paper, we prove that the wrapped Butterfly digraph ~ WBF(d;n) of degree d and dimension n contains at least d \Gamma 1 arc-disjoint Hamilton circuits, answering a conjecture of D. Barth. We...
Hamilton cycle decomposition of the Butterfly networks. (1996)
Jean-Claude Bermond, Eric Darrot, Olivier Delmas, Stéphane Perennes
In this paper we prove that the wrapped Butterfly graph WBF(d,n) of degree d and dimension n is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and A. Raspaud who solved the...
Hamilton Circuits in the Directed Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly digraph $\vec{{\cal WBF}}(d,n)$ of degree $d$ and dimension $n$ contains at least $d-1$ arc-disjoint Hamilton circuits, answering a conjecture of D....
Hamilton Cycle Decomposition of the Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly graph ${\cal WBF}(d,n)$ of degree $d$ and \linebreak dimension $n$ is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and...
Hamilton Circuits in the Directed Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly digraph $\vec{{\cal WBF}}(d,n)$ of degree $d$ and dimension $n$ contains at least $d-1$ arc-disjoint Hamilton circuits, answering a conjecture of D....
Hamilton Cycle Decomposition of the Butterfly Network (1996)
Bermond, Jean-Claude, Darrot, Eric, Delmas, Olivier, Perennes, Stéphane
In this paper, we prove that the wrapped Butterfly graph ${\cal WBF}(d,n)$ of degree $d$ and \linebreak dimension $n$ is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and...
Hamilton circuits in directed Butterfly networks (1995)
Jean-claude Bermond, Eric Darrot, Olivier Delmas
In this paper we prove that the wrapped Butterfly digraph ~ WBF(d;n) of degree d and dimension n contains at least d \Gamma 1 arc-disjoint Hamilton circuits, answering a conjecture of D. Barth. We...
Gossiping in Cayley Graphs by Packets (1995)
Jean-Claude Bermond, Takako Kodate, Stephane Perennes
. Gossiping (also called total exchange or all-to-all communication) is the process of information diffusion in which each node of a network holds a packet that must be communicated to all other...
Efficient Broadcasting Protocols on the de Bruijn and similar Networks (1995)
Jean-Claude Bermond, Stéphane Perennes
. Broadcasting is an information dissemination process in which a message is to be sent from a single originator to all members of a network by placing calls over the communication lines of the...
Fast Gossiping by Short Messages (1995)
Jean-Claude Bermond, Is Cnrs, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
Gossiping is the process of information diffusion in which each node of a network holds a packet that must be communicated to all other nodes in the network. We consider the problem of gossiping in...
Jean-Claude Bermond, St'ephane Perennes (1995)
. Broadcasting is an information dissemination process in which a message is to be sent from a single originator to all members of a network by placing calls over the communication lines of the...
Fast Gossiping by Short Messages (1995)
Jean-Claude Bermond, Is Cnrs, Sophia Antipolis Cedex, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
Gossiping is the process of information diffusion in which each node of a network holds a packet that must be communicated to all other nodes in the network. We consider the problem of gossiping in...
Fast Gossiping by Short Messages (1995)
Jean-Claude Bermond, Is Cnrs, Sophia Antipolis Cedex, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro
Gossiping is the process of information diffusion in which each node of a network holds a packet that must be communicated to all other nodes in the network. We consider the problem of gossiping in...
Efficient Gossiping by Short Messages (1994)
Jean-Claude Bermond, Is Cnrs, A. A. Rescigno, U. Vaccaro, Sophia Antipolis Cedex, Luisa Gargano, ...
Gossiping is the process of information diffusion in which each node of a network holds a packet that must be communicated to all other nodes in the network. We consider the problem of gossiping in...
Mean eccentricities of de Bruijn networks (1993)
Bermond, Jean-Claude, Liu, Zhen, Syska, Michel
Given a graph G = (V,E) we define e(X), the mean eccentricity of a vertex X, as the average distance from X to all the other vertices of the graph. The computation of this parameter appears to be...
Mean eccentricities of de Bruijn networks (1993)
Bermond, Jean-Claude, Liu, Zhen, Syska, Michel
Given a graph G = (V,E) we define e(X), the mean eccentricity of a vertex X, as the average distance from X to all the other vertices of the graph. The computation of this parameter appears to be...
Mean eccentricities of de Bruijn networks (1993)
Jean-claude Bermond, Avenue A. Einstein, Sophia Antipolis, Zhen Liu, Michel Syska
Abstract: Given a graph G = (V; E) we define e(X), the mean eccentricity of a vertex X, as the average distance from X to all the other vertices of the graph. The computation of this parameter...
Mean Eccentricities of de Bruijn Networks (1993)
Jean-Claude Bermond, Zhen Liu, Michel Syska, Avenue A. Einstein, Avenue A. Einstein, ...
: Given a graph G = (V; E) we define e(X), the mean eccentricity of a vertex X , as the average distance from X to all the other vertices of the graph. The computation of this parameter appears to be...
Mean Eccentricities of de Bruijn Networks (1993)
Jean-Claude Bermond, Zhen Liu, Michel Syska, Avenue A. Einstein, Avenue A. Einstein, ...
: Given a graph G = (V; E) we define ¯ e(X), the mean eccentricity of a vertex X, as the average distance from X to all the other vertices of the graph. The computation of this parameter appears to...
Mean eccentricities of de Bruijn networks (1993)
Bermond, Jean-Claude, Liu, Zhen, Syska, Michel
Given a graph G = (V,E) we define e(X), the mean eccentricity of a vertex X, as the average distance from X to all the other vertices of the graph. The computation of this parameter appears to be...
Mean eccentricities of de Bruijn networks (1993)
Bermond, Jean-Claude, Liu, Zhen, Syska, Michel
Given a graph G = (V,E) we define e(X), the mean eccentricity of a vertex X, as the average distance from X to all the other vertices of the graph. The computation of this parameter appears to be...
Construction of Large Packet Radio Networks (1992)
Jean-Claude Bermond, Pavol Hell, Jean-Jacques Quisquater
. We outline constructions of packet radio networks (with time division multiplexing) that achieve much better parameters than those previously proposed. Given the desired diameter and number of...
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...
Efficient Collective Communication in Optical Networks
Jean-Claude Bermond, Sophia Antipolis Cedex, Luisa Gargano, A. A. Rescigno, U. Vaccaro, Stephan Perennes, ...
This paper studies the problems of One--to--All and All--to--All Communication in optical networks. In such networks the vast bandwidth available is utilized through wavelength division multiplexing:...
Efficient Collective Communication in Optical Networks
Jean-Claude Bermond, Is Cnrs, Sophia Antipolis, Sophia Antipolis Cedex, Luisa Gargano, ...
This paper studies the problems of broadcasting and gossiping in optical networks. In such networks the vast bandwidth available is utilized through wavelength division multiplexing: a single...
De Bruijn and Kautz Bus Networks
Jean-Claude Bermond, Fahir Ö. Ergincan, Robin W. Dawes, O. Ergincan
Our aim is to find bus interconnection networks which connect as many processors as possible, for given upper bounds on the number of connections per processor, the number of processors per bus and...