MAC protocols for an access network with N nodes continuously producing data at a constant rate of x bits per second per node are needed, and you are responsible for developing one. The traffic aggregated across nodes is also less than but close to the entire capacity of the access network, which is another positive development. In your opinion, which protocol is preferable: channel partitioning or random access? For this example, let us assume that you have chosen channel partitioning and that the channel has been divided into N subchannels.

MAC protocols for an access network with N nodes continuously producing data at a constant rate of x bits per second per node are needed, and you are responsible for developing one. The traffic aggregated across nodes is also less than but close to the entire capacity of the access network, which is another positive development. In your opinion, which protocol is preferable: channel partitioning or random access? For this example, let us assume that you have chosen channel partitioning and that the channel has been divided into N subchannels.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter9: Computer Networks

Section: Chapter Questions

Problem 3VE

See similar textbooks

Similar questions

Channel partitioning MAC protocols are: A. Efficient for low channel load since the delay is N/2, whereas N is the number of nodes. B. None is true. C. Efficient for low channel load since the delay is 1/N, whereas N is the number of nodes. D. Efficient for high channel load since the delay is N/2, whereas N is the number of nodes. E. Efficient for high channel load since the delay is 1/N, whereas N is the number of nodes.
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
A frame containing http request is sent from Computer (A) [in whichever subnet it is now, make sure to show it in your figure], to the access point it is associated with. Draw the address fields (1, 2, and 3) of the frame travelling from Computer A to AP and the source and destination addresses of the frame travelling from AP to R1. The MAC addresses of AP1, AP2, and AP3 are M1, M2, and M3 respectively, and the Router R1’s MAC address connected to this Switch/AP is MRA. IP address values are already given, and the port addresses could also be used as given. The Router’s MAC address facing WAN side is MRW.
Explain why collision is an issue in a random-access protocol but not in reservation or channel partitioning protocols.
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.
Suppose you are hired to design a reliable byte-stream protocol that uses a sliding window (like TCP). This protocol will run over a 50-Mbps network, the RTT of the network is 80 ms and the maximum segment lifetime is 60 seconds. How many bits would you include in the Advertised Window and Sequence Num fields of your protocol header?
Computer Science A Go-Back-N (GBN) ARQ scheme has been designed with window-size W = 10 such that it is fully efficient when there are no errors on the channel. Assume that frame size is 20000 bits and the overhead bits are negligible. What is the bit probability error (as seen at Layer 2) that makes the Go-Back-N ARQ 50% efficient?
TCP congestion control example. Consider the figure below, where a TCP sender sends 8 TCP segments at t = 1, 2, 3, 4, 5, 6, 7, 8. Suppose the initial value of the sequence number is 0 and every segment sent to the receiver each contains 100 bytes. The delay between the sender and receiver is 5 time units, and so the first segment arrives at the receiver at t = 6. The ACKs sent by the receiver at t = 6, 7, 8, 10, 11, 12 are shown. The TCP segments (if any) sent by the sender at t = 11, 13, 15, 16, 17, 18 are not shown. The segment sent at t=4 is lost, as is the ACK segment sent at t=7. TCP sender t=1 T t=2 t=3 t=4+ t=5- t=6+ t=11 t=12 t=13 t=14 t=15 t=16 t=17 t=18 I data segment data segment data segment data segment data segment data segment data segment data segment ACK ACK ACK ACK ACK ACK Ty A A V V htt TCP receiver t=6 t=7 t=8 t=9 t=10 t=11 t=12 t=13 What does the sender do at t=17? You can assume for this question that no timeouts have occurred.
TCP congestion control example. Consider the figure below, where a TCP sender sends 8 TCP segments at t = 1, 2, 3, 4, 5, 6, 7, 8. Suppose the initial value of the sequence number is 0 and every segment sent to the receiver each contains 100 bytes. The delay between the sender and receiver is 5 time units, and so the first segment arrives at the receiver at t = 6. The ACKS sent by the receiver at t = 6, 7, 8, 10, 11, 12 are shown. The TCP segments (if any) sent by the sender att = 11, 13, 15, 16, 17, 18 are not shown. The segment sent at t=4 is lost, as is the ACK segment sent at t=7. t=1 T data segment t=2+ data segment data segment-- t=3 TCP sender TCP receiver t=4+ t=5+ data segment - data segment t=6+ t36 data segment t=7 data segment t=8 data segment t=9 ACK + t=10 k -- ACK t=11 t=11 t=12 t=12 t=13 t=13 t=14 ACK -ACK ACK t=15 t=16 t=17 ACK t=18 What does the sender do at t=17? You can assume for this question that no timeouts have occurred.
2. Consider a bus-topology network with five stations. A reservation access method is used. Each station has infinite data to transmit. Each reservation slot has 10 microseconds (note that 1 microsecond = 106 second). For each station, one data transmission sends 1000 bits. The transmission rate over the medium is 10 Mbps. For a station, which is its throughput (in unit "Mbps")?
MAC address of a device is represented using Hexadecimal number. A section of MAC address is given in the following format: [Last 3 digits of your registration number]. You are asked to sketch the given MAC data using polar signaling and pseudo-ternary signaling. COMPARE the characteristics of waveforms and conclude that which of the waveforms is NRZ and RZ. Write proper justification of your answer. Reg three digits: 031
The term synchronization has many meanings in Computer Science. Within the networking field, the term is usually used to describe making asynchronous communication synchronous (A coordination of activities; running at the same rate) We see synchronization occurring in different layers, but we are mostly concerned with the physical layer and the data link layer (L1 and L2). a) In what ways is synchronization in these two layers similar? b) In what ways is synchronization in these two layers dissimilar?