Adaptive streaming is a popular technique that allows quality adaption for videos based on the current playback conditions. The purpose of this thesis is to investigate how chunks in video files downloaded from YouTube correlate to each other. We investigate how the chunk size characteristics depend on the category and encoding of the video. The main focus is to analyze the chunk sizes of the video, focusing on distinctness between 360$^\circ$ and 2D videos. This is performed using the YouTube API. The videos are downloaded and analysed using youtube-dl and mkv-info. The results show that chunk sizes for adjacent qualities have higher correlation and that videos having a similarity between scenes have higher correlation. In addition, 360$^\circ$ videos differ primarily from regular 2D videos by the amount of qualities used and a generally higher correlation for all qualities.

Avec l'avènement du « big data », de nombreuses répercussions ont eu lieu dans tous les domaines de la technologie de l'information, préconisant des solutions innovantes remportant le meilleur compromis entre coûts et précision. En théorie des graphes, où les graphes constituent un support de modélisation puissant qui permet de formaliser des problèmes allant des plus simples aux plus complexes, la recherche pour des problèmes NP-complet ou NP-difficils se tourne plutôt vers des solutions approchées, mettant ainsi en avant les algorithmes d'approximations et les heuristiques alors que les solutions exactes deviennent extrêmement coûteuses et impossible d'utilisation.Nous abordons dans cette thèse deux problématiques principales: dans un premier temps, le problème du partitionnement des graphes est abordé d'une perspective « big data », où les graphes massifs sont partitionnés en streaming. Nous étudions et proposons plusieurs modèles de partitionnement en streaming et nous évaluons leurs performances autant sur le plan théorique qu'empirique. Dans un second temps, nous nous intéressons au requêtage des graphes distribués/partitionnés. Dans ce cadre, nous étudions la problématique de la « recherche agrégative dans les graphes » qui a pour but de répondre à des requêtes interrogeant plusieurs fragments de graphes et qui se charge de la reconstruction de la réponse finale tel que l'on obtient un « matching approché » avec la requête initiale / With the advent of the "big data", many repercussions have taken place in all fields of information technology, advocating innovative solutions with the best compromise between cost and accuracy. In graph theory, where graphs provide a powerful modeling support for formalizing problems ranging from the simplest to the most complex, the search for NP-complete or NP-difficult problems is rather directed towards approximate solutions, thus Forward approximation algorithms and heuristics while exact solutions become extremely expensive and impossible to use. In this thesis we discuss two main problems: first, the problem of partitioning graphs is approached from a perspective big data, where massive graphs are partitioned in streaming. We study and propose several models of streaming partitioning and we evaluate their performances both theoretically and empirically. In a second step, we are interested in querying distributed / partitioned graphs. In this context, we study the problem of aggregative search in graphs, which aims to answer queries that interrogate several fragments of graphs and which is responsible for reconstructing the final response such that a Matching approached with the initial query

Uppsatsens syfte var att belysa eventuella skillnader och förändringar i två olika generationers användning och relationer till traditionell tv och play-tjänster. Forskningsfrågorna ville ha svar på detta samt motiveringen bakom och även om det fanns generationsrelaterade mönster när det kom till relationerna till tablå-tv och playtjänster. Syftet var likaså att ta reda på under vilka omständigheter konsumtionen av traditionell tv och play-tjänster ägde rum. De teorier uppsatsen hade som utgångspunkt för undersökningen var dels uses and gratifications research som innebär forskning utifrån användaren. Forskningsfrågorna blev även besvarade utifrån Mannheims generationsteori. Uppsatsens material innefattar empiri från åtta intervjuer samt tidigare forskning och litteratur som varit relevant till forskningen. Metoden som användes var kvalitativa intervjuer med personer från en äldre och en yngre åldersgrupp. Undersökningen fick resultatet att den äldre generationen fortfarande hade en hög konsumtion av traditionell tv medan den yngre generationen spenderade en stor del av sin fritid med att titta på play-tjänster. Samtliga intervjupersoner ägnade sig åt andra aktiviteter samtidigt som tv:n stod på. Resultaten visade även att konsumtionen av både tv och play-tjänster var högst individuell, likaså anledningarna bakom.

El presente trabajo tiene como objetivo principal analizar las posibles reformas tributarias en la legislación peruana, que, de ser aplicadas a negocios de servicios digitales remunerados de audio y video vía streaming utilizados en el Perú por personas naturales, incrementarán considerablemente los ingresos percibidos por la Administración Tributaria. Además, se estudiarán las distintas propuestas planteadas por países como Argentina, Chile y Colombia , los cuales toman como referencia las acciones del plan BEPS, y se analizará si lo mismo puede ser replicado por nuestra legislación. El estudio se encuentra dividido en cinco capítulos. En el primer capítulo, se describirán los avances realizados hasta la fecha en materia tributaria realizados por organismos internacionales y países en los cuales se han adoptado reformas en materia fiscal orientadas a la aplicación de impuestos sobre los ingresos y/o sobre el consumo, así como las definiciones actuales de nuestra jurisprudencia que abarcan este tipo de servicios. En el segundo capítulo, se identifica la problemática existente, las hipótesis a comprobar y los objetivos planteados. En el tercer capítulo, desarrollamos la metodología de investigación aplicada en el presente trabajo. La metodología utilizada es mixta, ya que utilizamos métodos cuantitativos y cualitativos, empleando como herramientas las entrevistas a profundidad y encuestas, que permitirán probar las hipótesis formuladas. En el cuarto capítulo, se presentan los resultados obtenidos de los análisis cuantitativos y cualitativos, así como el desarrollo de un caso práctico en el cual se estima el monto que la Administración Tributaria dejó de percibir por la ausencia de reformas que graven con el Impuesto a la Renta e IGV los servicios digitales remunerados de audio y video en streaming en el año 2017. En el quinto capítulo, se analizan los resultados obtenidos de los estudios cuantitativos y cualitativos, así como el análisis del caso práctico. Finalmente, se presentarán las conclusiones y recomendaciones que surjan a partir de la investigación. / The present job of professional proficiency was called "Tax Reform pending of business in virtual platforms of the payment in Peru and its impact in the fiscal collection of Lima Metropolitan 2017". to be applied to this type of digital services of audio and video transmission of transmissions in Peru by natural persons increased in the income received by the Tax Administration. In addition, the different options proposed by countries such as Argentina, Chile and Colombia will be studied, such as how to refer to the actions of the plan. The study is divided into five chapters. In the first chapter, we describe the progress made to date in the tax matters, the shipments are made in the countries and countries in which fiscal reforms have been adopted aimed at the application of income taxes and / or about consumption, as well as the current rights of our jurisprudence cover this type of services. In the second chapter, the identification of the existing problem, the hypotheses and the objectives set. In the third chapter, we developed the applied research methodology in this work. The methodology that is on my list, I use quantitative and qualitative methods, which I use as tools for in-depth interviews and surveys, to test hypotheses. In the fourth chapter, the results of the quantitative and qualitative results are presented, as well as the development of a practical case in which the amount of the administration is estimated. Income Tax and VAT digital audio and video services paid in streaming in 2017. In the fifth chapter, the results of quantitative and qualitative studies are analyzed, as well as the case study analysis. Finally, the conclusions and recommendations that arise from the investigation are presented. / Tesis

The goal with this assignment has been to study the product Spotalike and develop a new version to make the product more attractive. The studying of the product was done with the help of user data, such as how Spotalike is being used, what target audience it has, why it's being used, etc. The new version of Spotalike was planned by making design sketches and prototypes which were created as a first step in order to get a better picture of what the result would be. The new version is not available to the public, but it is fully functional and works locally. The solution that was concluded was to develop a music player which is built on the founding principles of the old Spotalike. The music player is developed with React and is powered by Spotify. Besides the old functions there are also new functions that has been implemented, and the interface has been redesigned. There is currently no new user data available to determine the result of the development, since the new version of Spotalike hasn't been made public yet. / Målet med detta projektarbete har varit att granska produkten Spotalike och utveckla en ny version som gör produkten mer eftertraktad. Problemgranskning har gjorts med analysering av användardata – hur Spotalike används, av vem, varför den används, osv. Den nya versionen av Spotalike planerades med hjälp av designskisser och prototyper som togs fram som första steg för att få en bättre bild av slutresultatet. Den nya versionen är inte tillgänglig publikt, men är fullt funktionell lokalt. Lösningen som togs fram var att skapa en musikspelare som bygger på de grundprinciper gamla Spotalike har. Musikspelaren är bygd med React och använder Spotify i bakgrunden som motor. Utöver de redan befintliga funktionerna så har även nya funktioner tagits fram och gränssnittet har redesignats. Någon ny användarstatistik för att se om lösningen har gynnat bra resultat i form av användarupplevelse finns inte tillgänglig då tjänsten ännu inte har hunnit bli tillgängligt publikt.

Today, the Internet of Things is widely used in various fields, such as factories, public facilities, and even homes. The use of the Internet of Things involves a large number of sensor devices that collect various types of data in real time, such as machine voltage, current, and temperature. These devices will generate a large amount of streaming sensor data. These data can be used to make the data analysis, which can discover hidden relation such as monitoring operating status of a machine, detecting anomalies and alerting the company in time to avoid significant losses. Therefore, the application of anomaly detection in the field of data mining is very extensive. This paper proposes an anomaly detection method based on multiple streaming sensor data and performs anomaly detection on three data sets which are from the real company. First, this project proposes the state transition detection algorithm, state classification algorithm, and the correlation analysis method based on frequency. Then two algorithms were implemented in Python, and then make the correlation analysis using the results from the system to find some possible meaningful relations which can be used in the anomaly detection. Finally, calculate the accuracy and time complexity of the system, and then evaluated its feasibility and scalability. From the evaluation result, it is concluded that the method

Anpassa eller dö, är en kartläggning av musikaggregatorer i den svenska musikindustrin. Uppsatsens syfte är att kartlägga musikaggregatorers olika funktioner i en föränderlig musikbransch för att förstå dess olika funktioner i svensk musik industri.  Uppsatsen är forskad genom en induktiv ansats med kvalitativ forskning och ostrukturerade intervjuer samt deltagande observation, som valda metoder.  Uppsatsens slutsats har visat att musikaggregatorers primära funktion handlar om att distribuera musik till olika streamingtjänster men behöver ständigt anpassa sig i en föränderlig musikbransch för att kunna överleva.

The efficient scheduling of streaming data delivery in a peer-to-peer (P2P) network is a hard problem due to the Internet’s lack of support for resource allocation and performance guarantees. In particular, the bandwidth resources available to a peer is constantly in flux and the future bandwidth availability is very difficult, if not impossible, to predict accurately. This thesis proposes to tackle this problem from a different angle. We investigate the use of erasure codes to encode the media data and then schedule multiple peers to stream the encoded data simultaneously to a receiver. By exploiting the order-invariant property of erasure codes this approach enables the sending peers to fully utilize their available bandwidth resources and yet does not need to estimate or predict their bandwidth availability. Moreover, we develop distributed scheduling algorithms to juxtapose the data transmissions from multiple peers so that the coding and storage complexities can be kept at practical level in scaling up the system. / 在互聯網中變動的可用頻寬和網路的延遲變異等問題，對點對點網絡上的串流傳輸品質造成嚴重的影響。由於每一個用戶端的網絡傳輸速度都是不穩定，而且是難以預測的，這是很困難去制定一個高效率的傳輸排程。在本論文中，我們從另一個角度去解決這個問題。首先，利用抹除碼把訊息變成足夠數量的區塊，讓多個訊息源可以同時傳送不同部分的區塊給受信者。由於抹除碼擁有糾錯能力，訊息源之間便不再需要任何協調及傳輸排程，提升整體的傳輸速度。另外，我們開發了一個排程算法來演算每一個訊息源的區塊傳送次序，盡可能的節省計算抹除碼時所需的資源，以能夠在具規模的環境中運作。 / Ma, Man Lok. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2014. / Includes bibliographical references (leaves 72-75). / Abstracts also in Chinese. / Title from PDF title page (viewed on 26, September, 2016). / Detailed summary in vernacular field only.

Leung Wai Tak. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (leaves 58-60). / Abstracts in English and Chinese. / Acknowledgement --- p.I / Abstract --- p.II / 摘要 --- p.III / Chapter Chapter 1 --- Introduction --- p.1 / Chapter Chapter 2 --- Related Works --- p.5 / Chapter 2.1 --- Previous Works --- p.5 / Chapter 2.2 --- Contributions of this Study --- p.7 / Chapter Chapter 3 --- Architecture --- p.9 / Chapter 3.1 --- Data Placement Policy --- p.10 / Chapter 3.2 --- Retrieval and Transmission Scheduling --- p.13 / Chapter 3.3 --- Fault Tolerance --- p.20 / Chapter Chapter 4 --- Performance Modeling --- p.22 / Chapter 4.1 --- Storage Requirement --- p.22 / Chapter 4.2 --- Network Bandwidth Requirement --- p.23 / Chapter 4.3 --- Buffer Requirement --- p.24 / Chapter 4.4 --- System Response Time --- p.27 / Chapter Chapter 5 --- System Reliability --- p.29 / Chapter 5.1 --- System Failure Model --- p.29 / Chapter 5.2 --- Minimum System Repair Capability --- p.32 / Chapter 5.3 --- Redundancy Configuration --- p.35 / Chapter Chapter 6 --- System Dimensioning --- p.37 / Chapter 6.1 --- Storage Capacity --- p.38 / Chapter 6.2 --- Network Capacity --- p.38 / Chapter 6.3 --- Disk Access Bandwidth --- p.39 / Chapter 6.4 --- Buffer Requirement --- p.41 / Chapter 6.5 --- System Response Time --- p.43 / Chapter Chapter 7 --- Multiple Parity Groups --- p.45 / Chapter 7.1 --- System Failure Model --- p.47 / Chapter 7.2 --- Buffer Requirement --- p.47 / Chapter 7.3 --- System Response Time --- p.49 / Chapter 7.4 --- Redundancy Configuration --- p.49 / Chapter 7.5 --- Scalability --- p.51 / Chapter Chapter 8 --- Conclusions and Future Works --- p.53 / Appendix --- p.55 / Chapter A. --- Derivation of the Artificial Admission Delay --- p.55 / Chapter B. --- Derivation of the Receiver Buffer Requirement --- p.56 / Bibliography --- p.58

點對點視頻點播是架構于互網上的熱門應用，旨在提供高質視頻服務。應用點對點技術的優勢在於，系統可用用戶資源以滿足其他用戶的觀賞需求，從而提高系統可擴展性并低運營成本。在該系統中存在以下關鍵設計因素。其一，在給定用戶資源時，如何以分佈式和動態性方法有效用這些資源；其二，考慮用戶自私性，如何激他們貢獻本地資源。 / 點對點視頻點播系統具有高動態性，非同步性及質性；相比文件共享系統還需大帶寬支持。這些特性使得解決以上技術問題充滿挑戰，因而激發我們的研究。我們試圖回答以下問題： / 如何確定存儲空間對各視頻的最佳分配比，從而最小化服務器負擔？ / 如何設計高效激機制使用戶於貢獻他們的本地資源？ / 我們首先關注最佳複製策。我們回答（1）在給定視頻條件下，如何確定視頻最佳複製比；（2）如何通過分佈式動態算法獲得這樣的最佳複製比。我們將視頻複製技術表達為最優化問題，显示傳統比複製法并非最優，而最優比應正比于文中定義的“欠缺帶寬。我們通過“被動替換算法與“主動推送算法以達到最優複製比，顯示我們的算法可使得服務器負擔大幅下以及服務質素顯著提高。 / 我們而後關注激機制設計。系統運營商需激用戶貢獻上載帶寬以傳輸據，以及本地存儲空間以存儲視頻。我們分解這個設計問題，并為它們逐一設計基於獎賞的激機制。（1）上載帶寬激。用戶根據貢獻帶寬受到獎賞。我們用博弈模型分析運營商與用戶之間的交互。我們推導出博弈均衡，分析系統高效性并研究多重博弈設定下的長期交互特性。（2）分佈存儲激。用戶根據緩存視頻受到獎賞。我們以優化模型刻畫視頻最佳獎賞價格。我們在漸進系統中推導出最優獎賞價格，然後將結果推廣至多種系統環境。 / 總而言之，該文從學建模、博弈分析、算法設計與性能評估等諸多角，解決點對點視頻點播系統中的資源獲取與分配策。 / Peer-to-Peer Video-on-Demand (P2P-VoD) is a popular Internet application which aims to provide a high quality video service to users. The advantage of using the P2P technology is that the system can utilize peers’ resources so as to satisfy other peers’ viewing requirement, thereby improving the system scalability and reducing the operating cost. There are two key design issues in P2P-VoDs. First, given the distributed resources of peers, what is the most efficient manner to utilize them in a distributed and dynamic fashion. Second, given the selfish nature of peers, how to incentivize the peers to contribute their local resources. / A P2P-VoD system is highly dynamic, asynchronous and heterogenous in nature. In addition, it requires a much higher bandwidth resource as compared with file sharing applications. These features make it challenging to solve the above technical problems, and hence motivate our work. In particular, we aim to answer: / How to determine the optimal ratios of storage space that should be assigned to each video, such that the content server’s workload can be minimized? / How to design effective and efficient incentive mechanisms so as to stimulate the peers to contribute their local resources? / We first focus on the optimal replication strategy. In particular, we answer (a) what is the optimal replication ratio of a video in terms of its popularity, and (b) how to achieve these optimal ratios in a distributed and dynamic fashion. We formulate the video replication as an optimization problem, and show that the conventional wisdom of using the proportional replication strategy is “sub-optimal“. The optimal replication ratios should be proportional to the “deficit bandwidth which we define in the thesis. We utilize “passive replacement policy“ and “active push policy“ to achieve the optimal replication ratios and show how to greatly reduce server’s workload and improve streaming quality via our distributed algorithms. / We next focus on incentive mechanisms design. The content providers need to incentivize the peers to contribute their upload capacity to delivery data, and local storage space to cache the videos. We decompose the problems and design reward-based incentive mechanisms for them respectively. (a) Incentivizing upload capacity. Each peer is rewarded based on its dedicated upload bandwidth. We analyze the interaction between a content provider and the peers using game theory. We derive a unique equilibrium, analyze the system efficiency and study the long term interactions under a repeated game setting. (b) Incentivizing distributed caching. Each peer is rewarded based on the videos they cache. We characterizes the optimal reward price using optimization. In particular, we first derive the optimal prices to obtain the desired amount of replicas in an asymptotic system, and then extend our results to adapt to various system environments. / To summarize, this thesis addresses the resource acquisition and allocation problems in P2P-VoD systems via mathematical modeling, game analysis, algorithms design and performance evaluations. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Detailed summary in vernacular field only. / Wu, Weijie. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2012. / Includes bibliographical references (leaves 129-138). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese. / Abstract --- p.i / Acknowledgement --- p.v / Contents --- p.ix / List of Figures --- p.xiii / List of Tables --- p.xv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Peer-to-Peer Networks --- p.2 / Chapter 1.1.1 --- Classification of P2P Networks --- p.2 / Chapter 1.1.2 --- Applications of P2P Services --- p.4 / Chapter 1.2 --- P2P Video-on-Demand Systems --- p.4 / Chapter 1.2.1 --- General Architecture --- p.4 / Chapter 1.2.2 --- Key Advantages of P2P-VoDs --- p.6 / Chapter 1.3 --- Motivation --- p.7 / Chapter 1.4 --- Challenges --- p.8 / Chapter 1.5 --- Contributions --- p.10 / Chapter 1.6 --- A General System Model on P2P-VoDs --- p.12 / Chapter 1.7 --- Thesis Structure and Organization --- p.15 / Chapter 2 --- Optimal Replication Strategies in P2P-VoD Systems --- p.17 / Chapter 2.1 --- Chapter Overview --- p.17 / Chapter 2.2 --- Mathematical Model --- p.19 / Chapter 2.2.1 --- Basic System Assumptions and Peer Scheduling Policy --- p.19 / Chapter 2.2.2 --- Server’s Workload --- p.22 / Chapter 2.2.3 --- Discussion on Peer Operations --- p.26 / Chapter 2.2.4 --- Impact of Replication on Reducing the Server’s Workload --- p.27 / Chapter 2.3 --- Optimal Replication Ratios to Minimize Server’s Workload --- p.30 / Chapter 2.3.1 --- Operation Modes --- p.30 / Chapter 2.3.2 --- Characteristics of Deficit Bandwidth --- p.31 / Chapter 2.3.3 --- Characterizing the Optimal Replication Strategy --- p.34 / Chapter 2.3.4 --- Discussion on Heterogeneous Video Playback Rates --- p.36 / Chapter 2.4 --- Algorithms to Control Replication Ratios --- p.38 / Chapter 2.4.1 --- Passive Adjustment via Replacement Algorithm --- p.39 / Chapter 2.4.2 --- Active Adjustment via Push Strategy --- p.40 / Chapter 2.5 --- Performance Evaluation --- p.43 / Chapter 2.5.1 --- Performance of Replacement Algorithm --- p.43 / Chapter 2.5.2 --- Performance of Push Algorithm --- p.49 / Chapter 2.6 --- Chapter Summary --- p.51 / Chapter 3 --- Incentivizing Upload Capacity in P2P-VoD Systems --- p.53 / Chapter 3.1 --- Chapter Overview --- p.53 / Chapter 3.2 --- Peers’ Viewing Behavior and Reward-based Scheme --- p.55 / Chapter 3.2.1 --- Peers’ Viewing Behavior --- p.55 / Chapter 3.2.2 --- Reward-based Incentive Scheme --- p.57 / Chapter 3.3 --- Peers’ Contribution and Content Provider’s Cost --- p.58 / Chapter 3.3.1 --- Distribution of Peers in Different Video Segments --- p.58 / Chapter 3.3.2 --- Content Provider’s Upload Cost --- p.61 / Chapter 3.4 --- Game Theoretic Analysis on Incentive Scheme --- p.62 / Chapter 3.4.1 --- Stackelberg Game Model --- p.63 / Chapter 3.4.2 --- Existence and Uniqueness of Stackelberg Equilibrium --- p.64 / Chapter 3.4.3 --- Efficiency of Stackelberg Equilibrium --- p.67 / Chapter 3.4.4 --- General Reward Scheme --- p.72 / Chapter 3.4.5 --- Repeated Game Model --- p.73 / Chapter 3.5 --- Performance Evaluation --- p.77 / Chapter 3.6 --- Discussion on Practical Issues --- p.82 / Chapter 3.6.1 --- System Heterogeneity --- p.82 / Chapter 3.6.2 --- P2P-VoD System with Caching --- p.83 / Chapter 3.6.3 --- Cheating Prevention Guarantee --- p.84 / Chapter 3.7 --- Chapter Summary --- p.84 / Chapter 4 --- Incentivizing Distributed Caching in P2P-VoD Systems --- p.86 / Chapter 4.1 --- Chapter Overview --- p.86 / Chapter 4.2 --- Mathematical Model --- p.88 / Chapter 4.2.1 --- Preliminaries --- p.88 / Chapter 4.2.2 --- Peers’ Caching Behaviors --- p.91 / Chapter 4.2.3 --- Cache state distribution of peers of type m --- p.93 / Chapter 4.2.4 --- Cache State of the System --- p.95 / Chapter 4.2.5 --- Design Objectives of Pricing Schemes --- p.96 / Chapter 4.3 --- Asymptotic Analysis --- p.98 / Chapter 4.3.1 --- Cache State of Peers --- p.99 / Chapter 4.3.2 --- Conservative Pricing Problem --- p.102 / Chapter 4.3.3 --- Strategic Pricing Problem --- p.105 / Chapter 4.4 --- Generalizations and Extensions --- p.106 / Chapter 4.4.1 --- Viewing-Caching Decoupling --- p.107 / Chapter 4.4.2 --- General Sensitivity Model --- p.108 / Chapter 4.4.3 --- Non-Asymptotic System --- p.111 / Chapter 4.4.4 --- Pricing before Reaching the Steady State --- p.113 / Chapter 4.5 --- Performance Evaluation --- p.115 / Chapter 4.6 --- Chapter Summary --- p.119 / Chapter 5 --- Related Work --- p.120 / Chapter 5.1 --- Related Work on Replication Strategy --- p.120 / Chapter 5.2 --- Related Work on Incentive Mechanisms Design --- p.122 / Chapter 6 --- Conclusion and FutureWork --- p.125 / Chapter 6.1 --- Conclusion --- p.125 / Chapter 6.2 --- Future work --- p.126 / Chapter 6.2.1 --- Extensions for Various Practical Issues --- p.126 / Chapter 6.2.2 --- Incentive and Resource Allocation in Other Applications --- p.127 / Bibliography --- p.129