hw2.pdf - UNIVERSITY OF CALIFORNIA DAVIS BERKELEY DAVIS IRVINE LOS ANGELES RIVERSIDE SAN DIEGO SAN FRANCISCO SANTA BARBARA SANTA CRUZ EEC 173A\/ECS

hw2.pdf - UNIVERSITY OF CALIFORNIA DAVIS BERKELEY DAVIS...

This preview shows page 1 - 3 out of 5 pages.

UNIVERSITY OF CALIFORNIA, DAVIS ________________________________________________________________________________________ BERKELEY DAVIS IRVINE LOS ANGELES RIVERSIDE SAN DIEGO SAN FRANCISCO ________________________________________________________________________________________ __________________________________ SANTA BARBARA SANTA CRUZ __________________________________ EEC 173A/ECS 152A-Computer Networks Spring 2018 Homework #2 (due April 27, 2018) Total: 120 points 1.(14 points) Review Questions: Network Layer, IP, and CIDR (a)(2 pts.) What are the two most important network-layer functions in a datagram network? What additional network-layer function is required in a virtual circuit network? (b)(4 pts.) Describe how packet loss can occur at input ports. Describe how packet loss at input ports can be eliminated (without using infinite buffers). (c)(2 pts.) Do routers have IP addresses? If so, how many? (d)(2 pts.) What is the 32-bit binary equivalent of the IP address 223.1.3.27 (e)(4 pts.) For each of the following CIDR formatted addresses what is the address range and how many hosts can you accommodate? 212.231.180.0/22 120.2.0.0/17 2.(12 points) IP Fragmentation. Consider sending a 2400-byte datagram into a link that has an MTU of 700 bytes. Suppose the original datagram is stamped with the identification number 422. How many fragments are generated? What are the values in the various fields in the IP datagram(s) generated related to fragmentation? 3.(14 points) Longest Prefix MatchConsider a datagram network using 32-bit host addresses. Suppose a router has four links, number 0 through 3, and packets are to be forwarded to the link interfaces as follows: Destination Address Range Link Interface 11100000 00000000 00000000 00000000 through 11100000 00111111 11111111 11111111 0 11100000 01000000 00000000 00000000 through 11100000 01000000 11111111 11111111 1 11100001 01000001 00000000 00000000 through 11100001 01111111 11111111 11111111 2 otherwise 3
Image of page 1