Disjoint Paths Pair Computation Procedure for SDH/SONET Networks
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.
|Date of creation:||Oct 2013|
|Date of revision:||Oct 2013|
|Publication status:||Published in Proceedings of the 21st International Conference on Software Telecommunications and Computer Networks (SoftCom 2013).|
|Contact details of provider:|| Postal: 599 Gwanak-Ro, Gwanak-Gu, Seoul 151-744|
Web page: http://temep.snu.ac.kr/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- 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.
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)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 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.