Buffer Overflow Probabilities for a Multiplexer with Self- Similar Traffic
| dc.contributor.author | Parulekar, M. | en_US |
| dc.contributor.author | Makowski, Armand M. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.contributor.department | CSHCN | en_US |
| dc.date.accessioned | 2007-05-23T10:01:03Z | |
| dc.date.available | 2007-05-23T10:01:03Z | |
| dc.date.issued | 1995 | en_US |
| dc.description.abstract | We study the large buffer asymptotics of a multiplexer under two different self-similar traffic inputs, namely the so-called M G model of Cox and the fractional Gaussian noise input model. In the former case we show that the tail probabilities for the buffer content (in steady-state) decay at most hyperbolically. This is contrasted with the situation where the input traffic is fractional Gaussian noise, in which case the tail probabilities display a Weibullian character. Therefore, for a given input rate rin and Hurst parameter H, these dissimilar asymptotics would result in vastly differing buffer engineering practices, which points somewhat to the inadequacy of using H as the sole parameter to characterize long-range dependence. | en_US |
| dc.format.extent | 1691241 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/5727 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1995-67 | en_US |
| dc.relation.ispartofseries | CSHCN; TR 1995-25 | en_US |
| dc.subject | queueing networks | en_US |
| dc.subject | resource allocation | en_US |
| dc.subject | Intelligent Signal Processing | en_US |
| dc.subject | Communications Systems | en_US |
| dc.title | Buffer Overflow Probabilities for a Multiplexer with Self- Similar Traffic | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1