### Abstract

In this paper we present a definition of burstiness for delay sensitive traffic streams in terms of a function, i.e., the cell loss probability of a bufferless multiplexer at all non-negative link capacities. Some properties of the definition are proved. On property implies any definition of burstiness in terms of a real number may not be appropriate. The other property implies the commonly used moment matching method in approximating traffic sources may not be appropriate either. We also present a quantization algorithm for networks which provide only finitely many bit rates for describing traffic characteristics. Our proposed quantization algorithm guarantees the quantized version is always burstier than the original source and thus can be used to design call admission control scheme for ATM networks.

Original language | English |
---|---|

Pages (from-to) | 377-383 |

Number of pages | 7 |

Journal | Proceedings - IEEE INFOCOM |

Volume | 1 |

DOIs | |

State | Published - 1 Jan 1996 |

Event | Proceedings of the 1996 15th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'96. Part 1 (of 3) - San Francisco, CA, USA Duration: 24 Mar 1996 → 28 Mar 1996 |

## Fingerprint Dive into the research topics of 'Definition of burstiness and quantization for delay sensitive traffic streams'. Together they form a unique fingerprint.

## Cite this

*Proceedings - IEEE INFOCOM*,

*1*, 377-383. https://doi.org/10.1109/INFCOM.1996.497916