On the departure process of burst aggregation algorithms in optical burst switching

We characterize analytically the departure process from the following three burst aggregation algorithms: the time based aggregation algorithm, the burst-length based aggregation algorithm and the time and burst-length based aggregation algorithm. The arrival process of packets is assumed to be Poisson or bursty modeled by an Interrupted Poisson Process (IPP). The analytic results are approximate and validation against simulation data showed that they have good accuracy.