Abstract
This paper considers a routing problem for virtual circuit data networks with unreliable links. The problem is analyzed by transforming it into a stochastic multicommodity flow problem with recourse to find the optimal route set ( primary and secondary routes for all origin-destination pairs) that minimizes the expected average packet delay. Both the Lagrangian relaxation and the aggregate stochastic subgradient optimization methods are used to find the optimal solution ( route set) for which a stochastic version of the K( 0)-ordering method is newly exploited to find the initial feasible solution.
Sign-in/Register to access full text options 
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.
