Quality, Reliability, Security and Robustness in Heterogeneous Networks. 7th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010, and Dedicated Short Range Communications Workshop, DSRC 2010, Houston, TX, USA, November 17-19, 2010, Revised Selected Papers

Research Article

Dynamically Provisioned Priority-Aware Algorithms in Shared Mesh Optical Networks

Download259 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-29222-4_21,
        author={Alireza Nafarieh and Shyamala Sivakumar and William Phillips and William Robertson},
        title={Dynamically Provisioned Priority-Aware Algorithms in Shared Mesh Optical Networks},
        proceedings={Quality, Reliability, Security and Robustness in Heterogeneous Networks. 7th International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness, QShine 2010, and Dedicated Short Range Communications Workshop, DSRC 2010, Houston, TX, USA, November 17-19, 2010, Revised Selected Papers},
        proceedings_a={QSHINE},
        year={2012},
        month={10},
        keywords={Shared mesh optical networks priority-aware algorithm dynamic service level agreement negotiation static maximum path availability algorithm dynamic maximum path availability algorithm and maximum path availability metric},
        doi={10.1007/978-3-642-29222-4_21}
    }
    
  • Alireza Nafarieh
    Shyamala Sivakumar
    William Phillips
    William Robertson
    Year: 2012
    Dynamically Provisioned Priority-Aware Algorithms in Shared Mesh Optical Networks
    QSHINE
    Springer
    DOI: 10.1007/978-3-642-29222-4_21
Alireza Nafarieh1,*, Shyamala Sivakumar2,*, William Phillips1,*, William Robertson1,*
  • 1: Dalhousie University
  • 2: Saint Mary’s University
*Contact email: ali.nafarieh@dal.ca, ssivakumar@smu.ca, william.phillips@dal.ca, bill.robertson@dal.ca

Abstract

The paper introduces two novel algorithms, one each for static and dynamic traffic types, to improve the availability of high priority connection requests over shared mesh optical networks. The proposed algorithms are a complementary study to the previous work. The paper also proposes a new metric, maximum path availability, by which the proposed algorithms improve the performance of high priority requests by reducing blocking probability, increasing availability satisfaction rate, and with better resource utilization using dynamic negotiation of service level agreement parameters between a customer and service providers. In a multi-homed network topology, the introduced algorithms along with the proposed metric can help the customers to modify, refine and further process the final connection requests to better comply with service providers’ network capacity. The simulation results show improvements on preserving the high priority class of traffic for both static and dynamic traffic types compared to other protection schemes in shared mesh optical networks.