Coordinated load balancing, handoff/cell-site selection, and scheduling in multi-cell packet data systems

Sang, Aimin; Wang, Xiaodong; Madihian, M.; Gitlin, Richard D.

doi:10.1145/1023720.1023750

Cited by 106 publications

(109 citation statements)

References 13 publications

Supporting

Mentioning

109

Contrasting

Order By: Relevance

“…LBMM has a three level load balancing framework. It uses the Opportunistic Load Balancing algorithm (OLB) [13]. OLB is a static load balancing algorithm that has the goal of keeping each node in the cloud busy.…”

Section: Literature Surveymentioning

confidence: 99%

DCHEFT Approach for Task Scheduling to Efficient Resource Allocation in Cloud Computing

Gawali¹,

Shinde²

2017

IJEACS

View full text Add to dashboard Cite

Abstract-Task scheduling is an important aspect to improve the utilization of resources in the Cloud Computing. This paper proposes a Divide and Conquer based approach for heterogeneous earliest finish time algorithm. The proposed system works in two phases. In the first phase it assigns the ranks to the incoming tasks with respect to size of it. In the second phase, we properly assign and manage the task to the virtual machine with the consideration of ideal time of respective virtual machine. This helps to get more effective resource utilization in Cloud Computing. The experimental results using Cybershake Scientific Workflow shows that the proposed Divide and Conquer HEFT performs better than HEFT in terms of task's finish time and response time. The result obtained by experimentally demonstrate that the proposed DCHEFT performance superiorly.

show abstract

Section: Literature Surveymentioning

confidence: 99%

DCHEFT Approach for Task Scheduling to Efficient Resource Allocation in Cloud Computing

Gawali¹,

Shinde²

2017

IJEACS

View full text Add to dashboard Cite

show abstract

“…This can be justified by the fact that the time intervals over which caching and BS-user association control decisions are made are large (i.e., a few minutes to hours). These assumptions have also been adopted in previous loadbalancing works [8], [9].…”

Section: Introductionmentioning

confidence: 99%

Two Time-Scale Content Caching and User Association in 5G Heterogeneous Networks

Kwak

Wang

2017

GLOBECOM 2017 - 2017 IEEE Global Communications Conference

View full text Add to dashboard Cite

Abstract-In this paper, we develop a content caching and flowlevel BS-user association framework in a network environment with the spatial variation of content popularity. Because the studied content caching and BS-user association functions are tightly intertwined with each other, and their decision time scales can be very different in practice, our design considers the time-scale separation of these network functions to tackle and develop the BS-user association and content caching policies. Specifically, we propose an optimal BS-user association algorithm, namely OptUA, operating in the short time scale for a given content caching solution, and a greedy content caching algorithm, namely GCC, operating in the long time scale. The GCC algorithm exploits the submodularity characteristics of the objective function which ensures that the GCC algorithm achieves a constant fraction of the optimal performance for most feasible caching sets. Via extensive numerical studies in heterogeneous cellular networks, we demonstrate that proposed OptUA and GCC algorithms outperform other algorithms which do not consider spatial variations of content popularity in terms of average end-to-end delay per content request and average system load per content at each BS.

show abstract

“…For the uncoded multi-user multiple input multiple output (MIMO) downlink (broadcast) channel, opportunistic power control in the form of channel dependent signal-to-interference-plus-noise ratio (SINR) target setting has been shown to maximize the sum throughput under fairness and sum power constraints [5]. Along another line, several papers suggested that carefully selecting the serving cell (sometimes referred to as link selection) can optimize different objective functions, such as overall system throughput [6], individual quality of service (QoS) targets [7] or other suitable utility functions [8]. Link selection typically operates on a slower time scale (using path loss) than OPC to avoid too frequent handovers and ping-pong effects.…”

Section: Introductionmentioning

confidence: 99%

An Optimization Approach to Joint Cell and Power Allocation in Multicell Networks

Fallgren

Oddsdóttir

Fodor

2011

2011 IEEE International Conference on Communications Workshops (ICC)

View full text Add to dashboard Cite

Abstract-Since the seminal paper by Knopp and Humblet that showed that the system throughput of a singlecell system is maximized if only one terminal transmits at a time, there has been a large interest in opportunistic communications and its relation to various fairness measures. On the other hand, in multicell systems there is a need to allocate transmission power such that some overall utility function is maximized typically under fairness constraints. Furthermore, in multicell systems the degree of resource allocation freedom includes the serving cell selection that allows for load balancing and thereby the efficient use of radio resources. In this paper we formulate the joint serving cell selection (link selection) and power allocation problem as an optimization task whose purpose is to maximize either the minimum user throughput or the multicell sum throughput. The max-min problem and a simplified max throughput problem are both NP-hard and we therefore propose heuristic solution approaches. We present numerical results that give new and valuable insights into the trade off between fair and sum throughput optimal joint resource allocation strategies.

show abstract

Coordinated load balancing, handoff/cell-site selection, and scheduling in multi-cell packet data systems

Cited by 106 publications

References 13 publications

DCHEFT Approach for Task Scheduling to Efficient Resource Allocation in Cloud Computing

DCHEFT Approach for Task Scheduling to Efficient Resource Allocation in Cloud Computing

Two Time-Scale Content Caching and User Association in 5G Heterogeneous Networks

An Optimization Approach to Joint Cell and Power Allocation in Multicell Networks

Contact Info

Product

Resources

About