CERTIFICATE IN WIRELESS NETWORK

/30
2

CERTIFICATE IN WIRELESS NETWORK

1 / 30

In ………………, each packet of a message follows the same path from sender to receiver.

2 / 30

……………. do not base their routing decisions on measurements or estimates of the current traffic and topology.

3 / 30

If route from router I to router J is computed on line based on the current statistics, then it is called as ………………..

4 / 30

The method of network routing where every possible path between transmitting and receiving DTE is used is called

5 / 30

If the subnet uses virtual circuits internally, routing decisions are made only when a new virtual circuit is being setup. This is called as……………..

6 / 30

…………….. change their routing decisions to reflect changes in the topology

7 / 30

In shortest path routing algorithm, the path length is measured based on ……………..

8 / 30

For a connection oriented service, we need a ……………

9 / 30

If router J is on the optimal path from router I to router K, then the optimal path from J to K also falls along the same route is known as ………………..

10 / 30

Adaptive routing algorithms get their information from

11 / 30

Flooding always choose the ………………..

12 / 30

Each packet is routed independently in ……………….

13 / 30

If the route from I to J is computed in advance, off line, and downloaded to the routers when the network is booted is called as ……………….

14 / 30

In military applications where large number of routers may be blown to bits at any instant, we use ……………….

15 / 30

In distributed applications, it is sometimes necessary to update all the databases concurrently, we use …………………..

16 / 30

The router algorithm takes the decision to changes the route when ……………..

17 / 30

If router J is on the optimal path from router I to router K, then the path from J to K along the same route is ………………

18 / 30

In …………… circuit switching, delivery of data is delayed because data must be stored and retrieved from RAM.

19 / 30

In Hierarchical routing for N router subnet, the optimal number of levels is …………..

20 / 30

The regions in Hierarchical routing are grouped in to ……………..

21 / 30

If a datagram router goes down then …………..

22 / 30

In datagram subnet new route is chosen …………………

23 / 30

The Clusters in Hierarchical routing are grouped in to ………………

24 / 30

The set of optimal routes from all sources to a given destination from a tree rooted to the destination is known as ……………..

25 / 30

If a router sends every incoming packet out only on those lines that are going approximately in the right direction is known as ……………..

26 / 30

The PSTN is an example of a ………………… network

27 / 30

In Hierarchical routing, the routers are divided into what is called as ……………..

28 / 30

A permanent virtual circuit involves ……………..

29 / 30

Which type of switching uses the entire capacity of a dedicated link?

30 / 30

In ……………., each packet of a message need not follow the same path from sender to receiver.