EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 6, Problem P17P
Explanation of Solution
Given data:
K = 100
Adapter waits for K * 512 bit times. That is: 51200 bit times.
R = 10 (for 10Mbps broadcast channel)
R = 100 (for 100Mbps broadcast channel)
To find: How long the adapter waits for 10Mbps broadcast channel and long the adapter waits for 100Mbps broadcast channel
Solution:
For 10Mbps broadcast channel:
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
In cdma2000 reverse link, a user stream of 9.6kbps is sent to an encoder r = 14 (4 coded bit for every
1 information bit), K = 9. and then through a symbol repetition (2x) (repeats the encoded bits twice).
What coded data rate after repetition is obtained? What Walsh code length should you use to spread
that stream into a typical 1.2288Mcps CDMA channel?
In a selective repeat sliding window protocol the bandwidth of the link is 10 Mbps. The size of the frame is 10 KB and the one-way delay is 100 msec. If the efficiency of the protocol is 60 % then the minimum number of sequence bits that are required for the protocol is?
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…
Chapter 6 Solutions
EBK COMPUTER NETWORKING
Ch. 6 - Consider the transportation analogy in Section...Ch. 6 - If all the links in the Internet were to provide...Ch. 6 - Prob. R3RQCh. 6 - Prob. R4RQCh. 6 - Prob. R5RQCh. 6 - Prob. R6RQCh. 6 - Prob. R7RQCh. 6 - Prob. R8RQCh. 6 - Prob. R9RQCh. 6 - Prob. R10RQ
Ch. 6 - Prob. R11RQCh. 6 - Prob. R12RQCh. 6 - Prob. R13RQCh. 6 - Prob. R14RQCh. 6 - Prob. R15RQCh. 6 - Prob. R16RQCh. 6 - Suppose the information content of a packet is the...Ch. 6 - Suppose the information portion of a packet (D in...Ch. 6 - Prob. P4PCh. 6 - Prob. P5PCh. 6 - Prob. P6PCh. 6 - Prob. P7PCh. 6 - Prob. P8PCh. 6 - Prob. P9PCh. 6 - Prob. P10PCh. 6 - Prob. P11PCh. 6 - Prob. P12PCh. 6 - Prob. P13PCh. 6 - Prob. P14PCh. 6 - Prob. P15PCh. 6 - Prob. P16PCh. 6 - Prob. P17PCh. 6 - Prob. P18PCh. 6 - Prob. P19PCh. 6 - Prob. P20PCh. 6 - Prob. P21PCh. 6 - Prob. P22PCh. 6 - Prob. P23PCh. 6 - Prob. P24PCh. 6 - Prob. P25PCh. 6 - Prob. P26PCh. 6 - Prob. P27PCh. 6 - Prob. P32PCh. 6 - Prob. P33P
Knowledge Booster
Similar questions
- 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 ofarrow_forwardA 4480-octet datagram is to be transmitted and needs to be fragmented because it will pass through an Ethernet with a maximum payload of 1500 octets. Show the Total Length, More Flag, and Fragment Offset values in each of the resulting fragments.arrow_forwardSuppose a new CSMA/CD protocol is designed for a 100 Mbps bus network with topology similar to 10Base2. The minimum frame length is 40 bytes. What is the maximum length of the longest cable connecting two nodes so that the collision detection mechanism still works? Write symbolic equations (e.g. using d=distance, R=data rate, etc.) and derive the solution. Explain with words what is going on.arrow_forward
- In a bus CSMA/CD network with a data rate of 10 Mbps, a collision occurs 20 μs after the first bit of the frame leaves the sending station. What should the length of the frame be so that the sender can detect the collision?arrow_forwardSuppose that there are three inter-media nodes between Host 1 and Host 2, and the transmission rate of each link is 4.096 Mbps. The time of end-to-end circuit established is 0.5 second. How much seconds does it take to send a file of 8.192M byte from host H1 to host H2 over a packet-switched network?arrow_forwardSuppose a system has 50 MB data to send on a network and transmit the data in burst at 8 Mbps, the maximum transmission rate across routers in the network is 6 Mbps, if system uses leaky bucket algorithm, the capacity (in MB) that bucket must hold so that no data is discarded is?.arrow_forward
- Suppose a switch is built using a computer workstation and that it can forward packets at a rate of 500,000 packets per second, regardless (within limits) of size. Assume the workstation uses direct memory access (DMA) to move data in and out of its main memory, which has a bandwidth of 2 Gbps, and that the I/O bus has a bandwidth of 1 Gbps. At what packet size would the bus bandwidth become the limiting factor?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_forwardComputer 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.arrow_forward
- A CSMA/CD LAN has minimum frame size 100 bytes and is running at 100 Mbps. The signal speed in the cable is 200,000 km/sec and the delay generated by the repeaters can be ignored. What is the maximum size the bus can have? (Note: ignore signal attenuation).arrow_forwardAssume a 4Kbps link has a one-way latency of 50ms and a frame with 4-bit sequence numbers. Let the minimum frame size that can guarantee a 50% channel utilization assuming the stop-and-wait protocol is X' bits, and the minimum frame size that can guarantee a 50% channel utilization assuming the selective repeat protocol is 'Y' bits. Find the value of X+ Y?arrow_forwardSuppose you are designing a sliding window protocol for a 1-Mbps point-to-point link to a stationary satellite revolving around the earth at 3 x 104 km altitude. Assuming that each frame carries 1 KB of data, what is the minimum number of bits you need for the sequence number in the following cases? Assume the speed of light is 3 x 108 m/s. (a) RWS=1 (b) RWS=SWSarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning