IDEAS home Printed from https://ideas.repec.org/p/snv/dp2009/2013107.html
   My bibliography  Save this paper

Disjoint Paths Pair Computation Procedure for SDH/SONET Networks

Author

Listed:
  • A. Mohammad Hassan

    () (College of Engineering, Seoul National University)

  • Jorn Altmann

    () (College of Engineering, Seoul National University)

Abstract

The increasing demand for bandwidth and the error-prone, costly, and long-lasting service provisioning process force carriers to find new ways of automatic service provisioning. Despite the introduction of numerous path computation procedures, suitable for WDM-technology-based networks, very few studies exist that discusses the SDH/SONET specific multiplexing requirements. Furthermore, the existing disjoint path computation procedures do not always find the best possible path between two nodes. In this paper, we propose a path computation procedure capable of addressing the SDH/SONET multiplexing requirements and the shortcomings of the existing disjoint path computation procedures. Our disjoint paths pair computation procedure is applied to the topology of the NSF.net network. The simulation results, obtained with Matlab, suggest that the proposed procedure outperforms existing path computation procedures. The proposed procedure covers the demand for bandwidth with fewer resources. Furthermore, it finds paths considering the capacity units of SDH/SONET. It is also observed that the time complexity is tolerable.

Suggested Citation

  • A. Mohammad Hassan & Jorn Altmann, 2013. "Disjoint Paths Pair Computation Procedure for SDH/SONET Networks," TEMEP Discussion Papers 2013107, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP), revised Oct 2013.
  • Handle: RePEc:snv:dp2009:2013107
    as

    Download full text from publisher

    File URL: ftp://147.46.237.98/DP-107.pdf
    File Function: First version, 2013
    Download Restriction: no

    References listed on IDEAS

    as
    1. Ahmad Mohammad Hassan & Jorn Altmann & Victor Lopez, 2012. "Control Plane Framework Emergence and its Deployment Cost Estimation," TEMEP Discussion Papers 201294, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP), revised Jun 2012.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    Resource Allocation; Disjoint Paths; Path Computation Procedure; SDH/SONET Technology; Optimal Path Selection; Transport Networks; Service Provisioning.;

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
    • L86 - Industrial Organization - - Industry Studies: Services - - - Information and Internet Services; Computer Software
    • L96 - Industrial Organization - - Industry Studies: Transportation and Utilities - - - Telecommunications
    • M15 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Business Administration - - - IT Management

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:snv:dp2009:2013107. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Jorn Altmann). General contact details of provider: http://edirc.repec.org/data/tesnukr.html .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.