6.3B-4. Multiple Access protocols (4). Consider the figure below, which shows the arrival of 6 messages for transmission at different multiple access wireless nodes at times t=0.1, 0.8, 1.35, 2.6, 3.9, 4.2. Each transmission requires exactly one time unit. t=0.0 1 U U 1 2 3 4 Again consider the CSMA protocol (without collision detection), indicate those packets where the channel is sensed busy and therefore, under CSMA, that message transmission is not attempted. [Again, you should assume that it takes .2 time units for a signal to propagate from one node to each of the other nodes. You can assume that if a packet experiences a collision or senses the channel busy and that that node will not attempt a retransmission of that packet until sometime after t=5. Hint: consider propagation times carefully here]. 5 23 6 t=1.0 t=2.0 t-3.0 5 6 t=4.0 t=5.0

6.3B-4. Multiple Access protocols (4). Consider the figure below, which shows the arrival of 6 messages for transmission at different multiple access wireless nodes at times t=0.1, 0.8, 1.35, 2.6, 3.9, 4.2. Each transmission requires exactly one time unit. t=0.0 1 U U 1 2 3 4 Again consider the CSMA protocol (without collision detection), indicate those packets where the channel is sensed busy and therefore, under CSMA, that message transmission is not attempted. [Again, you should assume that it takes .2 time units for a signal to propagate from one node to each of the other nodes. You can assume that if a packet experiences a collision or senses the channel busy and that that node will not attempt a retransmission of that packet until sometime after t=5. Hint: consider propagation times carefully here]. 5 23 6 t=1.0 t=2.0 t-3.0 5 6 t=4.0 t=5.0

Comptia A+ Core 1 Exam: Guide To Computing Infrastructure (mindtap Course List)

10th Edition

ISBN:9780357108376

Author:Jean Andrews, Joy Dark, Jill West

Publisher:Jean Andrews, Joy Dark, Jill West

Chapter8: Network Infrastructure And Troubleshooting

Section: Chapter Questions

Problem 8TC

See similar textbooks

Similar questions

Consider a short, 10-meter link, over which a sender can transmit at a rate of 150 bits/sec in both directions. Suppose that packets containing data are 100.000 bits long, and packets containing only control (e.g.. ACK or handshaking) are 200 bits long. Assume that N parallel connections each get 1/N of the link bandwidth. Now consider the HTTP protocol, and suppose that each downloaded object is 100 Kbits long, and that the initial downloaded object contains 10 referenced objects from the same sender. Would parallel downloads via parallel instances of non-persistent HTTP make sense in this case? Now consider persistent HTTP. Do you expect significant gains over the non-persistent case? Justify and explain your answer.
Consider the rdt3.0 protocol. Draw a timing diagram showing that if the network connection between sender and receiver can reorder messages, i.e., that two messages propagating in the medium between the sender and receiver can be reordered, then rdt3.0 will not work correctly. Referring to the diagram, clearly explain why this is the case.
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. d. Suppose host A begins to transmit the packet at time t= 0, at time t=dtrans, where is the last bit of the packet?e. Suppose dprop is greater than dtrans. At time t =dtrans, where is the first bit of the packet? f. Suppose dprop is less than dtrans. At time t =dtrans, where is the first bit of the packet?g. Suppose s = 2.5 x 108 , L=100 bits, and R=28 Kbps. Find the distance m so that dprop = dtrans.
Question 7 Consider the Go-back-N protocol with a sequence number space {0,1,2,3} and a window size N=3, and suppose that the sender wants to send 7 packets in total (excluding retransmissions), where the first packet sent will get sequence number 0. Assume that the 2-nd packet sent by the sender as well as the first ACK with a sequence number of 2 are both lost. All other messages arrive within 1 unit of time, and the sender uses a timeout value of 4 time units before initiating a retransmission. You can assume that the sender sends all packets as soon as possible and we neglect the transmission delay. • List all sequence numbers in the exact order in which they arrive at the receiver. (Note that this includes sequence numbers of packets sent in retransmission.) • What are the values of the send_base and the rcv_base variables after the sender has received the ack for its final packet?
Question 1 Consider in the SW-ARQ protocol a packet can at most be retransmitted for 5 times, before it is discarded/destroyed. Find the transition matrix P and all the performance metrics for this SW-ARQ protocol, also find the packet loss probability.
This elementary problem begins to explore propagation delay andtransmission delay, two central concepts in data networking. Consider two hosts, Aand B, connected by a single link of rate R bps. Suppose that the two hosts areseparated by m meters, and suppose the propagation speed along the link is smeters/sec. Host A is to send a packet of size L bits to Host B. d. Suppose Host A begins to transmit the packet at time t=0 . At time t= ?????? ,where is the last bit of the packet? e. Suppose ????? is greater than ?????? . At time t= ??????, where is the first bit of the packet?f. Suppose ????? is less than ??????. At time t= ?????? , where is the first bit of thepacket?
Consider sending real-time data from Host A to Host B over a packet-switched network. Host A takes an 8-bit measurement every millisecond, and Host A collects these into 64-byte packets. There is one link between Hosts A and B; its transmission rate is 5 Mbps, its propagation delay is 2 × 108 meters/sec, and its length is 3 km. As soon as Host A gathers a packet, it sends the packet to Host B. How much time elapses from the time that Host A begins to take the first measurement in a packet until the entire packet reaches Host B?
Suppose an application uses rdt 3.0 as its transport layer protocol. As the stop-and-wait protocol has very low channel utilization (shown in the cross country example), the designers of this application let the receiver keep sending back a number (more than two) of alternating ACKO and ACK 1 even if the corresponding data have not arrived at the receiver. Would this application design increase the channel utilization? Why? Are there any potential problems with this approach? Explain.
The maximum packet size (Maximum Transmission Unit or MTU) of an IP packet including IPv4 header on 100 Mbps Ethernet is usually set at 1500 bytes. A typical IPv4 header consists of 20 bytes, and a UDP header consists of 8 bytes. If we split up a file of 20,000,000 bytes so we can send it as a series of UDP payloads, how many IP packets do we have to send in order to transfer the entire file? Enter an integer number without formatting (no commas). Answer: The MTU for IP packets on 100 Mbps Ethernet is typically set to 1500 bytes. A typical IPv4 header consists of 20 bytes, and a UDP header consists of 8 bytes. If we split up a file of 25,000,000 bytes so we can send it as a series of UDP payloads, how many bytes do we have to send at the network layer in order to transfer the entire file? Enter an integer number (no commas). Answer: You are sending a 27,000,000 byte file using UDP over IP over an Ethernet with MTU 1500 bytes. The Ethernet header is 14 bytes and the frame checksum is 4…
Suppose an application uses rdt 3.0 as its transport layer protocol. As the stop-and-wait protocol has very low channel utilization (shown in the cross-country example), the designers of this application let the receiver keep sending back a number (more than two) of alternating ACK 0 and ACK 1 even if the corresponding data have not arrived at the receiver. Would this application design increase the channel utilization? Why? Are there any potential problems with this approach? Explain
Suppose that a router receives simultaneously 3 packets (pkt1, pkt2, and pkt3) with length L1 = 1 Kbit, L2 = 8 Kbit, and L3 = 4 Kbit, respectively. The three packets are to be forwarded through the same link with transmission rate R = 4 Mbps. Packets are to be forwarded in the following order: pk1, pkt2, pkt3. R 1. What is the queueing delay of pkt1? 2. What is the queueing delay of pkt2? 3. What is the queueing delay of pkt3? 4. What is the average queueing delay at router R?
The maximum packet size (Maximum Transmission Unit or MTU) of an IP packet including IPv4 header on 100 Mbps Ethernet is usually set at 1500 bytes. A typical IPv4 header consists of 20 bytes, and a UDP header consists of 8 bytes. If we split up a file of 20,000,000 bytes so we can send it as a series of UDP payloads, how many IP packets do we have to send in order to transfer the entire file? Enter an integer number without formatting (no commas). Answer: