Bandwidth and buffer allocation in a multiservice environment, a priority case

Drigas, AS; Protonotarios, EN

dc.contributor.author	Drigas, AS	en
dc.contributor.author	Protonotarios, EN	en
dc.date.accessioned	2014-03-01T02:40:54Z
dc.date.available	2014-03-01T02:40:54Z
dc.date.issued	1989	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/30272
dc.subject	Analytical Model	en
dc.subject	Computer Network	en
dc.subject	Discrete Time	en
dc.subject	Optimal Policy	en
dc.subject	Parameter Optimization	en
dc.subject	Resource Allocation	en
dc.subject	Timed Systems	en
dc.subject	Traffic Model	en
dc.subject	Integrated Service Digital Network	en
dc.subject	Virtual Circuit	en
dc.subject.other	Computer Networks	en
dc.subject.other	Data Transmission--Packet Switching	en
dc.subject.other	Probability--Random Processes	en
dc.subject.other	Buffer Allocation	en
dc.subject.other	ISDN Multiserver System	en
dc.subject.other	Resource Allocation	en
dc.subject.other	Slotted Time Systems	en
dc.subject.other	Throughput Optimizartion	en
dc.subject.other	Digital Communication Systems	en
dc.title	Bandwidth and buffer allocation in a multiservice environment, a priority case	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/MELCON.1989.50113	en
heal.identifier.secondary	http://dx.doi.org/10.1109/MELCON.1989.50113	en
heal.publicationDate	1989	en
heal.abstract	The authors examine resource allocation aspects in an ISDN (integrated services digital network) or in a computer network where more than one packet class is distinguished in cases of random contention for M identical resources from two or more statistically different packet types. Particular attention is focused on sharing bandwidth among voice and data virtual circuits, and sharing buffer before a multiserver system. Generally speaking the problem is to determine the optimal policy for accepting or rejecting a call when the type of the requesting packet is known. The optimal choice of buffer size and bandwidth is involved in the design of the service facility as well as the rules for sharing resources among users. The objective of this study is to develop analytical models and computational algorithms for the determination of the state subset with better performance for slotted time systems, with call traffic modeled as stationary independent arrival processes and with service time modeled as a general discrete time distribution. The parameters optimized are throughput, utilization, and blocking of the system.	en
heal.publisher	Publ by IEEE, Piscataway, NJ, United States	en
heal.journalName	[No source information available]	en
dc.identifier.doi	10.1109/MELCON.1989.50113	en
dc.identifier.spage	586	en
dc.identifier.epage	589	en