A new caching policy for cloud assisted Peer-to-Peer video on-demand services
|
|
- Lawrence Jones
- 6 years ago
- Views:
Transcription
1 A new caching policy for cloud assisted Peer-to-Peer video on-demand services Franco Robledo, Pablo Rodríguez-Bocca, Pablo Romero and Claudia Rostagnol Facultad de Ingeniería, Universidad de la República. Montevideo, Uruguay. IEEE International Conference on Peer-to-Peer Computing September 03-05, Tarragona, Spain
2 Outline 1 Introduction and Problem 2 Proposed Solution 3 Problem Optimization 4 Experimental Evaluation 5 Conclusions
3 Outline 1 Introduction and Problem 2 Proposed Solution 3 Problem Optimization 4 Experimental Evaluation 5 Conclusions
4 Problem Problem - first definition Problem We have a set of videos that we want to distribute on-demand, using GoalBit P2P protocol ( optimizing resources and download time. In order to better understand the problem we have to define the following concepts: GoalBit platform, protocol and components. Peers behavior. Previous work. Assumptions.
5 Definitions What is GoalBit? GoalBit is a set of products and protocols: GoalBit Protocol (GBTP) based on BitTorrent protocol, but designed for live streaming. GoalBit Media Player (GMP) player to watch live and on-demand GoalBit contents. GoalBit Media Server (GMS) which can: play a GoalBit streaming, distribute a GoalBit streaming, generate a GoalBit streaming (broadcast), and transcode a GoalBit streaming. GoalBit Suite (GS) that is a web system to administrate and control a GoalBit Platform.
6 Definitions GoalBit VoD components These are the GoalBit components related with P2P Protocol and on-demand distribution: Content: video to be distributed on demand. Peer: end-user that want to watch a video (downloader or seeder) Super-Peer: special peer with better bandwidth and more stable. They are managed by the platform s operator and only executed in the cloud servers.
7 Definitions GoalBit VoD components Tracker: server entity that knows all Peers and Super- Peers that are sharing a content (seeding or downloading). Repository: storage space where to save VoD contents (inside the GoalBit platform) to be distributed by Super- Peers.
8 Definitions Peers behavior About peers behavior in a BitTorrent-like system: Peers can enter and leave the network when they want. A peer can be in one of the following states: connecting, downloading, seeding or disconnected. We can estimate the probabilities of changing from one state to other. It was previously shown 1 that the BitTorrent peers behavior can be modeled as a Markov chain. 1 Y. Tian, D. Wu, and K. W. Ng, Analyzing multiple file downloading in bittorrent in Proceedings of ICPP 06 - IEEE, August 2006, pp
9 Our goal Problem - formal definition Now we can present our problem in a more detailed way: Problem We have a set of videos, a set of repositories and super-peers (servers) and a set of peers requesting to watch these videos on demand. We want to find the best video distribution into the repositories to offer a minimal download time to peers (which could imply to add more replicas for more popular/required videos and less replicas for less popular videos).
10 Outline 1 Introduction and Problem 2 Proposed Solution 3 Problem Optimization 4 Experimental Evaluation 5 Conclusions
11 Some details Details As proposed in previous work, we model the system as a Markov chain with following details: Each peer can download multiple streams at time t. Peers are grouped into classes: {C 1, C 2,..., C K } (peers in class C i are downloading i videos simultaneously). Peers at class C i allocate the i-th part of its peer s bandwidth for each concurrent download. Video popularity is defined by the number of peers requesting the same video in a period of time.
12 Problem data Problem data K available videos s j size (in kbits) of video j xj i(t) downloaders in class Ci downloading video j at time t yj i(t) seeders in class Ci seeding video j at time t spj i(t) super-peers in class Ci seeding video j at time t λ i j arrival rate for peers in class C i requesting video j γ departure rate of seeders θj i departure rate of downloaders in class C i downloading video c total download bandwidth for each peer (in kbps) µ total upload bandwidth for each peer (in kbps) ρ total upload bandwidth for each super-peer (in kbps) η video sharing effectiveness between peers (η [0, 1]) S p storage capacity of super-peer p (in kbits) E p j indicates if the super-peer p has a copy of video j (E p j 0, 1)
13 Problem model Problem model (P2P) Modeling the peers behavior as a simple fluid model we get the following differential equations (peers evolution: xj i (t) and y i j (t)): P2P Fluid model dx i j dt dy i j dt = λ i j θ i x i j min = min { { c is j x i j, η µ is j x i j + α i j c is j x i j, η µ is j x i j + α i j k ( µ yj k s j k k + ρ spj k s j k ( µ yj k s j k + ρ spj k s j k )} γ i j y i j )} i, j {1... K }:
14 Problem model Problem model (P2P) Assuming that the system will reach its steady state, where the number of peers is stable ( dx j i dt = dy j i dt can calculate the steady state value for x i j = 0 i, j {1... K }), we (t) and y i j (t): P2P Steady state x i j = max{ λi j is j P2P c y i j P2P = λi j γ, iλi j γµη λ k j k k λk j γs j k λk j µ k γρ k z k j k }
15 Problem model Problem model (CDN) A traditional Content Delivery Network (CDN) 2 can be viewed as a particular case of this analytical approach (where η = 0, µ = 0, yj i (t) = 0 and the previously named super-peers are now static servers). CDN Fluid model dx i j dt = λ i j θj i x j i min{ c xj i is, ρ sp +αi j k j j s j k } k i, j {1... K } 2 CDN is a large distributed system of servers deployed in multiple data centers over Internet. Its goal is to serve content to end-users with high availability and high performance.
16 Problem model Problem model (CDN) To get the expressions for the steady state in the CDN system we take µ = 0 and η = 0: Steady state { λ i xj i j is j = max CDN c, iλi j (λ } j ρ j ) θλ j
17 Problem model Average download time The average download time for any downloader at steady state can be computed applying Little s law: T i j = x j i λ i j We denote T P2P and T CDN the expected download times under steady state for peers in a P2P network and users in the CDN system, respectively. Average download time. T P2P = x i j P2P λ i j T CDN = x i j CDN λ i j
18 Problem model Average download time So, to compare average download times we can compare the number of downloaders in steady state for each system. We demonstrate that the following chain of inequalities holds: j = iλi j (λ j ρ j ) iλ i j φ j ( ) iλi j (λ j ρ j ) P2P λ j θ + µ s j (η θ γ ) θλ j x i = x i j CDN So we can conclude a very important result: P2P vs. CDN T P2P T CDN
19 Outline 1 Introduction and Problem 2 Proposed Solution 3 Problem Optimization 4 Experimental Evaluation 5 Conclusions
20 Optimization Combinatorial Optimization Problem Our problem can now be written as a Combinatorial Optimization Problem (COP): Combinatorial Optimization Problem min E p j K max j=1 s.t. λ j s j c (1) j, λ j ρ j φ j θ + ηµ µθ s j γs j E p j s j S p p (2) p E p j 2 j (3)sp j = p E p j j (4)E p j {0, 1} j, p
21 Optimization Multi-Knapsack Problem The COP we address here is similar to the Multi-Knapsack Problem (MKP), where each super-peer holds a knapsack (super-peers storage) with limited capacity and items (videos) must be placed inside the knapsacks. Since MKP is known to be Strongly NP-Hard (it reduces to the Bin Packing Problem 3 ) we designed a Greedy Randomized Adaptive Search Procedure (GRASP). 3 M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, NY, USA: W. H. Freeman & Co., 1979.
22 Optimization Greedy Randomized Adaptive Search Procedure GRASP is an iterative process which operates in two phases: 1 Construction Phase: an initial feasible solution is built, 2 Local Search Phase: solution s neighborhood is explored to find better solutions. As a result we will get a possible distribution of videos in the available super-peers, which gives the best (minimum) download time of all tested solutions.
23 Implementation GRASP - Construction Phase E = RandomGreedy(λ, θ, γ.η, s, S, µ, c, ρ) 1: V = SortVideos(s) 2: for j = 1 TO K do 3: (p 1, p 2, p 3 ) FeasibleSelect(S 1,..., S P ) 4: E(p 1, V (j)) 1 5: E(p 2, V (j)) 1 6: if p 3 > 0 then 7: E(p 3, V (j)) 1 8: end if 9: Update(S 1,..., S P ) 10: end for 11: return E
24 Implementation GRASP - Local Search Phase E out = LocalSearch(E) 1: (E, improve) Add(Rand(SP, Video)) 2: IF improve GO TO Line 1 3: (E, improve) Delete(Rand(SP, Video)) 4: IF improve GO TO Line 1 5: (E, improve) Swap(Rand(SP1, V 1), Rand(SP2, V 2)) 6: IF improve GO TO Line 1 7: return E out = E
25 Outline 1 Introduction and Problem 2 Proposed Solution 3 Problem Optimization 4 Experimental Evaluation 5 Conclusions
26 Tests GRASP - Evaluation Real information from a local Internet Video on-demand Service Provider (AdinetTV videos (K ), videos average size is 23 MB (s), 4 super-peers (P), super-peers storage capacity is 1500 GB (S), super-peers upload rate is 10 Mbps.(ρ), peers download rate is 1 Mbps (c), peers upload rate is 0.25 Mbps (µ), P2P effectiveness of 50% (η = 0.5), seeders departure with rate 100 (γ = 100) and peers departure with rate 0.1 (θ = 0.1).
27 Tests GRASP - Implementation We implemented the COP in Matlab, and we calibrate the GRASP algorithm with generated instances. We contrast the performance of both CDN and P2P system in two aspects: scalability: we stress the system keeping the popularity proportional with the real data (i.e. multiplying the real λ by an increasing factor). economical savings: we chose a fixed value for the system popularity and then changed the number of super-peers/servers (increasing the available resources at the platform side).
28 Results GRASP - Scalability result Estimated download time (CDN) T_P2P T_CDN Popularity factor (10^i) Estimated download time (P2P) Figure: Performance of CDN and P2P systems versus popularity.
29 Results GRASP - Savings result Estimated download time (CDN) T_P2P T_CDN Number of super-peers Estimated download time (P2P) Figure: P2P performance versus number of super-peers.
30 Outline 1 Introduction and Problem 2 Proposed Solution 3 Problem Optimization 4 Experimental Evaluation 5 Conclusions
31 Results theory: We theoretically shown that, under same conditions, the average download time of the P2P system is equal or better than the average download time of CDN system. scalability: We confirmed the theory in the practice - In order to reach the same level of service (the same average download time) in a client-server system we should increase the number of servers (or super-peers) proportionally with the end-user requests; while in the P2P system we have a natural scalability with the growing resources offered by users (downloaders and seeders). savings: Results showed that CDN system is much more sensible to the changes in the available resources (super-peers/servers).
32 Future work Current and future goals: Compare our GRASP results with other metaheuristics in order to find a good approximation of the optimal solution. Include the optimization algorithm into GoalBit Platform in order to know the algorithm performance and adaptation to the real world. Gather data from popular commercial services to further validate our model.
33 Thanks! UdelaR: GoalBit: AdinetTV:
Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks
Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks Dongyu Qiu and R. Srikant Coordinated Science Laboratory University of Illinois at Urbana-Champaign CSL, UIUC p.1/22 Introduction
More informationBitTorrent Fairness Analysis
BitTorrent Fairness Analysis Team Asians Zhenkuang He Gopinath Vasalamarri Topic Summary Aim to test how the fairness affect the file transfer speed in a P2P environment (here using the BitTorrent Protocol)
More informationQuality-centric design of Peer-to-Peer systems for live-video broadcasting
Quality-centric design of Peer-to-Peer systems for live-video broadcasting Pablo Rodríguez-Bocca Facultad de Ingeniería, Universidad de la República. INRIA/Université de Rennes 1, Rennes, France. Advisors:
More informationAnatomy of a P2P Content Distribution System with Network Coding
Anatomy of a P2P Content Distribution System with Network Coding Christos Gkantsidis, John Miller, and Pablo Rodriguez Microsoft Research, Cambridge Anatomy of a P2P Content Distribution System with Network
More informationPerformance Analysis and Improvement for BitTorrent-like File Sharing Systems
CONCURRENCY AND COMPUTATION: PRACTICE AND EXPERIENCE Concurrency Computat.: Pract. Exper. 2007; 00:1 7 [Version: 2002/09/19 v2.02] Performance Analysis and Improvement for BitTorrent-like File Sharing
More informationP2P VoD Systems: Modelling and Performance
P2P VoD Systems: Modelling and Performance Samuli Aalto, Aalto University, Finland Pasi Lassila, Aalto University, Finland Niklas Raatikainen, HIIT, Finland Petri Savolainen, HIIT, Finland Sasu Tarkoma,
More informationExploring the Optimal Replication Strategy in P2P-VoD Systems: Characterization and Evaluation
1 Exploring the Optimal Replication Strategy in P2P-VoD Systems: Characterization and Evaluation Weijie Wu, Student Member, IEEE, and John C.S. Lui, Fellow, IEEE Abstract P2P-Video-on-Demand (P2P-VoD)
More informationPerformance and Scalability of Networks, Systems, and Services
Performance and Scalability of Networks, Systems, and Services Niklas Carlsson Linkoping University, Sweden Student presentation @LiU, Sweden, Oct. 10, 2012 Primary collaborators: Derek Eager (University
More informationServing Niche Video-on-Demand Content in a Managed P2P Environment
1 Serving Niche Video-on-Demand Content in a Managed P2P Environment Eli Brosh 1, Chitra Agastya 2, John Morales 2, Vishal Misra 1, Dan Rubenstein 1 affaddr Department of Computer Science, Columbia University
More informationStochastic Analysis and File Availability Enhancement for BT-like File Sharing Systems
Stochastic Analysis and File Availability Enhancement for BT-like File Sharing Systems Fan Bin Dah-Ming Chiu John C.S. Lui Abstract In this paper, we present the mathematical analysis of two important
More informationarxiv: v3 [cs.ni] 3 May 2017
Modeling Request Patterns in VoD Services with Recommendation Systems Samarth Gupta and Sharayu Moharir arxiv:1609.02391v3 [cs.ni] 3 May 2017 Department of Electrical Engineering, Indian Institute of Technology
More informationLoopback: Exploiting Collaborative Caches for Large-Scale Streaming
Loopback: Exploiting Collaborative Caches for Large-Scale Streaming Ewa Kusmierek Yingfei Dong David Du Poznan Supercomputing and Dept. of Electrical Engineering Dept. of Computer Science Networking Center
More informationHeuristic Algorithms for the Fixed-Charge Multiple Knapsack Problem
The 7th International Symposium on Operations Research and Its Applications (ISORA 08) Lijiang, China, October 31 Novemver 3, 2008 Copyright 2008 ORSC & APORC, pp. 207 218 Heuristic Algorithms for the
More informationEncouraging bandwidth efficiency for peer-to-peer applications
Encouraging bandwidth efficiency for peer-to-peer applications Henning Schulzrinne Dept. of Computer Science Columbia University New York, NY P2Pi Workshop Overview Video bandwidth consumption Cost of
More informationOptimized Strategies for Real-Time Multimedia Communications from Mobile Devices
Optimized Strategies for Real-Time Multimedia Communications from Mobile Devices Enrico Masala Dept. of Control and Computer Engineering, Politecnico di Torino, Torino, Italy ( Part of this work has been
More informationXXXIV SIMPÓSIO BRASILEIRO DE PESQUISA OPERACIONAL 8 a 11 de novembro de 2002, Rio de Janeiro/RJ
RELIABILITY MAXIMIZATION FOR NETWORKS WITH PATH-LENGTH CONSTRAINTS Pablo Burgos pabbur@hotmail.com Instituto de Computación, Facultad de Ingeniería, Universidad de la República J. Herrera y Reissig 565,
More informationAdaptive Server Allocation for Peer-assisted VoD
Adaptive Server Allocation for Peer-assisted VoD Konstantin Pussep, Osama Abboud, Florian Gerlach, Ralf Steinmetz, Thorsten Strufe Konstantin Pussep Konstantin.Pussep@KOM.tu-darmstadt.de Tel.+49 6151 165188
More informationBUILDING LARGE VOD LIBRARIES WITH NEXT GENERATION ON DEMAND ARCHITECTURE. Weidong Mao Comcast Fellow Office of the CTO Comcast Cable
BUILDING LARGE VOD LIBRARIES WITH NEXT GENERATION ON DEMAND ARCHITECTURE Weidong Mao Comcast Fellow Office of the CTO Comcast Cable Abstract The paper presents an integrated Video On Demand (VOD) content
More informationPerformance and cost effectiveness of caching in mobile access networks
Performance and cost effectiveness of caching in mobile access networks Jim Roberts (IRT-SystemX) joint work with Salah Eddine Elayoubi (Orange Labs) ICN 2015 October 2015 The memory-bandwidth tradeoff
More informationHSM: A Hybrid Streaming Mechanism for Delay-tolerant Multimedia Applications Annanda Th. Rath 1 ), Saraswathi Krithivasan 2 ), Sridhar Iyer 3 )
HSM: A Hybrid Streaming Mechanism for Delay-tolerant Multimedia Applications Annanda Th. Rath 1 ), Saraswathi Krithivasan 2 ), Sridhar Iyer 3 ) Abstract Traditionally, Content Delivery Networks (CDNs)
More informationA Randomized Algorithm for Minimizing User Disturbance Due to Changes in Cellular Technology
A Randomized Algorithm for Minimizing User Disturbance Due to Changes in Cellular Technology Carlos A. S. OLIVEIRA CAO Lab, Dept. of ISE, University of Florida Gainesville, FL 32611, USA David PAOLINI
More informationIncentive-Compatible Caching and Inter-Domain Traffic Engineering in CCN
Incentive-Compatible Caching and Inter-Domain Traffic Engineering in CCN Xun Shao, Hitoshi Asaeda 2016-05-19 Na9onal Ins9tute of Informa9on and Communica9ons Technology (NICT) 1 Outline Caching and inter-domain
More informationA game-theoretic framework for ISPs interactions in the context of Economic Traffic Management
Euro-NF International Workshop on Traffic and Congestion Control for the Future Internet Volos, Greece, April 1 st, 2011 A game-theoretic framework for ISPs interactions in the context of Economic Traffic
More informationExploring the Optimal Replication Strategy in P2P-VoD Systems: Characterization and Evaluation
This paper was presented as part of the main technical program at IEEE INFOCOM 211 Exploring the Optimal Replication Strategy in P2P-VoD Systems: Characterization and Evaluation Weijie Wu John C.S. Lui
More informationModeling, Analysis and Improvement for BitTorrent-Like File Sharing Networks
Modeling, Analysis and Improvement for BitTorrent-Like File Sharing etworks Ye Tian, Di Wu, and Kam Wing g Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin,.T.,
More informationOn Fairness, Optimal Download Performance and Proportional Replication in Peer-to-Peer Networks
On Fairness, Optimal Download Performance and Proportional Replication in Peer-to-Peer Networks Saurabh Tewari, Leonard Kleinrock Computer Science Department, University of California at Los Angeles, 4403
More informationOptimizing Random Walk Search Algorithms in P2P Networks
Optimizing Random Walk Search Algorithms in P2P Networks Nabhendra Bisnik Rensselaer Polytechnic Institute Troy, New York bisnin@rpi.edu Alhussein A. Abouzeid Rensselaer Polytechnic Institute Troy, New
More informationDDSS: Dynamic Dedicated Servers Scheduling for Multi Priority Level Classes in Cloud Computing
DDSS: Dynamic Dedicated Servers Scheduling for Multi Priority Level Classes in Cloud Computing Husnu Saner Narman Md. Shohrab Hossain Mohammed Atiquzzaman School of Computer Science University of Oklahoma,
More informationThe Scalability of Swarming Peer-to-Peer Content Delivery
The Scalability of Swarming Peer-to-Peer Content Delivery Daniel Zappala Brigham Young University zappala@cs.byu.edu with Daniel Stutzbach Reza Rejaie University of Oregon Page 1 Motivation Small web sites
More informationOn Fairness, Optimal Download Performance and Proportional Replication in Peer-to-Peer Networks
On Fairness, Optimal Download Performance and Proportional Replication in Peer-to-Peer Networks Saurabh Tewari and Leonard Kleinrock Computer Science Department, University of California at Los Angeles,
More informationDelft University of Technology Parallel and Distributed Systems Report Series. Bandwidth Allocation in BitTorrent-like VoD Systems under Flashcrowds
Delft University of Technology Parallel and Distributed Systems Report Series Bandwidth Allocation in BitTorrent-like VoD Systems under Flashcrowds Lucia D Acunto, Tamás Vinkó, Henk Sips ldacunto@tudelftnl
More informationStochastic Approximation and Transaction-Level Model for IP Network Design
Stochastic Approximation and Transaction-Level Model for IP Network Design Linhai He and Jean Walrand Department of Electrical Engineering and Computer Sciences University of California at Berkeley Berkeley,
More informationProviding VCR in a Distributed Client Collaborative Multicast Video Delivery Scheme
Providing VCR in a Distributed Client Collaborative Multicast Video Delivery Scheme X.Y. Yang 1, P. Hernández 1, F. Cores 2 A. Ripoll 1, R. Suppi 1, and E. Luque 1 1 Computer Science Department, ETSE,
More informationScalability of the BitTorrent P2P Application
Scalability of the BitTorrent P2P Application Kolja Eger, Ulrich Killat Hamburg University of Technology 5.Würzburger Workshop 8.-9. July 2005 Overview File dissemination in peer-to-peer (p2p) networks
More informationAnalysis of Peer-Assisted Video-on-Demand Systems with Scalable Video Streams
Analysis of Peer-Assisted Video-on-Demand Systems with Scalable Video Streams Kianoosh Mokhtarian School of Computing Science Simon Fraser University Surrey, BC, Canada Mohamed Hefeeda School of Computing
More informationA novel caching mechanism for peer-to-peer based media-on-demand streaming
Available online at www.sciencedirect.com Journal of Systems Architecture 54 (8) 55 69 www.elsevier.com/locate/sysarc A novel caching mechanism for peer-to-peer based media-on-demand streaming Ye Tian
More informationThe production of peer-to-peer video-streaming networks
The production of peer-to-peer video-streaming networks Dafu Lou Yongyi Mao Tet H. Yeap SITE, University of Ottawa, Canada SIGCOMM 07 P2P-TV, August 31, 2007, Kyoto, Japan. Outline Problem 1 Problem Dynamics
More informationDynamic Grouping Strategy in Cloud Computing
IEEE CGC 2012, November 1-3, Xiangtan, Hunan, China Dynamic Grouping Strategy in Cloud Computing Presenter : Qin Liu a Joint work with Yuhong Guo b, Jie Wu b, and Guojun Wang a a Central South University,
More informationPRIMAL-DUAL INTERIOR POINT METHOD FOR LINEAR PROGRAMMING. 1. Introduction
PRIMAL-DUAL INTERIOR POINT METHOD FOR LINEAR PROGRAMMING KELLER VANDEBOGERT AND CHARLES LANNING 1. Introduction Interior point methods are, put simply, a technique of optimization where, given a problem
More informationModeling and Analysis of Random Walk Search Algorithms in P2P Networks
Modeling and Analysis of Random Walk Search Algorithms in P2P Networks Nabhendra Bisnik and Alhussein Abouzeid Electrical, Computer and Systems Engineering Department Rensselaer Polytechnic Institute Troy,
More informationApplication-Oriented Multimedia Streaming over Wireless Multihop Networks
Application-Oriented Multimedia Streaming over Wireless Multihop Networks Luan, Hao (Tom) BBCR Lab, ECE Department University of Waterloo May 11, 2009 1 / 21 Multimedia Streaming Display of audio-visual
More informationQueuing Systems. 1 Lecturer: Hawraa Sh. Modeling & Simulation- Lecture -4-21/10/2012
Queuing Systems Queuing theory establishes a powerful tool in modeling and performance analysis of many complex systems, such as computer networks, telecommunication systems, call centers, manufacturing
More informationMultimedia Streaming. Mike Zink
Multimedia Streaming Mike Zink Technical Challenges Servers (and proxy caches) storage continuous media streams, e.g.: 4000 movies * 90 minutes * 10 Mbps (DVD) = 27.0 TB 15 Mbps = 40.5 TB 36 Mbps (BluRay)=
More informationImproving VoD System Efficiency with Multicast and Caching
Improving VoD System Efficiency with Multicast and Caching Jack Yiu-bun Lee Department of Information Engineering The Chinese University of Hong Kong Contents 1. Introduction 2. Previous Works 3. UVoD
More informationApproximability Results for the p-center Problem
Approximability Results for the p-center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Prof. Timothy Chan University of Waterloo, Spring 2004 The p-center
More informationP2P Applications. Reti di Elaboratori Corso di Laurea in Informatica Università degli Studi di Roma La Sapienza Canale A-L Prof.ssa Chiara Petrioli
P2P Applications Reti di Elaboratori Corso di Laurea in Informatica Università degli Studi di Roma La Sapienza Canale A-L Prof.ssa Chiara Petrioli Server-based Network Peer-to-peer networks A type of network
More informationBoosting Market Liquidity of Peer-to-Peer Systems Through Cyclic Trading
Boosting Market Liquidity of Peer-to-Peer Systems Through Cyclic Trading Raphael Eidenbenz Thomas Locher Stefan Schmid Raphael+Roger: ETH Zurich DCG Thomas: ABB Research Roger Wattenhofer T-Labs Stefan:
More informationStatistical Matching using Fractional Imputation
Statistical Matching using Fractional Imputation Jae-Kwang Kim 1 Iowa State University 1 Joint work with Emily Berg and Taesung Park 1 Introduction 2 Classical Approaches 3 Proposed method 4 Application:
More informationPerformance Improvements of Peer-to-Peer File Sharing
0 Performance Improvements of Peer-to-Peer File Sharing Dongyu Qiu Concordia University Canada 1. Introduction In recent years, Peer-to-Peer (P2P) applications, in which peers serve as both clients and
More informationSingle Video Performance Analysis for Video-on-Demand Systems
Single Video Performance Analysis for Video-on-Demand Systems James Y. Yang Department of ECE Coordinated Science Laboratory University of Illinois at Urbana-Champaign 138 W Main Street Urbana, IL 6181
More informationPeer-to-Peer Streaming Systems. Behzad Akbari
Peer-to-Peer Streaming Systems Behzad Akbari 1 Outline Introduction Scaleable Streaming Approaches Application Layer Multicast Content Distribution Networks Peer-to-Peer Streaming Metrics Current Issues
More informationAn Optimal Overlay Topology for Routing Peer-to-Peer Searches
An Optimal Overlay Topology for Routing Peer-to-Peer Searches Brian F. Cooper Center for Experimental Research in Computer Systems, College of Computing, Georgia Institute of Technology cooperb@cc.gatech.edu
More informationA Distributed Algorithm for the Replica Placement Problem
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS A Distributed Algorithm for the Replica Placement Problem Sharrukh Zaman, Student Member, IEEE, and Daniel Grosu, Senior Member, IEEE Abstract Caching
More informationThe Design Trade-offs of BitTorrent-like File Sharing Protocols
The Design Trade-offs of BitTorrent-like File Sharing Protocols Bin Fan John C.S. Lui Dah-Ming Chiu Abstract The BitTorrent BT file sharing protocol is very popular due to its scalability property and
More informationJoint-Family: Enabling Adaptive Bitrate Streaming in Peer-to-Peer Video-on-Demand
Joint-Family: Enabling Adaptive Bitrate Streaming in Peer-to-Peer Video-on-Demand Kyung-Wook Hwang, Vijay Gopalakrishnan, Rittwik Jana, Seungjoon Lee, Vishal Misra, K.K. Ramakrishnan, Dan Rubenstein Columbia
More informationarxiv: v2 [cs.dm] 3 Dec 2014
The Student/Project Allocation problem with group projects Aswhin Arulselvan, Ágnes Cseh, and Jannik Matuschke arxiv:4.035v [cs.dm] 3 Dec 04 Department of Management Science, University of Strathclyde,
More informationThroughput prediction in wireless networks using statistical learning
Throughput prediction in wireless networks using statistical learning Claudina Rattaro, Pablo Belzarena To cite this version: Claudina Rattaro, Pablo Belzarena. Throughput prediction in wireless networks
More informationLecture 17: Peer-to-Peer System and BitTorrent
CSCI-351 Data communication and Networks Lecture 17: Peer-to-Peer System and BitTorrent (I swear I only use it for Linux ISOs) The slide is built with the help of Prof. Alan Mislove, Christo Wilson, and
More informationFacial Recognition Using Neural Networks over GPGPU
Facial Recognition Using Neural Networks over GPGPU V Latin American Symposium on High Performance Computing Juan Pablo Balarini, Martín Rodríguez and Sergio Nesmachnow Centro de Cálculo, Facultad de Ingeniería
More informationImproving Scalability of VoD Systems by Optimal Exploitation of Storage and Multicast
1 Improving Scalability of VoD Systems by Optimal Exploitation of Storage and Multicast Chamil Jayasundara, Moshe Zukerman, Thas A. Nirmalathas, Elaine Wong, and Chathurika Ranaweera Abstract Today, video-on-demand
More informationDemand-Aware Content Distribution
Demand-Aware Content Distribution Srinivas Shakkottai Texas A&M University Hybrid content distribution High level idea: Use P2P dissemination to assist traditional clientserver methods, e.g., content delivery
More informationPeer-Assisted Distribution of User Generated Content
Peer-Assisted Distribution of User Generated Content Zhengye Liu, Yuan Ding, Yong Liu, Keith Ross Computer Science & Engineering, Polytechnic Institute of New York University Electrical & Computer Engineering,
More informationDo incentives build robustness in BitTorrent?
Do incentives build robustness in BitTorrent? ronghui.gu@yale.edu Agenda 2 Introduction BitTorrent Overview Modeling Altruism in BitTorrent Building BitTyrant Evaluation Conclusion Introduction 3 MAIN
More informationCapacity Management of Seed Servers in Peer-to-Peer Streaming Systems with Scalable Video Streams
1 Capacity Management of Seed Servers in Peer-to-Peer Streaming Systems with Scalable Video Streams Kianoosh Mokhtarian and Mohamed Hefeeda, Senior Member, IEEE Abstract To improve rendered video quality
More informationChapter 5. Minimization of Average Completion Time and Waiting Time in Cloud Computing Environment
Chapter 5 Minimization of Average Completion Time and Waiting Time in Cloud Computing Cloud computing is the use of the Internet for the tasks the users performing on their computer. Cloud computing, also
More informationObject replication strategies in content distribution networks
Computer Communications 5 00) 376±383 www.elsevier.com/locate/comcom Object replication strategies in content distribution networks Jussi Kangasharju a, *, James Roberts b, Keith W. Ross a a Institut EureÂcom,
More informationMicrosoft RemoteFX for Remote Desktop Virtualization Host Capacity Planning Guide for Windows Server 2008 R2 Service Pack 1
Microsoft RemoteFX for Remote Desktop Virtualization Host Capacity Planning Guide for Windows Server 2008 R2 Service Pack 1 Microsoft Corporation Published: March 2011 Abstract Microsoft RemoteFX delivers
More informationDetermining Optimal Update Period for Minimizing Inconsistency in Multi-server Distributed Virtual Environments
Determining Optimal Update Period for Minimizing Inconsistency in Multi-server Distributed Virtual Environments Li Yusen, Wentong Cai Presented by Stephen John Turner PDCC, SCE Nanyang Technological University,
More informationA Genetic Algorithm Framework
Fast, good, cheap. Pick any two. The Project Triangle 3 A Genetic Algorithm Framework In this chapter, we develop a genetic algorithm based framework to address the problem of designing optimal networks
More informationEffective Utilization of User Resources in PA-VoD Systems with Channel Heterogeneity
1 Effective Utilization of User Resources in PA-VoD Systems with Channel Heterogeneity Le Chang, Jianping Pan, Senior Member IEEE, and Min Xing Abstract Nowadays, peer-assisted video on-demand (PA-VoD)
More informationLoad Sharing in Peer-to-Peer Networks using Dynamic Replication
Load Sharing in Peer-to-Peer Networks using Dynamic Replication S Rajasekhar, B Rong, K Y Lai, I Khalil and Z Tari School of Computer Science and Information Technology RMIT University, Melbourne 3, Australia
More informationTCPeer: Rate Control in P2P over IP Networks
TCPeer: Rate Control in P2P over IP Networks Kolja Eger and Ulrich Killat Institute of Communication Networks Hamburg University of Technology (TUHH) 21071 Hamburg, Germany {eger, killat}@tu-harburg.de
More informationarxiv: v2 [cs.dc] 18 Dec 2016
arxiv:1612.04519v2 [cs.dc] 18 Dec 2016 Data allocation on disks with solution reconfiguration (problems, heuristics) Mark Sh. Levin The paper addresses problem of data allocation in two-layer computer
More informationApplication Layer Multicast Algorithm
Application Layer Multicast Algorithm Sergio Machado Universitat Politècnica de Catalunya Castelldefels Javier Ozón Universitat Politècnica de Catalunya Castelldefels Abstract This paper presents a multicast
More informationDistributed bandwidth-efficient packet scheduling for live streaming with network coding
Distributed bandwidth-efficient packet scheduling for live streaming with network coding Huang, S; Izquierdo, E; Hao, P The final publication is available at http://dl.acm.org/citation.cfm?id=2806395 For
More informationLecture: Simulation. of Manufacturing Systems. Sivakumar AI. Simulation. SMA6304 M2 ---Factory Planning and scheduling. Simulation - A Predictive Tool
SMA6304 M2 ---Factory Planning and scheduling Lecture Discrete Event of Manufacturing Systems Simulation Sivakumar AI Lecture: 12 copyright 2002 Sivakumar 1 Simulation Simulation - A Predictive Tool Next
More informationCOOCHING: Cooperative Prefetching Strategy for P2P Video-on-Demand System
COOCHING: Cooperative Prefetching Strategy for P2P Video-on-Demand System Ubaid Abbasi and Toufik Ahmed CNRS abri ab. University of Bordeaux 1 351 Cours de la ibération, Talence Cedex 33405 France {abbasi,
More informationThe Cross-Entropy Method
The Cross-Entropy Method Guy Weichenberg 7 September 2003 Introduction This report is a summary of the theory underlying the Cross-Entropy (CE) method, as discussed in the tutorial by de Boer, Kroese,
More informationPerformance models for master/slave parallel programs
Performance models for master/slave parallel programs PASM 2004 Lucas Baldo Leonardo Brenner Luiz G. Fernandes Paulo Fernandes Afonso Sales {lbaldo, lbrenner, gustavo, paulof, asales}@inf.pucrs.br. PUCRS
More informationConditional Random Fields - A probabilistic graphical model. Yen-Chin Lee 指導老師 : 鮑興國
Conditional Random Fields - A probabilistic graphical model Yen-Chin Lee 指導老師 : 鮑興國 Outline Labeling sequence data problem Introduction conditional random field (CRF) Different views on building a conditional
More informationAlgorithms for Storage Allocation Based on Client Preferences
Algorithms for Storage Allocation Based on Client Preferences Tami Tamir Benny Vaksendiser Abstract We consider a packing problem arising in storage management of Video on Demand (VoD) systems. The system
More informationDoctoral Written Exam in Networking, Fall 2009
Doctoral Written Exam in Networking, Fall 2009 November 9, 2009 Answer all parts of all questions. There are four multi-part questions, each of equal weight. Turn in your answers by Thursday, November
More informationUtility Maximizing Thread Assignment and Resource Allocation
Utility Maximizing Thread Assignment and Resource Allocation Pan Lai, Rui Fan, Wei Zhang, Fang Liu School of Computer Engineering Nanyang Technological University, Singapore {plai, fanrui}@ntu.edu.sg,
More informationParallel Implementation of a Random Search Procedure: An Experimental Study
Parallel Implementation of a Random Search Procedure: An Experimental Study NIKOLAI K. KRIVULIN Faculty of Mathematics and Mechanics St. Petersburg State University 28 University Ave., St. Petersburg,
More informationIntroduction to Machine Learning
Introduction to Machine Learning Maximum Margin Methods Varun Chandola Computer Science & Engineering State University of New York at Buffalo Buffalo, NY, USA chandola@buffalo.edu Chandola@UB CSE 474/574
More informationIt s Not the Cost, It s the Quality! Ion Stoica Conviva Networks and UC Berkeley
It s Not the Cost, It s the Quality! Ion Stoica Conviva Networks and UC Berkeley 1 A Brief History! Fall, 2006: Started Conviva with Hui Zhang (CMU)! Initial goal: use p2p technologies to reduce distribution
More informationModel Parameter Estimation
Model Parameter Estimation Shan He School for Computational Science University of Birmingham Module 06-23836: Computational Modelling with MATLAB Outline Outline of Topics Concepts about model parameter
More informationCongestion Control. Andreas Pitsillides University of Cyprus. Congestion control problem
Congestion Control Andreas Pitsillides 1 Congestion control problem growing demand of computer usage requires: efficient ways of managing network traffic to avoid or limit congestion in cases where increases
More informationNSFA: Nested Scale-Free Architecture for Scalable Publish/Subscribe over P2P Networks
NSFA: Nested Scale-Free Architecture for Scalable Publish/Subscribe over P2P Networks Huanyang Zheng and Jie Wu Dept. of Computer and Info. Sciences Temple University Road Map Introduction Nested Scale-Free
More informationCHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS
185 CHAPTER 8 CONCLUSION AND FUTURE ENHANCEMENTS Table of Contents Chapter - 8.CONCLUSION AND FUTURE ENHANCEMENTS S. No. Name of the Sub-Title Page No. 8.1 Conclusion 186 8.2 Future Enhancements 188 186
More informationCSC630/CSC730 Parallel & Distributed Computing
CSC630/CSC730 Parallel & Distributed Computing Analytical Modeling of Parallel Programs Chapter 5 1 Contents Sources of Parallel Overhead Performance Metrics Granularity and Data Mapping Scalability 2
More informationBuffered Count-Min Sketch on SSD: Theory and Experiments
Buffered Count-Min Sketch on SSD: Theory and Experiments Mayank Goswami, Dzejla Medjedovic, Emina Mekic, and Prashant Pandey ESA 2018, Helsinki, Finland The heavy hitters problem (HH(k)) Given stream of
More informationMathematics for chemical engineers
Mathematics for chemical engineers Drahoslava Janovská Department of mathematics Winter semester 2013-2014 Numerical solution of ordinary differential equations Initial value problem Outline 1 Introduction
More informationPEER-TO-PEER (P2P)applications have shown their popularity
954 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL 9, NO 7, JULY 2008 Free-Riding on BitTorrent-Like Peer-to-Peer File Sharing Systems: Modeling Analysis and Improvement Minglu Li, Jiadi Yu,
More informationHybrid ant colony optimization algorithm for two echelon vehicle routing problem
Available online at www.sciencedirect.com Procedia Engineering 15 (2011) 3361 3365 Advanced in Control Engineering and Information Science Hybrid ant colony optimization algorithm for two echelon vehicle
More informationUnderstanding the impact of VCR operations in P2P VoD systems
Understanding the impact of VCR operations in P2P VoD systems Xiaoyuan Yang, Pablo Rodriguez Telefonica Research {yxiao,pablorr}@tid.es Minas Gjoka, Athina Markopoulou University of California, Irvine
More informationA queueing network model to study Proxy Cache Servers
Proceedings of the 7 th International Conference on Applied Informatics Eger, Hungary, January 28 31, 2007. Vol. 1. pp. 203 210. A queueing network model to study Proxy Cache Servers Tamás Bérczes, János
More informationMath 241, Final Exam. 12/11/12.
Math, Final Exam. //. No notes, calculator, or text. There are points total. Partial credit may be given. ircle or otherwise clearly identify your final answer. Name:. (5 points): Equation of a line. Find
More informationData Offloading in Mobile Cloud Computing: A Markov Decision Process Approach
Data Offloading in Mobile Cloud Computing: A Markov Decision Process Approach Dongqing Liu University of Montreal & University of Technology of Troyes dongqing.liu@utt.fr September 13, 2018 Dongqing Liu
More informationNon-exhaustive, Overlapping k-means
Non-exhaustive, Overlapping k-means J. J. Whang, I. S. Dhilon, and D. F. Gleich Teresa Lebair University of Maryland, Baltimore County October 29th, 2015 Teresa Lebair UMBC 1/38 Outline Introduction NEO-K-Means
More information