Pub Date : 2005-03-01DOI: 10.1016/j.peva.2004.08.004
S. Haddad, P. Moreaux, M. Sereno, M. Suárez
{"title":"Product-form and stochastic Petri nets: a structural approach","authors":"S. Haddad, P. Moreaux, M. Sereno, M. Suárez","doi":"10.1016/j.peva.2004.08.004","DOIUrl":"https://doi.org/10.1016/j.peva.2004.08.004","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"1 1","pages":"313-336"},"PeriodicalIF":0.0,"publicationDate":"2005-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78222922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-03-01DOI: 10.1016/j.peva.2004.06.003
I. Moscholios, M. Logothetis, G. Kokkinakis
{"title":"Call-burst blocking of ON-OFF traffic sources with retrials under the complete sharing policy","authors":"I. Moscholios, M. Logothetis, G. Kokkinakis","doi":"10.1016/j.peva.2004.06.003","DOIUrl":"https://doi.org/10.1016/j.peva.2004.06.003","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"35 1","pages":"279-312"},"PeriodicalIF":0.0,"publicationDate":"2005-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81249256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Konstantin Avrachenkov, N. O. Vilchevsky, G. Shevlyakov
The non-preemptive priority queueing with a flnite bufier is considered. We introduce a randomized push-out bufier management mechanism which allows to control very e‐ciently the loss probability of priority packets. The packet loss probabilities for priority and non-priority tra‐c are calculated using the generating function approach. In the particular case of the standard non-randomized push-out scheme we obtain explicit analytic expressions. The theoretical results are illustrated by numerical examples. The randomized push-out scheme is compared with the threshold based push-out scheme. It turns out that the former is much easier to tune than the latter. The proposed scheme can be applied to the Difierentiated Services of the Internet.
{"title":"Priority queueing with finite buffer size and randomized push-out mechanism","authors":"Konstantin Avrachenkov, N. O. Vilchevsky, G. Shevlyakov","doi":"10.1145/781027.781079","DOIUrl":"https://doi.org/10.1145/781027.781079","url":null,"abstract":"The non-preemptive priority queueing with a flnite bufier is considered. We introduce a randomized push-out bufier management mechanism which allows to control very e‐ciently the loss probability of priority packets. The packet loss probabilities for priority and non-priority tra‐c are calculated using the generating function approach. In the particular case of the standard non-randomized push-out scheme we obtain explicit analytic expressions. The theoretical results are illustrated by numerical examples. The randomized push-out scheme is compared with the threshold based push-out scheme. It turns out that the former is much easier to tune than the latter. The proposed scheme can be applied to the Difierentiated Services of the Internet.","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"147 1","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"2003-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79626863","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2002-01-01DOI: 10.1016/S0166-5316(01)00054-2
M. Naldi
{"title":"A mixture model for the connection holding times in the Video-on-Demand service","authors":"M. Naldi","doi":"10.1016/S0166-5316(01)00054-2","DOIUrl":"https://doi.org/10.1016/S0166-5316(01)00054-2","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"30 1","pages":"23-41"},"PeriodicalIF":0.0,"publicationDate":"2002-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87953015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Gelenbe Networks (G-networks) are a class of queuing models which include new types of customers called "signals," which are either "negative customers" and "triggers" [1, 2]. Queuing networks typically do not have provisions for some customers being used to eliminate other customers, or to redirect other customers among the queues. In other words, customers in traditional queuing netwroks cannot exert direct control on other customers. G-network models overcome some of these limitations and still preserve the computationally attractive "product form" property of certain Marovian queuing networks. In addition to ordinary customers, G-networks contain "negative customers" which eliminate normal customers, and "triggers" which move other customers from some queue to another [4, 5]. Multiple class versions of these models are discussed in [7, 8], and in [9] many additional results are provided. These queuing networks have generated much interest in the literature.
{"title":"G-networks with resets","authors":"E. Gelenbe, J. Fourneau","doi":"10.1145/507553.507560","DOIUrl":"https://doi.org/10.1145/507553.507560","url":null,"abstract":"Gelenbe Networks (G-networks) are a class of queuing models which include new types of customers called \"signals,\" which are either \"negative customers\" and \"triggers\" [1, 2]. Queuing networks typically do not have provisions for some customers being used to eliminate other customers, or to redirect other customers among the queues. In other words, customers in traditional queuing netwroks cannot exert direct control on other customers. G-network models overcome some of these limitations and still preserve the computationally attractive \"product form\" property of certain Marovian queuing networks. In addition to ordinary customers, G-networks contain \"negative customers\" which eliminate normal customers, and \"triggers\" which move other customers from some queue to another [4, 5]. Multiple class versions of these models are discussed in [7, 8], and in [9] many additional results are provided. These queuing networks have generated much interest in the literature.","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"32 1","pages":"179-191"},"PeriodicalIF":0.0,"publicationDate":"2001-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73373284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We analyze in this paper the performance of TCP/IP-like congestion control in the presence of random losses. The input rate in the control scheme that we consider has a linear growth rate; whenever a loss occurs, the input rate is halved. This approximates the performance of several versions of TCP/IP that divide their congestion window by two whatever is the cause of the loss. We propose a mathematical model that allows to account for burstiness as well as for correlation in the loss process. Our aim is to study the impact of burstiness on the throughput of the connection. We compute the expected instantaneous input rate and its moments at some potential loss instants, and provide for a useful implicit expression for the Laplace Stieltjis Transform. This allows us to compute explicitly the average throughput and its moments. We show that the average throughput is indeed sensitive to the distribution of the loss process, and not just to the average loss rate: for a given average loss rate, we show that the throughput increases with the burstiness of the loss process. We finally examine the impact of burstiness of losses on the throughput variability.
{"title":"TCP in presence of bursty losses","authors":"E. Altman, Konstantin Avrachenkov, C. Barakat","doi":"10.1145/339331.350541","DOIUrl":"https://doi.org/10.1145/339331.350541","url":null,"abstract":"We analyze in this paper the performance of TCP/IP-like congestion control in the presence of random losses. The input rate in the control scheme that we consider has a linear growth rate; whenever a loss occurs, the input rate is halved. This approximates the performance of several versions of TCP/IP that divide their congestion window by two whatever is the cause of the loss. We propose a mathematical model that allows to account for burstiness as well as for correlation in the loss process. Our aim is to study the impact of burstiness on the throughput of the connection. We compute the expected instantaneous input rate and its moments at some potential loss instants, and provide for a useful implicit expression for the Laplace Stieltjis Transform. This allows us to compute explicitly the average throughput and its moments. We show that the average throughput is indeed sensitive to the distribution of the loss process, and not just to the average loss rate: for a given average loss rate, we show that the throughput increases with the burstiness of the loss process. We finally examine the impact of burstiness of losses on the throughput variability.","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"138 1","pages":"129-147"},"PeriodicalIF":0.0,"publicationDate":"2000-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91342853","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1999-09-01DOI: 10.1016/S0166-5316(99)00012-7
A. Adas, A. Mukherjee
{"title":"Providing Heterogeneous Quality of Service Bounds for Correlated Video Traffic at a Multiplexor","authors":"A. Adas, A. Mukherjee","doi":"10.1016/S0166-5316(99)00012-7","DOIUrl":"https://doi.org/10.1016/S0166-5316(99)00012-7","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"2014 1","pages":"45-65"},"PeriodicalIF":0.0,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86777541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-09-14DOI: 10.1007/3-540-68061-6_23
Hai Wang, K. Sevcik
{"title":"Experiments with Improved Approximate Mean Value Analysis Algorithms","authors":"Hai Wang, K. Sevcik","doi":"10.1007/3-540-68061-6_23","DOIUrl":"https://doi.org/10.1007/3-540-68061-6_23","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"56 1","pages":"189-206"},"PeriodicalIF":0.0,"publicationDate":"1998-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83348212","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-04-01DOI: 10.1016/S0166-5316(97)00020-5
M. M. Asrin, F. Kamoun
{"title":"A Transient Discrete-Time Queueing Analysis of the ATM Multiplexer","authors":"M. M. Asrin, F. Kamoun","doi":"10.1016/S0166-5316(97)00020-5","DOIUrl":"https://doi.org/10.1016/S0166-5316(97)00020-5","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"10 1","pages":"153-183"},"PeriodicalIF":0.0,"publicationDate":"1998-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82343205","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：