Advanced Computer Networks Week-3 Assignment
Advanced Computer Networks Week-3 Assignment
1. Which of the following packet classification schemes has lower worst-case query time
complexity?
A. Hierarchical Trie
B. Set-pruning Trie
C. TCAM
D. Cross-Producting
Ans. C (TCAM)
2. Which of the following statements is/are correct regarding set-pruning trie and hierarchical
trie in the context of the query process?
A. In order to guarantee the quality of service, all the packets of a flow must follow the
same route.
B. Packets that require guaranteed service will be served first before those that require
best-effort service.
C. To prevent packet loss, the first-hop router may need to allocate a buffer for the source
smaller than its burst size.
D. The controlled-load integrated service class is used for delay-intolerant applications.
Ans. A. C and D (In order to guarantee the quality of service, all the packets of a flow must
follow the same route, To prevent packet loss, the first-hop router may need to allocate
a buffer for the source smaller than its burst size, The controlled-load integrated
service class is used for delay-intolerant applications.)
4. How does RSVP handle resources in a network for communication?
Ans. C (Resources are reserved from end to end before communication and released after
communication is completed.)
5. For Hierarchical Tries with 2 dimensions and a maximum field length of 6 for each dimension,
what is the query time complexity?
A. 12
B. 24
C. 36
D. 64
Ans. C (36)
6. Which of the following statements is/are incorrect about RSVP “soft state” approach to
managing the reservation?
7. Why is scalability a key concern for the end-to-end implementation of Integrated Service
(IntServ) in the core of the Internet?
A. There are large number of connections to handle and it places lot of burden on routers
B. Requires end-to-end signaling and per-flow soft state at every router.
C. Imposes limitations on service discrimination.
D. Presents challenges in incremental deployment.
Ans. A and B (There are large number of connections to handle and it places lot of burden on
routers, Requires end-to-end signaling and per-flow soft state at every router)
8. Consider the 2-dimensional rule set shown in the table below. Which of the following rules
are duplicated in the F2-field during the construction of the set-pruning trie?
Rule F1 F2
R1 00* 00*
R2 0* 01*
R3 1* 0*
R4 00* 0*
R5 0* 10*
R6 * 1*
A. R2, R3, R4
B. R1, R2, R3
C. R1, R3, R4
D. R2, R5, R6
9. Consider the heuristic recursive flow packet classification algorithm for the given rule set
example presented in the table below. Determine the number of bits needed to represent
the destination IP and port number fields as eqID (Equivalence ID).
A. 2, 3
B. 3, 2
C. 3, 3
D. 5, 5
Ans. C (3, 3)
10. Which of the following statements is correct about the Grid-of-tries packet classification
algorithm? (Hint: N- number of rules and d-dimension)