检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]山东师范大学信息科学与工程学院,山东济南250014
出 处:《计算机技术与发展》2011年第10期103-107,共5页Computer Technology and Development
基 金:国家自然科学基金资助项目(90612003)
摘 要:由于P2P技术的广泛应用以及无线网络和移动设备的普及,人们提出了基于无线网络的移动P2P网络。文中通过分析移动P2P网络的特点和已有的网络模型,结合校园网络环境的特点,设计出基于校园环境的网络体系结构模型,并对模型的资源查找进行详细的描述。模型被划分成三层结构,底层的网络采用改进后的Kelips路由算法通信,该算法的路由复杂度是一个常数,有效减少资源查找时间,保证节点维护状态信息的实时性和正确性;由超级节点组成的中间层,实行分布式管理,采取泛洪搜索算法来通信;顶层是一些域内中心节点,负责连接外网和解决网络的安全问题。仿真实验表明:该模型能够更好地减少资源查找时间,即使大量节点失效,也可以快速检测到节点间关系变化并进行管理。Becanse of the wide use of P2P technology and the popularization of wireless networks and mobile devices, mobile P2P network was proposed by most people. Introduced the concept of mobile P2P networks, analyzed the characteristics and models of them, designed a mobile overlay architecture model, combining with the campus network environment. In the model, resource searching was also described in detail. The model was divided into three layers; the underlying network used an improved Kelips routing algorithm. Because the routing complexity was a constant, it could effectively reduce resource searching time,ensure that the node maintains state information instantaneity and correctness;Interlayer was composed by super nodes, executed distributed management and took flooding search algorithm for communication; Top layer contained some domain center nodes for connecting the external network and solving the network security. Simulation showed that it was better to reduce time for source. Even when most nodes were failure, it can also quickly detect the relationship between nodes and made some changes.
分 类 号:TP393.1[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117