8. Consider the effect of using slow start on a line with a 10-msec round-trip time and no congestion. The receive window is 24 KB and the maximum segment size is 2 KB. How long does it take before the first full window can be sent? What is the final result? Provide proof: Solution|

8. Consider the effect of using slow start on a line with a 10-msec round-trip time and no congestion. The receive window is 24 KB and the maximum segment size is 2 KB. How long does it take before the first full window can be sent? What is the final result? Provide proof: Solution|

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter9: Computer Networks

Section: Chapter Questions

Problem 15VE

See similar textbooks

Related questions

Q: Given the maximal number of the binary sequence MAX SEQ (e.g., MAX SEQ=7 for three bits), what are…

A: Solution:- Go-Back-N is a specific instance of the automatic repeat request protocol, in which the…

Q: (a) Why is a datagram buffer needed on the output port of a router?

A: Note: only one question can be answered at a time in the BNED Guidance. If you want a reply to…

Q: Is it conceivable for an UDP-running programme to acquire a dependable data transmission at the same…

A: Introduction: UDP, or User Datagram Technology, is a time-critical Internet communication protocol…

Q: (a) if there is a single bit transmission error in block C3 of the ciphertext, which plaintext…

A: A single bit error in a ciphertext block affects the decryption of all subsequent blocks.…

Q: Propose a lookup algorithm for an IP forwarding table containing prefixes of varying lengths that…

A: IP forwarding tables are used to lookup the address of the next hop and to identify the ports for…

Q: A to C. The file is decomposed into packets of P bits each. Each packet contains 16 error-control…

A: Dear Student, No of packets transmitted = Size of file/ packet size = 500x8bits/1000bits = 4packets.…

Q: Suppose 4 packets are received in a burst at a token bucket shaper, which has 1 token in the bucket…

A: I Have answered this question in step 2.

Q: The network of Fig. 5-37 uses RSVP with multicast trees for hosts 1 and 2 as shown. Suppose that…

Q: b) Consider a scenario where fragmentation may take place in packet transfer. Discuss how such…

A: Example where fragmentation takes place ,how much fragmentation reassemble at destination and what…

Q: After a timeout occurrence, we debated increasing the timeout interval. This is a kind of congestion…

A: TCP has a congestion management method based on windows If TCP were a stop and wait system, the…

Q: (a) A wants to send a 500 byte packet to D through C. B is supposed to follow the store-and forward…

A: Answer (a): 1 + 10 + 0.4 + 3 = 14.4ms

Q: what are the expression (in term of max seq) of the maximal sizes of sending window for go-back-n…

A: Go-Back-N is a specific instance of the automatic repeat request protocol, in which the sending…

Q: (a) In a generic router architecture, what major components are there?

A: Disclaimer: "Since you have asked multiple questions, we will solve the first question for you. If…

Q: Most IP datagram reassembly algorithms have a timer to avoid having a lost fragment tie up…

A: please check the solution below

Q: Two CSMA/CD stations are each trying to transmit long (multiframe) files. After each frame is sent,…

Q: Let's imagine, for the sake of illustration, that a packet is now being sent from one site to…

A: Inspection: Processing delay and Network delay are the two components that contribute to the…

Q: Sender A sends the word A+ to Receiver B. By using Cyclic Redundancy Check (CRC), with divisor 1010,…

A: CRC cyclic redundancy check is performed in the data link layer for detecting damaged frames which…

Q: Q6.3 SR no loss Consider that Selective Repeat is used; and that no packets or ACKS are lost.…

A: please check the solution below

Q: Material must be played out in a specific time intervals in order to be correctly interpreted by the…

A: Obstacles include:

Q: Assume a router using RIP has 12 entries in its forwarding table at time t1. The 12 entries received…

Q: Suppose the R-B link in the previous exercise changes from a bandwidth delay to a propagation delay,…

Q: Suppose that a SW ARQ system with 1-bit sequence numbering has a time-out value that is less than…

A: The Answer is in step-2.

Q: Give some details of how you might augment the sliding window protocol with flow control by having…

Q: we consider some of the pros and cons of virtual-circuit and datagram networks. a. Suppose that…

A: Assume that routers were subjected to conditions that might cause them to fail fairly often. I…

Q: Consider a full-duplex 256 Kbps satellite link with a 240 millisecond end-to-end delay. The data…

A: Given: Goal: We have to find the effective throughput using stop and wait protocol and using…

Q: Consider a data link layer using flag bytes and byte stuffing. We send 256 bytes of user data in…

A: Below is the answer with detailed explanation:

Q: In Selective repeat dilemma, some old packets are considered new packets, what is the relationship…

A: To avoid the package being recognized indirectly it is done. In a selective repeat dilemma, some old…

Q: Consider the following page address stream: 2 1 4 3 5 3 2 4 5 2 1 2 4 3 1 Which of the following…

A: 2 1 4 3 5 3 2 4 5 2 1 2 4 3 1 a) First in First out b) LRU and FIFO are the same number of faults…

Q: 3. (a) Write four functions of the data link layer. What is the importance of calculating minimum…

A: 3(a) Write four functions of the data link layer.What is the importance of calculating minimum…

Q: The text states that additive increase is a necessary condition for a congestion-control mechanism…

A: An instability might arise if all increases were exponential; that is, if TCP continued to use slow…

Q: 3. Consider the following forwarding table (that uses longest prefix matching). Rewrite this…

A: the forwarding table using the a.b.c.d/x notation is given below

Q: Explain the impact on the delay and loss performance of the low-priority traffic under the following…

A: The presence of high-priority packets deprives low-priority packets from accessing the transmission…

Q: departing packet numbers (at t = 1, 2, 3, 4, 5, 6, 7) under r nd-robin scheduling cycle beings with…

A: Given as,

Q: Consider a simple congestion-control algorithm that uses linear increase and multiplicative decrease…

Q: A file of size 20 KiloBytes is transmitted to a destination over a 10 Megabit/s network link (1 Mega…

A: File size, L = 20Kb = 20 * 103 bytes = 20 * 103 * 8 bits = 1.6 * 105 bits Bandwidth B = 10Mbits/s =…

Q: A 3400-byte datagram needs to cross a network with an MTU of 800 bytes. i. How many fragments are…

A: Given: 3400-byte datagram needs to cross a network with an MTU of 800 bytes. So, how many…

Q: Assume that a SONET receiver resynchronizes its clock whenever a 1 bit appears; otherwise, the…

Q: To achieve totally-ordered multicasting with Lamport timestamps, is it strictly necessary that each…

Q: Suppose a routing algorithm identifies paths that are “best” in the sense that: (1) minimum number…

A: The first criterion ignores the state of each link, but works well in situations were all links are…

Q: We discussed increasing the timeout interval once a timeout occurred. This strategy is used to…

A: Intro TCP: The TCP profile's Idle Timeout option determines how long a connection may be idle before…

Q: Write down a relationship that represents the effective end-to-end throughput that can be achieved…

A: throughput: it is the amount of data moved successfully from one place to another in a given time…

Q: We observed that (n-1)D is the maximal delay in queuing if the fabric of switching is n times faster…

A: The answer is given below.

Q: the following parameters for Selective Repeat (SR): a) N = 4 b) Round Trip Time (RTT) = 10 ms c)…

A: It is defined as the protocol(SRP) that is mostly identical to GBN protocol, so except that…

Q: Write a program to simulate the behaviour of the CSMA/CD protocol over Ethernet when there are N…

A: Actually, CSMA/CD is Carrier Sense Multiple Access with Collision Detection , Which carries…

Q: Give some details of how you might augment the sliding window protocol with flow control by having…

A: The question has been answered in step2

Q: Sixteen stations, numbered 0 through 15, are contending for the use of a shared channel by using the…

A: The Answer is in Below Steps

Concept explainers

Types Of Protocols

A network protocol is a collection of rules that governs the exchange of data between devices connected to the same network. In other words, network protocols are rules that specify how devices communicate or transfer data over a network. The sender and receiver systems must obey the standards to facilitate communication between them.

Question

8. Consider the effect of using slow start on a line with a 10-msec round-trip time and
no congestion. The receive window is 24 KB and the maximum segment size is 2 KB.
How long does it take before the first full window can be sent?
What is the final result?
Provide proof:
Solution:|

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Consider the following network with given line speeds and lengths: Assume the speed of light is 2×10^8 m/s, and that the processing and queuing delays are negligible. Node A sends a 1400-byte frame to node C through node B. Suppose Node A starts sending the first bit of the frame at t=0. Answer the following questions: a. At what time (t=?) node B receives the frame in full (i.e. the last bit)? b. After node B receives the frame in full, then it will start sending the frame to node C. Determine the time (t=?) when node C receives the frame in full. c. Suppose at this time node C sends a small acknowledgment back to node A. The transmission time for the acknowledgment is negligible. Calculate at what times (t=?) the acknowledgment arrives at nodes B and A. d. Assume after sending its frame, node A wait for the acknowledgment back from node C before sending the next frame. What is the average throughput (number of transmitted bits per second) of the data flow from node A to…
given the maximal number of the binary sequence max seq (e.g., max seq=7 for three bits), what are the expression (in term of max seq) of the maximal sizes of sending window for go-back-n and selected-repeat protocols? you need to demonstrate the counter-examples on why window sizes larger than the maximum can fail. repeat the same question for the receiving window sizes
Suppose a new CSMA/CD protocol is designed for a 100 Mbps bus network with topology similar to 10Base2. The minimum frame length is 40 bytes. What is the maximum length of the longest cable connecting two nodes so that the collision detection mechanism still works? Write symbolic equations (e.g. using d=distance, R=data rate, etc.) and derive the solution. Explain with words what is going on.
4.) Suppose that a sender and a receiver are using ARQ to perform reliable data delivery. If we have to send 12 packet and window size of 4 , if every 5 th packet is being transmitted is lost, then how many retransmissions and total number of transmissions are required? (7) a. GoBack-N b. Selective Repeat
Computer Science Assume the length of each message is L=5, the access link has a speed of X=180 Mbps, and there are B=6 messages per second on average. What is the total average delay for receiving a message when no cache is used, i.e., the sum of LAN delay, access delay, and internet delay? Give your answer in milliseconds.
Consider a full-duplex 256 Kbps satellite link with a 240 millisecond end-to-end delay. The data frames carry a useful payload of size 12,000 bits. Assume that both ACK and data frames have 320 bits of header information, and that ACK frames carry no data. What is the effective data throughput When using sliding windows with a sender window size of W = 5 data frames?
Given the maximal number of the binary sequence MAX SEQ (e.g., MAX SEQ=7 for three bits), what are the expression (in term of MAX SEQ ONLY) of the maximal sizes of sending window for Go-back-N and Selected-Repeat Protocols? You need to demonstrate the counter-examples on why window sizes larger than the maximum can fail.
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.
One of the problems with timeout-triggered retransmissions is that the timeout period can be relative long. When a segment is lost, this long timeout period forces the sender to delay resending the lost packet, thereby increasing the end-to-end delay. Is there any remedy for this?
Assume that a client can use UDP to obtain a file from a distant server at a known address. The client initiates the request for a file name, and the server responds with a sequence of data packets containing various file components. To ensure delivery reliability, the client and server use a stop-and-wait protocol. Is there anything else wrong with this protocol aside apparent performance issues? Consider the possibility of process failure.
Computer Science With the CBC/OFB/CFB/CTR mode: (a) if there is a single bit transmission error in block C3 of the ciphertext, which plaintext blocks are affected? CBC and CTR (b) Suppose that there is a bit error in the source version of P1. Through how many ciphertext blocks is this error propagated? What is the effect at the receiver?
One of the problems with timeout-triggered retransmissions is that the time-out period can be relatively long. When a segment is lost, this long timeout period forces the sender to delay resending the lost packet, thereby increasing the end-to-end delay. Is there any remedy for this?