The following table shows the transmission schedule for a given flow lists for each second the number of packets sent between that time and the following second. The flow must stay within the bounds of a token bucket filter. What the bucket size does the flow need for the following token rates? Assume the bucket is initially full. (a) 2 packets per second (b) 4 packets per second Time (seconds) | Packets Sent 5 1 2 1 3 4 1

The following table shows the transmission schedule for a given flow lists for each second the number of packets sent between that time and the following second. The flow must stay within the bounds of a token bucket filter. What the bucket size does the flow need for the following token rates? Assume the bucket is initially full. (a) 2 packets per second (b) 4 packets per second Time (seconds) | Packets Sent 5 1 2 1 3 4 1

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

Consider sending a file of F bits over a path of Q links. Each link transmits at R bits per second (bps). The network is lightly loaded so that there are no queueing delays. When a form of packet switching is used, the F bits are broken up into packets, each packet with L bits, of which h bits of it are header. Propagation delay is negligible. Let F = 5x104, Q = 20, R = 1 Mbps, L = 1000, and h = 10. b) Suppose the network is a packet-switched datagram network and a connectionless service is used. How long does it take to send the file?
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…
Calculate the total time required to transfer a 1.5-MB file in the following cases, assuming an RTT of 80 ms, a packet size of 1 KBdata, and an initial 2 RTT handshake before data is sent: The link allows infinitely fast transmit, but limits bandwidth such that only 20 packets can be sent per RTT. The bandwidth is infinite, but during the first RTT we can send one packet, during the second RTT we can send two packets, during the third we can send four, etc.
Computer Science Before the introduction of IEEE 802.11i, the security scheme for IEEE 802.11 was Wired Equivalent Privacy (WEP). Assume that the initialization vector (IV) is not used in WEP. Instead, RC4 is applied using K as input and producing s as output. Assume RC4(K, n) is applied for each packet and that all packets have the same length. If an attacker intercepts a single packet with ciphertext C1 and also has a known plaintext/ciphertext pair (P2, C2). Show how the attacker can find the plaintext P1. You can make use of an example by assuming some random data is being encrypted.
Give some details of how you might augment the sliding window protocol with flow control by having ACKs carry additional information that reduces the SWS as the receiver runs out of buffer space. Illustrate your protocol with a timeline for a transmission; assume the initial SWS and RWS are 4, the link speed is instantaneous, and the receiver can free buffers at the rate of one per second (i.e., the receiver is the bottleneck). Show what happens at T = 0, T = 1,...,T = 4 seconds.
Consider the pattern of red and green packet arrivals to a router’s output port queue, shown below. Suppose each packet takes one time slot to be transmitted, and can only begin transmission at the beginning of a time slot after its arrival. Indicate the sequence of departing packet numbers (at t = 1, 2, 3, 4, 5, 6, 7) under Priority scheduling, where red packets have priority over green packets.. Match each time unit (t=1, t=2, t=3 ....) with the number of the packet that was transmitted and thus "departs" at that time unit.
In this example, assume that the fixed path is used to transport a packet from a source to an address at the other end of the network. List the many components of delay as well: Approximately how many delays are continuous for how long, and approximately how many are timedependent?
Consider a router buffer preceding an outbound link. In this problem, you will use Little’s formula, a famous formula from queuing theory. Let N denote the average number of packets in the buffer plus the packet being transmitted. Let a denote the rate of packets arriving at the link. Let d denote the average total delay (i.e., the queuing delay plus the transmission delay) experienced by a packet. Little’s formula is N=a⋅d . Suppose that on average, the buffer contains 10 packets, and the average packet queuing delay is 10 msec. The link’s transmission rate is 100 packets/sec. Using Little’s formula, what is the average packet arrival rate, assuming there is no packet loss?
Consider the pattern of red and green packet arrivals to a router’s output port queue, shown below. Suppose each packet takes one time slot to be transmitted, and can only begin transmission (at the earliest) at the beginning of a time slot after its arrival. Indicate the sequence of departing packet numbers (at t = 1, 2, 3, 4, 5, 6, 7) under Priority scheduling, where red packets have priority over green packets. Match each time unit (t=1, t=2, t=3 ....) with the number of the packet that was transmitted and thus "departs" at that time unit.
It is possible for a series of packets to be sent from one host to another utilizing the same route between the hosts. Please break down the time it takes for a single package to go from beginning to conclusion. Is it expected that one of the delays would last for a certain period of time, while the other delay's length remains open?
A router has the following four active flows, and each flow has packets to transmit. Given FQ is being used on the router, what is the order that the packets will be transmitted?
It 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?