摘要
网格中数据传输的速度对整个网格性能起着非常重要的作用,网格数据传输本质上讲是对受约束的网格环境求最大网络流的问题,文章提出了一种基于贪婪思想的受约束网格数据传输算法。该算法首先分析网络的拓扑图形,然后确定网络上链路的转发速度,生成一个带权的约束图,应用贪婪的思想逐层传递数据,当前一层数据传输发生超约束情况时,进行回退,修正上传数据传输,直到汇聚点,最终形成优化的网络流。
The data transmission speed is very important for the grid s performance.Grid data transmission essentially is the question that the maximal network flows during constrained grid situations being found.A constrained grid data transmission algorithm based on greedy thought is proposed in this paper.The algorithm first analyzes the analysis graph of network,then determines transmit speed of network link,produces a weighted constraint graphics,and level-by-level transfers data by the greedy thought.When the pr...
出处
《四川教育学院学报》
2010年第4期28-29,42,共3页
Journal of Sichuan College of Education
关键词
网格
数据传输
贪婪
grid
data transmission
greed
