Resource Provisioning and Allocation in Function-as-a-Service Edge-Clouds

Edge computing has emerged as a new paradigm to bring cloud applications closer to users for increased performance. Unlike back-end cloud systems which consolidate their resources in a centralized data center location with virtually unlimited capacity, edge-clouds comprise distributed resources at various computation spots, each with very limited capacity. In this paper, we consider Function-as-a-Service (FaaS) edge-clouds where application providers deploy their latency-critical functions that process user requests with strict response time deadlines. In this setting, we investigate the problem of resource provisioning and allocation. After formulating the optimal solution, we propose resource allocation and provisioning algorithms across the spectrum of fully-centralized to fully-decentralized. We evaluate the performance of these algorithms in terms of their ability to utilize CPU resources and meet request deadlines under various system parameters. Our results indicate that practical decentralized strategies, which require no coordination among computation spots, achieve performance that is close to the optimal fully-centralized strategy with coordination overheads

An Evaluation of the Impacts of Decentralized Resources Allocation by the Community on the Performance of Secondary Schools in Gucha District, Kenya.

The purpose of this study was to investigate whether there exists a relationship between decentralized resources allocation by the community to secondary schools and academic performance in Gucha. Cross-sectional design was used in Gucha where quantitative research strategy was used for the collection of data using questionnaires. The target population comprised of 138 secondary schools. Stratified random sampling strategy was used to select the 3 strata from which 41 schools and 164 teachers were selected as accessible population.  A Cronbach’s alpha index was used to ascertain reliability and it was found to be .815 for all items. Data collected by questionnaires from 145 teachers were analyzed using Pearson’s correlation coefficient with the help of Statistical Package for Social Sciences (SPSS). The findings of the analysis revealed that there exists a relationship between resources allocated to schools by the community and academic performance of secondary schools in Gucha. From the findings, it was concluded that resource allocation to schools by the community was vital for school performance with implications that there exists inefficiency in decentralized resources allocation to schools. Out of this study, recommendations were made to the Gucha community, the County and National Governments and education stake holders in Kenya. Key words: District Focus for Rural Development, Community, Resources, Cost-  sharing, Harambe

Power Allocation for Adaptive OFDM Index Modulation in Cooperative Networks

In this paper, we propose a power allocation strategy for the adaptive orthogonal frequency-division multiplexing (OFDM) index modulation (IM) in cooperative networks. The allocation strategy is based on the Karush-Kuhn-Tucker (KKT) conditions, and aims at maximizing the average network capacity according to the instantaneous channel state information (CSI). As the transmit power at source and relay is constrained separately, we can thus formulate an optimization problem by allocating power to active subcarriers. Compared to the conventional uniform power allocation strategy, the proposed dynamic strategy can lead to a higher average network capacity, especially in the low signal-to-noise ratio (SNR) region. The analysis is also verified by numerical results produced by Monte Carlo simulations. By applying the proposed power allocation strategy, the efficiency of adaptive OFDM IM can be enhanced in practice, which paves the way for its implementation in the future, especially for cell-edge communications

Market-Based Task Allocation Mechanisms for Limited Capacity Suppliers

This paper reports on the design and comparison of two economically-inspired mechanisms for task allocation in environments where sellers have finite production capacities and a cost structure composed of a fixed overhead cost and a constant marginal cost. Such mechanisms are required when a system consists of multiple self-interested stakeholders that each possess private information that is relevant to solving a system-wide problem. Against this background, we first develop a computationally tractable centralised mechanism that finds the set of producers that have the lowest total cost in providing a certain demand (i.e. it is efficient). We achieve this by extending the standard Vickrey-Clarke-Groves mechanism to allow for multi-attribute bids and by introducing a novel penalty scheme such that producers are incentivised to truthfully report their capacities and their costs. Furthermore our extended mechanism is able to handle sellers' uncertainty about their production capacity and ensures that individual agents find it profitable to participate in the mechanism. However, since this first mechanism is centralised, we also develop a complementary decentralised mechanism based around the continuous double auction. Again because of the characteristics of our domain, we need to extend the standard form of this protocol by introducing a novel clearing rule based around an order book. With this modified protocol, we empirically demonstrate (with simple trading strategies) that the mechanism achieves high efficiency. In particular, despite this simplicity, the traders can still derive a profit from the market which makes our mechanism attractive since these results are a likely lower bound on their expected returns

Performance Evaluation - Annual Report Year 3

This report describes the work done and results obtained in third year of the CATNETS project. Experiments carried out with the different configurations of the prototype are reported and simulation results are evaluated with the CATNETS metrics framework. The applicability of the Catallactic approach as market model for service and resource allocation in application layer networks is assessed based on the results and experience gained both from the prototype development and simulations. --Grid Computing