检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京航空航天大学经济管理学院,南京210016
出 处:《南京航空航天大学学报》2006年第3期352-355,共4页Journal of Nanjing University of Aeronautics & Astronautics
基 金:江苏省教育厅人文社会科学基金(02SJD630020)资助项目
摘 要:最优点到点数据传输线路不仅依赖于其固有的传输时间,还依赖于数据总量,因为数据规模决定了加工次数和传输次数。本文首先建立了在线点到点数据传输网络选择的优化模型,给出了有向路代表集的概念,然后给出了一个时间复杂性为O(m2logn)的算法产生有向路代表集。最后对静态和动态点到点数据传输有向路问题进行了研究,并给出了一个时间复杂性为O(m2logn)的多项式时间的算法。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).
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117