This is the archived website of SI 486H from the Spring 2016 semester. Feel free to browse around; you may also find more recent offerings at my teaching page.

Problem 22

Calculating entropy of network traffic

Due: February 2
Points: 2

Here is an article that was published a few years ago on calculating the entropy (randomness) in network traffic:

"Data Streaming Algorithms for Estimating Entropy of Network Traffic", SIGMETRICS 2006 (Click on the pdf link next to "Full Text".)

This is a research article, so you might not be able to follow every word. However, I still want a 1-page summary that has at least some level of technical content. They are talking about an algorithm, so I want you to answer:

  • What is the problem they are trying to solve?
  • What is the basic idea behind their algorithm?
  • Does this relate in any way to random number generation?

Naturally, the last question will not be directly answered in the article, so you have to figure it out! Turn in a 1-2 page summary that answers the questions above.