8/28/2003 SIGCOMM '2003 2
|
|
|
- Darren Freeman
- 5 years ago
- Views:
Transcription
1 On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs Research) Scott Shenker (ICSI) ACM SIGCOMM 2003 Presented by Giang Nguyen Adapted from Slides by Lili Qiu
2 Selfish Routing IP routing is often sub-optimal in terms of user performance Many causes policy routing, failures, instability -> Emerging trend: Autonomous routing End users choose their own routes Source routing (e.g. Nimrod) Overlay routing (e.g. Detour, RON) is selfish by nature End hosts or routing overlays greedily select routes to optimize their own performance without considering systemwide criteria Roughgarden proved: for general latency functions (eg, M/M/1) and topologies, the worst-case ratio between the total latency of selfish routing and that of the global optima can be unbounded. But other theoretical works (eg, Friedman) have also shown the degradation is less severe in some perspectives. 8/28/2003 SIGCOMM '2003 2
3 1. Selfish source routing Questions How does selfish source routing perform? Are Internet-like environments among the worst cases? 2. Selfish overlay routing How does selfish overlay routing perform? Note that routing on an overlay has much less flexibility than routing directly on the physical network. 3. Horizontal interactions Does selfish traffic co-exist well with compliant traffic? Do selfish overlays co-exist well with each other? 4. Vertical interactions How does selfish traffic interact with the underlying network control process, i.e. traffic engineering? 8/28/2003 SIGCOMM '2003 3
4 Routing Schemes Routing on the physical network Source routing Latency optimal routing Routing on an overlay (less flexible!) Overlay source routing Overlay latency optimal routing Cooperative within an overlay, but selfish across overlays Compliant (i.e. default) routing: OSPF Hop count, i.e. unit weight Optimized weights Minimize network cost [FRT02] Random weights 8/28/2003 SIGCOMM '2003 4
5 Our Approach We take a game-theoretic approach to partially answer these questions through simulations Metrics: avg user latency, max system link utilization, and network costs. Algorithms to compute metrics of selfish and optimal routing. Simulate to find metrics of compliant routing. M/M/1 latency function (others yield similar results). Focus on intra-domain environments Compare against theoretical worst-case results Can use realistic topologies and traffic demands 8/28/2003 SIGCOMM '2003 5
6 1. Selfish Source Routing: Average Latency Average latency (us) Abovenet ATT EBONE Exodus Level3 Sprint Telstra Tiscali Verio PowerD2 PowerD5 PowerD10 Load scale factor=1 selfish source routing latency optimal routing compliant routing (minimum network cost) Good news: Internet-like environments are far from the worst cases for selfish source routing 8/28/2003 SIGCOMM '2003 6
7 Selfish Source Routing (cont): Network Cost Network cost Abovenet ATT EBONE Exodus Level3 Sprint Telstra Tiscali Verio PowerD2 PowerD5 PowerD10 selfish source Load scale routing factor=1 latency optimal routing compliant routing (minimum network cost) Bad news: Low latency comes at much higher network cost 8/28/2003 SIGCOMM '2003 7
8 Selfish Overlay Routing and Horizontal Interactions Similar results Selfish overlay routing Close to optimal average latency at higher network cost. Similar results whether overlay covers all physical nodes, or random (20-100%), or only edge nodes. Horizontal interactions Selfish overlays and compliant traffic can coexist. Multiple selfish overlays can co-exist. 8/28/2003 SIGCOMM '2003 8
9 4. Vertical Interactions Vertical interaction: An iterative process between two players Traffic engineering: minimize network cost current traffic pattern new routing matrix Selfish overlays: minimize user latency current routing matrix new traffic pattern Question: Will the system reach a state with both low latency and low network cost? Short Answer: It depends on how much control physical routing has. 8/28/2003 SIGCOMM '2003 9
10 Average latency (us) Selfish Overlays vs. OSPF Optimizer 2.5E E E E E E Round Max link utilization (%) Round selfish alone TE alone selfish alone TE alone selfish + TE (OSPF) selfish + TE (OSPF) OSPF optimizer interacts poorly with selfish overlays because it only has very coarse-grained control. 8/28/2003 SIGCOMM '
11 Selfish Overlays vs. MPLS Optimizer Average latency (us) 1.4E E E E E E E+03 Max link utilization (%) E Round Round selfish alone TE alone selfish + TE (MPLS) selfish alone TE alone selfish + TE (MPLS) MPLS optimizer interacts with selfish overlays much more effectively. 8/28/2003 SIGCOMM '
12 Conclusions Formulate a set of important research questions on selfish routing Use game theory and simulations to partially answer them in the intra-domain context A number of interesting findings In contrast to the theoretical worst cases, selfish routing achieves close to optimal latency in Internet-like environments. Selfish overlays co-exist well both with each other and with traffic using default IP routing. Mismatch between objectives of selfish overlays and traffic engineering has significant impact on system performance. 8/28/2003 SIGCOMM '
On Selfish Routing in Internet-Like Environments
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. X, NO. X, APRIL 24 1 On Selfish Routing in Internet-Like Environments Lili Qiu, Member, IEEE, Yang Richard Yang, Member, IEEE, Yin Zhang, Member, IEEE, and Scott
On Selfish Routing in Internet-Like Environments
On Selfish Routing in Internet-Like Environments Lili Qiu Yang Richard Yang Yin Zhang Scott Shenker Microsoft Research Yale University AT&T Labs Research ICSI liliq@microsoft.com yry@cs.yale.edu yzhang@research.att.com
On Selfish Routing in Internet-Like Environments
1 On Selfish Routing in Internet-Like Environments Lili Qiu Yang Richard Yang Yin Zhang Scott Shenker UT Austin Yale University UT Austin UC Berkeley lili@cs.utexas.edu yry@cs.yale.edu yzhang@cs.utexas.edu
Network games. Brighten Godfrey CS 538 September slides by Brighten Godfrey unless otherwise noted
Network games Brighten Godfrey CS 538 September 27 2011 slides 2010-2011 by Brighten Godfrey unless otherwise noted Demo Game theory basics Games & networks: a natural fit Game theory Studies strategic
Analysing Latency and Link Utilization of Selfish Overlay Routing
International Journal of Computer Science & Communication Vol. 1, No. 1, January-June 2010, pp. 143-147 S. Prayla Shyry1 & V. Ramachandran2 Research Scholar, Sathyabama University, Chennai, India Professor,
On Self Adaptive Routing in Dynamic Environments An Evaluation and Design Using a Simple, Probabilistic Scheme
On Self Adaptive Routing in Dynamic Environments An Evaluation and Design Using a Simple, Probabilistic Scheme Haiyong Xie, Lili Qiu, Yang Richard Yang, and Yin Zhang Computer Science Department, Yale
Optimal Topology Design for Overlay Networks
Optimal Topology Design for Overlay Networks Mina Kamel 1, Caterina Scoglio 1, and Todd Easton 2 1 Electrical and computer Engineering Department 2 Industrial and Manufacturing Systems Engineering Department
Network Delay Model for Overlay Network Application
, 2009, 5, 400-406 doi:10.4236/ijcns.2009.25045 Published Online August 2009 (http://www.scirp.org/journal/ijcns/). Network Delay Model for Overlay Network Application Tian JIN, Haiyan JIN School of Electronics
Incentive-Aware Routing in DTNs
Incentive-Aware Routing in DTNs Upendra Shevade Han Hee Song Lili Qiu Yin Zhang The University of Texas at Austin IEEE ICNP 2008 October 22, 2008 1 DTNs Disruption tolerant networks No contemporaneous
Introduction. Routing & Addressing: Multihoming 10/25/04. The two SIGCOMM papers. A Comparison of Overlay Routing and Multihoming Route Control
Introduction Routing & Addressing: Multihoming 10/25/04 Hong Tat Tong Two attempts to control/ensure best performance over the Internet Multihoming from the endpoints Overlay with some help from middle-boxes
Routing Support for Wide Area Network Mobility. Z. Morley Mao Associate Professor Computer Science and Engineering University of Michigan
Routing Support for Wide Area Network Mobility Z. Morley Mao Associate Professor Computer Science and Engineering University of Michigan 1 Outline Introduction Inter-AS Mobility Support Intra-AS Mobility
Traffic Engineering with Estimated Traffic Matrices
Traffic Engineering with Estimated Traffic Matrices Matthew Roughan Mikkel Thorup Yin Zhang www.research.att.com/~roughan www.research.att.com/~mthorup www.research.att.com/~yzhang Shannon Lab AT&T Research
On the Stability of Virtual Network Topology Control for Overlay Routing Services
On the Stability of Virtual Network Topology Control for Overlay Routing Services (Invited Paper) Yuki Koizumi, Takashi Miyamura, Shin ichi Arakawa, Eiji Oki, Kohei Shiomoto and Masayuki Murata Graduate
How Bad is Selfish Routing?
How Bad is Selfish Routing? Tim Roughgarden and Éva Tardos Presented by Brighten Godfrey 1 Game Theory Two or more players For each player, a set of strategies For each combination of played strategies,
Improving the Interaction between Overlay Routing and Traffic Engineering
Improving the Interaction between Overlay Routing and Traffic Engineering Gene Moo Lee 1 and Taehwan Choi 2 1 Samsung Advanced Initute of Technology Yongin-si, Gyeonggi-do, 446-712, Korea gene.lee@samsung.com
Internet Routing. Shortest-Path Routing. Intra-Domain Routing and Traffic Engineering. Two-Tiered Internet Routing System
Intra-Domain Routing and Traffic Engineering Review of Internet routing paradigm and routing algorithms/protocols Intra-domain routing design topology design, convergence, stability, Traffic Engineering
Hot Potatoes Heat Up BGP Routing
Hot Potatoes Heat Up BGP Routing Renata Teixeira Laboratoire d Informatique de Paris 6 Université Pierre et Marie Curie Amsterdam Internet Routing Architecture Verio AT&T AOL Web Server UCSD Sprint User
Cooperative Content Distribution and Traffic Engineering
Cooperative Content Distribution and Traffic Engineering Wenjie Jiang, Rui Zhang-Shen, Jennifer Rexford, Mung Chiang Department of Computer Science, and Department of Electrical Engineering Princeton University
Load Balancing for Multiple Traffic Matrices Using SDN Hybrid Routing
204 IEEE 5th International Conference on High Performance Switching and Routing (HPSR) Load Balancing for Multiple Traffic Matrices Using SDN Hybrid Routing Junjie Zhang, Kang Xi, Min Luo, H. Jonathan
Load Balancing for Multiple Traffic Matrices Using SDN Hybrid Routing
Load Balancing for Multiple Traffic Matrices Using SDN Hybrid Routing Junjie Zhang, Kang Xi, Min Luo, H. Jonathan Chao New York University Huawei Technologies junjie.zhang@nyu.edu, kang.xi@nyu.edu, min.ch.luo@huawei.com,
Throughput Guaranteed Restorable Routing Without Traffic Prediction
Throughput Guaranteed Restorable Routing Without Traffic Prediction M. Kodialam T. V. Lakshman Sudipta Sengupta Bell Laboratories, Lucent Technologies, NJ, USA Abstract Two-phase routing, where traffic
Routing. Problem: Given more than one path from source to destination, Features: Architecture Algorithms Implementation Performance
Routing Problem: Given more than one path from source to destination, which one to take? Features: Architecture Algorithms Implementation Performance Architecture Hierarchical routing: Internet: intra-domain
On the Interaction Between Overlay Routing and Traffic Engineering
On the Interaction Between Overlay Routing and Traffic Engineering Yong Liu, Honggang Zhang, Weibo Gong and Don Towsley Computer Science Department University of Massachusetts, Amherst Amherst, MA, 13
On the Interaction Between Overlay Routing and Underlay Routing
On the Interaction Between Overlay Routing and Underlay Routing Yong Liu, Honggang Zhang, Weibo Gong and Don Towsley Computer Science Department University of Massachusetts, Amherst Amherst, MA, 13 {yongliu,honggang,towsley}@cs.umass.edu
Inferring Link Weights using End-to-End Measurements
Inferring Link Weights using End-to-End Measurements Ratul Mahajan Neil Spring David Wetherall Tom Anderson University of Washington Abstract We describe a novel constraint-based approach to approximate
Introduction to Game Theory
Lecture Introduction to Game Theory March 30, 005 Lecturer: Anna R. Karlin Notes: Atri Rudra In this course we will look at problems and issues which fall in the intersection of Computer Science and Economics.
Designing Infrastructure-based Overlay Networks for Delay-sensitive Group Communications
Designing Infrastructure-based Overlay Networks for Delay-sensitive Group Communications Shaoyu Yang, Yoo-Ah Kim and Bing Wang Computer Science & Engineering Department University of Connecticut, Storrs,
Mechanisms for Internet Routing: A Study 1
Mechanisms for Internet Routing: A Study 1 Aditya Akella Shuchi Chawla 3 Srini Seshan 4 July, 00 CMU-CS-0-163 School of Computer Science Carnegie Mellon University Pittsburgh, PA 1513 Abstract In this
A Configuration-only Approach to FIB Reduction. Paul Francis Hitesh Ballani, Tuan Cao Cornell
A Configuration-only Approach to FIB Reduction Paul Francis Hitesh Ballani, Tuan Cao Cornell Virtual Aggregation An approach to shrinking FIBs (and RIBs) In interface-card FIB, maybe control-card RIB Works
QoS Services with Dynamic Packet State
QoS Services with Dynamic Packet State Ion Stoica Carnegie Mellon University (joint work with Hui Zhang and Scott Shenker) Today s Internet Service: best-effort datagram delivery Architecture: stateless
ROUTING PROTOCOLS WITH SMALLEST MAXIMAL LATENCY
PERIODICA POLYTECHNICA SER. EL. ENG. VOL. 49, NO. 3 4, PP. 209 221 (2005) ROUTING PROTOCOLS WITH SMALLEST MAXIMAL LATENCY Gábor KURUC and Krisztina LÓJA Vodafone Hungary Co. e-mail: gabor.kuruc@vodafone.com
1-800-OVERLAYS: Using Overlay Networks to Improve VoIP Quality. Yair Amir, Claudiu Danilov, Stuart Goose, David Hedqvist, Andreas Terzis
1-800-OVERLAYS: Using Overlay Networks to Improve VoIP Quality Yair Amir, Claudiu Danilov, Stuart Goose, David Hedqvist, Andreas Terzis Voice over IP To call or not to call The Internet started as an overlay
Dynamics of Hot-Potato Routing in IP Networks
Dynamics of Hot-Potato Routing in IP Networks Jennifer Rexford AT&T Labs Research http://www.research.att.com/~jrex Joint work with Renata Teixeira (UCSD), Aman Shaikh (AT&T), and Timothy Griffin (Intel)
M&Ms: CS Freshmen Experience Networks. Department of Computer Science The Johns Hopkins University. Yair Amir Spring 2017 / Week 3 1.
M&Ms: CS Freshmen Experience 600.105 Networks Department of Computer Science The Johns Hopkins University 1 Networks Reading: https://en.wikipedia.org/wiki/history_of_the_internet https://en.wikipedia.org/wiki/routing
Keeping the Connectivity and Saving the Energy in the Internet
IEEE INFOCOM 11 Workshop on Green Communications and Networking Keeping the Connectivity and Saving the Energy in the Internet Francesca Cuomo, Anna Abbagnale, Antonio Cianfrani, Marco Polverini DIET,
A Scalable Content- Addressable Network
A Scalable Content- Addressable Network In Proceedings of ACM SIGCOMM 2001 S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker Presented by L.G. Alex Sung 9th March 2005 for CS856 1 Outline CAN basics
Overlay Networks. Behnam Momeni Computer Engineering Department Sharif University of Technology
CE443 Computer Networks Overlay Networks Behnam Momeni Computer Engineering Department Sharif University of Technology Acknowledgments: Lecture slides are from Computer networks course thought by Jennifer
Characterizing Traffic Demand Aware Overlay Routing Network Topologies
Characterizing Traffic Demand Aware Overlay Routing Network Topologies Benjamin D. McBride Kansas State University Rathbone Hall Manhattan, KS Email: bdm@ksu.edu Caterina Scoglio Kansas State University
The Price of Selfishness in Network Coding Jason R. Marden, Member, IEEE, and Michelle Effros, Fellow, IEEE
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 4, APRIL 2012 2349 The Price of Selfishness in Network Coding Jason R. Marden, Member, IEEE, and Michelle Effros, Fellow, IEEE Abstract A game-theoretic
Random Neural Networks for the Adaptive Control of Packet Networks
Random Neural Networks for the Adaptive Control of Packet Networks Michael Gellman and Peixiang Liu Dept. of Electrical & Electronic Eng., Imperial College London {m.gellman,p.liu}@imperial.ac.uk Abstract.
An Agent-based Model for the Evolution of the Internet Ecosystem
An Agent-based Model for the Evolution of the Internet Ecosystem Amogh Dhamdhere Constantine Dovrolis Georgia Tech The Internet Ecosystem 27,000 autonomous networks independently operated and managed The
Making Routers Last Longer with ViAggre
Making Routers Last Longer with ViAggre Hitesh Ballani, Paul Francis, Tuan Cao and Jia Wang Cornell University AT&T Labs Research Abstract This paper presents ViAggre (Virtual Aggregation), a configuration-only
Application-Aware SDN Routing for Big-Data Processing
Application-Aware SDN Routing for Big-Data Processing Evaluation by EstiNet OpenFlow Network Emulator Director/Prof. Shie-Yuan Wang Institute of Network Engineering National ChiaoTung University Taiwan
On the Placement of Web Server Replicas
On the Placement of Web Server Replicas Lili Qiu Venkata N. Padmanabhan Geoffrey M. Voelker Cornell University Microsoft Research U.C. San Diego Abstract Recently there has been an increasing deployment
On low-latency-capable topologies, and their impact on the design of intra-domain routing
On low-latency-capable topologies, and their impact on the design of intra-domain routing Nikola Gvozdiev, Stefano Vissicchio, Brad Karp, Mark Handley University College London (UCL) We want low latency!
Price of Path Diversity: in Practice and in Theory
Price of Path Diversity: in Practice and in Theory Ang Li Dept. of Computer Science Duke University angl@cs.duke.edu Yanbin Lu Dept. of Computer Science University of California, Irvine yanbinl@uci.edu
Robust validation of network designs under uncertain demands and failures
Robust validation of network designs under uncertain demands and failures Yiyang Chang, Sanjay Rao, and Mohit Tawarmalani Purdue University USENIX NSDI 2017 Validating network design Network design today
Multihoming Route Control among a Group of Multihomed Stub Networks
Multihoming Route Control among a Group of Multihomed Stub Networks Yong Liu, A. L. Narasimha Reddy Department of Electrical and Computer Engineering Texas A&M University College Station, TX 77843 {yongliu,reddy}@ece.tamu.edu
Stable Internet Route Selection
Stable Internet Route Selection Brighten Godfrey Matthew Caesar Ian Haken Scott Shenker Ion Stoica UC Berkeley pbg@cs.berkeley.edu NANOG 40 June 6, 2007 BGP instability: trouble control plane data plane
A Congestion Contribution-based Traffic Engineering Scheme using Software-Defined Networking
A Congestion Contribution-based Traffic Engineering Scheme using Software-Defined Networking Dongjin Hong, Jinyong Kim, and Jaehoon (Paul) Jeong Department of Electrical and Computer Engineering, Sungkyunkwan
A Case Study in Understanding OSPF and BGP Interactions Using Efficient Experiment Design
A Case Study in Understanding OSPF and BGP Interactions Using Efficient Experiment Design David Bauer, Murat Yuksel, Christopher Carothers and Shivkumar Kalyanaraman Department of Computer Science Department
Joint Server Selection and Routing for Geo-Replicated Services
Joint Server Selection and Routing for Geo-Replicated Services Srinivas Narayana Joe Wenjie Jiang, Jennifer Rexford and Mung Chiang Princeton University 1 Large-scale online services Search, shopping,
Stable Route Selection for Interdomain Traffic Engineering
Stable Route Selection for Interdomain Traffic Engineering Y. Richard Yang Haiyong Xie Hao Wang Li Erran Li Yanbin Liu Avi Silberschatz Arvind Krishnamurthy March 15, 2005 Abstract We investigate a general
Internet Path Stability: Exploring the Impact of MPLS. Zakaria Al-Qudah, PhD. Yarmouk University April 2, 2015
Internet Path Stability: Exploring the Impact of MPLS Zakaria Al-Qudah, PhD. Yarmouk University April 2, 2015 1 Outline Introduction Related Work Contribution Methodology Results Conclusions 2 About Myself
A Super-Peer Based Lookup in Structured Peer-to-Peer Systems
A Super-Peer Based Lookup in Structured Peer-to-Peer Systems Yingwu Zhu Honghao Wang Yiming Hu ECECS Department ECECS Department ECECS Department University of Cincinnati University of Cincinnati University
Fault-Aware Flow Control and Multi-path Routing in Wireless Sensor Networks
Fault-Aware Flow Control and Multi-path Routing in Wireless Sensor Networks X. Zhang, X. Dong Shanghai Jiaotong University J. Wu, X. Li Temple University, University of North Carolina N. Xiong Colorado
COPE: Traffic Engineering in Dynamic Networks
: Traffic Engineering in Dynamic Networks Hao Wang Haiyong Xie Lili Qiu Yang Richard Yang Yin Zhang Albert Greenberg AT&T Labs Research Univ. of Texas at Austin Yale University {hao.wang,haiyong.xie,yang.r.yang}@yale.edu
Measurement Based Routing Strategies on Overlay Architectures
Measurement Based Routing Strategies on Overlay Architectures Student: Tuna Güven Faculty: Bobby Bhattacharjee, Richard J. La, and Mark A. Shayman LTS Review February 15 th, 2005 Outline Measurement-Based
Interdomain Routing Reading: Sections K&R EE122: Intro to Communication Networks Fall 2007 (WF 4:00-5:30 in Cory 277)
Interdomain Routing Reading: Sections K&R 4.6.3 EE122: Intro to Communication Networks Fall 2007 (WF 4:00-5:30 in Cory 277) Guest Lecture by Brighten Godfrey Instructor: Vern Paxson TAs: Lisa Fowler, Daniel
Making Routers Last Longer with ViAggre
Making Routers Last Longer with ViAggre Hitesh Ballani Cornell University Paul Francis Cornell University Tuan Cao Cornell University Jia Wang AT&T Labs Research Abstract This paper presents ViAggre (Virtual
Paradoxes of Traffic Engineering with Partially Optimal Routing
Paradoxes of Traffic Engineering with Partially Optimal Routing Daron Acemoglu, Ramesh Johari, Asuman Ozdaglar Abstract Most large-scale communication networks, such as the Internet, consist of interconnected
Selfish Caching in Distributed Systems: A Game-Theoretic Analysis
Selfish Caching in Distributed Systems: A Game-Theoretic Analysis Symposium on Principles of Distributed Computing July 5, 4 Byung-Gon Chun, Kamalika Chaudhuri, Hoeteck Wee, Marco Barreno, Christos Papadimitriou,
Algorithmic Game Theory and Applications. Lecture 16: Selfish Network Routing, Congestion Games, and the Price of Anarchy
Algorithmic Game Theory and Applications Lecture 16: Selfish Network Routing, Congestion Games, and the Price of Anarchy Kousha Etessami warning, again 1 In the few remaining lectures, we will briefly
COMP/ELEC 429 Introduction to Computer Networks
COMP/ELEC 429 Introduction to Computer Networks Lecture 11: Inter-domain routing Slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang T. S. Eugene Ng eugeneng at
Games in Networks: the price of anarchy, stability and learning. Éva Tardos Cornell University
Games in Networks: the price of anarchy, stability and learning Éva Tardos Cornell University Why care about Games? Users with a multitude of diverse economic interests sharing a Network (Internet) browsers
CS4700/CS5700 Fundamentals of Computer Networks
CS4700/CS5700 Fundamentals of Computer Networks Lecture 12: Inter-domain routing Slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang Alan Mislove amislove at ccs.neu.edu
Distributed Measurement-Aware Routing: Striking a Balance between Measurement and Traffic Engineering
Distributed Measurement-Aware Routing: Striking a Balance between Measurement and Traffic Engineering Chia-Wei Chang, Han Liu Guanyao Huang, Bill Lin, and Chen-Nee Chuah Department of Electrical and Computer
CS 640: Introduction to Computer Networks. Intra-domain routing. Inter-domain Routing: Hierarchy. Aditya Akella
CS 640: Introduction to Computer Networks Aditya Akella Lecture 11 - Inter-Domain Routing - BGP (Border Gateway Protocol) Intra-domain routing The Story So Far Routing protocols generate the forwarding
Information, Gravity, and Traffic Matrices
Information, Gravity, and Traffic Matrices Yin Zhang, Matthew Roughan, Albert Greenberg, Nick Duffield, David Donoho 1 Problem Have link traffic measurements Want to know demands from source to destination
EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Overlay Networks: Motivations
EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley
Interdomain Routing Reading: Sections P&D 4.3.{3,4}
Interdomain Routing Reading: Sections P&D 4.3.{3,4} EE122: Intro to Communication Networks Fall 2006 (MW 4:00-5:30 in Donner 155) Vern Paxson TAs: Dilip Antony Joseph and Sukun Kim http://inst.eecs.berkeley.edu/~ee122/
Classification and Evaluation of Constraint-Based Routing Algorithms for MPLS Traffic Engineering
Classification and Evaluation of Constraint-Based Routing Algorithms for MPLS Traffic Engineering GET/ENST Bretagne - Département Réseaux et Services Multimédia 2 rue de la Châtaigneraie - CS 1767-35576
Nash Equilibrium Load Balancing
Nash Equilibrium Load Balancing Computer Science Department Collaborators: A. Kothari, C. Toth, Y. Zhou Load Balancing A set of m servers or machines. A set of n clients or jobs. Each job can be run only
Algorithmic Game Theory and Applications. Lecture 16: Selfish Network Routing, Congestion Games, and the Price of Anarchy.
Algorithmic Game Theory and Applications Lecture 16: Selfish Network Routing, Congestion Games, and the Price of Anarchy Kousha Etessami games and the internet Basic idea: The internet is a huge experiment
Algorithms and Theory of Computation
Algorithms and Theory of Computation Eric Friedman Juris Hartmanis John Hopcroft Bobby Kleinberg Jon Kleinberg Dexter Kozen David Shmoys Éva Tardos David Williamson What we do Core theoretical problems
MPLS, THE BASICS CSE 6067, UIU. Multiprotocol Label Switching
MPLS, THE BASICS CSE 6067, UIU Multiprotocol Label Switching Basic Concepts of MPLS 2 Contents Drawbacks of Traditional IP Forwarding Basic MPLS Concepts MPLS versus IP over ATM Traffic Engineering with
Available Bandwidth Estimation. Probing Packet Train in Pathneck. Transmission of RPT. Choke Point Detection. Packet train probing
Measuring the Path Network Measurement: Measuring the Path Available Bandwidth/Bottleneck BFind,Pathchar,Cartouche Pathneck Link Capacity: Pathchar CapProbe Loss/Delay/Re-ording Tulip Joy Zhang Pathneck
Programmatic Interface to Routing
Programmatic Interface to Routing NANOG 61 Draft version, slides will be updated before presentation Applications and Networks Routing system players: the Application and the Network. Different interdependent
Walking the Tightrope: Responsive Yet Stable Traffic Engineering
Walking the Tightrope: Responsive Yet Stable Traffic Engineering Srikanth Kandula MIT CSAIL kandula@mit.edu Dina Katabi MIT CSAIL dk@mit.edu Bruce Davie Cisco Systems bdavie@cisco.com Anna Charny Cisco
Toward an Atlas of the Physical Internet
Toward an Atlas of the Physical Internet Winter 2014 Paul Barford Computer Sciences University of Wisconsin!! Motivation pb@cs.wisc.edu 1 Objectives of our work Create and maintain a comprehensive catalog
Outline. EL736 Communications Networks II: Design and Algorithms. Class3: Network Design Modelling Yong Liu 09/19/2006
EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modelling Yong Liu 09/19/2006 1 Outline Examples Basic Problems Routing Restriction 2 1 Example: Intra-Domain Traffic Engineering
ENERGY-EFFICIENT PROTOCOL IN OMNET++ SIMULATION ENVIRONMENT. Krzysztof Daniluk
159 ENERGY-EFFICIENT PROTOCOL IN OMNET++ SIMULATION ENVIRONMENT Krzysztof Daniluk Abstract: New idea for energy-efficient extension for OSPF protocol is presented. New concept is based on Dijkstra s algorithm,
Lecture 12: Link-state Routing. Lecture 12 Overview. Router Tasks. CSE 123: Computer Networks Chris Kanich. Routing overview
Lecture : Link-state Routing CSE 3: Computer Networks Chris Kanich Lecture Overview Routing overview Intra vs. Inter-domain routing Link-state routing protocols CSE 3 Lecture : Link-state Routing Router
! Distance vector routing! Link state routing.! Path vector routing! BGP: Border Gateway Protocol! Route aggregation
! Distance vector routing! Link state routing Information Network I Youki Kadobayashi! IGP and EGP Intra-domain routing protocol, inter-domain routing protocol! Path vector routing! BGP: Border Gateway
Virtual Multi-homing: On the Feasibility of Combining Overlay Routing with BGP Routing
Virtual Multi-homing: On the Feasibility of Combining Overlay Routing with BGP Routing Zhi Li, Prasant Mohapatra, and Chen-Nee Chuah University of California, Davis, CA 95616, USA {lizhi, prasant}@cs.ucdavis.edu,
Measurement-Based Multicast on Overlay Architecture
Measurement-Based Multicast on Overlay Architecture Students: Tuna Guven Faculty: Bobby Bhattacharjee, Richard J. La, and Mark A. Shayman LTS Review June 18 th, 2004 1 Outline Multi-path Multicast Routing
Overlay Networks: Motivations. EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Motivations (cont d) Goals.
Overlay Networks: Motivations CS : Introduction to Computer Networks Overlay Networks and PP Networks Ion Stoica Computer Science Division Department of lectrical ngineering and Computer Sciences University
CS 268: Computer Networking. Adding New Functionality to the Internet
CS 268: Computer Networking L-16 Changing the Network Adding New Functionality to the Internet Overlay networks Active networks Assigned reading Resilient Overlay Networks Active network vision and reality:
Achieving Efficient Bandwidth Utilization in Wide-Area Networks While Minimizing State Changes
1 Achieving Efficient Bandwidth Utilization in Wide-Area Networks While Minimizing State Changes 2 WAN Traffic Engineering Maintaining private WAN infrastructure is expensive Must balance latency-sensitive
Scalability of Routing Protocols
Scalability of outing Protocols Internet is large... Need to introduce hierarchy -... into something that naturally does not have one - divide and conquer, abandoning hope for optimality - based on ownership
P4P : Provider Portal for (P2P) Applications
P4P : Provider Portal for (P2P) Applications Haiyong Xie Laboratory of Networked Systems Yale University Laird Popkin Pando Networks, Inc P2P : Bandwidth Usage Traffic: Internet Protocol Breakdown 1993-2006
Alizadeh, M. et al., " CONGA: distributed congestion-aware load balancing for datacenters," Proc. of ACM SIGCOMM '14, 44(4): , Oct
CONGA Paper Review By Buting Ma and Taeju Park Paper Reference Alizadeh, M. et al., " CONGA: distributed congestion-aware load balancing for datacenters," Proc. of ACM SIGCOMM '14, 44(4):503-514, Oct.
Topological Evolutionary Methods for the Reliable and Sustainable Internet
Topological Evolutionary Methods for the Reliable and Sustainable Internet Submitted to Graduate School of Information Science and Technology Osaka University January 2015 Yu NAKATA List of publication
Introduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Algorithms and Game Theory Date: 12/3/15
600.363 Introduction to Algorithms / 600.463 Algorithms I Lecturer: Michael Dinitz Topic: Algorithms and Game Theory Date: 12/3/15 25.1 Introduction Today we re going to spend some time discussing game
On the Optimality of Link-State Routing Protocols
On the Optimality of Link-State Routing Protocols Dahai Xu, Ph.D. Florham Park AT&T Labs - Research Joint work with Mung Chiang and Jennifer Rexford (Princeton University) New Mathematical Frontiers in
Surveying Formal and Practical Approaches for Optimal Placement of Replicas on the Web
Surveying Formal and Practical Approaches for Optimal Placement of Replicas on the Web TR020701 April 2002 Erbil Yilmaz Department of Computer Science The Florida State University Tallahassee, FL 32306
Motivation. The Impact of DHT Routing Geometry on Resilience and Proximity. Different components of analysis. Approach:Component-based analysis
The Impact of DHT Routing Geometry on Resilience and Proximity Presented by Karthik Lakshminarayanan at P2P Systems class (Slides liberally borrowed from Krishna s SIGCOMM talk) Krishna Gummadi, Ramakrishna
On the Prevalence and Characteristics of MPLS Deployments in the Open Internet
On the Prevalence and Characteristics of MPLS Deployments in the Open Internet Joel Sommers Colgate University Brian Eriksson Boston University Paul Barford University of Wisconsin The elephant in the
The Impact of DHT Routing Geometry on Resilience and Proximity. Acknowledgement. Motivation
The Impact of DHT Routing Geometry on Resilience and Proximity Presented by Noorullah Moghul Krishna Gummadi, Ramakrishna Gummadi, Sylvia Ratnasamy, Steve Gribble, Scott Shenker, Ion Stoica Acknowledgement
Distributed Hash Table
Distributed Hash Table P2P Routing and Searching Algorithms Ruixuan Li College of Computer Science, HUST rxli@public.wh.hb.cn http://idc.hust.edu.cn/~rxli/ In Courtesy of Xiaodong Zhang, Ohio State Univ