Midterm Study Guide Dordal June 13, 2005 Some sample study questions for the Network Management midterm, which is Wednesday June 15. The midterm will be OPEN BOOK. If you do better on the final, I will not count the midterm. However, the final will be cumulative. The midterm covers Subramanian up through chapter 4 (mostly just chapter 4), and also what was discussed in class about OpenNMS. You will be expected to know how MIB browsers work and how to interpret their output. I may also ask you about the GET and GET_NEXT operations and how table traversal is implemented (this is officially in chapter 5, but we did discuss the basics in the context of how "get_subtree" or "get_table" works in MIB browsers). The Drexel SNMP interface will *not* be on the midterm, although I may use that syntax in examples. 1. Suppose we want to create a new snmp table, called carTable. The prefix is vehicles::= 1.5.4.3.2. The carTable is to consist of sets of entries of form horsePower make (gm, chrysler, ford, nissan, toyota) modelNumber seating The index is to be a field carNum. Give an ASN.1 definition for carTable, carEntry, and the entry fields. 2. Discuss some methods by which an NMS can identify new nodes. What happens if a node is a non-IP device, such as a switch? 3. How can the NMS decide what to *do* with a certain SNMP-speaking device it has discovered? That is, how can an NMS know to ask router-type questions of a router and switch-type questions of a switch? 4. Chapter 4 exercise 9: host v router using SNMP 5. Chapter 4 exercise 10: use the ipNetToMediaEntry table. 6. Chapter 4 exercise 11: write a MIB file. 7. Chapter 4 # 13: use the standard mib-2 objects to identify which workstation on a LAN is really a router to the outside world. 8. Chapter 4 # 14: differences between TCP and UDP in mib2 9. Chapter 3 exercises: #2: overview of NMS for dual-vendor network #6: give an ASN.1 version of a DayofWeek type as a SEQUENCE #7: give an ASN.1 version of a DayOfWeek type as an ENUMERATED 10. Find the etherlike.mib MIB file for ethernet-like nodes and (a) identify how to find the number of collisions (b) identify how to determine if any host is violating the 1500-byte maximum packet size (c) identify how to determine the rate of collisions per good packet.