HEAL DSpace

Bandwidth and buffer allocation in a multiservice environment for multirate signals

Αποθετήριο DSpace/Manakin

Εμφάνιση απλής εγγραφής

dc.contributor.author Drigas, AS en
dc.contributor.author Protonotarious, EN en
dc.date.accessioned 2014-03-01T02:47:50Z
dc.date.available 2014-03-01T02:47:50Z
dc.date.issued 1988 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/33384
dc.relation.uri http://www.scopus.com/inward/record.url?eid=2-s2.0-0024123455&partnerID=40&md5=3771de06bffca3b07d125e0b6715b929 en
dc.subject.other Data Storage, Digital en
dc.subject.other Digital Communication Systems en
dc.subject.other Abstract Only en
dc.subject.other Bandwidth Sharing en
dc.subject.other Buffer Allocation en
dc.subject.other Multiserver System en
dc.subject.other Resource Allocation en
dc.subject.other Data Transmission en
dc.title Bandwidth and buffer allocation in a multiservice environment for multirate signals en
heal.type conferenceItem en
heal.publicationDate 1988 en
heal.abstract Summary form given only, as follows. Resource allocation is considered in cases of random contention for M identical resources from two statistically different customer types. In particular, attention is focused on sharing bandwidth among customer classes or allocating packets in a buffer before a multiserver system. These two problems can be commonly formulated. The general problem is to determine the optimal policy for accepting or rejecting a call when the type of requesting customer is known as well as the state vector which has as components the numbers of customers of each type that are in service. The optimal choice of buffer size and bandwidth is involved in the design of service facility as well as the rules of sharing resources among users. The objective of this study was to develop analytical 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 service time modeled as a general discrete time distribution. The parameters optimized are the ones generally accepted as throughput, utiliztion and blocking of the system. In addition quantitative estimates for the relative optimum throughput, utilization and blocking are obtained. en
heal.publisher Publ by IEEE, New York, NY, USA en
heal.journalName [No source information available] en
dc.identifier.volume 25 n 13 en
dc.identifier.spage 160 en


Αρχεία σε αυτό το τεκμήριο

Αρχεία Μέγεθος Μορφότυπο Προβολή

Δεν υπάρχουν αρχεία που σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στην ακόλουθη συλλογή(ές)

Εμφάνιση απλής εγγραφής