Shaping of traffic streams through data spacing

Mitrou, N

dc.contributor.author	Mitrou, N	en
dc.date.accessioned	2014-03-01T01:15:12Z
dc.date.available	2014-03-01T01:15:12Z
dc.date.issued	1999	en
dc.identifier.issn	1089-7798	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/13373
dc.subject	effective rate	en
dc.subject	shaping	en
dc.subject	statistical multiplexing	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Algorithms	en
dc.subject.other	Computer simulation	en
dc.subject.other	Congestion control (communication)	en
dc.subject.other	Markov processes	en
dc.subject.other	Queueing theory	en
dc.subject.other	Statistical methods	en
dc.subject.other	Telecommunication traffic	en
dc.subject.other	Effective-rate-enforcement mechanisms	en
dc.subject.other	Statistical multiplexing	en
dc.subject.other	Traffic shaping algorithms	en
dc.subject.other	Multiplexing	en
dc.title	Shaping of traffic streams through data spacing	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/4234.798024	en
heal.identifier.secondary	http://dx.doi.org/10.1109/4234.798024	en
heal.language	English	en
heal.publicationDate	1999	en
heal.abstract	A traffic shaping algorithm, based on suitable spacing of data units, is proposed and validated both theoretically and by simulation. It ensures a `tight' upper bound to the queue-length distribution at subsequent multiplexing stages, being essentially an effective-rate-enforcement mechanism in the asymptotic regime. It does not presume any stationarity, homogeneity or Markovian property of the input streams.	en
heal.publisher	IEEE, Piscataway, NJ, United States	en
heal.journalName	IEEE Communications Letters	en
dc.identifier.doi	10.1109/4234.798024	en
dc.identifier.isi	ISI:000083398800008	en
dc.identifier.volume	3	en
dc.identifier.issue	10	en
dc.identifier.spage	300	en
dc.identifier.epage	302	en