6.3B-5. Multiple Access protocols (5). 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 01 U 0 3 For the CSMA/CD protocol (with collision detection), indicate which packets are successfully transmitted. 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. If a node senses a collision, it stops transmitting immediately (although it will still take .2 time units for the last transmitted bit to propagate to all other nodes). Hint: consider propagation times carefully here. Hint: consider propagation times carefully here. 4 5 23 t=1.0 U 9 t=2.0 t-3.0 t=4.0 t=5.0

6.3B-5. Multiple Access protocols (5). 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 01 U 0 3 For the CSMA/CD protocol (with collision detection), indicate which packets are successfully transmitted. 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. If a node senses a collision, it stops transmitting immediately (although it will still take .2 time units for the last transmitted bit to propagate to all other nodes). Hint: consider propagation times carefully here. Hint: consider propagation times carefully here. 4 5 23 t=1.0 U 9 t=2.0 t-3.0 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 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.
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.
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?
QUESTION 78 Consider the network shown below. Suppose all ASs are running OSPF for their intra-AS routing protocol. Suppose EBGP and IBGP are used for the inter-AS routing protocol. All links in any AS has the same weights AS1 AS3 1b 1a 3b 1ç 110 30 19 За J11 3d AS2 12 114 2d 113. 4b 16 2a 15, 20 2b AS4 a. Router 3c learns about prefix x from which routing protocol? b. Router 3a learns about x from which routing protocol? c. Router 1c learns about x from which routing protocol? d. Router 4b learns about x from which routing protocol? Assuming AS1 and AS2 uses hot potatoes routing What woud be the entry for x in the 2b routing table? What would be the entry for x in the 2d routing table? What would be the entry for x in the 1c routing table? How AS2 can restrict AS1 from routing to X via AS2?
In this problem, we consider sending real-time voice from Host A to Host B over a packet-switched network (VoIP). Host A converts analog voice to a digital 64 kbps bit stream on the fly. Host A then groups the bits into 56-byte packets and when a packet is formed, it is send to host B. There is one link between Hosts A and B; its transmission rate is 2 Mbps and its propagation delay is 10 msec. What's the elapsed time since when the first bit is formed (from the original analog signal at Host A) until the bit is received at host B?
P8. 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.1.17/24. Also suppose that Subnet 1 is required to support at least 60 interfaces, Subnet 2 is to support at least 90 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.
Suppose there are 4 nodes sharing a broadcast channel using TDMA protocol. Suppose at time t=0: Node 1 has 6 frames to transmit, Node 2 has 4 frames to transmit, Node 3 has 8 frames to transmit, Node 4 has 3 frames to transmit. Maximum number of frames which can be transmitted by a node in a time slot = 3 The time required to transmit one frame = 1 Second Explain how collision is handled in TDMA, CSMA/CD and Token passing protocols.
5.09. How to forward to a border router? Consider the network shown below. Suppose AS1, AS2, AS3, and AS4 are running OSPF for their intra-AS routing protocol and that all links have a weight of 1. Now suppose the link between 2a and 4a is up, and that paths to x via AS2 and AS4 are known with AS1. Hot potato routing is used in conjunction with iBGP within an AS for determining the outgoing border router to use. Indicate which one of the statements below are true. 3b 3c AS 3 3a 4c 1a 4b AS 4 4a 1c AS 1 ²1 2₂. 1d 1b AS 2 1d will forward along z2 since 1d has a shorter intra-domain path than border router 1b to border router 1c, and hot potato routing is used. 1d will forward along z1 since OSPF has computed the path to 1c is via z1. 1d will forward along z1 since that was the path used initially. O 1d will forward along 1 or z2, since a hot potato can be thrown in any direction.
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 B to node D. 77-34-F1 EF-14-72 128,119,97,18 A (1) 68-01-BC-58-AF-24 128,119,50,107 B 49-FA-B0-3C-E2-7C 128,119,50,60 72-9E-40-31-9C-42 128.119.240.15 CC-A5-81-08-AF-33 128,119.97.194 40-00-A0-74-06-1F 128,119,240,52 (5) C D5-AO-EE-9A-73-06 128.119.240.116 A. What is the source/destination network- or link-layer address at the location (3)? B. What is the source/destination network- or link-layer address at the location (4)? C. What is the source/destination network- or link-layer address at the location (5)? Consider an IP datagram being sent from node A to node C. D. What is the source/destination network- or link-layer address at the location (2)? E. What is the source/destination network- or link-layer address at the location (4)? F. What is the source/destination network- or link-layer address at the…
Consider a wireless LAN with the following information: IEEE 802.11 physical layer transmission rate = 96Mbps, and • MAC layer data = 1096 bytes • MAC header = 16 bytes •ACK = 34 bytes • SIFS Time 12μs • DIFS Time=26µs • Physical layer overhead = 22μs Assume that the propagation time is negligible. Also, assume that for RTS and CTS frames there is no MAC layer error detection used (i.e., no error detection of possible errors in the Physical Layer header). Find the MAC layer throughput if: a. RTS/CTS transaction is used. b. RTS/CTS transaction is not used.
In this problem, we consider sending real-time voice from Host A to Host B over a packet switched network (VoIP). Host A converts analog voice to a digital 64 kbps bit stream on the fly. Host A then groups the bits into 56-byte packets. There is one link between Hosts A and B; its transmission rate is 2 Mbps and its propagation delay is 10 msec. As soon as Host A gathers a packet, it sends it to Host B. As soon as Host B receives an entire packet, it converts the packet's bits to an analog signal. How much time elapses from the time a bit is created (from the original analog signal at Host A) until the bit is decoded (as part of the analog signal at Host B)?
P6. This elementary problem begins to explore propagation delay and transmis- sion delay, two central concepts in data networking. 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. a. Express the propagation delay, dprops in terms of m and s. b. Determine the transmission time of the packet, drans, in terms of L and R. c. Ignoring processing and queuing delays, obtain an expression for the end- to-end delay. d. Suppose Host A begins to transmit the packet at time t = 0. At time t = dirans, where is the last bit of the packet? e. Suppose dprop is greater than drans. At time 1 = dyans where is the first bit of the packet? f. Suppose dprop is less than drans- At time t = drans where is the first bit of the packet? g. Suppose s = 2.5 10%, L m so that dprop equals drans = 120 bits, and R 56 kbps.…