Unconditional localisation? Bob Briscoe Response to ALTO BoF Jul 2008.

Slides:



Advertisements
Similar presentations
P4P: ISPs and P2P Laird Popkin, Pando Networks Doug Pasko, Verizon.
Advertisements

Chador Wangdi Page 1of15. Analog (up to 56k/ dial up access) Using a modem connected to your PC, users connect to the internet when the computer dials.
Any Questions?.
TYPES; 1. Analog Analog 2. ISDN ISDN 3. B-ISDN B-ISDN 4. DSL DSL 5. ADSL ADSL 6. SDSL SDSL 7. VDSL VDSL 8. CABLE CABLE 9. Wireless Wireless 10. T-1 lines.
2014 BAHRAIN EXPERIENCE WITH BROADBAND QUALITY OF SERVICE Eric Dunand.
Chabot College Chapter 2 Review Questions Semester IIIELEC Semester III ELEC
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
July 2003SPECTS Network-Level Impacts on User-Level Web Performance Carey Williamson Nayden Markatchev University of Calgary.
James 1:5 If any of you lacks wisdom, he should ask God, who gives generously to all without finding fault, and it will be given to him.
Can ISPs and P2P Users Cooperate for Improved Performance? Vinay Aggarwal, Anja Feldmann (German Telecom Laboratories) Christian Scheideler (TU, Munchen)
© 2008 Nokia V1-Filename.ppt / YYYY-MM-DD / Initials 1 Dealing with P2P Traffic in an Operator Network: State-of-the-Art Hannes Tschofenig Marcin Matuszewski.
CS335 Networking & Network Administration Tuesday, May 18, 2010.
Lecture 1 Internet Overview: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  network structure,
Lecture Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  network structure,
Computer Networks Transport Layer. Topics F Introduction  F Connection Issues F TCP.
Ch. 28 Q and A IS 333 Spring Q1 Q: What is network latency? 1.Changes in delay and duration of the changes 2.time required to transfer data across.
Types of Internet Connections
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.
Jennifer Rexford Fall 2010 (TTh 1:30-2:50 in COS 302) COS 561: Advanced Computer Networks Stub.
Types of Broadband. Learning Objectives: By the end of this topic you should be able to: compare different types of broadband connection and give suitable.
Power point presentation on internet Presentation by: Tenzin wangda.
Lawrence G. Roberts CEO Anagran September 2005 Advances Toward Economic and Efficient Terabit LANs and WANs.
Lecture 1 Internet CPE 401 / 601 Computer Network Systems slides are modified from Dave Hollinger and Daniel Zappala Lecture 1 Introduction.
APPA Community Broadband Conference ISP Network Challenges Peer-to-Peer Controls Mark Bailey, Channel Manager.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
RSC Part I: Introduction Redes y Servicios de Comunicaciones Universidad Carlos III de Madrid These slides are, mainly, part of the companion slides to.
Introduction Chapter 1 Introduction Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross Addison-Wesley,
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.
Instructor: Christopher Cole Some slides taken from Kurose & Ross book IT 347: Chapter 1.
IP is a Network Layer Protocol Physical 1 Network DataLink 1 Transport Application Session Presentation Network Physical 1 DataLink 1 Physical 2 DataLink.
Networks for Distributed Systems n network types n Connection-oriented and connectionless communication n switching technologies l circuit l packet.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
1 Back to Slide 7. 2 Also called dial-up access, it is both economical and slow. Using a modem connected to your PC, users can connect to the Internet.
P4P: Provider Portal for Applications Haiyong Xie, Y. Richard Yang Arvind Krishnamurthy, Yanbin Liu, Avi Silberschatz SIGCOMM ’08 Hoon-gyu Choi
Introduction Switches and Access. 2 Chapter 1 Introduction Computer Networking: A Top Down Approach Featuring the Internet, 5 rd edition. Jim.
Peering Policies - When to Peer, When not to Peer Quilt Peering Workshop October 2006 St Louis, Missouri.
Chapter 3 Transport Layer
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
Presented by Rajan Includes slides presented by Andrew Sprouse, Northeastern University CISC 856 TCP/IP and Upper Layer Protocols Date:May 03, 2011.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 4 Switching Concepts.
Congestion exposure BoF candidate protocol: re-ECN Bob Briscoe Chief Researcher, BT Nov 2009 This work is partly funded by Trilogy, a research project.
Next Steps P2P Infrastructure Workshop May 28, 2008.
Some questions about multipath Damon Wischik, UCL Trilogy UCL.
Solving this Internet resource sharing problem... and the next, and the next Bob Briscoe Chief Researcher BT Group (& UCL) Lou Burness, Toby Moncaster,
Interconnect QoS settlements & impairments Bob Briscoe BT Group CTO.
1 7-Jan-16 S Ward Abingdon and Witney College Dynamic Routing CCNA Exploration Semester 2 Chapter 3.
정하경 MMLAB Fundamentals of Internet Measurement: a Tutorial Nevil Brownlee, Chris Lossley, “Fundamentals of Internet Measurement: a Tutorial,” CMG journal.
Explicit Allocation of Best-Effort Service Goal: Allocate different rates to different users during congestion Can charge different prices to different.
© Lehr Interconnection WG Plans and Activities -- what interested in? * all things interconnection related so -- QoS (congestion mgmt), Net.
CONNECTING TO THE INTERNET THROUGH ISP. WHAT IS INTERNET? The Internet is a worldwide collection of computer networks, cooperating with each other to.
ALTO: A Multi Dimensional Peer Selection Problem IETF 73 Saumitra Das
A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their original slides that accompany the.
Carrier/Network Perspectives Cross-Layer Optimization (CLO) Bar Bof
Accelerating Peer-to-Peer Networks for Video Streaming
Computer Networks Routing Algorithms.
Part 0: Networking Review
A Taxonomy of Communication Networks
Network Layer.
Ken Gunnells, Ph.D. - Networking Paul Crigler - Programming
ISP and Egress Path Selection for Multihomed Networks
CPE 401 / 601 Computer Network Systems
P4P: ISPs and P2P Laird Popkin, Pando Networks Doug Pasko, Verizon.
COS 561: Advanced Computer Networks
UNIT I – FRAME RELAY AND ISDN
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
GETTING CONNECTED TO INTERNET
BGP Interactions Jennifer Rexford
Types of Access.
Chapter 1 Introduction Computer Networking: A Top Down Approach
Presentation transcript:

unconditional localisation? Bob Briscoe Response to ALTO BoF Jul 2008

localisation NOT consistently desirable whether by AS count, hop count, RTT,... for ISPs (slide #3) –using an interconnect path may impact other users less and not cost more a)upstream backhaul link in some access technologies (e.g DSL) the upstream backhaul is never congested – it's typically a symmetric link fed by an asymmetric access retail ISPs often lease this link without any upstream usage penalties b)interconnect if interconnect charging is based on 95 th percentile and it's currently not near the 95 th percentile or if interconnect is based on a peering contract which only requires the balance of volume transferred between networks to be checked at peak times, and it's currently not a peak time for users & apps (slide #4) with newer cc algos, longer RTT hardly requires slower rate desire for shorter RTT to get higher rate will go away

back -haul ISPs could prefer inter-domain path tier 3 ISP tier 2 ISP DSL access cable access radio access link bold = typical shared congestion router home/office/personal net remote access server access multiplexer (DSLAM, HFC-node, base station, etc) backhaul core interconnect a b d c often cost or congestion a+b << c+d

lower RTT isn't nearly as good as we thought for long-lived flows app desire for localisation is artefact of TCP algo TCP average rate depends on 1 / RTT (for similarly congested paths) modern congestion control algos don't do this FAST TCP [Jin04], BitTorrent DNA (rate-based mode) for stability, doesn't rate need to depend on 1 / RTT ? No. Research agrees only acceleration needs to Equilibrium rate can be independent of RTT peer 1 (baseline) peer 2 congestion1%0.5% RTT50ms200ms TCPx1x0.35 FAST TCPx1x2

what metric judges 'better'? NOT lower inter-domain traffic (necessarily) if at the cost of more local upstream congestion NOT faster p2p downloads (necessarily) if at the expense of slower downloads for non-P2P users

closing message localisation is only desirable conditionally over some inter-domain paths, at some times, with some transports updating an inter-domain oracle for dynamic path-specific info is not proven feasible hard even for a single residential ISP –e.g. 20M access lines => 20M 2 paths (400,000,000,000,000 paths) –and that doesn't include home network segments –even edge-edge, 7,000 access multiplexers => 50M paths for inter-domain oracles, 100M muxes => 100,000,000,000,000,000 edge-edge paths nonetheless, topology-based heuristics modified by static policy (e.g. P4P) are perhaps 'better' than random guesses but "localisation is good" MUST NOT be the goal that will lead to the DISINTERNET localisation would be easy,... but if it's NOT the goal is an oracle appropriate for standards activity or only for more research?