{"title":"Effect of slot size on TDMA performance in presence of per slot overhead","authors":"M. Sarraf","doi":"10.1109/GLOCOM.1989.64041","DOIUrl":null,"url":null,"abstract":"The problem of optimum slot size in the time division multiplexing (TDM) scheme in the presence of per slot overhead is addressed. Per slot overhead occurs in a variety of network structures. Messages are assumed to be of random length, so they may need to be segmented into several slots, and are assumed to be arriving according to a Poisson process. Optimum slot is derived as a function of input rate, message length distribution, overhead per slot, and number of stations. It is also shown how one will be penalized by deviating from this optimum slot size. Guidelines are provided on how to assign unequal slot sizes in cases where different stations have different traffic characteristics. It is shown that this is a cumbersome nonlinear optimization programming problem in general, which reduces to a Kuhn-Tucker optimization programming problem in light traffic situations.<<ETX>>","PeriodicalId":256305,"journal":{"name":"IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.1989.64041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
The problem of optimum slot size in the time division multiplexing (TDM) scheme in the presence of per slot overhead is addressed. Per slot overhead occurs in a variety of network structures. Messages are assumed to be of random length, so they may need to be segmented into several slots, and are assumed to be arriving according to a Poisson process. Optimum slot is derived as a function of input rate, message length distribution, overhead per slot, and number of stations. It is also shown how one will be penalized by deviating from this optimum slot size. Guidelines are provided on how to assign unequal slot sizes in cases where different stations have different traffic characteristics. It is shown that this is a cumbersome nonlinear optimization programming problem in general, which reduces to a Kuhn-Tucker optimization programming problem in light traffic situations.<>