Abstract

We propose in this paper two heuristic strategies to solve the regenerator placement problem (RPP) in translucent networks under dynamic traffic. The heuristics are based on both the forecast of the offered load and estimates of blocking probabilities in the network nodes. The proposed heuristics are compared to other regenerator placement algorithms from the literature in two different topologies. The results show that one of the proposed algorithms outperforms, in the investigated scenarios, all other algorithms from the literature considered for comparison purposes in this paper, whereas the second proposed algorithm outperforms the algorithms from the literature only in some considered scenarios.

Full Text
Paper version not known

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 call

Disclaimer: 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.