Efficient Content Sharing Taking Account of Updating Replicas in Hybrid Peer-to-Peer Networks Tatsuru Kato, Shinji Sugawara, Yutaka Ishibashi Nagoya Institute.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Peer-to-Peer and Social Networks An overview of Gnutella.
Speaker: Li-Wei Wu Advisor: Dr. Kai-Wei Ke 1.  Introduction  Coolstreaming  Proposed system  Simulation  Conclusion  Reference 2.
Playback delay in p2p streaming systems with random packet forwarding Viktoria Fodor and Ilias Chatzidrossos Laboratory for Communication Networks School.
Technion –Israel Institute of Technology Computer Networks Laboratory A Comparison of Peer-to-Peer systems by Gomon Dmitri and Kritsmer Ilya under Roi.
1 An Overview of Gnutella. 2 History The Gnutella network is a fully distributed alternative to the centralized Napster. Initial popularity of the network.
Search and Replication in Unstructured Peer-to-Peer Networks Pei Cao, Christine Lv., Edith Cohen, Kai Li and Scott Shenker ICS 2002.
Routing Indices For Peer-to-Peer Systems Arturo Crespo, Hector Garcia-Molina Stanford ICDCS 2002.
Small-world Overlay P2P Network
Effective Quorum Construction for Consistency Management in Mobile Ad Hoc Networks Takahiro HARA Osaka University, Japan.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.
Placement of Continuous Media in Wireless Peer-to-Peer Network Shahramram Ghandeharizadeh, Bhaskar Krishnamachari, and Shanshan Song IEEE Transactions.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
Analysis of Web Caching Architectures: Hierarchical and Distributed Caching Pablo Rodriguez, Christian Spanner, and Ernst W. Biersack IEEE/ACM TRANSACTIONS.
Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.
Performance Evaluation of Peer-to-Peer Video Streaming Systems Wilson, W.F. Poon The Chinese University of Hong Kong.
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
Update Log Dissemination in Mobile Ad Hoc Networks Hideki HAYASHI Hitachi, Ltd., Central Research Laboratory (Grad. School of Info. Science and Tech.,
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang, and Ya-Qin Zhang IEEE TRANSACTIONS ON MULTIMEDIA,
On-Demand Media Streaming Over the Internet Mohamed M. Hefeeda, Bharat K. Bhargava Presented by Sam Distributed Computing Systems, FTDCS Proceedings.
UNIVERSITY OF JYVÄSKYLÄ Topology Management in Unstructured P2P Networks Distributed Systems Research Seminar on Annemari Auvinen, Research Student.
CS401 presentation1 Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility Takahiro Hara Presented by Mingsheng Peng (Proc. IEEE.
This is a discrete distribution. Poisson is French for fish… It was named due to one of its uses. For example, if a fish tank had 260L of water and 13.
1 Napster & Gnutella An Overview. 2 About Napster Distributed application allowing users to search and exchange MP3 files. Written by Shawn Fanning in.
1 Performance Evaluation of Computer Networks: Part II Objectives r Simulation Modeling r Classification of Simulation Modeling r Discrete-Event Simulation.
Network Aware Resource Allocation in Distributed Clouds.
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
Travis Portz.  Large, sudden increases in the traffic to a website  Low-traffic website being linked to by a popular news feed  “Slashdot Effect” 
CORE 2: Information systems and Databases CENTRALISED AND DISTRIBUTED DATABASES.
UbiStore: Ubiquitous and Opportunistic Backup Architecture. Feiselia Tan, Sebastien Ardon, Max Ott Presented by: Zainab Aljazzaf.
Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.
A Prediction-based Fair Replication Algorithm in Structured P2P Systems Xianshu Zhu, Dafang Zhang, Wenjia Li, Kun Huang Presented by: Xianshu Zhu College.
De-Nian Young Ming-Syan Chen IEEE Transactions on Mobile Computing Slide content thanks in part to Yu-Hsun Chen, University of Taiwan.
Introduction Mobile commerce(M-Commerce) is developing trend due to successful experience of E-Commerce(EC) Most significant difference between M-Commerce.
Papers on Storage Systems 1) Purlieus: Locality-aware Resource Allocation for MapReduce in a Cloud, SC ) Making Cloud Intermediate Data Fault-Tolerant,
1 Distributed Energy-Efficient Scheduling for Data-Intensive Applications with Deadline Constraints on Data Grids Cong Liu and Xiao Qin Auburn University.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Understanding the Performance of Web Caching System with an Analysis Model and Simulation Xiaosong Hu Nur Zincir-Heywood Sep
Salah A. Aly,Moustafa Youssef, Hager S. Darwish,Mahmoud Zidan Distributed Flooding-based Storage Algorithms for Large-Scale Wireless Sensor Networks Communications,
Optimal Content Delivery with Network Coding Derek Leong, Tracey Ho California Institute of Technology Rebecca Cathey BAE Systems CISS 2009 March 19, 2009.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
A Peer-to-Peer Approach to Resource Discovery in Grid Environments (in HPDC’02, by U of Chicago) Gisik Kwon Nov. 18, 2002.
《 Hierarchical Caching Management for Software Defined Content Network based on Node Value 》 Reporter : Jing Liu , China Affiliation : University of Science.
1 ACTIVE FAULT TOLERANT SYSTEM for OPEN DISTRIBUTED COMPUTING (Autonomic and Trusted Computing 2006) Giray Kömürcü.
Distributed Database. Introduction A major motivation behind the development of database systems is the desire to integrate the operational data of an.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
Peer to Peer A Survey and comparison of peer-to-peer overlay network schemes And so on… Chulhyun Park
Efficient P2P Search by Exploiting Localities in Peer Community and Individual Peers A DISC’04 paper Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang.
K-Anycast Routing Schemes for Mobile Ad Hoc Networks 指導老師 : 黃鈴玲 教授 學生 : 李京釜.
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System Computer Science Department College of William and Mary Lei Guo, Songqing Chen, and Xiaodong.
A P2P-Based Architecture for Secure Software Delivery Using Volunteer Assistance Purvi Shah, Jehan-François Pâris, Jeffrey Morgan and John Schettino IEEE.
SocialTube: P2P-assisted Video Sharing in Online Social Networks
Efficient AOI-Cast for Peer-to-Peer Networked Virtual Environments.
1 Push-to-Peer Video-on-Demand System. 2 Abstract Content is proactively push to peers, and persistently stored before the actual peer-to-peer transfers.
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.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks Author: P. Kokkinos, K. Christodoulopoulos, A. Kretsis, and E. Varvarigos.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Antidio Viguria Ann Krueger A Nonblocking Quorum Consensus Protocol for Replicated Data Divyakant Agrawal and Arthur J. Bernstein Paper Presentation: Dependable.
An Improved Acquaintance Immunization Strategy for Complex Network.
Wonkwang Shin, Byoung-Yoon Min and Dong Ku Kim
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Chi Zhang, Yang Song and Yuguang Fang
Paraskevi Raftopoulou, Euripides G.M. Petrakis
Effective Replica Allocation
Peer-to-Peer Information Systems Week 6: Performance
Replica Placement Heuristics of Application-level Multicast
Presentation transcript:

Efficient Content Sharing Taking Account of Updating Replicas in Hybrid Peer-to-Peer Networks Tatsuru Kato, Shinji Sugawara, Yutaka Ishibashi Nagoya Institute of Technology Nagoya, Japan 2011 Annual IEEE CQR International Workshop May 10-12,2011, The Naples Beach Hotel & Golf Club

Background In date sharing using Peer-to-Peer (P2P) system Increase of storage load in each peer Possibility to access the obsolete information : Peer : Contents before the update Up- date Req- uest Problems : Contents after the update

Objective In data sharing using hybrid P2P networks, replicas’ relocation strategies to reduce consumed storage resources are proposed Content update is not considered Actually, the content update occurs on networks A control to keep a consistency with contents We propose a content sharing strategy that has a consistency control responding to content updates This study Previous study

Formulation of the problem (1/2) A P2P network topology that consists of many peers and their links is given Assumption A server for managing all the peers is prepared, and it is aware of what content item is stored in each peer on the network Content updating occurs only on peers having original content items, and each original content item exists on a single peer at most in the network

Formulation of the problem (2/2) We achieve a content sharing strategy that minimizes the weighted sum of the costs Network cost The load that accrues in the network when some replicas are downloaded, transferred, replicated, and updated information is propagated Storage cost Content loss cost The cost that accrues when a peer cannot get the requested content item because no peer possesses a replica of the con- tent item in the network The capacity to store a replica to be shared

Proposed method Content Request Procedure  Replication, or relocation of a replica are executed Content Update Procedure  Propagation of the latest replica is working Restrain storage cost by restricting unnece- ssary replication, and propagation of the latest replica

Proposed method Content Request Procedure Content Update Procedure  Replication, or relocation of a replica are executed  Propagation of the latest replica is working Restrain storage cost by restricting unnece- ssary replication, and propagation of the latest replica

Each replica has a distance range within a hop thre- shold( H th ) from the peer in which the replica is stored. This range is called the “referable range’’ referable range Example : H th = 2 Referable range : peer : replica

When the requesting peer does not exist within the referable range, a replica of the content is replicated on the requesting peer from the peer possessing the content Example : H th = 2 Referable range : peer : replica : requesting peer Replication

Example : H th = 2 Referable range : peer : replica : requesting peer RelocationReference When the requesting peer exists within the referable range, content replication is not executed and just referred the content from the requesting peer

Relocation of the replica (1/5) (1)Select one of the peers inside the referable range, and suppose that the referred replica is relocated. On all peers inside the referable range, calculate C R. C R is an expected value of the cost to access the replica from the other peers. Calculate sum of C R : peer : replica : updating peer : requesting peer

Relocation of replica (2/5) (2) Change the peer to be supposed that the referred replica is relocated, calculate sum of C R on all peers inside the referable range : peer : replica : updating peer : requesting peer Calculate sum of C R

Relocation of replica (3/5) Calculate C U : peer : replica : updating peer : requesting peer (3) On all peers inside the referable range, calculate C U. C U is an expected value of the cost to update the replica.

Relocation of replica (4/5) : peer : replica : updating peer : requesting peer (4) Change the peer to be supposed that the referred replica is relocated, calculate sum of C U on all peers inside the referable range Calculate C U

Relocation of replica (5/5) (5) Calculate C = C R + W U ・ C U Relocate the replica to the peer which has the least C W U is a weight to adjust the importance of C R and C U The peer which has the least C Relocate the replica : peer : replica : updating peer : requesting peer

Proposed method Content Request Procedure Content Update Procedure Restrain storage cost by restricting replica- tion, and propagation of the latest replica  Replication, or relocation of a replica are executed  Propagation of the latest replica is working

Propagation of the replica (1/2) Occurrence of update The latest replica is sent only to the peers that hold the same content item’s obsolete replicas which have not referred for more than T 1 units of time : peer : replica : updating peer

Propagation of the replica (2/2) Propagation of the replica The latest replica is sent only to the peers that hold the same content item’s obsolete replicas which have not referred for more than T 1 units of time : peer : replica : updating peer

Evaluation method E : Total cost ENEN : Network cost (sum of the number of hops of data movement per total elapsed time) ESES : Storage cost (sum of the number of replicas in each unit time per total elapsed time) ELEL : Content loss cost (sum of the number of contents loss times per total elapsed time) Evaluate the methods by computer simulation W N, W S,W L : Weight (the relative importance of each of costs) E = W N ・ E N + W S ・ E S + W L ・ E L

Methods for comparison Requested content is regularly replicated on the requesting peer RCT Owner replication When the number of hops between the peer possessing the content and the requesting peer is larger than threshold H th, replicate the content on the requesting peer. Otherwise, the requesting peer only refers to the replica.

Simulation conditions Request of contents ・・・ Poisson distribution( λ req =0.5) Peers joining and dropping out ・・・ Poisson distribution ( λ mov =0.1) Network topologyBA model Initial number of peers 100 Total number of contents 30 Threshold H th 1~61~6 Threshold T Weight ( W N, W S, W L ) (2, 1, 5), (1, 2, 5) An example of BA model

Simulation result (1/2) I : 95 % confidence interval Total cost E Total cost E ( W N =2, W S =1, W L =5) Proposed( H th =1) RCT ( H th =1)Owner

Simulation result (2/2) Total cost E ( W N =1, W S =2, W L =5) RCT ( H th =1)Owner I : 95 % confidence interval Total cost E Proposed( H th =2)

Conclusions Proposed an efficient content replication method taking account of updating replicas for Hybrid P2P When the network cost is more expensive, the proposed method succeeded in reducing total cost as well as owner replication When the storage cost is more expensive, the proposed method reduced total cost more than owner replication and RCT

Future works Investigate effectiveness of the proposed method in much more various network environments Improve the proposed method for further efficiency of relocation of replicas

Formulation of the problem Each peer can possess shared content items that can be re- plicated and downloaded by other peers There are many different shared content items in the net- work, and each of them are replicated and held by some peers for redundancy Each peer (actually, a user on the peer) requests content from time to time, and this request preference is biased depending on the combination of each content item and the requesting peer Assumption

Each of the peers can drop off the network randomly once in a while and join in again with a certain probability All content items have the same size Storage capacity of each peer is not limited Assumption Formulation of the problem

1. Select a dropping out peer randomly 2. Select one of the neighboring peer of the dropping out peer randomly, change link of the others to the selected peer Dropping out peer Selected peer Drop out of a peer

BA (Barabasi-Albert) model topology scale-free network A peer is added to the network one at a time A peer is preferentially connected to the peer which has many neighbor peers

Zipf distribution Zipf distribution ( S =1 、 N =100) S : Zipf’s coefficient N: Total number of dates

Poisson distribution Unit of time k event probability P(k) Poisson distribution ( λ= 0.5 ) λ: Average frequency of occurrence of an event

Simulation result Network cost E N Threshold H th

Storage cost E S Simulation result Threshold H th I : 95 % confidence interval

Content loss cost E L Simulation result Threshold H th I : 95 % confidence interval

Simulation result (1/2) I : 95 % confidence interval Total cost E Total cost E ( W N =2, W S =1, W L =5)

Simulation result (2/2) Total cost E ( W N =1, W S =2, W L =5) I : 95 % confidence interval Total cost E