Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Jitter-based analysis and discussion of burst assembly algorithms
 

Summary: Jitter-based analysis and discussion of burst
assembly algorithms
Javier Aracil, Jos´e Alberto Hern´andez, Kyriakos Vlachos, Emmanouel Varvarigos
Universidad Aut´onoma de Madrid, Spain, e-mail: {javier.aracil,jose.hernandez}@uam.es
RACTI, University of Patras, e-mail: {kvlachos,manos}@ceid.upatras.gr
Abstract-- This work provides a jitter analysis of size-based
burst assembly algorithms and also discusses other burst assem-
bly algorithms that use the packet delay as the assembly threshold
to provide a bound on jitter.
Index Terms-- Optical Burst Switching, TAVE, burst-assembly.
I. INTRODUCTION
In Optical Burst Switched networks (OBS) [1], packets
are assembled into large-size optical bursts at the ingress
nodes. Such packets traverse all-optically the network, thus
suffering only two types of delay apart from propagation delay:
burst-assembly delay and offset time. The former comprises
the time that packets have to wait until the optical burst
is made, whereas the latter relates to the amount of time
the Burst Control Packet is sent in advanced of the data
bursts [1]. The BCP is sent ahead on attempts to reduce

  

Source: Rico, Javier Aracil - Departamento de Ingeniería Informática, Universidad Autonoma de Madrid
Vlachos, Kyriakos G. - Department of Computer Engineering and Informatics, University of Patras

 

Collections: Computer Technologies and Information Sciences