Properties andperformancemodellingoffinitebuffer M/G/1/K networks

Finite buffer,single-serverqueueingsystemsandnetworksaredifficulttoanalyzesincethelengthof time acustomerspendsinthesystemdoesnotfollowtheMarkovianproperty.Atwo-moment approximationschemaisdevelopedfortheprobabilitydistributionof M/G/1/K systems andextendedto the analysisof M/G/1/K queueingnetworks.Thegeneralpurposeofthispaperistodevelopaflexible and practicaltransform-freeapproachforcomputingtheprobabilitydistributionandperformance measuresofthesystemaswellasidentifytheunderlyingpropertiesofthesesystems.Itisshownthat for mostperformancemeasures,asigmoidorS-shapedcurvewithaninflectionpointat r ¼ 1 appears as K-1. Thishasdirectimplicationsfortheanalysisandoptimizationofsuchsystems.The performancemodellingofthe M/G/1/K queueingnetworksofgeneraltopologiesalongwithextensive numericalresultsaccompanythepaperalongwiththelinearconcaveperformancemeasuresforthese systems.