Adaptive load-balancing in WDM mesh networks with performance guarantees

Adaptive load-balancing in WDM mesh networks with performance guarantees In nowadays, wavelength-division multiplexing (WDM) networks, on the one hand, increasingly more users expect the network to provide high-priority QoS services demanding no congestion and low latency. On the other hand, it is significantly more difficult for network operators to forecast future traffic demands, as the packet traffic running over WDM networks fluctuates over time for a variety of reasons. Confronted with a rough understanding of traffic patterns as well as the increasing number of time-sensitive applications, most networks today are grossly over-provisioned. Thus, designing cost-effective WDM networks in an uncertain traffic environment, which includes network planning and robust routing, is both an important and a challenging task. In this paper, we explore adaptive load-balancing to investigate the problems of network planning and robust routing for WDM mesh networks under varying traffic matrices. We first propose an efficient heuristic algorithm called Maximizing Network Capability (MNC) to provision congestion-free and cost-effective WDM networks based on load-balancing to deal with traffic uncertainty. Then, a novel traffic grooming algorithm called Adding Direct Traffic (ADT) is proposed to implement robust routing with partial traffic information. Finally, we demonstrate by simulation that MNC consumes less resources than previous methods and performs quite close to the optimal solution, while ADT achieves the desirable performance in delay, jitter (delay variation), and throughput compared with existing robust routing and traffic grooming algorithms. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Photonic Network Communications Springer Journals

Adaptive load-balancing in WDM mesh networks with performance guarantees

Loading next page...
 
/lp/springer_journal/adaptive-load-balancing-in-wdm-mesh-networks-with-performance-hqGuiqrYJz
Publisher
Springer Journals
Copyright
Copyright © 2010 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-010-0294-7
Publisher site
See Article on Publisher Site

Abstract

In nowadays, wavelength-division multiplexing (WDM) networks, on the one hand, increasingly more users expect the network to provide high-priority QoS services demanding no congestion and low latency. On the other hand, it is significantly more difficult for network operators to forecast future traffic demands, as the packet traffic running over WDM networks fluctuates over time for a variety of reasons. Confronted with a rough understanding of traffic patterns as well as the increasing number of time-sensitive applications, most networks today are grossly over-provisioned. Thus, designing cost-effective WDM networks in an uncertain traffic environment, which includes network planning and robust routing, is both an important and a challenging task. In this paper, we explore adaptive load-balancing to investigate the problems of network planning and robust routing for WDM mesh networks under varying traffic matrices. We first propose an efficient heuristic algorithm called Maximizing Network Capability (MNC) to provision congestion-free and cost-effective WDM networks based on load-balancing to deal with traffic uncertainty. Then, a novel traffic grooming algorithm called Adding Direct Traffic (ADT) is proposed to implement robust routing with partial traffic information. Finally, we demonstrate by simulation that MNC consumes less resources than previous methods and performs quite close to the optimal solution, while ADT achieves the desirable performance in delay, jitter (delay variation), and throughput compared with existing robust routing and traffic grooming algorithms.

Journal

Photonic Network CommunicationsSpringer Journals

Published: Oct 7, 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 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