In fair queuing, the value F; was interpreted as a timestamp: the time when the ith packet would finish transmitting. Give an interpretation of F; for weighted fair queuing, and also give a formula for it in terms of Fi-1, arrival time Aį, packet size Pi, and weight w assigned to the flow.

In fair queuing, the value F; was interpreted as a timestamp: the time when the ith packet would finish transmitting. Give an interpretation of F; for weighted fair queuing, and also give a formula for it in terms of Fi-1, arrival time Aį, packet size Pi, and weight w assigned to the flow.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider the case of Alice sending a message, m, to Bob. Both Alice and Bob use public key cryptography and each has a public and private key as described in the text. The figure attached below shows the operations that Alice must perform to provide confidentiality, authentication, and integrity when sending a message to Bob over the network. We can use either symmetric key or public key cryptography to encrypt a message. For our purposes, either technique will encrypt the message, and applying both doesn't make it "more secure". Also, we can assume that the session key would remain a secret so the fact that it is discarded does not make it "more secure". Why do we use a session key, Ks, instead of relying only on public key Cryptography? In other words, why do we use both public key and symmetric key cryptography?
1-The eficiency of 64 equiprobable messages coded in fixed length i . a9 b 9l00% AP 2+ Ihe effciency of 17 cquiprobable messages coded in a fixed lengh wil be approximately—— WI00% B)20% 8% d)non ofthe mentioned 3- The average code lengih L f 10 equiprobuble messages coded in a ixed length il be - 1 W2 94 dnonofthe mentioned 4 For 11 cquiprobable messages coded in fixed ength cod then 5- For 256 equiprobable messsges coded in fxed length code then
7. In the proof of the claim that for any n-bit messages, any resulting code C with parity bits satisfying properties (0) and (1) will have minimum distance 3, we use 3 cases: A(r, y) = 1,2 and 3. Select all that are true: a. We don't need the case of A(r, y) = 0 because the code has minimum distance 3. b. We don't need the case of A(r, y) = 0 because we assumed r # y. c. We don't need the case of A(r, y) = 0 because it is taken care of by the other cases. d. We don't need the case of A(r, y) = 0 because the claim doesn't need to be proven for that case. e. We don't need the case of A(r, y) = 4 because the code has minimum distance 3. f. We don't need the case of A(r, y) = 4 because we assumed a # y. g. We don't need the case of A(r, y) = 4 because it is taken care of by the other cases. h. We don't need the case of A(r, y) = 4 because the claim doesn't need to be proven for that case.
Consider a simple congestion-control algorithm that uses linear increase and multiplicative decrease but not slow start, that works in units of packets rather than bytes, and that starts each connection with a congestion window equal to one packet. Give a detailed sketch of this algorithm. Assume the delay is latency only and that when a group of packets is sent only a single ACK is returned. Plot the congestion window as a function of round-trip times for the situation in which the following packets are lost: 9, 25, 30, 38, and 50. For simplicity, assume a perfect timeout mechanism that detects a lost packet exactly 1 RTT after it is transmitted.
A Web music store offers two versions of a popular song. The size of the standard version is 2.2 megabytes (MB). The size of the high-quality version is 4.5 MB. Yesterday, there were 1390 downloads of the song, for a total download size of 4484 MB. How many downloads of the high-quality version were there? Number of high-quality version downloads: X Español
3. Consider the M/M/1 queue discussed in class. Assume that packets arrive to a queue with average arrival rate A [pkts/s]. The average service rate of the queue is denoted by u [pkts/s]. (a) Write expressions for: (i) the mean time between packet arrivals to the queue, i.e., the average inter-arrival time; and (ii) the mean service time, i.e., the average time needed to transmit a packet onto the outgoing link. (b) Let N denote the number of packets in the system in steady-state. Suppose A = 850 and u 1000. Find the smallest value of B such that P(N > B) < e = 10¬4. Hint: Use MATLAB or some other computational tool (you could even use an Excel spreadsheet) to test different values of B. 4. Consider the M/M/1 queue from Problem 3. (a) Find an expression for E[N], i.e., the average number of packets in the system in steady- state. For the values of A and µ specified in Problem 4(b), compute the value of E[N]. What happens when A→ µ? (b) Find an expression for Var[N], i.e., the variance…
Modes of operation such as CFB and CBC require the use of an initial variable (IV), which must be known by both the sender and receiver. Discuss the pros and cons of the following suggestions for selection of IVs Randomly generate each IV; Use a counter that is incremented after each message as the IV; Use the last ciphertext block of the previous message as the IV
Given a M/M/1 queue, if the average inter-arrival time is Z seconds, the average packet service time is P, find: a. The probability an arriving packet has to wait in the queue b. The variance (o}) of the inter-arrival time The variance (o) of the packet service time d. The average number of packets in the system (i.e., in the queue + in the NIC) c.
The token bucket algorithm is a popular method for traffic shaping. A computer uses a token bucket with acapacity of 400 megabytes (MB) and a rate of 10 MB/sec. The computer continuously generates20 MB/sec for transmission from time 0. Assume the bucket’s water level is 200 MB at time 0.1a. How long will it take to send 1000 MB? Show the steps.1b. Draw a figure showing how the bucket’s water level evolves
Design a cryptographic solution for implementing the dinning cryptographers protocol. You should consider the following: The secret messages shared between any two agents in the protocol are communicated over public channels only. The announcements made by each agent must be traceable in a trustworthy way to that agent. Your solution should be a new protocol that addresses the above two requirements.
Suppose that a security specialist and a remote command team are using the RSA cryptosystem to send a message. The command team selects p = 17 and q = 11. Assume e is chosen to be 3. What is the value of Ø?
2.(a) Consider the use of OTP. Let m be an arbitrary message to be encrypted and c be a given ciphertext in the ciphertext space. How many possible keys with which m can be mapped to c, i.e., f(m,k)=c? None 1 2 The size of the key space Depends on m (b) 3^(-n) is negligible. True or false? (c) n^(-100) is negligible. True or false?