What is the fastest line speed at which a host can blast out 1500-byte TCP payloads with a 120 sec maximum packet lifetime without having the sequence numbers wrap around? Take TCP, IP, and Ethernet overhead into consideration. Assume that Ethernet frames may be sent continuously and one Ethernet PDU will hold each one.

What is the fastest line speed at which a host can blast out 1500-byte TCP payloads with a 120 sec maximum packet lifetime without having the sequence numbers wrap around? Take TCP, IP, and Ethernet overhead into consideration. Assume that Ethernet frames may be sent continuously and one Ethernet PDU will hold each one.

Principles of Information Security (MindTap Course List)

6th Edition

ISBN:9781337102063

Author:Michael E. Whitman, Herbert J. Mattord

Publisher:Michael E. Whitman, Herbert J. Mattord

Chapter6: Security Technology: Access Controls, Firewalls, And Vpns

Section: Chapter Questions

Problem 2RQ

See similar textbooks

Similar questions

Assume that there is a shared connection (for example, an Ethernet bus) with a speed of 1 Mbps. How much time (in microseconds) is required to send a frame with a length of 1000 bits over this link?
A 1-km-long, 10-Mbps CSMA/CD LAN (i.e., Classic Ethernet)has a propagation speed of 200 m/μsec (i.e., how fast the radio signal moves on the link). Thereare no repeaters in this system. Data frames are 512 bits long, including 480 bits of payload (i.e.,effective data) and 32 bits of overhead (e.g., header, checksum, and other overhead fields). Everydata frame should be confirmed by a 64-bit ACK frame. We assume the sender needs to use onecontention slot to seize the channel before transmitting the data frame, and the receiver needsto use one contention slot to seize the channel before transmitting the ACK frame. Answer thefollowing questions: a. What is the minimum length of a contention slot in μsec? b. What is the effective data rate for the sender to send one data frame? Assume that there areno collisions. Show the calculation c. What would be the impact on the total delay and the effective data rate if we used a longerdata payload size in the data frame? Given one application…
A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other packets are waiting to be transmitted. Packets are transmitted in order of arrival. Suppose all packets are 1,200 bytes and the link rate is 2 Mbps. What is the queuing delay for the packet? More generally, what is the queuing delay when all packets have length L, the transmission rate is R, x bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?
1. Build a Router network which has three Generic Routers and totally of Six networks in it. From each Router the required switch shall be connected through Fast Ethernet port and the switch is connected to two users. On the whole there are '6' networks in the configuration. Along with the network diagram do the packet transfer in simulation mode and write results for three different combinations.
ngineering Computer EngineeringQ&A Library2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and the length of the link is 100Km. a. What is the propagation delay from A to B, that is the amount of time from when the first bit of the packet is transmitted at A, until it is received at B? b. What is the transmission time of the packet at A (the time from when the first bit of the packet is sent into the wire and the time at which the last bit is sent into the wire). c. Suppose now that that length of the link is doubled. What is the propagation delay from A to B now and what is the transmission t 2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and the length of the link is 100Km. a. What is the propagation delay from A to B, that is the amount of time from when the first bit of the packet is transmitted at A, until it is received at B? b. What is the transmission time of the packet at A (the time from when the first bit of the packet is sent into the…
If a two port bridge was used in a heavy load standard Ethernet network such that the traffic is going through it. If each station is theoretically given a capacity of5Mbpsand the number of stations in each LAN segment is equal, then the number of stations in each LAN is:
An IP address can be written as a 32-bit number. For a class B network, the two most significant bits are set to 10. The 16 most signi cant bits are used as a network ID, and the 16 least signi cant bits are used as a host ID. However, the host ID cannot be all 0's or all 1's. How many hosts (i.e., host IDs) can there be on a class B network?
Suppose we have a web page which contains 10 objects including: a html main file, 8 jpg image, and a .mp3 background music. For simplicity, assume each of the 10 objects has a size of 4 Kbits and that each object can be completely transferred in one TCP packet. Furthermore, assume the round-trip time between the server and client is RTT= 250 ms, and the download rate is 1 Mbps. What will be the time it takes to complete transferring the web page running in the non-persistent mode? Total delay = ms
4. The original HTTP protocol used TCP/IP as the underlying protocol. For each page, graphic, or applet, a separate TCP connection was constructed, used, and terminated. This caused several problems: one referred to as the elephant and mice problem and two aspects of connection overhead. Describe both problems. Why were separate connections used? Would UDP rather than TCP be a good alternative? What solution would you propose to these problems to improve HTTP performance?
Consider a datagram network using 32-bit host addresses. Suppose a router has four links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as follows: Destination Address Range Link Interface 11100000 00000000 00000000 00000000 through 11100000 00111111 1111111 11111111 11100000 01000000 00000000 00000000 through 11100000 01000000 1111111111111111 11100000 01000001 00000000 00000000 through 11100001 01111111 11111111 11111111 otherwise 0 1 2 3 a. Provide a forwarding table that has five entries, uses longest prefix matching, and forwards packets to the correct link interfaces.
Let the two host X and Y connected via a packet switch with 107 bits per second links. Switch is placed at 50 km from X. X and Y are located at 100 Kilometer apart also the propagation speed along the link is 2 × 108 m/s. The switch begins forwarding a packet after 0.1 milliseconds it receives the packet. If 1000 bytes of File are needed to be transmitted and each packet size is 500 bytes, the time elapsed between the transmission of the first bit of data and the reception of the last bit of the data in millisecond is
Assume a wireless network consists of an access point (denoted as X) and two wireless nodes (denoted as A and B respectively). Assume that wireless nodes A and B cannot hear each other's transmissions, but they can hear X (i.e. X can hear A and B). Suppose ● ● At time 0 µs, X is sending a packet to some other node and it completes sending this packet at time 100 µs. At time 20 µs, a packet becomes available for transmission at A. A needs 150 μs to send this packet. At time 60 µs, a packet becomes available for transmission at B. B needs 100 µs to send its packet. Let the value of the backoff timer for A be 40 µs and the value of the backoff timer for B be 60 μs. 1) Sketch the above described topology to include wireless nodes X, A, B, and their coverage. You may use tools such as Word, Paint, Visio, etc. to complete this topology.