<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/32E9C265-FD60-47DA-8F66-6409536CE07E"><efrbr-work:titleOfTheWork>Measurement based Connection Admission Control algorithm for ATM networks that use low level compression</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/32E9C265-FD60-47DA-8F66-6409536CE07E"><efrbr-expression:titleOfTheExpression>Measurement based Connection Admission Control algorithm for ATM networks that use low level compression</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Πλήρης Δημοσίευση σε Συνέδριο
            Conference Full Paper
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-11-16</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2000</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>Since ATM switches are intented to be simple and inexpensive, a significant part of the network cost is in the cost of the links. A way of increasing the traffic we can send over these expensive links is to transmit compressed ATM cells. This idea, although it seems very simple, is a new one for ATM and as we show it can signicantly increase the useful bandwidth of a typical ATM network. In this paper the CAC algorithm that can be effectively used in a network which uses this compression scheme is also described and the results that can be achieved when this algorithm is used in a real network are presented. This CAC algorithm is based on Large Deviation Theory: the large deviation rate-function (entropy) of compressed (and thus more bursty) ATM traffic can be estimated from measurements of trffic activity. The entropy can be used to determine the bandwidth requirement of the traffic.</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="page range">49-60</efrbr-expression:note><efrbr-expression:note type="conference name">7th International Conference on Intelligence in Services and Networks, ISandN 2000</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~ipapaefstathiou"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Papaefstathiou Ioannis
            Παπαευσταθιου Ιωαννης
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="http://www.springerlink.com/?MUD=MP"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="S/R:PUBLISHERS">
            Springer Verlag
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" targetEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/32E9C265-FD60-47DA-8F66-6409536CE07E" targetURI="http://purl.tuc.gr/dl/dias/32E9C265-FD60-47DA-8F66-6409536CE07E"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/32E9C265-FD60-47DA-8F66-6409536CE07E" targetURI="http://users.isc.tuc.gr/~ipapaefstathiou"/><efrbr-responsible:realizedBy sourceEntity="expression" role="author" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/32E9C265-FD60-47DA-8F66-6409536CE07E" targetURI="http://users.isc.tuc.gr/~ipapaefstathiou"/><efrbr-responsible:realizedBy sourceEntity="expression" role="publisher" targetEntity="person" sourceURI="http://purl.tuc.gr/dl/dias/32E9C265-FD60-47DA-8F66-6409536CE07E" targetURI="http://www.springerlink.com/?MUD=MP"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations/><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>