Centralized Resource Allocation Research Articles

On centralized resource utilization and its reallocation by using DEA

The standard DEA model allows different DMU units to set their own priorities for the inputs and outputs that form part of the efficiency assessment. In the case of a centralized organization with many outlets, such as an education authority that is responsible for many schools, it may be more sensible to operate in the most efficient way, but under a common set of priorities for all DMUs. The algorithm that is used to do this, the centralized resource allocation model, does just this. We show that the centralized resource allocation model can be substantially simplified and we interpret the simplifications and show how the model works using real data of Spanish public schools. Apart from finding the best way to reallocate resource among the schools, it is shown that the most desirable operating unit is found to be a by-product of the estimation. This is useful information when planning new schools.

A Power Allocation Algorithm Based on Cooperative Game Theory in Multi-cell OFDM Systems

A centralized resource allocation algorithm in multi-cell OFDM systems is studied, which aims at improving the performance of wireless communication systems and enhancing user’s spectral efficiency on the edge of the cell. The proposed resource allocation algorithm can be divided into two steps. The first step is sub-carrier allocation based on matrix searching in single cell and the second one is joint power allocation based on cooperative game theory in multi-cell. By comparing with traditional resource allocation algorithms in multi-cell scenario, we find that the proposed algorithm has lower computational complexity and good fairness performance.

Centralized resource allocation with stochastic data

Data Envelopment Analysis (DEA) is a technique based on mathematical programming for evaluating the efficiency of homogeneous Decision Making Units (DMUs). In this technique inefficient DMUs are projected on to the frontier which constructed by the best performers. Centralized Resource Allocation (CRA) is a method in which all DMUs are projected on to the efficient frontier through solving just one DEA model. The intent of this paper is to present the Stochastic Centralized Resource Allocation (SCRA) in order to allocate centralized resources where inputs and outputs are stochastic. The concept discussed throughout this paper is illustrated using the aforementioned example.

Cuba: From State Socialism to a New Form of Market Socialism?

Cuba's post-revolutionary economic history was penalized by the twin sets of distortions stemming from its former, artificial trade relations with the Soviet Union and from the very nature of the state socialist model. Yet, Cuba's centralized resource allocation system and the consistent priority granted to the satisfaction of basic needs led to a remarkable accumulation of human capital and an extraordinary development of public services. Moreover, they serendipitously endowed the country with a lingering comparative advantage in some advanced, knowledge-based services sectors (SS). However, the tension between Cuba's exceptional human development achievements and the weakness of their material foundations cannot be maintained indefinitely. The central planning mechanism entails serious intrinsic deficiencies. The socialist principle of distribution according to work can no longer be ignored. The role of the market and monetary-commercial relations must be drastically enhanced. The shortcomings of the present system should be fully acknowledged and dealt with boldly, with a comprehensive structural reform program. The ultimate goal of such a program should be to definitively supersede the traditional state socialist model, leading to a transition towards a specifically Cuban form of market socialism.

Simulation-Based Auction Protocol for Resource Scheduling Problems

Resource scheduling, or the allocation of resources over time, is a challenging problem in large-scale or multiple-project environments. Traditional network scheduling techniques are ineffective in modeling the dynamic nature and resource interactions of large or multiunit projects. This paper presents a simulation-based auction protocol (SBAP) to solve resource scheduling problems in large-scale construction projects. SBAP is a hybrid framework that integrates multi agent resource allocation (MARA) in a simulation environment. SBAP deploys a centralized resource allocation approach, referred to as an auction protocol, whereby agents bid on different combinations of resources at the start of a simulation cycle. Agents attempt to improve their individual welfare by acquiring a combination of resources; an auctioneer looks at the entire system and allocates resources to the agents using a combinatorial algorithm to maximize an overall objective function (e.g., maximizing the system’s revenue or minimizing t...

Resource allocation scheme to reduce communication cost in mobile ad hoc computational grids

Recent advancements in mobile computing and communication technologies have given rise to the development of mobile ad hoc computational grids which provide a software and hardware infrastructure to share computing resources in mobile ad hoc environments. The adaptation of computational grids in mobile ad hoc environments is not simple and presents numerous research challenges due to node mobility and infrastructure-less network environment. In order to improve utilisation of shared computing resources and application performance, one of the key services is a resource allocation. In this paper, we propose a centralised resource allocation scheme that allocates interdependent tasks to nodes in mobile ad hoc computational grids. First, we classify tasks and dependencies, and then exploit them to reduce communication cost between interdependent tasks, and thus application completion time. The effectiveness of proposed scheme is demonstrated through simulations.

Iterative Resource Allocation for Maximizing Weighted Sum Min-Rate in Downlink Cellular OFDMA Systems

This paper considers the downlink of a cellular orthogonal frequency division multi-access (OFDMA) system, in which multiple base stations (BSs) are coordinated by a centralized resource allocation algorithm. We address the problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each BS, in terms of jointly optimizing coordinated BSs' subcarrier and power allocation. In particular, the solution of this problem corresponds to a resource allocation that guarantees similar rates to all users in each cell. An iterative algorithm is proposed to optimize the subcarrier allocation and the power allocation alternatively, so that the WSMR keeps increasing until convergence. In each iteration, the subcarrier allocation is updated by solving a mixed integer linear program for each cell, while the power allocation is updated by solving a successive set of convex optimization problems with a duality-based numerical algorithm. The effectiveness of the algorithm is illustrated by numerical experiments.

Analytical Model of QoS-Based Fast Seamless Handoff in IEEE 802.16j WiMAX Networks

The IEEE 802.16 standard adopts a centralized resource-allocation mechanism to poll nodes with three polling modes, i.e., the unicast, multicast, and broadcast polling modes, depending on the residual bandwidth of the base station (BS). In the multicast and broadcast polling modes, the BS uses the truncated binary exponential backoff (TBEB) algorithm as the contention-resolution process (CRP) for mobile nodes to access the wireless network while the traffic load increases up to saturation. The random contention-based TBEB used in the initial ranging and bandwidth request suffers from high collision probability under a high traffic load. TBEB thus significantly degrades the grade of service (GoS), particularly while performing handoff in the mobile (IEEE 802.16e) or multihop relay WiMAX (IEEE 802.16j) networks. Additionally, WiMAX's TBEB exhibits two critical problems. First, TBEB neglects the node priority (i.e., the new or handoff node) and the service flow class (i.e., the real-time or nonreal-time service class); thus, it cannot achieve the optimal network revenue. Second, all different-priority connections immediately transit to the same minimum contention windows (CWs) after winning contentions and then easily lead to high collision probability at succeeding contentions. Therefore, this paper first proposes an efficient contention-resolution algorithm that consists of three key contributions: 1) providing the adaptive minimum-maximum backoff-value algorithm (AM^2) to partition collision domains; 2) supporting a dynamic waiting-penalty algorithm (DWP) for successful contentions; and 3) differentiating the decrements of CWs (DDW) to avoid collisions, even though the contentions randomly choose the same CW value. Second, we model the proposed approach as a discrete-time Markov chain model and then mathematically analyze several important metrics, i.e., the collision probability, access delay, GoS, and throughput. Numerical results indicate that the analytical results are very close to the simulation results, which justify the accuracy of the analytical model. Additionally, the proposed approach outperforms IEEE 802.16 and all compared approaches in collision probability, delay, GoS, and network throughput.

Centralised resource allocation policies for meshed high data rate wireless personal area networks

Multi-media applications with demanding throughput requirements often raise issues of capacity limitations in wireless networks. High data rate (HDR) wireless personal area networks (WPANs) can operate in a mesh configuration to extend from the legacy single-hop communication to multiple hops. Although the range of WPANs is increased in a mesh configuration, there are capacity constraints because the superframe time is shared by multiple piconet clusters instead of being dedicated for a single piconet cluster just like in the legacy single-hop case. Furthermore, the distributed superframe sharing can cause fairness issues because there is no mechanism to determine the requirement of each mesh piconet coordinator (MPNC) and monitor a fair allocation to each MPNC. Here, the authors propose a centralised resource allocation approach and define three resource allocation policies for meshed HDR WPANs. The proposed approach is augmented by a traffic estimation strategy to predict a suitable fraction of superframe time for each cluster. Simulation results prove the effectiveness of the proposed resource allocation policies and the fairness index is shown to increase upto 42% with the proposed approach in some cases.

A sensing‐based cognitive coexistence method for interfering infrastructure and ad hoc systems

AbstractThe rapid proliferation of wireless systems makes interference management more and more important. This paper presents a novel cognitive coexistence framework, which enables an infrastructure system to reduce interference to ad hoc or peer‐to‐peer communication links in close proximity. Motivated by the superior resources of the infrastructure system, we study how its centralized resource allocation can accommodate the ad hoc links based on sensing and predicting their interference patterns. Based on an ON/OFF continuous‐time Markov chain model, the optimal allocation of power and transmission time is formulated as a convex optimization problem and structured solutions are derived. The optimal scheduling is extended to the case where the infrastructure channel is random and rate constraints need only be met in the long‐term average. Finally, the multi‐terminal case is addressed and the problem of optimal sub‐channel allocation is discussed. Numerical performance analysis illustrates that utilizing the superior flexibility of the infrastructure links can effectively mitigate interference. Copyright © 2009 John Wiley & Sons, Ltd.

Joint Subchannel, Rate and Power Allocation in OFDMA-Based Cognitive Wireless Mesh Network

In this paper, the problem of resource allocation in an Orthogonal Frequency Division Multiple Access-based Cognitive Wireless Mesh Network (CWMN) is addressed. The objective is to maximize the total utilities in a CWMN, which is defined as any increasing, concave and twice differentiable function of the end-to-end flow rate, by jointly allocating each link's rate, power and subchannels under the constraints of multiple primary users' Interference Temperature and multiple access interference. First, a centralized resource allocation algorithm is developed based on the Column Generation approach, and shown to be optimal. So it can perform as a criterion for designing other algorithms. Secondly, considering the applicability of algorithm in distributed system, a near-optimal distributed algorithm is proposed, which allocates subchannel based on routing information at first, and then jointly allocates the resource of rate and power. Finally, the simulation results validate the centralized and distributed algorithms, and show that better performance can be achieved than the conventional algorithm.

Distributed Relay Selection and Power Control for Multiuser Cooperative Communication Networks Using Stackelberg Game

The performance in cooperative communication depends on careful resource allocation such as relay selection and power control, but the traditional centralized resource allocation requires precise measurements of channel state information (CSI). In this paper, we propose a distributed game-theoretical framework over multiuser cooperative communication networks to achieve optimal relay selection and power allocation without knowledge of CSI. A two-level Stackelberg game is employed to jointly consider the benefits of the source node and the relay nodes in which the source node is modeled as a buyer and the relay nodes are modeled as sellers, respectively. The proposed approach not only helps the source find the relays at relatively better locations and buyrdquo an optimal amount of power from the relays, but also helps the competing relays maximize their own utilities by asking the optimal prices. The game is proved to converge to a unique optimal equilibrium. Moreover, the proposed resource allocation scheme with the distributed game can achieve comparable performance to that employing centralized schemes.

The Dilemma of Water Management ‘Regionalization’ in Mexico under Centralized Resource Allocation

Mexico's evolving water management framework is predicated on: (1) integration of water resources planning and management; (2) decentralization from federal to ‘regional’ (river basin) levels; and (3) privatization of service provision. This paper focuses on Mexico's recurring federal-regional tensions, highlighting the historical case of the Yaqui River, and analyzing the current decentralization impasse. Although important advances have been made with irrigation management transfer, river basin councils, nascent user participation in groundwater management, and water and energy legislation, integrated water resources management (IWRM) remains an elusive goal, principally due to inherent institutional and procedural contradictions in water resource allocation. The next steps in the Mexican model—to open decision making to public scrutiny and devolve allocation of water and financial resources—will prove the most difficult, more because of entrenched interests than for lack of an ‘IWRM roadmap’.

Centralized Resource Allocation for Multimedia Traffic in IEEE 802.16 Mesh Networks

The IEEE 802.16 standard provides a high degree of flexibility for setting up and operating wireless broadband networks in metropolitan environments. The standard supports numerous capabilities, including mesh topologies and multimedia communications. In this paper, we study these two features by investigating how efficiently an IEEE 802.16 mesh network can treat distributed multimedia traffic by providing differentiated quality of service (QoS). A key component of the system is the ldquoenhanced frame registry tree schedulerrdquo (E-FRTS) that provides QoS-aware resource allocation using a tree structure to prepare the creation of time frames and reduce processing requirements at the beginning of each frame. Simulation results show that distributed multimedia traffic can be efficiently supported in mesh 802.16 networks, provided efficient scheduling and a reasonable number of hops.

Centralized resource allocation BCC models

In two recent papers, Lozano and Villa [Centralized resource allocation using data envelopment analysis. Journal of Productivity Analysis 2004;22:143–61. [1]] and Lozano et al. [Centralized target setting for regional recycling operations using DEA. OMEGA 2004;32:101–10. [2]] introduce the concept of “centralized” data envelopment analysis (DEA) models, which aim at optimizing the combined resource consumption by all units in an organization rather than considering the consumption by each unit separately. This is particularly relevant for situations where some variables are controlled by a central authority (e.g. Head Office) rather than individual unit managers. In this paper we reconsider one of the centralized models proposed by the above-mentioned authors and suggest modifying it to only consider adjustments of previously inefficient units. We show how this new model formulation relate to a standard DEA model, namely as the analysis of the mean inefficient point. We also provide a procedure that can be used to generate alternative optimal solutions, enabling a decision maker to search through alternate solution possibilities in order to select the preferred one. We then extend the model to incorporate non-transferable as well as strictly non-discretionary variables and illustrate the models using an empirical example of a public service organization.

Resource Allocation and Firm Scope

We develop a theory of firm scope in which integrating two firms into one facilitates the allocation of resources, but leads to weaker incentives for effort, compared with nonintegration. Our theory makes minimal assumptions about the underlying agency problem. Moreover, the benefits and costs of integration originate from the same problem - to allocate resources efficiently, the integrated firm's top management must obtain information about the possible use of resources from division managers. The division managers' job is to create profitable investment projects. Giving the managers incentives to do so biases them endogenously towards their own divisions, and gives them a motive to overstate the quality of their projects in order to receive more resources. We show that paying managers based on firm performance in addition to individual performance can establish truthful upward communication, but creates a free-rider problem and raises the cost of inducing effort. This effect exists even though with perfect information, centralized resource allocation would improve the managers' incentives. The resulting tradeoff between a better use of resources and diminished incentives for effort determines whether integration or non-integration is optimal. Our theory thus provides a simple answer to Williamson's selective-intervention puzzle concerning the limits of firm size and scope. In addition, we provide an incentivebased argument for the prevalence of hierarchically structured firms in which higher-level managers coordinate the actions of lower-level managers.

Distributed resource allocation for DS-CDMA-based multimedia ad hoc wireless LANs

Power control in direct sequence code division multiple access (DS-CDMA) systems and power/rate allocation in multirate DS-CDMA based networks is an open and interesting research area which has attracted much attention. However, with a few exceptions, most researchers have emphasized centralized resource allocation algorithms for cellular systems where the base station keeps track of the requirements of the various users and is thus responsible for the management of network resources. Ad hoc wireless local area networks (WLANs), on the other hand, are generally configured as peer-to-peer networks with no centralized hub or controller. Thus resource allocation has to be conducted in a distributed fashion. We address the issue of distributed resource management for multirate DS-CDMA based multimedia WLANs by (1) presenting a distributed resource allocation protocol, known as distributed resource negotiation protocol (DRNP) that builds on the RTS/CTS bandwidth reservation mechanism provided by IEEE 802.111, and provides quality of service (QoS) guarantees through distributed control of resources in DS-CDMA based multimedia WLANs and (2) investigating the performance of various resource allocation schemes within the context of DRNP, in terms of network wide metrics such as overall throughput and blocking rates.

Privatization: A New Transportation Paradigm

A new approach to the funding, management, and operation of transportation infrastructure is emerging. “Privatization” refers to several different ways in which private sector firms, usually under some form of government supervision, assume significant responsibility for these major systems. Although the traditional U.S. model of user taxes, trust funds, centralized resource allocation, and government ownership and operation has produced reasonably good transportation infrastructure, this approach carries with it incentives for suboptimal performance—such as allocating resources on political rather than economic-value grounds, encouraging congesation at peak hours, and skimping on maintenance. The privatization techniques offer the potential of institutionalizing a better set of incentives for cost-effective performance. This article explores the use of (1) contract management and operation, (2) long-term franchises and concessions, and (3) divestiture as privatization modes that can be applied to highways and airports.

Measuring Enterprise Efficiency in the Soviet Union: A Stochastic Frontier Analysis

Western economists of diverse persuasions broadly concur that in pursuit of full employment, sustained growth and macroecdnomic stability, the Soviets have built an economic system that imposes sundry constraints on enterprise management, and substitutes centralized resource allocation for the automatic market mechanism. These expedients, to the extent that they have prevented resources from being directed to their best use, have imposed efficiency losses on the economy of unknown, but perhaps significant, dimensions. Numerous Western scholars have inferred from this command economy paradigm, as well as from international productivity comparisons, that these efficiency losses are large.' However, the proper attribution of these efficiency losses to microlevel sources (i.e., inefficient enterprise operation) and to higher-level sources (i.e., resource misallocation among enterprises, branches, etc.) has been the subject of more speculation than evidence. This is because, until recently, requisite micro-level data on enterprise operations were unavailable in a form suitable for empirical analysis of enterprise efficiency. This deficiency now has been partially remedied for one sub-sector of the Soviet economy, the cotton refining industry. Estimates of technical efficiency reported in this study, computed using stochastic frontier techniques with a sample of 151 cotton refining enterprises, suggest that productive efficiency is high relative to the estimated frontier, and exhibits little dispersion. This finding in turn suggests that Soviet planning-administrative procedures and managerial incentive systems may be reasonably effective in controlling overt technical inefficiency by inducing cotton refining enterprises to operate close to the standards established by the most technically efficient enterprises in the industry. Although these domestic best-practice standards may be absolutely high or absolutely low by international standards, and may not fully reflect engineering potential, our finding of high modal efficiency relative to these standards, together with little dispersion, does constitute an important piece of evidence bearing on the sources of efficiency loss in the Soviet economy. This finding suggests that inter-enterprise efficiency variation may not be a promising place to look for sources of efficiency loss.