The Santa Claus packet dilemma, all those chimneys and so little time.
. A packet session
Next it is described how these four different events are modelled. The geometrical distribution is used (discrete representation of the exponential distribution), since the simulations are using discrete time scale [1].
Session arrival process: The arrival of session set-ups to the network is modelled as a Poisson process. It is important to note that this process only generates the time instants when service calls begin and it has nothing to do with call termination.
The number of packet call requests per session, Npc: This is a geometrically distributed random variable with a mean mNpc [packet calls], i.e.,
.
The reading time between two consecutive packet call requests in a session, Dpc: : This is a geometrically distributed random variable with a mean mDpc [model time steps], i.e.,
.
Note that the reading time starts when the last packet of the packet call is completely received by the user. The reading time ends when the user makes a request for the next packet call.
Packet call size, Sd: The traffic model can use such packet call size distribution that suits best for the traffic case under study. Pareto distribution is used.
In Table 1 default mean values for the distributions of typical www service are given. According to the values for a and k in the Pareto distribution, the average packet call size is set to 25 kbytes. The parameters of heavy-tailed Pareto distribution (packet call size) has been tailored to reduce the simulation time, thus packet call size can vary between 4.5 kbytes and 2Mbytes
----
My field studies implies 10kB for the Nokia share graph on
HEX, only 8 seconds on legacy GSM, 2s on the communicator,
but 8-10MB for nakednews, even more needed to have some
decent movements and details to enjoy, back and forth.
The Clinton farewell clip was 16MB, but can surely be
compressed further in the future, just a matter of
term and other limits.
Anyway, Nokia has already ordered 64MB memory chips from
Samsung, probably good enough for the next US elections
and MMS??
Ilmarinen
If Bore runs, the compression algorithms might be even
more efficient, not many moving objects to track.
(what was this thing about him in a room full of whatever
they were agents??)
Btw, the good old danish Erlang clearly rock'n rolls in his grave |
