Routing and wavelength assignment in optical WDM networks with maximum quantity of edge disjoint paths

Routing and wavelength assignment in optical WDM networks with maximum quantity of edge disjoint... In the present paper, routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques based on the combination of integer linear programming based lpsolver and graph coloring are complex and require extensive use of heuristics such as rounding heuristic which makes them slow and sometimes practically not reasonable. Another method employs the greedy approach in graph theory for obtaining available edge disjoint paths. Even though it is fast, it produces a solution for any connection request which is far from the optimal utilization of wavelengths. We propose a novel algorithm, which is based on the maximum flow to have the maximum quantity of edge disjoint paths. Here, we compare the offered method with previous edge disjoint paths algorithms applied to the RWA. Comprehensive computer simulation shows that the proposed method outperforms previous ones significantly in terms of running time. Furthermore, the new method shows compatible or better performance comparing to others in number of wavelengths used. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Photonic Network Communications Springer Journals

Routing and wavelength assignment in optical WDM networks with maximum quantity of edge disjoint paths

Loading next page...
 
/lp/springer_journal/routing-and-wavelength-assignment-in-optical-wdm-networks-with-maximum-XhHzyIx1MF
Publisher
Kluwer Academic Publishers-Plenum Publishers
Copyright
Copyright © 2006 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-006-0008-3
Publisher site
See Article on Publisher Site

Abstract

In the present paper, routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques based on the combination of integer linear programming based lpsolver and graph coloring are complex and require extensive use of heuristics such as rounding heuristic which makes them slow and sometimes practically not reasonable. Another method employs the greedy approach in graph theory for obtaining available edge disjoint paths. Even though it is fast, it produces a solution for any connection request which is far from the optimal utilization of wavelengths. We propose a novel algorithm, which is based on the maximum flow to have the maximum quantity of edge disjoint paths. Here, we compare the offered method with previous edge disjoint paths algorithms applied to the RWA. Comprehensive computer simulation shows that the proposed method outperforms previous ones significantly in terms of running time. Furthermore, the new method shows compatible or better performance comparing to others in number of wavelengths used.

Journal

Photonic Network CommunicationsSpringer Journals

Published: Aug 22, 2006

References

  • Lightpath (wavelength) in large WDM networks
    Chlamtac, I.; Farago, A.; Zhang, T.

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