NETWORK LAYER CONTROL PLANE

Transcription

1 NETWORK LAYER CONTROL PLANE 1

2 GOALS Understand principles behind network control plane Traditional routing algorithms SDN controlllers Internet Control Message Protocol Network management And their instantiation, implementation in the Internet: OSPF, BGP, OpenFlow, ODL and ONOS controllers, ICMP, SNMP

3 INTRODUCTION 2

4 INTRODUCTION 3. 1

5 NETWORK LAYER FUNCTIONS Data plane Forwarding: move packets from router s input to appropriate router output Control plane Routing: determine route taken by packets from source to dest. Two approaches to structuring network control plane: per-router control (traditional) logically centralized control (software de ned networking) 3. 2

6 PER-ROUTER CONTROL PLANE 3. 3

7 LOGICALLY CENTRALIZED CONTROL PLANE (SDN) 3. 4

8 ROUTING ALGORITHMS

9 GRAPH ABSTRACTION graph: G = (N,E) N = set of routers = { u, v, w, x, y, z } E = set of links = { (u,v), (u,x), (v,x), (v,w), (x,w), (x,y), (w,y), (w,z), (y,z) } aside: graph abstraction is useful in other network contexts, e.g., P2P, where N is set of peers and E is set of TCP connections

10 GRAPH ABSTRACTION: COSTS c(x,x ) = cost of link (x,x ) e.g., c(w,z) = 5 cost could always be 1, or inversely related to bandwidth, or inversely related to congestion cost of path (x1, x2, x3,, xp) = c(x1,x2) + c(x2,x3) + + c(xp-1,xp) 4. 2

11 GRAPH ABSTRACTION: COSTS Key question: What is the least-cost path between u and z? Routing algorithm: Algorithm that nds that least cost path 4. 34

12 ROUTING ALGORITHM CLASSIFICATION Q: Global or decentralized information? Global: all routers have complete topology, link cost info link state algorithms Decentralized: router knows physically-connected neighbors, link costs to neighbors iterative process of computation, exchange of info with neighbors distance vector algorithms

13 ROUTING ALGORITHM CLASSIFICATION Q: Static or dynamic? Static: routes change slowly over time Dynamic: routes change more quickly periodic update in response to link cost changes 4. 5

14 A LINK-STATE ROUTING ALGORITHM Dijkstra s algorithm net topology, link costs known to all nodes accomplished via link state broadcast all nodes have same info computes least cost paths from one node (source) to all other nodes gives forwarding table for that node iterative: after k iterations, know least cost path to k dest. s 4. 6

15 A LINK-STATE ROUTING ALGORITHM Notation: c(x,y): link cost from node x to y; if not direct neighbors D(v): current value of cost of path from source to dest. v p(v): predecessor node along path from source to v N': set of nodes whose least cost path de nitively known 4. 7

16 DIJSKTRA S ALGORITHM 4. 8

17 DIJKSTRA S ALGORITHM: EXAMPLE Shortest paths from u 4. 9

18 DIJKSTRA S ALGORITHM: EXAMPLE 4. 10

19 DIJKSTRA S ALGORITHM: EXAMPLE 4. 11

20 DIJKSTRA S ALGORITHM: EXAMPLE 4. 12

21 DIJKSTRA S ALGORITHM: EXAMPLE 4. 13

22 DIJKSTRA S ALGORITHM: EXAMPLE 4. 14

23 DIJKSTRA S ALGORITHM: EXAMPLE construct shortest path tree by tracing predecessor nodes ties can exist (can be broken arbitrarily) 4. 15

24 DIJKSTRA S ALGORITHM: ANOTHER EXAMPLE 4. 16

25 DIJKSTRA S ALGORITHM: ANOTHER EXAMPLE Resulting shortest path tree from u Resulting forwarding table in u 4. 17

26 DIJKSTRA S ALGORITHM, DISCUSSION Algorithm complexity: n nodes each iteration: need to check all nodes, w, not in N n(n+1)/2 comparisons: O(n 2 ) more ef cient implementations possible: O(n log(n))

27 DIJKSTRA S ALGORITHM, DISCUSSION Oscillations possible: e.g., support link cost equals amount of carried traf c 4. 20

28 DIJKSTRA S ALGORITHM, DISCUSSION 4. 21

29 DIJKSTRA S ALGORITHM, DISCUSSION 4. 22

30 DIJKSTRA S ALGORITHM, DISCUSSION 4. 23

31 DIJKSTRA S ALGORITHM, DISCUSSION 4. 24

32 DIJKSTRA S ALGORITHM, DISCUSSION 4. 25

33 DIJKSTRA S ALGORITHM, DISCUSSION 4. 26

34 DIJKSTRA S ALGORITHM, DISCUSSION 4. 27

35 DIJKSTRA S ALGORITHM, DISCUSSION 4. 28

36 DIJKSTRA S ALGORITHM, DISCUSSION 4. 29

37 DIJKSTRA S ALGORITHM, DISCUSSION 4. 30

38 DIJKSTRA S ALGORITHM, DISCUSSION 4. 31

39 DIJKSTRA S ALGORITHM, DISCUSSION 4. 32

40 DIJKSTRA S ALGORITHM, DISCUSSION 4. 33

41 DISTANCE VECTOR ALGORITHM Bellman-Ford equation (dynamic programming) let: dx(y) := cost of least-cost path from x to y then: dx(y) = minv { c(x,v) + dv(y) } Where: minv min taken over all neighbors v of x c(x,v) cost to neighbor v dv(y) cost from neighbor v to destination y

42 BELLMAN-FORD EXAMPLE clearly, dv(z) = 5, dx(z) = 3, dw(z) = 3 B-F equation says: du(z) = min{ c(u,v) + dv(z), c(u,x) + dx(z), c(u,w) + dw(z) } = min {2 + 5, 1 + 3, } =

43 BELLMAN-FORD EXAMPLE Node achieving minimum is next hop in shortest path, used in forwarding table

44 DISTANCE VECTOR ALGORITHM Dx(y) = estimate of least cost from x to y x maintains distance vector Dx = [Dx(y): y in N ] node x: knows cost to each neighbor v: c(x,v) maintains its neighbors distance vectors. For each neighbor v, x maintains Dv = [Dv(y): y in N ]

45 DISTANCE VECTOR ALGORITHM Key idea: from time-to-time, each node sends its own distance vector estimate to neighbors when x receives new DV estimate from neighbor, it updates its own DV using B-F equation: Dx(y) minv { c(x,v) + Dv(y) } for each node y in N under minor, natural conditions, the estimate Dx(y) converge to the actual least cost dx(y) 4. 37

46 DISTANCE VECTOR ALGORITHM Iterative, asynchronous: Each local iteration caused by: local link cost change DV update message from neighbor Distributed: Each node noti es neighbors only when its DV changes neighbors then notify their neighbors if necessary 4. 38

47 DISTANCE VECTOR ALGORITHM Each node: 4. 39

48 DISTANCE VECTOR ALGORITHM - EXAMPLE 4. 40

49 DISTANCE VECTOR ALGORITHM - EXAMPLE 4. 41

50 DISTANCE VECTOR ALGORITHM - EXAMPLE 4. 42

51 DISTANCE VECTOR ALGORITHM - EXAMPLE 4. 43

52 DISTANCE VECTOR: LINK COST CHANGES Link cost changes: node detects local link cost change updates routing info, recalculates distance vector if DV changes, notify neighbors

53 DISTANCE VECTOR: LINK COST CHANGES "good news travels fast" [t0 :] y detects link-cost change, updates its DV, informs its neighbors. [t1 :] z receives update from y, updates its table, computes new least cost to x, sends its neighbors its DV. [t2 :] y receives z s update, updates its distance table. y s least costs do not change, so y does not send a message to z.

54 DISTANCE VECTOR: LINK COST CHANGES Link cost changes: node detects local link cost change bad news travels slow count to in nity problem! 44 iterations before algorithm stabilizes: see textbook 4. 46

55 DISTANCE VECTOR: POISONED REVERSE: If Z routes through Y to get to X : Z tells Y its (Z s) distance to X is in nite (so Y won t route to X via Z) will this completely solve count to in nity problem?

56 COMPARISON OF LS AND DV ALGORITHMS Message complexity LS: with n nodes, E links, O(nE) msgs sent DV: exchange between neighbors only convergence time varies 4. 49

57 COMPARISON OF LS AND DV ALGORITHMS Speed of convergence LS: O(n 2 ) algorithm requires O(nE) msgs may have oscillations DV: convergence time varies may be routing loops count-to-in nity problem

58 COMPARISON OF LS AND DV ALGORITHMS Robustness: what happens if router malfunctions? LS: node can advertise incorrect link cost each node computes only its own table DV: DV node can advertise incorrect path cost each node s table used by others error propagate through network 4. 50

59 ROUTING IN THE INTERNET

60 ROUTING SO FAR our routing study thus far - idealization all routers identical network at not true in practice 5. 2

61 HIERARCHICAL ROUTING Scale: with 600 million destinations: can t store all dest s in routing tables! routing table exchange would swamp links! Administrative autonomy internet = network of networks each network admin may want to control routing in its own network

62 INTERNET APPROACH TO SCALABLE ROUTING Aggregate routers into regions, autonomous systems (AS) 5. 34

63 INTRA-AS ROUTING Routing among hosts, routers in same AS ( network ) All routers in AS must run same intra-domain protocol Routers in different AS can run different intra-domain routing protocol Gateway router: at edge of its own AS, has link(s) to router(s) in other AS es 5. 5

64 INTER-AS ROUTING Routing among AS es Gateways perform inter-domain routing (as well as intra-domain routing) 5. 6

65 INTERCONNECTED AS ES

66 INTERCONNECTED AS ES Forwarding table con gured by both intra- and inter-as routing algorithm intra-as sets entries for internal dests inter-as and intra-as sets entries for external dests 5. 78

67 INTER-AS TASKS

68 INTER-AS TASKS suppose router in AS1 receives datagram destined outside of AS1: router should forward packet to gateway router, but which one? AS1 must: learn which dests are reachable through AS2, which through AS3 propagate this reachability info to all routers in AS1 Job of inter-as routing! 5. 9

69 INTRA-AS ROUTING also known as interior gateway protocols (IGP) most common intra-as routing protocols: RIP: Routing Information Protocol OSPF: Open Shortest Path First IGRP: Interior Gateway Routing Protocol (Cisco proprietary) 5. 10

70 OSPF (OPEN SHORTEST PATH FIRST) open : publicly available uses link state algorithm LS packet dissemination topology map at each node route computation using Dijkstra s algorithm OSPF advertisement carries one entry per neighbor advertisements ooded to entire AS carried in OSPF messages directly over IP (rather than TCP or UDP) IS-IS routing protocol: nearly identical to OSPF 5. 11

71 OSPF ADVANCED FEATURES Security: all OSPF messages authenticated (to prevent malicious intrusion) Multiple same-cost paths allowed (only one path in RIP) Integrated uni- and multicast support: Multicast OSPF (MOSPF) uses same topology data base as OSPF hierarchical OSPF in large domains

72 HIERARCHICAL OSPF 5. 13

73 HIERARCHICAL OSPF two-level hierarchy: local area, backbone. link-state advertisements only in area each nodes has detailed area topology; only know direction (shortest path) to nets in other areas. area border routers: summarize distances to nets in own area, advertise to other Area Border routers. backbone routers: run OSPF routing limited to backbone. boundary routers: connect to other AS s

74 ROUTING AMONG THE ISPS: BGP

75 INTERNET INTER-AS ROUTING: BGP BGP (Border Gateway Protocol): the de facto inter-domain routing protocol glue that holds the Internet together BGP provides each AS a means to: ebgp: obtain subnet reachability information from neighboring ASs. ibgp: propagate reachability information to all AS-internal routers. determine good routes to other networks based on reachability information and policy. allows subnet to advertise its existence to rest of Internet: I am here

76 EBGP, IBGP CONNECTIONS 6. 2

77 BGP BASICS BGP session: two BGP routers ( peers ) exchange BGP messages: advertising paths to different destination network pre xes ( path vector protocol) exchanged over semi-permanent TCP connections when AS3 advertises a pre x to AS1: AS3 promises it will forward datagrams towards that pre x AS3 can aggregate pre xes in its advertisement 6. 3

78 BGP BASICS 6. 4

79 DISTRIBUTING PATH INFORMATION advertised pre x includes BGP attributes pre x + attributes = route 6. 5

80 BGP ATTRIBUTES Two important attributes: AS-PATH: contains ASs through which pre x advertisement has passed: e.g., AS 67, AS 17 NEXT-HOP: indicates speci c internal-as router to next-hop AS. (may be multiple links from current AS to next-hop-as) 6. 6

81 PATH ATTRIBUTES AND BGP ROUTES gateway router receiving route advertisement uses import policy to accept/decline e.g., never route through AS x policy-based routing 6. 78

82 BGP PATH ADVERTISEMENT AS2 router 2c receives path advertisement AS3,X (via ebgp) from AS3 router 3a Based on AS2 policy, AS2 router 2c accepts path AS3,X, propagates (via ibgp) to all AS2 routers Based on AS2 policy, AS2 router 2a advertises (via ebgp) path AS2, AS3, X to AS1 router 1c

83 BGP PATH ADVERTISEMENT Gateway router may learn about multiple paths to destination: AS1 gateway router 1c learns path AS2,AS3,X from 2a AS1 gateway router 1c learns path AS3,X from 3a Based on policy, AS1 gateway router 1c chooses path AS3,X, and advertises path within AS1 via ibgp 6. 9

84 BGP MESSAGES BGP messages exchanged between peers over TCP connection BGP messages: [OPEN:] opens TCP connection to peer and authenticates sender [UPDATE:] advertises new path (or withdraws old) [KEEPALIVE:] keeps connection alive in absence of UPDATES; also ACKs OPEN request [NOTIFICATION:] reports errors in previous msg; also used to close connection 6. 10

85 BGP, OSPF, FORWARDING TABLE ENTRIES Q: how does router set forwarding table entry to distant pre x? 1a, 1b, 1c learn about dest X via ibgp from 1c: path to X goes through 1c 1d: OSPF intra-domain routing: to get to 1c, forward over outgoing local interface

86 BGP ROUTE SELECTION router may learn about more than 1 route to destination AS, selects route based on: 1. Local preference value attribute: policy decision 2. Shortest AS-PATH 3. Closest NEXT-HOP router: hot potato routing 4. Additional criteria 6. 12

87 IP-ANYCAST Consider 1. Applications having replicated content on different servers in different geographical locations 2. Have each user access the closest server IP-Anycast service Often used in DNS BGP s route selection-algorithm 6. 13

88 IP-ANYCAST 6. 14

89 IP-ANYCAST - CAVEAT If used by CDN: different datagrams might end up at different locations. Extensively used in DNS to locate root DNS server Recall: 13 different IP addresses for Root DNS servers each with scattered set of servers IP-Anycast is used to route to the closest 6. 15

90 BGP ROUTING POLICY 6. 16

91 BGP ROUTING POLICY A,B,C are provider networks X,W,Y are customer (of provider networks) X is dual-homed: attached to two networks policy to enforce: X does not want to route from B to C via X.. so X will not advertise to B a route to C 6. 17

92 BGP ROUTING POLICY A advertises path AW to B and to C B Chooses not to advertise path BAW to C B gets no revenue for routing CBAW since none of C, A, W are B s customers C does not learn about CBAw path C will route CAw (not using B) to get to w 6. 18

93 WHY DIFFERENT INTRA-, INTER-AS ROUTING? Policy inter-as: admin wants control over how its traf c routed, who routes through its net. intra-as: single admin, so no policy decisions needed

94 WHY DIFFERENT INTRA-, INTER-AS ROUTING? Scale hierarchical routing saves table size, reduced update traf c 6. 21

95 WHY DIFFERENT INTRA-, INTER-AS ROUTING? Performance intra-as: can focus on performance inter-as: policy may dominate over performance 6. 22

96 OBTAINING INTERNET PRESENCE 7. 1

97 THE PROBLEM You have made a new company - and wish to have an internet presence! How is this obtained? Website with product presentation for your employees DNS server for This includes not just BGP, but also IP Addressing, DNS and more

98 BRINGING PIECES TOGEATHER Internet connectivity: Contact local ISP Buy internet via DSL, cable, ber etc. Also receive an IP range fx. a /24 address range (256 addresses) Assign IP address to: Webserver (or loadbalancer and webservers) Mail server DNS server 7. 2

99 BRINGING PIECES TOGEATHER Domain name: Contact an internet registrar to obtain a domain name for your company: "Nerdy-stuff-are-us.com" Provide the registrar with the IP address for your DNS server (authoritative) Now registrered in the top level domain server 7. 3

100 BRINGING PIECES TOGEATHER When a customer now knows your IP address, how will the internet know where to locate your server? I.e. how to deliver the TCP-SYN datagram? 7. 45

101 BRINGING PIECES TOGEATHER Router will look in forwarding table for an output direction your companys /24 address range Each router should know where it is located! BGP - your local ISP will use BGP to announce the presence of your subnet to the ISPs it connects to, who in turn will use BGP to propagate this information. 7. 6

102 THE SDN CONTROL PLANE 8. 1

103 SOFTWARE DEFINED NETWORKING (SDN) Internet network layer: historically has been implemented via distributed, per-router approach monolithic router contains switching hardware, runs proprietary implementation of Internet standard protocols (IP, RIP, IS-IS, OSPF, BGP) in proprietary router OS (e.g., Cisco IOS) different middleboxes for different network layer functions: rewalls, load balancers, NAT boxes,.. ~2005: renewed interest in rethinking network control plane

104 RECALL: PER-ROUTER CONTROL PLANE Individual routing algorithm components in each and every router interact with each other in control plane to compute forwarding tables 8. 2

105 RECALL: LOGICALLY CENTRALIZED CONTROL PLANE A distinct (typically remote) controller interacts with local control agents (CAs) in routers to compute forwarding tables 8. 3

106 SOFTWARE DEFINED NETWORKING (SDN) Why a logically centralized control plane? easier network management: avoid router miscon gurations, greater exibility of traf c ows table-based forwarding (recall OpenFlow API) allows programming routers centralized programming easier: compute tables centrally and distribute distributed programming: more dif cult: compute tables as result of distributed algorithm (protocol) implemented in each and every router open (non-proprietary) implementation of control plane 8. 4

107 TRAFFIC ENGINEERING: DIFFICULT TRADITIONAL ROUTING Q: what if network operator wants u-to-z traf c to ow along uvwz, x-to-z traf c to ow xwyz? A: need to de ne link weights so traf c routing algorithm computes routes accordingly (or need a new routing algorithm)! Link weights are only control knobs : wrong! 8. 5

108 TRAFFIC ENGINEERING: DIFFICULT TRADITIONAL ROUTING Q: what if network operator wants to split u-to-z traf c along uvwz and uxyz (load balancing)? A: can t do it (or need a new routing algorithm) 8. 6

109 TRAFFIC ENGINEERING: DIFFICULT TRADITIONAL ROUTING Q: what if w wants to route blue and red traf c differently? A: can t do it (with destination based forwarding, and LS, DV routing) 8. 7

110 SOFTWARE DEFINED NETWORKING (SDN) 8. 8

111 ANALOGY: MAINFRAME TO PC EVOLUTION 8. 9

112 SDN PERSPECTIVE: DATA PLANE SWITCHES 8. 10

113 SDN PERSPECTIVE: DATA PLANE SWITCHES Data plane switches fast, simple, commodity switches implementing generalized data-plane forwarding (Section 4.4) in hardware switch ow table computed, installed by controller API for table-based switch control (e.g., OpenFlow) de nes what is controllable and what is not protocol for communicating with controller (e.g., OpenFlow) 8. 11

114 SDN PERSPECTIVE: SDN CONTROLLER 8. 12

115 SDN PERSPECTIVE: SDN CONTROLLER maintain network state information SDN controller (network OS) interacts with network control applications above via northbound API interacts with network switches below via southbound API implemented as distributed system for performance, scalability, faulttolerance, robustness 8. 13

116 SDN PERSPECTIVE: CONTROL APPLICATIONS 8. 14

117 SDN PERSPECTIVE: CONTROL APPLICATIONS network-control apps brains of control: implement control functions using lower-level services, API provided by SND controller unbundled: can be provided by 3rd party: distinct from routing vendor, or SDN controller 8. 15

118 COMPONENTS OF SDN CONTROLLER 8. 16

119 COMPONENTS OF SDN CONTROLLER Interface layer to network control apps: abstractions API Network-wide state management layer: state of networks links, switches, services: a distributed database Communication layer: communicate between SDN controller and controlled switches

120 OPENFLOW PROTOCOL

121 OPENFLOW PROTOCOL Operates between controller, switch TCP used to exchange messages (Port 6653) optional encryption 3 classes of OpenFlow messages: controller-to-switch asynchronous (switch to controller) symmetric (misc) 8. 19

122 OPENFLOW: CONTROLLER-TO-SWITCH MESSAGES Key controller-to-switch messages Con guration: controller queries/sets switch con guration parameters Modify-State: add, delete, modify ow entries in the OpenFlow tables Read-State: controller queries switch features, switch replies (for statistics, counter values) Send-Packet: controller can send this packet out of speci c switch port (Message includes package) 8. 20

123 OPENFLOW: SWITCH-TO-CONTROLLER MESSAGES Key switch-to-controller messages Flow-Removed: ow table entry deleted at switch (timeout etc) Port status: inform controller of a change on a port. Packet-in: transfer packet (and its control) to controller. (FX if not matching any rules) Fortunately, network operators don t program switches by creating/sending OpenFlow messages directly. Instead use higher-level abstraction at controller 8. 21

124 SDN: CONTROL/DATA PLANE INTERACTION EXAMPLE S1, experiencing link failure using OpenFlow port status message to notify controller 8. 22

125 SDN: CONTROL/DATA PLANE INTERACTION EXAMPLE SDN controller receives OpenFlow message, updates link status info 8. 23

126 SDN: CONTROL/DATA PLANE INTERACTION EXAMPLE Dijkstra s routing algorithm application has previously registered to be called when ever link status changes. It is called

127 SDN: CONTROL/DATA PLANE INTERACTION EXAMPLE Dijkstra s routing algorithm access network graph info, link state info in controller, computes new routes 8. 25

128 SDN: CONTROL/DATA PLANE INTERACTION EXAMPLE link state routing app interacts with ow-table-computation component in SDN controller, which computes new ow tables needed 8. 26

129 SDN: CONTROL/DATA PLANE INTERACTION EXAMPLE Controller uses OpenFlow to install new tables in switches that need updating 8. 27

130 OPENDAYLIGHT (ODL) CONTROLLER 8. 28

131 OPENDAYLIGHT (ODL) CONTROLLER ODL Lithium controller network apps may be contained within, or be external to SDN controller (REST) Service Abstraction Layer: interconnects internal, external applications and services (SAL) 8. 30

132 ONOS CONTROLLER 8. 29

133 ONOS CONTROLLER control apps separate from controller intent framework: high-level speci cation of service: what rather than how considerable emphasis on distributed core: service reliability, replication performance scaling

134 SDN: SELECTED CHALLENGES hardening the control plane: dependable, reliable, performance-scalable, secure distributed system robustness to failures: leverage strong theory of reliable distributed system for control plane dependability, security: baked in from day one? networks, protocols meeting mission-speci c requirements e.g., real-time, ultra-reliable, ultra-secure Internet-scaling

135 ICMP

136 ICMP Internet control message protocol used by hosts and routers to communicate network-level information error reporting: unreachable host, network, port, protocol echo request/reply (used by ping) network-layer above IP: ICMP msgs carried in IP datagrams ICMP message: type, code plus rst 8 bytes of IP datagram causing error

137 ICMP: TYPES Type Code Description 0 0 echo reply (ping) 3 0 dest. network unreachable 3 1 dest host unreachable 3 2 dest protocol unreachable 3 3 dest port unreachable 3 6 dest network unknown 3 7 dest host unknown 4 0 source quench (congestion control - not used) 8 0 echo request (ping) 9 0 route advertisement 10 0 router discovery 11 0 TTL expired 12 0 bad IP header 9. 2

138 PING AND ICMP ICMP Type 8 Code 0 Message to the speci ed host 9. 34

139 TRACEROUTE AND ICMP source sends series of UDP segments to dest rst set has TTL =1 second set has TTL=2, etc. unlikely port number when nth set of datagrams arrives to nth router: router discards datagrams and sends source ICMP messages (type 11, code 0) ICMP messages includes name of router \& IP address when ICMP messages arrives, source records RTTs

140 TRACEROUTE AND ICMP stopping criteria: UDP segment eventually arrives at destination host destination returns ICMP port unreachable message (type 3, code 3) source stops 9. 5

141 NETWORK MANAGEMENT AND SNMP

142 WHAT IS NETWORK MANAGEMENT? autonomous systems (aka network ): 1000s of interacting hardware/software components "Network management includes the deployment, integration and coordination of the hardware, software, and human elements to monitor, test, poll, con gure, analyze, evaluate, and control the network and element resources to meet the real-time, operational performance, and Quality of Service requirements at a reasonable cost."

143 INFRASTRUCTURE FOR NETWORK MANAGEMENT Managed devices contain managed objects whose data is gathered into a Management Information Base (MIB) 10. 2

144 SNMP PROTOCOL Two ways to convey MIB info, commands: request/response mode trap mode

145 SNMP PROTOCOL: REQUEST/RESPONSE MODE

146 SNMP PROTOCOL: TRAP MODE 10. 5

147 SNMP PROTOCOL: MESSAGE TYPES Message type GetRequest / GetNextRequest / GetBulkRequest InformRequest SetRequest Response Function manager-to-agent: get me data (data instance, next data in list, block of data) manager-to-manager: here s MIB value manager-to-agent: set MIB value Agent-to-manager: value, response to Request Trap Agent-to-manager: inform manager of exceptional event 10. 6

148 SNMP PROTOCOL: MESSAGE FORMATS 10. 7

149 SUMMARY approaches to network control plane per-router control (traditional) logically centralized control (software de ned networking) traditional routing algorithms implementation in Internet: OSPF, BGP SDN controllers implementation in practice: ODL, ONOS Internet Control Message Protocol network management 10. 8