dc.creatorPereira, FD
dc.creatorda Fonseca, NLS
dc.creatorArantes, DS
dc.date2002
dc.dateOCT 22
dc.date2014-11-13T23:20:00Z
dc.date2015-11-26T16:03:10Z
dc.date2014-11-13T23:20:00Z
dc.date2015-11-26T16:03:10Z
dc.date.accessioned2018-03-28T22:52:28Z
dc.date.available2018-03-28T22:52:28Z
dc.identifierComputer Networks. Elsevier Science Bv, v. 40, n. 3, n. 413, n. 431, 2002.
dc.identifier1389-1286
dc.identifierWOS:000178520200007
dc.identifier10.1016/S1389-1286(02)00303-1
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/68748
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/68748
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/68748
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1265213
dc.descriptionThis paper introduces the computation of delay and backlog bounds for a generalized processor sharing (GPS) server under long-range dependent (LRD) traffic. The traffic is supposed to be regulated by the Fractal Leaky Bucket policing mechanism, which is an appropriate regulator for LRD traffic. Results are extended to a network of GPS servers with arbitrary topology, and the stability of those networks is analysed. (C) 2002 Elsevier Science B.V. All rights reserved.
dc.description40
dc.description3
dc.description413
dc.description431
dc.languageen
dc.publisherElsevier Science Bv
dc.publisherAmsterdam
dc.publisherHolanda
dc.relationComputer Networks
dc.relationComput. Netw.
dc.rightsfechado
dc.rightshttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dc.sourceWeb of Science
dc.subjectself-similar traffic
dc.subjectFractal traffic
dc.subjectscheduling
dc.subjectIntegrated Services Networks
dc.subjectFractional Brownian-motion
dc.subjectFlow-control
dc.subjectCalculus
dc.subjectDelay
dc.titleOn the performance of generalized processor sharing servers under long-range dependent traffic
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución