Two CSMA/CD stations are each trying to transmit long (multi frame) files. After each frame is sent, they contend for the channel, using the binary exponential back off algorithm. What is the probability that the contention ends on round k, and what is the mean number of rounds per contention period?
Answer to relevant QuestionsConsider building a CSMA/CD network running at 1 Gbps over a 1-km cable with no repeaters. The signal speed in the cable is 200,000 km/sec. What is the minimum frame size?How many frames per second can gigabit Ethernet handle? Think carefully and take into account all the relevant cases. Hint: the fact that it is gigabit Ethernet matters.From Fig. 4-35, we see that a Bluetooth device can be in two Pico nets at the same time. Is there any reason why one device cannot be the master in both of them at the same time?Consider the network of Fig. 4-49(a). If machine J were to suddenly become white, would any changes be needed to the labeling? If so what?Consider the following design problem concerning implementation of virtual-circuit service. If virtual circuits are used internal to the subnet, each data packet must have a 3-byte header and each router must tie up 8 bytes ...
Post your question