Assigning routes and wavelengths for collaboration over optical networks

Assigning routes and wavelengths for collaboration over optical networks The Routing and Wavelength Assignment problem is investigated in the context of collaboration where tools are shared and used simultaneously over a fiber optic network. Both online and offline versions are discussed, with and without using time as a parameter for scheduling purposes, and including the case where the network is used to carry time-multiplexed traffic. Also, the problem of rescheduling a blocked demand is studied. Several solutions based on Integer Linear Programs (ILP) and heuristics are proposed, implemented and their performance compared. The offline case is solved using two types of ILPs: link and path formulations. ILPs are also proposed for the online problem in addition to heuristic algorithms. While the link formulations give optimal solutions, they take a long time to solve and thus they can only be used for small problems. Path formulations and heuristics scale better but at the expense of optimality. The online approach is recommended when the resort to an offline approach is forbidden by the size of the problem. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Photonic Network Communications Springer Journals

Assigning routes and wavelengths for collaboration over optical networks

Loading next page...
 
/lp/springer_journal/assigning-routes-and-wavelengths-for-collaboration-over-optical-xQyOmVaCwz
Publisher
Springer US
Copyright
Copyright © 2010 by Springer Science+Business Media, LLC
Subject
Computer Science; Electrical Engineering; Computer Communication Networks; Characterization and Evaluation of Materials
ISSN
1387-974X
eISSN
1572-8188
D.O.I.
10.1007/s11107-010-0302-y
Publisher site
See Article on Publisher Site

Abstract

The Routing and Wavelength Assignment problem is investigated in the context of collaboration where tools are shared and used simultaneously over a fiber optic network. Both online and offline versions are discussed, with and without using time as a parameter for scheduling purposes, and including the case where the network is used to carry time-multiplexed traffic. Also, the problem of rescheduling a blocked demand is studied. Several solutions based on Integer Linear Programs (ILP) and heuristics are proposed, implemented and their performance compared. The offline case is solved using two types of ILPs: link and path formulations. ILPs are also proposed for the online problem in addition to heuristic algorithms. While the link formulations give optimal solutions, they take a long time to solve and thus they can only be used for small problems. Path formulations and heuristics scale better but at the expense of optimality. The online approach is recommended when the resort to an offline approach is forbidden by the size of the problem.

Journal

Photonic Network CommunicationsSpringer Journals

Published: Nov 4, 2010

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve Freelancer

DeepDyve Pro

Price
FREE
$49/month

$360/year
Save searches from Google Scholar, PubMed
Create lists to organize your research
Export lists, citations
Access to DeepDyve database
Abstract access only
Unlimited access to over
18 million full-text articles
Print
20 pages/month
PDF Discount
20% off