Question

Q6. Total: 7 marks] Nodes A and B are accessing a shared medium with propagation delay of 300 bit times between them (i.e., propagation delay equals to the amount of time to transmit 300 bits onto the link). A and B each have a frame of 1,000 bits (including all headers and preambles) to send to each other. a) (3 marks] In the worst case, how many bits would A have sent out when it detects collision? Briefly show how you work out the answer. b) [4 marks] Suppose both A and B attempt to transmit at time t0. CSMA/CD protocol with back-off intervals of multiples of 512 bits is used. After the first collision, A draws K0 and B draws K-1 in the exponential back-off protocol. Ignore the jam signal and other unmentioned delays. At what bit time will As packet be successfully received by B? Briefly show how you work out the answer. If the information given in the question is insufficient to derive the answer, explain why it is so

0 0
Add a comment Improve this question Transcribed image text
Know the answer?
Add Answer to:
Q6. Total: 7 marks] Nodes A and B are accessing a shared medium with propagation delay...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Assume that two nodes A and B are on the same segment of 10Mbps Ethernet. The propagation delay b...

    Assume that two nodes A and B are on the same segment of 10Mbps Ethernet. The propagation delay between the two nodes is 200 bits time( time to transmit 200 bits of data) .At time t=0, A begins transmitting a frame of 800 bits. Before A finishes , B begins to transmit . Can A surely detect a collision before finishing transmitting ? Hint: consider worst case for a possible collision when B can start transmitting. b) in the above...

  • P6. This elementary problem begins to explore propagation delay and transmis- sion delay, two central concepts...

    P6. This elementary problem begins to explore propagation delay and transmis- sion delay, two central concepts in data networking. Consider two hosts, A and B, connected by a single link of rate R bps. Suppose that the two hosts are separated by m meters, and suppose the propagation speed along the link is s meters/sec. Host A is to send a packet of size L bits to Host B a. Express the propagation delay, dprops in terms of m and...

  • 5. (10 points) Multiple Access Protocols Suppose nodes A and B are on the same 10...

    5. (10 points) Multiple Access Protocols Suppose nodes A and B are on the same 10 Mbps Ethernet segment and the propagation delay between the two nodes is 225 bit times. Suppose A and B send frames at the same time, the frames collide, and then A and B choose their own values of K in the CSMA/CD algorithm. Assuming active, no other nodes are can retransmissions from A and B collide. For our purposes, it suffices to work out...

  • Suppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation...

    Suppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation delay between the two nodes is 245 bit times. Suppose A and B send Ethernet frames at the same time, the frames collide, and then A and B choose different values of K in the CSMA/CD algorithm. Assuming no other nodes are active, can the retransmissions from A and B collide? For our purposes, it suffices to work out the following example. Suppose A...

  • 03) Consider sending a file size of O bits over a path of 2 links. Suppose...

    03) Consider sending a file size of O bits over a path of 2 links. Suppose the first link can transmit at R1 bit/sec (bps) and the second link can transmit R2 bits/sec (bps) (R1+ R2), both links have a propagation delay of tp, network lightly loaded (no queuing delays), and each link's maximum frame size, S bits, is same (S < O and number of segments is integer and headers are negligible.). (a) How long does it take to...

  • Consider a CAN system. We use the bit time for time unit, i.e., one time unit is the time needed to transmit one bit. The longest propagation delay is two time units. Two nodes, A, and B, are trying t...

    Consider a CAN system. We use the bit time for time unit, i.e., one time unit is the time needed to transmit one bit. The longest propagation delay is two time units. Two nodes, A, and B, are trying to access the bus at time 0. Node C tries to access the bus at time 5. The identifier for node A is: 00011100110; the identifier for node B is: 00010101010; the identifier for node C is: 00010011010. Who will the...

  • 7. (4 pointa) Cossider two nodes A and B consected vis an Etheret bo of 48Mbps...

    7. (4 pointa) Cossider two nodes A and B consected vis an Etheret bo of 48Mbps Suppone that the two nodes are the oaly sodes, and that the propsantion delay betwern temi 240 Suppose that both nodes each bas a frame to send, and st tve t After coll ision, node A chooses KA 0 and node B chocees Kp 1. Rl th, i the CSMA/CD 0 they bot algorithm, right after detecting a collislon, a node mrst seud a...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT