Question (a) (5 pt.) The Ethernet (CSMA/CD) alternates between contention intervals and successful transmissions. Assume a 100 Mbps Ethernet over 1 km cable with signal speed of 200,000 km/sec. • What is the worst-case collision detection time? If the average number of contention slots before a successful transmission is 4, then what should be the average frame size to achieve an efficiency of 50%. (b) (15 pts.) ALOHA. Assume for simplicity that each transmitted packet in a slotted Aloha system is successful with some fixed probability p. New packets are assumed to arrive at the beginning of a slot and are transmitted immediately. If a packet is unsuccessful, it is retransmitted with probability qr in each successive slot until successfully received. Find the expected delay T from the arrival of the packet until the completion of its successful transmission. (c) (5 pt.) Suppose nodes A, B, and C each attach to the same broadcast LAN (through their adapters). If A sends thousands of IP datagrams to B with each encapsulated frame addressed to the MAC address of B, will C's adapter process these frames? If so, will C's adapter pass the IP datagrams in these frames to the network layer C? How would your answers change if A sends frames with the MAC broadcast address? (d) (5 pt.) Consider Ethernet CSMA/CD algorithm. After the fifth collision, what is the probability that a node chooses K=4? The result K=4 corresponds to a delay of how many seconds on a 10Mbps Ethernet? Hint: NIC waits K:512 bit times.

AAIU6W The Asker · Computer Science

Transcribed Image Text: (a) (5 pt.) The Ethernet (CSMA/CD) alternates between contention intervals and successful transmissions. Assume a 100 Mbps Ethernet over 1 km cable with signal speed of 200,000 km/sec. • What is the worst-case collision detection time? If the average number of contention slots before a successful transmission is 4, then what should be the average frame size to achieve an efficiency of 50%. (b) (15 pts.) ALOHA. Assume for simplicity that each transmitted packet in a slotted Aloha system is successful with some fixed probability p. New packets are assumed to arrive at the beginning of a slot and are transmitted immediately. If a packet is unsuccessful, it is retransmitted with probability qr in each successive slot until successfully received. Find the expected delay T from the arrival of the packet until the completion of its successful transmission. (c) (5 pt.) Suppose nodes A, B, and C each attach to the same broadcast LAN (through their adapters). If A sends thousands of IP datagrams to B with each encapsulated frame addressed to the MAC address of B, will C's adapter process these frames? If so, will C's adapter pass the IP datagrams in these frames to the network layer C? How would your answers change if A sends frames with the MAC broadcast address? (d) (5 pt.) Consider Ethernet CSMA/CD algorithm. After the fifth collision, what is the probability that a node chooses K=4? The result K=4 corresponds to a delay of how many seconds on a 10Mbps Ethernet? Hint: NIC waits K:512 bit times.
More
Transcribed Image Text: (a) (5 pt.) The Ethernet (CSMA/CD) alternates between contention intervals and successful transmissions. Assume a 100 Mbps Ethernet over 1 km cable with signal speed of 200,000 km/sec. • What is the worst-case collision detection time? If the average number of contention slots before a successful transmission is 4, then what should be the average frame size to achieve an efficiency of 50%. (b) (15 pts.) ALOHA. Assume for simplicity that each transmitted packet in a slotted Aloha system is successful with some fixed probability p. New packets are assumed to arrive at the beginning of a slot and are transmitted immediately. If a packet is unsuccessful, it is retransmitted with probability qr in each successive slot until successfully received. Find the expected delay T from the arrival of the packet until the completion of its successful transmission. (c) (5 pt.) Suppose nodes A, B, and C each attach to the same broadcast LAN (through their adapters). If A sends thousands of IP datagrams to B with each encapsulated frame addressed to the MAC address of B, will C's adapter process these frames? If so, will C's adapter pass the IP datagrams in these frames to the network layer C? How would your answers change if A sends frames with the MAC broadcast address? (d) (5 pt.) Consider Ethernet CSMA/CD algorithm. After the fifth collision, what is the probability that a node chooses K=4? The result K=4 corresponds to a delay of how many seconds on a 10Mbps Ethernet? Hint: NIC waits K:512 bit times.
Community Answer
ZVJCHP

  (3) CSMA/CD protocol:-Carrier(Any station can transmit(Manystationsthe data at anytime a a cessing a channel)only condn: before sending the dolc sense Camier (channel) if epsi9: of the carrior is free then send the date)But the problem is the standing at one end of channel, we cant send the can transmit the data (use the chamnel) ∣rarr There are no acknoledgement to detect entive carrier. Becaure of this 2 stations whether its data is fulled into collieions or not. (if the station is still transfering the data xi it cangot a colls ion signal, it conclude that its own data got in collisions)Fg: T_(p)=H_(Hr), at fime t=10:00AMA&B starts transmitting.at time t=10:30AM collision starts.t=11.00 AM,A&B will besee collision signal.(to been TE >= Tp )Eg: T_(p)=1Ht, at time t=10.00AM A starts, 10:59:59AM B starts at time 11:00 AM collision starts.12:00AM A will see collisions( to be seen T_(t) >= 2T_(p) )packet size to detect the collision. rarr If the packet sizze is not upto T_(t) >= 2T_(p)quad this level we have to increment (L)/(B) >= 2T_(p), the size of packet by padding. L >= 2**T_(p)**B of extra datw.CSMA/CD is widdy used in EthernetEfficiency of CSMA/CD :-In the previous Example we have seen that in Worst case 2T_(p) time requi todelect a collision.(2) There could be many collision ... See the full answer