Show simple item record

dc.contributor.authorEchagüe Guardiola, Juan
dc.contributor.authorCholvi, Vicent
dc.date.accessioned2012-05-02T06:45:59Z
dc.date.available2012-05-02T06:45:59Z
dc.date.issued2010
dc.identifier.citationInformatica (2010) vol. 21, no. 1, p. 31-40ca_CA
dc.identifier.issn0868-4952
dc.identifier.urihttp://hdl.handle.net/10234/35960
dc.description.abstractAs a means of supporting quality of service guarantees, aggregate multiplexing has attracted a lot of attention in the networking community, since it requires less complexity than flow-based scheduling. However, contrary to what happens in the case of flow-based multiplexing, few results are available for aggregate-based multiplexing. In this paper, we consider a server multiplexer fed by several flows and analyze the impact caused by traffic aggregation on the flows at the output of the server. No restriction is imposed on the server multiplexer other than the fact that it must operate in a work- conserving fashion. We characterize the best arrival curves that constrain the number of bits that leave the server, in any time interval, for each individual flow. These curves can be used to obtain the delays suffered by packets in complex scenarios where multiplexers are interconnected, as well as to determine the maximum size of the buffers in the different servers. Previous results provide tight delay bounds for networks where servers are of the FIFO type. Here, we provide tight bounds for any work-conserving scheduling policy, so that our results can be applied to heterogeneous networks where the servers (routers) can use different work-conserving scheduling policies such as First-In First-Out (FIFO), Earliest Deadline First (EDF), Strict Priority (SP), Guaranteed Rate scheduling (GR), etc.ca_CA
dc.format.extent12 p.ca_CA
dc.format.mimetypeapplication/pdfca_CA
dc.language.isoengca_CA
dc.publisherIOS Pressca_CA
dc.relation.isFormatOfPostprint del document publicat a http://www.iospress.nl/journal/informatica/ca_CA
dc.rights© IOS Pressca_CA
dc.subjectPerformance evaluationca_CA
dc.subjectAggregate schedulingca_CA
dc.subjectBlind multiplexingca_CA
dc.subjectArrival curveca_CA
dc.subject.lcshMultiplexingca_CA
dc.subject.lcshSystems engineeringca_CA
dc.subject.otherMultiplexatgeca_CA
dc.subject.otherEnginyeria de sistemesca_CA
dc.titleTight arrival curve at the output of a work-conserving blind multiplexing serveca_CA
dc.typeinfo:eu-repo/semantics/articleca_CA
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessca_CA


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record