Multicast Media Streaming: Techniques for Efficiency, Security, And Copyright Protection James Logan CS 525 Dr. Chow.

Slides:



Advertisements
Similar presentations
CS542 Topics in Distributed Systems Diganta Goswami.
Advertisements

A Survey of Key Management for Secure Group Communications Celia Li.
1 Chapter 22 Network layer Delivery, Forwarding and Routing.
Transitioning to IPv6 April 15,2005 Presented By: Richard Moore PBS Enterprise Technology.
1 o Two issues in practice – Scale – Administrative autonomy o Autonomous system (AS) or region o Intra autonomous system routing protocol o Gateway routers.
Jaringan Komputer Dasar Network Layer dan IP (1) Aurelio Rahmadian.
Packet Switching COM1337/3501 Textbook: Computer Networks: A Systems Approach, L. Peterson, B. Davie, Morgan Kaufmann Chapter 3.
CHAPTER 8: SECURITY IN COMPUTER NETWORKS Encryption Encryption Authentication Authentication Security Security Secure Sockets Layer Secure.
MPAC 2004Rae Harbird 1 RUBI Adaptive Resource Discovery for Ubiquitous Computing Rae Harbird Stephen Hailes
Multicast Fundamentals n The communication ways of the hosts n IP multicast n Application level multicast.
UNIT-IV Computer Network Network Layer. Network Layer Prepared by - ROHIT KOSHTA In the seven-layer OSI model of computer networking, the network layer.
Adaptive Video Streaming in Vertical Handoff: A Case Study Ling-Jyh Chen, Guang Yang, Tony Sun, M. Y. Sanadidi, Mario Gerla Computer Science Department,
UNCW UNCW SIGGRAPH 2002 Topic #3: Continuous Media in Wired and Wireless Environments Ronald J. Vetter Department of Computer Science University of North.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
Rheeve: A Plug-n-Play Peer- to-Peer Computing Platform Wang-kee Poon and Jiannong Cao Department of Computing, The Hong Kong Polytechnic University ICDCSW.
Secure Multicast Xun Kang. Content Why need secure Multicast? Secure Group Communications Using Key Graphs Batch Update of Key Trees Reliable Group Rekeying.
CS 268: Lecture 5 (Project Suggestions) Ion Stoica February 6, 2002.
Chapter 25 Internet Routing Internetworking Technology How routing tables are built initially How routing software updates the tables as needed. Propagation.
Adaptive Web Caching: Towards a New Caching Architecture Authors and Institutions: Scott Michel, Khoi Nguyen, Adam Rosenstein and Lixia Zhang UCLA Computer.
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
Protocols and Quality of Service CP4022 – Lecture 4.
1 Network Layer: Host-to-Host Communication. 2 Network Layer: Motivation Can we built a global network such as Internet by extending LAN segments using.
Adaptive Web Caching Lixia Zhang, Sally Floyd, and Van Jacob-son. In the 2nd Web Caching Workshop, Boulder, Colorado, April 25, System Laboratory,
Intradomain Anycast for Content Centric Networks.
Delivery, Forwarding, and Routing
MULTICASTING Network Security.
Multicast Security CS239 Advanced Network Security April 16 th, 2003 Yuken Goto.
Distributed Publish/Subscribe Network Presented by: Yu-Ling Chang.
Distributed Databases
Communication Part IV Multicast Communication* *Referred to slides by Manhyung Han at Kyung Hee University and Hitesh Ballani at Cornell University.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Addressing the Network – IPv4 Network Fundamentals – Chapter 6.
Study of the Relationship between Peer to Peer Systems and IP Multicasting From IEEE Communication Magazine January 2003 學號 :M 姓名 : 邱 秀 純.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Multicast routing.
22.1 Chapter 22 Network Layer: Delivery, Forwarding, and Routing Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
AD HOC WIRELESS MUTICAST ROUTING. Multicasting in wired networks In wired networks changes in network topology is rare In wired networks changes in network.
Hierarchical agent-based secure and reliable multicast in wireless mesh networks Yinan LI, Ing-Ray Chen Robert Weikel, Virginia Sistrunk, Hung-Yuan Chung.
Overcast: Reliable Multicasting with an Overlay Network CS294 Paul Burstein 9/15/2003.
CSC 600 Internetworking with TCP/IP Unit 8: IP Multicasting (Ch. 17) Dr. Cheer-Sun Yang Spring 2001.
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
SOS: Security Overlay Service Angelos D. Keromytis, Vishal Misra, Daniel Rubenstein- Columbia University ACM SIGCOMM 2002 CONFERENCE, PITTSBURGH PA, AUG.
M-HBH Efficient Mobility Management in Multicast Rolland Vida, Luis Costa, Serge Fdida Laboratoire d’Informatique de Paris 6 – LIP6 Université Pierre et.
TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.
Multicast Routing Protocols. The Need for Multicast Routing n Routing based on member information –Whenever a multicast router receives a multicast packet.
Multicasting Part I© Dr. Ayman Abdel-Hamid, CS4254 Spring CS4254 Computer Network Architecture and Programming Dr. Ayman A. Abdel-Hamid Computer.
1 HAWAII- Handoff-Aware Wireless Access Internet Infrastructure Reporter : Jing-Shiuan Hua Date : 2005/4/26.
Adaptive Web Caching CS411 Dynamic Web-Based Systems Flying Pig Fei Teng/Long Zhao/Pallavi Shinde Computer Science Department.
CSC 600 Internetworking with TCP/IP Unit 7: IPv6 (ch. 33) Dr. Cheer-Sun Yang Spring 2001.
1 Integrating security in a quality aware multimedia delivery platform Paul Koster 21 november 2001.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #7 DVMRP.
Introduction to Mobile IPv6
11 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
Security Mechanisms for Delivering Ubiquitous Services in Next Generation Mobile Networks Haitham Cruickshank University of Surrey workshop on Ubiquitous.
On Reducing Mesh Delay for Peer- to-Peer Live Streaming Dongni Ren, Y.-T. Hillman Li, S.-H. Gary Chan Department of Computer Science and Engineering The.
Efficient Group Key Management in Wireless LANs Celia Li and Uyen Trang Nguyen Computer Science and Engineering York University.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Chapter 6 outline r 6.1 Multimedia Networking Applications r 6.2 Streaming stored audio and video m RTSP r 6.3 Real-time, Interactive Multimedia: Internet.
Fall 2006CS 395: Computer Security1 Key Management.
Chapter 5. An IP address is simply a series of binary bits (ones and zeros). How many binary bits are used? 32.
Mobile IP THE 12 TH MEETING. Mobile IP  Incorporation of mobile users in the network.  Cellular system (e.g., GSM) started with mobility in mind. 
Networking Applications
Advanced Computer Networks
(How the routers’ tables are filled in)
A Study of Group-Tree Matching in Large Scale Group Communications
Chapter 6 Delivery & Forwarding of IP Packets
Host Multicast: A Framework for Delivering Multicast to End Users
Overlay Networking Overview.
CSCI {4,6}900: Ubiquitous Computing
Dynamic Routing Protocols part3 B
Implementing Multicast
Design and Implementation of OverLay Multicast Tree Protocol
Presentation transcript:

Multicast Media Streaming: Techniques for Efficiency, Security, And Copyright Protection James Logan CS 525 Dr. Chow

James Logan CS Outline Aggregated Trees – Efficiency Multicast Transition Gateway – Efficiency WHIM: Watermarking Multicast Video with a Hierarchy of Intermediaries – Security and Copyright Protection

James Logan CS Aggregated Trees Two Basic Trees In Multicast Networks: - Source Tree: One root per source, MST algorithm used to maintain branches - Shared Tree: Common root chosen as a rendezvous point to distribute all messages

James Logan CS Aggregated Trees Continued Basic Tree Issues: - Too many trees in the network (Source) - Memory and Processing overhead maintaining bi-directional forwarding states (Source) - Overhead processing for tree creation and reconstruction (Source) - Latency, bottlenecking, and additional hop counts (Shared) Solution: - Aggregated Trees

James Logan CS Aggregated Trees Continued Aggregated Trees - Tree(s) managed by a tree manager mechanism and not the routers themselves - Goal: reduce router memory usage, forwarding state entries, router processing, and bandwidth usage in intra-domain networks.

James Logan CS Aggregated Trees Continued Aggregated Tree Procedure: - Dynamic management mechanism evaluates join request sent by border routers. Determines if the subscription is already available on a tree path. If not it creates a new tree or branch(es). - Tree Manager then assigns a tree the multicast group(s). Multiple groups on one tree path reduces bandwidth and router memory usage. - Messages are encapsulated upon entering the network. The original message is preserved upon encapsulation. This is the key to reducing router processing overhead. - Routers decapsulate the messages to determine forwarding. Management Issue: - Centralized Management Mechanism is seen as a single point of failure

James Logan CS Multicast Transition Gateway - Conceptual mechanism used to support protocol transparency for multicast networks that communicate with other networks with limitations. - Transparency is for multicast to unicast (M2U) and multicast to multicast (M2M) for IPv4 and IPv6 transitioning using the following execution configurations: - IPv6 multicast to IPv6 unicast - IPv4 multicast to IPv4 unicast - IPv6 multicast to IPv6 and IPv4 unicast - IPv4 multicast to IPv6 and IPv4 unicast - 6-to-4 and 4-to-6 multicast

James Logan CS MTG Continued How MTG Process Works – Comprised of two components: Client Connection Manager/Announcement Control and Streaming Relay Mechanism – Client makes request via anycast to MTG(s) based on information obtained from Announcement Control (Capacity/Current Bandwidth etc) – Client selects MTG – Client Connection Manager establishes the connection and maintains it – Streaming Relay Mechanism translates messages based on execution configuration

James Logan CS MTG Continued Concerns with two or more MTGs supporting M2M execution configurations - Identical Configurations: client receives the same data from two different sources - Exact Opposite Configurations: Loopback occurs when one MTG sends out multicast messages and another MTG listening on that group receives it and puts it back into the originating network then originating MTG receives the messages and sends them out again. - Solution: Use RTCP message to let other MTGs know a message transition has taken place. - Scaling: In Large networks with many MTGs, Coordination Servers using P2P communicate with each other to select MTG for the client are needed.

James Logan CS WHIM Watermarking Multicast Video with a Hierarchy of Intermediaries - Augmenting Watermarking process that uses fingerprints for copyrighted and restricted data - Based on a MSTstructure broken into two components - WHIM Backbone: Root to Last Router before client - WHIM Last Hop: Last Router to Client

James Logan CS WHIM Continued Goals of WHIM - Ensuring Robustness in Fingerprinting - Preventing the collusion problem - Asymmetric Fingerprinting to identify individual hosts - Protection Granularity - Logging - Efficiency

James Logan CS WHIM Continued How WHIM Works: - Unique path from source to client is created via MST - Source and all intermediary routers are assigned unique ids (WHIM Backbone) - Last Hop router assigns clients unique ids by either its own method or using public keys (WHIM Last Hop) - As messages flow towards clients intermediary routers concatenate their distinct id to the message to create a watermark - At the last hop the router appends the clients id to the watermark the delivers the message to client

James Logan CS WHIM: Diagram

James Logan CS WHIM Continued Major Issues - WHIM can identify who leaked information but cannot guarantee secure routing Solution - Combine WHIM with Hierarchical Secure Streaming which adds the following functionality - intermediate routers assigned keys via root server - upon client request the root server assigns client key - root server sends client the keys of the routers on its unique path which are encrypted by the previous key starting from the client - data sent from root server is encrypted at each hop then decrypted using the keys sent to the client via the root server

James Logan CS Conclusion Always a tradeoff between a desired service and client and network resources A component’s location in the network can have positive and negative consequences based on its configuration and execution MST algorithm is important to ensure efficiency in a multicast streaming network for the technologies that make use of it

James Logan CS REFERENCES [1]Sumit Rot, John Ankorn, Susie Wee, Architecture of a Modular Streaming Server for Content Delivery Networks, 2003 [2]Chung-Ming Huang, Pei-Chuan Liu, A Ubiquitous 1-to-k Media Streaming Architecture Using the IPv4/IPv6 Multicast Transition Gateway Approach, 2004 [3]Li Lao, Jun-Hong Cui, M.Y. Sanadidi, Mario Gerla, Scalable and Adaptive Multicast Video Streaming for Heterogeneous and Mobile Users, 2005 [4]Jun-Hong Cui, Jinkyu Kim, Dario Maggiorini, Khaled Bousetta, Mario Gerla, Aggregated Multicast – A Comparative Study [5]Aiguo Fei, Junhong, Mario Gerla, Aggregated Multicast: an Approach to Reduce Multicast State [6]Hao-hua Chu, Lintian Qiao, Klara Nahrstedt, A Secure Multicast Protocol with Copyright Protection, April 2002 [7]Paul Judge, Mostafa Ammar, WHIM: Watermarking Multicast Video with a Hierarchy of Intermediaries