Abstract
We propose a multimedia server allocation problem in the 3G wireless networks as a generalized assignment problem (GAP) with an objective of minimizing the total multimedia applications access cost. Because the GAP is a well known NP hard problem, we use the Lagrangian relaxation (LR) heuristic to compute a lower bound on the total multimedia applications access cost. For small size problems, we solve the multimedia server allocation problem optimally and compare the optimal solution with the LR heuristic. Our results indicate that the LR heuristic provides a very tight lower bound and may be useful for estimating lower bound on the total multimedia applications access cost for a large scale problem where finding an optimal solution is very difficult.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Business Data Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
