hw5-F23
.pdf
keyboard_arrow_up
School
North Carolina State University *
*We aren’t endorsed by this school
Course
570
Subject
Computer Science
Date
Dec 6, 2023
Type
Pages
3
Uploaded by CaptainTapir2529
ECE/CSC 570 – Sections 3 and 601, Computer Networks, Homework #5
Total 100 points, Due by 11:59PM on Dec. 1 (Friday), 2023
1.
(5 points)
State whether the following statements are true (T) or false (F).
(i) (2 points) Diff-serv scales better than RSVP to a large number of flows.
(ii) (3 points) For a TCP connection between A (sender) and B (receiver), A’s throughput does not
depend on B’s CPU speed.
Note: There will be some True/False questions in the final exam, just like the above.
2.
(10 points)
In TCP lecture note on Refinement (slide # 21), Suppose we use TCP-Reno and the
sender’s timer expires at transmission round 11. Assume the receiver window size is large enough, i.e.,
rwnd
=
∞
. What is the congestion window size (
cwnd
) of the sender at transmission round 15 then?
Explain your steps leading to your answer.
7UDQVPLVVLRQ#
URXQG#+577,
FZQG#+LQ#
066
,
3
8
9
:
43
;
49
48
4:
4;
83
88
89
<
43
=<
4<
83
8<
=3
93
7&>15HQR
8:
9<
+:/=8,
+4:/98,
+4?/84,
+88/8:,
+8=/4,
+8:/;,
Figure 1: TCP window size as a function of time, for Problem 3
3.
(30 points, 3 points each)
Consider Figure 1 that shows how the congestion window size changes un-
der TCP-Reno, with several key coordinates info. Assume
rwnd
=
∞
. Answer the following questions.
In all cases, you should provide a short discussion justifying your answer.
(a) Identify the intervals of time (e.g.,
[x,y]
in terms of transmission round) when TCP slow start
is operating.
(b) Identify the intervals of time when TCP congestion avoidance is operating.
(c) After the 16th transmission round, is segment loss detected by a triple duplicate ACK or by a
timeout?
(d) After the 22nd transmission round, is segment loss detected by a triple duplicate ACK or by a
timeout?
(e) What is the initial value of
ssthresh
at the first transmission round?
1
(f) What is the initial value of
ssthresh
at the 18th transmission round?
(g) What is the initial value of
ssthresh
at the 24th transmission round?
(h) During what transmission round is the 70th segment sent?
(i) Assuming a packet loss is detected after the 26th round by the receipt of a triple duplicate ACK,
what will be the value of the congestion window size (
cwnd
) and of
ssthresh
?
(j) Suppose TCP Tahoe is used (instead of TCP Reno), and assume that triple duplicate ACKs are
received at the 16th round. What are the
ssthresh
and
cwnd
at the 19th round?
4.
(10 points)
Recall the idealized model for the steady-state dynamics of TCP. In the period of time
from when the connection’s window size varies from
W/
2 to
W
, only one packet is lost (at the very
end of the period). Show that the loss rate is equal to
L
= loss rate =
1
3
8
W
2
+
3
4
W
.
5.
(10 points)
In the lecture note on TCP future (TCP over “long, fat pipes”, slide #34), we noted
that, in order to achieve a throughput of 10Gbps, TCP could only tolerate a segment (packet) loss
probability of 2
×
10
−
10
(or equivalently, one loss event for every 5,000,000,000 packets).
Show the derivation for the values of 2
×
10
−
10
(1-out-of-5,000,000,000) when the RTT (round trip
time) is 100ms and MSS (packet or segment size) is 1500 bytes.
If TCP needed to support a 100 Gbps connection, what would be the tolerable loss rate?
6.
(20 points, 10 points each)
Consider TCP fairness scenario as shown in the lecture note, slide
#26 in Transport chapter, which illustrates the convergence of TCP’s AIMD algorithm.
There are
two connections through the same bottleneck link of capacity
R
to the same server, as depicted in the
figure in slide #25. Suppose that instead of a multiplicative decrease, TCP decreases the window size
by a constant amount as follows:
(a) Both connections decrease their window size by
−
1 instead of multiplicative decrease. Would the
resulting AIAD algorithm converge to an equal share?
What are the long-term throughput of
these two connections? Justify your answer by showing how the throughput of two connections
(users) evolve over time, assuming that they start from the point ‘A’ in Figure 2 with short
explanation on the plot you draw.
(b) Now, connection 1 decreases its window size by
−
3 while connection 2 decreases only by
−
1. All
other parts remain the same as above. Would this version of AIAD algorithm (but two connections
behave differently) converge to an equal share? What are the long-term throughput of these two
connections?
Justify your answer by showing how the throughput of two connections (users)
evolve over time, assuming that they start from the point ‘A’ in Figure 2 with short explanation
on the plot you draw.
7.
(15 points; taken from the past exam)
Consider the same TCP fairness scenario as in the previous
problem.
There are two connections through the same bottleneck link of capacity
R
to the same
server, as depicted in the figure in slide #25. Connection 1 follows the original AIMD algorithm as
you learned in the class. Suppose that connection 2 (or user 2) is smart enough to modify his/her own
TCP congestion control algorithm and performs the following: upon ACK, the window size increases
by one as usual. Upon congestion, i.e., 3 duplicate acknowledgements, it maintains the same window
2
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
- Access to all documents
- Unlimited textbook solutions
- 24/7 expert homework help
Related Questions
d) State all the random access protocols and controlled access protocols. Explain
why collision is an issue in random access protocols but not in controlled
access protocols.
arrow_forward
Computer Science
1.a)
In a TCP communication, the receiver set the window size, rwnd=850. On the sender side, Sf=1077 and Sn=1115. The receiver sent an acknowledgement packet with ackNo=1097 and rwnd=830. What is the sliding window size on the sender’s end? Did the window open or close on the sender’s end and from which direction/s (e.g left and/or right direction/s)?
b)For the above scenario, the sender now sends 50 bytes and awaits an acknowledgment. What is the Sf and Sn now?
arrow_forward
(ESP) Consider that we protect a TCP SYN packet using the ESP in the transport mode. A TCP SYN packet just comprises a TCP header which is 20 bytes (i.e., without TCP option). The IP packet header is also 20 bytes long (i.e., without IP option). Moreover, the block size for encryption is 256 bits (e.g., using AES-256), and the hash output’s size for message authentication is 512 bits (e.g., using SHA-1). What is the minimum amount of padding required?
arrow_forward
#2.Answer T & F.
arrow_forward
36. Figure below shows TCP communication between Alice and Bob.
Alice
Bob
Seq = 1022, 28-bytes data
A
Seq =
250 bytes data
C
1-byte data
В
Ack=
Seq
E
Ack=
1000-bytes data
Seq=
Seq= F
Ack=3001, 200 bytes data
What is the sequence number (box F) of the third segment that Alice sends to Bob?
a. 1049
b. 2001
c. 1300
d. 1299
е.
1050
-Timeout-
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_forward
Can you name a few scenarios where SSH might be useful? Give a full list of and definitions for all SSH acronyms.
arrow_forward
Computer Science
arrow_forward
a) i) With respect to computer simulation, explain the terms: steady state, pseudo random
number generator, stopping criteria.
ii) A packet router receives packets at a rate of 1 million packets per second. The queue
formation in the router is modelled as an M/M/1 queue. If the mean packet length is
1000 bytes, what is the output bitrate (in bps) needed (at the router) to ensure that the
Pr(queue > 100 packets) ≤ 0.00001?
iii) A Call Centre has no call waiting facility, and so loses blocked calls. What formula is
used to evaluate call blocking probability? Use this formula, or a more convenient
approximation, to find the call blocking probability if the applied traffic is 50 Erlangs and
the number of servers is 50.
arrow_forward
Electrical Engineering
In the network given below, delays between the routers are given in milliseconds.
a) Apply Bellman-Ford algorithm for the Router 1. In applying the algorithm, establish a table in which
the maximum number of hops is started from zero and incremented by one for each iteration (h=0, 1,
2, 3, ...). In the table you will establish, include the label values consisting of minimum delay and path
definition from Router 1 to other routers for each value of h.
b) Briefly explain how the iteration ends.
c) Indicate which labels will be stored in the routing table of Router I at the end of the algorithm.
2
arrow_forward
2 This question is about Networks
The following diagram shows a set of interconnected networks. The four networks
(networks 1-4) are shown as labelled ellipses and the machines (A-K) con-
nected to the networks represented as letters. Some machines (such às c, ánd E)
are connected to multiple networks and are set to forward packets between the
two networks.
For the purposes of this guestions, machines will be addressed using the format
1.A where the number refers to the network the machine is connected and the let-
ter identifies the machine. Machines connected to multiple networks can be ad-
dressed usiņng multiple addresses - for example, machine c can be referred to as
1.cor 2.c depending on which network it is talking to.
G
Network 3
Network 1
-C
Network 2
-F
B
D
E
Network 4
-K
The network is configured to use next-hop routing. In the following questions, you
are required to give the address of the next-hop where a machine should send a
packet, if it is not on the same (local)…
arrow_forward
32. We have not given all the rules about the transition diagram and TCP states. To be complete, we should show the next state for any state with the arrival of any type of segment. TCP should know what action to take if any of the segment types arrive when it is in any of the states. What are some of these rules?
arrow_forward
In Book computer networking a top-down approach sixth edition
4.4 (Network Address Translation (NAT))
I need to find ( NAT translation table) but for 6 address not for one
this is the Question:
[ Consider the home network setup in Figure 3. Suppose each host of the3 hosts has two ongoing TCP connections, all to port 80 at host 118.1.40.86. Provide the sixcorresponding entries in the NAT translation table]
arrow_forward
For NAT Network Address Translation Scenario: Jenny Bello is a small business owner selling and making customized computer peripherals. She has been finding it difficult to track her sales and inventories, however recently after an expert's advice, she adopted a Point of Sale (PoS) server. So, she can now track her sales and inventories at the store. However, she ran into another issue, the server can only be accessed within the store, because it has been assigned a private IPv4 address, it is not publicly accessible via the Internet.
a) Why is not having the PoS server accessible over the Internet a problem for the business?
b) What caused this problem?
c) Propose a solution for the problem and explain how the solution works.
arrow_forward
Consider that a 100 kbps data stream is to be transmitted on a telephone channel of BW=3.4 kHz and SNR=10 dB. Is the transmission free from ISI problem or not? Prove that. If it is not free, suggest and calculate the proper system modifications.
arrow_forward
Do not give me incorrect solution. I will report .
arrow_forward
Problem 5: Draw a Mealy FSM to model a LAN adapter. Serial
data packets entering the FSM are analyzed. The start of a
packet is indicated by the arrival of two consecutive 0's on
the input line . The next three bits are the machine address.
The targeted addresses are 100 or 110 where an output = 1 is
generated. Any other addresses produce a zero at the output. A
separate reset mechanism will put the machine in the initial
state (i.e, you should never return to the initial state in
your design).
arrow_forward
SInternet Check sum
Consider the figure below (simplex communication scenario). The TCP sender
sends an initial window of 4 segments. Suppose the initial value of the sender
ན༽)།
sequence number, SEQ1, is 100 and the first 4 segments each contain 400 bytes
of payload. As you can see ACK 3 is lost.
What is the SEQ number (SEQ2, SEQ3, SEQ4, SEQ5) from the Sender and ACK Number
(ACK1, ACK2, ACK3, ACK4, ACK5) from the receiver for each segment?
Sender
Seq1
Seq2
Seq3
Seg4
ACK1
ACK2
ACK3
ACK4
Seq5
ACK5
Receiver
arrow_forward
Please solve it correctly and please provide explanation of your answers.
Please answer parts g, h and i.
A PC and a Web Server are communicating over a TCP connection. The PC had started the three way handshake with the initial sequence number of 3069 . The Web Server's initial sequence number is 4830 . The window size of the PC is 815 bytes and the window size of the Web Server is 463 bytes. Using the third TCP handshake ack segment the PC sends the http request of the size 396 bytes to the Web Server. Then the Web Server answers with 3 segments containing the requested data. The first segment size is 42 bytes and the second segment size is 276 bytes and the third segment size is 146 bytes respectively. The PC receives all three segments within the timer. But unfortunately the second segment was corrupted. So the PC immediately sends an acknowledgement segment. Assume that the PC uses Selective Repeat/Reject ARQ.
g) The second segment from webserver was corrupted. So the PC…
arrow_forward
19. ARP is used for:
O packet path determination
O finding of a mapping IPV6 → MAC address
O finding of a mapping IPV4 → MAC address
O finding of a mapping IPV4 → TCP address
arrow_forward
Find the odd man out.
JNS, JL, JAL, BL
a) JNS
b) BL
c) JAL
d) JL
arrow_forward
(a) If the second segment arrives before the first segment, in the ACK of the first arriving segment, what is the ACK number?
(b) Draw and explain the 3-Way Handshake in TCP protocol.
arrow_forward
81.
A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token bucket is initially filled with 16 megabits. The maximum duration taken by X to transmit at full rate of 10 Mbps is ............ secs.
a.
1
b.
2
c.
3
d.
4
arrow_forward
Is that so, or not? Consider a TCP connection where the most recent SampleRTT was 1 second. It is recommended that the TimeoutInterval be set to more than one second.
arrow_forward
SEE MORE QUESTIONS
Recommended textbooks for you
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
Related Questions
- d) State all the random access protocols and controlled access protocols. Explain why collision is an issue in random access protocols but not in controlled access protocols.arrow_forwardComputer Science 1.a) In a TCP communication, the receiver set the window size, rwnd=850. On the sender side, Sf=1077 and Sn=1115. The receiver sent an acknowledgement packet with ackNo=1097 and rwnd=830. What is the sliding window size on the sender’s end? Did the window open or close on the sender’s end and from which direction/s (e.g left and/or right direction/s)? b)For the above scenario, the sender now sends 50 bytes and awaits an acknowledgment. What is the Sf and Sn now?arrow_forward(ESP) Consider that we protect a TCP SYN packet using the ESP in the transport mode. A TCP SYN packet just comprises a TCP header which is 20 bytes (i.e., without TCP option). The IP packet header is also 20 bytes long (i.e., without IP option). Moreover, the block size for encryption is 256 bits (e.g., using AES-256), and the hash output’s size for message authentication is 512 bits (e.g., using SHA-1). What is the minimum amount of padding required?arrow_forward
- #2.Answer T & F.arrow_forward36. Figure below shows TCP communication between Alice and Bob. Alice Bob Seq = 1022, 28-bytes data A Seq = 250 bytes data C 1-byte data В Ack= Seq E Ack= 1000-bytes data Seq= Seq= F Ack=3001, 200 bytes data What is the sequence number (box F) of the third segment that Alice sends to Bob? a. 1049 b. 2001 c. 1300 d. 1299 е. 1050 -Timeout-arrow_forwardA 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_forward
- Can you name a few scenarios where SSH might be useful? Give a full list of and definitions for all SSH acronyms.arrow_forwardComputer Sciencearrow_forwarda) i) With respect to computer simulation, explain the terms: steady state, pseudo random number generator, stopping criteria. ii) A packet router receives packets at a rate of 1 million packets per second. The queue formation in the router is modelled as an M/M/1 queue. If the mean packet length is 1000 bytes, what is the output bitrate (in bps) needed (at the router) to ensure that the Pr(queue > 100 packets) ≤ 0.00001? iii) A Call Centre has no call waiting facility, and so loses blocked calls. What formula is used to evaluate call blocking probability? Use this formula, or a more convenient approximation, to find the call blocking probability if the applied traffic is 50 Erlangs and the number of servers is 50.arrow_forward
- Electrical Engineering In the network given below, delays between the routers are given in milliseconds. a) Apply Bellman-Ford algorithm for the Router 1. In applying the algorithm, establish a table in which the maximum number of hops is started from zero and incremented by one for each iteration (h=0, 1, 2, 3, ...). In the table you will establish, include the label values consisting of minimum delay and path definition from Router 1 to other routers for each value of h. b) Briefly explain how the iteration ends. c) Indicate which labels will be stored in the routing table of Router I at the end of the algorithm. 2arrow_forward2 This question is about Networks The following diagram shows a set of interconnected networks. The four networks (networks 1-4) are shown as labelled ellipses and the machines (A-K) con- nected to the networks represented as letters. Some machines (such às c, ánd E) are connected to multiple networks and are set to forward packets between the two networks. For the purposes of this guestions, machines will be addressed using the format 1.A where the number refers to the network the machine is connected and the let- ter identifies the machine. Machines connected to multiple networks can be ad- dressed usiņng multiple addresses - for example, machine c can be referred to as 1.cor 2.c depending on which network it is talking to. G Network 3 Network 1 -C Network 2 -F B D E Network 4 -K The network is configured to use next-hop routing. In the following questions, you are required to give the address of the next-hop where a machine should send a packet, if it is not on the same (local)…arrow_forward32. We have not given all the rules about the transition diagram and TCP states. To be complete, we should show the next state for any state with the arrival of any type of segment. TCP should know what action to take if any of the segment types arrive when it is in any of the states. What are some of these rules?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
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