![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 4, Problem P19P
Program Plan Intro
Internet Protocol (IP):
Internet protocol is a process or protocol in which data is transferred between the computer systems through internet. Each computer system has its own IP address to send or receive the required data.
Datagram:
- In networking, a datagram is a transferring unit which is used to transfer the data from a source to the destination and it doesn’t provide guaranteed service.
- It includes fragmentation process which is defined as the division of the data packet into small one when the data packets are larger than the maximum length of a particular system.
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
2.
The network of Fig. 5-37 uses RSVP with multicast trees for hosts 1 and 2 as shown.
Suppose that host 3 requests a channel of bandwidth 2 MB/sec for a flow from host 1
and another channel of bandwidth 1 MB/sec for a flow from host 2. At the same time,
host 4 requests a channel of bandwidth 2 MB/sec for a flow from host 1 and host 5
requests a channel of bandwidth 1 MB/sec for a flow from host 2. How much total
bandwidth will be reserved for these requests at routers A, B, C, E, H, J, K, and L?
Senders
2
2
B.
A
A
A
D
D.
•F
D
•F
Fig. 5-37
H.
K
3
3
4
5
3
5
Receivers
(a)
(b)
(c)
Problem 3
Consider the problem of deciding whether to implement a virtual-
circuit or a datagram network. Assume a network protocol that allows
the system to operate as either a virtual circuit network or a datagram
network. That is, its packet header format is specified such that it
incorporates both a VCI (Virtual Circuit Identifier) and an arbitrary
source/destination addresses.
When operating as a virtual circuit, it requires a 4-byte header. When
operating as a datagram network, it requires a 40-byte header.
Assume that there are 4 hops from source to destination, and that a
set up or tear down request packet is 80 bytes (including the header).
The total message length is 4096 bytes, the data rate is 9600 bps on
all links and the packet size is 256 bytes (including the header).
i)
If we operate in the datagram mode, how long does it take
for the first packet to reach the destination?
If we operate in virtual-circuit mode, how long does it take
for the first packet to reach the…
4) Host A and B are communicating over a TCP connection, and Host B has already
received from A all bytes up through byte 130. Suppose Host A then sends two segments
to Host B back-to-back. The first and second segments contain 80 and 40 bytes of data,
respectively. In the first segment, the sequence number is 131, the source port number is
301, and the destination port number is 80. Host B sends an acknowledgment whenever it
receives a segment from Host A.
a. In the second segment sent from Host A to B, what are the sequence number, source
port number, and destination port number?
b. If the first segment arrives before the second segment, in the acknowledgment of the
first arriving segment, what is the acknowledgment number, the source port number, and
the destination port number?
c. If the second segment arrives before the first segment, in the acknowledgment of the
first arriving segment, what is the acknowledgment number?
Chapter 4 Solutions
EBK COMPUTER NETWORKING
Ch. 4 - Lets review some of the terminology used in this...Ch. 4 - Prob. R2RQCh. 4 - Prob. R3RQCh. 4 - Prob. R4RQCh. 4 - Prob. R5RQCh. 4 - Prob. R6RQCh. 4 - Prob. R7RQCh. 4 - Prob. R8RQCh. 4 - Prob. R9RQCh. 4 - Prob. R10RQ
Ch. 4 - Prob. R11RQCh. 4 - Prob. R12RQCh. 4 - Prob. R13RQCh. 4 - Prob. R14RQCh. 4 - Prob. R15RQCh. 4 - Prob. R16RQCh. 4 - Prob. R17RQCh. 4 - Prob. R18RQCh. 4 - Prob. R19RQCh. 4 - Prob. R20RQCh. 4 - Prob. R21RQCh. 4 - Prob. R22RQCh. 4 - Prob. R23RQCh. 4 - Prob. R24RQCh. 4 - Prob. R25RQCh. 4 - Prob. R26RQCh. 4 - Prob. R27RQCh. 4 - Prob. R28RQCh. 4 - Prob. R29RQCh. 4 - Prob. R30RQCh. 4 - Prob. R31RQCh. 4 - Prob. R32RQCh. 4 - Prob. R33RQCh. 4 - Prob. R34RQCh. 4 - Prob. R35RQCh. 4 - Prob. P1PCh. 4 - Prob. P2PCh. 4 - Prob. P3PCh. 4 - Consider a datagram network using 32-bit host...Ch. 4 - Consider a datagram network using 8-bit host...Ch. 4 - Consider a datagram network using 8-bit host...Ch. 4 - Prob. P8PCh. 4 - Prob. P9PCh. 4 - Prob. P10PCh. 4 - Prob. P11PCh. 4 - Prob. P12PCh. 4 - Consider sending a 2400-byte datagram into a link...Ch. 4 - Prob. P15PCh. 4 - Prob. P16PCh. 4 - Prob. P17PCh. 4 - Prob. P18PCh. 4 - Prob. P19PCh. 4 - Prob. P20PCh. 4 - Prob. P21PCh. 4 - Prob. P22P
Knowledge Booster
Similar questions
- 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_forwardThe network of Fig. 5-37 uses RSVP with multicast trees for hosts 1 and 2 as shown. Suppose that host 3 requests a channel of bandwidth 2 MB/sec for a flow from host 1 and another channel of bandwidth 1 MB/sec for a flow from host 2. At the same time, host 4 requests a channel of bandwidth 2 MB/sec for a flow from host 1 and host 5 requests a channel of bandwidth 1 MB/sec for a flow from host 2. How much total bandwidth will be reserved for these requests at routers A, B, C, E, H, J, K, and L? 1 2 B C A C F ●F D E 8XX H K L J L J 3 4 5 A D G 1 Senders 3 B 4 E H K Receivers 2 5 (b) A 1 3 B 4 E H K (c) 2 C ●F 5 L Fig. 5-37arrow_forwardHost A and B are communicating over a TCP connection. Host B has already received from Host A all bytes up through byte 23. Suppose Host A then sends two segments to Host B back-to-back. The first and the second segments contain 30 and 50 bytes of data, respectively. In the first segment, the sequence number is 24, the source port number is 3000, and the destination port number is 80. Host B sends an acknowledgment whenever it receives a segment from Host A. A. In the second segment sent from Host A to B, what arethe sequence number_________,source port number __________,and destination port number__________?B. If the second segment arrives after the first segment, in the acknowledgment of the second segment, what arethe acknowledgment number___________,the source port number__________,and the destination port number __________?C. If the second segment arrives before the first segment, in the acknowledgment of the first arriving segment,what is the acknowledgment number ___________?D.…arrow_forward
- Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes up through byte 126. Suppose Host A then sends two segments to Host B backto-back. The first and second segments contain 80 and 40 bytes of data, respectively. In the first segment, the sequence number is 127, the source port number is 302, and the destination port number is 80. Host B sends an acknowledgment whenever it receives a segment from Host A. d. Suppose the two segments sent by A arrive in order at B. The first acknowledgment is lost and the second acknowledgment arrives after the first timeout interval. Draw a timing diagram, showing these segments and all other segments and acknowledgments sent. (Assume there is no additional packet loss.) For each segment in your figure, provide the sequence number and the number of bytes of data; for each acknowledgment that you add, provide the acknowledgment number.arrow_forwardHost A and B are communicating over a TCP connection, and Host B has already received from A all bytes up through byte 126. Suppose Host A then sends two segments to Host B backto-back. The first and second segments contain 80 and 40 bytes of data, respectively. In the first segment, the sequence number is 127, the source port number is 302, and the destination port number is 80. Host B sends an acknowledgment whenever it receives a segment from Host A.a. In the second segment sent from Host A to B, what are the sequence number, source port number, and destination port number?b. If the first segment arrives before the second segment, in the acknowledgment of the first arriving segment, what is the acknowledgment number, the source port number, and the destination port number?c. If the second segment arrives before the first segment, in the acknowledgment of the first arriving segment, what is the acknowledgment number?d. Suppose the two segments sent by A arrive in order at B. The…arrow_forwardHost A and B are communicating over a TCP connection, and Host B has already received from A all bytes up through byte 126. Suppose Host A then sends two segments to Host B back-to-back. The first and second segments contain 80 and 40 bytes of data, respectively. In the first segment, the sequence number is 127, the source port number is 302, and the destination port number is 80. Host B sends an acknowledgment whenever it receives a segment from Host A. a. In the second segment sent from Host A to B, what are the sequence number, source port number, and destination port number? b. If the first segment arrives before the second segment, in the acknowledgment of the first arriving segment, what is the acknowledgment number, the source port number, and the destination port number? c. If the second segment arrives before the first segment, in the acknowledgment of the first arriving segment, what is the acknowledgment number? d. Suppose the two segments sent by A arrive in order at B. The…arrow_forward
- Consider 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 a client connecting to a web server via a router as shown in Fig.Q2. Client A sends a request to the server to retrieve a 7.5 Mbytes file. Given that the segment size is 50 Kbytes, the round trip time (RTT) between the server and client is 10 ms, the initial slow-start threshold is 16 and the client's buffer always has a storage space of 1 Mbytes. Assume that TCP Reno is used, there is no loss during transmission and the headers of protocols are ignored. 400 Mbps 200 Mbps 400 Mbps Link a Link b Link c Client Web Server Fig.Q2 (a) Describe how the value of sending window changes as a function of time (in units of RTT) during the whole connection time. 2.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
- Consider a client has established TCP connection with a server and sending data. The propagation delay is 5 ms and there are no timeouts and errors during transmission. The size of the receiver advertised window is 128 KB, the slow-start threshold at the client is 64 KB, and the maximum segment size is 4 KB. The connection is established at time T = 10 ms. What is the size of the congestion window (in KB) at time 90 ms after all acknowledgements are processed?arrow_forwardwe consider some of the pros and cons of virtual-circuit and datagram networks. a. Suppose that routers were subjected to conditions that might cause them to fail fairly often. Would this argue in favor of a VC or datagram architecture? Why? b. Suppose that a source node and a destination require that a fixed amount of capacity always be available at all routers on the path between the source and destination node, for the exclusive use of traffic flowing between this source and destination node. Would this argue in favor of a VC or datagram architecture? Why? c. Suppose that the links and routers in the network never fail and that rout- ing paths used between all source/destination pairs remains constant. In this scenario, does a VC or datagram architecture have more control traffic overhead? Why?arrow_forwardP19. Consider the SDN OpenFlow network shown in Figure 4.30 . Suppose that the desired forwarding behavior for datagrams arriving at s2 is as follows: •any datagrams arriving on input port 1 from hosts h5 or h6 that are destined to hosts h1 or h2 should be forwarded over output port 2; •any datagrams arriving on input port 2 from hosts h1 or h2 that are destined to hosts h5 or h6 should be forwarded over output port 1; •any arriving datagrams on input ports 1 or 2 and destined to hosts h3 or h4 should be delivered to the host specified; •hosts h3 and h4 should be able to send datagrams to each other. Specify the flow table entries in s2 that implement this forwarding behavior.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
![Text book image](https://www.bartleby.com/isbn_cover_images/9781305080195/9781305080195_smallCoverImage.gif)
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning