{"title":"分组分片网关的排队模型","authors":"Jianli Wang, Y. Fan, Chuan Wang","doi":"10.1109/ICC.1992.268100","DOIUrl":null,"url":null,"abstract":"A switched determined process (SDP) is proposed as a modeling tool for the packet arrival process of the output queue of gateways with packet fragmentation. A new method called the minislot method is proposed for performance analysis of the SDP/S/1 queue by using an embedded Markov chain technique and a supplementary variable technique. The iterative formulas for queue length distribution of SDP/D/1 are derived. The expressions for waiting time distribution and scan delay of the SDP/D/1 queue are then obtained. The numerical results are given.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"96 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Queueing model of gateways with packet fragmentation\",\"authors\":\"Jianli Wang, Y. Fan, Chuan Wang\",\"doi\":\"10.1109/ICC.1992.268100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A switched determined process (SDP) is proposed as a modeling tool for the packet arrival process of the output queue of gateways with packet fragmentation. A new method called the minislot method is proposed for performance analysis of the SDP/S/1 queue by using an embedded Markov chain technique and a supplementary variable technique. The iterative formulas for queue length distribution of SDP/D/1 are derived. The expressions for waiting time distribution and scan delay of the SDP/D/1 queue are then obtained. The numerical results are given.<<ETX>>\",\"PeriodicalId\":170618,\"journal\":{\"name\":\"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications\",\"volume\":\"96 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.1992.268100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1992.268100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Queueing model of gateways with packet fragmentation
A switched determined process (SDP) is proposed as a modeling tool for the packet arrival process of the output queue of gateways with packet fragmentation. A new method called the minislot method is proposed for performance analysis of the SDP/S/1 queue by using an embedded Markov chain technique and a supplementary variable technique. The iterative formulas for queue length distribution of SDP/D/1 are derived. The expressions for waiting time distribution and scan delay of the SDP/D/1 queue are then obtained. The numerical results are given.<>