1. 5.4 Routing Among the ISPs : BGP
1.1. eBGP & iBGP
1.1.1. Connections
1.2. BGP
1.2.1. Routes
1.2.2. Basics
1.2.3. Path Attributes
1.2.4. Path Advertisement
1.2.5. Messages
1.2.6. Route Selection
1.2.7. Achieving Policy Via Advertisement
1.3. BGP & OSPF
1.3.1. Forwarding Table Entries
1.4. Hot Potato Routing
1.5. Intra-AS & Inter-AS Routing
1.5.1. Different
2. 5.5 The SDN Control Plane
2.1. Recall
2.2. Software Defined Networking (SDN)
2.2.1. Analogy
2.2.2. Perspective
2.2.2.1. Data Plane Switches
2.2.2.2. SDN Controller
2.2.2.3. Control Applications
2.2.3. Control/Data Plane Interaction Example
2.2.4. Selected Challenges
2.3. Traffic Engineering
2.3.1. Difficult Traditional Routing
2.3.2. Difficult
2.4. Components of SDN Controller
2.5. OpenFlow
2.5.1. Protocol
2.5.2. Controller-To-Switch Messages
2.6. OpenDaylight (ODL) Controller
2.7. ONOS Controller
3. 5.6 ICMP : The Internet Control Message Protocol
3.1. Traceroute and ICMP
4. 5.7 Network Management and SNMP
4.1. Definition
4.2. Infrastructure
4.3. Protocol
4.3.1. Message Types
4.3.2. Message Formats
5. 5.1 Introduction
5.1. Network-Layer Functions
5.2. Per-Router Control Plane
5.3. Logically Centralized Control Plane
6. 5.2 Routing Protocols
6.1. Routing Protocols
6.1.1. Graph Abstraction Costs
6.1.2. Graph Abstraction of The Network
6.1.3. Routing Algorithm Classification
6.2. Link State
6.2.1. A Link-State Routing Algorithm
6.2.2. Dijsktra's Algorithm
6.2.2.1. Example
6.2.2.2. Discussion
6.3. Distance Vector
6.3.1. Algorithm
6.3.2. Bellman-Ford
6.3.2.1. Example
6.3.3. Link Cost Changes
6.3.4. Comparison of LS and DV Algorithm
7. 5.3 Intra-AS Routing In The Internet : OSPF
7.1. Making Routing Scalable
7.1.1. Internet Approach
7.2. Interconnected ASes
7.2.1. Inter-AS Tasks
7.3. Intra-AS Routing
7.3.1. Open Shortest Path First (OSPF)
7.3.1.1. Advanced Features
7.3.1.2. Hierarchical