When many flows are multiplexed on a non-saturated link, their volume changes over short timescales tend to cancel each other out, making the average change across flows close to ...
Fernando Silveira, Christophe Diot, Nina Taft, Ram...
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
Zero Queueing Flow Control (ZQFC) is a new creditbased flow control method for ATM networks. The receiving node of such a flow-controlled link will have zero queueoccupancy in the...
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Abstract--After the seminal work by Taqqu et al. relating selfsimilarity to heavy-tailed distributions, a number of research articles verified that aggregated Internet traffic time...