ATM网络中的通用连接允许控制

H. Zaied
{"title":"ATM网络中的通用连接允许控制","authors":"H. Zaied","doi":"10.1109/LFNM.2006.251967","DOIUrl":null,"url":null,"abstract":"In this paper we introduced a new call admission control (CAC) based on the virtual link with ultra wide bandwidth. Under the virtual link we mean that we have a reservoir that can accommodate an infinitive number of calls. So in each node we have to attach an auxiliary memory such as magnetic tapes with ultra high capacity to receive all the arriving calls. Traditional CAC will be replaced by two controllers: Virtual CAC (VCAC) and draft CAC (DCAC). The main function of VCAC is to collect all the arriving calls without negotiations depending on its high capacity. DCAC will import the calls from VCAC, sort them into classes according to their service category, give them the appropriate VPI over which they will be carried later on the least loaded link among the outgoing links and export them to the router according to the congestion level of the physical link. The proposed scheme looks like a transistor network. The collector is represented by VCAC, the emitter is represented by DCAC and finally the base is represented by the router. The idea of the proposed strategy can be explained as follows: All the calls are admitted to the virtual memory as they arrive without any delay with respect to the extra large memory size. The virtual memory is divided into segments according to the number of the services (audio, data, video, ...etc) and each segment is divided into a number of blocks size of each is a multiple of cell size (i.e. 53 octets), these blocks have the same number of VP's (for all outgoing links) to be connected with them later (the recommended bandwidth allocation strategy is service and path separation). The block capacity is too much greater than its associated link W. Once the block receives a new call it will spool (roll) it to its associated VP which belongs to the least loaded link, unless it becomes saturated. Once a new room appears in one of the associated VP's in any of the outgoing links it will be occupied by a new call. It is worth noting that the calls will be pushed out by applying the famous rule FIFO: first in first out","PeriodicalId":370622,"journal":{"name":"2006 International Workshop on Laser and Fiber-Optical Networks Modeling","volume":"150 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Generic Connection Admission Control in ATM Networks\",\"authors\":\"H. Zaied\",\"doi\":\"10.1109/LFNM.2006.251967\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we introduced a new call admission control (CAC) based on the virtual link with ultra wide bandwidth. Under the virtual link we mean that we have a reservoir that can accommodate an infinitive number of calls. So in each node we have to attach an auxiliary memory such as magnetic tapes with ultra high capacity to receive all the arriving calls. Traditional CAC will be replaced by two controllers: Virtual CAC (VCAC) and draft CAC (DCAC). The main function of VCAC is to collect all the arriving calls without negotiations depending on its high capacity. DCAC will import the calls from VCAC, sort them into classes according to their service category, give them the appropriate VPI over which they will be carried later on the least loaded link among the outgoing links and export them to the router according to the congestion level of the physical link. The proposed scheme looks like a transistor network. The collector is represented by VCAC, the emitter is represented by DCAC and finally the base is represented by the router. The idea of the proposed strategy can be explained as follows: All the calls are admitted to the virtual memory as they arrive without any delay with respect to the extra large memory size. The virtual memory is divided into segments according to the number of the services (audio, data, video, ...etc) and each segment is divided into a number of blocks size of each is a multiple of cell size (i.e. 53 octets), these blocks have the same number of VP's (for all outgoing links) to be connected with them later (the recommended bandwidth allocation strategy is service and path separation). The block capacity is too much greater than its associated link W. Once the block receives a new call it will spool (roll) it to its associated VP which belongs to the least loaded link, unless it becomes saturated. Once a new room appears in one of the associated VP's in any of the outgoing links it will be occupied by a new call. It is worth noting that the calls will be pushed out by applying the famous rule FIFO: first in first out\",\"PeriodicalId\":370622,\"journal\":{\"name\":\"2006 International Workshop on Laser and Fiber-Optical Networks Modeling\",\"volume\":\"150 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Workshop on Laser and Fiber-Optical Networks Modeling\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LFNM.2006.251967\",\"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 Workshop on Laser and Fiber-Optical Networks Modeling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LFNM.2006.251967","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文介绍了一种基于超宽带虚拟链路的呼叫接纳控制(CAC)。在虚拟链接下,我们的意思是我们有一个可以容纳无限数量呼叫的储存库。因此,我们必须在每个节点上附加一个辅助存储器,如超高容量的磁带,以接收所有到达的呼叫。传统的CAC将被两个控制器所取代:虚拟CAC (VCAC)和草案CAC (DCAC)。VCAC的主要功能是收集所有到达的电话,而不需要协商,这取决于它的高容量。DCAC将从VCAC导入呼叫,根据它们的服务类别对它们进行分类,给它们适当的VPI,稍后它们将在出站链路中负载最少的链路上承载,并根据物理链路的拥塞程度将它们导出到路由器。所提出的方案看起来像一个晶体管网络。集电极用VCAC表示,发射极用DCAC表示,基极用路由器表示。所提出的策略的思想可以解释如下:所有的调用都被允许进入虚拟内存,因为它们到达时没有任何延迟,相对于额外的内存大小。虚拟内存根据业务(音频、数据、视频等)的数量划分为段,每个段被划分为多个块,每个块的大小是单元大小的倍数(即53个字节),这些块具有相同数量的VP(用于所有传出链接),稍后将与它们连接(建议的带宽分配策略是服务和路径分离)。块容量比其关联的链路w大得多。一旦块接收到一个新的调用,它将把它转到属于最小负载链路的关联的VP,除非它变得饱和。一旦一个新房间出现在任何传出链接的关联VP的其中一个中,它将被一个新呼叫占用。值得注意的是,调用将通过应用著名的FIFO规则被推出:先进先出
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Generic Connection Admission Control in ATM Networks
In this paper we introduced a new call admission control (CAC) based on the virtual link with ultra wide bandwidth. Under the virtual link we mean that we have a reservoir that can accommodate an infinitive number of calls. So in each node we have to attach an auxiliary memory such as magnetic tapes with ultra high capacity to receive all the arriving calls. Traditional CAC will be replaced by two controllers: Virtual CAC (VCAC) and draft CAC (DCAC). The main function of VCAC is to collect all the arriving calls without negotiations depending on its high capacity. DCAC will import the calls from VCAC, sort them into classes according to their service category, give them the appropriate VPI over which they will be carried later on the least loaded link among the outgoing links and export them to the router according to the congestion level of the physical link. The proposed scheme looks like a transistor network. The collector is represented by VCAC, the emitter is represented by DCAC and finally the base is represented by the router. The idea of the proposed strategy can be explained as follows: All the calls are admitted to the virtual memory as they arrive without any delay with respect to the extra large memory size. The virtual memory is divided into segments according to the number of the services (audio, data, video, ...etc) and each segment is divided into a number of blocks size of each is a multiple of cell size (i.e. 53 octets), these blocks have the same number of VP's (for all outgoing links) to be connected with them later (the recommended bandwidth allocation strategy is service and path separation). The block capacity is too much greater than its associated link W. Once the block receives a new call it will spool (roll) it to its associated VP which belongs to the least loaded link, unless it becomes saturated. Once a new room appears in one of the associated VP's in any of the outgoing links it will be occupied by a new call. It is worth noting that the calls will be pushed out by applying the famous rule FIFO: first in first out
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信