Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
ion 1a and 1b ple

ion 1a and 1b ple

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

Question 1a and 1b please

1. Consider the TCP basic congestion control algorithm employing slow start and congestion avoidance. Let the packet dropping probability p be constant and independent of the window size. a. Given that the window size when a packet drop takes place is W, find the mean time until another packet drop takes place. b. Given that the number of bytes per packet is B, find the mean number of bytes transmitted during the above interval. 2. In this problem, we would like to consider the effect of using different window reduction strategies, upon congestion detection, on the recovery from congestion. Using one TCP session, assume that a router becomes saturated, i.e., input rate = output rate, when the window size is W, and the round trip time is R. If the buffer capacity in the router is B, the buffer is empty when saturation occurs, and the TCP source is in the linear window increase phase, i.e., it is increased by one segment every one round trip time, answer the following: a. Find the number of round trip times that are required for a packet to be dropped in the router, and the TCP window size at that moment. b. Assuming that every time a window encounters a packet drop, the window size is reduced linearly, i.e., reduced by A packets, find the time until the router becomes unsaturated again, and the number of packets lost during that interval (assume that one or more packets being dropped from a window will result in just one reduction). c. Repeat the above part but using a geometric window reduction strategy, i.e., the window is reduced by B.W, where β is a constant, and W is the window size when a loss occurs. d. Based on the above, indicate which strategy should be used (you may use numerical examples to help you arrive at a conclusion). 3. Using a list, or a table, compare the SCTP and MPTCP protocols, explaining what each of the two protocols can implement, and whether the other protocol is able to implement or not. Then, draw a conclusion as to which of the two protocols is more superior. 4. Under IPv6, fragmentation is implemented in end nodes only, unlike IPv4 where fragmentation can be done inside the network. This reduces the amount of processing inside the network. However, it may increase the amount of bandwidth consumption. If the packet header is H, and a packet has to go over N networks, 1,
Transcribed Image Text:1. Consider the TCP basic congestion control algorithm employing slow start and congestion avoidance. Let the packet dropping probability p be constant and independent of the window size. a. Given that the window size when a packet drop takes place is W, find the mean time until another packet drop takes place. b. Given that the number of bytes per packet is B, find the mean number of bytes transmitted during the above interval. 2. In this problem, we would like to consider the effect of using different window reduction strategies, upon congestion detection, on the recovery from congestion. Using one TCP session, assume that a router becomes saturated, i.e., input rate = output rate, when the window size is W, and the round trip time is R. If the buffer capacity in the router is B, the buffer is empty when saturation occurs, and the TCP source is in the linear window increase phase, i.e., it is increased by one segment every one round trip time, answer the following: a. Find the number of round trip times that are required for a packet to be dropped in the router, and the TCP window size at that moment. b. Assuming that every time a window encounters a packet drop, the window size is reduced linearly, i.e., reduced by A packets, find the time until the router becomes unsaturated again, and the number of packets lost during that interval (assume that one or more packets being dropped from a window will result in just one reduction). c. Repeat the above part but using a geometric window reduction strategy, i.e., the window is reduced by B.W, where β is a constant, and W is the window size when a loss occurs. d. Based on the above, indicate which strategy should be used (you may use numerical examples to help you arrive at a conclusion). 3. Using a list, or a table, compare the SCTP and MPTCP protocols, explaining what each of the two protocols can implement, and whether the other protocol is able to implement or not. Then, draw a conclusion as to which of the two protocols is more superior. 4. Under IPv6, fragmentation is implemented in end nodes only, unlike IPv4 where fragmentation can be done inside the network. This reduces the amount of processing inside the network. However, it may increase the amount of bandwidth consumption. If the packet header is H, and a packet has to go over N networks, 1,
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS