Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-18T08:47:24.647Z Has data issue: false hasContentIssue false

E - An Algorithm for Minimum-Interference Routing in Linear Lightwave Networks

Published online by Cambridge University Press:  05 June 2012

Thomas E. Stern
Affiliation:
Columbia University, New York
Georgios Ellinas
Affiliation:
University of Cyprus
Krishna Bala
Affiliation:
Xtellus, New Jersey
Get access

Summary

Given a source s and destination d for a point-to-point connection on a selected waveband in an LLN, the Min-Int algorithm presented here attempts to find a minimum-interference optical path p = 〈s, d〉 for that connection on the given waveband. The exact sense in which interference is minimized requires some explanation and is defined in Section E.3.

The Image Network

The approach used to find a path that minimizes interference is based on shortest path calculations, where the path “length” takes into account weights or “lengths” representing currently active interfering signals. These weights are associated with nodes rather than links. A useful way of visualizing the node-weighting procedure is shown in the image network of Figure E.1. In the network shown in the figure, each node of the original network is “blown up” to create additional intranodal links between each input/output port pair. This is nothing more than a representation of the internal structure of the LDC on the chosen waveband (see Figure 2.19[b]). The image network of Figure E.1 corresponds to the state of activity in the network of Figure 6.55. Two optical connections, (1, 1*) and (2, 2*), are active, with signal S1 transmitted from station 1 to 1* and signal S2 transmitted from station 2 to 2*.

We shall denote an internodal link from node i to node j by (i, j) and assign it a positive weight d(i, j).

Type
Chapter
Information
Multiwavelength Optical Networks
Architectures, Design, and Control
, pp. 893 - 895
Publisher: Cambridge University Press
Print publication year: 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×