基于半马尔可夫图表示的带泊松包大小的开槽非持久性CSMA协议分析

2006 International Conference on Transparent Optical Networks Pub Date : 2006-11-20 DOI:10.1109/ICTON.2006.248447

J. Galtier

{"title":"基于半马尔可夫图表示的带泊松包大小的开槽非持久性CSMA协议分析","authors":"J. Galtier","doi":"10.1109/ICTON.2006.248447","DOIUrl":null,"url":null,"abstract":"In this paper, we analyze the slotted non-persistent CSMA protocol when the packet size follows a Poissonian distribution. To that purpose, we use a semi-Markov representation of the protocol and derive a closed form for the saturation throughput. The method can apply to a very large family of protocols and therefore unifies lots of results. The new formula for non-persistent CSMA with non unitary packet size present many interesting aspects","PeriodicalId":208725,"journal":{"name":"2006 International Conference on Transparent Optical Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Analysis of the Slotted Non-persistent CSMA Protocol with Poissonian Packet Size Using a Semi-Markov Graph Representation\",\"authors\":\"J. Galtier\",\"doi\":\"10.1109/ICTON.2006.248447\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we analyze the slotted non-persistent CSMA protocol when the packet size follows a Poissonian distribution. To that purpose, we use a semi-Markov representation of the protocol and derive a closed form for the saturation throughput. The method can apply to a very large family of protocols and therefore unifies lots of results. The new formula for non-persistent CSMA with non unitary packet size present many interesting aspects\",\"PeriodicalId\":208725,\"journal\":{\"name\":\"2006 International Conference on Transparent Optical Networks\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Conference on Transparent Optical Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTON.2006.248447\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Transparent Optical Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTON.2006.248447","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

本文分析了分组大小服从泊松分布时的开槽非持久CSMA协议。为此，我们使用协议的半马尔可夫表示，并推导出饱和吞吐量的封闭形式。该方法可以应用于一个非常大的协议家族，因此统一了许多结果。具有非单一包大小的非持久CSMA的新公式呈现出许多有趣的方面

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Analysis of the Slotted Non-persistent CSMA Protocol with Poissonian Packet Size Using a Semi-Markov Graph Representation

In this paper, we analyze the slotted non-persistent CSMA protocol when the packet size follows a Poissonian distribution. To that purpose, we use a semi-Markov representation of the protocol and derive a closed form for the saturation throughput. The method can apply to a very large family of protocols and therefore unifies lots of results. The new formula for non-persistent CSMA with non unitary packet size present many interesting aspects

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2006 International Conference on Transparent Optical Networks

自引率

0.00%

发文量