A good dynamic routing scheme is very important to improve the provisioning efficiency of wavelength-routed optical networks. The existing dynamic routing algorithms are usually based on first-come-first-serve (FCFS) scheme to process the lightpath requests one by one. However, multiple lightpath requests may arrive simultaneously and burstly in data-intensive applications, and can not be treated efficiently by using the FCFS scheme. We will propose a new online dynamic routing scheme to process the lightpath requests in batch instead of one by one, which is termed batch-come-batch-serve (BCBS) scheme. A mathematic model and several adaptive routing algorithms are proposed and investigated comparatively. The simulation results suggest that the proposed scheme achieves better network blocking performances.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.