Next generations of mobile telecommunication have to provide not only the voice or message services but also a wide set of new applications coming from the Internet world. Because of fading wireless channel and limited bandwidth, the problem of resource and power allocation has become of prime importance for stability and effectiveness of future mobile communication systems. In this paper we st...

In this paper we address two problems, for which we present novel, efficient, algorithmic solutions. The first problem is motivated by practical situations and is concerned with the efficient estimation of the upload bandwidth of a machine, particularly in the context of a peer-to-peer content sharing and distribution application. The second problem is more of a theoretical nature and considers...

Dynamic services using the scalable and virtualized property over the network is provided in the cloud computing environment. The cloud computing does not effective in handling the normal resource allocation algorithms. The cloud computing schedulers make a decision on workflow allocation. Cloud always consumes a high communication cost than the known resource schedulers in large scale distribu...

resource allocation techniques have recently appeared as a widely recognized feature in lte networks. most of existing approaches in resource allocation focus on maximizing network’s utility functions. the great potential of utility function in improving resource allocation and enhancing fairness and mean opinion score (mos) indexes has attracted large efforts over the last few years. in this p...

Automatic Synthesis of large realtime systems using an array of oo-the-shelf general purpose processors, digital signal processors and Field Programmable Gate Arrays is increasingly gaining importance. Each of the subproblems in such a synthesis process, namely, pipelining, resource type selection, resource allocation, resource assignment, resource scheduling and resource re-connguration are co...

This paper studies the problem of constrained resource allocation across multiple tasks, stages or divisions in an organization. The allocations suggested by balancing marginal resource productivity, and by balancing processing speed (or eliminating bottlemecks), are compared to the optimal organizational allocation. It is shown, under fairly general assumptions, that the former two approaches ...

Generalized Processor Sharing(GPS) is an idealized fluid discipline with a number of desirable properties. Its packetized version PGPS is considered to be a good choice as a packet scheduling discipline to guarantee Quality-of-Service in IP and ATM networks. The existing Connection Admission Control(CAC) frameworks for GPS result in a conservative resource allocation. We propose an Optimal CAC ...

Wireless mesh sensor networks (WMSNs) have recently gained a lot of interest due to their communication capability to support various applications with different Quality of Service (QoS) requirements. The most challenging issue is providing a tradeoff between the resource efficiency and the multiconstrained QoS support. For this purpose, we propose a cross-layer algorithm JSAR (Joint duty cycle...

extensive research has been devoted to resource constrained project scheduling problem. however, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. in this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...