{"title":"Performance analysis of multiple-packet messages in uni-directional bus networks","authors":"C. Chao, M. Ilyas","doi":"10.1109/GLOCOM.1989.64100","DOIUrl":null,"url":null,"abstract":"A slotted p/sub i/-persistent protocol and the effects of random message length are considered. Since the length of messages is not fixed, a message is divided into a number of equal-size packets such that a packet can fit into one slot. The utilization of the network degrades because of the increasing transmission overhead owing to excess packet headers and a possible empty portion in the last packet of any message. Furthermore, the increasing ratio of message-to-packet length increases the interdependence among the nodes and thus affects the bus access probabilities. An analytical model is presented to determine the upper and lower bounds to the access probabilities. Due to the complexity of this problem, only two nodes are considered. Simulation results showing average queue length performance versus different message statistics are also presented.<<ETX>>","PeriodicalId":256305,"journal":{"name":"IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","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.64100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
A slotted p/sub i/-persistent protocol and the effects of random message length are considered. Since the length of messages is not fixed, a message is divided into a number of equal-size packets such that a packet can fit into one slot. The utilization of the network degrades because of the increasing transmission overhead owing to excess packet headers and a possible empty portion in the last packet of any message. Furthermore, the increasing ratio of message-to-packet length increases the interdependence among the nodes and thus affects the bus access probabilities. An analytical model is presented to determine the upper and lower bounds to the access probabilities. Due to the complexity of this problem, only two nodes are considered. Simulation results showing average queue length performance versus different message statistics are also presented.<>