A LOWER BOUND FOR CUMULATIVE SELF-SIMILARPROCESSESAND BURST ASSEMBLY ALGORITHMS Hellinton HatsuoTakada andAlessandro Anzaloni
S. J. dosCampos · 2006
Inthis paper, weintroduce aprobabilistic lower boundfor theamount ofworkarrived forself-similar processes. The obtained boundisaccurate andtight. IntheOptical Burst Switching context, using thedeveloped lower boundwe obtained ananalytical expression fortheminimumburst lengthgenerated by a timer-based burstassembly algorithm, themaximumdelay imposed byaburstlengthbased burst assembly algorithm andproject constraints of amixedtimer/burstlengt h-based burst assembly algorithm whentheincoming traffic isself-similar. Ourresults are veryuseful whendesigning optical burstswitching networks andanalyzing theperformance of burst assembly algorithms atthepresence ofself-similarity.