Xavier Munoz

Dr. Xavier Munoz


Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 February 2002
Verified
Book Chapter
Closed access
PDF file
XMXavier Munoz
Xavier Munoz
WUW. Unger
W. Unger
IVImrich Vrt’o
Imrich Vrt’o

10 June 2000 in Applied Optics
Verified
Journal Article
Closed access
PDF file
DCDavid Coudert
David Coudert
AFAfonso Ferreira
Afonso Ferreira
XMXavier Munoz
Xavier Munoz
Many results exist in the literature describing technological and theoretical advances in optical network topologies and design. However, an essential effort has yet to be made in linking those results together. We propose a step in this direction by giving optical layouts for several graph-theoretical topologies studied in the literature, using the optical transpose interconnection system (OTIS) architecture. These topologies include the family of partitioned optical passive star (POPS) and stack-Kautz networks as well as a generalization of the Kautz and the de Bruijn digraphs.

1 January 2005 in SIAM Journal on Discrete Mathematics
Verified
Journal Article
Closed access
JBJean-Claude Bermond
Jean-Claude Bermond
CCCharles J. Colbourn
Charles J. Colbourn
DCDavid Coudert
David Coudert
GGGennian Ge
Gennian Ge
ALAlan C. H. Ling
Alan C. H. Ling
XMXavier Munoz
Xavier Munoz
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 decomposition is the sum, over all graphs in the decomposition, of the number of vertices of nonzero degree in the graph. The existence of such decompositions with minimum cost, when every pair of sites employs no more than $\frac{1}{6}$ of the wavelength capacity, is determined with a finite number of possible exceptions. Indeed, when the number N of sites satisfies $N \equiv 1 \pmod{3}$, the determination is complete, and when $N \equiv 2 \pmod{3}$, the only value left undetermined is N = 17. When $N \equiv 0 \pmod{3}$, a finite number of values of N remain, the largest being N = 2580. The techniques developed rely heavily on tools from combinatorial design theory.

1 January 2008 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
XMXavier Munoz
Xavier Munoz
ISIgnasi Sau
Ignasi Sau

1 January 2009 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
XMXavier Munoz
Xavier Munoz
SSSebastian Seibert
Sebastian Seibert
WUWalter Unger
Walter Unger

8 January 2016 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
EBElisabet Burjons
Elisabet Burjons
JHJuraj Hromkovič
Juraj Hromkovič
XMXavier Munoz
Xavier Munoz
WUWalter Unger
Walter Unger