首页 | 本学科首页   官方微博 | 高级检索  
     检索      

在线点到点数据传输优化选择模型及其算法设计
引用本文:李帮义,付铅生.在线点到点数据传输优化选择模型及其算法设计[J].南京航空航天大学学报,2006,38(3):352-355.
作者姓名:李帮义  付铅生
作者单位:南京航空航天大学经济管理学院,南京,210016
基金项目:江苏省教育厅高校人文社会科学基金
摘    要:最优点到点数据传输线路不仅依赖于其固有的传输时间,还依赖于数据总量,因为数据规模决定了加工次数和传输次数.本文首先建立了在线点到点数据传输网络选择的优化模型,给出了有向路代表集的概念,然后给出了一个时间复杂性为O(m^2logn)的算法产生有向路代表集.最后对静态和动态点到点数据传输有向路问题进行了研究,并给出了一个时间复杂性为O(m^2logn)的多项式时间的算法.

关 键 词:数据传输  点到点线路  有效代表集  在线
文章编号:1005-2615(2006)03-0352-04
收稿时间:2005-03-14
修稿时间:2005-08-31

Online Optimization Selection Model in Point-to-Point Data Transmission Network
Li Bangyi,Fu Qiansheng.Online Optimization Selection Model in Point-to-Point Data Transmission Network[J].Journal of Nanjing University of Aeronautics & Astronautics,2006,38(3):352-355.
Authors:Li Bangyi  Fu Qiansheng
Abstract:The cost of one data transmission path from one point to another is composed of the transmitting time and the data operating time.This means that the optimal paths from point to point are dependent on its fixed transmitting time,and the total amount of data waiting to be transmitted,for the scale of the data determines the frequency of operation and transmission.In this paper,the problem of generating the minimum cost path from point to point is studied with online inputting data.Firstly,the minimum transmission cost model is established in a point-to-point data transmission network and the concept of efficient representing set of the directed paths is given.Secondly an algorithm is designed to generate one efficient representing set with the time complexity O(m~2logn).Finally,the problem of a static point-to-point data transmission path and an online point-to-point data transmission path are explored,and two algorithms are presented,both with the complexity O(m~2logn).
Keywords:data transmission  point-to-point path  efficient representing set  online
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号