Modeling of cell delineation procedure in ATM network

The purpose of this paper is to research the synchronization properties of a cell delineation (CD) process in ATM networks. We demonstrate the CD process probabilistic model as a sequence of discrete states. Cooperation of these states is specified by a semi-Markovian process. One of the basic components of this process, that defines possibility of false per-cell synchronization, is the HUNT state. To analyze the basic characteristics of the HUNT state; we create a Markov chain oriented model. This model takes into consideration the properties of the cell header error control (HEC) redundant cyclic code. Besides, we take into account two channel error models which are relevant to fiber-optic channels. The first model is the Bernoulli memoryless one. The second model corresponds to the two state simple Markov chain. We present a computer algorithm to evaluate analytically the probability of false synchronization. The numerical results are demonstrated and discussed.