Show simple item record

dc.contributor.authorRananand, N.en_US
dc.date.accessioned2007-05-23T09:56:58Z
dc.date.available2007-05-23T09:56:58Z
dc.date.issued1994en_US
dc.identifier.urihttp://hdl.handle.net/1903/5533
dc.description.abstractWe consider the problem of approximating a variable bit rate (VBR) source by a simple process such that the corresponding buffer-related performance measure are close approximations of the true performance measures. Assuming that a VBR source can be modeled by a discrete-time batch Markovian arrival process (D- BMAP), we propose an approach for approximating it by a ﲭatched Markov process of finite memory obtained by information-theoretic techniques. We confirm analytically that the approximating performance measures become increasingly accurate with the memory of the matched Markov process. When the parameters of the D-BMAP are unknown, we estimate instead the parameters of a suitable Markov approximation from samples of an observed cell stream. We show that the estimated Markov process, with a fixed memory, comes closer with increasing sample size to the D-BMAP, as do the corresponding performance measures, in accordance with the law of iterated logarithm. Numerical examples are presented to illustrate the effectiveness of the approach.en_US
dc.format.extent532352 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1994-59en_US
dc.subjectvariable bit rateen_US
dc.subjectmatched Markov processen_US
dc.subjectdivergenceen_US
dc.subjectlaw of iterated logarithmen_US
dc.subjectcell loss probabilityen_US
dc.subjectaverage cell delayen_US
dc.subjectIntelligent Signal Processing en_US
dc.subjectCommunications Systemsen_US
dc.titleApproximating a Variable Bit Rate Source by Markov Processesen_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record