A study of the generalised max–min fair rate allocation for ABR control in ATM

In the rate-based flow control for ATM Available Bit Rate service, fairness is an important requirement, i.e. each flow should be allocated a fair share of the available bandwidth in the network. Max–min fairness, which is widely adopted in ATM, is appropriate only when the minimum cell rates (MCRs) of the flows are zero or neglected. Generalised max–min (GMM) fairness extends the principle of the max–min fairness to accommodate MCR. In this paper, we will discuss the formulation of the GMM fair rate allocation, propose a centralised algorithm, analyse its bottleneck structure and develop an efficient distributed explicit rate allocation algorithm to achieve the GMM fairness in an ATM network. The study in this paper addresses certain theoretical and practical issues of the GMM fair rate allocation.

Weighted fairness with MCR guarantee and a general-purpose explicit rate allocation algorithm for ATM ABR service

In this paper, weighted fair rate allocation for ATM available bit rate (ABR) service is discussed with the concern of the minimum cell rate (MCR). Weighted fairness with MCR guarantee has been discussed recently in the literature. In those studies, each ABR virtual connection (VC) is first allocated its MCR, then the remaining available bandwidth is further shared among ABR VCs according to their weights. For the weighted fairness defined in this paper, the bandwidth is first allocated according to each VC's weight; if a VC's weighted share is less than its MCR, it should be allocated its MCR instead of the weighted share. This weighted fairness with MCR guarantee is referred to as extended weighted (EXW) fairness. Certain theoretical issues related to EXW, such as its global solution and bottleneck structure, are first discussed in the paper. A distributed explicit rate allocation algorithm is then proposed to achieve EXW fairness in ATM networks. The algorithm is a general-purpose explicit rate algorithm in the sense that it can realise almost all the fairness principles proposed for ABR so far whilst only minor modifications may be needed.

QoS-oriented resource allocation and scheduling of multiple composite Web services in a hybrid cloud using a random-key genetic algorithm

In cloud computing resource allocation and scheduling of multiple composite web services is an important challenge. This is especially so in a hybrid cloud where there may be some free resources available from private clouds but some fee-paying resources from public clouds. Meeting this challenge involves two classical computational problems. One is assigning resources to each of the tasks in the composite web service. The other is scheduling the allocated resources when each resource may be used by more than one task and may be needed at different points of time. In addition, we must consider Quality-of-Service issues, such as execution time and running costs. Existing approaches to resource allocation and scheduling in public clouds and grid computing are not applicable to this new problem. This paper presents a random-key genetic algorithm that solves new resource allocation and scheduling problem. Experimental results demonstrate the effectiveness and scalability of the algorithm.

Resource allocation and scheduling of multiple composite web services in cloud computing using cooperative coevolution genetic algorithm

In cloud computing, resource allocation and scheduling of multiple composite web services is an important and challenging problem. This is especially so in a hybrid cloud where there may be some low-cost resources available from private clouds and some high-cost resources from public clouds. Meeting this challenge involves two classical computational problems: one is assigning resources to each of the tasks in the composite web services; the other is scheduling the allocated resources when each resource may be used by multiple tasks at different points of time. In addition, Quality-of-Service (QoS) issues, such as execution time and running costs, must be considered in the resource allocation and scheduling problem. Here we present a Cooperative Coevolutionary Genetic Algorithm (CCGA) to solve the deadline-constrained resource allocation and scheduling problem for multiple composite web services. Experimental results show that our CCGA is both efficient and scalable.

Optimal allocation strategies for the dark pool problem

We study the problem of allocating stocks to dark pools. We propose and analyze an optimal approach for allocations, if continuous-valued allocations are allowed. We also propose a modification for the case when only integer-valued allocations are possible. We extend the previous work on this problem to adversarial scenarios, while also improving on their results in the iid setup. The resulting algorithms are efficient, and perform well in simulations under stochastic and adversarial inputs.

Optimal budget allocation in budget-based access control

In dynamic and uncertain environments, where the needs of security and information availability are difficult to balance, an access control approach based on a static policy will be suboptimal regardless of how comprehensive it is. Risk-based approaches to access control attempt to address this problem by allocating a limited budget to users, through which they pay for the exceptions deemed necessary. So far the primary focus has been on how to incorporate the notion of budget into access control rather than what or if there is an optimal amount of budget to allocate to users. In this paper we discuss the problems that arise from a sub-optimal allocation of budget and introduce a generalised characterisation of an optimal budget allocation function that maximises organisations expected benefit in the presence of self-interested employees and costly audit.

To have your caveat and claim it, too : steps to take to protect an interest in land or water allocation

Caveats as protection for unregistered interests - lapsing and non-lapsing caveats - caveator - use only in appropriate circumstances

Optimal allocation of water in village irrigation systems of Sri Lanka

This PhD study examines whether water allocation becomes more productive when it is re-allocated from 'low' to 'high' efficient alternative uses in village irrigation systems (VISs) in Sri Lanka. Reservoir-based agriculture is a collective farming economic activity, which inter-sectoral allocation of water is assumed to be inefficient due to market imperfections and weak user rights. Furthermore, the available literature shows that a „head-tail syndrome. is the most common issue for intra-sectoral water management in „irrigation. agriculture. This research analyses the issue of water allocation by using primary data collected from two surveys of 460 rice farmers and 325 fish farming groups in two administrative districts in Sri Lanka. Technical efficiency estimates are undertaken for both rice farming and culture-based fisheries (CBF) production. The equi-marginal principle is applied for inter and intra-sectoral allocation of water. Welfare benefits of water re-allocation are measured through consumer surplus estimation. Based on these analyses, the overall findings of the thesis can be summarised as follows. The estimated mean technical efficiency (MTE) for rice farming is 73%. For CBF production, the estimated MTE is 33%. The technical efficiency distribution is skewed to the left for rice farming, while it skewed to the right for CBF production. The results show that technical efficiency of rice farming can be improved by formalising transferability of land ownership and, therefore, water user rights by enhancing the institutional capacity of Farmer Organisations (FOs). Other effective tools for improving technical efficiency of CBF production are strengthening group stability of CBF farmers, improving the accessibility of official consultation, and attracting independent investments. Inter-sectoral optimal allocation shows that the estimated inefficient volume of water in rice farming, which can be re-allocated for CBF production, is 32%. With the application of successive policy instruments (e.g., a community transferable quota system and promoting CBF activities), there is potential for a threefold increase in marginal value product (MVP) of total reservoir water in VISs. The existing intra-sectoral inefficient volume of water use in tail-end fields and head-end fields can potentially be removed by reducing water use by 10% and 23% respectively and re-allocating this to middle fields. This re-allocation may enable a twofold increase in MVP of water used in rice farming without reducing the existing rice output, but will require developing irrigation practices to facilitate this re-allocation. Finally, the total productivity of reservoir water can be increased by responsible village level institutions and primary level stakeholders (i.e., co-management) sharing responsibility of water management, while allowing market forces to guide the efficient re-allocation decisions. This PhD has demonstrated that instead of farmers allocating water between uses haphazardly, they can now base their decisions on efficient water use with a view to increasing water productivity. Such an approach, no doubt will enhance farmer incomes and community welfare.

The allocation of taxing rights of ship and aircraft leasing profits under Australia's tax treaties

The Australian Federal Commissioner of Taxation recently released Draft Taxation Ruling TR 2008/D3 with the stated purpose of clarifying ‘what profits derived from the leasing of ships or aircraft fall within the ship and aircraft articles of each of Australia’s tax treaties’. In particular, TR 2008/D3 explains the taxing rights over different types of leasing profits, such as a full basis lease in respect of any transport by a ship operated in international traffic and bareboat leases which are ancillary to the lessor transport operations of ships in international traffic. This article outlines the Commissioner’s views on the application of the standard ships and aircraft articles in the tax treaties to which it is a party as well as considering the major variations on the standard adoption. In doing so, guidance is provided as to the allocation of taxing rights of ship and aircraft leasing profits under Australia’s tax treaties.

Unlocking risk allocation and equitable conversion : reform of the passing of risk in the sale of land

The principles relating to the passing of risk under a contract for the sale of real property would seem to have been long settled. The rule under the general law is that the risk of loss of the subject matter under a contract for the sale of real property passes to the buyer upon the creation of a valid and binding contract. This article considers the origin of that rule, how it developed with the growth of equity, and advances the view that it is anomalous in a modern context of property dealings. In doing so, the article adverts to the variety of statutory mechanisms used to subvert the rule, few of which are of practical value. It concludes that the rule is outmoded in many respects and suggests a number of reforms which might be implemented nationally to bring consistency and simplicity to the issue of damage or destruction of improvements which are the subject of a land contract.

Adaptive subcarrier allocation in multiuser OFDM system using forced cost based decisions

Subcarrier allocation scheme for Orthogonal Frequency Division Multiplexing(OFDM) based multiuser system is proposed. Most previous algorithms use greedy approach as a subcarrier allocation scheme until a conflict occurs or as an initial first round allocation with improvement steps carried out in next rounds. Our algorithm uses information obtained by the forced costs of a system that incur by a current allocation to make assignment decisions. This algorithm does not rely on greedy approach and therefore can also be considered as a substitute for first layer Greedy algorithms. Simulation results show that for two user case this algorithm gives better or equal allocation 80-90 percent of the time when compared with the greedy allocation.

Resource allocation in multiuser cooperative OFDM system using forced cost based decisions

A sub optimal resource allocation algorithm for Orthogonal Frequency Division Multiplexing (OFDM) based cooperative scheme is proposed. The system consists of multiple relays. Subcarrier space is divided into blocks and relays participating in cooperation are allocated specific blocks to be used with a user. To ensure unique subcarrier assignment system is constrained such that same block cannot be used by more than one user. Users are given fair block assignments while no restriction for maximum number of blocks a relay can employ is given. Forced cost based decisions [1] are used for block allocation. Simulation results show that this scheme outperforms a non cooperating scheme with sequential allocation with respect to power usage.