This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Dijkstra's algorithm belongs to distance vector routing. A. True B. False 8. OSPF is based on link state routing. A. True B. False 9. RIP is based on distance vector routing. A. True B. False 10. Given a network, if between any two nodes there is only one shortest path, then Dijkstra's algorithm and Bellman-Ford algorithm will generate exactly the same result. A. True B. False 11. Circuit switching has a set up overhead (set up delay). A. True B. False 12. In a packet switch, suppose ten packets are switched from input 1 to output 4, they will experience exactly the same delay inside the switch A. True B. False 13. Packet switching enables statistical multiplexing, thus could reach a higher link efficiency. A. True B. False 14. Ethernet is based on circuit switching. A. True B. False 15. Virtual circuit packet switching does require a set up operation. A. True B. False...
View Full Document
This note was uploaded on 11/02/2010 for the course EE 136 taught by Professor Kang xi during the Spring '10 term at NYU Poly.
- Spring '10
- KANG XI