Some studies on path protection in WDM networks

Some studies on path protection in WDM networks Path protection in WDM networks is one of the popular ways to design resilient WDM networks. Although complete ILP formulations for optimal design of WDM networks have been proposed in literature, the computational cost of actually solving such formulations make this approach impractical, even for moderate sized networks. This high computational cost arises mainly due to the large number of integer variables in the formulations, which increases the complexity exponentially. As a result, most practical solutions use heuristics, which do not provide any guarantees on the performance. In this article, we propose two novel ILP formulations, which drastically reduce the number of integer variables compared to existing ILPs. This leads to much more efficient formulations. We also present a simple heuristic that may be used for larger networks for which ILP formulations become computationally intractable. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Photonic Network Communications Springer Journals

Some studies on path protection in WDM networks

Loading next page...
 
/lp/springer_journal/some-studies-on-path-protection-in-wdm-networks-uPVjunvZ8l
Publisher
Springer Journals
Copyright
Copyright © 2007 by Springer Science+Business Media, LLC
Subject
Computer Science; Computer Communication Networks; Electrical Engineering; Characterization and Evaluation of Materials
ISSN
1387-974X
eISSN
1572-8188
D.O.I.
10.1007/s11107-007-0075-0
Publisher site
See Article on Publisher Site

Abstract

Path protection in WDM networks is one of the popular ways to design resilient WDM networks. Although complete ILP formulations for optimal design of WDM networks have been proposed in literature, the computational cost of actually solving such formulations make this approach impractical, even for moderate sized networks. This high computational cost arises mainly due to the large number of integer variables in the formulations, which increases the complexity exponentially. As a result, most practical solutions use heuristics, which do not provide any guarantees on the performance. In this article, we propose two novel ILP formulations, which drastically reduce the number of integer variables compared to existing ILPs. This leads to much more efficient formulations. We also present a simple heuristic that may be used for larger networks for which ILP formulations become computationally intractable.

Journal

Photonic Network CommunicationsSpringer Journals

Published: Jul 17, 2007

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 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

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

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off