系统方法课件-0syllabus 2.pptVIP

Spring 2000 CS 461 Chap 3 Switching Forwarding Circuit Switching Packet Switching Datagram (connectionless) Virtual Circuit (connection-oriented) Source Routing Bridge and LAN Switch Learning Bridge Spanning Tree Algorithm Datagram Switching Each switch maintains a forwarding table. (switch 2 for example) Virtual Circuit Switching Source Routing Source Routing Assumed the source switch know the net topology well No upper bound of the header size Strip the first element rather than rotate the header. OR Create a pointer to the current “next port” Chap 3 Switching Forwarding Circuit Switching Packet Switching Datagram (connectionless) Virtual Circuit (connection-oriented) Source Routing Bridge and LAN Switch Learning Bridge Spanning Tree Algorithm Bridges and Extended LANs LANs have physical limitations (e.g., 2500m) Connect two or more LANs with a bridge accept and forward strategy level 2 connection Switch Bridge Learning Bridges Do not forward when unnecessary Maintain forwarding table Host Port A 1 B 1 C 1 X 2 Y 2 Z 2 The table can be maintained by a human. But it’ a burden Learn table entries based on source address Table is an optimization; need not be complete A timeout is associated with each entry. Spanning Tree Algorithm Problem: loops HOMEWORK Exercises 1，3，5，13，15，17 Required Reading Stallings chapter 3.1-3.2 Chap 4 IP (include subnet CIDR) ARP ICMP IPv6 Chap 4 Connectionless (datagram-based) Best-effort delivery (unreliable service) packets are lost packets are delivered out