If the network consists of N stations, on average, how many times should a certain station transmit and retransmit a message until it reaches its destination? .

A computer network consists of several stations connected by various me-, dia (usually cables). There are certain instances when no message is being transmitted. At such “suitable instances;’ each station will send a message with probability p, independently of the other stations. However, if two or more stations send messages, a collision will corrupt the messages, and they will be discarded. These messages will be retransmitted until they reach their destination. If the network consists of N stations, on average, how many times should a certain station transmit and retransmit a message until it reaches its destination? .

. .

The post If the network consists of N stations, on average, how many times should a certain station transmit and retransmit a message until it reaches its destination? . appeared first on USA Dissertation Editors.