异构到达ATM网络中基于神经网络的呼叫接纳控制

J. M. Hah, P. Tien, M. Yuang
{"title":"异构到达ATM网络中基于神经网络的呼叫接纳控制","authors":"J. M. Hah, P. Tien, M. Yuang","doi":"10.1109/LCN.1996.558154","DOIUrl":null,"url":null,"abstract":"Call admission control (CAC) has been accepted as a potential solution for supporting diverse, heterogeneous traffic sources demanding different quality of services in asynchronous transfer mode (ATM) networks. Besides, CAC is required to consume a minimum of time and space to make call acceptance decisions. We present an efficient neural-network-based CAC (NNCAC) mechanism for ATM networks with heterogeneous arrivals. All heterogeneous traffic calls are initially categorized into various classes. Based on the number of calls in each class, the NNCAC efficiently and accurately estimates the cell delay and cell loss ratio of each class in real time by means of a pre-trained neural network. According to our decent study which exhibits the superiority of the employment of analysis-based training data over simulation-based data, we particularly construct the training data from heterogeneous-arrival dual-class queueing model M/sup [N1]/+I/sup [N2]//D/1/K, where M and I represent the Bernoulli process and interrupted Bernoulli process, and N/sub 1/ and N/sub 2/ represent the corresponding numbers of calls, respectively. Analytic results of the queueing model are confirmed by simulation results. Finally, we demonstrate the profound agreement of our neural-network-based estimated results with analytic results, justifying the viability of our NNCAC mechanism.","PeriodicalId":420811,"journal":{"name":"Proceedings of LCN - 21st Annual Conference on Local Computer Networks","volume":"103 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Neural-network-based call admission control in ATM networks with heterogeneous arrivals\",\"authors\":\"J. M. Hah, P. Tien, M. Yuang\",\"doi\":\"10.1109/LCN.1996.558154\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Call admission control (CAC) has been accepted as a potential solution for supporting diverse, heterogeneous traffic sources demanding different quality of services in asynchronous transfer mode (ATM) networks. Besides, CAC is required to consume a minimum of time and space to make call acceptance decisions. We present an efficient neural-network-based CAC (NNCAC) mechanism for ATM networks with heterogeneous arrivals. All heterogeneous traffic calls are initially categorized into various classes. Based on the number of calls in each class, the NNCAC efficiently and accurately estimates the cell delay and cell loss ratio of each class in real time by means of a pre-trained neural network. According to our decent study which exhibits the superiority of the employment of analysis-based training data over simulation-based data, we particularly construct the training data from heterogeneous-arrival dual-class queueing model M/sup [N1]/+I/sup [N2]//D/1/K, where M and I represent the Bernoulli process and interrupted Bernoulli process, and N/sub 1/ and N/sub 2/ represent the corresponding numbers of calls, respectively. Analytic results of the queueing model are confirmed by simulation results. Finally, we demonstrate the profound agreement of our neural-network-based estimated results with analytic results, justifying the viability of our NNCAC mechanism.\",\"PeriodicalId\":420811,\"journal\":{\"name\":\"Proceedings of LCN - 21st Annual Conference on Local Computer Networks\",\"volume\":\"103 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of LCN - 21st Annual Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.1996.558154\",\"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 LCN - 21st Annual Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.1996.558154","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

在异步传输模式(ATM)网络中,呼叫接纳控制(CAC)已被认为是一种潜在的解决方案,用于支持要求不同服务质量的多种异构业务源。此外,CAC需要消耗最少的时间和空间来做出呼叫接受决策。针对异构到达ATM网络,提出了一种基于神经网络的高效CAC (NNCAC)机制。所有异构业务呼叫最初都被划分为不同的类。NNCAC基于每一类的调用次数,通过预训练的神经网络实时有效准确地估计每一类的单元延迟和单元损失率。根据我们对基于分析的训练数据优于基于仿真的数据的良好研究,我们特别从异构到达双类排队模型M/sup [N1]/+I/sup [N2]//D/1/K构建训练数据,其中M和I代表伯努利过程和中断伯努利过程,N/sub 1/和N/sub 2/分别代表相应的呼叫数。仿真结果验证了排队模型的解析结果。最后,我们证明了基于神经网络的估计结果与分析结果的深刻一致性,证明了我们的NNCAC机制的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Neural-network-based call admission control in ATM networks with heterogeneous arrivals
Call admission control (CAC) has been accepted as a potential solution for supporting diverse, heterogeneous traffic sources demanding different quality of services in asynchronous transfer mode (ATM) networks. Besides, CAC is required to consume a minimum of time and space to make call acceptance decisions. We present an efficient neural-network-based CAC (NNCAC) mechanism for ATM networks with heterogeneous arrivals. All heterogeneous traffic calls are initially categorized into various classes. Based on the number of calls in each class, the NNCAC efficiently and accurately estimates the cell delay and cell loss ratio of each class in real time by means of a pre-trained neural network. According to our decent study which exhibits the superiority of the employment of analysis-based training data over simulation-based data, we particularly construct the training data from heterogeneous-arrival dual-class queueing model M/sup [N1]/+I/sup [N2]//D/1/K, where M and I represent the Bernoulli process and interrupted Bernoulli process, and N/sub 1/ and N/sub 2/ represent the corresponding numbers of calls, respectively. Analytic results of the queueing model are confirmed by simulation results. Finally, we demonstrate the profound agreement of our neural-network-based estimated results with analytic results, justifying the viability of our NNCAC mechanism.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信