20 Pages

L11

Course: CS 7260, Fall 2008
School: Georgia Tech
Rating:
 
 
 
 
 

Word Count: 784

Document Preview

Services: Routing MPLS, VPNs Nick Feamster CS 7260 February 15, 2006 Administrivia Problem Set 2 is out, due 2/24 4 problems: 1 Data streaming, 2 scriptroute, 1 Netflow Try to test out the scriptroute installation early, in case there are problems. Fewer, shorter problems, but more scripting/coding Scriptroute scripts are in Rubycome to office hours if you need help with the language Last problem is not...

Register Now

Unformatted Document Excerpt

Coursehero >> Georgia >> Georgia Tech >> CS 7260

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Services: Routing MPLS, VPNs Nick Feamster CS 7260 February 15, 2006 Administrivia Problem Set 2 is out, due 2/24 4 problems: 1 Data streaming, 2 scriptroute, 1 Netflow Try to test out the scriptroute installation early, in case there are problems. Fewer, shorter problems, but more scripting/coding Scriptroute scripts are in Rubycome to office hours if you need help with the language Last problem is not that hard. Most could probably be done with grep/awk as a last resort. 2 MPLS Overview Main idea: Virtual circuit Packets forwarded based only on circuit identifier Source 1 Destination Source 2 Router can forward traffic to the same destination on different interfaces/paths. 3 Circuit Abstraction: Label Swapping D A 1 2 Tag Out New A 2 D 3 Label-switched paths (LSPs): Paths are named by the label at the paths entry point At each hop, label determines: Outgoing interface New label to attach Label distribution protocol: responsible for disseminating signalling information 4 Layer 3 Virtual Private Networks Private communications over a public network A set of sites that are allowed to communicate with each other Defined by a set of administrative policies determine both connectivity and QoS among sites established by VPN customers One way to implement: BGP/MPLS VPN mechanisms (RFC 2547) 5 Building Private Networks Separate physical network Good security properties Expensive! Secure VPNs Encryption of entire network stack between endpoints Layer 2 Tunneling Protocol (L2TP) PPP over IP No encryption Privacy and interconnectivity (not confidentiality, integrity, etc.) Layer 3 VPNs 6 Layer 2 vs. Layer 3 VPNs Layer 2 VPNs can carry traffic for many different protocols, whereas Layer 3 is IP only More complicated to provision a Layer 2 VPN Layer 3 VPNs: potentially more flexibility, fewer configuration headaches 7 Layer 3 BGP/MPLS VPNs VPN A/Site 2 10.2/16 VPN B/Site 1 10.1/16 CE B1 2 CE B1 P1 1 CEA2 PE2 P2 CEB2 10.2/16 VPN B/Site 2 BGP to exchange routes PE3 PE1 CEA1 P3 CEB3 MPLS to forward traffic CEA3 10.3/16 10.1/16 VPN A/Site 1 10.4/16 VPN B/Site 3 VPN A/Site 3 Isolation: Multiple logical networks over a single, shared physical infrastructure Tunneling: Keeping routes out of the core 8 High-Level Overview of Operation IP packets arrive at PE Destination IP address is looked up in forwarding table Datagram sent to customers network using tunneling (i.e., an MPLS label-switched path) 9 BGP/MPLS VPN key components Forwarding in the core: MPLS Distributing routes between PEs: BGP Isolation: Keeping different VPNs from routing traffic over one another Constrained distribution of routing information Multiple virtual forwarding tables Unique addresses: VPN-IP4 Address extension 10 Layer VPNs Vanilla 3 Layer 3 VPNs: All customer routes in the core Site 1 Site 2 CORE IBGP EBGP BGP/MPLS VPNs: BGP between PEs; MPLS in the core Site 1 PE LDP LDP LDP Site 2 P MPLS CORE P PE 11 Problems Introduced by Layer 3 VPNs Overlapping address space in forwarding table Solution: Virtual routing and forwarding table (VRF) Overlapping address space in BGP routes Solution: Route distinguisher--- 8-byte VPN-specific identifier prepended to each IP address Typically, one route distinguisher per VPN New VPN-IP address family Routes carried with multi-protocol BGP Filtering routes from routes not at that site Route target: basically a special BGP community value 12 Virtual Routing and Forwarding Separate tables per customer at each router Customer 1 10.0.1.0/24 10.0.1.0/24 RD: Green Customer 1 Customer 2 10.0.1.0/24 Customer 2 10.0.1.0/24 RD: Blue 13 Routing: Constraining Distribution Performed by Service Provider using route filtering based on BGP Extended Community attribute BGP Community is attached by ingress PE route filtering based on BGP Community is performed by egress PE BGP RD:10.0.1.0/24 Route target: Green Next-hop: A Site 2 Static route, RIP, etc. Site 1 10.0.1.0/24 A Site 3 14 BGP/MPLS VPN Routing in Cisco IOS Customer A ip vrf Customer_A rd 100:110 route-target export 100:1000 route-target import 100:1000 ! ip vrf Customer_B rd 100:120 route-target export 100:2000 route-target import 100:2000 Customer B 15 Forwarding PE and P routers have BGP next-hop reachability through the backbone IGP Labels are distributed through LDP (hop-by-hop) corresponding to BGP Next-Hops Two-Label Sta...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Georgia Tech - CS - 2008
Distributed File Systems Mainly based on Tanenbaum's 2002 "Distributed Operating Systems" Ch. 10 and Silberschatz & Galvin's Ch. 17 An overview of the main Distributed FS issues We will see all the design options and the choices made by different
Georgia Tech - CS - 4210
Distributed File Systems Mainly based on Tanenbaum's 2002 "Distributed Operating Systems" Ch. 10 and Silberschatz & Galvin's Ch. 17 An overview of the main Distributed FS issues We will see all the design options and the choices made by different
Georgia Tech - CS - 2008
A Distributed Object Model for the Java SystemAnn Wolrath, Roger Riggs, and Jim Waldo Communication mechanism are key in distributed systems need a good model socketscan be complicated to encode/decode messages RCP procedure calls,but in Ja
Georgia Tech - CS - 6210
A Distributed Object Model for the Java SystemAnn Wolrath, Roger Riggs, and Jim Waldo Communication mechanism are key in distributed systems need a good model socketscan be complicated to encode/decode messages RCP procedure calls,but in Ja
Georgia Tech - CS - 2008
Limits to Low-Latency Communication on High-Speed NetworksChandramohan Thekkath and Henry Levy, UWOverview Understand performance of basic packet exchange in different scenarios Three different network types: 10 Mbps Ethernet high bw (100Mbps)
Georgia Tech - CS - 6210
Limits to Low-Latency Communication on High-Speed NetworksChandramohan Thekkath and Henry Levy, UWOverview Understand performance of basic packet exchange in different scenarios Three different network types: 10 Mbps Ethernet high bw (100Mbps)
Georgia Tech - CS - 2008
Solutions to Homework 4 1. S AAAZ | AAAAS A 0 | 1 Z0 2. SX|Y| X aXb | A | B A aA | a B bB | b Y CbCaC C aC | a | bC | b | 3. S aVbC | AbWc | V aVb | C Cc | W bWc | A aA | The grammar is ambiguous as the there are two different left-mos
Georgia Tech - CS - 3240
Solutions to Homework 4 1. S AAAZ | AAAAS A 0 | 1 Z0 2. SX|Y| X aXb | A | B A aA | a B bB | b Y CbCaC C aC | a | bC | b | 3. S aVbC | AbWc | V aVb | C Cc | W bWc | A aA | The grammar is ambiguous as the there are two different left-mos
Georgia Tech - CS - 2008
Protection in the Hydra OSCMUHydra OS Hydra microkernel intended for OS research and experimentation CMU multiprocessor machine Separation of policy and mechanism e.g., low-level dispatching but no scheduling policies Use of OO model with
Georgia Tech - CS - 6210
Protection in the Hydra OSCMUHydra OS Hydra microkernel intended for OS research and experimentation CMU multiprocessor machine Separation of policy and mechanism e.g., low-level dispatching but no scheduling policies Use of OO model with
Georgia Tech - CS - 2008
CS4235 Fall 2007 Homework Group Secure Communications Skills H/W #7 1. This week, we will discuss encryption systems in Chapter 2 of our text. This chapter comes just in time. The `threat' to homework group email has increased. 2. Therefore, besides
Georgia Tech - CS - 2000
ClosetPlus2000: QuestionnaireDefining the Objectives of the survey: Task migratability is important. In our system, the user can receive suggestions from the system as to what to wear.the amount of migratability is important so that the user can
Georgia Tech - OCEMOD - 261
Georgia Tech - IAS - 20
Prediction of Ocean Circulation in the Gulf of Mexico and Caribbean SeaAn application of the ROMS/TOMS Data Assimilation ModelsHernan G. Arango (IMCS, Rutgers University) Emanuele Di Lorenzo (Georgia Institute of Technology) Arthur J. Miller, Bruc
Georgia Tech - IAS - 20
MODEL RUNS_run1 _uses NATL boundary conditions, surface relaxationfor TS and climatological winds.
Georgia Tech - WG - 5
4B.4EVALUATION OF GCM RADIATION CODES USING SHEBA DATA James Pinto, Judith Curry and Dana E. Lane* University of Colorado, Boulder 80309INTRODUCTION Surface Heat Budget of the Arctic Ocean (SHEBA) data are used to evaluate general circulation mod
Georgia Tech - CHAPTER - 11
100 AIRSEA INTERACTION / Sea Surface TemperatureTo take an example, in calculating the ux maps shown in Figure 4 many corrections were applied to the VOS observations in an attempt to remove biases caused by the observing methods. For example, air
Georgia Tech - CS - 3451
Practice problems - set 1some of these problems were already solved in class make sure that you can recreate the solution yourself without looking into your class notes Allowed form of the answer(s): - If a problem asks for a formula for something,
Georgia Tech - CS - 7001
CS 7001: Introduction to Graduate StudiesOctober 22, 2007Assignment 2: Cross-PollinationInstructor: Profs. Feamster/Gray College of Computing, Georgia TechComplete this assignment individually. This assignment is due on Friday, November 2, 200
Georgia Tech - CS - 2008
Solving a etwork Security ProblemDefense Information Systems Agency (DISA) Field Security Operations Division Information Assurance Education, Training, and Awareness (ETA) Products Branch 5275 Leesburg Pike Falls Church, VA 22041-3801 (703) 882-170
Georgia Tech - CS - 1171
CS1171 - Computing for EngineersPractice SolutionsProblem 1 Sorting [20 Points]I. The efficiency of the algorithm Criteria: - 5 Points - All or nothing II. N^2 N log N N log N N^2 Criteria: - -1 point each for every incorrect answer - 5 Points
Georgia Tech - CS - 2008
CS1171 - Computing for EngineersPractice SolutionsProblem 1 Sorting [20 Points]I. The efficiency of the algorithm Criteria: - 5 Points - All or nothing II. N^2 N log N N log N N^2 Criteria: - -1 point each for every incorrect answer - 5 Points
Georgia Tech - CS - 2008
CS 6505: Algorithms, Computability and ComplexityProblem Set 1 Due September 13, 2007 Problem 11. Show that decidable languages are closed under union and intersection, that is, if A and B are decidable languages, then so are A B and A B. 2. Are
Georgia Tech - CS - 6505
CS 6505: Algorithms, Computability and ComplexityProblem Set 1 Due September 13, 2007 Problem 11. Show that decidable languages are closed under union and intersection, that is, if A and B are decidable languages, then so are A B and A B. 2. Are
Georgia Tech - CS - 2008
CS6505: Computability, Algorithms, and ComplexitySpring 2008 Description: This course will cover: (a) important concepts from computability theory; (b) techniques for designing ecient algorithms for combinatorial, algebraic, and number-theoretic pro
Georgia Tech - CS - 6505
CS6505: Computability, Algorithms, and ComplexitySpring 2008 Description: This course will cover: (a) important concepts from computability theory; (b) techniques for designing ecient algorithms for combinatorial, algebraic, and number-theoretic pro
Georgia Tech - CS - 4237
Foundational ResultsCS 4237The General QuestionGiven a computer system, how can we determine if it is secure? Isthere a generic algorithm that allows us to determine whether a computer system is secure? access control matrix to express the p
Georgia Tech - CS - 2008
CS 3240: Languages and ComputationProblem Set 3 Due June 12, 2008Problem 1Show that the following languages are not regular. The language in Part (b) of Exercise 1.29 on Page 88 of Sipser. The languages in Parts (a), (c) and (d) of Problem 1.46
Georgia Tech - CS - 3240
CS 3240: Languages and ComputationProblem Set 3 Due June 12, 2008Problem 1Show that the following languages are not regular. The language in Part (b) of Exercise 1.29 on Page 88 of Sipser. The languages in Parts (a), (c) and (d) of Problem 1.46
Georgia Tech - CS - 7001
CS 7001: Introduction to Graduate StudiesNovember 21, 2007Assignment 3: Mock PCInstructor: Profs. Feamster/Gray College of Computing, Georgia TechComplete this assignment individually. This assignment is due on Monday December 3, 2007 by 11:59
Georgia Tech - CS - 2008
CS 3510: Design and Analysis of AlgorithmsProblem Set 5 SolutionsProblem 1Suppose that a communication network is modeled as a directed graph G = (V, E) in which each edge (u, v) E has an associated value 0 r(u, v) 1 that represents the probab
Georgia Tech - CS - 3510
CS 3510: Design and Analysis of AlgorithmsProblem Set 5 SolutionsProblem 1Suppose that a communication network is modeled as a directed graph G = (V, E) in which each edge (u, v) E has an associated value 0 r(u, v) 1 that represents the probab
Georgia Tech - CS - 2008
CS 6505: Algorithms, Computability and ComplexityFinal Exam Due 11:59pm on December 11, 2007This take-home exam contains 8 problems. You are required to solve the 5 of the 8 problems. If you solve more than 5 problems, then the 5 highest scores of
Georgia Tech - CS - 6505
CS 6505: Algorithms, Computability and ComplexityFinal Exam Due 11:59pm on December 11, 2007This take-home exam contains 8 problems. You are required to solve the 5 of the 8 problems. If you solve more than 5 problems, then the 5 highest scores of
Georgia Tech - CS - 1371
function heat = temperaturePlot(ri, ro, Ti, To) r = linspace(ro, ri, 100); R = log (ro./r); Ri = log (ro/ri); T = To + (Ti-To)*R/Ri; plot(r, T, 'red'), grid on title('Temperature vs Radius') xlabel('radius') ylabel('temp') heat = 'done';
Georgia Tech - CS - 1050
CS1050B HW 1 Answer Key 24. [13 Points Each 39 Total] b. p T T T T F F F F d. p T T T T F F F F f. p T T T T F F F F q T T F F T T F F r T F T F T F T F (pq) T T F F F F F F (pq) r T T F T F T F T q T T F F T T F F q T T F F T T F F r T F T F T F T
Georgia Tech - CS - 2004
Computational Geometry: Homework 3. Due: 2/23/2004 1. Given n points on a circle, develop an algorithm that would construct an angle-optimal triangulation on these points (i.e. one with the largest possible angle vector). Of course, the faster the al
Georgia Tech - CS - 8803
Computational Geometry: Homework 3. Due: 2/23/2004 1. Given n points on a circle, develop an algorithm that would construct an angle-optimal triangulation on these points (i.e. one with the largest possible angle vector). Of course, the faster the al
Georgia Tech - CS - 2004
1 CS 6210 - Midterm Oct. 2002 Closed book and closed notes Your Name: Prof. Schwan Please make time to work on each question in this exam. Partial credit will be given whenever possible. 1) Short questions: 30 mins. (questions marked with * have mor
Georgia Tech - CS - 6210
1 CS 6210 - Midterm Oct. 2002 Closed book and closed notes Your Name: Prof. Schwan Please make time to work on each question in this exam. Partial credit will be given whenever possible. 1) Short questions: 30 mins. (questions marked with * have mor
Georgia Tech - CS - 4440
Introduction to Data Management in Mobile ComputingWai Gen Yee and Sham NavatheReference PapersDatabase System Issues in Nomadic Computing,Alonso and Korth, SIGMOD Challenge Session, 1993Mobile Wireless Computing: Challenges in Data Managemen
Georgia Tech - CS - 3500
Lecture 1, Tue Jan 6 '04. Today's Topics: Overview of Part 1: Algorithm Design Principles Paradigm Problems Driving Computer Technologies Primitives of Analysis of Algorithms: Correctness. Complexity (Time & Space) in terms of input size n. Computa
Georgia Tech - CS - 6750
QualitativeThe s of C orie ognitionS tudying conte xtAge ndaQue stions Whe was P1 due n ? S eassum om ptions/proble s with pre m vious m ls ode S m of othe m ls of cognition um ary r ode S ituate action, activity the distribute d ory, d cognitio
Georgia Tech - CS - 6235
NGASSA DIANE MARIONECS 6235: Real-time SystemsProject proposal : Achieving Real-time constraints in wireless applications I- Goal The number of applications designed over wireless network keeps on increasing. Hence, it is necessary to find ways f
Georgia Tech - CS - 12
CS8803D Course Reading SummariesPaper #: 204Title: Application-Aware Adaptation for Mobile Computing(1) Problems1.The example in section three is really a different problem domain than what is talked about in the first two sections. The fir
Georgia Tech - CS - 8803
CS8803D Course Reading SummariesPaper #: 204Title: Application-Aware Adaptation for Mobile Computing(1) Problems1.The example in section three is really a different problem domain than what is talked about in the first two sections. The fir
Georgia Tech - CS - 12
CS8803D Course Reading SummariesPaper #: 198Title: PowerScope: A Tool for Profiling the Energy Usage of Mobile ApplicationsProblems:Energy efficiency is a major concern in the mobile computing enviornment. It has been realized that improveme
Georgia Tech - CS - 8803
CS8803D Course Reading SummariesPaper #: 198Title: PowerScope: A Tool for Profiling the Energy Usage of Mobile ApplicationsProblems:Energy efficiency is a major concern in the mobile computing enviornment. It has been realized that improveme
Georgia Tech - CS - 2001
GEORGIA INSTITUTE OF TECHNOLOGY College of ComputingCS6290 CS4290 | High-Performance Computer ArchitectureFall 2000 CS6290 CS4290 Homework 3 Issued: September 22, 2000 Due: September 29, 2000Purpose: Reading:This homework reviews pipeline opera
Georgia Tech - CS - 6290
GEORGIA INSTITUTE OF TECHNOLOGY College of ComputingCS6290 CS4290 | High-Performance Computer ArchitectureFall 2000 CS6290 CS4290 Homework 3 Issued: September 22, 2000 Due: September 29, 2000Purpose: Reading:This homework reviews pipeline opera
Georgia Tech - CS - 3500
CS 3500 Section C, Fall 2000Homework 6 due Wednesday, Oct. 4Problem 1 Problem 3.2, page 147 of Sipser. Problem 2 Give the complete description transition diagram or transition table of a deterministic Turingmachine recognizing the languagefw 2 f
Georgia Tech - CS - 1050
CS 1050 Section B, Spring 2001Homework 1 due Thursday, January 25Staple your solutions to the two parts separately and don't forget to write your name on each part.Part I Problem 1 Problem 2 Problem 3 Problem 4 Problem 5 Problem 6Exercise 8, pa
Georgia Tech - CS - 3500
CS 3500 Section C, Fall 2000Homework 10 due Thursday, Nov. 16Problem 1 Exercise 16.1 1, page 308 of CLR. Problem 2 Give examples showing that the following algorithms do not always nd the optimum matrix-chain multiplication. In other words you mus
Georgia Tech - CS - 3500
CS 3500 Section A Sample Mid-Term Exam Problem 1 (20 points) Give the state diagram of a DFA accepting the language specied by the regular expression 0 101 . (For half-credit you may give the diagram of an NFA with "-transitions.) Problem 2 (10 point
Georgia Tech - CS - 2001
GEORGIA INSTITUTE OF TECHNOLOGY College of ComputingCS6290 CS4290 | High-Performance Computer ArchitectureFall 2000 CS6290 CS4290 Homework 7 Issued: October 29, 2000 Due: November 10, 2000 This homework covers predication and introduces some issues
Georgia Tech - CS - 6290
GEORGIA INSTITUTE OF TECHNOLOGY College of ComputingCS6290 CS4290 | High-Performance Computer ArchitectureFall 2000 CS6290 CS4290 Homework 7 Issued: October 29, 2000 Due: November 10, 2000 This homework covers predication and introduces some issues
Georgia Tech - CS - 1050
CS 1050 Section B, Spring 2001Homework 8 due Tuesday, April 17Part I Problem 1 Problem 2 Problem 3 Problem 4Exercise 18, page 317. Exercise 34, page 318. What is the solution to your recurrence? Exercise 4a,b,c, page 330. Exercise 14, page 337. W
Georgia Tech - CS - 2001
HCI + Game GenresStage Theory, Memory, Mental Models Action, Adventure, Puzzle, etcJ an 19 Spr i ng 2001CS44551Stage TheoryC Working memory is small temporary storageMaintenance rehearsal decay displacementAnswer to problem is orga
Georgia Tech - CS - 3500
Homework Assignment #3-Each problem worth 20 points1. Sipser 2.31. Sipser 2.4 b, e, g2. Sipser 2.5 b, e, g3. Sipser 2.6 a, b4. Sipser 2.15
Georgia Tech - CS - 2006
CS 6255: Midterm Exam Instructor: Dr. ClarkName: October 14, 2004CS 6255 Fall 2004 - Midterm ExamProblem Possible Score 1 20 2 20 3 10 4 20 5 30 Total 100You can use 1 page of notes plus the MIB-II and SMI specifications. Answer the questions
Georgia Tech - CS - 3500
CS 3500C THEORY IHomework 6 SolutionProblem 1: 20 Points SolutionGive context free grammars generating the following languages: {w : the length of w is odd }. S XSX|0|1 X 0|1 {w : the length of w is odd and its middle symbol is 0 }. S XSX|0 X