ALTO: A Multi Dimensional Peer Selection Problem IETF 73 Saumitra Das

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

1 ISP-Aided Neighbor Selection for P2P Systems Vinay Aggarwal Anja Feldmann, Obi Akonjang,
1 © 2006 Cisco Systems, Inc. All rights reserved. Cisco Confidential Session Number Presentation_ID Next Generation Network Architectures Summary John.
A Presentation by: Noman Shahreyar
Designing a New Routing Simulator for DiffServ MPLS Networks Peng Zhang Zhansong Ma Raimo Kantola {pgzhang, zhansong,
1 An Overview of Gnutella. 2 History The Gnutella network is a fully distributed alternative to the centralized Napster. Initial popularity of the network.
Resilient Peer-to-Peer Streaming Paper by: Venkata N. Padmanabhan Helen J. Wang Philip A. Chou Discussion Leader: Manfred Georg Presented by: Christoph.
0 General information Rate of acceptance 37% Papers from 15 Countries and 5 Geographical Areas –North America 5 –South America 2 –Europe 20 –Asia 2 –Australia.
Network Management Overview IACT 918 July 2004 Gene Awyzio SITACS University of Wollongong.
Gap Analysis of Simplified Use of Policy Abstractions (SUPA) Presenter: Jun Bi draft-bi-supa-gap-analysis-02 IETF 92 SUPA BoF Dallas, TX March 23, 2015.
Traffic Engineering With Traditional IP Routing Protocols
Traffic Engineering Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
An Effective Placement of Detection Systems for Distributed Attack Detection in Large Scale Networks Telecommunication and Security LAB. Dept. of Industrial.
Can ISPs and P2P Users Cooperate for Improved Performance? Vinay Aggarwal, Anja Feldmann (German Telecom Laboratories) Christian Scheideler (TU, Munchen)
Muhammad Mahmudul Islam Ronald Pose Carlo Kopp School of Computer Science & Software Engineering Monash University, Australia.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
A Trust Based Assess Control Framework for P2P File-Sharing System Speaker : Jia-Hui Huang Adviser : Kai-Wei Ke Date : 2004 / 3 / 15.
1 GENI: Global Environment for Network Innovations Jennifer Rexford On behalf of Allison Mankin (NSF)
1 An overview Always Best Connected Networks Dênio Mariz Igor Chaves Thiago Souto Aug, 2004.
UNIVERSITY OF JYVÄSKYLÄ Resource Discovery Using NeuroSearch Presentation for the Agora Center InBCT-seminar Mikko Vapa, researcher InBCT 3.2.
Peer-to-peer file-sharing over mobile ad hoc networks Gang Ding and Bharat Bhargava Department of Computer Sciences Purdue University Pervasive Computing.
IETF P2P Mechanisms Wes Eddy / TSV AD MTI Systems TSVAREA IETF 81 – Quebec City, July 2011.
Server Assisted TRILL Edge Linda Dunbar
Abstraction and Control of Transport Networks (ACTN) BoF
Omniran IEEE 802 Scope of OmniRAN Date: Authors: NameAffiliationPhone Max RiegelNSN
1 ISP-aided Biased Query Search in P2P Systems Vinay Aggarwal and Anja Feldmann Deutsche Telekom Laboratories / TU Berlin Berlin,
Chapter 4. After completion of this chapter, you should be able to: Explain “what is the Internet? And how we connect to the Internet using an ISP. Explain.
ALTO Problem Statement draft-marocco-alto-problem-statement-03 Enrico Marocco Vijay Gurbani 73 rd IETF Meeting.
A Distributed Architecture for Multi-dimensional Indexing and Data Retrieval in Grid Environments Athanasia Asiki, Katerina Doka, Ioannis Konstantinou,
Computer Science Informed Content Delivery Across Adaptive Overlay Networks Overlay networks have emerged as a powerful and highly flexible method for.
1 BitHoc: BitTorrent for wireless ad hoc networks Jointly with: Chadi Barakat Jayeoung Choi Anwar Al Hamra Thierry Turletti EPI PLANETE 28/02/2008 MAESTRO/PLANETE.
P4P: Provider Portal for Applications Haiyong Xie, Y. Richard Yang Arvind Krishnamurthy, Yanbin Liu, Avi Silberschatz SIGCOMM ’08 Hoon-gyu Choi
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.
A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
CSCI 465 D ata Communications and Networks Lecture 15 Martin van Bommel CSCI 465 Data Communications & Networks 1.
CCNA Guide to Cisco Networking Fundamentals Fourth Edition
ALTO BOF Charter Discussion. Charter Iterated (twice) on the list  Several comments on the first version Terminology, caching  No complains on current.
A Mechanized Model for CAN Protocols Context and objectives Our mechanized model Results Conclusions and Future Works Francesco Bongiovanni and Ludovic.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429/556 Introduction to Computer Networks Inter-domain routing Some slides used with.
Efficient Semantic Based Content Search in P2P Network Heng Tao Shen, Yan Feng Shu, and Bei Yu.
Resilient Overlay Networks Robert Morris Frans Kaashoek and Hari Balakrishnan MIT LCS
TSV P2P Efforts – From an ISP’s Perspective Richard Woundy DECADE and CDNI co-chair.
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.
IETF 67 – SIMPLE WG SIMPLE Problem Statement Draft-rang-simple-problem-statement-01 Tim Rang - Microsoft Avshalom Houri – IBM Edwin Aoki – AOL.
IT and Network Organization Ecommerce. IT and Network Organization OPTIMIZING INTERNAL COLLABORATIONS IN NETWORK ORGANIZATIONS.
Evaluation of a Novel Two-Step Server Selection Metric Presented by Karthik Lakshminarayanan
P2P Search COP6731 Advanced Database Systems. P2P Computing  Powerful personal computer Share computing resources P2P Computing  Advantages: Shared.
P2P Search COP P2P Search Techniques Centralized P2P systems  e.g. Napster, Decentralized & unstructured P2P systems  e.g. Gnutella.
11 ROUTING IP Chapter 3. Chapter 3: ROUTING IP2 CHAPTER INTRODUCTION  Understand the function of a router.  Understand the structure of a routing table.
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
CMSC 691B Multi-Agent System A Scalable Architecture for Peer to Peer Agent by Naveen Srinivasan.
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.
CONNECTING TO THE INTERNET THROUGH ISP. WHAT IS INTERNET? The Internet is a worldwide collection of computer networks, cooperating with each other to.
Content-centric routing in Wi-Fi direct multi-group networks Claudio Casetti, Carla Fabiana Chiasserini, Luciano Curto Pelle, Carolina Del Valle, Yufeng.
Composing Web Services and P2P Infrastructure. PRESENTATION FLOW Related Works Paper Idea Our Project Infrastructure.
COMP8330/7330/7336 Advanced Parallel and Distributed Computing Communication Costs in Parallel Machines Dr. Xiao Qin Auburn University
P4P: Proactive Provider Assistance for P2P Haiyong Xie Yale University.
Auction-based in-network caching in Information-centric networks Workshop ACROSS, 16th of September 2016 | Lucia D’Acunto.
P4P : Provider Portal for (P2P) Applications Haiyong Xie, Y
Network Cost Services for Network-Aware FI Applications
Zueyong Zhu† and J. William Atwood‡
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
A Scalable content-addressable network
P4P: ISPs and P2P Laird Popkin, Pando Networks Doug Pasko, Verizon.
Data and Computer Communications
Congestion control and the P2P value chain
Presentation transcript:

ALTO: A Multi Dimensional Peer Selection Problem IETF 73 Saumitra Das

Peer selection The peer selection problem is applicable to various aspects of p2p systems – Picking a peer for content download – Neighbor selection – Picking a super peer, mirror, TURN server, the best semantic next hop for a query, etc. The information needed to assist peer selection in each of these is likely quite different – Performance metrics(Bandwidth etc), network coordinate, services offered, network impact, Cost, etc. However, a common framework for such information exchange is very feasible and has exactly two aspects to it – Information exchange between the peers and the network – Information exchange among peers ALTO should define this common framework and potentially standardize a subset of the information types itself – Create a registry for other information types to be registered later

Inputs for peer selection information Peers – Peers publish information about general application agnostic parameters such as Bandwidth Link type Virtual coordinates Network – Network operators publish information about network impact of peer selection P-distance

Peer input not enough Goal – Optimize data transfer performance Leads to – Traffic crosses network boundaries multiple times

ISP input not enough Some of the information needed may not be available to the ISP ISP’s goals are to – Minimize congestion near hotspots – Minimize interdomain traffic That leads to – ISP cost reduction not always tied to improved application performance All hosts within the ISP are DSL or overloaded Geographically close peers with different access network

Overall Design goals ISPs provide information Peers provide information – e.g. bw, link type, GNP coordinate, services Applications makes decision based on these two inputs Benefits – Presence of both types of information important for spurring adoption – Common reusable information plane available across applications and reduces overhead

Multidimensional ALTO Steps needed for multi-dimensional ALTO – ALTO service discovery – ALTO information publication framework – ALTO service query Network location identifier to ALTO service identifer – Maybe be ALTO service specific Set of ALTO service identifier pairs – May have complex query for metric of interest – ALTO service response Metrics annotated with ALTO service identifer pairs – May be ALTO service specific

Design Recommendations The ALTO service should accommodate specific hosts providing network topology information The ALTO service should allow peers to publish ALTO related information in an application agnostic manner The ALTO service should allow for both centralized and distributed service models The ALTO protocols should be agnostic to the actual peer selection algorithm in use The ALTO protocols should be generic to allow any type of information useful for performing ALTO services to be exchanged. The ALTO protocols should be extensible to allow carrying new types of information that may be defined at a future point

Summary Let’s design the ALTO query and response to be extensible and enable a variety of peer selection services – Potentially leave publication framework as future work