Optimal allocation of multimedia servers in the 3G wireless networks

Research output: Contribution to journalArticle

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 - Jan 1 2008

Fingerprint

Wireless networks
Servers
Costs
Computational complexity
Optimal allocation
Multimedia
Lower bounds
Heuristics
Lagrangian relaxation
Assignment problem
Allocation problem
Optimal solution

All Science Journal Classification (ASJC) codes

  • Management Information Systems
  • Computer Networks and Communications

Cite this

@article{66606cf3759b40d588116500ddfe3694,
title = "Optimal allocation of multimedia servers in the 3G wireless networks",
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.",
author = "Pendharkar, {Parag C.}",
year = "2008",
month = "1",
day = "1",
doi = "10.4018/jbdcn.2008010106",
language = "English (US)",
volume = "4",
pages = "80--87",
journal = "International Journal of Business Data Communications and Networking",
issn = "1548-0631",
publisher = "IGI Publishing",
number = "1",

}

TY - JOUR

T1 - Optimal allocation of multimedia servers in the 3G wireless networks

AU - Pendharkar, Parag C.

PY - 2008/1/1

Y1 - 2008/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=57549084072&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57549084072&partnerID=8YFLogxK

U2 - 10.4018/jbdcn.2008010106

DO - 10.4018/jbdcn.2008010106

M3 - Article

AN - SCOPUS:57549084072

VL - 4

SP - 80

EP - 87

JO - International Journal of Business Data Communications and Networking

JF - International Journal of Business Data Communications and Networking

SN - 1548-0631

IS - 1

ER -