| 基于校园网外部访问队列的优化算法 |
| |
| 引用本文： | 朱丙丽.基于校园网外部访问队列的优化算法[J].现代电子技术,2006,29(10):129-130,133. |
| |
| 作者姓名： | 朱丙丽 |
| |
| 作者单位： | 重庆三峡学院实验中心,重庆,404000 |
| |
| 摘 要： | 以常用校园网络布局及模型为背景,以解决“瓶颈问题”提高网络性能获得最大信息流量为目的,综合考虑影响网络性能的多种因素,提出优化访问外部信息队列的处理方案,建立类似“背包问题”的数学模型。根据分枝定界算法和队列结构的思想,给出一种综合算法和评价方案。
|
| 关 键 词： | 校园网 瓶颈 背包问题 分枝定界算法 队列 |
| 文章编号： | 1004-373X（2006）10-129-02 |
| 收稿时间： | 2005-10-28 |
| 修稿时间： | 2005-10-28 |
Optimize Arithmetic of External Visiting Queue Based on Campus Network |
| |
| ZHU Bingli.Optimize Arithmetic of External Visiting Queue Based on Campus Network[J].Modern Electronic Technique,2006,29(10):129-130,133. |
| |
| Authors: | ZHU Bingli |
| |
| Affiliation: | The Experiment Center, Chongqing Three Gorges University, Chonsqing , 404000 , China |
| |
| Abstract: | Taking usual campus network model and various negative facets especially network bottleneck as study background,designs a network model which optimizes and improves the net performance value in order to provides adequate information run off.Establishing a math model which came from "Bag Arithmetic",using branch and bound method and queue structure,a synthesis arithmetic and estimate scheme are gained. |
| |
| Keywords: | campus network bottleneck bag arithmetic branch and bound method queue |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
