QUESTION 11.[Unit 6] 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.FramesB.DatagramsC.Independent PacketsD.Virtual CircuitQUESTION 21.[Unit 6] What is NOT a goal of routing algorithms?A.StabilityB.UniquenessC.FairnessD.EfficiencyQUESTION 31.[Unit 6] 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 algorithmB.Shortest path routing algorithmC.Distance vector routing algorithmD.Best link routing algorithmQUESTION 41.[Unit 6] 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 routingB.Internet routingC.Shortest path routingD.Five state routingQUESTION 51.[Unit 6] 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 iscalled __________________.A.EverycastingB.BroadcastingC.MulticastingD.AnycastingQUESTION 61.[Unit 6] . 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 RoutingB.Hierarchical RoutingC.Anycast routingD.AODVQUESTION 71.[Unit 6] What is NOT a category of QoS?A.Constant bit rateB.Available bit rateC.Packet bit rateD.Real-time variable bit rateQUESTION 81.[Unit 6] Why each packet is routed independently on datagram networks?QUESTION 91.[Unit 6] _________________ 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.QUESTION 101.[Unit 6] List three kinds of resources that can potentially be reservedfor different flows.