Will P2P Users Cooperate with ISPs? A Word-of-Mouth Communication Approach Piotr Wydrych (AGH University of Science and Technology, Poland); Piotr Cholda.

Slides:



Advertisements
Similar presentations
Hadi Goudarzi and Massoud Pedram
Advertisements

IE 429, Parisay, January 2003 Review of Probability and Statistics: Experiment outcome: constant, random variable Random variable: discrete, continuous.
Cameron Dale and Jiangchuan LiuA Measurement Study of Piece Population in BitTorrent Introduction BitTorrent Experiment Results Simulation Discussion A.
Session 8b, 5 th July 2012 Future Network & MobileSummit 2012 Copyright 2012 Mobile Multimedia Laboratory Realistic Media Streaming over BitTorrent George.
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
Natural Selection in Peer-to-Peer Streaming: From the Cathedral to the Bazaar Vivek Shrivastava, Suman Banerjee University of Wisconsin-Madison, USA ACM.
Load Balancing of Elastic Traffic in Heterogeneous Wireless Networks Abdulfetah Khalid, Samuli Aalto and Pasi Lassila
CIKM’2008 Presentation Oct. 27, 2008 Napa, California
Routing in WSNs through analogies with electrostatics December 2005 L. Tzevelekas I. Stavrakakis.
Modelling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks.
Analyzing and Improving BitTorrent Ashwin R. Bharambe ( Carnegie Mellon University ) Cormac Herley ( Microsoft Research, Redmond ) Venkat Padmanabhan (
Nur Aini Masruroh Queuing Theory. Outlines IntroductionBirth-death processSingle server modelMulti server model.
Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada ISP-Friendly Peer Matching without ISP Collaboration Mohamed Hefeeda (Joint.
P2P 2.0 and it’s impact on the Internet
Analyzing Multi-channel MAC Protocols for Underwater Sensor Networks Presenter: Zhong Zhou.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
Improving ISP Locality in BitTorrent Traffic via Biased Neighbor Selection Ruchir Bindal, Pei Cao, William Chan Stanford University Jan Medved, George.
Service Differentiated Peer Selection An Incentive Mechanism for Peer-to-Peer Media Streaming Ahsan Habib, Member, IEEE, and John Chuang, Member, IEEE.
Can ISPs and P2P Users Cooperate for Improved Performance? Vinay Aggarwal, Anja Feldmann (German Telecom Laboratories) Christian Scheideler (TU, Munchen)
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
Perceptual Quality Assessment of P2P Assisted Streaming Video for Chunk-level Playback Controller Design Tom Z.J. Fu, CUHK W. T. Leung, CUHK P. Y. Lam,
Modeling and analysis of BitTorrent-like P2P network Fan Bin Oct,1 st,2004.
Bounds on the Performance of P2P Networks Using Tit-for-Tat Strategies Dimitri DeFigueiredo Balaji Venkatachalam S. Felix Wu.
Performance Evaluation of Peer-to-Peer Video Streaming Systems Wilson, W.F. Poon The Chinese University of Hong Kong.
1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.
Distributed-Dynamic Capacity Contracting: A congestion pricing framework for Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute,
Part III: Inference Topic 6 Sampling and Sampling Distributions
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
On Fairness, Optimizing Replica Selection in Data Grids Husni Hamad E. AL-Mistarihi and Chan Huah Yong IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,
Tradeoffs in CDN Designs for Throughput Oriented Traffic Minlan Yu University of Southern California 1 Joint work with Wenjie Jiang, Haoyuan Li, and Ion.
Can Internet Video-on-Demand Be Profitable? SIGCOMM 2007 Cheng Huang (Microsoft Research), Jin Li (Microsoft Research), Keith W. Ross (Polytechnic University)
COCONET: Co-Operative Cache driven Overlay NETwork for p2p VoD streaming Abhishek Bhattacharya, Zhenyu Yang & Deng Pan.
Introduction to Discrete Event Simulation Customer population Service system Served customers Waiting line Priority rule Service facilities Figure C.1.
NOBEL WP Szept Stockholm Game Theory in Inter-domain Routing LÓJA Krisztina - SZIGETI János - CINKLER Tibor BME TMIT Budapest,
P.1Service Control Technologies for Peer-to-peer Traffic in Next Generation Networks Part2: An Approach of Passive Peer based Caching to Mitigate P2P Inter-domain.
POWER CONTROL IN COGNITIVE RADIO SYSTEMS BASED ON SPECTRUM SENSING SIDE INFORMATION Karama Hamdi, Wei Zhang, and Khaled Ben Letaief The Hong Kong University.
Network Aware Resource Allocation in Distributed Clouds.
Traffic Modeling.
DELAYED CHAINING: A PRACTICAL P2P SOLUTION FOR VIDEO-ON-DEMAND Speaker : 童耀民 MA1G Authors: Paris, J.-F.Paris, J.-F. ; Amer, A. Computer.
1 Efficiency and Nash Equilibria in a Scrip System for P2P Networks Eric J. Friedman Joseph Y. Halpern Ian Kash.
An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.
P2P Traffic Localization by Alias Tracker for Tracker-based P2P applications (ATTP) draft-zhang-alto-attp-02 Yunfei Zhang China Mobile.
20 October 2006Workflow Optimization in Distributed Environments Dynamic Workflow Management Using Performance Data David W. Walker, Yan Huang, Omer F.
GridIS: an Incentive-based Grid Scheduling Lijuan Xiao, Yanmin Zhu, Lionel M. Ni, Zhiwei Xu 19th International Parallel and Distributed Processing Symposium.
Aditya Akella The Performance Benefits of Multihoming Aditya Akella CMU With Bruce Maggs, Srini Seshan, Anees Shaikh and Ramesh Sitaraman.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
MULTI-TORRENT: A PERFORMANCE STUDY Yan Yang, Alix L.H. Chow, Leana Golubchik Internet Multimedia Lab University of Southern California.
Aemen Lodhi (Georgia Tech) Amogh Dhamdhere (CAIDA)
ICOM 6115: Computer Systems Performance Measurement and Evaluation August 11, 2006.
Performance Analysis of Real Traffic Carried with Encrypted Cover Flows Nabil Schear David M. Nicol University of Illinois at Urbana-Champaign Department.
Downlink Scheduling With Economic Considerations to Future Wireless Networks Bader Al-Manthari, Nidal Nasser, and Hossam Hassanein IEEE Transactions on.
A Joint Channel and Queue-Aware Scheduling for IEEE Wireless Metropolitan Area Networks Mehri Mehrjoo, Xuemin Shen, Kshirassgar Naik WCNC 2007.
Impact of Incentives in BitTorrent By Jenny Liu and Seth Cooper.
6.1 Inference for a Single Proportion  Statistical confidence  Confidence intervals  How confidence intervals behave.
Copyright ©2013 Pearson Education, Inc. publishing as Prentice Hall 9-1 σ σ.
Federico Chiariotti Chiara Pielli Andrea Zanella Michele Zorzi QoE-aware Video Rate Adaptation algorithms in multi-user IEEE wireless networks 1.
Goricheva Ruslana. Statistical properties of the regenerative processes with networking applications.
Design and Analysis of Optimal Multi-Level Hierarchical Mobile IPv6 Networks Amrinder Singh Dept. of Computer Science Virginia Tech.
Cooperative Mobile Live Streaming Considering Neighbor Reception SPEAKER: BO-YU HUANG ADVISOR: DR. HO-TING WU 2015/10/15 1.
Analyzing and Improving BitTorrent Ashwin R. Bharambe ( Carnegie Mellon University ) Cormac Herley ( Microsoft Research, Redmond ) Venkat Padmanabhan (
Network and Systems Laboratory nslab.ee.ntu.edu.tw Yipeng Zhou, Dah Ming Chiu, and John C.S. Lui Information Engineering Department The Chinese University.
User Mobility Modeling and Characterization of Mobility Patterns Mahmood M. Zonoozi and Prem Dassanayake IEEE Journal on Selected Areas in Communications.
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks Author: P. Kokkinos, K. Christodoulopoulos, A. Kretsis, and E. Varvarigos.
ALTO: A Multi Dimensional Peer Selection Problem IETF 73 Saumitra Das
Optimization-based Cross-Layer Design in Networked Control Systems Jia Bai, Emeka P. Eyisi Yuan Xue and Xenofon D. Koutsoukos.
18 May 2006CCGrid2006 Dynamic Workflow Management Using Performance Data Lican Huang, David W. Walker, Yan Huang, and Omer F. Rana Cardiff School of Computer.
Further Topics on Random Variables: 1
Approximate Mean Value Analysis of a Database Grid Application
Presentation transcript:

Will P2P Users Cooperate with ISPs? A Word-of-Mouth Communication Approach Piotr Wydrych (AGH University of Science and Technology, Poland); Piotr Cholda (AGH University of Science and Technology, Poland) IEEE ICC Next-Generation Networking Symposium pp 范家賓 2013/6/18 1

Outline Abstract Introduction The model Simulation results Further Work Conclusion 2

Abstract The problem of application-level traffic optimization(ALTO) ◦ (a) The case that before the option to cooperate with ISP and optimize the service is enabled ◦ (b) The case in which all clients try to optimize the traffic. In this paper consider: ◦ User may not wish to cooperate with the ISP ◦ User does not perceive the optimization possibility to be valuable enough to cooperate with ISP Analytical model: Calculating the time-dependent value of the predicted popularity of the cooperate-to-optimize option 3

Introduction P2P ◦ ISPs gained massively broadband access ◦ Uncontrolled costly inter-domain flows Focused on proposing methods to decrease P2P flows that cross Autonomous Systems(AS) boundaries. Cooperate between users of P2P and ISPs 1. “ Can ISPs and P2P users cooperate for improved performance?”, V. Aggarwal, A. Feldmann, and C.Scheideler 2. “P4P: Provider portal for applications”, H. Xie, Y. R. Yang, A. Krishnamurthy ◦ Compare two case: with optimization service being either fully off or totally on. ◦ Assume: all users either willing to cooperate with their ISPs or not ALTO: application-layer traffic optimization 4

Knowledge about new Internet options ◦ Internet forums, blogs, chats …. ◦ Information shared among users is called the common knowledge ◦ Word-of-mouth marketing Choose between two opitons then providing different payoffs ◦ (a). Use the unmodified P2P application and encounter plausible traffic(and quality) suboptimalities ◦ (b). Cooperate with ISPs and optimize the traffic generated by the P2P application Develop a model to predict the level of the user-ISP cooperation. ◦ Ellison and Fudenberg, ”Word-of-mouth communication and social learning”Introduction 5

6 The model At moment t 0 the ALTO service is introduced and ISPs ask end-users to cooperate with them. Three group: (a). Always cooperating : cooperative users (probability: α) (b). Always non-cooperating : non-cooperative users ( probability: β ) (c). Cooperate if see cooperative users receive better payoffs than who do not cooperate: rational user (probability: 1- α- β ) Peer’s actions on a timeline Enter the overlay network at t ‚Probability x(t) decides to cooperate, 1-x(t) decides not to cooperate. x(t) depends on the N payoffs samples held in the common knowledge on previous state of network. ƒPublishes the information and payoff it received to the common knowledge forever. „Leaves the overlay network.

7 The model The generation of payoff is modeled by two queueing systems M t : G t : ∞ : The number of servers General relations Cooperating user arrive with the rate Non-cooperating user arrive with the rate The Poisson process arrival rate is modulated by the ALTO popularity The time needed to assess QoE may vary during the whole modeled period

8 The model General relations τ : the period of time from the users entering the system at t in to need to assess QoE The users which enter the system at t in publish their payoffs at t out with the rate The intensities of the process of arrival of the payoff samples to the common knowledge at t is characterized by The intensities of the arrival of the payoff samples perceived by a deciding user are given as T: time constant

9 The model :The probability of selecting a payoff sample generated by a cooperating user from the common knowledge The average properties of he random variables 1 ≦ k < N payoff samples where generated by cooperating users from the common knowledge The probability that a rational user would cooperate: ( binomial distribution B(N, )). The probability that a user will decide ( at moment t ) to cooperate

10 The model Metric for File-Sharing System Accesses the QoE and maps download times to payoffs We needs time τ to download a file, we assume that the payoff received is equal to – τ According to this metric Possible to calculate the probability density function(pdf) of random variables describing the payoff samples arriving to the common knowledge Payoff sample is generated at moment t : User finished downloading a file at t The probability that a payoff publishes at t and equal to – τ is equal to the probability that a user started downloading at t – τ and finished at t The pdf of these random variables The longer a user downloads a file, the lower is the payoff it receives.

11 Simulation results The topology used in the simulations Perform in the Erouption.S BitTorrent network simulator The ALTO service was deployed in all stub ASes. After 10 hours to warm-up, the overlay network is stable and the common knowledge contained a sufficient number of payoffs samples, the ALTO service was started. N samples were randomized from the common knowledge using the weighted sample. The weight of each payoff sample was equal to, T = one hour Both α and β were set to 5%

12 Simulation results The comparison of the model-based calculations and the simulation results

13 Simulation results Reaction to changes of parameter values The time constant T determines how fast ALTO popularity grows to its maximum and how fast the system converged to the stable state The stable-stae value of the ALTO popularity does not depend on the time constant T

14 Simulation results The larger the file, the bigger was the ratio of download times for cooperating and non-cooperating users. The larger the file, the more beneficial it was for users to cooperate and the higher was the stable-state value of the ALTO popularity

15 Simulation results The stable-state value of the ALTO popularity depends more on β than α

16 Further Work Not every user is aware of the possibility of optimization from t 0 α should be varied over time. Provides a new service to its clients, it starts an advertising campaign to get the clients interested in the service. A user not only at its start to make decision. makes a decision periodically

17Conclusion By using a word-of-mouth communication model to calculate the popularity, if the users can be really interested in the ALTO-related cooperation, Will P2P Users Cooperate with ISPs? The output is not only an the optimistic fact, but also finding some general rules of the thumb ( 1). The share of cooperating users will be quite high and not dependent on the time horizon. (2). The more a user exploits P2P system, the easier it is to convince such a client to the cooperation. (3). In a long-run the only users who will not cooperate are the ones that are generally unwilling to cooperate; the rational or positive user will be convinced by performance improvement at last.