quiz 6 - Dijkstra's algorithm belongs to distance vector...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1. In connectionless switching, the order of packets is always maintained. In other words, if packet A is sent out earlier than packet B, it will arrive at the destination earlier than packet B as well. A. True B. False 2. When a packet arrives at a router, how does the router know which output port the packet should go? A. The port number is in the packet header B. The router looks up the routing table using the destination address carried by the packet. C. The output port is pre-determined before the packet arrives 3. Flooding is very reliable but could generate a huge amount of traffic. A. True B. False 4. In shortest path routing, the path being calculated between node S and node D must be the mininum-hop path. A. True B. False 5. In link state routing, each router must know the whole network topology. A. True B. False 6. In distance vector routing, each router must know the whole network topology A. True B. False 7.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the 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

Page1 / 2

quiz 6 - Dijkstra's algorithm belongs to distance vector...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online