EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 9, Problem R11RQ
Explanation of Solution
Forward Error Correction (FEC):
- The process of adding redundant information to the original packet stream is called as FEC.
- It is done to obtain and reconstruct the exact version of the lost packets.
Two FEC schemes:
First scheme:
- The scheme is used to send a redundant encoded chunk after every n chunks.
- The redundant chunks can be obtained by making the exclusive OR-ing the original chunks.
- It is capable of reconstructing the packets that are lost if any one packet is lost.
Second Scheme:
- The scheme sends a lower resolution audio stream of low-bit rate as redundant data along with the original stream of data.
- Here the audio stream is considered as the redundant data with low bit rate...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
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")?
14. The link length is 2000km, the data transmission rate is 1kbit/s, and the data that needs
to be sent is 100bit. The data propagation rate on this link is 2x10 m/s. Suppose we can
see the bits transmitted on the link, try to draw the bits on the line we see:
a) When 100bit is just sent.
b)
After another 0.05s
Efficiency Principle:Ethernet V1 access protocol was designed to run at 10 Mbps over 2.5 Km using 1500 Byte packets. This same protocol needs to be used at 100 Mbps at the same efficiency (utilization). What distance can it cover if the frame size is not changed? (Note: be careful with the units.
Chapter 9 Solutions
EBK COMPUTER NETWORKING
Ch. 9 - Prob. R1RQCh. 9 - Prob. R2RQCh. 9 - Prob. R3RQCh. 9 - Prob. R4RQCh. 9 - Prob. R5RQCh. 9 - Prob. R6RQCh. 9 - Prob. R7RQCh. 9 - Prob. R8RQCh. 9 - Prob. R9RQCh. 9 - Prob. R10RQ
Ch. 9 - Prob. R11RQCh. 9 - Prob. R12RQCh. 9 - Prob. R13RQCh. 9 - Prob. P1PCh. 9 - Prob. P2PCh. 9 - Prob. P3PCh. 9 - Prob. P4PCh. 9 - Prob. P5PCh. 9 - Prob. P6PCh. 9 - Prob. P7PCh. 9 - Prob. P8PCh. 9 - Prob. P9PCh. 9 - Prob. P10PCh. 9 - Prob. P11PCh. 9 - Prob. P12PCh. 9 - Prob. P13PCh. 9 - Prob. P14PCh. 9 - Prob. P15PCh. 9 - Prob. P16PCh. 9 - Prob. P17PCh. 9 - Prob. P18PCh. 9 - Prob. P19PCh. 9 - Prob. P20PCh. 9 - Prob. P21PCh. 9 - Prob. P22P
Knowledge Booster
Similar questions
- ngineering Computer EngineeringQ&A Library2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and the length of the link is 100Km. a. What is the propagation delay from A to B, that is the amount of time from when the first bit of the packet is transmitted at A, until it is received at B? b. What is the transmission time of the packet at A (the time from when the first bit of the packet is sent into the wire and the time at which the last bit is sent into the wire). c. Suppose now that that length of the link is doubled. What is the propagation delay from A to B now and what is the transmission t 2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and the length of the link is 100Km. a. What is the propagation delay from A to B, that is the amount of time from when the first bit of the packet is transmitted at A, until it is received at B? b. What is the transmission time of the packet at A (the time from when the first bit of the packet is sent into the…arrow_forward4. 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_forwardNetworking question: Consider the following bit stream-a. 00000000 b. 11111111 c. 01010101 d. 00110011 Draw the graph of the i. differential Manchester scheme using each of the given data streams, assuming that the last signal level has been positive. From thegraphs, guess the bandwidth for this scheme using the average number of changes in the signal level.arrow_forward
- Berkeley Computer Science example (CS-168): Picture this: there are two hosts (A and B). The two hosts are connected by 50 msec of propagation delay. The bandwidth is equal to 106 B/sec. Note that the hosts use a sliding window where (W = 4, and packet size = 1000 Bytes) with (Selective Repeat). We will ignore the size of ACK and assume that the timer value for each packet is set as (send time + RTT) and retransmission occurs immediately after a timer expires. Make sure to assume that the packets are sent in sequence starting at time 0. How long does it take to successfully receive all 4 packets (P_0, P_1, P_2, P_3). Your answer should be in milliseconds. 1. When there is no packet loss. 2. When the P_1 packet becomes lost, but there is no further packet lossarrow_forwardAssume a 10Mbps Ethernet has two nodes, A and B, connected by a 360m cable with threerepeaters in between, and they each have one frame of 1,024 bits to send to each other. Further assumethat the signal propagation speed across the cable is 2*10^8 m/sec, CSMA/CD uses back-off intervals ofmultiples of 512 bits, and each repeater will insert a store-and-forward delay equivalent to 20-bittransmission time. At time t=0, both A and B attempt to transmit. After the first collision, A draws K = 0and B draws K = 1 in the exponential back-off protocol after sending the 48bits jam signal. a. What is the one-way propagation delay (including all repeater delays) between A and B inseconds? At what time is A's packet completely delivered at B? b. Now suppose that only A has a packet to send and that the repeaters are replaced with switches.Suppose that each switch has an 8-bit processing delay in addition to a store-and-forward delay.At what time, in seconds, is A's packet delivered at B?arrow_forwardComputer Science Two flows are transmitting at a constant rate of 4Mbps and 8Mbps and compete for service at a 10Mbps link. If the link adopts an RED policy, what is the expected drop probability for each flow?arrow_forward
- 3.4-8 Channel utilization with pipelining. Suppose a packet is 10K bits long, the channel transmission rate connecting a sender and receiver is 10 Mbps, and the round-trip propagation delay is 10 ms. What is the channel utilization of a pipelined protocol with an arbitrarily high level of pipelining for this channel?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 1 Mbps link is used to transfer packets of each 10,000 bits long. This includes 500 bits header. If the channel is error free and 270 msec is the signal propagation time from the source to destination, obtain the efficiency for, (1) Stop and wait protocol. (i) Sliding window protocol with window size of 500. (iii) Sliding window protocol with window size of 10.arrow_forward
- Consider a full-duplex 256 Kbps satellite link with a 240 millisecond end-to-end delay. The data frames carry a useful payload of size 12,000 bits. Assume that both ACK and data frames have 320 bits of header information, and that ACK frames carry no data. What is the effective data throughput When using sliding windows with a sender window size of W = 5 data frames?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_forwardPart II: In ADSL service, there is a single UTP pair running from the end office switch to the individual household. In cable modem service, the thick coaxial cable in the neighborhood is shared by many subscribers. Yet typically, cable modem service provides faster service to individual customers than ADSL. How can this be?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
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole