Abstract
We describe an analytic approach for the calculation of the departure process from a burst ggregation algorithm that uses both a timer and maximum/minimum burst size. The arrival process of packets is assumed to be Poisson or bursty modelled by an Interrupted Poisson Process (IPP). The analytic results are approximate and validation against simulation data showed that they have good accuracy. © IFIP International Federation for Information Processing 2006.
Cite
CITATION STYLE
Mountrouidou, X., & Perros, H. G. (2006). Characterization of the burst aggregation process in optical burst switching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3976 LNCS, pp. 752–764). Springer Verlag. https://doi.org/10.1007/11753810_63
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.