Optimal Resource Allocation in Next Generation Network Services Using Engineering Optimization With Linear Constraint Particle Swarm

Download Now Free registration required

Executive Summary

This paper considers the problem of pricing for optimal resource allocation service using Engineering Optimization with Particle Swarm algorithm that ensures efficient resource allocation that provides guaranteed quality of service while maximizing profit in multiservice networks. The author formulates the generalized optimization algorithm based on the notion of a "Profit center" with an arbitrary number of service classes, linear revenue and nonlinear cost functions and general performance constraints. To ensure the resource constraint is satisfied, the author incorporates adaptive resource bounds to guide the search. Specifically, the paper develops a fast, low complexity algorithm for online dynamic resource allocation, and examine its properties.

  • Format: PDF
  • Size: 302.8 KB