1 Lecture 2 – Networking Paradigms University of Nevada – Reno Computer Science & Engineering Department Fall 2015 CS 791 Special Topics: Network Architectures.

Slides:



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

Multihoming and Multi-path Routing
FIND PI Meeting, November Value Flows and Risk Management Architecture for Future Internet Murat Yuksel University of Nevada.
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.
1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Introducing the TE Concept.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Addressing the Network – IPv4 Network Fundamentals – Chapter 6.
Architectures for Congestion-Sensitive Pricing of Network Services Thesis Defense by Murat Yuksel CS Department, RPI July 3 rd, 2002.
7 RAIDER: Responsive Architecture for Inter-Domain Economics and Routing.
1 Scalability is King. 2 Internet: Scalability Rules Scalability is : a critical factor in every decision Ease of deployment and interconnection The intelligence.
Resource Pooling A system exhibits complete resource pooling if it behaves as if there was a single pooled resource. The Internet has many mechanisms for.
1 June 2015 Validating Inter-Domain SLAs with a Programmable Traffic Control System Elisa Boschi
Congestion Pricing Overlaid on Edge-to-Edge Congestion Control Murat Yuksel, Shivkumar Kalyanaraman and Anuj Goel Rensselaer Polytechnic Institute, Troy,
Resource Management – a Solution for Providing QoS over IP Tudor Dumitraş, Frances Jen-Fung Ning and Humayun Latif.
CS 268: Active Networks Ion Stoica May 6, 2002 (* Based on David Wheterall presentation from SOSP ’99)
Traffic Engineering Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
CS 268: Future Internet Architectures Ion Stoica May 1, 2006.
1 CS 240: Network Routing Michalis Faloutsos. 2 Class Overview Expose you the general principles and highlight some interesting topics in routing Background.
BGP EE122 Discussion 11/7/11.
Tussle in cyberspace: Defining tomorrow ’ s internet D.Clark, J.Wroclawski, K.Sollins & R.Braden Presented by: Ao-Jan Su (Slides in courtesy of: Baoning.
Distributed-Dynamic Capacity Contracting: A congestion pricing framework for Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute,
Design of a Scalable Clearing House Architecture Lakshminarayanan Subramanian Chen-Nee Chuah Ramakrishna Gummadi ICEBERG Design Review Jan 12, 2000.
Delivery, Forwarding, and Routing
Efficient agent-based selection of DiffServ SLAs over MPLS networks Thanasis G. Papaioannou a,b, Stelios Sartzetakis a, and George D. Stamoulis a,b presented.
Multipath Routing Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.
1 Attribute Based Communications University of California, Irvine Presented By : Ala Khalifeh (Note: Presented)
The Future of the Internet Jennifer Rexford ’91 Computer Science Department Princeton University
10th Workshop on Information Technologies and Systems 1 A Comparative Evaluation of Internet Pricing Schemes: Smart Market and Dynamic Capacity Contracting.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
On the Scalability of Path Exploration Using Opportunistic Path-Vector Routing Hasan T. Karaoglu, Murat Yuksel, Mehmet H. Gunes University of Nevada, Reno.
BGP Border Gateway Protocol EE122 Section 3. Border Gateway Protocol Protocol for inter-domain routing Designed for policy and privacy Why not distance-vector?
IEEE Global Internet, April Contract-Switching Paradigm for Internet Value Flows and Risk Management Murat Yuksel University.
Path-Vector Contract Routing Hasan T. Karaoglu, Murat Yuksel University of Nevada, Reno ICC’12 NGNI, Toronto June, 2012.
Information-Centric Networks07b-1 Week 7 / Paper 2 NIRA: A New Inter-Domain Routing Architecture –Xiaowei Yang, David Clark, Arthur W. Berger –IEEE/ACM.
Network Layer Goals: understand principles behind network layer services: –routing (path selection) –dealing with scale –how a router works –advanced topics:
EQ-BGP: an efficient inter- domain QoS routing protocol Andrzej Bęben Institute of Telecommunications Warsaw University of Technology,
Controlling Internet Quality with Price Market Managed Multi-service Internet Bob Briscoe BTexact Research, Edge Lab, University College London & M3I Technical.
Integrated Services (RFC 1633) r Architecture for providing QoS guarantees to individual application sessions r Call setup: a session requiring QoS guarantees.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
9/15/2015CS622 - MIRO Presentation1 Wen Xu and Jennifer Rexford Department of Computer Science Princeton University Chuck Short CS622 Dr. C. Edward Chow.
End-to-end resource management in DiffServ Networks –DiffServ focuses on singal domain –Users want end-to-end services –No consensus at this time –Two.
Tussel in Cyberspace Based on Slides by I. Stoica.
Architecting for Innovation ACM SIGCOMM Computer Communication Review 2011 July Presenter :許耀中
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
Network Architecture: Design Philosophies IS250 Spring 2010 John Chuang
ECE 4450:427/527 - Computer Networks Spring 2015 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 2: Overview of Computer Network.
Applicazione del paradigma Diffserv per il controllo della QoS in reti IP: aspetti teorici e sperimentali Stefano Salsano Università di Roma “La Sapienza”
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
Geneva, Switzerland, 11 June 2012 Socio-Economic Aware Design of Future Network Technology (Y.FNsocioeconomic) Martin Waldburger, University of Zurich,
Two-Tier Resource Management Designed after the Internet’s two-tier routing hierarchy Separate packet forwarding from admission and resource allocation.
Lecture 17 November 8Intra-domain routing November 13Internet routing 1 November 15Internet routing 2 November 20End-to-end protocols 1 November 22End-to-end.
Routing and Routing Protocols
CS 4396 Computer Networks Lab BGP. Inter-AS routing in the Internet: (BGP)
Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 20 Omar Meqdadi Department of Computer Science and Software Engineering University.
1 Agenda for Today’s Lecture The rationale for BGP’s design –What is interdomain routing and why do we need it? –Why does BGP look the way it does? How.
IT 210: Web-based IT Fall 2012 Lecture: Network Basics, OSI, & Internet Architecture.
Challenges in the Next Generation Internet Xin Yuan Department of Computer Science Florida State University
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—1-1 Course Introduction.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
1 Chapter 14-16a Internet Routing Review. Chapter 14-16: Internet Routing Review 2 Introduction Motivation: Router performance is critical to overall.
Company LOGO Network Architecture By Dr. Shadi Masadeh 1.
Lecture 7. Building Forwarding Tables There are several methods Static Method Dynamic Methods Centralized Distributed Distance Vector Link State.
Introduction1-1 Data Communications and Computer Networks Chapter 1 CS 3830 Lecture 3 Omar Meqdadi Department of Computer Science and Software Engineering.
15-849: Hot Topics in Networking Policy and Networks Srinivasan Seshan 1.
Mobile IP THE 12 TH MEETING. Mobile IP  Incorporation of mobile users in the network.  Cellular system (e.g., GSM) started with mobility in mind. 
COMP 3270 Computer Networks
EE 122: Lecture 22 (Overlay Networks)
Towards Predictable Datacenter Networks
Presentation transcript:

1 Lecture 2 – Networking Paradigms University of Nevada – Reno Computer Science & Engineering Department Fall 2015 CS 791 Special Topics: Network Architectures and Economics

2 Outline  Tussle Granularity  Contract-Switching

Tussle Granularity  Tussle: “a physical contest or struggle”,  Effects everything else designed on it  A way of expressing “value”  Does it have to be “physical”?  How about economic tussle in the net? 3

Tussle Granularity  Spatial  Where on the network is involved in the tussle?  Where are the entities tussling with each other?  How “large” is the unit of tussle? ParadigmBetween Where Unit Circuit-SwitchingEnd-to-EndCircuits Packet-SwitchingHop-to-HopDatagrams/Packets Paradigm 4

Tussle Granularity  Temporal  How frequent does the tussle take place?  How “long” is the unit of tussle? ParadigmFrequencyUnit Circuit-SwitchingPer flow/sessionMinutes Packet-SwitchingPer packetMilliseconds Are these two paradigmatic tussle granularities enough to handle current challenges in the Internet? 5

Tussle Granularity: Value  Economic granularity?  How flexible is it to express your  Willingness-to-pay  Value of the data/bit  Current:  only at the access level  all application traffic is treated the same (except VoIP, which requires extra payments) Paradigm 6

Tussle Granularity: Trust  Security granularity?  How flexible is it to express your sense of  Security of the data  Privacy of your ID  Always tradeoffs  Too private: cannot track criminals (e.g. anonymizers)  No privacy: 911 calls possible Paradigm 7

Tussle Granularity: Trust  Are you comfortable with sending your financial information over WiFi links?  Do you “trust” the network?  Or do you just no trust the WiFi link?  Can you express this to the network provider?  Trust levels: Can we quantify?  If not quantifiable, can it be part of the paradigm or even architecture? Paradigm 8

Implied Challenges Tussle Granularity: Edge-to-Edge  Some of the current architectural problems:  Users cannot express value choices at sufficient granularity – only at access level  Providers do not have economic knobs to manage risks involved in investing innovative QoS technologies and business relationships with other providers flexibility in time: forward/option pricing flexibility in space: user-defined inter-domain routes capability to provide e2e higher quality services money-back guarantees, risk/cost sharing 9

Inter-domain struggles…  When crossing domains, all bets are off..  End-to-end reliability or performance-criticality requires  assurance of single-domain performance, i.e., “contract”s  efficient concatenation of single-domain contracts  Inter-domain routing needs to be aware of economic semantics  contract routing + risk management  How to address translation of these struggles to architectural problems? 10

Contract-switching: A paradigm shift… Circuit-switching Packet-switching Contract-switching ISP A ISP C ISP B e2e circuits ISP A ISP C ISP B routable datagrams ISP A ISP C ISP B contracts overlaid on routable datagrams 11

A Contract-Switched Network Core  Contracts: a practical way to manage “value flows”  Technologies to Support QoS  Economic considerations for service definition and delivery  Scalability, Efficiency and Fairness  Contract timescales  Cost recovery  Pricing the risk in QoS guarantees  Single-domain and end- to-end contracts 12

Basic Building Block: Intra- domain dynamic contracts  Contract components  performance component, e.g., capacity  financial component, e.g., price  time component, e.g., term Network Core accessed only by contracts Customers Edge Router Edge Router Edge Router Edge Router Edge Router Edge Router Stations of the provider computing and advertising local prices for edge-to- edge contracts. 13

Contract Link  An ISP is abstracted as a set of “contract links”  Contract link: an advertisable contract  between peering/edge points i and j of an ISP  with flexibility of advertising different prices for edge-to- edge (g2g) intra-domain paths capability of managing value flows at a finer granularity than point-to-anywhere deals 14

Can we achieve e2e QoS?  Contract Routing:  Compose e2e inter-domain “contract paths” over available contract links satisfying the QoS requirements  Calculate the contract paths by shortest-path algos with metrics customized w.r.t. contract QoS metrics  Two ways:  link-state contract routing at macro time-scales  path-vector contract routing at micro time-scales  Monitor and verify that each ISP involved in an e2e contract path is doing the job  Punish the ISPs not doing their job, e.g. as a money-back guarantee to the others involved in the e2e contract path 15

Link-State Contract Routing: Macro-level, proactive User X ISP A ISP C ISP B 1 Owner ISP LinkQoSTermOffered After Price ($/term) A1-210Mb/s2hrs1hr$10 A1-340Mb/s5hrs15mins$80 B2-4100Mb/s3hrs2hrs$110 C3-520Mb/s1hr30mins$8 C4-560Mb/s1day2hrs$250 4 Most cost- efficient route Max QoS route 16

Path-Vector Contract Routing: Micro-level, on-demand, reactive  Provider initiates…  ISP C wants to advertise availability of a short-term contract link User X ISP A ISP C ISP B 14 [C, 5-4, 30Mb/s, 45mins, $9] [C-B, 5-4-2, 20Mb/s, 45mins, $6+$5] [C-B-A, , 20Mb/s, 30mins, $7.3+$3] [C, 5-3, 10Mb/s, 30mins, $5] [C-A, 5-3-1, 5Mb/s, 15mins, $1.25+$1.2] path announcement path announcement path announcement 17

Path-Vector Contract Routing: Micro-level, on-demand, reactive  User initiates…  User X wants to know if it can reach 5 with 10-30Mb/s for mins in a $10 budget User X ISP A ISP C ISP B 14 [5, A-B, 1-2-4, 15-20Mb/s, 20-30mins, $4] [5, A, 1-2, 15-30Mb/s, 15-30mins, $8] [5, 10-30Mb/s, 15-45mins, $10] [5, A, 1-3, 5-10Mb/s, 15-20mins, $7] Paths to 5 are found and ISP C sends replies to the user with two specific contract-path- vectors. path request [A-B-C, , 20Mb/s, 30mins] [A-C, 1-3-5, 10Mb/s, 15mins] Paths to 5 are found and ISP C sends replies to the user with two specific contract- path-vectors. reply 18

Deployment Issues  How to motivate ISPs to participate?  ISPs are very protective of their contracting terms – due to competition. But, BGP has similar risks too.. Observation of opportunity costs  PVCR can be done at will.. Not much to loose if ISPs participate with their leftover bandwidth.  Monitoring and verification of contracts  Who is breaking the e2e performance?  Active measurements can be OK for LSCR, but PVCR needs lightweight techniques. 19

Contract-Switching: A generalization  A generalization of packet-switching  A packet is a little contract with a very short duration? ParadigmBetween Where Unit Circuit-SwitchingEnd-to-EndCircuits Packet-SwitchingHop-to-HopDatagrams/Packets Contract-SwitchingEdge-to-EdgeContracts 20

1-21 Lecture 2: Summary  Tussle Granularity  Temporal  Spatial  Economic  Contract-Switching  Edge-to-edge  Contract as a unit of tussle  Potential to offer end-to-end QoS services  Value and risk management at fine-enough granularity

1-22 Lecture 2: Reading  Clark, Wrocklawski, Sollins, and Braden, Tussle in Cyberspace: Defining Tomorrow's Internet, IEEE/ACM Transactions on Networking,  Yuksel, Gupta, and Kalyanaraman, Contract-Switching Paradigm for Internet Value Flows and Risk Management, IEEE Global Internet Symposium, (also in Ramamurthy, Rouskas, and Sivalingam, Chapter 7)