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 and B begin transmission at t=0 bit times. They both detect collisions at t=245 t bit times. Suppose KA=0 and KB=1. At what time does B schedule its retransmission? At what time does A begin transmission? (Note: The nodes must wait for an idle channel after returning to Step 2-see protocol.) At what time does A's signal reach B? Does B refrain from transmitting at its scheduled time?

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 and B begin transmission at t=0 bit times. They both detect collisions at t=245 t bit times. Suppose KA=0 and KB=1. At what time does B schedule its retransmission? At what time does A begin transmission? (Note: The nodes must wait for an idle channel after returning to Step 2-see protocol.) At what time does A's signal reach B? Does B refrain from transmitting at its scheduled time?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: A sender with window size (W=3) is connected to a selective repeat receiver by a link with…

A: Solution: Given, the window size (W) of the sender is 3, the bandwidth of the link is 106…

Q: Computer A is sending a 10 MByte long file to Computer B via packet-switching over two consecutive…

A: Given that, Length of file= 10 MB Bandwidth= 100 Mbps Distance of link= 2000 km Propagation speed=…

Q: Consider the following scenario: Frames of 12000 bits are sent over a 400kbps channel using a…

A: Protocols in Networking A network protocol is a set up set of decides that decide how information…

Q: Suppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation delay between…

A: ANSWER:-

Q: Consider delivering voice through a direct connection network from Host A to Host B. (for example,…

Q: e. Suppose dprop is greater than dtrans. At time t = durans, where is the first bit of the packet?…

A: Requested answers are given below:

Q: Computer A is sending a 10 MByte long file to Computer B via packet-switching over two consecutive…

A: Computer networking which refers to interconnected computing devices that can exchange data and…

Q: Computer A is sending a 10 MByte long file to Computer B via packet-switching over two consecutive…

A: Answer: Given File size=10MBytes Rate= 100Mbps Distance=2000Km Speed=2 X 108 m/s

Q: Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive…

A: Here in this question we have given that Total size = 100kB Bandwidth= 10Mbps. Link distance…

Q: Computer A is sending a 10 MByte long file to Computer B via packet-switching over two consecutive…

A: Computer Networks which refers to the set of the computers which are connected through the medium…

Q: Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive…

A: Given that, Size of the file= 100 KB Bandwidth of the link= 10 Mbps Distance of each link= 1000 Km…

Q: Suppose that there are three inter-media nodes between Host 1 and Host 2, and the transmission rate…

A: Given that, Transmission rate or Band width= 4.096 Mbps End to end circuit establishment time= 0.5…

Q: Computer A is sending a 10 MByte long file to Computer B via packet-switching over two consecutive…

A: Given that, Length of file= 10 MB Length of packet= 1480 bytes Bandwidth of the link= 100 Mbps…

Q: Q.4) Consider the scenario below where 4 TCP senders are connected to 4 receivers. Senders transmit…

A: Here is the explanation of the above problem.

Q: Suppose that KJ sends 3596 back-to-back packets, with each packet composed of 14,000 bits, to TA…

A: To find delay

Q: - Stations in a slotted Aloha network send frames of size 2000 bits at the rate of 1 Mbps. What is…

A: Approach to solving the question: Let's address your questions one by one: 1. Vulnerable Time in…

Q: Suppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation delay between…

A: Suppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation delay between…

Question

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 and B begin
transmission at t=0 bit times. They both detect collisions at t=245 t bit times. Suppose KA=0 and
KB=1. At what time does B schedule its retransmission? At what time does A begin
transmission? (Note: The nodes must wait for an idle channel after returning to Step 2-see
protocol.) At what time does A's signal reach B? Does B refrain from transmitting at its
scheduled time?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Step 5

Step 6

Trending now

This is a popular solution!

Step by step

Solved in 6 steps with 23 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Consider the following network with given line speeds and lengths: Assume the speed of light is 2×10^8 m/s, and that the processing and queuing delays are negligible. Node A sends a 1400-byte frame to node C through node B. Suppose Node A starts sending the first bit of the frame at t=0. Answer the following questions: a. At what time (t=?) node B receives the frame in full (i.e. the last bit)? b. After node B receives the frame in full, then it will start sending the frame to node C. Determine the time (t=?) when node C receives the frame in full. c. Suppose at this time node C sends a small acknowledgment back to node A. The transmission time for the acknowledgment is negligible. Calculate at what times (t=?) the acknowledgment arrives at nodes B and A. d. Assume after sending its frame, node A wait for the acknowledgment back from node C before sending the next frame. What is the average throughput (number of transmitted bits per second) of the data flow from node A to…
Computer A is sending a 10 MByte long file to Computer B via packet-switching over two consecutive 100 Mbps links of 2000 km length each.Assume that the signal propagation speed on both links is 2 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1480 bytes and that Computer A fills each packet to the max, if possible. How long (in seconds) does it take Computer A to send out one packet of maximum length on the first link?
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. How "long" (in meters) is one bit on link 1?
Computer A is sending a 10 MByte long file to Computer B via packet-switching over two consecutive 100 Mbps links of 2000 km length each.Assume that the signal propagation speed on both links is 2 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1480 bytes and that Computer A fills each packet to the max, if possible. How many bytes will be contained in the last packet?
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. How long (in seconds) does it take Computer A to send out one packet of maximum length on the first link?
show step by step
2. Consider a slotted TDM hierarchical network in which there are 8 computers sharing a 10 Mbps channel to a router R1, sending packets to R1 which must all be forwarded by R1 over an outgoing link (called the MAN link), as shown in Figure 1. Computers A-H always have packets waiting to be sent, so no timeslot on the shared LAN is idle. Ignore the propagation delay on the LAN. The MAN link outgoing from R1 is a 100 Mbps link. The network layer protocol in use has a PDU with exactly 40 bytes of header and exactly 200 bytes of payload (SDU). The DLC layer protocol in use on the LAN has a PDU with exactly 40 bytes of header and 20 bytes of trailer. The DLC layer protocol in use on the outgoing link from R1 has a PDU with 40 bytes of header and no trailer. The physical layer does not impose any bit overhead in either channel. Use 1 Mbps = 1000000 bps. B D E F G H R1 R2 Figure 1 (a) What is the transmission delay of a bit for Computer A? (b) What is the transmission delay of a DLC PDU for…
Computer A uses the Go-back-N ARQ protocol to send a 110 Mbytes file to computer B with a window size of 15. Given each frame carries 100K bytes data. How long does it take to send the whole file (the total time taken from A sending the first bit of the file until A receiving the last acknowledgment)? Given that the transmission rate of the link is 500 Mbps and the propagation time between A and B is 15ms. Assume no data or control frame is lost or damaged and ignore the overhead due to header and trailer.
In a two-phase, total-order multicast system, messages are sent in the following sequence from node S to G1 and G2. G1 and G2 are the members of the group. S sends m1 to G1 S sends m1 to G2 S sends m2 to G2 S sends m2 to G1 Use the basic implementation of the Lamport clock. The clock s at each node start at: S: 4, G1: 6, G2: 1. Show the exchange of messages and their acknowledgments in a clock diagram using the basic implementation of Lamport's clock. In which order and at what times are m1 and m2 delivered?
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. How many bytes will be contained in the last packet?
4. In this problem, you will derive the efficiency of a CSMA/CD-like multiple access protocol. In this protocol, time is slotted and all adapters are synchronized to the slots. Unlike slotted ALOHA, however, the length of a slot (in seconds) is much less than a frame time (the time to transmit a frame). Let S be the length of a slot. Suppose all frames are of
In this problem you will be doing some elementary calculations oftransmission and propagation delays.Consider two hosts, A and B that are connected by a transmissions link of2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and thelength of the link is 100Km. a). Now suppose that node C is connected to node B also by a 2 Mbps, 100Km link. How long does it take from when the first bit is transmitted by Ato when the last bit is received at C, assuming B operates in a store-andforward manner?