Computer Science, asked by aasthakansal282, 1 year ago

Leaky bucket algorithm example consider a frame relay network having a capacity of 1mb and data is input at the rate of 25mbps.Calculate 1. What is the time needed to fill the bucket. 2. If the output rate is 2 mbps , the time needed to empty the bucket. Ans. Here , c is capacity of bucket = 1mb data input rate = 25 mbps output rate = 2mbps. 1. T = c/input rate = 1/25 = 40 msec 2 t = c/output rate = = 500 msec

Answers

Answered by afroz00786
0
I once made a real-time multi-camera video processing software, doing motion detection and cumulative histographic magic, all on 33MHz processors and 640Mb of RAM. The hard part was making this go fast; copious amounts of hashing, bits-shifting, cheating, swearing and late nights with pizza and ephiphanies for about 4 years. Oh, and I did a version dealing with color as well. Oh, and a module that could see the difference between steam and white smoke in large rooms (like nuclear reactors, as it were). Hah, you just try it! You wouldn't find examples of such in any text-book. :)
Similar questions