GLive: The Gradient overlay as a market maker for mesh based P2P live streaming
|
|
|
- Merryl Wilkins
- 6 years ago
- Views:
Transcription
1 GLive: The Gradient overlay as a market maker for mesh based P2P live streaming Amir H. Payberah Jim Dowling Seif Haridi {amir, jdowling, seif}@sics.se 1
2 Introduction 2
3 Media Streaming Media streaming is a multimedia that is sent over a network and played as it is being received by end users. Users do not need to wait to download all the media. It could be Live Media Streaming Video on Demand (VoD) 3
4 Solutions for Media Streaming Client Server Peer to Peer Server Farm 4
5 Problem Description (1/4) Building a streaming overlay network, such that: Nodes with higher upload bandwidth are positioned closer to the media source. Nodes with similar upload bandwidth become neighbours. Reduces: Average number of hops Streaming disruptions Playback latency Similar upload bandwidth 5
6 Problem Description (1/4) Building a streaming overlay network, such that: Nodes with higher upload bandwidth are positioned closer to the media source. Nodes with similar upload bandwidth become neighbours. Reduces: Average number of hops Streaming disruptions Playback latency Similar upload bandwidth 6
7 Problem Description (2/4) Bounded download/upload connections. A parent child relation. Parent Download slot Upload slot Child 7
8 Problem Description (3/4) Problem: How to assign upload slots to download slots? Parent Download slot Upload slot Child 8
9 Problem Description (4/4) This can be modelled as an assignment problem. Centralized solution: Needs global knowledge. Possible for small system sizes. Distributed market based approach: Inspired by auction algorithms. Each node knows only a small number of nodes in the system (partial view). 9
10 GLive 10
11 Design Space What overlay topology is built for data dissemination? What algorithm is used for data dissemination? How to discover supplying nodes? 11
12 Design Space What overlay topology is built for data dissemination? Tree Multiple tree Mesh What algorithm is used for data dissemination? Push Pull Push Pull How to discover supplying nodes? Centralized DHT Gossip based... 12
13 Design Space What overlay topology is built for data dissemination? Tree Multiple tree Mesh What algorithm is used for data dissemination? Push Pull Push Pull How to discover supplying nodes? GLive Centralized DHT Gossip based... 13
14 Glive Design Space What overlay topology is built for data dissemination? What algorithm is used for data dissemination? How to discover supplying nodes? 14
15 Mesh Overlay Divide he main stream into a small blocks. Nodes are connected in a mesh network. Media Server
16 The Market Model Node Properties Currency: The total number of blocks uploaded to children during the last 10 seconds. Source Price: The price of a node that has an unused upload slot is zero, otherwise the node s price equals the lowest currency of its already connected children. Currency = 3 Price = 1 Cost = 3 Cost: The length of its path to the root via its shortest path. currency = 2 currency = 1 currency = 2 16
17 The Market Model Child Side Q: Price: 1 Cost: 4 M: Price: 5 Cost: 4 X N Q P M N: Price: 2 Cost: 6 X: Price: 3 Cost: 5 Currency: 3 Cost: 5 P 17
18 The Market Model Child Side Q: Price: 1 Cost: 4 M: Price: 5 Cost: 4 X N Q P M N: Price: 2 Cost: 6 X: Price: 3 Cost: 5 Currency: 3 Cost: 5 P 18
19 The Market Model Parent Side P Q Request Price: 1 Currency: 2 Currency: 3 Currency: 3 Currency: 1 19
20 The Market Model Parent Side Q P 20
21 Glive Design Space What overlay topology is built for data dissemination? What algorithm is used for data dissemination? How to discover supplying nodes? 21
22 Data Dissemination (1/2) Each parent node periodically sends its buffer map and its load to all its assigned children. A child node, pull the required blocks using the received information. 22
23 Data Dissemination (2/2) Sliding window In order set Rare set 23
24 Glive Design Space What overlay topology is built for data dissemination? What algorithm is used for data dissemination? How to discover supplying nodes? 24
25 Node Discovery (1/2) Naïve solution: nodes in partial views are selected randomly from all the nodes. Optimization: nodes use the Gradient overlay to construct and maintain their partial view of the system. Random view 25
26 The Gradient Overlay The Gradient overlay is a class of P2P overlays that arranges nodes using a local utility function at each node, such that nodes are ordered in descending utility values away from a core of the highest utility nodes. 26
27 Node Discovery (2/2) Rather than have nodes explore the whole system for better parents, the Gradient enables nodes to limit exploration to the set of nodes with asimilar number of upload slots. Random view Similar view Finger 27
28 Conclusion 28
29 Conclusion GLive P2P solution for live media streaming. Distributed market model Design space: Overlay topology: Mesh Data dissemination: Pull Discover supplying nodes: Gossip Gradient 29
30 Question? 30
31 Experiment Setup Using the Kompics as a simulator platform. King dataset is used to model the latencies between nodes. The streaming rate to 512 Kbps, and it is split into 8 stripes (in sepidar). The stream/stripe is divided into a sequence of 16 Kb blocks. Nodes start playing the media after buffering it for 15 seconds. The number of upload slots for the non root nodes is picked randomly from 1 to 10. bandwidths from 128 Kbps to 1.25 Mbps. Compare with NewCoolstreaming. 31
32 Playback Continuity 32
33 Playback Latency 33
34 Gradient overlay vs. Random overlay 34
35 Buffering Time 35
36 Playback Latency 36
37 Gradient overlay vs. Random overlay 37
38 Buffering Time 38
39 Fairness and Connectivity in Failure 39
Gozar: NAT friendly Peer Sampling with One Hop Distributed NAT Traversal
Gozar: NAT friendly Peer Sampling with One Hop Distributed NAT Traversal Amir H. Payberah Jim Dowling Seif Haridi {amir,jdowling,seif}@sics.se 1 Introduction 2 Gossip based Peer Sampling Service Gossip
Converging an Overlay Network to a Gradient Topology
Converging an Overlay Network to a Gradient Topology Håkan Terelius, Guodong Shi, Jim Dowling, Amir Payberah, Ather Gattami and Karl Henrik Johansson KTH - Royal Institute of Technology, {hakante,guodongs,gattami,kallej}@kth.se
gradientv: Market-Based P2P Live Media Streaming on the Gradient Overlay
gradientv: Market-Based P2P Live Media Streaming on the Gradient Overlay Amir H. Payberah 1,2, Jim Dowling 1, Fatemeh Rahimian 1,2, and Seif Haridi 1,2 1 Swedish Institute of Computer Science (SICS) 2
Shuffling with a Croupier: Nat Aware Peer Sampling
Shuffling with a Croupier: Nat Aware Peer Sampling Jim Dowling Amir H. Payberah {jdowling,amir}@sics.se 1 Introduction 2 Gossip based Protocols Gossip based protocols have been widely used in large scale
Live Streaming in P2P and Hybrid P2P-Cloud Environments for the Open Internet AMIR H. PAYBERAH
Live Streaming in P2P and Hybrid P2P-Cloud Environments for the Open Internet AMIR H. PAYBERAH Doctoral Thesis in Information and Communication Technology Stockholm, Sweden 2013 Live Streaming in P2P
Sepidar: Incentivized Market-Based P2P Live-Streaming on the Gradient Overlay Network
Sepidar: Incentivized Market-Based P2P Live-Streaming on the Gradient Overlay Network Amir H. Payberah and Fatemeh Rahimian and Seif Haridi Swedish Institute of Computer Science (SICS) KTH - Royal Institute
gradientv: Market-based P2P live media streaming on the Gradient overlay
gradientv: Market-based P2P live media streaming on the Gradient overlay Amir H. Payberah 1,2, Jim Dowling 1, Fatemeh Rahimian 1,2, and Seif Haridi 1,2 1 Swedish Institute of Computer Science (SICS) 2
Octoshape. Commercial hosting not cable to home, founded 2003
Octoshape Commercial hosting not cable to home, founded 2003 Broadcasting fee is paid by broadcasters Free for consumers Audio and Video, 32kbps to 800kbps Mesh based, bit-torrent like, Content Server
Overlay Networks for Multimedia Contents Distribution
Overlay Networks for Multimedia Contents Distribution Vittorio Palmisano vpalmisano@gmail.com 26 gennaio 2007 Outline 1 Mesh-based Multicast Networks 2 Tree-based Multicast Networks Overcast (Cisco, 2000)
Max-1: Algorithm for Constructing Tree Topology for heterogeneous networks for Peer-To-Peer Live Video Streaming
International Journal of Electrical & Computer Sciences IJECS-IJENS Vol:16 No:04 14 : Algorithm for Constructing Topology for heterogeneous networks for Peer-To-Peer Live Video Streaming Ammar Waysi AlTuhafi
Module SDS: Scalable Distributed Systems. Gabriel Antoniu, KERDATA & Davide Frey, ASAP INRIA
Module SDS: Scalable Distributed Systems Gabriel Antoniu, KERDATA & Davide Frey, ASAP INRIA Staff Gabriel Antoniu, DR INRIA, KERDATA Team gabriel.antoniu@inria.fr Davide Frey, CR INRIA, ASAP Team davide.frey@inria.fr
Tree-Based Analysis of Mesh Overlays for Peer-to-Peer Streaming
Tree-Based Analysis of Mesh Overlays for Peer-to-Peer Streaming Bartosz Biskupski 1, Marc Schiely 2, Pascal Felber 2,andRené Meier 1 1 Trinity College Dublin, Ireland 2 University of Neuchâtel, Switzerland
Minimizing Churn in Distributed Systems
Minimizing Churn in Distributed Systems by P. Brighten Godfrey, Scott Shenker, and Ion Stoica appearing in SIGCOMM 2006 presented by Todd Sproull Introduction Problem: nodes joining or leaving distributed
A Cloud-assisted Tree-based P2P System for Low Latency Streaming
A Cloud-assisted Tree-based P2P System for Low Latency Streaming Lucas Provensi, Frank Eliassen, and Roman Vitenberg Department of Informatics, University of Oslo, Norway. E-mail: {provensi,frank,romanvi}@ifi.uio.no
P2P 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
Heterogeneous Gossip. Davide Frey Rachid Guerraoui Anne-Marie Kermarrec Boris Koldehofe Maxime Monod Martin Mogensen Vivien Quéma
Heterogeneous Gossip Davide Frey Rachid Guerraoui Anne-Marie Kermarrec Boris Koldehofe Maxime Monod Martin Mogensen Vivien Quéma Outline Context Live Streaming Gossip Limitations Heterogeneous Gossip Protocol
Peer-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
Streaming Live Media over a Peer-to-Peer Network
Streaming Live Media over a Peer-to-Peer Network Technical Report Stanford University Deshpande, Hrishikesh Bawa, Mayank Garcia-Molina, Hector Presenter: Kang, Feng Outline Problem in media streaming and
CSE 326: Data Structures B-Trees and B+ Trees
Announcements (2/4/09) CSE 26: Data Structures B-Trees and B+ Trees Midterm on Friday Special office hour: 4:00-5:00 Thursday in Jaech Gallery (6 th floor of CSE building) This is in addition to my usual
High-Bandwidth Mesh-based Overlay Multicast in Heterogeneous Environments
High-Bandwidth Mesh-based Overlay Multicast in Heterogeneous Environments Bartosz Biskupski, Raymond Cunningham, Jim Dowling, and René Meier Distributed Systems Group Trinity College Dublin, Ireland {biskupski,racunnin,jpdowlin,rmeier}@cs.tcd.ie
CompSci 356: Computer Network Architectures Lecture 21: Overlay Networks Chap 9.4. Xiaowei Yang
CompSci 356: Computer Network Architectures Lecture 21: Overlay Networks Chap 9.4 Xiaowei Yang xwy@cs.duke.edu Overview Problem Evolving solutions IP multicast Proxy caching Content distribution networks
Understanding Mesh-based Peer-to-Peer Streaming
Understanding Mesh-based Peer-to-Peer Streaming Nazanin Magharei, Reza Rejaie Department of Computer and Information Science University of Oregon {nazanin,reza}@cs.uoregon.edu ABSTRACT A common approach
A Proposed Peer Selection Algorithm for Transmission Scheduling in P2P-VOD Systems
A Proposed Peer Selection Algorithm for Transmission Scheduling in P2P-VOD Systems Hatem Fetoh Department of Information Technology Faculty of Computers and Information Mansoura University, Egypt Waleed
COOCHING: 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,
Telematics Chapter 9: Peer-to-Peer Networks
Telematics Chapter 9: Peer-to-Peer Networks Beispielbild User watching video clip Server with video clips Application Layer Presentation Layer Application Layer Presentation Layer Session Layer Session
Basic Switch Organization
NOC Routing 1 Basic Switch Organization 2 Basic Switch Organization Link Controller Used for coordinating the flow of messages across the physical link of two adjacent switches 3 Basic Switch Organization
Self-optimised Tree Overlays using Proximity-driven Self-organised Agents
Self-optimised Tree Overlays using Proximity-driven Self-organised Agents Evangelos Pournaras, Martijn Warnier and Frances M.T. Brazier Abstract Hierarchical structures are often deployed in large scale
M-ary Search Tree. B-Trees. B-Trees. Solution: B-Trees. B-Tree: Example. B-Tree Properties. Maximum branching factor of M Complete tree has height =
M-ary Search Tree B-Trees Section 4.7 in Weiss Maximum branching factor of M Complete tree has height = # disk accesses for find: Runtime of find: 2 Solution: B-Trees specialized M-ary search trees Each
GIAN Course on Distributed Network Algorithms. Network Topologies and Interconnects
GIAN Course on Distributed Network Algorithms Network Topologies and Interconnects Stefan Schmid @ T-Labs, 2011 The Many Faces and Flavors of Network Topologies Gnutella P2P. Social Networks. Internet.
Live Streaming in Overlay Networks
Live Streaming in Overlay Networks Mário Rui Vazão Vasco Ferreira mvvf@gsd.inesc-id.pt Instituto Superior Técnico (Advisor: Professor Luís Rodrigues) Abstract. Overlay networks have emerged as a promising
Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs)
Project: IEEE P802.15 Working Group for Wireless Personal Area Networks (WPANs) Title: [Simulation Results for Final Proposal 15-3-0380] Date Submitted: [Aug 2013] Source: [Hongkun Li, Zhuo Chen, Chonggang
Extreme Computing. BitTorrent and incentive-based overlay networks.
Extreme Computing BitTorrent and incentive-based overlay networks BitTorrent Today we will focus on BitTorrent The technology really has three aspects A standard that BitTorrent client systems follow Some
A Survey on Routing Issues and Associated Protocols for Best-effort Delivery in IP Networks
Volume 119 No. 12 2018, 707-716 ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu A Survey on Routing Issues and Associated Protocols for Best-effort Delivery in IP Networks MajidhaFathima
What is Multicasting? Multicasting Fundamentals. Unicast Transmission. Agenda. L70 - Multicasting Fundamentals. L70 - Multicasting Fundamentals
What is Multicasting? Multicasting Fundamentals Unicast transmission transmitting a packet to one receiver point-to-point transmission used by most applications today Multicast transmission transmitting
M-ary Search Tree. B-Trees. Solution: B-Trees. B-Tree: Example. B-Tree Properties. B-Trees (4.7 in Weiss)
M-ary Search Tree B-Trees (4.7 in Weiss) Maximum branching factor of M Tree with N values has height = # disk accesses for find: Runtime of find: 1/21/2011 1 1/21/2011 2 Solution: B-Trees specialized M-ary
Information Brokerage
Information Brokerage Sensing Networking Leonidas Guibas Stanford University Computation CS321 Information Brokerage Services in Dynamic Environments Information Brokerage Information providers (sources,
CCD: Efficient Customized Content Dissemination in Distributed Publish/Subscribe
Dissemination in Distributed Publish/Subscribe H. Jafarpour, B. Hore, S. Mehrotra and N. Venkatasubramanian Information Systems Group Dept. of Computer Science UC Irvine 1 Customized content dissemination
Wireless Sensor Networks
Wireless Sensor Networks Routing M. Schölzel Network in computer science Network is a graph G = (V,E) V set of all nodes E set of all edges: (v 1,v 2 ) E V 2 V = { A, B, C,... } E = { (A,B), (B,C), (C,F),...
CLive: Cloud-Assisted P2P Live Streaming
CLive: Cloud-Assisted P2P Live Streaming Amir H. Payberah, Hanna Kavalionak, Vimalkumar Kumaresan, Alberto Montresor, Seif Haridi Swedish Institute of Computer Science (SICS), Sweden University of Trento,
Peer-to-Peer Streaming Systems
Peer-to-Peer Streaming Systems Yifeng He and Ling Guan Department of Electrical and Computer Engineering, Ryerson University, Toronto, ON, M5B 2K3 Canada Summary. With advances in the broadband Internet
CSC 401 Data and Computer Communications Networks
CSC 401 Data and Computer Communications Networks Computer Networks and The Inter Sec 1.3 Prof. Lina Battestilli Fall 2017 Outline Computer Networks and the Inter (Ch 1) 1.1 What is the Inter? 1.2 work
Application Layer Multicast with Proactive Route Maintenance over Redundant Overlay Trees
56893792 Application Layer Multicast with Proactive Route Maintenance over Redundant Overlay Trees Yohei Kunichika, Jiro Katto and Sakae Okubo Department of Computer Science, Waseda University {yohei,
CliqueStream: Creating an Efficient and Resilient Transport Overlay for Peer-to-Peer Live Streaming using a Clustered DHT
Noname manuscript No. (will be inserted by the editor) CliqueStream: Creating an Efficient and Resilient Transport Overlay for Peer-to-Peer Live Streaming using a Clustered DHT Shah Asaduzzaman Ying Qiao
Adaptive 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
Peer-to-Peer Media Streaming
SEMINAR: RECHNERNETZE UND VERTEILTE SYSTEME HS08 Peer-to-Peer Media Streaming Francisco Piña Garrido University Jaen (Spain) November 26th, 2008 Overview > Introduction Definition of Peer to Peer Streaming
DHT Overview. P2P: Advanced Topics Filesystems over DHTs and P2P research. How to build applications over DHTS. What we would like to have..
DHT Overview P2P: Advanced Topics Filesystems over DHTs and P2P research Vyas Sekar DHTs provide a simple primitive put (key,value) get (key) Data/Nodes distributed over a key-space High-level idea: Move
A HYBRID PUSH-PULL OVERLAY NETWORK FOR PEER-TO-PEER VIDEO STREAMING
A HYBRID PUSH-PULL OVERLAY NETWORK FOR PEER-TO-PEER VIDEO STREAMING Seyed Mehran Ronaghi 1 and Behzad Akbari 2 1 Department of Electrical and Computer Engineering, Qazvin Islamic Azad University, Qazvin,
Master s Thesis. A Construction Method of an Overlay Network for Scalable P2P Video Conferencing Systems
Master s Thesis Title A Construction Method of an Overlay Network for Scalable P2P Video Conferencing Systems Supervisor Professor Masayuki Murata Author Hideto Horiuchi February 14th, 2007 Department
A Cloud-assisted Tree-based P2P System for Low Latency Streaming
A Cloud-assisted Tree-based P2P System for Low Latency Streaming Lucas Provensi, Frank Eliassen, and Roman Vitenberg Department of Informatics, University of Oslo, Norway. E-mail: {provensi,frank,romanvi}@ifi.uio.no
Topology Optimization in Hybrid Tree/Mesh-based Peer-to-Peer Streaming System
88 Topology Optimization in Hybrid Tree/Mesh-based Peer-to-Peer Streaming System Tran Thi Thu Ha 1, Jinsul Kim 1, Jaehyung Park 1 Sunghyun Yoon 2, Ho-Yong Ryu 2 1 School of Electronics & Computer Engineering,
P2P Applications. Reti di Elaboratori Corso di Laurea in Informatica Università degli Studi di Roma La Sapienza
P2P Applications Reti di Elaboratori Corso di Laurea in Informatica Università degli Studi di Roma La Sapienza Versione originale delle slides fornita da Dora Spenza e Marco Barbera P2P Paradigm Late 80
AutoTune: Game-based Adaptive Bitrate Streaming in P2P-Assisted Cloud-Based VoD Systems
AutoTune: Game-based Adaptive Bitrate Streaming in P2P-Assisted Cloud-Based VoD Systems Yuhua Lin and Haiying Shen Dept. of Electrical and Computer Engineering Clemson University, SC, USA Outline Introduction
Making Gnutella-like P2P Systems Scalable
Making Gnutella-like P2P Systems Scalable Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, S. Shenker Presented by: Herman Li Mar 2, 2005 Outline What are peer-to-peer (P2P) systems? Early P2P systems
Predicting connection quality in peer-to-peer real-time video streaming systems
Predicting connection quality in peer-to-peer real-time video streaming systems Alex Giladi Jeonghun Noh Information Systems Laboratory, Department of Electrical Engineering Stanford University, Stanford,
CSCI2100B Data Structures Heaps
CSCI2100B Data Structures Heaps Irwin King king@cse.cuhk.edu.hk http://www.cse.cuhk.edu.hk/~king Department of Computer Science & Engineering The Chinese University of Hong Kong Introduction In some applications,
Constructing Overlay Networks through Gossip
Constructing Overlay Networks through Gossip Márk Jelasity Università di Bologna Project funded by the Future and Emerging Technologies arm of the IST Programme The Four Main Theses 1: Topology (network
PRIME: Peer-to-Peer Receiver-drIven MEsh-based Streaming
1 PRIME: Peer-to-Peer Receiver-drIven MEsh-based Streaming Nazanin Magharei, Reza Rejaie Department of Computer and Information Science University of Oregon {nazanin,reza}@cs.uoregon.edu Abstract The success
Performance analysis of optimization techniques in peer-to-peer video streaming systems with tree/forest topology
2010 International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT) Performance analysis of optimization techniques in peer-to-peer video streaming systems with tree/forest
Peer-to-Peer (P2P) Architectures
Peer-to-Peer (P2P) Architectures ECE/CS 658 Internet Engineering Dilum Bandara dilumb@engr.colostate.edu Outline Background Unstructured P2P Napster, Gnutella, & BitTorrent Structured P2P Chord & Kademlia
Efficient Multimedia Distribution in Source Constraint Networks
Efficient Multimedia Distribution in Source Constraint Networks Thinh Nguyen, Member, IEEE, Krishnan Kolazhi, Member, IEEE, Rohit Kamath, Member, IEEE, Sen-ching Cheung, Senior Member, IEEE and Duc Tran,
Game Theory. Presented by Hakim Weatherspoon
Game Theory Presented by Hakim Weatherspoon Game Theory Main Question: Can we cheat (and get away with it)? BitTorrent P2P file distribution tool designed with incentives for contribution Users contribute
A Scalable Content- Addressable Network
A Scalable Content- Addressable Network In Proceedings of ACM SIGCOMM 2001 S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker Presented by L.G. Alex Sung 9th March 2005 for CS856 1 Outline CAN basics
CRESCENDO GEORGE S. NOMIKOS. Advisor: Dr. George Xylomenos
CRESCENDO Implementation of Hierarchical Chord (Crescendo), according to Canon paradigm and evaluation, via simulation over realistic network topologies, of the Crescendo's advantages in comparison to
Dr Markus Hagenbuchner CSCI319 SIM. Distributed Systems Chapter 4 - Communication
Dr Markus Hagenbuchner markus@uow.edu.au CSCI319 SIM Distributed Systems Chapter 4 - Communication CSCI319 Chapter 4 Page: 1 Communication Lecture notes based on the textbook by Tannenbaum Study objectives:
Peer-to-peer systems and overlay networks
Complex Adaptive Systems C.d.L. Informatica Università di Bologna Peer-to-peer systems and overlay networks Fabio Picconi Dipartimento di Scienze dell Informazione 1 Outline Introduction to P2P systems
Chapter 3. Introduction to Dynamic Routing Protocols. CCNA2-1 Chapter 3
Chapter 3 Introduction to Dynamic Routing Protocols CCNA2-1 Chapter 3 Introduction to Dynamic Routing Protocols Introduction to Dynamic Routing Protocols CCNA2-2 Chapter 3 Perspective and Background Dynamic
Toward Intrusion Tolerant Cloud Infrastructure
Toward Intrusion Tolerant Cloud Infrastructure Daniel Obenshain, Tom Tantillo, Yair Amir Department of Computer Science Johns Hopkins University Andrew Newell, Cristina Nita-Rotaru Department of Computer
Chainsaw: Eliminating Trees from Overlay Multicast
Chainsaw: Eliminating Trees from Overlay Multicast Vinay Pai, Kapil Kumar, Karthik Tamilmani, Vinay Sambamurthy, Alexander E. Mohr Department of Computer Science Stony Brook University {vinay,kkumar,tamilman,vsmurthy,amohr}@cs.stonybrook.edu
Energy Efficient Routing for Wireless Sensor Networks with Grid Topology
Energy Efficient Routing for Wireless Sensor Networks with Grid Topology Hock Guan Goh 1, Moh Lim Sim 2, and Hong Tat Ewe 1 1 Faculty of Information Technology, 2 Faculty of Engineering, Multimedia University,
On Minimizing Packet Loss Rate and Delay for Mesh-based P2P Streaming Services
On Minimizing Packet Loss Rate and Delay for Mesh-based P2P Streaming Services Zhiyong Liu, CATR Prof. Zhili Sun, UniS Dr. Dan He, UniS Denian Shi, CATR Agenda Introduction Background Problem Statement
PPM - A Hybrid Push-Pull Mesh-Based Peer-to-Peer Live Video Streaming Protocol
PPM - A Hybrid Push-Pull Mesh-Based Peer-to-Peer Live Video Streaming Protocol Adel Ghanbari, Hamid R. Rabiee, Mohammad Khansari, Mostafa Salehi Digital Media Lab, Department of Computer Engineering, Sharif
Hd Video Transmission Over Wireless Network Using Batching And Patching Technique
Hd Video Transmission Over Wireless Network Using Batching And Patching Technique M. Ramya, S. Girija, M. Bharathy Devi, S. Gnanavel M.E (Phd) Abstract: In recent advances the high speed video transmission
Segment Tree Based Control Plane Protocol for Peer-to-Peer Streaming Service Discovery
Segment Tree Based Control Plane Protocol for Peer-to-Peer Streaming Service Discovery Changxi Zheng a, Guobin Shen b and Shipeng Li b a Department of Computer Science and Technology, Shanghai Jiaotong
GIAN Course on Distributed Network Algorithms. Network Topologies and Local Routing
GIAN Course on Distributed Network Algorithms Network Topologies and Local Routing Stefan Schmid @ T-Labs, 2011 GIAN Course on Distributed Network Algorithms Network Topologies and Local Routing If you
Routing in packet-switching networks
Routing in packet-switching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call
An Empirical Study of Flash Crowd Dynamics in a P2P-based Live Video Streaming System
An Empirical Study of Flash Crowd Dynamics in a P2P-based Live Video Streaming System Bo Li,GabrielY.Keung,SusuXie,Fangming Liu,YeSun and Hao Yin Hong Kong University of Science and Technology Tsinghua
: Scalable Lookup
6.824 2006: Scalable Lookup Prior focus has been on traditional distributed systems e.g. NFS, DSM/Hypervisor, Harp Machine room: well maintained, centrally located. Relatively stable population: can be
Carnegie Mellon Computer Science Department Spring 2016 Midterm Exam
Carnegie Mellon Computer Science Department. 15-744 Spring 2016 Midterm Exam Name: Andrew ID: INSTRUCTIONS: There are 13 pages (numbered at the bottom). Make sure you have all of them. Please write your
Delay Bounds of Peer-to-Peer Video Streaming
Delay Bounds of Peer-to-Peer Video Streaming Yong Liu Electrical & Computer Engineering Department Polytechnic Institute of NYU Brooklyn, NY, email: yongliu@poly.edu June, 9 Abstract Peer-to-Peer (PP)
Quality of Service Mechanism for MANET using Linux Semra Gulder, Mathieu Déziel
Quality of Service Mechanism for MANET using Linux Semra Gulder, Mathieu Déziel Semra.gulder@crc.ca, mathieu.deziel@crc.ca Abstract: This paper describes a QoS mechanism suitable for Mobile Ad Hoc Networks
P 5 : A Protocol for Scalable Anonymous Communications
P 5 : A Protocol for Scalable Anonymous Communications 1 P 5 : A Protocol for Scalable Anonymous Communications Rob Sherwood, Bobby Bhattacharjee, Aravind Srinivasan University of Maryland, College Park
Chunk Scheduling Strategies In Peer to Peer System-A Review
Chunk Scheduling Strategies In Peer to Peer System-A Review Sanu C, Deepa S S Abstract Peer-to-peer ( P2P) s t r e a m i n g systems have become popular in recent years. Several peer- to-peer systems for
3. Priority Queues. ADT Stack : LIFO. ADT Queue : FIFO. ADT Priority Queue : pick the element with the lowest (or highest) priority.
3. Priority Queues 3. Priority Queues ADT Stack : LIFO. ADT Queue : FIFO. ADT Priority Queue : pick the element with the lowest (or highest) priority. Malek Mouhoub, CS340 Winter 2007 1 3. Priority Queues
Path Optimization in Stream-Based Overlay Networks
Path Optimization in Stream-Based Overlay Networks Peter Pietzuch, prp@eecs.harvard.edu Jeff Shneidman, Jonathan Ledlie, Mema Roussopoulos, Margo Seltzer, Matt Welsh Systems Research Group Harvard University
Proxy-P2P Streaming Under the Microscope: Fine-Grain Measurement of a Configurable Platform
Proxy-P2P Streaming Under the Microscope: Fine-Grain Measurement of a Configurable Platform (Invited Paper) Joe Wenjie Jiang, Mung Chiang, Jennifer Rexford Department of Computer Science Department of
Agenda. What are we looking at? Introduction. Aim of the project. IP Routing
Agenda Handoffs in Cellular Wireless Networks: The Daedalus Implementation & Experience by Shrinivasan Seshan, Hari Balakrishnan Randy H. Katz A short presentation by Aishvarya Sharma Dept of Computer
SECURITY ISSUES IN P2P NETWORK USING ANALYSIS OF STREAMING SERVICES
International Journal of Computer Networking, Wireless and Mobile Communications (IJCNWMC) ISSN 2250 1568 Vol.2, Issue 2 June 2012 32-43 TJPRC Pvt. Ltd., SECURITY ISSUES IN P2P NETWORK USING ANALYSIS OF
Fast Topology Management in Large Overlay Networks
Topology as a key abstraction Fast Topology Management in Large Overlay Networks Ozalp Babaoglu Márk Jelasity Alberto Montresor Dipartimento di Scienze dell Informazione Università di Bologna! Topology
A local area network that employs either a full mesh topology or partial mesh topology
and Ad Hoc Networks Definition A local area network that employs either a full mesh topology or partial mesh topology Full mesh topology each node is connected directly to each of the others Partial mesh
AN ABSTRACT OF THE THESIS OF. Krishnan Kolazhi for the degree of Master of Science in Computer Science
AN ABSTRACT OF THE THESIS OF Krishnan Kolazhi for the degree of Master of Science in Computer Science presented on June 5, 2006. Title: Node and Topology Management for Content Distribution in Source Constraint
Network Layer (Routing)
Network Layer (Routing) Topics Network service models Datagrams (packets), virtual circuits IP (Internet Protocol) Internetworking Forwarding (Longest Matching Prefix) Helpers: ARP and DHCP Fragmentation
Olaf Weber Senior Software Engineer SGI Storage Software. Amir Shehata Lustre Network Engineer Intel High Performance Data Division
Olaf Weber Senior Software Engineer SGI Storage Software Amir Shehata Lustre Network Engineer Intel High Performance Data Division Intel and the Intel logo are trademarks or registered trademarks of Intel
Solutions for Exercises of Lecture 5 - Bridges
Question 1: Solutions for Exercises of Lecture 5 - Bridges For the two hosts shown in the figure, the ethernet MAC addresses are provided. All the LANs are BRIDGE 7 LAN G LAN A LAN B BRIDGE 3 LAN C Host
Push pull techniques in peer-to-peer video streaming systems with tree/forest topology
2010 International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT) Push pull techniques in peer-to-peer video streaming systems with tree/forest topology Paolo Giacomazzi,
Λέων-Χαράλαμπος Σταματάρης
Λέων-Χαράλαμπος Σταματάρης INTRODUCTION Two classical problems of information dissemination in computer networks: The broadcasting problem: Distributing a particular message from a distinguished source
Simple, Fast and Deterministic Gossip and Rumor Spreading. Main paper by: B. Haeupler, MIT Talk by: Alessandro Dovis, ETH
Simple, Fast and Deterministic Gossip and Rumor Spreading Main paper by: B. Haeupler, MIT Talk by: Alessandro Dovis, ETH Presentation Outline What is gossip? Applications Basic Algorithms Advanced Algorithms
Lightweight Gossip-based Distribution Estimation
Lightweight Gossip-based Distribution Estimation Amir H. Payberah, Hanna Kavalionak, Alberto Montresor, Jim Dowling, Seif Haridi Swedish Institute of Computer Science (SICS) University of Trento, Italy
PUBLISHER Subscriber system is an event notification service
A Bandwidth Aware Topology Generation Mechanism for Peer-to-Peer based Publish-Subscribe Systems Abhigyan, Joydeep Chandra, Niloy Ganguly Department of Computer Science & Engineering, Indian Institute
Improving ICE Service Selection in a P2P System using the Gradient Topology
Improving ICE Service Selection in a P2P System using the Gradient Topology Jim Dowling 1 Jan Sacha 2 Seif Haridi 1 1 Swedish Institute of Computer Science, Kista, Sweden 2 Distributed Systems Group, Trinity
138 IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 11, NO. 1, JANUARY 2009
138 IEEE TRANSACTIONS ON MULTIMEDIA, VOL. 11, NO. 1, JANUARY 2009 Optimal Prefetching Scheme in P2P VoD Applications With Guided Seeks Yifeng He, Member, IEEE, Guobin Shen, Senior Member, IEEE, Yongqiang