EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 7, Problem P6P
Program Plan Intro
CSMA/CD:
- It is known as “Carrier-Sense Multiple Access with Collision Detection”.
- It is an access control method which is mostly used in Local Area Networking.
- It is designed to improve CSMA’s performance by halting transmission once the collision is spotted.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
In step 4 of the CSMA/CA protocol, a station that successfully transmits a frame begins the CSMA/CA
protocol for a second frame at step 2, rather than at step 1. What rationale might the designers of
CSMA/CA have had in mind by having such a station not transmit the second frame. Immediately (if
the channel is sensed idle)?
In a byte-oriented link layer protocol, the receiver adds all the bytes between the start and end marker bytes (not including those markers) modulo 239, and expects to get a result of 0 if there have been no errors. The byte immediately before the end marker is a checksum, chosen at the transmitter to make this possible. The probability of an error in any received bit is 0.00075 . The total length of the frame is 205 bytes (including start and end markers). Estimate the probability of errors occurring in the received frame but not being detected. You need to consider what combinations of bit errors could cause the error detection system to fail (i.e, conclude that there are no errors). As you are asked for an estimate, you need only consider the most likely scenarios - it is safe to ignore events that could only occur with much lower probability. Round your answer to three significant figures. As the probability will be very low in some cases, you may have to enter up to 7 digits after…
Protocol 6's frame arrival code includes a part for NAKs.If the incoming frame is a NAK and another condition is satisfied, this section is called.Give an example of a situation in which the existence of this other condition is critical.
Chapter 7 Solutions
EBK COMPUTER NETWORKING
Ch. 7 - Prob. R1RQCh. 7 - Prob. R2RQCh. 7 - Prob. R3RQCh. 7 - Prob. R4RQCh. 7 - Prob. R5RQCh. 7 - Prob. R6RQCh. 7 - Prob. R7RQCh. 7 - Prob. R8RQCh. 7 - Prob. R9RQCh. 7 - Prob. R10RQ
Ch. 7 - Prob. R11RQCh. 7 - Prob. R12RQCh. 7 - Prob. R13RQCh. 7 - Prob. R14RQCh. 7 - Prob. R15RQCh. 7 - Prob. R16RQCh. 7 - Prob. R17RQCh. 7 - Prob. R18RQCh. 7 - Prob. R19RQCh. 7 - Prob. R20RQCh. 7 - Prob. R21RQCh. 7 - Prob. R22RQCh. 7 - Prob. R23RQCh. 7 - Prob. P1PCh. 7 - Prob. P2PCh. 7 - Prob. P3PCh. 7 - Prob. P5PCh. 7 - Prob. P6PCh. 7 - Prob. P7PCh. 7 - Prob. P8PCh. 7 - Prob. P10PCh. 7 - Prob. P11PCh. 7 - Prob. P12PCh. 7 - Prob. P13PCh. 7 - Prob. P14PCh. 7 - Prob. P15PCh. 7 - Prob. P16P
Knowledge Booster
Similar questions
- Consider a datagram network in which a packet travels through two switches S1 and S2 from source to destination. Packet experiences wait at each switch before it is forwarded. Transmission time, propagation time and wait time at each node is 3 ms, 1.5 ms, and 0.25 ms respectively. Find the total delay.arrow_forwardA packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other packets are waiting to be transmitted. Packets are transmitted in order of arrival. Suppose all packets are 1,500 bytes and the link rate is 2 Mbps. What is the queuing delay for the packet? More generally, what is the queuing delay when all packets have length L, the transmission rate is R, x bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?arrow_forwardUse a diagram to illustrate the four-way handshake protocol for channel reservation in IEEE 802.11 (i.e., WiFi). Please indicate the name of each frame, and also the idle period before each frame is transmitted. (Tips: the protocol used is CSMA/CA with RTS/CTS.)arrow_forward
- Consider a two-link network in which Host A has a 1 Mbps connection with a 10 ms propagation delay and the router has a 15 Mbps link with a 25 ms propagation delay. Host A sends Host B a 1500-byte packet. What is the packet transmission delay from the router to Host B (in milliseconds)?arrow_forwardUse a diagram to illustrate the four-way handshake protocol for channel reservation in IEEE 802.11 (i.e., WiFi). Please indicate the name of each frame, and also the idle period before each frame is transmitted. (Tips: the protocol used is CSMA/CA with RTS/CTS.)arrow_forwardAn entry in the switching table of a virtual-circuit network is normally created during the setup phase and deleted during the teardown phase. In other words, the entries in this type of network reflect the current connections, the activity in the network. In contrast, the entries in a routing table of a datagram network do not depend on the current connections; they show the configuration of the network and how any packet should be routed to a final destination. The entries may remain the same even if there is no activity in the network. The routing tables, however, are updated if there are changes in the network. Can you explain the reason for these two different characteristics? Can we say that a virtual-circuit is a connection oriented network and a datagram network is a connectionless network because of the above characteristics?arrow_forward
- NAKs are handled in protocol 6's code for frame arrival.If the incoming frame is a NAK and another condition is satisfied, this section gets activated.Describe a situation in which this other condition is critical.arrow_forwardA circuit-switched TDM-link uses 1024-bit frames over 16 TDM slots'. a. How many 'circuits’ are supported by this configuration? b. If we allowed the TDM-link to be utilized for "TCP connections", how many simultaneous TCP connections could be supported by the TDM link? (Hint: remember TCP connections is a full-duplex bidirectional stream) If the gross bitrate of this link is 8.192Mbit/s, what is the 'frame rate'? C. d. Given the 'gross bitrate', what would the throughput be (in bits/s, Kbits/s, or Mbits/s, as appropriate) for any ONE 'circuit in this configuration?arrow_forwardA sender with window size (W=3) is connected to a selective repeat receiver by a link with bandwidth =106 bytes/second and propagation delay of 0.25 msec. The receiver sends Positive ACK for correctly received packets. For each packet sent, the sender sets a timer with time out value of 5 msec. On receiving an ack for a packet, the timer for that packet is cancelled. If the timer expires, that packet is retransmitted immediately. Assume that the sender sends packets 1, 2, and 3 (at t=0, packet size =1000 Bytes) and packet 2 is lost. NO other packet is lost. Under this scheme , at what time in msec would all the packets been received at the receiver.arrow_forward
- Let the two host X and Y connected via a packet switch with 107 bits per second links. Switch is placed at 50 km from X. X and Y are located at 100 Kilometer apart also the propagation speed along the link is 2 × 108 m/s. The switch begins forwarding a packet after 0.1 milliseconds it receives the packet. If 1000 bytes of File are needed to be transmitted and each packet size is 500 bytes, the time elapsed between the transmission of the first bit of data and the reception of the last bit of the data in millisecond isarrow_forwardHost A is sending data to host Bover a full duplex link. A and B are using the sliding window protocol for flow control. The send and receive window sizes are 5 packets each. Data packets (sent only from A to B) are all 1000 bytes long and the transmission time for such a packet is 50 µs. Acknowledgment packets (sent only from B to A) are very small and require negligible transmission time. The propagation delay over the link is 200 µs. What is the maximum achievable throughput in this communication?arrow_forwardAssume a small communication network, consisting of two user stations and a base station (BS). The users are recording and transmitting data collected by sensors and are transmitting the data frames using frequency band BW, (uplink). BS only collects data and acknowledges them. It uses a different band BWBs (downlink) for transmissions. The uplink and downlink channels are assumed perfect; no packets are lost due to bit errors. An Aloha protocol is used to access the medium by the BS and users. The users generate traffic following Poisson distribution, with frame generation rate lu. The time duration of data frames is Tf whereas the duration of acknowledgements is TAck: Determine the probability that the frame generated by a user will be lost.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning