EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 9, Problem P5P
a)
Program Plan Intro
Adaptive HTTP streaming:
- It is also called as DASH (Dynamic Adaptive Streaming over HTTP).
- The video are being encoded with different version.
- Each version will have a different bit rate and different quality levels.
- The requests are made dynamically by the client in order to request the individual chunks of video segments of different version and few seconds in length.
- It the bandwidth is high, the client selects the chunk that has a high rate version and if the bandwidth is low, the client picks video chunks that has low version.
b)
Program Plan Intro
Adaptive HTTP streaming:
- It is also called as DASH (Dynamic Adaptive Streaming over HTTP).
- The video are being encoded with different version.
- Each version will have a different bit rate and different quality levels.
- The requests are made dynamically by the client in order to request the individual chunks of video segments of different version and few seconds in length.
- It the bandwidth is high, the client selects the chunk that has a high rate version and if the bandwidth is low, the client picks video chunks that has low version.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
6. Consider sending over HTTP a Web page that consists of one video clip, and five images.
Suppose that the video clip is transported as 25 frames, and each image has 4 frames.
a. If all the video frames are sent first without interleaving, how many "frame times"
are needed until all five images are sent?
b. If frames are interleaved, how many frame times are needed until all five images
are sent.
You are the designer of a transfer protocol to send/receive a file between two computers. The sender divides the file into smaller frames to be sent sequentially to the receiver, and there are two options to make sure that receiver receives the file correctly:
The sender can send frame n+1 if receives an ACK on frame n from the receiver (e.g., sender receives ACK on frame 2, so will proceed and send frame 3).
The sender sends all the frames sequentially and the receiver will send only one ACK if the entire file is received successfully.
Which approach, from your point of view, is efficient and why - If we have:
noisy communication channel (there is high probability of more than one device speak at the same time, high probability of interference).
non-noisy communication channel.
Gap in playback is a common problem exiting in multimedia applications transmitted using the isochronous data transmission approach shown in class. What is the method used to solve the problem?
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
- Suppose that there are three stations labelled A, B, and C, where A and C are transmitting while B is receiving. The stations are in a configuration such that the two transmitters A and C are not in the radio range of each other. Since station C is out of the radio range of A, it does not know the presence of A. That’s why C perceives that channel B is free and starts transmitting to B. Also ‘A’ transmit signal at the same time to Channel B. The frames are garbled and a collision occurs. This is shown in the following figure: I. What is the name of this problem? II. How can we overcome this problem?arrow_forwardSuppose that a 20-Mbps 802.11 LAN is transmitting 64-byte frames back-to-back over a radio channel with a bit error rate of 10−7 (i.e., the probability of a bit to flip duringthe transmission). How many frames per second will be damaged on average?(*hint: you would need to calculate the probability that a frame does not suffer any bit errors, thisis equivalent to the fraction of frames that do not suffer any bit errors on average.)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
- Write a program to simulate the behaviour of the CSMA/CD protocol over Ethernet when there are N stations ready to transmit while a frame is being transmitted your program should report the times when euch station successfully starts sending its frame. Assume that a clock tick occurs once every slot time (57.2 usec) and a collision detection and sending of a jamming sequence. takes one slot time. All frames are the maximum length allowedarrow_forwardConsider the behavior of two machines in a distributed system. Both have clocks that are supposed to tick 1000 times per millisecond. One of them actually does, but the other ticks only 990 times per millisecond. If UTC updates come in once a minute, what is the maximum clock skew thatwill occur?arrow_forward(a) Suppose a server S and client C are connected over the Internet. The one-way prop- agation delay from S to C is 50 ms. The maximum throughput between S and C is R = 200 Mbps. A browser on client C makes an HTTP request for a webpage on server S. The base HTML file is of size 500 KB and it references five objects, each of size 5 MB. Find the total response time for the client to receive the entire webpage using nonpersistent HTTP with up to two parallel connections. Assume that when two par- allel connections are active, the throughput for each connection is 40% of the maximum throughput R. (b) Suppose an application running on host ece.gmu.edu needs to resolve the domain name cs.vtech.edu. Draw a diagram (with labels) showing the sequence of queries/responses in a recursive DNS query to find the answer in a scenario where all levels of the DNS hierarchy are involved.arrow_forward
- Write a program to simulate the behavior of the CSMA/CD protocol over Ethernet when ther are N stations ready to transmit while a frame is being transmitted. Your program should report the times when each station successfully starts sending its frame. Assume that a clock tick occurs every slot time (51.2 microsec) and a collison detection and sending of a jamming sequence takes one slot time. All frames are the maximum length allowed.arrow_forwardQ.No.2. In a network, at physical layer, the sender sends the data in continuous binary stream towards receiver, the receiver get confused about how many bits to combine in order to make the frame because the frames are not of fixed size. What you will suggest to make it work properly, suggest a solution that works on any given string. Please give the help of example also. Note: This question is from computer network.arrow_forwardQ 5- Assume that in a distributed system, the max clock skew of two different computers is 3 minutes. If the max clock drift is a * 0 0000001 seconds, calculate how often clocks should be synchronized in that distributed system? You should write the solution on a paper and upload the clear image, (a = the last digit of your student number For example, if your student number is 123456 a is 6.)arrow_forward
- Develop a simulation program to simulate an 8-port Ethernet switch. The switch initially has no knowledge about the hosts connected to each port. It learns frame addresses and stores-and- forwards the frames. The input text file "in.txt" contains information of the incoming frames, one frame per line. There are 4 pieces of data per line: frame ID, arrival port, frame source address, and frame destination address. The frames arrive at the switch in the order of which they appear in the input file. Destination address "X" indicates a broadcast frame. The output text file "out.txt" has 8 lines. Each line lists all the frames departing from each port, here is an example: "in.txt" contains 5 incoming frames: F1 P2 B--A F2 P6 D--C F3 P5 E--B F4 P7 F--D F5 P6 D--X "out.txt" should list the departing frames on each port: P1: F1 F2 F5 P2: F2 F3 F5 P3: F1 F2 F5 P4: F1 F2 F5 P5: F1 F2 F5 P6: F1 F4 P7: F1 F2 F5 P8: F1 F2 F5 Iarrow_forwardAssume we have a client using a web browser that is directly connected to a web server. We are assuming there is a direct link between the client and the server. The RTT delay between the client and the server is 10 msec. The time it takes the server to transmit an object to its outgoing link is 2 msec. Now suppose that the client has the web page that it wants already cached locally. But the user wants to constantly check for updates and sends conditional get requests one after the other 20 times -- that is, once it gets a response and/or the updated object it sends out the next request. If we are using persistent HTTP and the cached object is up-to-date 40% of the time, how much time will elapse between sending the first request and the completion of the last one?arrow_forwardA messaging system reads message as 4-digit positive integer d1d2d3d4 and stores encoding of the message e1e2e3e4 for security reason. The encoding process is as follows: ei = (di+i) mod 3 For example, if message is 4590, the encoded message is 2101. Read any arbitrary message and display the encoded message in the following format: Original message = Encoded message = language : Carrow_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 Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education