BANDWIDTH AND BUFFER ALLOCATION FOR MULTIRATE SIGNALS.

Drigas, AS; Protonotarios, EN; Stassinopoulos, GI; Sykas, ED

dc.contributor.author	Drigas, AS	en
dc.contributor.author	Protonotarios, EN	en
dc.contributor.author	Stassinopoulos, GI	en
dc.contributor.author	Sykas, ED	en
dc.date.accessioned	2014-03-01T02:47:48Z
dc.date.available	2014-03-01T02:47:48Z
dc.date.issued	1987	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33349
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0023171448&partnerID=40&md5=af60e15425cfc12abefb1e63dbe9c487	en
dc.subject.other	PROBABILITY	en
dc.subject.other	BANDWIDTH/BUFFER ALLOCATION	en
dc.subject.other	DATA/VOICE/VIDEO TRAFFIC	en
dc.subject.other	MULTIRATE SIGNALS	en
dc.subject.other	RESOURCE ALLOCATION	en
dc.subject.other	SLOTTED-TIME SYSTEMS	en
dc.subject.other	DIGITAL COMMUNICATION SYSTEMS	en
dc.title	BANDWIDTH AND BUFFER ALLOCATION FOR MULTIRATE SIGNALS.	en
heal.type	conferenceItem	en
heal.publicationDate	1987	en
heal.abstract	Resource allocation aspects are considered in cases of random contention of M identical resources from K statistically different customer types. Particular attention is focused on data, voice, and video traffic within the ISDN framework. The general problem is to determine the optimal policy for accepting or rejecting a call when the type of the requesting customer is known as well as the state vector which has as its components the numbers of customers of each type that are being serviced. The objective of this study is to develop analytic models and computational algorithms for the determination of the optimal state subset for slotted-time systems with call traffic modeled as stationary independent arrival processes and with deterministic service time. The parameters optimized are the ones generally accepted, as throughput, utilization and blocking of the system.	en
heal.publisher	IEEE, New York, NY, USA	en
heal.journalName	[No source information available]	en
dc.identifier.spage	265	en
dc.identifier.epage	269	en