Abstract
This paper focuses on minimizing the capacity of DiffServ/MPLS networks taking into account two widely deployed bandwidth constraint models: the maximum allocation model (MAM) and the Russion doll model (RDM). With the given physical network and traffic demands, by optimizing Label Switched Paths (LSPs) resource allocation, route distribution, our designs aim at minimizing the link capacity of the total network. The optimization problems are formulated as integer linear programming (ILP) models first, and then, since the ILP formulation is not adapted for large-scale network, two novel fast algorithms are proposed. Numerous simulation results for a variety of networks indicate that the performances of our proposed algorithms are close to the optimal results.
Published Version
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