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

Authors:
Xenia Mountrouidou;Harry Perros
Affiliations:
IBM, 4205 S. Miami Blvd. Durham, NC 27703, USA;Computer Science Department, North Carolina State University, Raleigh, NC 27695, USA
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2009

Citing 6
Cited 1

The Markov-modulated Poisson process (MMPP) cookbook

Performance Evaluation
Queueing networks with blocking

Queueing networks with blocking
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems
Characterization of the burst aggregation process in optical burst switching

NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Burst assembly with real IPv4 data – performance assessement of three assembly algorithms

NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
Burst-cluster transmission: service differentiation mechanism for immediate reservation in optical burst switching networks

IEEE Communications Magazine

Equivalent random analysis of a buffered optical switch with general interarrival times

SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.