Problem 3Consider the problem of deciding whether to implement a virtual-circuit or a datagram network. Assume a network protocol that allowsthe system to operate as either a virtual circuit network or a datagramnetwork. That is, its packet header format is specified such that itincorporates both a VCI (Virtual Circuit Identifier) and an arbitrarysource/destination addresses.When operating as a virtual circuit, it requires a 4-byte header. Whenoperating as a datagram network, it requires a 40-byte header.Assume that there are 4 hops from source to destination, and that aset 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 onall links and the packet size is 256 bytes (including the header).i)If we operate in the datagram mode, how long does it takefor the first packet to reach the destination?If we operate in virtual-circuit mode, how long does it takefor the first packet to reach the destination?Compute the end-to-end delay for datagram transmission?Compute the end-to-endtransmission?ii)iii)iv)delay for virtual-circuit

Answer: a) packets arrive periodically= L/R L-packet size R- rate. 256/9600=0.026. b) The…

Answered: Problem 3 Consider the problem of…

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

Similar questions

In modern packet-switched networks, including the Internet, the source host segments long, application-layer messages (for example, an image or a music file) into smaller packets and sends the packets into the network. The receiver then reassembles the packets back into the original message. We refer to this process as message segmentation. Figure 1.27 illustrates the end-to-end transport of a message with and without message segmentation. Consider a message that is 8. 106 bits long that is to be sent from source to destination in Figure 1.27. Suppose each link in the figure is 2 Mbps. Ignore propagation, queuing, and processing delays. a. Consider sending the message from source to destination without message segmentation. How long does it take to move the message from the source host to the first packet switch? Keeping in mind that each switch uses store-and-forward packet switching, what is the total time to move the message from source host to destination host? b. Now suppose that…
Consider a TCP connection with the following parameters: a) Initial ssthreshold = 8 b) Round Trip Time (RTT) = 10 milliseconds c) Retransmission Timeout period = 40 milliseconds d) Segment size = 2700 bytes The TCP connection was used to transfer 19 data segments, numbered 1 through 19. While sending the segments, data segment 10 was lost the first time it was sent (but arrived at the receiver properly upon being retransmitted). There were no other segment losses apart from the aforementioned. Assume that data segments received out-of-order are buffered at the receiver. What is the average throughput obtained in sending all the data segments (in bytes/sec)? Draw a diagram to show the transmission of the segments in detail.
TCP congestion control example. Consider the figure below, where a TCP sender sends 8 TCP segments at t = 1, 2, 3, 4, 5, 6, 7, 8. Suppose the initial value of the sequence number is 0 and every segment sent to the receiver each contains 100 bytes. The delay between the sender and receiver is 5 time units, and so the first segment arrives at the receiver at t = 6. The ACKs sent by the receiver at t = 6, 7, 8, 10, 11, 12 are shown. The TCP segments (if any) sent by the sender at t = 11, 13, 15, 16, 17, 18 are not shown. The segment sent at t=4 is lost, as is the ACK segment sent at t=7. TCP sender t=1 T t=2 t=3 t=4+ t=5- t=6+ t=11 t=12 t=13 t=14 t=15 t=16 t=17 t=18 I data segment data segment data segment data segment data segment data segment data segment data segment ACK ACK ACK ACK ACK ACK Ty A A V V htt TCP receiver t=6 t=7 t=8 t=9 t=10 t=11 t=12 t=13 What does the sender do at t=17? You can assume for this question that no timeouts have occurred.
Consider the following scenario in which host A is sending a file to host B over a TCP connection. Assuming that the sequence number of the first data byte sent by A is 0 and every segment always includes 1000 bytes of data, excluding the TCP header. At some point of time, bytes up to 6400 have been written into the sender’s buffer. Bytes up to 4999 have been sent out but the segment which contains bytes 2000~2999 has not arrived at host B yet. At the receiver’s side, all bytes up to 3999 have been received except for bytes 2000~2999. Bytes up to 499 have been read from the buffer by the application. Assume that the maximum size of the sender’s buffer is large enough. Consider the sliding window algorithm in TCP and answer the following questions. 1) What are the values for LastByteAcked, LastByteSent, and LastByteWritten? 2) What are the values for LastByteRead, NextByteExpected, and LastByteRcvd? 3) Assuming that the maximum size of the receiver’s buffer is 4000 byte, what would…
1. What is the difference between packet fragmentation (i.e., at network layer) and frame frag- mentation (i.e., at link layer) in terms of purpose? 2. Suppose that host A is connected to a router R1, R1 is connected to another router, R2, and R2 is connected to host B. Suppose that a TCP message that contains 800 bytes of data and 20 bytes of TCP header is passed to the IP function at host A for delivery to B. Show the Total length, DF, MF, and Fragment offset fields of the IP header in each packet transmitted over the three links. (Assume that link A-R1 can support a maximum frame size of 1024 bytes including a 14-byte frame header, link R1-R2 can support a maximum frame size of 512 bytes, including an 8-byte frame header, and link R2-B can support a maximum frame size of 432 bytes including a 12-byte frame header.) (*hint: the Fragment offset field is denominated by 8-bytes, not bytes) 3. What is the purpose of the path MTU discovery process (see textbook Figure 5-42) and why does…
What is meant by a control plane that is based on per-router control? In such cases, when we say the network control and data planes are implemented "monolithically" what do we mean?
4. In this problem, you will derive the efficiency of a CSMA/CD-like multiple access protocol. In this protocol, time is slotted and all adapters are synchronized to the slots. Unlike slotted ALOHA, however, the length of a slot (in seconds) is much less than a frame time (the time to transmit a frame). Let S be the length of a slot. Suppose all frames are of

Recommended textbooks for you

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 Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

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 Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

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

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS