Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks

Ramamurthy, Ramu; Mukherjee, Biswanath

doi:10.1109/tnet.2002.1012367

Cited by 176 publications

(36 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…1. Routing Policies Shortest-Path First (SPF): SPF [22] [23] pre-computes a single fixed route for each source-destination pair using a shortest-path algorithm, such as Dijkstra's algorithm [24]. When a connection request arrives in the network, it tries to establish a lightpath along the pre-computed fixed route.…”

Section: B Solution Strategiesmentioning

confidence: 99%

Dynamic routing, spectrum, and modulation-format allocation in mixed-grid optical networks

Ahmed

Rahman

Ferdousi

et al. 2020

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

Traffic in optical backbone networks is evolving rapidly in terms of type, volume, and dynamicity following the rapid growth of cloud-based services, ongoing adoption of 5G communications, and explosion of Internet of Things (IoT). Elastic Optical Network (EON), by adopting a flexible grid, can provide the required capacity and flexibility to handle these rapid changes. However, operators rarely perform greenfield deployments, so to limit upfront investment, a gradual migration from fixed-grid to flexible-grid switching equipment is preferable. For gradual migration, switching nodes can be upgraded (starting from bottleneck network links) while keeping the rest of the traditional fixed-grid network operational. We refer to the co-existence of fixed-grid and flex-grid optical equipment as a "mixed-grid" network. Traditional algorithms for dynamic resource assignment in EON will not effectively be applicable in a mixedgrid network due to inter-operability issues among fixed and flex-grid nodes. In this study, we propose a new algorithm, called Mixed-grid-aware Dynamic Resource Allocation (MDRA), to solve the route, spectrum, and modulation-format allocation (RSMA) problem in a mixed-grid network while considering inter-operability constraints. Our numerical results (on representative network topologies) show that the proposed method achieves 41% less blocking (for 50% offered load) compared to traditional approach. The proposed method also can gain about 15% more spectrum utilization for same load.

show abstract

Section: B Solution Strategiesmentioning

confidence: 99%

Dynamic routing, spectrum, and modulation-format allocation in mixed-grid optical networks

Ahmed

Rahman

Ferdousi

et al. 2020

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

show abstract

“…The constraints to ensure that node uses at most Trans transmitters on wavelength are (18) The constraints to ensure that two backup lightpaths originating at node share a transmitter on wavelength only if the corresponding primary paths are fiber disjoint are The constraints to ensure that the total amount of traffic flowing through a lightpath is less than the capacity of the lightpath are (28)…”

Section: Minimize (7)mentioning

confidence: 99%

Fault management in IP-over-WDM networks: WDM protection versus IP restoration

Sahasrabuddhe¹,

Ramamurthy²,

Mukherjee³

2002

IEEE J. Select. Areas Commun.

Self Cite

179

106

View full text Add to dashboard Cite

We consider an IP-over-WDM network in which network nodes employ optical crossconnects and IP routers. Nodes are connected by fibers to form a mesh topology. Any two IP routers in this network can be connected together by an all-optical wavelength-division multiplexing (WDM) channel, called a lightpath, and the collection of lightpaths that are set up form a virtual topology. In this paper, we concentrate on single fiber failures, since they are the predominant form of failures in optical networks. Since each lightpath is expected to operate at a rate of few gigabits per second, a fiber failure can cause a significant loss of bandwidth and revenue. Thus, the network designer must provide a fault-management technique that combats fiber failures. We consider two faultmanagement techniques in an IP-over-WDM network: 1) provide protection at the WDM layer (i.e., set up a backup lightpath for every primary lightpath) or 2) provide restoration at the IP layer (i.e., overprovision the network so that after a fiber failure, the network should still be able to carry all the traffic it was carrying before the fiber failure). We formulate these fault-management problems mathematically, develop heuristics to find efficient solutions in typical networks, and analyze their characteristics (e.g., maximum guaranteed network capacity in the event of a fiber failure and the recovery time) relative to each other.

show abstract

“…Dynamic routing in wavelength-routed WDM networks has been studied extensively in the literature and several dynamic routing algorithms have been proposed [1,8,10,11,16,24]. A methodology for dynamic routing of subwavelength traffic in WDM grooming networks is developed in [21].…”

Section: Related Workmentioning

confidence: 99%

Dynamic Routing with Partial Information in Mesh-Restorable Optical Networks

Sridharan

Srinivasan²,

Somani

2003

Next Generation Optical Network Design and Modelling

View full text Add to dashboard Cite

Changing trends in backbone transport networks towards dynamic path provisioning and evolving optical technologies have motivated the study of dynamic routing algorithms in the context of Multi Protocol Label Switching (MPLS) based networks. Several methods have been proposed for joint optimization of working and spare capacity in survivable optical networks. These techniques are centralized and do not scale well as they rely on per-flow information. This motivates the need for developing a) distributed algorithms with complete information, b) source based algorithms with partial information which can be easily obtained from traffic engineering extensions to routing protocols. In this paper, we develop dynamic algorithms for source based routing with partial information. The algorithms are classified based on the path selection approach used for the primary path. We compare the performance of various routing algorithms through simulation studies, based on metrics such as the call blocking probability, average path length of an accepted connections, capacity redundancy, and effective network utilization. Our studies show that dynamic routing algorithms perform better than static routing algorithms using pre-computed paths even when the path selection in static algorithms is based on optimizing a global network metric. The other interesting observation we make is that the performance improvement of dynamic routing algorithms using K pre-computed paths is significant even for small values of K.

show abstract

Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks

Cited by 176 publications

References 22 publications

Dynamic routing, spectrum, and modulation-format allocation in mixed-grid optical networks

Dynamic routing, spectrum, and modulation-format allocation in mixed-grid optical networks

Fault management in IP-over-WDM networks: WDM protection versus IP restoration

Dynamic Routing with Partial Information in Mesh-Restorable Optical Networks

Contact Info

Product

Resources

About