Description: 摘 : 通过使用 peer-to-peer(P2P)计算模式在 Internet 物理拓扑基础上建立一个称为 P2P 覆盖网络(P
overlay network)的虚拟拓扑结构,有效地建立起一个基于 Internet 的完全分布式自组织网络路由模型
集中式自组织网络路由模型(hierarchical aggregation self-organizing network,简称 HASN).分别描述了 HASN
由模型的构建目标和体系结构,并详细分析了 HASN 采用的基于 P2P 计算模式的分布式命名 路由发现和更
算法 HASN_Scale,并在仿真实验的基础上,对 HASN 路由模型的性能进行了验证. -pick : through the use of peer-to-peer (P2P) computing model in the physical topology based on Internet established as a peer-to-peer network coverage (P overlay network) virtual topology, to establish an Internet-based Distributed completely self-organizing network routing model of a centralized self-organizing network Tongxinluo routing model (hierarchical aggregation self-Organization The driver, network, short HASN). HASN were described by the model of the goals and structure. and HASN detailed analysis of the peer-to-peer computing model based on distributed naming and routing algorithm found HASN _Scale and simulation on the basis of HASN routing model the performance of the test. Platform: |
Size: 630753 |
Author:aaaa |
Hits:
Description: 摘 : 通过使用 peer-to-peer(P2P)计算模式在 Internet 物理拓扑基础上建立一个称为 P2P 覆盖网络(P
overlay network)的虚拟拓扑结构,有效地建立起一个基于 Internet 的完全分布式自组织网络路由模型
集中式自组织网络路由模型(hierarchical aggregation self-organizing network,简称 HASN).分别描述了 HASN
由模型的构建目标和体系结构,并详细分析了 HASN 采用的基于 P2P 计算模式的分布式命名 路由发现和更
算法 HASN_Scale,并在仿真实验的基础上,对 HASN 路由模型的性能进行了验证. -pick : through the use of peer-to-peer (P2P) computing model in the physical topology based on Internet established as a peer-to-peer network coverage (P overlay network) virtual topology, to establish an Internet-based Distributed completely self-organizing network routing model of a centralized self-organizing network Tongxinluo routing model (hierarchical aggregation self-Organization The driver, network, short HASN). HASN were described by the model of the goals and structure. and HASN detailed analysis of the peer-to-peer computing model based on distributed naming and routing algorithm found HASN _Scale and simulation on the basis of HASN routing model the performance of the test. Platform: |
Size: 630784 |
Author:aaaa |
Hits:
Description: 校园网同时接入电信网和教育网，访问教育网时数度较慢，本文分析了电信网和教育网的IP地址分配情况和路由器的路由配置，提出了解决方案，设计了一种IP地址聚合的算法，并用C++实现了该算法，对电信网、教育网所分配的地址进行了分析。
网上关于教育网的网段数据要么是不全，要么就是记录数目太多，可通过路由归纳减少网段记录数目。路由归纳是当我们采用了一种体系化编址规划后的一种用一个IP地址代表一组IP地址的集合的方法。通过对路由进行归纳,我们能够将路由表条目保持为可管理的，而它可以带来以下益处：通过汇聚若干条路由记录为一条路由记录，有效减少了路由信息量，降低了CPU处理路由的负荷，路由器对存储空间的需求，同时也加快了路由表查找的速度。
在子网环境中，当网络地址是以2的指数形式的连续区块时，路由归纳是最有效的。
APNIC是管理亚太地区IP地址分配的机构，它有着丰富准确的IP地址分配库，同时这些信息也是对外公开的。基于上述目的，我们在APNIC whois database 网站，上下载到电信网和教育网地址分配文件chinanet和edu，下载时间为2007-9-22，两个文件格式基本相同。文件中描述了两种地址段分配：各单位所分配地址段、各DNS解析的地址段。-Campus Network at the same time access to telecommunications networks and Education Network, visit the Education nets several times slower, this article analyzes the telecommunications network and education network, IP address assignment and router s routing configuration, proposed solutions, designed a kinds of IP address aggregation algorithm, and use C++ implementation of the algorithm, telecommunication network, education network addresses assigned analyzed.
Online education network on the network segment the data are either incomplete, or the number of records is too many, can be summarized by the routing network segment to reduce the number of records. Routing induction is that when we adopted a system of addressing the planning as a form of an IP address with the IP addresses on behalf of a group of collection methods. Through the right route to induction, we are able to maintain the routing table entries to be managed, and it can bring the following benefits: that by collec Platform: |
Size: 439296 |
Author:zym |
Hits:
Description: Energy is one of the most important items to determine the network lifetime due to low power energy nodes included in the network. Generally, data aggregation tree concept is used to find an energy efficient solution. However, even the best aggregation tree does not share the load of data packets to the transmitting nodes fairly while it is consuming the lowest possible energy of the network. Therefore, after some rounds, this problem causes to consume the whole energy of some heavily loaded nodes and hence results in with the death of the network. In this paper, by using the Genetic Algorithm (GA), we investigate the energy efficient data collecting spanning trees to find a suitable route which balances the data load throughout the network and thus balances the residual energy in the network in addition to consuming totally low power of the network. Using an algorithm which is able to balance the residual energy among the nodes can help the network to withstand more and consequently extend its own lifetime. In this work, we calculate all possible routes represented by the aggregation trees through the genetic algorithm. GA finds the optimum tree which is able to balance the data load and the energy in the network. Simulation results show that this balancing operation practically increases the network lifetime. Platform: |
Size: 342534 |
Author:atrakpc@yahoo.com |
Hits:
Search - Aggregation Routing Algorithm