权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

Research on Optimizeation of Implementing Telephone Netwarks by Using Learning Theory

利用学习理论实现电话网络的优化研究

基本信息

批准号：
04650355
负责人：
SATO Mitsuo
金额：
$ 1.09万
依托单位：
Tohoku University
依托单位国家：
日本
项目类别：
Grant-in-Aid for General Scientific Research (C)
财政年份：
1992
资助国家：
日本
起止时间：
1992 至 1993
项目状态：
已结题

来源：
https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-04650355/
关键词：
Telephone Network Routing Learning Control Load Equalization Blicking Routing Domain 迂回候補路

项目摘要

In 1992, by applying our previously presented learning control scheme to a telephone network we designed and presented a a routing scheme with aim at load equalization on the network. This scheme chooses a route which minimizeds a weighted blocking frequency from an appropriately determined set of routes. It was shown that this scheme achieves the load equalization in the sense that the blocking frequencies asymptotically become equal amoug the set of routes. According to computer simulation, it was ascertained that our scheme is superior in blocking count and average route length to the scheme using learning automata. However, it was found that the characteristic of load equalization greatly depends on determination of the set of routes.Viewing recent rapid development of functions of network observation and control, we can expect that higher performance routing than that considered in 1992 is realizable. From this, in 1993, we presented a learning routing scheme which achieves more strict load equalization based on information about call generation at all stations. This scheme seeks blocking equalization among links by adaptively assigning overflow calls from main sources generating congestion to vacant routes. According to detailed computer simulation, it was ascertained that our new scheme is most superior compared with our previous one and the state-dependent scheme under various conditions in the case that we determined the set of routes using the design method of a routing domain presented by other investigators.Significance of this research is that it was shown theoretically and practically that our schemes achieve load equalization which is not ensured by the present schemes. Our research results will be useful for development of available routing schemes in future.

1992年，通过将我们先前提出的学习控制方案应用到电话网络中，我们设计并提出了一个路由方案，目的是在网络上实现负载均衡。该方案从一组适当确定的路线中选择一条使加权阻塞频率最小化的路线。结果表明，该方案实现了负载均衡的意义上，阻塞频率渐近成为相等的路由集合。通过计算机仿真，证明了该方案在阻塞数和平均路径长度方面上级基于学习自动机的方案。然而，人们发现，负载均衡的特性很大程度上取决于路由集的确定。鉴于最近网络观测和控制功能的快速发展，我们可以预期，比1992年考虑的更高性能的路由是可以实现的。由此，在1993年，我们提出了一个学习路由方案，实现了更严格的负载均衡的基础上，在所有站的呼叫生成的信息。该方案通过自适应地将主要拥塞源的溢出呼叫分配给空闲路由来实现链路间的阻塞均衡。根据详细的计算机模拟，我们的新方案比我们以前的方案和国家的方案上级得多，本文的研究意义在于从理论和实践上证明了我们的方案能够实现负载均衡，而负载均衡并不是由路由域的设计方法来保证的目前的方案。我们的研究结果将有助于在未来可用的路由方案的发展。