Hi,
once upon a time... in a galaxy far far away...
Ok, that's the story as far as I know it.
Poisson distribution models a memoryless process, i.e., one where one "event" is not correlated with another one. An "event" may be anything, actually.
If you pick a large enough bunch of people and you set a average number of calls per hour (note: calls, we're talking about plain old telephone calls), the probability that one user influences another one is practically zero.
In other terms, the number of calls in a given period of time is Poisson.
This assumption holds until the number of people is large enough with respect to the number of calls, i.e., when a single user does a call once in a while.
If the number of calls per user is larger, one should model also the call duration.
The call duration has been (historically) modeled as Poisson as well. This is of course a very rough approximation, and it has been used only because the Poisson distribution has very nice mathematical properties, like mean, variance, memoryless, duality with exponential distribution, etc.
If you try to use more realistic distributions, things get messy, and formulas start to be extremely complex and they require numerical solutions.
That's why Poisson is used: laziness.
About the packet duration (their size) and their arrival process (Poisson or anything), things are messy as well.
For web browsing it has been demonstrated that message distribution is Weibull or Pareto (two helluva distributions to work with, they have no variance and no mean in some cases). Messages are split into packets (fixed size usually) and sent over the air. This leads to a batch process arrival, where events (the messages) can have a given distribution and size, but the actual packets are fixed size, and their number is dependent on the message size.
The message inter-arrival size, in turns, depends on the previous message size (heck) and its transmission delay. Why? Because a user ask for a new webpage *after* he/she has received and read the previous one.
Summarizing, something that can not be mathematically solved. Search for the Web generation process papers, you'll find some.
Note: this is for web... ftp is a different model, netflix anther one, etc.
Hope this helps,
T.