![EBK COMPUTER NETWORKING](https://www.bartleby.com/isbn_cover_images/8220102955479/8220102955479_largeCoverImage.jpg)
EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 9, Problem P13P
a)
Program Plan Intro
Forward Error Correction:
- 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.
b)
Program Plan Intro
Forward Error Correction:
- 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.
c)
Program Plan Intro
Forward Error Correction:
- 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.
Expert Solution & Answer
![Check Mark](/static/check-mark.png)
Want to see the full answer?
Check out a sample textbook solution![Blurred answer](/static/blurred-answer.jpg)
Students have asked these similar questions
We compress the video with the pattern GoP (16 : 3) by using MPEG coding. Assume that the average compression ratios of frame I, frame P, and frame B are 1:5, 1:20, and 1:60, respectively. We put the compressed frames in 512 B packets and send them. The header size of each packet is 5% of the size of packet. Each packet contains information on one frame and its header, Each frame can be sent in multiple packets. Picture resolution is 196 Ć 144 for a video at 32 fps.
(a)What is the compression ratio in this pattern?
(b)What is the order of coding and transmitting frames in this pattern?
(c)If frame 6 is lost while transmission, which frames will be faulty?
(d)If frame 5 is lost while transmission, which frames will be faulty?
(e)If frame 17 is lost while transmission, which frames will be faulty?
(f)Find the size of uncompressed image frame?
(g)In how many packets can an I-frame be transmitted on average?
(h)In how many packets can an I-frame be transmitted on average?
(i)In how manyā¦
Computer 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.
Consider a half-duplex point-to-point link using a stop-and-wait
scheme, in which a series of messages is sent, with each message
segmented into a number of frames. Ignore errors and frame
overhead.
A. What is the effect on line utilization of increasing the
message size so that fewer messages will be required? Other
factors remain constant.
B. What is the effect on line utilization of increasing the number
of frames for a constant message size?
C. What is the effect on line utilization of increasing frame size?
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
- 2. Simple FEC is a forward error correction scheme for recovering from packet loss in a VolP application. This model creates a redundant chunk by exclusive OR-ing n original chunks and sends it along with the original ones so that the receiver can reconstruct the original n chunks if at-most one chunk is lost throughout the transferring process. Assuming that n = 4 and receiver receives four out of the five chunks sent by the sender in the following way, reconstruct the missing (lost) chunk. ā¢ First Chunk: 11101101 ā¢ Second Chunk: 01000101 ā¢ Third Chunk: lost ā¢ Fourth Chunk: 11100010 ā¢ Redundant Chunk: 11010000arrow_forwardConsider a simple protocol for transferring files over a link. After some initial negotiation, A sends data packets of size 1 KB to B; B then replies with an acknowledgment. A always waits for each ACK before sending the next data packet; this is known as stop-and-wait. Packets that are overdue are presumed lost and are retransmitted. (a) In the absence of any packet losses or duplications, explain why it is not necessary to include any "sequence number" data in the packet headers. (b) Suppose that the link can lose occasional packets, but that packets that do arrive always arrive in the order sent. Is a 2-bit sequence number (that is, N mod 4) enough for A and B to detect and resend any lost packets? Is a 1-bit sequence number enough? (c) Now suppose that the link can deliver out of order and that sometimes a packet can be delivered as much as 1 minute after subsequent packets. How does this change the sequence number requirements?arrow_forwardA new architecture, with N layers, is proposed. User application at the top layer generates a message of M bytes. At each layer, an H bytes header is added. The second layer of that architecture also adds T bytes trailer. In this architecture, the message M is not divided into smaller packets at any layer. ā¢ What is the size of the final message (in bytes) transferred by the lower layer? ā¢ If we consider the headers and trailers to be an overhead, what is the percentage of such overhead to the total size of the final message?arrow_forward
- In a bit-oriented link-layer protocol, the start and end of a frame are each marked by a flag, which is a sequence of exactly 6 consecutive 1 bits. Bit stuffing is used during the rest of the frame: after sending 5 consecutive 1 bits, a 0 is added. The bits below contain an example frame, with the leftmost bit received first. The content of the frame is a sequence of bytes, sent most significant bit first. Put the values of the first four bytes of the frame content, in order, in the four answer boxes below. You may enter the values in either decimal (e.g. 76, 123) or hexadecimal (e.g. 2a, f7). 00101011111010001111110011100111110000111101111101010110100010010011111101101100100 57ā240ā123ā229arrow_forwardConsider sending a 2000-byte datagram into a link with a MTU of 980 bytes. Suppose the original datagram has the identification number 227. How many fragments are generated? For each fragment, what is its size, what is the value of its identification number, fragment offset, and fragment flag?arrow_forwardConsider the Go-Back-N (GBN) and Selective Repeat (SR) protocols with a sender window size of 4 and a sequence number range of 1024. For each of these protocols, describe what happens for the following cases:a) The first packet in the sender window size is lost before reaching the destination.b) All transmitted packets reached the destination except the third one.c) Only the first and last packets in the sender window size reached the destination.d) Only the ACKs of the first and last packets, in the sender window size, reached the destination.arrow_forward
- 2. Suppose a large file of size F bits is to be sent from host A to host B. There are two links and two routers on the path from A to B. The links are uncongested and the link propagation delays are negligible. Host A segments the file into segments of size S bits each and adds 60 bits of header to each segment, forming packets of size L = S+ 60 bits. Each link has a transmission rate of R bps. Find the value of S that minimizes the file transfer delay from host A to host B.arrow_forwardConsider a network with a data rate of 10 Mbps. Messages sent on this network have a maximum size of 1000 bits, including a 16-bit control field. What is the number of messages required to send a file F of 4 Mbits from one station to another? Assuming that a station cannot send a new message until it receives an acknowledgment of the successful reception of the previously sent message. The acknowledgment takes the form of a 16-bit message. A timer is set to a duration T after the sending of each message. If time T expires before receiving an acknowledgment, the sending station resends the same message. The distance between the two farthest stations in the network is 1 km. The signal propagation speed is v = 200,000 km/s. What is the minimum value of T? (You ignore the queuing time and the processing time and use only the propagation time and the transmission time)arrow_forwardConsider sending a file of F bits over a path of Q links. Each link transmits at R bits per second (bps). The network is lightly loaded so that there are no queueing delays. When a form of packet switching is used, the F bits are broken up into packets, each packet with L bits, of which h bits of it are header. Propagation delay is negligible. Let F = 5x104, Q = 20, R = 1 Mbps, L = 1000, and h = 10.Ā b) Suppose the network is a packet-switched datagram network and a connectionless service is used. How long does it take to send the file?arrow_forward
- Suppose the information content of a packet is the bit pattern 1110 0110 1001 1101 and an even parity scheme is being used. What would the value of the field containing the parity bits be for the case of a two-dimensional parity scheme? Your answer should be such that a minimum length checksum field is used.arrow_forwardSuppose the information content of a packet is the bit pattern 1110101010101111 and an even parity scheme is being used. What would the value of the checksum field be for the case of a two-dimensional parity scheme? Your answer should be such that a minimum-length checksum field is used.arrow_forwardA file of size 20 KiloBytes is transmitted to a destination over a 10 Megabit/s network link (1 Mega = 10^6, 1 Kilo = 10^3, 1 byte = 8 bits). The propagation delay to the destination is 40 milliseconds (1 milli = 10^ā3). Assume the queueing delay encountered by packets of the file is negligible. What is the total delay (in milliseconds) for the file to get to its destination?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
![Text book image](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
![Text book image](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
![Text book image](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education