In the traditional Intemet Protocol （IP） architecture, there is an overload of IP sermntic problems. Existing solutions focused mainly on the infrastructure for the fixed network, and there is a lack of support for ...In the traditional Intemet Protocol （IP） architecture, there is an overload of IP sermntic problems. Existing solutions focused mainly on the infrastructure for the fixed network, and there is a lack of support for Mobile Ad Hoc Networks （MANETs）. To improve scalability, a routing protocol for MANETs is presented based on a locator named Tree-structure Locator Distance Vector （TLDV）. The hard core of this routing method is the identifier/locator split by the Distributed Hash Table （DHT） method, which provides a scalable routing service. The node locator indicates its relative location in the network and should be updated whenever topology changes, kocator space ks organized as a tree-structure, and the basic routing operation of the TLDV protocol is presented. TLDV protocol is compared to some classical routing protocols for MANETs on the NS2 platform Results show that TLDV has better scalability. Key words：展开更多
针对命名数据网络在网络规模增大时造成的转发信息表(Forwarding Information Base,FIB)中的名称条目呈指数级爆炸性增长、内存占用大、名称查找速度慢等问题,提出了一种基于流行度和CDT的名称查找方案。该方案将FIB划分为计数布隆过滤...针对命名数据网络在网络规模增大时造成的转发信息表(Forwarding Information Base,FIB)中的名称条目呈指数级爆炸性增长、内存占用大、名称查找速度慢等问题,提出了一种基于流行度和CDT的名称查找方案。该方案将FIB划分为计数布隆过滤器(Counting Bloom Filter,CBF)、流行FIB、Conflict-split Degraded Trie(“冲突拆分”Degraded Trie,CDT)以及辅助FIB。CBF用于快速筛选掉不在FIB中的名称前缀,流行FIB用于高流行度的名称前缀的快速转发,CDT用于减少树的深度以及节点的数目,辅助FIB用于辅助流行FIB的更新以及CDT中节点的快速定位。实验结果表明,该方案在创建时间、查找时间、内存占用上存在优化效果,从而提升了NDN中FIB的存储和名称查找性能。展开更多
In this paper, we study the problem of rule extraction from data sets using the rough set method. For inconsistent rules due to improper selection of split-points during discretization, and/or to lack of information, ...In this paper, we study the problem of rule extraction from data sets using the rough set method. For inconsistent rules due to improper selection of split-points during discretization, and/or to lack of information, we propose two methods to remove their inconsistency based on irregular decision tables. By using these methods, inconsistent rules are eliminated as far as possible, without affecting the remaining consistent rules. Experimental test indicates that use of the new method leads to an improvement in the mean accuracy of the extracted rules.展开更多
基金Acknowledgements This work was supported by the Hi-Tech Research and Development Program of China under Grant No.2007AA01Z407 the Co-Funding Project of Beijing Municipal education Commission under Grant No.JD100060630+3 种基金 National Foundation Research Project the National Natural Science Foundation Project under Grant No. 61170295 the Project of Aeronautical Science Foundation of China under Caant No.2011ZC51024 and the Fundamental Research Funds for the Central Universities.
文摘In the traditional Intemet Protocol （IP） architecture, there is an overload of IP sermntic problems. Existing solutions focused mainly on the infrastructure for the fixed network, and there is a lack of support for Mobile Ad Hoc Networks （MANETs）. To improve scalability, a routing protocol for MANETs is presented based on a locator named Tree-structure Locator Distance Vector （TLDV）. The hard core of this routing method is the identifier/locator split by the Distributed Hash Table （DHT） method, which provides a scalable routing service. The node locator indicates its relative location in the network and should be updated whenever topology changes, kocator space ks organized as a tree-structure, and the basic routing operation of the TLDV protocol is presented. TLDV protocol is compared to some classical routing protocols for MANETs on the NS2 platform Results show that TLDV has better scalability. Key words：
基金the Basic Research Foundation of Tsinghua University (No. JC2001029) and the National High-Tech Research and Development Program of China (No. 863-511-930-004)
文摘In this paper, we study the problem of rule extraction from data sets using the rough set method. For inconsistent rules due to improper selection of split-points during discretization, and/or to lack of information, we propose two methods to remove their inconsistency based on irregular decision tables. By using these methods, inconsistent rules are eliminated as far as possible, without affecting the remaining consistent rules. Experimental test indicates that use of the new method leads to an improvement in the mean accuracy of the extracted rules.
