Management is a complex task in today's heterogeneous and large scale networks like Cloud, IoT, vehicular and MPLS networks. Likewise, researchers and developers envision the use of artificial intelligence techniques to create cognitive and autonomic management tools that aim better assist and enhance the management process cycle. Bandwidth allocation models (BAMs) are a resource allocation solution for networks that need to share and optimize limited resources like bandwidth, fiber or optical slots in a flexible and dynamic way. This paper proposes and evaluates the use of Case-Based Reasoning (CBR) for the cognitive management of BAM reconfiguration in MPLS networks. The results suggest that CBR learns about bandwidth request profiles (LSPs requests) associated with the current network state and is able to dynamically define or assist in BAM reconfiguration. The BAM reconfiguration approach adopted is based on switching among available BAM implementations (MAM, RDM and ATCS). The cognitive management proposed allows BAMs self-configuration and results in optimizing the utilization of network resources.
Resource allocation management for communications has been researched for many years @cite_26 . Despite years of struggle, investment and results achieved, the subject keeps its importance mainly due to the communication network's evolution.
@cite_26
2167145293
We consider a resource management problem in a multi-cell downlink OFDMA network whereby the goal is to find the optimal combination of (i) assignment of users to base stations and (ii) resource allocation strategies at each base station. Efficient resource management protocols must rely on users truthfully reporting privately held information such as downlink channel states. However, individual users can manipulate the resulting resource allocation (by misreporting their private information) if by doing so they can improve their payoff. Therefore, it is of interest to design efficient resource management protocols that are strategy-proof, i.e. it is in the users' best interests to truthfully report their private information. Unfortunately, we show that the implementation of any protocol that is efficient and strategy-proof is NP-hard. Thus, we propose a computationally tractable strategy-proof mechanism that is approximately efficient, i.e. the solution obtained yields at least 1 2 of the optimal throughput. Simulations are provided to illustrate the effectiveness of the proposed mechanism.