ZuoTi.Pro
Question

Consider sending a large file of F bits from Host A to Host B. There are...

Consider sending a large file of F bits from Host A to Host B. There are m links (and m-1 switches) between A and B, and the links are uncongested (that is, no queueing delays). Host A segments the file into segments of S bits each and adds H bits of header to each segment, forming packets of L = H + 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.

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

Considering the above situation in which A & B are host between which transmission would take place, S is segmentaion of large file, total length of Packet is L = Header + Segment and R is transmission Rate then the formula for calculation

S = L/(m-1)

0 1
Add a comment
Know the answer?
Add Answer to:
Consider sending a large file of F bits from Host A to Host B. There are...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • 2. (10 pts.) Consider sending a large file of F bits from Host A to Host...

    2. (10 pts.) Consider sending a large file of F bits from Host A to Host B. There are six links (and five switches) between A and B, and the links are not congested (that is, no queueing delays). Host A segments the file into segments of S bits each and adds 30 bits of header to each segment, forming packets of L 30+S bits. Each link has a transmission rate of R bps. Find the value of S that...

  • Consider sending a large file of Z bits from Host A to Host B. There are four links (and three sw...

    Consider sending a large file of Z bits from Host A to Host B. There are four links (and three switches) between A and B, and the links are uncongested (that is, no queuing delays). Host A segments the file segments of S bits each and adds 60 bits of header to each segment, forming packets of L 60S bits. Each link has a transmitting rte of R bps. Propagation delay is ρ microseconds kilometer. Consider the following distances: A...

  • Q2.3. (15%) Consider sending a file of F bytes over a path of Q links. Each...

    Q2.3. (15%) Consider sending a file of F bytes over a path of Q links. Each link transmits at R bps. The network is lightly loaded so that there are no queuing delays at any link. The propagation delay on each link is Tp seconds on average. 1. Suppose the network is a packet-switched virtual-circuit network. Assume the VC setup time is Ts seconds. Suppose the sending layers add a total of h bits of header to the file, and...

  • Transmission Delay Consider sending N packets each of length L bits from Host A to Host B, as shown in the figure below. Assume that the links between Host A and the Router and between the Router and...

    Transmission Delay Consider sending N packets each of length L bits from Host A to Host B, as shown in the figure below. Assume that the links between Host A and the Router and between the Router and Host B each has a transmission rate of R bits per second. Assume all buffers are of infinite capacity. Ignore all processing and propagation delays. a) Express the delay it takes to send 2 packets from A to B as a function...

  • Host A is sending a file to Host B. There are 3 links (therefore 2 switches)...

    Host A is sending a file to Host B. There are 3 links (therefore 2 switches) between the hosts. The file is segmented into packets of 40 bytes, with a 10-byte header added to each packet. Each link has a transmission rate of 100 kbps and a speed of 1000 km per sec. The switches are 100km away from each other. Host A is 50 km away from the first switch while Host B is 150 km away from the...

  • 3. Suppose there is exactly one packet switch (or router) between a sending host and a...

    3. Suppose there is exactly one packet switch (or router) between a sending host and a receiving host. The transmission rates between the sending host and the switch and between the switch and the receiving host are R1 = 1Mbps and R2 = 2Mbps, respectively. Assuming that the switch uses store-and-forward packet switching, what is the total end-to-end delay to send a packet of length 18000bits? Assume that the propagation speed is 2 * 108 meters/sec, the distance between source...

  • 03) Consider sending a file size of O bits over a path of 2 links. Suppose...

    03) Consider sending a file size of O bits over a path of 2 links. Suppose the first link can transmit at R1 bit/sec (bps) and the second link can transmit R2 bits/sec (bps) (R1+ R2), both links have a propagation delay of tp, network lightly loaded (no queuing delays), and each link's maximum frame size, S bits, is same (S < O and number of segments is integer and headers are negligible.). (a) How long does it take to...

  • Consider sending a file of size 1 Gigabits from a server to a client. The server...

    Consider sending a file of size 1 Gigabits from a server to a client. The server segments the files into packets of the size 10 megabits. There are 5 routers (6 links) between the client and the server. Assume there is no queuing delay and end-to-end propagation delay is 10 seconds. Compute the total delay for sending this file from server to client. Assuming we are sending the packets back to back and all links have the transmission rate 100...

  • Suppose that x bits of user data are to be transmitted over a k-hop path in...

    Suppose that x bits of user data are to be transmitted over a k-hop path in a packet- switched network as a series of packets, each containing p data bits and h header bits, with x > p + h. The bit rate of the lines is b bps and the propagation delay is negligible. What value of p minimizes the total delay?

  • Consider a packet switching network. Packets from origin host travel over H hops to reach the...

    Consider a packet switching network. Packets from origin host travel over H hops to reach the destination host. Supppose that the origin host wants to transmit a message that is M bits long. The bit rate of all links is C (bits/sec), and the propoagation delay over every link is D seconds. The message will be broken into packets. Suppose that each packet has a constant overhead of V bits. Let L be the fixed payload of each packet. Thus,...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT