Random multiple access of broadcast channels with pareto distributed packet interarrival times

Harpantidou, Z; Paterakis, M

dc.contributor.author	Harpantidou, Z	en
dc.contributor.author	Paterakis, M	en
dc.date.accessioned	2014-03-01T01:47:26Z
dc.date.available	2014-03-01T01:47:26Z
dc.date.issued	1998	en
dc.identifier.issn	10709916	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25211
dc.subject.other	Communication channels (information theory)	en
dc.subject.other	Computer simulation	en
dc.subject.other	Mobile telecommunication systems	en
dc.subject.other	Packet networks	en
dc.subject.other	Random processes	en
dc.subject.other	Telecommunication traffic	en
dc.subject.other	Random multiple access	en
dc.subject.other	Broadcasting	en
dc.title	Random multiple access of broadcast channels with pareto distributed packet interarrival times	en
heal.type	journalArticle	en
heal.identifier.primary	10.1109/98.667945	en
heal.identifier.secondary	http://dx.doi.org/10.1109/98.667945	en
heal.publicationDate	1998	en
heal.abstract	We consider the random multiple access of a slotted broadcast communication channel. Packet arrivals for such channels are often modeled as Poisson processes because the latter have attractive theoretical properties and are well understood, even though a number of traffic studies have shown that packet interarrival times are not always exponentially distributed. For example, recent studies argue convincingly that traffic from a variety of working packet networks (LANs, WANs, etc.) is much better modeled using statistically self-similar processes to characterize the packet interarrival times of the aggregate traffic, which have much different properties than Poisson processes. Because of the great influence multiple access algorithms (used in the channel access subsystem) will have on the performance of third-generation digital wireless mobile communication systems, we study in this article the problem of random multiple access under packet traffic generated by interactive data applications (e.g., reading/composing short e-mail messages, responding to paging type messages, transferring files between the mobile and a fixed computer, and querying of a database). We examine and demonstrate the performance robustness of the above RAAs when they are driven by a strongly bursty packet arrival process, commonly found in interactive data applications.	en
heal.journalName	IEEE Personal Communications	en
dc.identifier.doi	10.1109/98.667945	en
dc.identifier.volume	5	en
dc.identifier.issue	2	en
dc.identifier.spage	48	en
dc.identifier.epage	55	en