Partitioning-based approach to control the restored path length in p-cycle-based survivable optical networks

Partitioning-based approach to control the restored path length in p-cycle-based survivable... In recent years, p-cycles have been widely investigated for survivability of WDM networks. They provide fast recovery speed such as ring and capacity efficiency as mesh survivability schemes. However, restoration paths are very long, which causes excessive latency and intolerable physical impairments. On the other hand, nowadays, a wide set of applications require an optical path with almost no delay. The existing approaches, namely loopbacks removal and inter-cycle switching, provide a significant reduction in the restored path, but even then a number of restored paths remain many times longer than the working path lengths. In this paper, we propose a network partitioning-based approach to control the length of each restored path as per delay sustainability of time critical applications. The basic idea of the work is to partition the network into domains and construct the p-cycles for each domain independently. The domain wise construction of p-cycles restricts their length, which consequently reduces the length of restored paths. Here, we introduce a new concept where the selected border nodes are overlapped among adjacent domains to cover inter-domain spans of the network as a domain span in order to ensure their survivability through domain p-cycles. Simulation results show that the proposed solution is good enough to control the restored path length with small augmentation in redundancy of spare capacity as compared to optimal design of p-cycles. More importantly, it enhances the dual failure restorability significantly. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Photonic Network Communications Springer Journals

Partitioning-based approach to control the restored path length in p-cycle-based survivable optical networks

Loading next page...
 
/lp/springer_journal/partitioning-based-approach-to-control-the-restored-path-length-in-p-yxTTNWfyG5
Publisher
Springer Journals
Copyright
Copyright © 2016 by Springer Science+Business Media New York
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-016-0659-7
Publisher site
See Article on Publisher Site

Abstract

In recent years, p-cycles have been widely investigated for survivability of WDM networks. They provide fast recovery speed such as ring and capacity efficiency as mesh survivability schemes. However, restoration paths are very long, which causes excessive latency and intolerable physical impairments. On the other hand, nowadays, a wide set of applications require an optical path with almost no delay. The existing approaches, namely loopbacks removal and inter-cycle switching, provide a significant reduction in the restored path, but even then a number of restored paths remain many times longer than the working path lengths. In this paper, we propose a network partitioning-based approach to control the length of each restored path as per delay sustainability of time critical applications. The basic idea of the work is to partition the network into domains and construct the p-cycles for each domain independently. The domain wise construction of p-cycles restricts their length, which consequently reduces the length of restored paths. Here, we introduce a new concept where the selected border nodes are overlapped among adjacent domains to cover inter-domain spans of the network as a domain span in order to ensure their survivability through domain p-cycles. Simulation results show that the proposed solution is good enough to control the restored path length with small augmentation in redundancy of spare capacity as compared to optimal design of p-cycles. More importantly, it enhances the dual failure restorability significantly.

Journal

Photonic Network CommunicationsSpringer Journals

Published: Oct 6, 2016

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