QUESTION 36OSPF is based on distance vector algorithm.TrueFalse QUESTION 37Transport layer is usually implemented in hardwareTrueFalse QUESTION 38TCP is a NAK-free protocolTrueFalse QUESTION 39UDP provides congestion control and flow control TrueFalse QUESTION 40Congestion control prevents the receiver to get overwhelmed by the sender TrueFalse QUESTION 41Flow control prevents the receiver to get overwhelmed by the sender TrueFalse QUESTION 42TCP provides reliable connection over unreliable channelsTrueFalse

*As per the company norms and guidelines we are providing first three sub parts of the question so…

Answered: QUESTION 36 OSPF is based on distance…

QUESTION 36 OSPF is based on distance vector algorithm. True False QUESTION 37 Transport layer is usually implemented in hardware True False

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter13: Internet And Distributed Application Services

Section: Chapter Questions

Problem 15VE

See similar textbooks

QUESTION 36

OSPF is based on distance vector algorithm.

True

False

QUESTION 37

Transport layer is usually implemented in hardware

True

False

QUESTION 38

TCP is a NAK-free protocol

True

False

QUESTION 39

UDP provides congestion control and flow control

True

False

QUESTION 40

Congestion control prevents the receiver to get overwhelmed by the sender

True

False

QUESTION 41

Flow control prevents the receiver to get overwhelmed by the sender

True

False

QUESTION 42

TCP provides reliable connection over unreliable channels

True

False

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.

Expert Solution

This question has been solved!

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

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Step by step

Solved in 4 steps

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

Which of the following statements is/are correct?I. The fragmentation is applicable for data in the datagram but not for header.II. Reassembly of the fragments must be performed at the destination because,theIntermediate networks may have different maximum transmission unit (MTU) sizes.III. In the IP header, the time-to-live (TTL) field is invariable. (A) I and II(B) I and III(c) II and III(D) All are correct
a) In a bus CSMA/CD network with a data rate of 10 Mbps, a collision occurs 20 µs after the first bit of the frame leaves the sending station. What should the length of the frame be so that the sender can detect the collision? b) There are only two stations, A and B, in a bus 1-persistence CSMA/CD network with Tp = 25.6 µs and Tr = 51.2 µs. Station A has a frame to send to station B. The frame is unsuccessful two times and succeeds on the third try. Draw a flowchart for this problem. Assume that the R is 1 and 2 respectively and ignore the time for sending a jamming signal.
Match the left-column statements to the right-column architecture. A server is constantly on. Processes may serve each other. Communication always involves client and server processes. HTTP employs this architecture. Users control hosts, which may go down unexpectedly. Self-scalable. Answer: peer-to-peer. B. Peer-to-peer. Peer-to-peer or client-server. Client-server D. TCP/IP design.
6 Need Some Help explaining this alert [**] [123:8:2] (spp_frag3) Fragmentation overlap [**] [Classification: Generic Protocol Command Decode] [Priority: 3] 05/06-20:40:27.360280 137.12.64.210 -> 121.10.105.211 ICMP TTL:61 TOS:0x0 ID:53569 IpLen:20 DgmLen:1500 MF Frag Offset: 0x00B9 Frag Size: 0x05C8
R6Fragmentation of an IP datagram takes place if its size is larger than the MTU of the subnet over which the datagram will be routed. Most IP datagram reassembly algorithms have a timer to avoid having a lost fragment tie up reassembly buffers forever. Suppose a datagram is fragmented into four fragments. The first three fragments arrive, but the last one is delayed. Eventually the timer goes off and the three fragments in the receiver's memory are discarded. A little later, the last fragment stumbles in. What should be done with it?
Most IP datagram reassembly algorithms have a timer to avoid having a lost fragment tie up reassembly buffers forever. Suppose that a datagram is fragmented into four fragments. The first three fragments arrive, but the last one is delayed. Eventually, the timer goes off and the three fragments in the receiver's memory are discarded. A little later, the last fragment stumbles in. What should be done with it?
Consider a web page whose base file is of size S1 = 10 KB. Assume that the web page consists of N = 20 inline objects each of size S2 = 100 KB. Assume that the round-trip time to the web server is T = 100 ms and the bottleneck capacity is C = 10 Mbps. Ignore any packetization delays and header overhead.a. Assuming non-persistent HTTP is used with a single TCP connection, how long does it take to download the web page?b. Assuming non-persistent HTTP is used with 4 parallel TCP connections, how long does it take to download the web page?c. Assuming pipelined, persistent HTTP is used, how long does it take to download the web page? ”Pipelined” means requests for multiple objects can be sent back-to-back on the same connection.d. Assuming non-pipelined, persistent HTTP with 2 parallel TCP connections is used, how long does it take to download the web page? Assume that the 2 parallel connections equally share the total available bandwidth C.
True or false 9. Suppose host A sends host B one segment with sequence numbers 38 and 4 bytes of data. Then in this same segment, the acknowledgment number is necessarily 42. 10. Suppose host A is sending a large file to host B over a TCP connection. If the sequence number for a segment of this connection is m, then the sequence number for the subsequent segment will be m + 1. 11. Host A is sending host B a large file over a TCP connection. Assume host B has no data to send A. Host B will not send acknowledgments to host A because host B cannot piggyback the acknowledgments on data. 12. Consider an HTTP server using persistent connections. Suppose the server spawns a sep- arate process for each client that connects to the server. Then each of these spawned pro-cesses will have different server port numbers.
Consider sending a 1300-byte datagram into a link that has a MTU of 500 bytes. Which of thefollowing is true? Please justify your answer.1. Three fragments are created with offsets 0, 500/8 1000/82. Three fragments are created with offsets 0, 480/8 and 960/8.3. Three fragments are created, with offsets 0, 460/8 and 920/8.4. None of the above
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 causes the most page faults to occur on a machine with 3 frames? Scheme that causes the most faults: a) First in First out b) LRU and FIFO are the same number of faults c) FIFO and Opitimal are the same number of faults d) All have the same number of faults e) Least Recently Used f) No faults occurs g) LRU and Optimal are the same number of faults h) Optimal NUMBER OF FAULTS CAUSED: a)
serialize and deserialize C++ //In a client/server application, required to transmit objects of type student as defined : struct student{ char name[20]; float gpa; address* addr; } struct address{ char street[20]; char city[20]; char country[20]; }//Develop the following functions to serialize and deserialize a student: struct serialized_student{ //To be implemented by students }struct serialized_student student_serializer(student s){ //To be implemented by students } student student_deserializer(){ //To be implemented by students }
A host-to-host connection may transport a large number of packets. Please provide me with a breakdown of items load processing time. Should the duration of one delay be set while the length of the other be variable?