Consider an Infrastructure BSS with an Access Point and two Mobile Stations, and let’s use AP, M1, and M2 to denote their MAC addresses. Both M1 and M2 are associated with the AP. Suppose M1 wants to send a data frame to M2. When this data frame is relayed by the AP, explain how the AP shall update the four address fields of the data frame.

Consider an Infrastructure BSS with an Access Point and two Mobile Stations, and let’s use AP, M1, and M2 to denote their MAC addresses. Both M1 and M2 are associated with the AP. Suppose M1 wants to send a data frame to M2. When this data frame is relayed by the AP, explain how the AP shall update the four address fields of the data frame.

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

Similar questions

6.4-12 Network- and Link-layer addressing: an end-to-end-scenario (3c). Consider the network shown below. The IP and MAC addresses are shown for hosts A, B, C and D, as well as for the router's interfaces. Consider an IP datagram being sent from node C to node A (note: from right to left). Match the source/destination network- or link-layer address at the location (6) by choosing a value from the pulldown list. 77-34-F1-EF-14-72 128.119.97.18 (6) 68-01-BC-58-AF-24 128.119.50.107 (5) What is the source IP address of the datagram at point (6)? What is the source MAC address on the frame at point (6)? CC-A5-81-OB-AE-33 128.119.97.194 What is the destination MAC address on the frame at point (6)? What is the destination IP address of the datagram at point (6)? (4) 49-FA-B0-3C-E2-7C 128.119.50.60 72-9E-4A-31-9C-42 128.119.240,15 (3) 128.119.97.194 128.119.97.18 128.119.240.52 [Choose ] [Choose ] 4C-9D-AA-74-D6-1F 4C-9D-AA-74-D6-1F 128.119.240.52 (1) (2) C D D5-A0-EE-9A-73-D5 128.119.240.116…
Consider the following scenario in which host A is sending a file to host B over a TCP connection. Assuming that the sequence number of the first data byte sent by A is 0 and every segment always includes 1000 bytes of data, excluding the TCP header. At some point of time, bytes up to 6400 have been written into the sender’s buffer. Bytes up to 4999 have been sent out but the segment which contains bytes 2000~2999 has not arrived at host B yet. At the receiver’s side, all bytes up to 3999 have been received except for bytes 2000~2999. Bytes up to 499 have been read from the buffer by the application. Assume that the maximum size of the sender’s buffer is large enough. Consider the sliding window algorithm in TCP and answer the following questions. 1) What are the values for LastByteAcked, LastByteSent, and LastByteWritten? 2) What are the values for LastByteRead, NextByteExpected, and LastByteRcvd? 3) Assuming that the maximum size of the receiver’s buffer is 4000 byte, what would…
Consider a simple protocol for transferring files over a link. After some initial negotiation, A sends data packets of size 1 KB to B; B then replies with an acknowledgment. A always waits for each ACK before sending the next data packet; this is known as stop-and-wait. Packets that are overdue are presumed lost and are retransmitted. (a) In the absence of any packet losses or duplications, explain why it is not necessary to include any "sequence number" data in the packet headers. (b) Suppose that the link can lose occasional packets, but that packets that do arrive always arrive in the order sent. Is a 2-bit sequence number (that is, N mod 4) enough for A and B to detect and resend any lost packets? Is a 1-bit sequence number enough? (c) Now suppose that the link can deliver out of order and that sometimes a packet can be delivered as much as 1 minute after subsequent packets. How does this change the sequence number requirements?
In a bit-oriented link-layer protocol, the start and end of a frame are each marked by a flag, which is a sequence of exactly 6 consecutive 1 bits. Bit stuffing is used during the rest of the frame: after sending 5 consecutive 1 bits, a 0 is added. The bits below contain an example frame, with the leftmost bit received first. The content of the frame is a sequence of bytes, sent most significant bit first. Put the values of the first four bytes of the frame content, in order, in the four answer boxes below. You may enter the values in either decimal (e.g. 76, 123) or hexadecimal (e.g. 2a, f7). 00101011111010001111110011100111110000111101111101010110100010010011111101101100100 57−240−123−229
Compare GBN, SR, and TCP (no delayed ACK). Assume that the timeout values for all three protocols are sufficiently long such that 5 consecutive data segments and their corresponding ACKs can be received (if not lost in the channel) by the receiving host (Host B) and the sending host (Host A) respectively. Suppose Host A sends 5 data segments to Host B, and the 3rd segment (sent from A) is lost. In the end, all 5 data segments have been correctly received by Host B. How many segments has Host A sent in total and how many ACKs has Host B sent in total? What are their sequence numbers? Answer this question for all three protocols. The previous expert did the wrong question and the answer was incorrect. The 3rd packet is lost not the 2nd packet
Consider a client has established TCP connection with a server and sending data. The propagation delay is 5 ms and there are no timeouts and errors during transmission. The size of the receiver advertised window is 128 KB, the slow-start threshold at the client is 64 KB, and the maximum segment size is 4 KB. The connection is established at time T = 10 ms. What is the size of the congestion window (in KB) at time 90 ms after all acknowledgements are processed?
1. What is the difference between packet fragmentation (i.e., at network layer) and frame frag- mentation (i.e., at link layer) in terms of purpose? 2. Suppose that host A is connected to a router R1, R1 is connected to another router, R2, and R2 is connected to host B. Suppose that a TCP message that contains 800 bytes of data and 20 bytes of TCP header is passed to the IP function at host A for delivery to B. Show the Total length, DF, MF, and Fragment offset fields of the IP header in each packet transmitted over the three links. (Assume that link A-R1 can support a maximum frame size of 1024 bytes including a 14-byte frame header, link R1-R2 can support a maximum frame size of 512 bytes, including an 8-byte frame header, and link R2-B can support a maximum frame size of 432 bytes including a 12-byte frame header.) (*hint: the Fragment offset field is denominated by 8-bytes, not bytes) 3. What is the purpose of the path MTU discovery process (see textbook Figure 5-42) and why does…
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.
Use again the network architecture provided in the figure above, were Rs, Rc and Ri for i = {1,2,3,4}, the transmission rates of the server link, client link and intermediate network links. Consider a message that is 60 · 106 bits long that is to be sent from client to server. Ignore propagation, queuing, and processing delays. c.How long does it take to move the file from source host to destination host when message segmentation is used and both path R1, R2 and path R3, R4 are used? How many packages should be routed from path R1, R2 and how many from path R3, R4 in order to maximize the use of the network? d.What is the end to end throughput if path R1, R2 is used, and what if path R3, R4 is used? What is the total throughput from client to server (if both paths are being used at the same time)?
2. (a) Suppose an end device A wants to send a frame containing a black and white image to another end device B. There are a total of 4 routers(R1,R2,R3,R4) in between them. The image being sent is a 1080*1920 pixel image. Every pixel is represented with 1 bit. The processing time(p) of each router in given below: I. R1: p = 1µs II. R2: p = 1.5μs III. R3: p = 2µS IV. R4: p = The image is being sent through a link of bandwidth 7 MBPS and device B is 3500 Km away from device A. The signal passes through the link at a speed of 2.5x10^8m/s. Considering there is no queuing time, calculate the total delay for this transmission.
Consider a router that interconnects three subnets: Subnet 1, Subnet 2, and Subnet 3. Suppose all of the interfaces in each of these three subnets are required to have the prefix 223.10.128/24. Also suppose that Subnet 1 is required to support at least 50 interfaces, Subnet 2 is to support at least 100 interfaces, and Subnet 3 is to support at least 12 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraints.
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