Combined URN and TDMA scheme for multiple-access protocols

Sykas, E; Karvelas, D; Protonotarios, E

dc.contributor.author	Sykas, E	en
dc.contributor.author	Karvelas, D	en
dc.contributor.author	Protonotarios, E	en
dc.date.accessioned	2014-03-01T01:06:08Z
dc.date.available	2014-03-01T01:06:08Z
dc.date.issued	1983	en
dc.identifier.issn	0140-3664	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9187
dc.subject	local area networks	en
dc.subject	multiple-access protocols	en
dc.subject	RTDMA	en
dc.subject	TDMA	en
dc.subject	URN	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.title	Combined URN and TDMA scheme for multiple-access protocols	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/0140-3664(83)90059-2	en
heal.identifier.secondary	http://dx.doi.org/10.1016/0140-3664(83)90059-2	en
heal.language	English	en
heal.publicationDate	1983	en
heal.abstract	Local area networks provide communications facilities for high-speed data transfer between computers and erminals within a limited geographical district. The investigation of methods of improving the throughput-delay behaviour of such systems, even under heavy traffic conditions, is an open and challenging research area. A new family of hybrid multiple-access protocols is proposed for contention resolution in local networks. These protocols are a combination of random and deterministic multiple-access protocols. A dynamic frame construction is used. The frame consists of a status slot, followed by an RTDMA period and a URN period. This scheme provides stability under any circumstances and allows for control mechanisms so that good throughput-delay characteristics can be achieved. Analysis shows that the proposed protocols behave better than the isolated URN or RTDMA schemes, exhibiting low access time under normal traffic, while under heavy traffic, channel utilization remains high and the delay at acceptable levels. © 1983.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Computer Communications	en
dc.identifier.doi	10.1016/0140-3664(83)90059-2	en
dc.identifier.isi	ISI:A1983RE25500005	en
dc.identifier.volume	6	en
dc.identifier.issue	4	en
dc.identifier.spage	199	en
dc.identifier.epage	207	en