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)
Institutional fund managers generally rebalance using ad hoc methods such as calendar basis or tolerance band triggers. We propose a different framework that quantifies the cost of a rebalancing strategy in terms of risk-adjusted returns net of transaction costs. We then develop an optimal rebalancing strategy that actively seeks to minimize that cost. We(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)
This paper considers the problem of connecting a collection of nodes to a backbone network. Each node may be directly connected to the backbone, at some cost, or it may communicate wirelessly to a directly connected hub and share its connection, at the "cost" of using spectrum for the wireless link. This problem arises in diverse areas such as cellular(More)