Abstract
We consider the problem of determining the optimal access topology to service based networks. The problem is formulated as a concentrator location problem with a discontinuous piece wise linear objective function that depends on the traffic of the nodes that are homed to the concentrator. Five heuristics are developed to solve the problem and are compared on an extensive set of examples. Based on this comparison a combination heuristic utilizing a Lagrangian relaxation and swap drop add approach was found to give the best solution in the minimal time.
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.
