The token bucket algorithm is a popular method for traffic shaping (recap the algorithm in textbook Ch. 5.3.2). A computer uses a token bucket with a capacity of 400 megabytes (MB), and a rate of 10 MB per second. The machine starts generating 20 MB per second continuously when the bucket contains 200 MB. How long will it take to send 1000 MB?

The token bucket algorithm is a popular method for traffic shaping (recap the algorithm in textbook Ch. 5.3.2). A computer uses a token bucket with a capacity of 400 megabytes (MB), and a rate of 10 MB per second. The machine starts generating 20 MB per second continuously when the bucket contains 200 MB. How long will it take to send 1000 MB?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter8: Data And Network Communication Technology

Section: Chapter Questions

Problem 41VE

See similar textbooks

Similar questions

The latest super-duper supercomputer has memory locations that are 64-bits wide. What is the largest unsigned integer that can be stored in one memory location? Suppose that we use sign-magnitude for storing negative numbers and dedicate one bit for a sign bit. What would be the largest POSITIVE integer that can be stored in a memory location.
In computing, time scales usually store the current time as the number of seconds that have elapsed since the beginning of some “epoch”, which is an arbitrary date that determines the starting time. For example, the Network Time Protocol (NTP) uses an epoch of midnight on January 1st (GMT) 1900. The elapsed seconds since the epoch are stored in a 32-bit unsigned integer. In many embedded systems, it is more practical to just consider the current year. In this case, the format is often modified such that 0 corresponds to midnight on January 1stof the current year. If a clock that was initialized to 0 at midnight of 1 January 2020 currently has a count of 3665044 seconds, what day and time does it represent? (For example, your answer should be in the form June 6, 8:47:12 am) Show your work
The Hi-Fi modem company has designed a new frequency modulation that can transmit 38400 bits/sec. The baud rate is 4800. How many frequency levels can each interval have? 3. 4. Given a location with 7 bits what is the minimum and maximum value that it can hold A) As an unsigned location B) As a signed location
When Bob wants to send Alice a message M on the Internet, he breaks M into n data packets, numbers the packets consecutively, and injects them into the network. When the packets arrive at Alice’s computer, they may be out of order, so Alice must assemble the sequence of n packets in order before she can be sure she has the entire message. Describe an efficient scheme for Alice to do this. What is the running time of this algorithm? From Data Structures and Algorithms C-7.56
A video system can take videos from one of the two video sources, but can only display one source at a provided time. Each source outputs a stream of digitized videos on its 8-bit output. A switch with a single-bit output determines which of the two 8-bit streams will be passed on a display’s single 8-bit input. Implement a circuit that combines the two video sources, the switch, and the display. Use either ONE of the following: a single mux AND/OR an N-bit mux decoder
The function f(R, K) = P(S(E(R XOR K)) of the DES cryptographic protocol manipulates different sizes of bit-strings. The bit-string sizes of P-SEK in this order are: 32-48-48-32 32-32-48 48 48-48-32-32 64-32-32 48 64 48 32-64 SAVE
Write a script using PHP that takes a link from the user and parses through its associated web page to print a list of every link embedded on that site. This program must work recursively, so for each link that gets printed, the program should automatically take each of those links as a new input and do the same for them until there are no more links left. If the same link exists twice on the same page, or if it exists on more than one page, the program should ignore all duplicate instances of the link.
A symmetric block encryption algorithm is shown below. 16-bit blocks of plaintext P are encrypted using a 32-bit key. Encryption is defined as: C = (P EX_OR Ko) + K1 C is the ciphertext, K is the secret key, Ko is the leftmost 16 bits of K, K1 is the rightmost 16 bits of K, EX_OR is bitwise exclusive OR, and + is binary addition. a. The ciphertext C must be the same size as the plaintext P, that is, it must not be larger than 16 bits. How can this be achieved? b. Show the decryption equation. How will the encrypted message be decrypted?
One way to electrically or optically represent a binary 1 or 0 is to use the transition between a voltage level (for example, going from a state of no voltage to a state of voltage, or vice versa, on a copper cable) or the transition of having light or no light on a fiber-optic cable to represent a binary 1. Similarly, a binary 0 is represented by having no transition in a voltage level or light level from one time period to the next. This approach of representing binary digits is called state transition modulation.
Computer Science A two digital number a ∗ 10 + b can form a link to the number a ∗ b. Note that there is not connection between any pair of one digital number. Find all the numbers, [0, 99], reachable from 0?
Write a program to simulate the behaviour of the CSMA/CD protocol over Ethernet when there are N stations ready to transmit while a frame is being transmitted your program should report the times when euch station successfully starts sending its frame. Assume that a clock tick occurs once every slot time (57.2 usec) and a collision detection and sending of a jamming sequence. takes one slot time. All frames are the maximum length allowed
Computer Networks : Apply the CRC method on given data dividend= 100100 and number of zero’s appended should be 1 less than divisor and divisor in this case is 1101. When there is no error When even numbers of bits are corrupted, highlights the corrupted bits. When odd numbers of bits are corrupted, highlights the corrupted bits.