浅析计算机网络的最小接通时间
姓名
学校 计算机相关专业 班级
年 月 日
摘要:
一个计算机网络系统中的每个计算机之间相互进行数据传送,但传送速度和能同时进行的任务有一定
的限制。本文试图通过优化使得总共所需要的传送时间最短。本文秉弃了通常图论的算法,试图将问题转
化为线性规划的形式加以解决,并在此情况下得到了很好的解决。对于情形 A,我们首先给出另外通常图
论的解决本问题的算法,接着改用线性规划,通过 0-1 变量和目标函数 z 应大于等于所有运行时间,用
lingo 程序结局,得到的最短时间为 3 秒,并给出最佳方案。对于情形 B 仍按照这个思想,通过对 A 进行
扩展和约束条件的改变,得到最短传输时间为 23 秒,并给出最佳方案。
关键字: 线性规划 边染色 lingo 程序
Abstract
Each computer carries on the data transmission mutually in a computer network
system,but the transfer rata and information which can carry on at the same time have
the certain limit. The paper attempts to reduce the transmission time to need to be
shortest through the optimization this article try to abandon the usual graph theory
algorithm and try to transform the question for the linear programming form, perform
to solve, then the situation may be solved very well. We first have produced the usual
graph theory to solve this question, then we change to the linear programming by
setting 0-1variable and objective function Z which is equal or bigger than all running
time, with lingo procedure result, obtaining the shortest time is 3 seconds , and
produces the better plan. Still it deferred to this though regarding situation B,we
obtain the shortest transmission time is 23 seconds through carrying on the expansion
and the changing constraint condition to situation A and produces the better plan.
Keywords: linear programming coloring theory lingo procedure
一.问题的提出
在你们公司里,各部门都要分享信息。这种信息包括前一天的销售统计和当前的生产
指南。尽快公布这些信息是十分重要的。
假设一个通讯网络被用来从一台计算机向另一台计算机传输数据组(文件)。作为例子 ,
考虑图 1.1 的模型。