A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We show that the "fractal" behavior of Internet traffic can be efficiently and practically employed to significantly reduce packet-loss. Thanks to recent advances in the theory of self-similar processes, we define the probabilistic congestion of a link, based on an estimated computation of the packet-loss probability over that link. This congestion parameter allows valid predictions on the future behavior of the network, on which one can base efficient routing strategies. We show how todoi:10.1007/978-3-540-24693-0_90 fatcat:t6coadignrfm5lbvqfwxoul27y