A Lower Bound for Cumulative Self-Similar Processes and Burst Assembly Algorithms

Hellinton  Hatsuo Takada; Alessandro  Anzaloni

1st International ICST Conference on Communications and Networking in China

Research Article

A Lower Bound for Cumulative Self-Similar Processes and Burst Assembly Algorithms

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/CHINACOM.2006.344738,
    author={Hellinton  Hatsuo Takada  and  Alessandro  Anzaloni},
    title={A Lower Bound for Cumulative Self-Similar Processes and Burst Assembly Algorithms},
    proceedings={1st International ICST Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2007},
    month={4},
    keywords={},
    doi={10.1109/CHINACOM.2006.344738}
}

Hellinton Hatsuo Takada
Alessandro Anzaloni
Year: 2007
A Lower Bound for Cumulative Self-Similar Processes and Burst Assembly Algorithms
CHINACOM
IEEE
DOI: 10.1109/CHINACOM.2006.344738

Hellinton Hatsuo Takada ^1,2, Alessandro Anzaloni^1,2

1: Department of Telecommunications Aeronautical Institute of Technology
2: S. J. dos Campos, Brazil

Abstract

In this paper, we introduce a probabilistic lower bound for the amount of work arrived for self-similar processes. The obtained bound is accurate and tight. In the optical burst switching context, using the developed lower bound we obtained an analytical expression for the minimum burst length generated by a timer-based burst assembly algorithm, the maximum delay imposed by a burstlength-based burst assembly algorithm and project constraints of a mixed timer/burstlength-based burst assembly algorithm when the incoming traffic is self-similar. Our results are very useful when designing optical burst switching networks and analyzing the performance of burst assembly algorithms at the presence of self-similarity.

Published: 2007-04-10
Publisher: IEEE

: http://dx.doi.org/10.1109/CHINACOM.2006.344738