EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 1, Problem P33P
Explanation of Solution
Given,
Number of bits present in the file is F
Number of segments present in the file is S
Therefore, the length of the packets is S + 80 bits
The transmission rate of each link is R bps
Number of packets present in the packet can be calculated by using the following formula is given below:
Therefore, the number of packets present in the file is
The time required to receive the last packet at first router is
At
The last packet will be transmitted by first and second routers with
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Consider 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?
Consider sending a large file of F bits from Host A to Host B. There are three links (and two
switches) between A and B, and the links are uncongested (that is, no queuing delays). Host A
segments the file into segments of S bits each and adds 80 bits of header to each segment,
forming packets of L=80+ S bits. Each link has a transmission rate of R bps. Find the value of S
that minimizes the delay of moving the file from Host A to Host B. Disregard propagation delay.
Consider 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.
c. Suppose the network is a packet-switched virtual circuit network. Denote the VC set-up time
by ts = 250
milliseconds. How long does it take to send the file from source to destination?
Chapter 1 Solutions
EBK COMPUTER NETWORKING
Ch. 1 - What is the difference between a host and an end...Ch. 1 - The word protocol is often used to describe...Ch. 1 - Why are standards important for protocols?Ch. 1 - Prob. R4RQCh. 1 - Prob. R5RQCh. 1 - Prob. R6RQCh. 1 - Prob. R7RQCh. 1 - Prob. R8RQCh. 1 - Prob. R9RQCh. 1 - Prob. R10RQ
Ch. 1 - Prob. R11RQCh. 1 - What advantage does a circuit-switched network...Ch. 1 - Prob. R13RQCh. 1 - Prob. R14RQCh. 1 - Prob. R15RQCh. 1 - Prob. R16RQCh. 1 - Prob. R17RQCh. 1 - Prob. R18RQCh. 1 - Suppose Host A wants to send a large file to Host...Ch. 1 - Prob. R20RQCh. 1 - Prob. R21RQCh. 1 - Prob. R22RQCh. 1 - What are the five layers in the Internet protocol...Ch. 1 - Prob. R24RQCh. 1 - Prob. R25RQCh. 1 - Prob. R26RQCh. 1 - Prob. R27RQCh. 1 - Prob. R28RQCh. 1 - Equation 1.1 gives a formula for the end-to-end...Ch. 1 - Prob. P3PCh. 1 - Prob. P4PCh. 1 - Prob. P5PCh. 1 - This elementary problem begins to explore...Ch. 1 - Prob. P7PCh. 1 - Suppose users share a 3 Mbps link. Also suppose...Ch. 1 - Prob. P9PCh. 1 - Prob. P10PCh. 1 - In the above problem, suppose R1 = R2 = R3 = R and...Ch. 1 - Prob. P13PCh. 1 - Consider the queuing delay in a router buffer. Let...Ch. 1 - Prob. P15PCh. 1 - Prob. P16PCh. 1 - Prob. P17PCh. 1 - Prob. P20PCh. 1 - Prob. P21PCh. 1 - Prob. P22PCh. 1 - Prob. P23PCh. 1 - Prob. P24PCh. 1 - Prob. P25PCh. 1 - Prob. P26PCh. 1 - Prob. P27PCh. 1 - Prob. P28PCh. 1 - Prob. P29PCh. 1 - Prob. P30PCh. 1 - Prob. P31PCh. 1 - Prob. P32PCh. 1 - Prob. P33PCh. 1 - Prob. P34P
Knowledge Booster
Similar questions
- Consider 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_forward2. 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_forwardIn 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_forward
- In this problem, we consider sending real-time voice from Host A to Host B over a packet switched network (VoIP). Host A converts analog voice to a digital 64 kbps bit stream on the fly. Host A then groups the bits into 56-byte packets. There is one link between Hosts A and B; its transmission rate is 2 Mbps and its propagation delay is 10 msec. As soon as Host A gathers a packet, it sends it to Host B. As soon as Host B receives an entire packet, it converts the packet's bits to an analog signal. How much time elapses from the time a bit is created (from the original analog signal at Host A) until the bit is decoded (as part of the analog signal at Host B)?arrow_forwardLet host A sends a file a size of 2200 byte to host B through routers R1, R2, R3, R4 and R5 respectively. Each packet contains 110 bytes of header information along with the user data. Assume that the bandwidth of each link is 106 B/s. File is split into 20 equal parts, and these packets are transmitted from A to B. Consider only transmission time and ignore processing, queuing and propagation delays also no error in transmission. What is the time taken by host A to send the complete file to host B?arrow_forwardConsider One file of K>>1 bits must be sent from A to C. The file is decomposed into packets of P bits each. Each packet contains 16 error-control bits, 32 bits of address and sequence number, in addition to the P data bits. 1- How many packets can be transmitted; if K=500Bytes and maximum packet size is 1000bits? Show each packet format. 2- If the hop time for each packet is 1sec, what is the total time required to send this file over a network of three nodes, from Source to Destination. Source Node A ---- Intermediate Node B ---Destination Carrow_forward
- 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…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_forwardConsider two hosts, A and B that are connected by a transmissions link of2.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 time? d. Now suppose that node C is connected to node B also by a 2 Mbps, 100 Km link. How long does it take from when the first bit is transmitted by A to when the last bit is received at C, assuming B operates in a store-and -forward manner?arrow_forward
- Consider sending a 3500-byte datagram that has arrived at a router R₁ that needs to be sent over a link that has an MTU size of 1000 bytes to R2. Then it has to traverse a link with an MTU of 600 bytes. Let the identification number of the original datagram be 465. How many fragments are delivered at the destination? Show the parameters associated with each of these fragments.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_forwardIn this problem, we consider sending real-time voice from Host A to Host B over a packet-switched network (VoIP). Host A converts analog voice to a digital 64 kbps bit stream on the fly. Host A then groups the bits into 56-byte packets and when a packet is formed, it is send to host B. There is one link between Hosts A and B; its transmission rate is 2 Mbps and its propagation delay is 10 msec. What's the elapsed time since when the first bit is formed (from the original analog signal at Host A) until the bit is received at host B?arrow_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