We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
The paper presents a new analytical saturation throughput model of IEEE 802.11 DCF (Distributed Coordination Function) with basic access in adhoc mode. The model takes into account...
We introduce two throughput metrics referred to as flow- and time-sampled throughputs. The former gives the throughput statistics of an arbitrary flow while the latter weights t...
Web prefetching mechanisms have been proposed to benefit web users by hiding the download latencies. Nevertheless, to the knowledge of the authors, there is no attempt to compare...