EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 4, Problem P22P
Program Plan Intro
Internet Protocol (IP):
Internet protocol is a process or protocol in which data is transferred between the computer systems through internet. Each computer system has its own IP address to send or receive the required data.
Datagram:
- In networking, a datagram is a transferring unit which is used to transfer the data from a source to the destination and it doesn’t provide guaranteed service.
- It includes fragmentation process which is defined as the division of the data packet into small one when the data packets are larger than the maximum length of a particular system.
Transmission Control Protocol (TCP):
- TCP is an internet protocol used for exchanging of data between the sender and the receiver. It is a secured protocol for transferring the data.
- When the sender sends data to the receiver, he/she waits for the acknowledgement from the receiver.
- If acknowledgement is received then the next data packet will be sent and the process continues till all the data packets are sent.
- If acknowledgement is not received then the receiver is assumed as hacker or intruder and the connection will be removed.
User Datagram Protocol (UDP):
- User datagram protocol is a connectionless protocol.
- The protocols used in UDP cannot establish the connection for data communication.
- It is one of the communication protocol suites used for transferring small messages termed as datagram.
- Alternative for TCP is UDP, but the data transfer speed of UDP is higher than TCP because there is no acknowledgment and error-checking.
- Checksum and port number are the two services provided by the UDP.
- There is no guarantee for data delivery and duplication of data.
- It doesn’t provide a reliable service.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Question 5:
Suppose you attach a network monitor to observe the sequence of frames that travel over a
link from sender A to receiver B. The problem is to deduce what protocols, if any, could have
generated the observed sequence. The following diagrams depict a flow of frames, with their
corresponding sequence numbers, from the sender (A). There may be traffic from B to A,
which is not depicted in the diagram. A gap between adjacent frames implies passage of time
with no transmission from the sender.
Note that the x-axis is time, and not space.
Justify your answer.
A
A
A
●
●
●
●
1
5
●
3
5
0
●
0
0
1
1
1
● Go-Back-N
● Selective Repeat
1
0
5
0
c) For Diagram 3, the protocol is not:
Stop-and-Wait
Time
Diagram 1
2
Time
a) For Diagram 1, the most likely protocol being used is:
Stop-and-Wait
● Go-Back-N (if Go-Back-N, give the window size)
Selective Repeat (if Selective Repeat, give the window size)
Diagram 2
Time
3
Diagram 3
1
Time
b) For Diagram 2, the most likely protocol being used is:…
Consider the SDN OpenFlow network shown in the Figure. Suppose we want switch s2 tofunction as a firewall. Specify the flow table entries in s2 that implements the followingfirewall behaviors for delivery of datagrams destined to h3 and h4. You do not need tospecify the forwarding behavior in s2 that forwards traffic to other routers. [20]a. Only traffic arriving from hosts h1 and h6 should be delivered to hosts h3 or h4(i.e., that arriving traffic from hosts h2 and h5 is blocked).b. Only TCP traffic is allowed to be delivered to hosts h3 or h4 (i.e., that UDP trafficis blocked).c. Only traffic destined to h3 is to be delivered (i.e., all traffic to h4 is blocked).d. Only UDP traffic from h1 and destined to h3 is to be delivered. All other traffic isblocked
P22. Consider again the SDN OpenFlow network shown in Figure 4.30 . Suppose we want switch s2 to function as a firewall. Specify the flow table in s2 that implements the following firewall behaviors (specify a different flow table for each of the four firewalling behaviors below) for delivery of datagrams destined to h3 and h4. You do not need to specify the forwarding behavior in s2 that forwards traffic to other routers.
Only traffic arriving from hosts h1 and h6 should be delivered to hosts h3 or h4 (i.e., that arriving traffic from hosts h2 and h5 is blocked).
Only TCP traffic is allowed to be delivered to hosts h3 or h4 (i.e., that UDP traffic is blocked).
Only traffic destined to h3 is to be delivered (i.e., all traffic to h4 is blocked).
Only UDP traffic from h1 and destined to h3 is to be delivered. All other traffic is blocked.
Chapter 4 Solutions
EBK COMPUTER NETWORKING
Ch. 4 - Lets review some of the terminology used in this...Ch. 4 - Prob. R2RQCh. 4 - Prob. R3RQCh. 4 - Prob. R4RQCh. 4 - Prob. R5RQCh. 4 - Prob. R6RQCh. 4 - Prob. R7RQCh. 4 - Prob. R8RQCh. 4 - Prob. R9RQCh. 4 - Prob. R10RQ
Ch. 4 - Prob. R11RQCh. 4 - Prob. R12RQCh. 4 - Prob. R13RQCh. 4 - Prob. R14RQCh. 4 - Prob. R15RQCh. 4 - Prob. R16RQCh. 4 - Prob. R17RQCh. 4 - Prob. R18RQCh. 4 - Prob. R19RQCh. 4 - Prob. R20RQCh. 4 - Prob. R21RQCh. 4 - Prob. R22RQCh. 4 - Prob. R23RQCh. 4 - Prob. R24RQCh. 4 - Prob. R25RQCh. 4 - Prob. R26RQCh. 4 - Prob. R27RQCh. 4 - Prob. R28RQCh. 4 - Prob. R29RQCh. 4 - Prob. R30RQCh. 4 - Prob. R31RQCh. 4 - Prob. R32RQCh. 4 - Prob. R33RQCh. 4 - Prob. R34RQCh. 4 - Prob. R35RQCh. 4 - Prob. P1PCh. 4 - Prob. P2PCh. 4 - Prob. P3PCh. 4 - Consider a datagram network using 32-bit host...Ch. 4 - Consider a datagram network using 8-bit host...Ch. 4 - Consider a datagram network using 8-bit host...Ch. 4 - Prob. P8PCh. 4 - Prob. P9PCh. 4 - Prob. P10PCh. 4 - Prob. P11PCh. 4 - Prob. P12PCh. 4 - Consider sending a 2400-byte datagram into a link...Ch. 4 - Prob. P15PCh. 4 - Prob. P16PCh. 4 - Prob. P17PCh. 4 - Prob. P18PCh. 4 - Prob. P19PCh. 4 - Prob. P20PCh. 4 - Prob. P21PCh. 4 - Prob. P22P
Knowledge Booster
Similar questions
- Consider a node called A that sends packets to an adjacent node called B. To control the packet flow to node B, node A employs a credit manager scheme in which parameters C=3(credits), C_max=4(credits) and \tao=6(msec), respectively. node A has an infinite buffer to temporarily store packets. When a packet arrives at node A, node A stores the packet at the bottom of the buffer. Node A also has a single server (transmitter). As soon as the server becomes idle, the server picks up a packet at the head of the buffer, if any, and serves the packet for packet transmission time T_p as far as there remains a credit. (The packet transmission time T_p = 4 (msec).) We observed the arrival times of the first 12 packets, denoted by aA(1)⋯A(12), which were as follows: n A(n) 1 0.5 msec 2 1.0 3 1.5 4 2.0 5 4.5 6 5.5 7 6.5 8 12.5 9 13.0 10 13.5 11 14.0 12 14.6 1. Let R(n) denote the departure time of the n th packet from the buffer for n∈{1,2,...}. Find R(n) for…arrow_forwardEach active interface of Distance vector gets frequent transmissions of the whole routing table that Distance vector maintains. The link status protocol broadcasts information about the state of a router's own connections to all other routers in the network. Each statement has two ideal examples that show how the Link state and the Distance vector may be utilized in a number of circumstances.arrow_forwardUsing a TCP SYN spoofing attack, the attacker aims to flood the table of TCP connection requests on a system so that it is unable to respond to legitimate connection requests. Consider a server system with a table for 256 connection requests. This system will retry sending the SYN-ACK packet five times when it fails to receive an ACK packet in response, at 30 second intervals, before purging the request from its table. Assume that no additional countermeasures are used against this attack and that the attacker has filled this table with an initial flood of connection requests. a. At what rate must the attacker continue to send TCP connection requests to this system in order to ensure that the table remains full? b. Assuming that the TCP SYN packet is 40 bytes in size (ignoring framing overhead), how much bandwidth does the attacker consume to continue this attack?arrow_forward
- Phases of TCP congestion control. Consider the figure below, which plots the evolution of TCP's congestion window at the beginning of each time unit (where the unit of time is equal to the RTT); see Figure 3.53 in the text. In the abstract model for this problem, TCP sends a "flight" of packets of size cwnd at the beginning of each time unit. The result of sending that flight of packets is that either (i) all packets are ACKed at the end of the time unit, (ii) there is a timeout for the first packet, or (iii) there is a triple duplicate ACK for the first packet. Congestion window size (in segments) 40 35 30 25 20 15 10 5 0 www 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 Time unit (in RTT) A. During which of the following intervals of time is TCP performing slow start*? B. During which of the following intervals of time is TCP performing congestion avoidance*? C. At the end of which units of time does TCP detect a triple-duplicate-ACK*?…arrow_forwardDistance vector sends its whole routing table to all of its active interfaces on a regular basis. Link status informs all routers in the network on the status of their own links. Two ideal examples for each statement are provided to demonstrate how Link state and Distance vector may be utilized in various scenarios.arrow_forwardIt is theoretically feasible for two hosts to communicate with one another by sending packets back and forth over the same connection. Please enumerate all of the components that are responsible for the overall amount of time required to process a single packet, starting to end. Is it to be anticipated that one of the delays will continue for a certain amount of time, while the duration of the other delay will be more unpredictable?arrow_forward
- Each of Distance vector's active interfaces receives regular transmissions of the whole routing table that Distance vector maintains. The information about the condition of a router's own connections is broadcast to all other routers in the network through the link status protocol. There are two perfect examples that can be used for each assertion to demonstrate how the Link state and the Distance vector may be used in a variety of contexts.arrow_forwardTo ensure the quality of service, especially for multiple applications, regulating the rate at which packets are sent to the network is an important strategy. The leaky bucket is just one of such mechanisms. A flow of packets is said to conform to the leaky bucket specification (r, b), where r is the average rate and b is the burst rate, if the number of packets arriving at the leaky bucket is less than r*t + b in every time interval of t. What is the implication of that? What will happen if the number of packets arriving at the leaky bucket is equal to or greater than r*t + b?arrow_forwardR6Fragmentation 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?arrow_forward
- Question 6 Phases of TCP congestion control. Consider the figure below, which plots the evolution of TCP's congestion window at the beginning of each time unit (where the unit of time is equal to the RTT); see Figure 3.53 in the text. In the abstract model for this problem, TCP sends a "flight" of packets of size cwnd at the beginning of each time unit. The result of sending that flight of packets is that either (i) all packets are ACKed at the end of the time unit, (ii) there is a timeout for the first packet, or (iii) there is a triple duplicate ACK for the first packet. Congestion window size (in segments) 40 35 30 25 20 15 10 5 0 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 Time unit (in RTT) A. During which of the following intervals of time is TCP performing slow start*? B. During which of the following intervals of time is TCP performing congestion avoidance*? C. At the end of which units of time does TCP detect a…arrow_forwardConsider the situation in the previous exercise, except this time assume that the router has a queue size of 1; that is, it can hold one packet in addition to the one it is sending (in each direction). Let A's timeout be 5 seconds, and let SWS again be 4. Show what happens at each second from Time=0 until all four packets from the first window-full are successfully delivered.arrow_forwardIn IEEE 802.11, two-way communication is used to authenticate an open system. In order to authenticate the client, the server must give the station ID (typically the MAC address). Response to the client's previous request is either a successful or failed authentication response from the access point/router. An error may arise if, for example, an AP/router configuration does not include the client's MAC address.In what ways is it advantageous to use this kind of authentication scheme?In what ways does this authentication technique have security vulnerabilities that might be mitigated?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education