A bicriteria routing model for multi-fibre WDM networks

A bicriteria routing model for multi-fibre WDM networks All-optical WDM networks are characterised by multiple metrics (hop-count, cost, delay, available band- width, loss probability, reliability), but generally routing algorithms only optimise one metric. Having in mind the inherent limitations of this type of approach, it seems potentially advantageous in the development of multicriteria models capable of explicitly representing the different performance objectives and enabling to treat in a consistent manner the trade off among the various criteria. A bicriteria model for obtaining a topological path (unidirectional or symmetric bidirectional) for each lightpath request in a WDM network is proposed. The first criterion is related to bandwidth usage in the links (or arcs) of the network. The second criterion is the number of links (hops) of the path. The model resolution approach uses a k-shortest path algorithm as well as preference thresholds defined in the objective function space, combined with a Chebyshev distance to a reference point (which changes with the analysed preference region). The solution of this bicriteria model is a non-dominated topological path. A heuristic procedure is then used to assign wavelengths to the links. The performance of the bicriteria model is analysed by comparing it with two monocriterion approaches, using two test networks. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Photonic Network Communications Springer Journals

A bicriteria routing model for multi-fibre WDM networks

Loading next page...
 
/lp/springer_journal/a-bicriteria-routing-model-for-multi-fibre-wdm-networks-57xPxHTSIz
Publisher
Springer US
Copyright
Copyright © 2009 by Springer Science+Business Media, LLC
Subject
Computer Science; Characterization and Evaluation of Materials; Electrical Engineering; Computer Communication Networks
ISSN
1387-974X
eISSN
1572-8188
D.O.I.
10.1007/s11107-009-0192-z
Publisher site
See Article on Publisher Site

Abstract

All-optical WDM networks are characterised by multiple metrics (hop-count, cost, delay, available band- width, loss probability, reliability), but generally routing algorithms only optimise one metric. Having in mind the inherent limitations of this type of approach, it seems potentially advantageous in the development of multicriteria models capable of explicitly representing the different performance objectives and enabling to treat in a consistent manner the trade off among the various criteria. A bicriteria model for obtaining a topological path (unidirectional or symmetric bidirectional) for each lightpath request in a WDM network is proposed. The first criterion is related to bandwidth usage in the links (or arcs) of the network. The second criterion is the number of links (hops) of the path. The model resolution approach uses a k-shortest path algorithm as well as preference thresholds defined in the objective function space, combined with a Chebyshev distance to a reference point (which changes with the analysed preference region). The solution of this bicriteria model is a non-dominated topological path. A heuristic procedure is then used to assign wavelengths to the links. The performance of the bicriteria model is analysed by comparing it with two monocriterion approaches, using two test networks.

Journal

Photonic Network CommunicationsSpringer Journals

Published: Feb 25, 2009

References

  • A virtual wavelength translation scheme for routing in all-optical networks
    Bandyopadhyay, S.; Jaekel, A.; Sengupta, A.; Lang, W.
  • A tabu search heuristic for the routing and wavelength assignment problem in optical networks
    Dzongang, C.; Galinier, P.; Pierre, S.
  • Simulated annealing routing and wavelength lower bounds estimation on wavelength-division multiplexing optical multistage networks
    Katangur, A.K.; Pan, Y.; Fraser, M.D.
  • Routing and wavelength assignment by partition colouring
    Noronha, T.F.; Ribeiro, C.C.
  • Effective routing and wavelength assignment algorithms in a wavelength-routed network
    Qin, Y.; Siew, C.-K.; Li, B.

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