检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京航空航天大学计算机学院,北京100191
出 处:《北京航空航天大学学报》2008年第7期743-746,共4页Journal of Beijing University of Aeronautics and Astronautics
基 金:国家自然科学基金资助项目(60473010;90412011)
摘 要:数据交换是电子政务应用的核心问题.构建一种应用层数据交换覆盖网络成为解决这类问题的关键.分析了电子政务数据交换的特点,提出了电子政务数据交换覆盖网络eGON(e-Government data exchange Overlay Network)的概念模型,在树型结构组织网络的基础上,引入结点间组织距离和结点适应度概念,提出了一种eGON拓扑结构模型——双尺度异质组织网络模型DSHON(Dual Scale Heterogeneous Organization Network),该模型按照与组织距离和能力适应度2种尺度相关的概率添加快捷边,实现网络性能改善.设计了eGON的总体结构、构建与维护机制、路由维护协议和基于组织距离优先的消息路由算法,并进行了路由算法实验验证.Data exchange is the kernel of e-Government. The establishment of an e-Government data exchange overlay network on application layer is one of the crucial parts of the solution to this issue. Based on the analysis of the characteristics of e-Government data exchange, an overlay network conceptual model, eGON (e-Government Data Exchange Overlay Network) , was defined. The concepts of "Organizational Distance" between nodes and "Fitness" of a certain node were introduced, and a structural model, which was called DSHON(Dual Scale Heterogeneous Organization Network model) ,was proposed for eGON accordingly. The proposed model was based on the structure of tree and the network performance was promoted by adding shortcuts to the original tree according to the organizational distance between and the fitness of the nodes. The architecture, construction and maintenance mechanism, routing maintenance protocol and an organizational distance priority routing algorithm were developed for eGON. Simulations were performed for the proposed message routing algorithm and the results demonstrate the effectiveness and efficiency of the algorithm.
分 类 号:TP393.09[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222