The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Motivated by the wavelength division multiplexing in all-optical networks, we consider the problem of finding an optimal (with respect to the least possible number of wavelengths) set of internally node disjoint dipaths connecting all pairs of distinct nodes in the binary -dimensional hypercube, where . This system of dipaths constitutes a routing protocol that remains functional in the presence of up to faults (of nodes and/or links). The problem of constructing such protocols for general...
Motivated by the wavelength division multiplexing in all-optical
networks, we consider the problem of finding an optimal (with
respect to the least possible number of wavelengths) set of ƒ+1
internally node disjoint dipaths connecting all pairs of distinct
nodes in the binary r-dimensional hypercube, where 0 ≤ ƒ < r. This system of dipaths constitutes a routing protocol that
remains functional in the presence of up to ƒ faults (of nodes
and/or links). The problem of constructing such...
Currently displaying 1 –
3 of
3