Optimal Allocation of Multimedia Servers in the 3G Wireless Networks

Optimal Allocation of Multimedia Servers in the 3G Wireless Networks

Parag C. Pendharkar
Copyright: © 2008 |Pages: 8
DOI: 10.4018/jbdcn.2008010106
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

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.

Complete Article List

Search this Journal:
Reset
Volume 20: 1 Issue (2025): Forthcoming, Available for Pre-Order
Volume 19: 1 Issue (2024)
Volume 18: 2 Issues (2022): 1 Released, 1 Forthcoming
Volume 17: 2 Issues (2021)
Volume 16: 2 Issues (2020)
Volume 15: 2 Issues (2019)
Volume 14: 2 Issues (2018)
Volume 13: 2 Issues (2017)
Volume 12: 2 Issues (2016)
Volume 11: 2 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing