| 基于连续学习自动机解决网络负载量的分配 |
| |
| 引用本文： | 林炳桂.基于连续学习自动机解决网络负载量的分配[J].福州大学学报(自然科学版),2002,30(5):527-532. |
| |
| 作者姓名： | 林炳桂 |
| |
| 作者单位： | 福州大学信息科学与技术学院,福建,福州,350002 |
| |
| 摘 要： | 假定网络流量是由不同平均包长和优先级的不同类别的包组成 ,并引入了一种采用连续学习自动机的新方法来解决计算机网络负载量分配问题 ,并获得比目前最好方法更优的结果 .
|
| 关 键 词： | 学习自动机 负载量分配 网络 |
| 文章编号： | 1000-2243(2002)05-0527-06 |
| 修稿时间： | 2002年7月10日 |
Solutions to the network capacity assignment problem based on continuous learning automata |
| |
| LIN Bing-gui.Solutions to the network capacity assignment problem based on continuous learning automata[J].Journal of Fuzhou University(Natural Science Edition),2002,30(5):527-532. |
| |
| Authors: | LIN Bing-gui |
| |
| Institution: | LIN Bing-gui (College of Information Science and Technology, Fuzhou University, Fuzhou, Fujian 350002, China) |
| |
| Abstract: | In this paper, provided that the traffic consists of different classes of packet with different average packet lengths and priorities, and a new method, which uses continuous learning automata to solve the problem of network capacity assignment, is introduced. This new scheme produces superior results when compared with either of the previous solutions. |
| |
| Keywords: | learning automata capacity assignment network |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《福州大学学报(自然科学版)》下载免费的PDF全文 |
