Abstract
Preemption is becoming an attractive strategy for bandwidth reservation and management in DiffServ-aware Traffic Engineering. In this paper, we propose an improved heuristic algorithm for the well-known optimization formulation based on versatile preemption policy, which can minimize the preemption cost with high accuracy and less computational intractability. Simulation results show that the proposed algorithm significantly outperforms well-known algorithms recently proposed in the literature. Moreover, we present a new path selection scheme to minimize preemption. Due to preemption of those LSPs that share more links with the selected path, the proposed scheme obviously minimize rerouting in DS-TE environments.
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.
