A parallel max-min ant system algorithm for dynamic resource allocation to support QoS requirements

The paper introduce a Parellel Min-Max Ant System (PMMAS) algorithm using MPI to allocate dynamic resources to multiple service layers while maximizing the utility of the provider in the service-oriented networks. We focus on the pricing model that provide services with different QoS requirements represented by a probabilistic delay bound constraint operate. The objective we aim to be allocate resources responsive to the change in QoS parameters required by each service class using the utility function. The performance of PMMAS algorithm as assessed through numerical experiments to search the approximate optimal solution. Experimental results prove that PMMAS algorithm is more appropriate and effective for the problem than the known approaches.