{"title":"多址系统中交互队列的延迟分析方法","authors":"E. Modiano, A. Ephremides","doi":"10.1109/INFCOM.1993.253331","DOIUrl":null,"url":null,"abstract":"An approximate model for analyzing interacting queues is developed. This approximation models an N-dimensional infinite Markov chain by means of two Markov chains, one being one-dimensional and infinite and the other being N-dimensional and finite. The transition probabilities of each chain are expressed in terms of statistics of the other chain. The two chains are solved together iteratively to yield an approximation to the original N-dimensional infinite chain. The model is used to analyze systems of dependent queues which often arise in multiple access protocols. It is shown how this model can be used to analyze the ALOHA multiple access protocol as well as a previously proposed broadcast algorithm for a mesh network. The results compare very well with simulation.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"110 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"A method for delay analysis of interacting queues in multiple access systems\",\"authors\":\"E. Modiano, A. Ephremides\",\"doi\":\"10.1109/INFCOM.1993.253331\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An approximate model for analyzing interacting queues is developed. This approximation models an N-dimensional infinite Markov chain by means of two Markov chains, one being one-dimensional and infinite and the other being N-dimensional and finite. The transition probabilities of each chain are expressed in terms of statistics of the other chain. The two chains are solved together iteratively to yield an approximation to the original N-dimensional infinite chain. The model is used to analyze systems of dependent queues which often arise in multiple access protocols. It is shown how this model can be used to analyze the ALOHA multiple access protocol as well as a previously proposed broadcast algorithm for a mesh network. The results compare very well with simulation.<<ETX>>\",\"PeriodicalId\":166966,\"journal\":{\"name\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"volume\":\"110 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1993.253331\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1993.253331","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A method for delay analysis of interacting queues in multiple access systems
An approximate model for analyzing interacting queues is developed. This approximation models an N-dimensional infinite Markov chain by means of two Markov chains, one being one-dimensional and infinite and the other being N-dimensional and finite. The transition probabilities of each chain are expressed in terms of statistics of the other chain. The two chains are solved together iteratively to yield an approximation to the original N-dimensional infinite chain. The model is used to analyze systems of dependent queues which often arise in multiple access protocols. It is shown how this model can be used to analyze the ALOHA multiple access protocol as well as a previously proposed broadcast algorithm for a mesh network. The results compare very well with simulation.<>