Evaluation 6 Flashcards
Why each packet is routed independently on datagram networks?
Because connectionless service is offered
________________ is a technique for regulating the average rate and burstiness of a flow of data that enters the network. The goal is to allow applications to transmit a wide variety of traffic that suits their needs, including some bursts, yet have a simple and useful way to describe the possible traffic patterns to the network.
Traffic shaping
List three kinds of resources that can potentially be reserved for different flows.
Bandwidth
Buffer space
CPU cycles
If connectionless service is offered, packets are injected into the network individually and routed independently of each other. No advance setup is needed. In this context, the packets are frequently called __________.
A. Frames
B. Datagrams
C. Independent Packets
D. Virtual Circuit
Datagrams
Which of the following does NOT represent an goal of routing algorithms?
A. Stability
B. Uniqueness
C. Fairness
D. Efficiency
Uniqueness
A ________________ operates by having each router maintain table giving the best known distance to each destination and which link to use to get there. These tables are updated by exchanging information with the neighbors. Eventually, every router knows the best link to reach each destination.
A. Bellman-Ford routing algorithm
B. Shortest path routing algorithm
C. Distance vector routing algorithm
D. Best link routing algorithm
Distance vector routing algorithm
Variants of ______________ called IS-IS and OSPF are the routing algorithms that are most widely used inside large networks and the Internet today. The idea is fairly simple and can be stated as five parts. 1). Discover neighbors, learn network addresses. 2). Set distance/cost metric to each neighbor. 3). Construct packet telling all learned. 4). Send packet to, receive packets from other routers. 5). Compute shortest path to every other router.
A. Link state routing
B. Internet routing
C. Shortest path routing
D. Five state routing
Link state routing
Hosts need to send messages to many or all other hosts. For example, a service distributing weather reports, stock market updates, or live radio programs might work best by sending to all machines and letting those that are interested read the data. Sending a packet to all destinations simultaneously is called __________________.
A. Everycasting
B. Broadcasting
C. Multicasting
D. Anycasting
Broadcasting
In this routing protocol, routes to a destination are discovered on demand, that is, only when a somebody wants to send a packet to that destination. This saves much work that would otherwise be wasted when the topology changes before the route is used. At any instant, the topology of an ad hoc network can be described by a graph of connected nodes. What is this routing protocol called?
A. Topological Routing
B. Hierarchical Routing
C. Anycast routing
D. AODV
AODV
What is NOT a category of QoS?
A. Constant bit rate
B. Available bit rate
C. Packet bit rate
D. Real-time variable bit rate
Packet bit rate
