In this paper we study the impact of statistical multiplexing on leaky-bucket regulated traffic streams as they pass through the network. In particular we show that the burstiness of a flow is randomized as it transits through the nodes with mean equal to its initial burstiness value at the ingress. We then show that the random burstiness for a single flow converges to a constant equal to the initial value at the ingress when the flow is multiplexed with a large number of sources. The results do not depend on independence or homogeniety between flows. We conclude by providing some simulation results that confirm the theory. © IFIP International Federation for Information Processing 2005.
CITATION STYLE
Ying, Y., Mazumdar, R., Rosenberg, C., & Guillemin, F. (2005). The burstiness behavior of regulated flows in networks. In Lecture Notes in Computer Science (Vol. 3462, pp. 918–929). Springer Verlag. https://doi.org/10.1007/11422778_74
Mendeley helps you to discover research relevant for your work.