{"title":"Analysis of a credit manager for traffic regulation in a high speed network system with finite buffer","authors":"Ming-Shan Kwok, R. Yeung","doi":"10.1109/ICCS.1994.474252","DOIUrl":null,"url":null,"abstract":"We investigate a high speed network system with finite buffer subject to flow control by a credit manager. The main purpose of the credit manager is to smooth out the burstiness of the input process, thereby making it easier for the network to handle large amount of data without undue delays, congestion or buffer overflow. We model the system as a quasi-birth-death (QBD) process for which the steady state distribution is obtained by using the folding algorithm. From the steady state distribution of the QBD process, we determine the queue length distribution and the average sojourn time of the packets. The characteristics of such system are investigated and the optimum buffer size can be obtained in the analysis.<<ETX>>","PeriodicalId":158681,"journal":{"name":"Proceedings of ICCS '94","volume":"193 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of ICCS '94","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.1994.474252","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We investigate a high speed network system with finite buffer subject to flow control by a credit manager. The main purpose of the credit manager is to smooth out the burstiness of the input process, thereby making it easier for the network to handle large amount of data without undue delays, congestion or buffer overflow. We model the system as a quasi-birth-death (QBD) process for which the steady state distribution is obtained by using the folding algorithm. From the steady state distribution of the QBD process, we determine the queue length distribution and the average sojourn time of the packets. The characteristics of such system are investigated and the optimum buffer size can be obtained in the analysis.<>