Suppose four active nodes-nodes A, B, C and D-are competing for access

Question # 00596956 Posted By: katetutor Updated on: 09/29/2017 07:10 AM Due on: 09/29/2017
Subject Computer Science Topic Software Engineering Tutorials:
Question
Dot Image
Actives nodes, adapter, ethernet
1. Suppose four active nodes-nodes A, B, C and D-are competing for access to a channel using slotted ALOHA. Assume each node has an infinite number of packets to send. Each node attempts to transmit in each slot with probability p. The first slot is numbered slot 1, the second slot is numbered slot 2, and so on.

a. What is the probability that node A succeeds for the first time in slot 5?

b. What is the probability that some node (either A, B, C or D) succeeds in slot 4?

c. What is the probability that the first success occurs in slot 3?

d. What is the efficiency of this four-node system?

2. Recall that with the CSMA/CD protocol, the adapter waits K.512 bit times after a collision, where K is drawn randomly. For K = 100, how long does the adapter wait until returning to Step 2 for a 10Mbps Ethernet? For a 100 Mbps Ethernet?

Dot Image
Tutorials for this Question
  1. Tutorial # 00595276 Posted By: katetutor Posted on: 09/29/2017 07:12 AM
    Puchased By: 2
    Tutorial Preview
    The solution of Suppose four active nodes-nodes A, B, C and D-are competing for access...
    Attachments
    Suppose_four_active_nodes-nodes_A,_B,_C_.ZIP (18.96 KB)

Great! We have found the solution of this question!

Whatsapp Lisa