{"title":"高速网络中信用管理器的往返时间分配","authors":"K. K. Leung, B. Sengupta, R. Yeung","doi":"10.1109/ICCS.1992.255110","DOIUrl":null,"url":null,"abstract":"The authors examine the behavior of a source subject to flow control by a credit manager. The source receives packets for transmission into a high speed network according to a renewal process. Credit generated at a fixed rate is allowed to accumulate subject to an upper bound. Packet transmission is allowed to start only if the accumulated credit is at least as large as service time. The credit bank is depleted at the onset of service by an amount which equals the service time. The distributions of the sojourn time and queue length have been found by assuming a special structure for the service time distribution and credit bank. This paper extends the approach to obtain the interdeparture time distribution. It shows by numerical examples that the algorithms can solve practical problems.<<ETX>>","PeriodicalId":223769,"journal":{"name":"[Proceedings] Singapore ICCS/ISITA `92","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Interdeparture time distribution for a credit manager in high speed networks\",\"authors\":\"K. K. Leung, B. Sengupta, R. Yeung\",\"doi\":\"10.1109/ICCS.1992.255110\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors examine the behavior of a source subject to flow control by a credit manager. The source receives packets for transmission into a high speed network according to a renewal process. Credit generated at a fixed rate is allowed to accumulate subject to an upper bound. Packet transmission is allowed to start only if the accumulated credit is at least as large as service time. The credit bank is depleted at the onset of service by an amount which equals the service time. The distributions of the sojourn time and queue length have been found by assuming a special structure for the service time distribution and credit bank. This paper extends the approach to obtain the interdeparture time distribution. It shows by numerical examples that the algorithms can solve practical problems.<<ETX>>\",\"PeriodicalId\":223769,\"journal\":{\"name\":\"[Proceedings] Singapore ICCS/ISITA `92\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings] Singapore ICCS/ISITA `92\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCS.1992.255110\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] Singapore ICCS/ISITA `92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.1992.255110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Interdeparture time distribution for a credit manager in high speed networks
The authors examine the behavior of a source subject to flow control by a credit manager. The source receives packets for transmission into a high speed network according to a renewal process. Credit generated at a fixed rate is allowed to accumulate subject to an upper bound. Packet transmission is allowed to start only if the accumulated credit is at least as large as service time. The credit bank is depleted at the onset of service by an amount which equals the service time. The distributions of the sojourn time and queue length have been found by assuming a special structure for the service time distribution and credit bank. This paper extends the approach to obtain the interdeparture time distribution. It shows by numerical examples that the algorithms can solve practical problems.<>