EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 9, Problem P3P
a)
Program Plan Intro
HTTP streaming:
- The video files are being stored at HTTP server in the form of ordinary file with URL that is specific to the video.
- The user can watch the videos by establishing a TCP connection with the server.
- The client issues the HTTP GET request for the requested URL.
- The server will in turn send the video file through the HTTP response in quick manner.
- The video requested are delivered as quickly as possible when the congestion control and flow control allows.
b)
Program Plan Intro
HTTP streaming:
- The video files are being stored at HTTP server in the form of ordinary file with URL that is specific to the video.
- The user can watch the videos by establishing a TCP connection with the server.
- The client issues the HTTP GET request for the requested URL.
- The server will in turn send the video file through the HTTP response in quick manner.
- The video requested are delivered as quickly as possible when the congestion control and flow control allows.
c)
Program Plan Intro
HTTP streaming:
- The video files are being stored at HTTP server in the form of ordinary file with URL that is specific to the video.
- The user can watch the videos by establishing a TCP connection with the server.
- The client issues the HTTP GET request for the requested URL.
- The server will in turn send the video file through the HTTP response in quick manner.
- The video requested are delivered as quickly as possible when the congestion control and flow control allows.
d)
Program Plan Intro
HTTP streaming:
- The video files are being stored at HTTP server in the form of ordinary file with URL that is specific to the video.
- The user can watch the videos by establishing a TCP connection with the server.
- The client issues the HTTP GET request for the requested URL.
- The server will in turn send the video file through the HTTP response in quick manner.
- The video requested are delivered as quickly as possible when the congestion control and flow control allows.
e)
Program Plan Intro
HTTP streaming:
- The video files are being stored at HTTP server in the form of ordinary file with URL that is specific to the video.
- The user can watch the videos by establishing a TCP connection with the server.
- The client issues the HTTP GET request for the requested URL.
- The server will in turn send the video file through the HTTP response in quick manner.
- The video requested are delivered as quickly as possible when the congestion control and flow control allows.
f)
Program Plan Intro
HTTP streaming:
- The video files are being stored at HTTP server in the form of ordinary file with URL that is specific to the video.
- The user can watch the videos by establishing a TCP connection with the server.
- The client issues the HTTP GET request for the requested URL.
- The server will in turn send the video file through the HTTP response in quick manner.
- The video requested are delivered as quickly as possible when the congestion control and flow control allows.
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.
(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.
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.
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 we have a web page which contains 10 objects including: a html main file, 8 jpg image, and a .mp3 background music. For simplicity, assume each of the 10 objects has a size of 4 Kbits and that each object can be completely transferred in one TCP packet. Furthermore, assume the round-trip time between the server and client is RTT= 250 ms, and the download rate is 1 Mbps. What will be the time it takes to complete transferring the web page running in the non-persistent mode? Total delay = msarrow_forwardDownload delays for 100 objects (HTTP 1.1 with local web caching). Consider an HTTP 1.1 client and server. The RTT delay between the client and server is 2 seconds. Suppose the time a server needs to transmit an object into its outgoing link is 3 seconds. There is also a local web cache, as shown in the figure below, with negligible (zero) propagation delay and object transmission time. The client makes 100 requests one after the other, waiting for a reply before sending the next request. All requests first go to the cache (which also has a 2.0 sec. RTT delay to the server but zero RTT to the client). How much time elapses between the client transmitting the first request, and the receipt of the last requested object, assuming no use of the IF-MODIFIED-SINCE header line anywhere, and assuming that 50% of the objects requested are "hits" (found) in the local cache? Your answer should be among the following list( 702 secs, 552 secs, 352 secs, 350 secs, 150 secs) . Show your…arrow_forwardConsider Figure 2.12, for which there is an institutional network connected to the Internet. Suppose that the average object size is 1,000,000 bits and that the average request rate from the institution’s browsers to the origin servers is 16 requests per second. Also suppose that the amount of time it takes from when the router on the Internet side of the access link forwards an HTTP request until it receives the response is three seconds on average (see Section 2.2.5). Model the total average response time as the sum of the average access delay (that is, the delay from Internet router to institution router) and the average Internet delay. For the average access delay, use ∆/(1 - ∆b), where ∆ is the average time required to send an object over the access link and b is the arrival rate of objects to the access link. Find the total average response time. I get ∆=1000000/15000000= 1/15, then ∆/(1 - ∆b)= (1/15)/(1-(1/15)*16)=-1, so the finally answer is : 3+(-1)=2s or 3+0=3s?arrow_forward
- A frame containing http request is sent from Computer (A) [in whichever subnet it is now, make sure to show it in your figure], to the access point it is associated with. Draw the address fields (1, 2, and 3) of the frame travelling from Computer A to AP and the source and destination addresses of the frame travelling from AP to R1. The MAC addresses of AP1, AP2, and AP3 are M1, M2, and M3 respectively, and the Router R1’s MAC address connected to this Switch/AP is MRA. IP address values are already given, and the port addresses could also be used as given. The Router’s MAC address facing WAN side is MRW.arrow_forwardWe 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…arrow_forwardGive some details of how you might augment the sliding window protocol with flow control by having ACKs carry additional information that reduces the SWS as the receiver runs out of buffer space. Illustrate your protocol with a timeline for a transmission; assume the initial SWS and RWS are 4, the link speed is instantaneous, and the receiver can free buffers at the rate of one per second (i.e., the receiver is the bottleneck). Show what happens at T = 0, T = 1,...,T = 4 seconds.arrow_forward
- In modern packet-switched networks, including the Internet, the source host segments long, application-layer messages (for example, an image or a music file) into smaller packets and sends the packets into the network. The receiver then reassembles the packets back into the original message. We refer to this process as message segmentation. Figure 1.27 illustrates the end-to-end transport of a message with and without message segmentation. Consider a message that is 8. 106 bits long that is to be sent from source to destination in Figure 1.27. Suppose each link in the figure is 2 Mbps. Ignore propagation, queuing, and processing delays. a. Consider sending the message from source to destination without message segmentation. How long does it take to move the message from the source host to the first packet switch? Keeping in mind that each switch uses store-and-forward packet switching, what is the total time to move the message from source host to destination host? b. Now suppose that…arrow_forwardAssume that there is a shared connection (for example, an Ethernet bus) with a speed of 1 Mbps. How much time (in microseconds) is required to send a frame with a length of 1000 bits over this link?arrow_forwardComputer Networks Problem In the CSMA/CD protocol, the network adapter waits K-512 bit times after a collision, where K is drawn randomly. For K=20, how long does the adapter wait until returning to Step 2 for a 10 Mbps broadcast channel?arrow_forward
- MCQ 1.Suppose 4 packets are received in a burst at a token bucket shaper, which has 1 token in the bucket at the time of arrival (t=0). Tokens are refilled at the rate of 1 token per 5 time units, with the first of the (new) tokens arriving at time t=2. Assume that the shaping buffer is very large. At what times are the packets eventually transmitted? Choose the most appropriate response. The choices list the scheduling times of the packets in order (packet 1, packet 2, packet 3, packet 4). A:2, 7, 12, 17 B:5, 10, 15, 20 C:0, 2, 7, 12 D: 0, 5, 10, 15arrow_forwardSuppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation delay between the two nodes is 245 bit-times. Suppose A and B send Ethernet frames at the same time. Suppose the transmission time of the entire frame is 295 bit-times. So, the frames collide, and then A and B choose different values of K in the CSMA/CD algorithm. A node chooses the value of K at random from {0,1,2,...2n−1} where n is the number of collisions experienced on the channel – note n is set to 1 in this case). For Ethernet, the actual amount of time a node waits is K*512 bit times (i.e., K times the amount of time needed to send 512 bits into the Ethernet). Suppose A chooses a K value of 0 and B chooses a K value of 1. Assuming no other nodes are active, can the retransmissions from A and B collide? Justify your answer by showing all the intermediate steps of your calculations.arrow_forwardGiven a M/M/1 queue, which has packets arriving at a rate 2 packets/sec, an output link rate R bps, and an average packet size of 1500 bytes, write down: the expression for T, the average delay for a packet (i.e., from arrival till completing transmission at the output). b. the expression for the output utilization c. the expression for average number of packets in the queue d. the expression for average number of packets in the output NICarrow_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