mạng máy tính nâng cao nguyễn đức thái chương ter5 the network layer sinhvienzone com

om Zo ne C Chapter Si nh Vi en The Network Layer SinhVienZone.com https://fb.com/sinhvienzonevn nh Vi en Zo ne C Store-and-Forward Packet Switching Services Provided to the Transport Layer Implementation of Connectionless Service Implementation of Connection-Oriented Service Comparison of Virtual-Circuit and Datagram Subnets Si • • • • • om Network Layer Design Isues SinhVienZone.com https://fb.com/sinhvienzonevn ne C om Store-and-Forward Packet Switching Si nh Vi en Zo fig 5-1 The environment of the network layer protocols SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om Implementation of Connectionless Service Routing within a diagram subnet SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om Implementation of Connection-Oriented Service Routing within a virtual-circuit subnet SinhVienZone.com https://fb.com/sinhvienzonevn Zo ne C om Comparison of Virtual-Circuit and Datagram Subnets Si nh Vi en 5-4 SinhVienZone.com https://fb.com/sinhvienzonevn Routing Algorithms nh Vi en Zo ne C om The Optimality Principle Shortest Path Routing Flooding Distance Vector Routing Link State Routing Hierarchical Routing Broadcast Routing Multicast Routing Routing for Mobile Hosts Routing in Ad Hoc Networks Si • • • • • • • • • • SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om Routing Algorithms (2) Conflict between fairness and optimality SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om The Optimality Principle (a) A subnet (b) A sink tree for router B SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om Shortest Path Routing The first steps used in computing the shortest path from A to D The arrows indicate the working node 10 SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om Subnets A campus network consisting of LANs for various departments 69 SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om Subnets (2) A class B network subnetted into 64 subnets 70 SinhVienZone.com https://fb.com/sinhvienzonevn ne C om CDR – Classless InterDomain Routing Si nh Vi en Zo 5-59 A set of IP address assignments 71 SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om NAT – Network Address Translation Placement and operation of a NAT box 72 SinhVienZone.com https://fb.com/sinhvienzonevn ne C om Internet Control Message Protocol Si nh Vi en Zo 5-61 The principal ICMP message types 73 SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om ARP– The Address Resolution Protocol Three interconnected /24 networks: two Ethernets and an FDDI ring 74 SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om Dynamic Host Configuration Protocol Operation of DHCP 75 SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om OSPF – The Interior Gateway Routing Protocol 76 (a) An autonomous system (b) A graph representation of (a) SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om OSPF (2) The relation between ASes, backbones, and areas in OSPF SinhVienZone.com https://fb.com/sinhvienzonevn 77 ne C om OSPF (3) Si nh Vi en Zo 5-66 The five types of OSPF messeges 78 SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om BGP – The Exterior Gateway Routing Protocol (a) A set of BGP routers (b) Information sent to F 79 SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om The Main IPv6 Header SinhVienZone.com The IPv6 fixed header (required) https://fb.com/sinhvienzonevn 80 Si nh Vi en Zo ne 5-69 C om Extension Headers IPv6 extension headers 81 SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om Extension Headers (2) The hop-by-hop extension header for large datagrams (jumbograms) 82 SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne C om Extension Headers (3) The extension header for routing 83 SinhVienZone.com https://fb.com/sinhvienzonevn ... arranged in a circle The shaded ones correspond to actual machines The arcs show the fingers from nodes 1, 4, and 12 The labels on the arcs are the table indices (b) Examples of the finger tables... https://fb.com/sinhvienzonevn ne C om Store-and-Forward Packet Switching Si nh Vi en Zo fig 5-1 The environment of the network layer protocols SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo ne... computing the shortest path from A to D The arrows indicate the working node 10 SinhVienZone.com https://fb.com/sinhvienzonevn Si nh Vi en Zo 5-8 top ne C om Flooding Dijkstra's algorithm to compute the