Design a MAC protocol for an access network where N nodes generate data continuously at a constant rate, at x bits/sec per node. Additionally, the traffic aggregated over the nodes is less than but close to the access network total capacity. Would you choose a channel partitioning or random access protocol? Assume if you choose channel partitioning, the channel will be divided into N subchannels.

Design a MAC protocol for an access network where N nodes generate data continuously at a constant rate, at x bits/sec per node. Additionally, the traffic aggregated over the nodes is less than but close to the access network total capacity. Would you choose a channel partitioning or random access protocol? Assume if you choose channel partitioning, the channel will be divided into N subchannels.

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

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.
Consider the LAN below consisting of 12 computers (A-L) connected by two Ethernet bridges. At t=0 the bridging table entries for both bridges are empty. At t = 1, node L sends to node E, and node E replies immediately (well before the next time step). What are the (MAC address, interface) entries in the bridging tables right after these transmissions? Note: interface = port number a) Left-hand-side bridge: (L,15), (E, 8). Right-hand-side bridge: (L,7), (E, 5). b) Left-hand-side bridge: (L,8), (E, 8). Right-hand-side bridge: (L,7), (E, 7). c) Left-hand-side bridge: (L,15), (E,5). Right-hand-side bridge: (L,7), (E, 8). d) Left-hand-side bridge: (L,8), (E,8). Right-hand-side bridge: (L,7), (E, 7).
Consider this multihpop network running the 802.11 MAC protocol in ad-hoc mode (RTS-CTS-DATA-ACK) and a link speed of 1 Mbps: A === B === C === D Edges ‘===’ represent connectivity, so, for instance, nodes B and C can communicate with each other directly, but A and C cannot. All nodes are able to route packets on behalf of the other nodes and they employ store-and-forward to deliver packets to the destination. Suppose nodes A, B, and C have to send a lot of data frames to node D and have their link layer queue always full. What is the average data rate for A, B, and C assuming no DATA frames get lost due collisions? Explain your answer. Compare the data rates with the link rate.
Consider a computer 1 that communicates with a computer 2 via LAN1, router R1, and LAN2. The sending computer1 is running two processes at this time with port addresses k and l. The receiving computer 2 is running three processes at this time with port addresses f, g and h. Process k in the sending computer 1 needs to communicate with process g in the receiving computer 2. Draw the network and show the contents of segments, packets and frames at the network, data link, and transport layer for each hop. Note: Computer 1 has: Physical address=15, Logical address=A Router R1 has: Physical address in the side of LAN 1=20, Logical address in the side of LAN1=B Physical address in the side of LAN 2=50, Logical address in the side of LAN2=D. Computer 2 has: Physical address=77, Logical address=E.
question 2 : Given the following topology. By calculating a network address yourself(Calculation Process: First three digit of your ID.fourth and fifth Digit of your ID.last Two Digit of your ID.0/choose a suitable subnet mask). Now perform a classless subnetting (VLSM) and show the results. ( You can use a table with ROW as a Network Address and COLUMN for representing the Number of hosts, Subnet Mask, etc. my Id : 2020000010051
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.
Answer the questions below with reference to Data Link Layer (max 250 words): i) A local Area Network (LAN) Medium Access Control (MAC) protocol aims to achieve fair and efficient access to a LAN transmission medium. Characterise the distinction between authorisation based (“taking turns”) and contention based (random access) MAC layer protocols and discuss the suitability of each protocol in light traffic and heavy traffic networks in terms of fairness and efficiency of access. ii) In CSMA/CD, after the fifth collision, what is the probability that a node chooses k=4. The result k=4 corresponds to a delay of how many seconds on a 10Mbps Ethernet?
Suppose an HTML file references two very small objects on the same server (total 3 object including the HTML file). Neglecting transmission times, how much time elapses for all objects to be loaded/received in a non-persistent connection scenario. Assume that the round-trip delay is 10ms for each back and forth communication (even for establishing TCP connection)
Host A is sending an enormous file to Host B over a TCP connection. Over this connection there is never any packet loss and the timers never expire. Denote the transmission rate of the link connecting Host A to the Internet by R bps. Suppose that the process in Host A is capable of sending data into its TCP socket at a rate S bps, where S=10·R. Further suppose that the TCP receive buffer is large enough to hold the entire file, and the send buffer can hold only one percent of the file. What would prevent the process in Host A from continuously passing data to its TCP socket at rate S bps? TCP flow control? TCP congestion control? Or something else? Elaborate.
Does the phrase "Cache staleness and high MAC overhead combined result in a considerable reduction in performance for (DSR) dynamic source routing protocols in high mobility scenarios of nodes in the MANNET" hold true for you? Can you provide some justification for your choice?
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 a packet sent on a bridged LAN to a nonexistent address. Across how many segments will bridges forward the packet?