Optimal allocation of multimedia servers in the 3G wireless networks

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish (US)
Pages (from-to)80-87
Number of pages8
JournalInternational Journal of Business Data Communications and Networking
Volume4
Issue number1
DOIs
StatePublished - 2008

All Science Journal Classification (ASJC) codes

  • Management Information Systems
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Optimal allocation of multimedia servers in the 3G wireless networks'. Together they form a unique fingerprint.

Cite this