60 likes | 75 Views
Review for Final Neil Tang 12/12/2008. Chapter 4. IP datagram delivery scheme: best effort IP fragmentation: MTU, size, offset IP addressing: 5 classes The basic functionalities of ARP, DHCP and ICMP Distance vector routing and RIP: routing algorithm
E N D
Review for Final Neil Tang12/12/2008 CS440 Computer Networks
Chapter 4 • IP datagram delivery scheme: best effort • IP fragmentation: MTU, size, offset • IP addressing: 5 classes • The basic functionalities of ARP, DHCP and ICMP • Distance vector routing and RIP: routing algorithm • Link state routing and OSPF: flooding and routing algorithm • Distance vector vs. link state: differences, strengths, weaknesses CS440 Computer Networks
Chapter 4 • Routing performance metrics: hop-count, delay, utilization • Forwarding based on subnetting • Forwarding based on CIDR • Autonomous System (AS) and BGP • Inter-domain routing vs. intra-domain routing: differences • Proactive routing vs. on-demand routing: strengths and weaknesses • DSR: route discovery, optimization • Mobile IP: forwarding procedure, tunneling, route optimization CS440 Computer Networks
Chapter 5 • Requirements for end-to-end protocols • UDP: what it can do and what it cannot do • Three-way handshake in TCP • STD of TCP • MSS, silly window syndrome and Nagle’s algorithm • Three algorithms for retransmission: original, Karn • Flow control in TCP: window sizes, control application process • RPC: functionalities of the stubs CS440 Computer Networks
Chapter 9 • DNS: information in each kind of name server, resolution procedure • RFC822/MIME: base64 • SMTP: interaction procedure • HTTP: request/response message, persistent TCP connections, caching • SNMP: MIB CS440 Computer Networks
Please do not forget to complete the class survey at www.cs.montana.edu/survey Thank you very much! CS440 Computer Networks