A new solution to the K-shortest paths problem and its application in wavelength routed optical networks

A new solution to the K-shortest paths problem and its application in wavelength routed optical... In communication networks, traffic carried over long paths suffers from a higher call blocking probability (CBP) than those carried over short paths. This is a well-known fairness problem. Such a problem becomes more serious in wavelength-routed optical networks (WRONs) due to the wavelength continuity constraint. This paper aims to enhance the fairness characteristic in WRONs by the novel classified alternate routing (CAR) approach. As a foundation of this approach, the first K-shortest paths (KSP) between a designated source/destination node pair in a given network should be obtained simultaneously. This has been studied as the KSP problem in the literature. In this paper, a new loopless deviation (LD) algorithm for solving such a loopless KSP problem will be proposed. It outperforms existing solutions in terms of running time in real-life implementations. In order to measure the fairness characteristic, we first classify all connection requests into categories such as 1-hop traffic, 2-hop traffic, etc., according to the number of minimal hop count between the corresponding source/destination node pair. We then quantify the fairness characteristic by the ratio of the average CBP of each traffic category to that of 1-hop traffic such that CBP ratios with a value closer to 1 are preferred. We will show that such a measure criterion is more precise and robust than existing ones in the literature. Finally, numerical experiments will reveal that the CAR approach outperforms existing fairness enhancement methods when considering the comprehensive performance in terms of the balance between the fairness characteristic and the overall CBP feature. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Photonic Network Communications Springer Journals

A new solution to the K-shortest paths problem and its application in wavelength routed optical networks

Loading next page...
 
/lp/springer_journal/a-new-solution-to-the-k-shortest-paths-problem-and-its-application-in-MU7oB9TXwH
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-0027-0
Publisher site
See Article on Publisher Site

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

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches

$49/month

Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.

$588

$360/year

billed annually
Start Free Trial

14-day Free Trial