Li-Wei Chen

Learn More
We consider routing and wavelength assignment in ring, torus, and tree topologies with the twin objectives of minimizing wavelength usage and maximizing optical bypass. The P-port dynamic traffic assumption is used, which allows each node to send and receive at most P calls. For rings we show that P N/4 wavelengths are necessary and sufficient, and provide(More)
— We consider the problem of wavelength assignment in a reconfigurable bi-directional ring network with wavelength converters. We show that for N-node P-port bidirectional rings, a minimum number of P N/4 wavelengths are required to support all possible virtual topologies in a rearrangeably non-blocking fashion, and provide an algorithm that meets this(More)
We consider the problem of wavelength assignment in reconfigurable WDM networks with wavelength converters. We show that for <i>N</i>-node <i>P</i>-port bidirectional rings, a minimum number of &#8968;<i>PN</i>/4&#8969; wavelengths are required to support all possible connected virtual topologies in a rearrangeably nonblocking fashion, and provide an(More)
— We compare the effectiveness of uniform versus non-uniform waveband switching under the dual cost metrics of switching requirements and fiber capacity. We consider a star topology and begin by characterizing the optimal performance frontier achievable under no restrictions on waveband sizing, and provide algorithms employing non-uniform waveband sizing(More)
We compare the effectiveness of uniform versus non-uniform waveband switching under the dual cost metrics of switching requirements and fiber capacity. We consider a star topology and begin by characterizing the optimal performance frontier achievable under no restrictions on waveband sizing, and provide algorithms employing non-uniform waveband sizing that(More)
— In this paper, we use an asymptotic analysis similar to the sphere-packing argument in the proof of Shannon's channel capacity theorem to derive optimal pro-visioning requirements for networks with both static and dynamic provisioning. We consider an N-user shared-link model where W s wavelengths are statically assigned to each user, and a common pool of(More)
  • 1