Content Distribution Networks have been attracted a great deal of attraction in recent years. Replicaplacementproblems(RPPs) as one of the key technologies in the Content Distribution Networks have been widely studied. In this paper, we propose an optimization model with server storage capacity constraints for the RPPs
In the multiple protocol label-switched (MPLS) networks, the commodities (packets) are transmitted by the labelswitched paths (LSPs). For the sake of reducing the total cost and strengthening the central management, the MPLS networks restrict the number of paths that a commodity can use. For maintaining the quality of service (QoS) of the users, the demand of each commodity must be satisfied. Under the above conditions, some links of the network may be too much loaded, which affecting the performance of the whole network drastically. For this problem, we first establish two mathematical models, namely the arc-path and arc-flow model. Second, we design a heuristic algorithm which quickly finds paths for each commodity, and then allocate demands for them. In the last, the computational results are tested on a set of medium-sized instances to show the effectiveness of our approach.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.