一个强大的仿真技术,适用于各种CSMA/CD局域网的性能研究

S.A. El-Hadi, S. El-Ramly, I. El-Emary
{"title":"一个强大的仿真技术,适用于各种CSMA/CD局域网的性能研究","authors":"S.A. El-Hadi, S. El-Ramly, I. El-Emary","doi":"10.1109/NRSC.1999.760899","DOIUrl":null,"url":null,"abstract":"One of the growing area in the communication industry is the inter-network of the increased proliferation of computers, particularly via local area network (LAN). Many commercial LAN which use CSMA/CD as an access protocol, claim the ability to support hundreds of stations. We present a tool for use in performance studies of such networks when the number of stations is large. The proposed tool is a simulation technique, which requires partitioning the network stations into a few primary stations and the remainder as background stations. The background stations are modeled as a group by a background algorithm based on a dynamic CSMA/CD model which uses a set of probabilities and sampling to produce in a recurrent manner, a stochastic sequence of busy/idle periods. Through simulation results, it is proved that the suggested simulation technique is more powerful and efficient than discrete-event simulation specially when the number of network stations is large enough because the probabilistic simulation technique proposed in this paper needs less rum time on the computer and small storage capacity.","PeriodicalId":250544,"journal":{"name":"Proceedings of the Sixteenth National Radio Science Conference. NRSC'99 (IEEE Cat. No.99EX249)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A powerful simulation technique suitable for performance studies of various CSMA/CD LANs\",\"authors\":\"S.A. El-Hadi, S. El-Ramly, I. El-Emary\",\"doi\":\"10.1109/NRSC.1999.760899\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the growing area in the communication industry is the inter-network of the increased proliferation of computers, particularly via local area network (LAN). Many commercial LAN which use CSMA/CD as an access protocol, claim the ability to support hundreds of stations. We present a tool for use in performance studies of such networks when the number of stations is large. The proposed tool is a simulation technique, which requires partitioning the network stations into a few primary stations and the remainder as background stations. The background stations are modeled as a group by a background algorithm based on a dynamic CSMA/CD model which uses a set of probabilities and sampling to produce in a recurrent manner, a stochastic sequence of busy/idle periods. Through simulation results, it is proved that the suggested simulation technique is more powerful and efficient than discrete-event simulation specially when the number of network stations is large enough because the probabilistic simulation technique proposed in this paper needs less rum time on the computer and small storage capacity.\",\"PeriodicalId\":250544,\"journal\":{\"name\":\"Proceedings of the Sixteenth National Radio Science Conference. NRSC'99 (IEEE Cat. No.99EX249)\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-02-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Sixteenth National Radio Science Conference. NRSC'99 (IEEE Cat. No.99EX249)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NRSC.1999.760899\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Sixteenth National Radio Science Conference. NRSC'99 (IEEE Cat. No.99EX249)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NRSC.1999.760899","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

通信行业中一个日益增长的领域是计算机日益扩散的内部网络,特别是通过局域网(LAN)。许多商用局域网使用CSMA/CD作为接入协议,声称能够支持数百个站点。我们提出了一个工具,用于这种网络的性能研究时,站的数量很大。所提出的工具是一种仿真技术,它要求将网络站划分为几个主站,其余的作为后台站。基于动态CSMA/CD模型的背景算法将后台台站作为一个组进行建模,该模型使用一组概率和采样以循环的方式产生繁忙/空闲时间段的随机序列。仿真结果表明,由于本文提出的概率仿真技术占用计算机运行时间少,存储容量小,特别是在台站数量足够大的情况下,比离散事件仿真技术更强大,效率更高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A powerful simulation technique suitable for performance studies of various CSMA/CD LANs
One of the growing area in the communication industry is the inter-network of the increased proliferation of computers, particularly via local area network (LAN). Many commercial LAN which use CSMA/CD as an access protocol, claim the ability to support hundreds of stations. We present a tool for use in performance studies of such networks when the number of stations is large. The proposed tool is a simulation technique, which requires partitioning the network stations into a few primary stations and the remainder as background stations. The background stations are modeled as a group by a background algorithm based on a dynamic CSMA/CD model which uses a set of probabilities and sampling to produce in a recurrent manner, a stochastic sequence of busy/idle periods. Through simulation results, it is proved that the suggested simulation technique is more powerful and efficient than discrete-event simulation specially when the number of network stations is large enough because the probabilistic simulation technique proposed in this paper needs less rum time on the computer and small storage capacity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信