1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.

Slides:

Advertisements

Similar presentations

Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.

Advertisements

Virtual Distance: A Generalized Metric for Overlay Tree Construction ISCC12 July Suat Mercan (Zirve University) & Murat Yuksel (University of Nevada,

Advisor : Prof. Yu-Chee Tseng Student : Yi-Chen Lu 12009/06/26.

Research: Group communication in distributed interactive applications Student: Knut-Helge Vik Institute: University of Oslo, Simula Research Labs.

Impact Analysis of Cheating in Application Level Multicast s １０９０１７６ Masayuki Higuchi.

Cooperative Overlay Networking for Streaming Media Content Feng Wang 1, Jiangchuan Liu 1, Kui Wu 2 1 School of Computing Science, Simon Fraser University.

“Scalable and Topologically-aware Application-layer Multicast” Yusung Kim Korea Advanced Institute of Science and Technology.

1 A Case For End System Multicast Yang-hua Chu, Sanjay Rao and Hui Zhang Carnegie Mellon University Largely adopted from Jonathan Shapiro’s slides at umass.

SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,

ZIGZAG A Peer-to-Peer Architecture for Media Streaming By Duc A. Tran, Kien A. Hua and Tai T. Do Appear on “Journal On Selected Areas in Communications,

Opportunities and Challenges of Peer-to-Peer Internet Video Broadcast J. Liu, S. G. Rao, B. Li and H. Zhang Proc. of The IEEE, 2008 Presented by: Yan Ding.

Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.

Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of.

OSMOSIS Final Presentation. Introduction Osmosis System Scalable, distributed system. Many-to-many publisher-subscriber real time sensor data streams,

Efficient Monitoring of QoS Parameters (EMQP) Authors: Vadim Drabkin Arie Orlovsky Constantine Elster Instructors: Dr. Danny Raz Mr. Ran Wolff.

Application Layer Multicast

1 IP Multicasting. 2 IP Multicasting: Motivation Problem: Want to deliver a packet from a source to multiple receivers Applications: –Streaming of Continuous.

CS218 – Final Project A “Small-Scale” Application- Level Multicast Tree Protocol Jason Lee, Lih Chen & Prabash Nanayakkara Tutor: Li Lao.

An Evaluation of Scalable Application-level Multicast Using Peer-to-peer Overlays Miguel Castro, Michael B. Jones, Anne-Marie Kermarrec, Antony Rowstron,

A Case for End System Multicast Author: Yang-hua Chu, Sanjay G. Rao, Srinivasan Seshan and Hui Zhang.

On-Demand Media Streaming Over the Internet Mohamed M. Hefeeda, Bharat K. Bhargava Presented by Sam Distributed Computing Systems, FTDCS Proceedings.

Nearcast: A Locality-Aware P2P Live Streaming Approach for Distance Education XUPING TU, HAI JIN, and XIAOFEI LIAO Huazhong University of Science and Technology.

1 Towards a deployable IP Anycast service Hitesh Ballani, Paul Francis Cornell University {hitesh,

Edge Device Multi-unicasting for Video Streaming T. Lavian, P. Wang, R. Durairaj, F. Travostino Advanced Technology Lab, Nortel Networks D. B. Hoang University.

1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:

University of Nevada, Reno Virtual Direction Multicast for Overlay Networks Suat Mercan & Dr. Murat Yuksel HOTP2P’11.

1 Study on Adaptation of CDN Request-Routing to Scalable Conference System Toshiyuki KAWASAKI* Koji OKAMURA** * Graduate School of Information Science.

1 Proceeding the Second Exercises on Computer and Systems Engineering Professor OKAMURA Laboratory. Othman Othman M.M.

EQ-BGP: an efficient inter- domain QoS routing protocol Andrzej Bęben Institute of Telecommunications Warsaw University of Technology,

Communication (II) Chapter 4

Advanced Network Architecture Research Group 2001/11/149 th International Conference on Network Protocols Scalable Socket Buffer Tuning for High-Performance.

End-to-end QoE Optimization Through Overlay Network Deployment Bart De Vleeschauwer, Filip De Turck, Bart Dhoedt and Piet Demeester Ghent University -

ON DESIGING END-USER MULTICAST FOR MULTIPLE VIDEO SOURCES Y.Nakamura, H.Yamaguchi, A.Hiromori, K.Yasumoto †, T.Higashino and K.Taniguchi Osaka University.

Resilient Peer-to-Peer Streaming Presented by: Yun Teng.

Higashino Lab. Maximizing User Gain in Multi-flow Multicast Streaming on Overlay Networks Y.Nakamura, H.Yamaguchi and T.Higashino Graduate School of Information.

Aadil Zia Khan and Shahab Baqai LUMS School of Science and Engineering QoS Aware Path Selection in Content Centric Networks Fahad R. Dogar Carnegie Mellon.

An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.

Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.

N ETWORKed M EDIA L AB. D EPT. OF I NFO. & C OMM., K-JIST Scalable Overlay Network for Peer-to-Peer File Sharing Park, Chanmo Networked Media Lab. Kwang-Ju.

Paper Group: 20 Overlay Networks 2 nd March, 2004 Above papers are original works of respective authors, referenced here for academic purposes only Chetan.

G-REMiT: An Algorithm for Building Energy Efficient Multicast Trees in Wireless Ad Hoc Networks Bin Wang and Sandeep K. S. Gupta NCA’03 speaker ： Chi-Chih.

Fast Handoff for Seamless wireless mesh Networks Yair Amir, Clauiu Danilov, Michael Hilsdale Mobisys’ Jeon, Seung-woo.

TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.

Data Oriented Network Architecture (DONA) Andrey Ermolinskiy Mohit Chawla CS 262 A Project Poster December 14.

Adaptive Web Caching CS411 Dynamic Web-Based Systems Flying Pig Fei Teng/Long Zhao/Pallavi Shinde Computer Science Department.

Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.

Energy-Efficient Shortest Path Self-Stabilizing Multicast Protocol for Mobile Ad Hoc Networks Ganesh Sridharan

A Membership Management Protocol for Mobile P2P Networks Mohamed Karim SBAI, Emna SALHI, Chadi BARAKAT.

APPLICATION LAYER MULTICASTING

A P2P-Based Architecture for Secure Software Delivery Using Volunteer Assistance Purvi Shah, Jehan-François Pâris, Jeffrey Morgan and John Schettino IEEE.

A Multicast Mechanism in WiMax Mesh Network Jianfeng Chen, Wenhua Jiao, Pin Jiang, Qian Guo Asia-Pacific Conference on Communications, (APCC '06)

UNIVERSITY OF JYVÄSKYLÄ 2005 Multicast Admission Control in DiffServ Networks Department of Mathematical Information Technology University of Jyväskylä.

Push Technology Humie Leung Annabelle Huo. Introduction Push technology is a set of technologies used to send information to a client without the client.

Global Internet 2005 A Comparative Study of Multicast Protocols: Top, Bottom, or In the Middle? Li Lao (UCLA), Jun-Hong Cui (UCONN) Mario Gerla (UCLA),

Overlay Networks and Overlay Multicast May Definition  Network -defines addressing, routing, and service model for communication between hosts.

CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.

A Case for End System Multicast 學號：報告人：通訊所吳瑞益指導教授：楊峻權日期： ACM SIGMETRICS.

1 A Case For End System Multicast Yang-hua Chu, Sanjay Rao and Hui Zhang Carnegie Mellon University.

1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.

Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.

Multicast with Network Coding in Application-Layer Overlay Networks Y. Zhu, B. Li, and J. Guo University of Toronto Present by Cheng Huang

Network Computing Laboratory ZIGZAG: An Efficient Peer-to-Peer Sch eme for Media Streaming Duc A. Tran Kien A. Hua Tai Do University of Central Florida.

PATH DIVERSITY WITH FORWARD ERROR CORRECTION SYSTEM FOR PACKET SWITCHED NETWORKS Thinh Nguyen and Avideh Zakhor IEEE INFOCOM 2003.

Zueyong Zhu† and J. William Atwood‡

A Study of Group-Tree Matching in Large Scale Group Communications

Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting

Host Multicast: A Framework for Delivering Multicast to End Users

Overlay Networking Overview.

Technical University of Cluj-Napoca

Dynamic Replica Placement for Scalable Content Delivery

Presentation transcript:

1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter ： Wei-Zhi Chen

2 Outline Introduction Problem description-background work Architecture overview Simulation Conclusion

3 Introduction Real-time content delivery requires high bandwidth availability and minimum jitter in order to enhance user perceived quality. The primary goal of the simulation model propose is to demonstrate the effectiveness of the overlay scheme introduced for a large number of users.

4 Problem description-background work As point to point connections lead to excessive bandwidth consumption and server overload, the multipoint delivery model seems quite promising. Three major issues. Group membership Routing Packet duplication

5 Problem description-background work Group membership A control protocol for the construction of groups. An authentication mechanism for the potential members of each group. Routing Construction and maintenance of the distribution trees. Elimination of redundant traffic on the network. Packet duplication

6 Problem description-background work IP multicast An architecture for multi-point packet delivery at the network layer. Suffer some problems Scalability Lack of effective access control polices. No globally Inter-Domain multicast routing protocol.

7 Problem description-background work Application layer multicast Move functionality for multipoint data delivery to the application layer for constructing overlay network. Deployment of overlay networks offers Support different requirements Better use of the network infrastructure without need for changes.

8 Architecture overview Modules NDM ( Network Distribution Manager) SAS ( Streaming Access Servers ) The basic module of the architecture At lowest level, a SAS is just a proxy : it forwards incoming media streams to one or more clients.

9 The distribution architecture

10 Architecture overview Connection point decision …(1) Hierarchy level

11 Architecture overview Proximity RTT( Round Trip Time ) WatchdogTimer is the maximum time allowed for the experiment. Clients Served …(4)

12 Simulation Overlay tree construction In order to construct an efficient overlay tree, each SAS reports its existence to the NDM node. G(V,E) V: the number of SAS nodes E=N * (N-1)/2 edges

13 Simulation Distributed mini spanning tree algorithm In the first phase, messages are exchanged between all SAS nodes and measuring the Round Trip Time( RTT ) between them. In the second phase each SAS starts forming a tree. At the end of distribution algorithm we have a minimum weight spanning tree.

14 Simulation Scenario 1 ( client only ) SASs are assigned to transit nodes, and the clients use only their knowledge about client load on each SAS. Stress which is an intuitive metric used in overlay topologies to evaluate the quality of the overlay tree built.

15 Simulation

16 Simulation( scenario 1)

17 Simulation( scenario 1)

18 Simulation( scenario 1)

19 Simulation Scenario 2 ( ping only ) We evaluate the system behavior using as SAS selection criterion only the proximity parameter. RAP( Relative Average Delay Penalty ) is reduced by 15%, but max stress is augment from 25% to 40%

20 Simulation( scenario 2)

21 Simulation( scenario 2)

22 Simulation( scenario 2)

23 Simulation Scenario 3 ( formula only ) Merging ping information, clientload and hierarchy level. RAP is reduced by 15% Max stress is bigger than scenario 1 but is smaller than scenario 2.

24 Simulation( scenario 3)

25 Simulation( scenario 3)

26 Conclusions RAP and average stress are reduced, since the clients are connected to nearby SAS. In future plan, a more sophisticated algorithm for SAS selection.