adplus-dvertising
frame-decoration

Question

When requested network paths are available for packets, it is known as

a.

Source routing

b.

Destination routing

c.

Arbitration algorithm

d.

Routing algorithm

Posted under Network Layer Networking

Answer: (c).Arbitration algorithm

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. When requested network paths are available for packets, it is known as

Similar Questions

Discover Related MCQs

Q. The sum of time of flight and transmission time, is called a

Q. The time for the packet to pass through the network, not including time of flight is known as

Q. The routing information usually consists of the destination address, for

Q. New topologies that could reduce the number of switches through which packets must traverse, referred to as the

Q. The end node is busy for the entire time, hence the use of the term

Q. In the network, when ports remain free at the other side of the network but can be used for later expansion of the network to larger sizes. These kind of networks are referred to as

Q. If the receiving overhead is greater than the sending overhead and the receiver cannot process incoming packets fast enough, then it is called a

Q. Packets belonging to the same message can be distinguished from others by including a

Q. All the nodes in each dimension form a linear array, in the

Q. Every network that interconnects more than two devices also requires some mechanism to deliver each packet to the correct destination, the associated function is referred to as

Q. Networks that drop packets are sometimes referred to as

Q. When buffers become full, link-level flow control provides feedback that prevents the transmission of additional packets, is known as

Q. To allow full access, either the physical links must be duplicated or the logical buffers associated with each link must be duplicated, resulting in

Q. When two nodes send at the same time, then the occuring problem is known as

Q. Adding a minimum of logk N ? 1 extra switch stages to the MIN in such a way that they mirror the original topology, the resulting network is

Q. Listening to detect collisions is called

Q. The unit of information sent or received is called a

Q. The passive and active components make up what is referred to as the network

Q. Notifying the sender to stop sending packets when the buffer becomes full and to resume later once it has room for more packets, the stated technique is known as

Q. Buffering of blocked packets can be done using first in, first out (FIFO) or circular queues, which can be implemented as