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

Slides:



Advertisements
Similar presentations
June 27, 2007 FIND Meeting, From Packet-Switching to Contract- Switching Aparna Gupta Shivkumar Kalyanaraman Rensselaer Polytechnic Institute Troy,
Advertisements

Reconsidering Reliable Transport Protocol in Heterogeneous Wireless Networks Wang Yang Tsinghua University 1.
Multicast congestion control on many-to- many videoconferencing Xuan Zhang Network Research Center Tsinghua University, China.
Network Resource Broker for IPTV in Cloud Computing Lei Liang, Dan He University of Surrey, UK OGF 27, G2C Workshop 15 Oct 2009 Banff,
Topology-Aware Overlay Construction and Server Selection Sylvia Ratnasamy Mark Handley Richard Karp Scott Shenker Infocom 2002.
Sequoia: Virtual-Tree Models for Internet Path Metrics Rama Microsoft Research Also:Ittai Abraham (Hebrew Univ.) Mahesh Balakrishnan (Cornell) Archit Gupta.
Internet for multimedia content Yogendra Pal Chief Engineer, All India Radio.
Fortune >80% deploying mobile clients Smartphones 289M in 2010 >900M in Slates 55M in 2011 >200M in Gartner Forecast: Mobile.
Two-Market Inter-domain Bandwidth Contracting
FIND PI Meeting, April Contract-Switching: Value Flows in Inter-Domain Routing Murat Yuksel University of Nevada – Reno Reno, NV Aparna Gupta, Koushik.
Dynamic Traffic Management (DTM) for minimization of inter- domain traffic cost Rafal Stankiewicz, Zbigniew Dulinski AGH University of Science.
Abhigyan, Aditya Mishra, Vikas Kumar, Arun Venkataramani University of Massachusetts Amherst 1.
Bilal Gonen, Murat Yuksel, Sushil Louis University of Nevada, Reno.
Bayesian Piggyback Control for Improving Real-Time Communication Quality Wei-Cheng Xiao 1 and Kuan-Ta Chen Institute of Information Science, Academia Sinica.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli University of Calif, Berkeley and Lawrence Berkeley National Laboratory SIGCOMM.
Topology Generation Suat Mercan. 2 Outline Motivation Topology Characterization Levels of Topology Modeling Techniques Types of Topology Generators.
1 Failure Recovery for Priority Progress Multicast Jung-Rung Han Supervisor: Charles Krasic.
1 Estimating Shared Congestion Among Internet Paths Weidong Cui, Sridhar Machiraju Randy H. Katz, Ion Stoica Electrical Engineering and Computer Science.
June 3, A New Multipath Routing Protocol for Ad Hoc Wireless Networks Amit Gupta and Amit Vyas.
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,
A New Approach for the Construction of ALM Trees using Layered Coding Yohei Okada, Masato Oguro, Jiro Katto Sakae Okubo International Conference on Autonomic.
1 Network-supported Rate Control Mechanism for Multicast Streaming Media Kiyohide NAKAUCHI, Hiroyuki MORIKAWA, and Tomonori AOYAMA, School of Engineering,
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
Multiple Sender Distributed Video Streaming Thinh Nguyen, Avideh Zakhor appears on “IEEE Transactions On Multimedia, vol. 6, no. 2, April, 2004”
Application Layer Multicast
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
Performance Enhancement of TFRC in Wireless Ad Hoc Networks Mingzhe Li, Choong-Soo Lee, Emmanuel Agu, Mark Claypool and Bob Kinicki Computer Science Department.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.
CS218 – Final Project A “Small-Scale” Application- Level Multicast Tree Protocol Jason Lee, Lih Chen & Prabash Nanayakkara Tutor: Li Lao.
Peer-to-peer Multimedia Streaming and Caching Service by Won J. Jeon and Klara Nahrstedt University of Illinois at Urbana-Champaign, Urbana, USA.
Nearcast: A Locality-Aware P2P Live Streaming Approach for Distance Education XUPING TU, HAI JIN, and XIAOFEI LIAO Huazhong University of Science and Technology.
University of Nevada, Reno Virtual Direction Multicast for Overlay Networks Suat Mercan & Dr. Murat Yuksel HOTP2P’11.
Receiver-driven Layered Multicast Paper by- Steven McCanne, Van Jacobson and Martin Vetterli – ACM SIGCOMM 1996 Presented By – Manoj Sivakumar.
SIMULATING A MOBILE PEER-TO-PEER NETWORK Simo Sibakov Department of Communications and Networking (Comnet) Helsinki University of Technology Supervisor:
Lecture 1, 1Spring 2003, COM1337/3501Computer Communication Networks Rajmohan Rajaraman COM1337/3501 Textbook: Computer Networks: A Systems Approach, L.
Jani Pousi Supervisor: Jukka Manner Espoo,
EQ-BGP: an efficient inter- domain QoS routing protocol Andrzej Bęben Institute of Telecommunications Warsaw University of Technology,
Coordinate Live Streaming and Storage Sharing for Social Media Content Distribution Authors: Xu Cheng, Jiangchuan Liu, Senior Member, IEEE, Haiyang Wang,
ON DESIGING END-USER MULTICAST FOR MULTIPLE VIDEO SOURCES Y.Nakamura, H.Yamaguchi, A.Hiromori, K.Yasumoto †, T.Higashino and K.Taniguchi Osaka University.
Network Aware Resource Allocation in Distributed Clouds.
Overcast: Reliable Multicasting with an Overlay Network CS294 Paul Burstein 9/15/2003.
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.
Kamal Singh, Árpád Huszák, David Ros, César Viho and Jeney Gábor
Streaming over Subscription Overlay Networks Department of Computer Science Iowa State University.
CING-YU CHU INFOCOM Outline  Introduction  Measurement  Measurement Results  Modeling Skype Behaviors  Analysis on TCP-friendly.
Live Streaming over Subscription Overlay Networks CS587x Lecture Department of Computer Science Iowa State University.
TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.
Impact of Topology on Overlay Multicast Suat Mercan.
Multicast instant channel change in IPTV systems 1.
Enabling Conferencing Applications on the Internet using an Overlay Multicast Architecture Yang-hua Chu, Sanjay Rao, Srini Seshan and Hui Zhang Carnegie.
1 Integrating security in a quality aware multimedia delivery platform Paul Koster 21 november 2001.
2007/03/26OPLAB, NTUIM1 A Proactive Tree Recovery Mechanism for Resilient Overlay Network Networking, IEEE/ACM Transactions on Volume 15, Issue 1, Feb.
Wireless communications and mobile computing conference, p.p , July 2011.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
SocialTube: P2P-assisted Video Sharing in Online Social Networks
UNIVERSITY OF JYVÄSKYLÄ 2005 Multicast Admission Control in DiffServ Networks Department of Mathematical Information Technology University of Jyväskylä.
Network Coordinates : Internet Distance Estimation Jieming ZHU
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.
Sharp Hybrid Adaptive Routing Protocol for Mobile Ad Hoc Networks
An overlay for latency gradated multicasting Anwitaman Datta SCE, NTU Singapore Ion Stoica, Mike Franklin EECS, UC Berkeley
A Comparison of RaDiO and CoDiO over IEEE WLANs May 25 th Jeonghun Noh Deepesh Jain A Comparison of RaDiO and CoDiO over IEEE WLANs.
Gang Wang, Shining Wu, Guodong Wang, Beixing Deng, Xing Li Tsinghua University Tsinghua Univ. Oct Experimental Study on Neighbor Selection Policy.
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.
Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of.
P2MP LSP for IPTV 이동 무선 네트워크 연구실 홍 석 준
A Study of Group-Tree Matching in Large Scale Group Communications
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
Presentation transcript:

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

Outline Introduction Virtual Directional Multicast (VDM) Virtual Distance Performance Evaluation Conclusion

Motivation Increasing bandwidth (127 Kbps(2000) 4.4 Mbps(2010)) Increasing Internet usage 360,985,492(2000) - 1,966,514,816 (2010) High demand for multimedia applications (Internet TV, tele-conference, online education, youtube) A huge amount of internet traffic coming from multimedia (90% of Internet traffic in 2014 according to Cisco) This trend is calling efficient and scalable mechanisms to transfer content to many receivers from a single source

Motivation Various types of multimedia applications Sensitivity of these applications differs against various network performance metrics – delay is crucial for video conferencing which includes interactivity – jitter is important for video streaming – bandwidth is for HDTV

Our Work Responding to these varying application-specific requirements or sensitivities is a key point We define and use the concept of virtual distance for constructing overlay trees We aim to find the most appropriate parent for a peer according to the applications purpose Calculating the virtual distance based on different criteria, but without protocol modification, makes the overlay multicast protocol satisfy different quality expectations for different apps Our key goal is to automatically calculate overlay multicast trees such that they can be seamlessly customized to applications performance goals.

Virtual Direction Multicast (VDM)

Virtual Direction Multicast We embed the virtual distance method in our previous overlay multicast tree protocol, VDM. VDM: – Tree based – Source is alone at the beginning – Tree extends with new joins. – Want to use minimum resource as satisfying end user

Directionality PCPC PC CASE I CASE IICASE III

Join CASE I

Join CASE III CASE I

Join CASE III CASE II

Reconnection Each node knows its grandparent When parent leaves, join process starts at grandparent

Virtual Distance

Round Trip Time (RTT) is used to calculate distances What about loss rate? Delay and loss rate between two nodes may be uncorrelated because of background and cross traffic on routers A peer might experience high loss rate on a good path in terms of delay Sensitivity of multimedia applications differs against various network performance metrics This requires to take other factors into account when building overlay tree

Virtual Distance delay=100ms loss=1% delay=50ms loss=2% Delay-based VDM-D Loss-based VDM-L

Virtual Distance A key property of VDM is the capability of virtualizing the underlying network in different ways It is possible to establish virtual directions based on performance metrics Different values of these metrics may produce different virtual distances and thus different overlay tree We can establish target specific overlay trees to improve some specific performance metrics

Sample Measurement from Akamai website

Information from iPlane Dataset Inter-PoP measurement data sample from iPlane Three points A, B, C d1 = distance (A-B) d2 = distance (B-C) l1 = loss(A-B) l2 = loss(B-C) d1/d2 and l1/l2 are inversely correlated for 44%

Performance Evaluation

We evaluate the performance of VDM-D (delay-based) and VDM-L (loss-based) in order to show the efficiency of the virtual distance concept We analyze protocol behaviors as we vary the churn rate in the overlay network

Simulation Setup NS-2 (Network simulator) 792 nodes in physical network 200 nodes in overlay network Degree of each node between 2-5 Each physical link is assigned error rate between 0% - 2% Run 5,000s Under different churn rates (1% - 20%) Run each simulation 10 times

Simulation Results Stretch Loss VDM optimizes the loss when the virtual distance is based on loss. VDM optimizes the stretch when the virtual distance is based on delay.

Virtual Distance

Conclusions Our key goal is to automatically calculate overlay multicast trees such that they can be seamlessly customized to applications performance goals. VDM-D uses delay for distance estimation, and improves stress and stretch while giving higher loss rate VDM-L achieves better performance in terms of loss rate

Thank you!