Application-level versus Network-level Proximity Mohammad Malli PhD student Planete Project, INRIA - Sophia Antipolis France.

Slides:



Advertisements
Similar presentations
Network Resource Broker for IPTV in Cloud Computing Lei Liang, Dan He University of Surrey, UK OGF 27, G2C Workshop 15 Oct 2009 Banff,
Advertisements

Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 1 Department of Information Engineering University of Pisa Network Telecomunication.
Virtual Distance: A Generalized Metric for Overlay Tree Construction ISCC12 July Suat Mercan (Zirve University) & Murat Yuksel (University of Nevada,
Rarest First and Choke Algorithms are Enough Arnaud LEGOUT INRIA, Sophia Antipolis France G. Urvoy-Keller and P. Michiardi Institut Eurecom France.
Clayton Sullivan PEER-TO-PEER NETWORKS. INTRODUCTION What is a Peer-To-Peer Network A Peer Application Overlay Network Network Architecture and System.
Cooperative Overlay Networking for Streaming Media Content Feng Wang 1, Jiangchuan Liu 1, Kui Wu 2 1 School of Computing Science, Simon Fraser University.
Distributed Slicing in Dynamic Systems A. Fernández, V. Gramoli, E. Jiménez, A-M. Kermarrec, M. Raynal.
Clustering and Sharing Incentives in BitTorrent Systems Arnaud Legout 1, Nikitas Liogkas 2, Eddie Kohler 2, Lixia Zhang 2 1 INRIA, Projet Planète, Sophia.
1 Considering Priority in Overlay Multicast Protocols under Heterogeneous Environments Michael Bishop, Sanjay Rao – Purdue University Kunwadee Sripanidkulchai.
Farnoush Banaei-Kashani and Cyrus Shahabi Criticality-based Analysis and Design of Unstructured P2P Networks as “ Complex Systems ” Mohammad Al-Rifai.
Maximizing End-to-End Network Performance Thomas Hacker University of Michigan October 5, 2001.
Fair queueing and congestion control Jim Roberts (France Telecom) Joint work with Jordan Augé Workshop on Congestion Control Hamilton Institute, Sept 2005.
June 3, A New Multipath Routing Protocol for Ad Hoc Wireless Networks Amit Gupta and Amit Vyas.
Nearest Neighborhood Search in Motion Planning Lakshmi Reddy B Advisor: Nancy M. Amato Parasol lab Department of Computer Science Texas A&M University.
IPlane: An Information Plane for Distributed Services Offence by: Anup Goyal Sagar Vemuri.
The Organic Grid: Self- Organizing Computation on a Peer-to-Peer Network Presented by : Xuan Lin.
Comparing flow-oblivious and flow-aware adaptive routing Sara Oueslati and Jim Roberts France Telecom R&D CISS 2006 Princeton March 2006.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of.
1 Network Tomography Venkat Padmanabhan Lili Qiu MSR Tab Meeting 22 Oct 2001.
1 Energy-Efficient localization for networks of underwater drifters Diba Mirza Curt Schurgers Department of Electrical and Computer Engineering.
Multiple Sender Distributed Video Streaming Thinh Nguyen, Avideh Zakhor appears on “IEEE Transactions On Multimedia, vol. 6, no. 2, April, 2004”
Distributed Slicing in Dynamic Systems A. Fernández, V. Gramoli, E. Jiménez, A-M. Kermarrec, M. Raynal.
The Impact of Spatial Correlation on Routing with Compression in WSN Sundeep Pattem, Bhaskar Krishnamachri, Ramesh Govindan University of Southern California.
PAM A Measurement Study of Internet Delay Asymmetry Abhinav PathakPurdue University Himabindu PuchaPurdue University Ying ZhangUniversity of Michigan.
1 TCP-LP: A Distributed Algorithm for Low Priority Data Transfer Aleksandar Kuzmanovic, Edward W. Knightly Department of Electrical and Computer Engineering.
Network-Aware Operator Placement for Stream-Processing Systems CS253 project presentation Min Chen, Danhua Guo {michen, 12/4/2006.
Characterizing and Predicting TCP Throughput on the Wide Area Network Dong Lu, Yi Qiao, Peter Dinda, Fabian Bustamante Department of Computer Science Northwestern.
1 Internet Management and Security We will look at management and security of networks and systems. Systems: The end nodes of the Internet Network: The.
Amir Rasti Daniel Stutzbach Reza Rejaie The ION P2P Project University of Oregon On the Long-term Evolution of the Two-Tier.
Web Caching and CDNs March 3, Content Distribution Motivation –Network path from server to client is slow/congested –Web server is overloaded Web.
PCP: Efficient Endpoint Congestion Control To appear in NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
TCP Behavior across Multihop Wireless Networks and the Wired Internet Kaixin Xu, Sang Bae, Mario Gerla, Sungwook Lee Computer Science Department University.
Delay Analysis of Large-scale Wireless Sensor Networks Jun Yin, Dominican University, River Forest, IL, USA, Yun Wang, Southern Illinois University Edwardsville,
Chapter 2, slide: 1 CS 372 – introduction to computer networks* Monday June 28 Announcements: r Lab 1 is due today r Lab 2 is posted today and is due next.
09/07/2004Peer-to-Peer Systems in Mobile Ad-hoc Networks 1 Lookup Service for Peer-to-Peer Systems in Mobile Ad-hoc Networks M. Tech Project Presentation.
CS An Overlay Routing Scheme For Moving Large Files Su Zhang Kai Xu.
Computer Science Informed Content Delivery Across Adaptive Overlay Networks Overlay networks have emerged as a powerful and highly flexible method for.
What makes a network good? Ch 2.1: Principles of Network Apps 2: Application Layer1.
Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths Mugurel Ionut Andreica Polytechnic University of Bucharest Computer.
Maximizing End-to-End Network Performance Thomas Hacker University of Michigan October 26, 2001.
Resilient Peer-to-Peer Streaming Presented by: Yun Teng.
An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.
1 Mobility Increases the Capacity of Ad-hoc Wireless Networks Matthias Grossglauser, David Tse IEEE Infocom 2001 (Best paper award) Oct 21, 2004 Som C.
On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing Argyrios Tasiopoulos MSc, student, AUEB Master Thesis presentation.
PRoPHET+: An Adaptive PRoPHET- Based Routing Protocol for Opportunistic Network Ting-Kai Huang, Chia-Keng Lee and Ling-Jyh Chen.
CSE 6590 Fall 2009 Routing Metrics for Wireless Mesh Networks 1 12 November, 2015.
TCP with Variance Control for Multihop IEEE Wireless Networks Jiwei Chen, Mario Gerla, Yeng-zhong Lee.
Analysis of TCP Latency over Wireless Links Supporting FEC/ARQ-SR for Error Recovery Raja Abdelmoumen, Mohammad Malli, Chadi Barakat PLANETE group, INRIA.
Integration of QoS-enabled Distributed Object Computing Middleware for Developing Next- Generation Distributed Applications By Krishnamurthy et Al. Presented.
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.
PCP: Efficient Endpoint Congestion Control NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of Washington.
Data Indexing in Peer- to-Peer DHT Networks Garces-Erice, P.A.Felber, E.W.Biersack, G.Urvoy-Keller, K.W.Ross ICDCS 2004.
Topologically-Aware Overlay Construction and Sever Selection Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker.
LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan M. Frans Kaashoek David Karger Robert Morris Ion Stoica MIT LCS.
Internet Measurement and Analysis Vinay Ribeiro Shriram Sarvotham Rolf Riedi Richard Baraniuk Rice University.
Communications Range Analysis Simulation Set Up –Single Biological Threat placed in Soldier Field –Communication range varied from meters –Sensor.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
Proposal Presentation Inferring Geographic proximity of the Internet Node using a Compound Metric M. Kamran Nishat.
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Optimal Relay Placement for Indoor Sensor Networks Cuiyao Xue †, Yanmin Zhu †, Lei Ni †, Minglu Li †, Bo Li ‡ † Shanghai Jiao Tong University ‡ HK University.
/ 24 1 Deploying Wireless Sensors to Achieve Both Coverage and Connectivity Xiaole Bai Santosh Kumar Dong Xuan Computer Science and Engineering The Ohio.
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications * CS587x Lecture Department of Computer Science Iowa State University *I. Stoica,
Nuno Salta Supervisor: Manuel Ricardo Supervisor: Ricardo Morla
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
Department of Computer Science University of York
Small Is Not Always Beautiful
ONLINE TOURISM MARKETING- Introduction
Presentation transcript:

Application-level versus Network-level Proximity Mohammad Malli PhD student Planete Project, INRIA - Sophia Antipolis France

December 15, Introduction In P2P and CDN, the characterization of the proximity is very important for identifying the best peer to contact or to take as neighbor Our problem is to study how to characterize efficiently this proximity

December 15, Motivation Most of existing protocols rely on the delay for characterizing the proximity of peers Using the delay closest peer as the best peer hides the implicit assumption that the path with the nearest peer has the largest available bandwidth and the smallest loss rate

December 15, Questions Q1. is the delay correlated with other network path parameters ? Q2. does its use approximate the use of the others ? Q3. How much is the performance degradation for applications relying on the delay proximity ?

December 15, Measurement scenario We try to answer these questions using measurements runned over the Planetlab plateform. 127 nodes, spread over the Internet covering America, EU, and Asia, are used. The network characteristics is measured for more than 16k paths.

December 15, Delay vs. available bandwidth 12 % of peers have the maximum available bandwidth on their path with the nearest peer Correlation coefficient between these two parameters is – Slow decrease of the available bw with the delay-based peer rank

December 15, Delay vs. loss rate 88 % of peers have the minimum loss rate on their path with the nearest peer When moving farer in the delay space, the loss rate increases rapidely

December 15, Impact of delay proximity on application performance The weak correlation obtained between the delay and the other path parameters motivates us to evaluate the performance degradation of applications when the proximity is characterized based on the delay alone To this end, we consider two typical applications File transfer over TCP Interactive audio service

December 15, File transfer over TCP We compute the degradation of the transfer time compared to the optimal ranking : File size increases => degradation increases

December 15, Interactive audio service We compute the speech rating factor : Delay proximity => medium audio quality for the 7 closest peers and low quality for the remaining 3 others

December 15, Conclusions Delay is a poor predictor for quality for many applications This can be interpreted by the low correlation obtained between the delay and the other network path parameters Now, we focus on how to deploy the application-level proximity without loosing the scalability

December 15, Thank you Q & A