Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Investigation of the scalability of dynamic wavelength-routed optical networks [Invited]

Not Accessible

Your library or personal account may give you access

Abstract

Feature Issue on Optical Interconnection Networks (OIN). We describe results of the scalability analysis for dynamic wavelength-routed optical networks with end-to-end lightpath assignment and central network control with electronic scheduling and processing of lightpath requests. We investigate the effect of the algorithm complexity in both the scheduling and the dynamic routing and wavelength assignment (DRWA) of lightpath requests. Scheduling theory and static performance-prediction techniques were applied to define the bounds on the electronic processing time of requests, and hence the maximum number of nodes supported by a centralized dynamic optical network for given blocking probability, latency, and network diameter. Scalability analysis results show that medium-sized centralized networks (~50 nodes) can be supported when these networks are reconfigured on a burst-by-burst basis. In addition, we found that real topologies showed a complex trade-off between the request processing time, blocking probability, and resource requirements. These findings can be used to determine the optimum combination of scheduling/DRWA algorithm, showing that the fastest DRWA algorithm does not necessarily lead to the minimum blocking probability and maximum scalability but that a careful consideration of both blocking and processing speed is required. The results are applicable both to dynamic network architectures with centralized request processing such as wavelength-routed optical networks and to the design of advanced optical switching matrices and routers.

© 2004 Optical Society of America

PDF Article
More Like This
Scalable software-defined optical networking with high-performance routing and wavelength assignment algorithms

Chankyun Lee, Xiaoyuan Cao, Noboru Yoshikane, Takehiro Tsuritani, and June-Koo Kevin Rhee
Opt. Express 23(21) 27354-27360 (2015)

Priority Based Routing and Wavelength Assignment With Traffic Grooming for Optical Networks

Bijoy Chand Chatterjee, Nityananda Sarma, and Partha Pritim Sahu
J. Opt. Commun. Netw. 4(6) 480-489 (2012)

Distributed Grooming, Routing, and Wavelength Assignment for Dynamic Optical Networks Using Ant Colony Optimization

X. Wang, M. Brandt-Pearce, and S. Subramaniam
J. Opt. Commun. Netw. 6(6) 578-589 (2014)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved