Skip to Main Content
We consider a wireless backbone network with free space optical point-to-point links. Each backbone node has a limited number of transceivers with which to establish links to neighbors. Requests for aggregate bandwidth between pairs of backbone nodes arrive one-by-one and future demands are unknown. When a demand arrives, a bandwidth guaranteed path is established between the source and destination backbone nodes. Each time a path is established, it appropriates resources-link bandwidth and transceivers-that might be needed for future demands. The problem we consider is that of determining how to choose the bandwidth guaranteed paths in order to minimize the likelihood that future demands will be rejected due to lack of resources. The algorithm we propose is distinguished by its taking into account the potential interference with future demands caused by the reduction of the number of available transceivers when new links are established. Through simulations, we demonstrate that the performance of the new algorithm is superior to existing alternatives.