Year-end Sale % OFF 
Abstract
This paper considers a problem of configuring both backbone and logical networks in a reconfigurable circuit-switched network where links are subject to failures. The objective is to design feasible backbone and logical networks at least cost where the cost includes backbone link capacity expansion cost, lost-call traffic penalty, and hop cost (nodal processing cost). The problem is formulated as a zero-one non-linear mixed integer programming problem, for which a solution procedure is developed by use of a Lagrangean relaxation technique and heuristic methods exploited for improving the lower and upper bounds of any intermediate solution. The solution procedure is tested for its effectiveness with various numerical examples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
