1,887 research outputs found
Costs and benefits of superfast broadband in the UK
This paper was commissioned from LSE Enterprise by Convergys Smart Revenue Solutions to stimulate an open and constructive debate among the main stakeholders about the balance between the costs, the revenues, and the societal benefits of ‘superfast’ broadband. The intent has been to analyse the available facts and to propose wider perspectives on economic and social interactions. The paper has two parts: one concentrates on superfast broadband deployment and the associated economic and social implications (for the UK and its service providers), and the other considers alternative social science approaches to these implications. Both parts consider the potential contribution of smart solutions to superfast broadband provision and use. Whereas Part I takes the “national perspective” and the “service provider perspective”, which deal with the implications of superfast broadband for the UK and for service providers, Part II views matters in other ways, particularly by looking at how to realise values beyond the market economy, such as those inherent in neighbourliness, trust and democrac
Incentives and Two-Sided Matching - Engineering Coordination Mechanisms for Social Clouds
The Social Cloud framework leverages existing relationships between members of a social network for the exchange of resources. This thesis focuses on the design of coordination mechanisms to address two challenges in this scenario. In the first part, user participation incentives are studied. In the second part, heuristics for two-sided matching-based resource allocation are designed and evaluated
Peer-to-Peer Bartering: Swapping Amongst Self-interested Agents
Large--scale distributed environments can be seen as a conflict between the selfish aims of the participants and the group welfare of the population as a whole. In order to regulate the behavior of the participants it is often necessary to introduce mechanisms that provide incentives and stimulate cooperative behavior in order to mitigate for the resultant potentially undesirable availability outcomes which could arise from individual actions.The history of economics contains a wide variety of incentive patterns for cooperation. In this thesis, we adopt bartering incentive pattern as an attractive foundation for a simple and robust form of exchange to re-allocate resources. While bartering is arguably the world's oldest form of trade, there are still many instances where it surprises us. The success and survivability of the barter mechanisms adds to its attractiveness as a model to study.In this thesis we have derived three relevant scenarios where a bartering approach is applied. Starting from a common model of bartering: - We show the price to be paid for dealing with selfish agents in a bartering environment, as well as the impact on performance parameters such as topology and disclosed information.- We show how agents, by means of bartering, can achieve gains in goods without altruistic agents needing to be present.- We apply a bartering--based approach to a real application, the directory services.The core of this research is the analysis of bartering in the Internet Age. In previous times, usually economies dominated by bartering have suffered from high transaction costs (i.e. the improbability of the wants, needs that cause a transaction occurring at the same time and place). Nowadays, the world has a global system of interconnected computer networks called Internet. This interconnected world has the ability to overcome many challenges of the previous times. This thesis analysis the oldest system of trade within the context of this new paradigm. In this thesis we aim is to show thatbartering has a great potential, but there are many challenges that can affect the realistic application of bartering that should be studied.The purpose of this thesis has been to investigate resource allocation using bartering mechanism, with particular emphasis on applications in largescale distributed systems without the presence of altruistic participants in the environment.Throughout the research presented in this thesis we have contributed evidence that supports the leitmotif that best summarizes our work: investigation interactions amongst selfish, rational, and autonomous agents with incomplete information, each seeking to maximize its expected utility by means of bartering. We concentrate on three scenarios: one theoretical, a case of use, and finally a real application. All of these scenarios are used for evaluating bartering. Each scenario starts from a common origin, but each of them have their own unique features.The final conclusion is that bartering is still relevant in the modern world
Clustering algorithm for D2D communication in next generation cellular networks : thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Engineering, Massey University, Auckland, New Zealand
Next generation cellular networks will support many complex services for smartphones, vehicles, and other devices. To accommodate such services, cellular networks need to go beyond the capabilities of their previous generations. Device-to-Device communication (D2D) is a key technology that can help fulfil some of the requirements of future networks.
The telecommunication industry expects a significant increase in the density of mobile devices which puts more pressure on centralized schemes and poses risk in terms of outages, poor spectral efficiencies, and low data rates. Recent studies have shown that a large part of the cellular traffic pertains to sharing popular contents. This highlights the need for decentralized and distributive approaches to managing multimedia traffic.
Content-sharing via D2D clustered networks has emerged as a popular approach for alleviating the burden on the cellular network. Different studies have established that D2D communication in clusters can improve spectral and energy efficiency, achieve low latency while increasing the capacity of the network. To achieve effective content-sharing among users, appropriate clustering strategies are required. Therefore, the aim is to design and compare clustering approaches for D2D communication targeting content-sharing applications. Currently, most of researched and implemented clustering schemes are centralized or predominantly dependent on Evolved Node B (eNB). This thesis proposes a distributed architecture that supports clustering approaches to incorporate multimedia traffic. A content-sharing network is presented where some D2D User Equipment (DUE) function as content distributors for nearby devices. Two promising techniques are utilized, namely, Content-Centric Networking and Network Virtualization, to propose a distributed architecture, that supports efficient content delivery.
We propose to use clustering at the user level for content-distribution. A weighted multi-factor clustering algorithm is proposed for grouping the DUEs sharing a common interest. Various performance parameters such as energy consumption, area spectral efficiency, and throughput have been considered for evaluating the proposed algorithm. The effect of number of clusters on the performance parameters is also discussed. The proposed algorithm has been further modified to allow for a trade-off between fairness and other performance parameters. A comprehensive simulation study is presented that demonstrates that the proposed clustering algorithm is more flexible and outperforms several well-known and state-of-the-art algorithms.
The clustering process is subsequently evaluated from an individual user’s perspective for further performance improvement. We believe that some users, sharing common interests, are better off with the eNB rather than being in the clusters. We utilize machine learning algorithms namely, Deep Neural Network, Random Forest, and Support Vector Machine, to identify the users that are better served by the eNB and form clusters for the rest of the users. This proposed user segregation scheme can be used in conjunction with most clustering algorithms including the proposed multi-factor scheme. A comprehensive simulation study demonstrates that with such novel user segregation, the performance of individual users, as well as the whole network, can be significantly improved for throughput, energy consumption, and fairness
Economic regulation for multi tenant infrastructures
Large scale computing infrastructures need scalable and effi cient resource allocation mechanisms to ful l the requirements of its participants and applications while the whole system is regulated to work e ciently. Computational markets provide e fficient allocation mechanisms that aggregate information from multiple sources in large, dynamic and complex systems where there is not a single source with complete information. They have been proven to be successful in matching resource demand and resource supply in the presence of sel sh multi-objective and utility-optimizing users and sel sh pro t-optimizing providers. However, global infrastructure metrics which may not directly affect participants of the computational market still need to be addressed -a.k.a. economic externalities like load balancing or energy-efficiency.
In this thesis, we point out the need to address these economic externalities, and we design and evaluate appropriate regulation mechanisms from di erent perspectives on top of existing economic models, to incorporate a wider range of objective metrics not considered otherwise. Our main contributions in this thesis are threefold; fi rst, we propose a taxation mechanism that addresses the resource congestion problem e ffectively improving the balance of load among resources when correlated economic preferences are present; second,
we propose a game theoretic model with complete information to derive an algorithm to aid resource providers to scale up and down resource supply so energy-related costs can be reduced; and third, we relax our previous assumptions about complete information on the resource provider side and design an incentive-compatible mechanism to encourage users to truthfully report their resource requirements effectively assisting providers to make energy-eff cient allocations while providing a dynamic allocation mechanism to users.Les infraestructures computacionals de gran escala necessiten mecanismes d’assignació de recursos escalables i eficients per complir amb els requisits computacionals de tots els seus participants, assegurant-se de que el sistema és regulat apropiadament per a que funcioni de manera efectiva. Els mercats computacionals són mecanismes d’assignació de recursos eficients que incorporen informació de diferents fonts considerant sistemes de gran escala, complexos i dinàmics on no existeix una única font que proveeixi informació completa de l'estat del sistema. Aquests mercats computacionals han demostrat ser exitosos per acomodar la demanda de recursos computacionals amb la seva oferta quan els seus participants son considerats estratègics des del punt de vist de teoria de jocs. Tot i això existeixen mètriques a nivell global sobre la infraestructura que no tenen per que influenciar els usuaris a priori de manera directa. Així doncs, aquestes externalitats econòmiques com poden ser el balanceig de càrrega o la eficiència energètica, conformen una línia d’investigació que cal explorar. En aquesta tesi, presentem i descrivim la problemàtica derivada d'aquestes externalitats econòmiques. Un cop establert el marc d’actuació, dissenyem i avaluem mecanismes de regulació apropiats basats en models econòmics existents per resoldre aquesta problemàtica des de diferents punts de vista per incorporar un ventall més ampli de mètriques objectiu que no havien estat considerades fins al moment. Les nostres contribucions principals tenen tres vessants: en primer lloc, proposem un mecanisme de regulació de tipus impositiu que tracta de mitigar l’aparició de recursos sobre-explotats que, efectivament, millora el balanceig de la càrrega de treball entre els recursos disponibles; en segon lloc, proposem un model teòric basat en teoria de jocs amb informació o completa que permet derivar un algorisme que facilita la tasca dels proveïdors de recursos per modi car a l'alça o a la baixa l'oferta de recursos per tal de reduir els costos relacionats amb el consum energètic; i en tercer lloc, relaxem la nostra assumpció prèvia sobre l’existència d’informació complerta per part del proveïdor de recursos i dissenyem un mecanisme basat en incentius per fomentar que els usuaris facin pública de manera verídica i explícita els seus requeriments computacionals, ajudant d'aquesta manera als proveïdors de recursos a fer assignacions eficients des del punt de vista energètic a la vegada que oferim un mecanisme l’assignació de recursos dinàmica als usuari
ADDRESSING SELFISHNESS IN THE DESIGN OF COOPERATIVE SYSTEMS
I sistemi distribuiti cooperativi, tra cui in particolare i sistemi peer-to-peer, sono oggi alla base di applicazioni Internet di larga diffusione come file-sharing e media streaming, nonch\ue9 di tecnologie emergenti quali Blockchain e l'Internet of Things. Uno dei fattori chiave per il successo di un sistema cooperativo \ue8 che i nodi che vi partecipano mettano a disposizione della comunit\ue0 una parte delle proprie risorse (es. capacit\ue0 di calcolo, banda, spazio disco). Alcuni nodi, poich\ue9 controllati da agenti autonomi e indipendenti, potrebbero tuttavia agire egoisticamente e scegliere di non condividere alcuna risorsa, spinti dall'obiettivo di massimizzare la propria utilit\ue0 anche se a danno delle prestazioni dell'intero sistema. Affrontare l'egoismo dei nodi rappresenta dunque un'attivit\ue0 imprescindibile per lo sviluppo di un sistema cooperativo affidabile e performante. Nonostante il grande numero di tecniche ed approcci presenti in letteratura, tale attivit\ue0 richiede elaborazioni complesse, manuali e laboriose, nonch\ue9 conoscenze approfondite in vari domini di applicazione.
Obiettivo di questa tesi \ue8 di fornire strumenti sia pratici che teorici per semplificare lo studio e il contrasto dei comportamenti egoistici nei sistemi cooperativi. Il primo contributo, basato su un'analisi esaustiva dello stato dell'arte sull'egoismo in sistemi distribuiti, presenta un framework di classificazione finalizzato all'identificazione e comprensione dei comportamenti egoistici pi\uf9 importanti su cui concentrarsi durante la progettazione di un sistema cooperativo. Come secondo contributo, presentiamo RACOON, un framework per la progettazione e configurazione di sistemi cooperativi resilienti all'egoismo dei nodi. L'obiettivo di RACOON \ue8 di semplificare tali attivit\ue0 fornendo una metodologia generale e semi-automatica, capace di integrare in un dato sistema pratici meccanismi di incentivo alla cooperazione, attentamente calibrati in modo da raggiungere gli obiettivi di resilienza e performance desiderati. A tal fine, RACOON impiega sia strumenti analitici appartenenti alla teoria dei giochi che metodi simulativi, che vengono utilizzati per fare previsioni sul comportamento del sistema in presenza di nodi egoisti. In questa tesi presentiamo inoltre una versione estesa del framework, chiamata RACOON++, sviluppata per migliorare l'accuratezza, flessibilit\ue0 e usabilit\ue0 del framework originale. Infine, come ultimo contributo del lavoro di tesi, presentiamo SEINE, un framework per la rapida modellazione e analisi sperimentale di vari tipi di comportamenti egoistici in un dato sistema cooperativo. Il framework \ue8 basato su un nuovo linguaggio specifico di dominio (SEINE-L) sviluppato per la descrizione degli scenari di egoismo da analizzare. SEINE fornisce inoltre supporto semi-automatico per l'implementazione e lo studio di tali scenari in un simulatore di sistemi distribuiti selezionato dallo stato dell'arte.Cooperative distributed systems, particularly peer-to-peer systems, are the basis of several mainstream Internet applications (e.g., file-sharing, media streaming) and the key enablers of new and emerging technologies, including blockchain and the Internet of Things. Essential to the success of cooperative systems is that nodes are willing to cooperate with each other by sharing part of their resources, e.g., network bandwidth, CPU capability, storage space. However, as nodes are autonomous entities, they may be tempted to behave in a selfish manner by not contributing their fair share, potentially causing system performance degradation and instability. Addressing selfish nodes is, therefore, key to building efficient and reliable cooperative systems. Yet, it is a challenging task, as current techniques for analysing selfishness and designing effective countermeasures remain manual and time-consuming, requiring multi-domain expertise.
In this thesis, we aim to provide practical and conceptual tools to help system designers in dealing with selfish nodes. First, based on a comprehensive survey of existing work on selfishness, we develop a classification framework to identify and understand the most important selfish behaviours to focus on when designing a cooperative system. Second, we propose RACOON, a unifying framework for the selfishness-aware design and configuration of cooperative systems. RACOON provides a semi-automatic methodology to integrate a given system with practical and finely tuned mechanisms to meet specified resilience and performance objectives, using game theory and simulations to predict the behaviour of the system when subjected to selfish nodes. An extension of the framework (RACOON++) is also proposed to improve the accuracy, flexibility, and usability of RACOON. Finally, we propose SEINE, a framework for fast modelling and evaluation of various types of selfish behaviour in a given cooperative system. SEINE relies on a domain-specific language for describing the selfishness scenario to evaluate and provides semi-automatic support for its implementation and study in a state-of-the-art simulator.Les syst\ue8mes distribu\ue9s collaboratifs, en particulier les syst\ue8mes pair-\ue0-pair, forment l\u2019infrastructure sous-jacente de nombreuses applications Internet, certaines parmi les plus populaires (ex\ua0: partage de fichiers, streaming multim\ue9dia). Ils se situent \ue9galement \ue0 la base d\u2019un ensemble de technologies \ue9mergentes telles que la blockchain et l\u2019Internet des Objets. Le succ\ue8s de ces syst\ue8mes repose sur la contribution volontaire, de la part des n\u153uds participants, aux ressources partag\ue9es (ex : bande passante r\ue9seau, puissance de calcul, stockage de donn\ue9es). Or ces n\u153uds sont des entit\ue9s autonomes qui peuvent consid\ue9rer comme plus avantageux de se comporter de mani\ue8re \ue9go\uefste, c\u2019est-\ue0- dire de refuser de collaborer. De tels comportements peuvent fortement impacter les performances et la stabilit\ue9 op\ue9rationnelles du syst\ue8me cible. Prendre en compte et pr\ue9venir les comportements \ue9go\uefstes des n\u153uds est donc essentiel pour garantir l\u2019efficacit\ue9 et la fiabilit\ue9 des syst\ue8mes coop\ue9ratifs. Cependant, cela exige du d\ue9veloppeur, en d\ue9pit de la grande quantit\ue9 de techniques et d\u2019approches propos\ue9es dans la litt\ue9rature, des connaissances multisectorielles approfondies.
L'objectif de cette th\ue8se est de concevoir et \ue9tudier de nouveaux outils th\ue9oriques et pratiques pour aider les concepteurs de syst\ue8mes distribu\ue9s collaboratifs \ue0 faire face \ue0 des n\u153uds \ue9go\uefstes. La premi\ue8re contribution, bas\ue9e sur une analyse exhaustive de la litt\ue9rature sur les comportements \ue9go\uefstes dans les syst\ue8mes distribu\ue9s, propose un mod\ue8le de classification pour identifier et analyser les comportements \ue9go\uefstes les plus importants sur lesquels il est important de se concentrer lors de la conception d'un syst\ue8me coop\ue9ratif. Dans la deuxi\ue8me contribution, nous proposons RACOON, un framework pour la conception et la configuration de syst\ue8mes coop\ue9ratifs r\ue9silients aux comportements \ue9go\uefstes. Outre un ensemble de m\ue9canismes d'incitation \ue0 la coop\ue9ration, RACOON fournit une m\ue9thodologie semi-automatique d\u2019int\ue9gration et de calibration de ces m\ue9canismes de mani\ue8re \ue0 garantir le niveau de performance souhait\ue9. RACOON s\u2019appuie sur une analyse du syst\ue8me cible fond\ue9e sur la th\ue9orie des jeux et sur des simulations pour pr\ue9dire l\u2019existence de n\u153uds \ue9go\uefstes dans le syst\ue8me. RACOON a \ue9t\ue9 \ue9tendu en un deuxi\ue8me framework, RACOON++. Plus pr\ue9cis, plus flexible, RACOON++ offre \ue9galement une plus grande facilit\ue9 d'utilisation. Une derni\ue8re contribution, SEINE, propose un framework pour la mod\ue9lisation et l'analyse des diff\ue9rents types de comportements \ue9go\uefstes dans un syst\ue8me coop\ue9ratif. Bas\ue9 sur un langage d\ue9di\ue9, d\ue9velopp\ue9 pour d\ue9crire les sc\ue9narios de comportement \ue9go\uefstes, SEINE fournit un support semi-automatique pour la mise en \u153uvre et l'\ue9tude de ces sc\ue9narios dans un simulateur choisi sur la base de l\u2019\ue9tat de l\u2019art (PeerSim)
- …