Optical networks and the related technologies, network management software and services
have undergone remarkable developments, and such networks are now the ultra-high …

Motivated by the connection between graph decompositions and traffic grooming in optical
networks, we continue the investigation of the existence problem for (K_5∖e)-designs of …

In order to reduce the number of add-drop multiplexers (ADMs) in SONET/WDM networks
using wavelength add-drop multiplexing, certain graph decompositions can be used to form …

AG‐design of order n is a decomposition of the complete graph on n vertices into edge‐
disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring …

Minimizing the number of add‐drop multiplexers (ADMs) in a unidirectional SONET ring can
be formulated as a graph decomposition problem. When traffic requirements are uniform …

Let D be the triangle with an attached edge (ie D is the “kite”, a graph having vertices {a0,
a1, a2, a3} and edges {a0, a1},{a0, a2},{a1, a2},{a0, a3}). Bermond and Schönheim [G …

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 …

Grooming uniform all-to-all traffic in optical ring networks with grooming ratio C requires the
determination of graph decompositions of the complete graph into subgraphs each having at …

Les problèmes étudiés dans cette thèse sont motivés par des questions issues de
l'optimisation des réseaux de télécommunication. Nous avons abordé ces problèmes sous …

Grooming uniform all-to-all traffic in optical ring networks with grooming ratio C requires the
determination of graph decompositions of the complete graph into subgraphs each having at …