Network routing : algorithms, protocols, and architectures

Network routing algorithms, protocols, and architectures

Network Routing: Algorithms, Protocols, and Architectures, Second Edition , explores network routing and how it can be broadly categorized into Internet routing, circuit-switched routing, and telecommunication transport network routing. The book systematically considers these routing paradigms, as w...

Descripción completa

Detalles Bibliográficos
Otros Autores: Medhi, Deepankar, author (author), Ramasamy, Karthik, author
Formato: Libro electrónico
Idioma:Inglés
Publicado: Cambridge, Massachusetts : Morgan Kaufmann Ppublishers 2018.
Edición:Second edition
Materias:
Computer networks.
Routers (Computer networks)
Computer network architectures.
Ver en Biblioteca Universitat Ramon Llull:https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009630280006719
Tabla de Contenidos:
  • Front Cover
  • Network Routing
  • Copyright
  • Contents
  • Foreword (1st Edition)
  • Preface (2nd Edition)
  • Acknowledgments
  • Preface (1st Edition)
  • Audience
  • Organization and Approach
  • Bonus Materials and Online Resources
  • Acknowledgments
  • About the Authors
  • Part 1 Routing: Basics and Foundations
  • 1 Networking and Network Routing: An Introduction
  • 1.1 Addressing and Internet Service: An Overview
  • 1.2 Network Routing: An Overview
  • 1.3 IPv4 Addressing
  • 1.3.1 Classful IPv4 Addressing Scheme
  • 1.3.2 Subnetting/Netmask in IPv4
  • 1.3.3 Classless Inter-Domain Routing (CIDR)
  • 1.4 IPv6 Addressing
  • 1.5 On Architectures
  • 1.6 Service Architecture
  • 1.7 Protocol Stack Architecture
  • 1.7.1 OSI Reference Model
  • 1.7.2 IP Protocol Stack Architecture
  • 1.8 Router Architecture
  • 1.9 Network Topology Architecture
  • 1.10 Network Management Architecture
  • 1.11 Global Telephone Network
  • 1.12 Communication Technologies
  • 1.13 Standards Committees
  • 1.13.1 Internet Engineering Task Force
  • 1.13.2 International Telecommunication Union
  • 1.14 Last Two Bits
  • 1.14.1 Type-Length-Value (TLV)
  • 1.14.2 Network Protocol Analyzer
  • 1.15 Summary
  • Further Lookup
  • Exercises
  • 2 Routing Algorithms: Shortest Path, Widest Path, and Spanning Tree
  • 2.1 Background
  • 2.2 Bellman-Ford Algorithm and the Distance Vector Approach
  • 2.2.1 Centralized View: Bellman-Ford Algorithm
  • 2.2.2 Distributed View: A Distance Vector Approach
  • 2.3 Dijkstra's Algorithm
  • 2.3.1 Centralized Approach
  • 2.3.2 Distributed Approach
  • 2.4 Comparison of the Bellman-Ford Algorithm and Dijkstra's Algorithm
  • 2.5 Shortest Path Computation with Candidate Path Caching
  • 2.6 Widest Path Computation with Candidate Path Caching
  • 2.7 Widest Path Algorithm
  • 2.7.1 Dijkstra-Based Approach
  • 2.7.2 Distance Vector-Based Approach.
  • 2.8 Shortest Widest Path and Widest Shortest Path
  • 2.9 Tree, Spanning Tree, and Steiner Tree Algorithms
  • 2.9.1 Spanning Tree: Breadth First Search and Depth First Search
  • 2.9.2 Minimum Spanning Tree
  • 2.9.3 Steiner Tree
  • 2.10 k-Shortest Paths Algorithm
  • 2.11 Summary
  • Further Lookup
  • Exercises
  • 3 Routing Protocols: Framework and Principles
  • 3.1 Routing Protocol, Routing Algorithm, and Routing Table
  • 3.2 Routing Information Representation and Protocol Messages
  • 3.3 Distance Vector Routing Protocol
  • 3.3.1 Conceptual Framework and Illustration
  • 3.3.2 Why Timers Matter
  • 3.3.3 Solutions
  • 3.3.4 Can We Avoid Loops?
  • 3.3.5 Distance Vector Protocol based on Diffusing Computation with Coordinated Updates (DUAL)
  • 3.3.6 Babel Routing Protocol
  • 3.4 Link State Routing Protocol
  • 3.4.1 Link State Protocol: In-Band Hop-by-Hop Dissemination
  • 3.4.2 Link State Protocol: In-Band Based on End-to-End Session
  • 3.4.3 Route Computation
  • 3.5 Path Vector Routing Protocol
  • 3.5.1 Basic Principle
  • 3.5.2 Path Vector with Path Caching
  • 3.6 Link Cost
  • 3.6.1 ARPANET Routing Metrics
  • 3.6.2 Other Metrics
  • 3.7 Threats to Routing Protocols
  • 3.8 Summary
  • Further Lookup
  • Exercises
  • 4 Network Flow Models
  • 4.1 Terminologies
  • 4.2 Single-Commodity Network Flow
  • 4.2.1 A Three-Node Illustration
  • 4.2.2 Formal Description and Minimum Cost Routing Objective
  • 4.2.3 Variation in Objective: Load Balancing
  • 4.2.4 Variation in Objective: Average Delay
  • 4.2.5 Summary and Applicability
  • 4.3 Multicommodity Network Flow: Three-Node Example
  • 4.3.1 Minimum Cost Routing: Illustration
  • 4.3.2 Load Balancing: Illustration
  • 4.3.3 Minimum Average Delay: Illustration
  • 4.4 Multicommodity Network Flow: General Link-Path Formulation
  • 4.4.1 Background on Notation
  • 4.4.2 Minimum Cost Routing: General Link-Path Formulation.
  • 4.4.3 Load Balancing: Link-Path Formulation
  • 4.4.4 Minimum Average Delay: Link-Path Formulation
  • 4.4.5 How Many Nonzero Flows at Optimality?
  • 4.5 Multicommodity Network Flow Problem: Non-Splittable Flow
  • 4.6 Node-Link Formulation
  • 4.6.1 Minimum Cost Single-Commodity Network Flow Problem
  • 4.6.2 Minimum Cost Multicommodity Network Flow Problem
  • 4.6.3 Load Balancing Multicommodity Network Flow Problem
  • 4.6.4 Shortest Path Routing
  • 4.6.5 Shortest Path Tree
  • 4.7 Generating Traf c Matrix
  • 4.8 Summary
  • Further Lookup
  • Exercises
  • Part 2 Internet Routing
  • 5 IP Routing and Distance Vector Protocol Family
  • 5.1 Routers, Networks, and Routing Information: Some Basics
  • 5.1.1 Routing Table
  • 5.1.2 Communication of Routing Information
  • 5.2 Static Routes
  • 5.3 Routing Information Protocol, Version 1 (RIPv1)
  • 5.3.1 Communication and Message Format
  • 5.3.2 General Operation
  • 5.3.3 Is RIPv1 Good to Use?
  • 5.4 Routing Information Protocol, Version 2 (RIPv2)
  • 5.5 Interior Gateway Routing Protocol (IGRP)
  • 5.5.1 Packet Format
  • 5.5.2 Computing Composite Metric
  • 5.6 Enhanced Interior Gateway Routing Protocol (EIGRP)
  • 5.6.1 Packet Format
  • 5.7 Route Redistribution
  • 5.8 Summary
  • Further Lookup
  • Exercises
  • 6 OSPF and Integrated IS-IS
  • 6.1 From a Protocol Family to an Instance of a Protocol
  • 6.2 OSPF: Protocol Features
  • 6.2.1 Network Hierarchy
  • 6.2.2 Router Classi cation
  • 6.2.3 Network Types
  • 6.2.4 Flooding
  • 6.2.5 Link State Advertisement (LSA) Types
  • 6.2.7 Routing Computation and Equal-Cost MultiPath
  • 6.2.8 Additional Features
  • 6.3 Multitopology Routing in OSPF
  • 6.4 OSPF Packet Format
  • 6.5 Examples of Router LSA and Network LSA
  • 6.6 Integrated IS-IS
  • 6.6.1 Key Features
  • 6.7 Similarities and Differences Between IS-IS and OSPF
  • 6.8 OSPFv3 and IS-IS for IPv6.
  • 6.9 Additional Extensions to OSPF and IS-IS
  • 6.10 Summary
  • Further Lookup
  • ExerciseS
  • 7 IP Traf c Engineering
  • 7.1 Traf c, Stochasticity, Delay, and Utilization
  • 7.1.1 What Is IP Network Traf c?
  • 7.1.2 Traf c and Performance Measures
  • 7.1.3 Characterizing Traf c
  • 7.1.4 Average Delay in a Single Link System
  • 7.1.5 Nonstationarity of Traf c
  • 7.2 Applications' View
  • 7.2.1 TCP Throughput and Possible Bottlenecks
  • 7.2.2 Bandwidth-Delay Product
  • 7.2.3 Router Buffer Size
  • 7.3 Traf c Engineering: An Architectural Framework
  • 7.4 Traf c Engineering: A Four-Node Illustration
  • 7.4.1 Network Flow Optimization
  • 7.4.2 Shortest Path Routing and Network Flow
  • 7.5 IGP Metric (Link Weight) Determination Problem for the Load Balancing Objective: Preliminary Discussion
  • 7.6 Determining IGP Link Weights via duality of MCNF Problems
  • 7.6.1 Illustration of Duality Through a Three-Node Network for Minimum Cost Routing
  • 7.6.2 Minimum Cost Routing, Duality, and Link Weights
  • 7.6.3 Illustration of Duality Through a Three-Node Network for the Load Balancing Objective
  • 7.6.4 Load Balancing Problem, duality, and Link Weights
  • 7.6.5 A Composite Objective Function, duality, and Link Weights
  • 7.6.6 Minimization of Average Delay, duality, and Link Weights
  • 7.7 Illustration of Link Weight Determination through Duality
  • 7.7.1 Case Study: I
  • 7.7.2 Case Study: II
  • 7.8 Link Weight Determination: Large Networks
  • 7.9 IP Traf c Engineering of PoP-to-DataCenter Networks
  • 7.10 Summary
  • Further Lookup
  • Exercises
  • 8 Multicast Routing
  • 8.1 Multicast IP Addressing
  • 8.2 Internet Group Management Protocol (IGMP)
  • 8.3 Multicast Listener Discovery Protocol (MLD)
  • 8.4 Reverse Path Forwarding (RPF)
  • 8.5 Distance Vector Multicast Routing Protocol (DVMRP)
  • 8.6 Multicast OSPF
  • 8.7 Core Based Trees.
  • 8.8 Protocol Independent Multicast (PIM)
  • 8.8.1 PIM-Dense Mode
  • 8.8.2 PIM-Sparse Mode
  • 8.8.3 Selecting and Advertising Rendezvous Point for PIM Sparse Mode
  • 8.8.4 Source Speci c Multicast
  • 8.9 Inter-Domain Multicast Routing
  • 8.9.1 Border Gateway Multicast Protocol (BGMP)
  • 8.9.2 Multiprotocol Extension of BGP and a Composite Approach
  • 8.10 Internet Protocol Television (IPTV) Multicasting
  • 8.11 Summary
  • Further Lookup
  • Exercises
  • 9 BGP
  • 9.1 BGP: A Brief Overview
  • 9.2 BGP: Basic Terminology
  • 9.3 BGP Operations
  • 9.3.1 Message Operations
  • 9.3.2 BGP Timers
  • 9.4 BGP Con guration Initialization
  • 9.5 Two Faces of BGP: External BGP (eBGP) and Internal BGP (iBGP)
  • 9.6 Path Attributes
  • 9.7 BGP Decision Process
  • 9.7.1 BGP Path Selection Process
  • 9.7.2 Route Aggregation and Dissemination
  • 9.7.3 Recap
  • 9.8 Internal BGP Scalability
  • 9.8.1 Route Re ection Approach
  • 9.8.2 Confederation Approach
  • 9.9 Route Flap Damping
  • 9.10 BGP Additional Features and Extensions
  • 9.10.1 Communities
  • 9.10.2 BGP 4-byte Autonomous Systems Number Space
  • 9.10.3 BGP Multiprotocol Extension (MP-BGP)
  • 9.10.4 BGP for IPv6
  • 9.10.5 BGP/MPLS
  • 9.11 BGP Vulnerabilities
  • 9.12 Securing BGP
  • 9.12.1 Secure BGP (S-BGP)
  • 9.12.2 Secure Origin BGP (soBGP)
  • 9.12.3 Resource Public Key Infrastructure (RPKI) Architecture
  • 9.13 Finite State Machine of A BGP Connection
  • 9.14 BGP4 Protocol Message Format
  • 9.14.1 Common Header
  • 9.14.2 Message Type: OPEN
  • 9.14.3 Message Type: UPDATE
  • 9.14.4 Message Type: NOTIFICATION
  • 9.14.5 Message Type: KEEPALIVE
  • 9.14.6 Message Type: ROUTE-REFRESH
  • 9.14.7 Path Attribute in UPDATE message
  • 9.15 Summary
  • Further Lookup
  • Exercises
  • 10 Routing in the Global Internet
  • 10.1 Internet Routing Evolution
  • 10.2 Addressing and Routing: Illustrations.
  • 10.2.1 Scenario A: Routing a Packet (Same Subnet).

Ejemplares similares