基于改进主动哈希的URL存储和查找算法

业务选择网关(SSG)从用户请求数据包中解析出URL,然后查找路由映射表进行路由选择.提出了一种基于改进主动哈希的URL存储和查找算法,该算法首先使用循环冗余校验(CRC)码对URL进行编码;接着引出访问度的概念,在此基础上对主动哈希算法进行改进,并用改进的主动哈希算法对URL进行散列.实验证明该算法的URL查找效率得到明显提高,并且也大大减少了存储空间.     

基于激光扫描的网络敏感数据智能存储系统设计

针对传统数据存储系统在存储网络敏感数据时安全性低的问题,设计一种新的数据智能存储系统。引入激光扫描技术,分别对系统的硬件和软件进行设计。硬件部分重点设计数据采集器、数据检测器和数据存储器,并给出每部分的线路图。根据硬件部分完成软件流程的设计,软件共分为网络敏感数据检测、网络敏感数据分类和网络敏感数据存储三步。为验证系统的工作效果,将其与传统存储系统进行对比实验。结果表明,基于激光扫描技术的存储系统,除了能够实现网络敏感数据的智能存储,还可以很好地拦截外来信号,为存储安全提供有力保证。     

试论视频服务器技术及其应用

一、视频服务器网络存储系统1.系统描述 理想的网络存储系统为服务器提供一种共享式存储结构。它通过同时为每个服务器提供共享存储空间,而减少所需的存储器总数,而且与各自独立的存储系统相比自动简化。基本的网络存储结构如右图     

基于闪存的高速大容量存储系统设计

介绍一种基于Flash和FPGA的高速大容量数据存储系统的组成机制和实现方法,并且给出了系统的硬件结构及软件设计流程.在分析了Flash结构和特点的基础上引用并行总线和多级流水技术实现了高速存储,采用ECC数据校验和自动屏蔽闪存坏块的方法提高了数据存储及回放的可靠性.实验结果表明,该存储系统工作稳定,存储速度高、容量大、可靠性好.     

一种云存储目录元数据管理系统

目前在云存储系统的实现中,一致性哈希算法及其改进算法是常用的技术之一。但是,基于一致性哈希算法实现的云存储往往表现为键值对系统,本身不具备层次的树形目录结构,因此不适用于传统的文件系统应用。针对上述技术缺陷,本文提出一种云存储目录元数据管理方案,在一致性哈希数据分布基础上构建层次目录,不需要专门的元数据服务器即可实现键值对和分布式存储系统相结合的层次目录管理。基于该方案实现的云存储系统已经大规模部署,很好的兼容了传统的文件系统应用,具有较好的可扩展性和灵活性。     

基于均衡学习的增强哈希桶模型研究

在使用哈希查找表构造IEEE 802.1Q协议中VLAN(虚拟局域网)网桥定义的过滤数据库时,哈希桶常被用于解决多个关键字对应同一个存储地址而造成的"哈希冲突"。传统哈希桶通过唯一的哈希地址获取整个学习表的资源,效率较低。文章提出了一种改进哈希表冲突的优化方法,通过双哈希桶和溢出桶来构造哈希表,并采用均衡学习的方式进行地址学习操作。该方法在双哈希桶溢出的情况下,将溢出条目暂存到溢出桶,并通知软件完成双哈希桶中冲突条目的释放和溢出桶中溢出条目的搬移操作。仿真实验结果表明,新的哈希算法可以有效减少哈希冲突的发生率,提高哈希表存储空间的利用率。     

基于对等网络的分布式存储系统的设计与实现

在基于节点分级的对等网络路由定位算法SP_Route的基础上实现一个分布式存储系统。通过采用可扩展的体系结构、稳定的通信协议、通信机制,简明的文件的组织和节点构造方式,在物理网络上叠加一个P2P网络层。将各个节点贡献的物理上分布的存储资源连接成对用户透明的文件存储系统。该系统能快速地搜索文件和进行路由定位,能为用户提供较稳定的存储服务。     

基于群体协同智能聚类的大数据存储系统设计

针对传统基于PSO聚类的大数据存储系统进行数据聚类时容易陷入局部最佳解,收敛效率低,数据存储性能差,设计一种基于群体协同智能聚类的大数据存储系统。基于群体协同智能聚类系统的层次结构,设计大数据存储系统的层次模型,并依据群体协同智能聚类的特征,设计大数据存储系统的体系结构。该系统采用的群体协同智能聚类方法在PSO算法中融入多种群协同进化的方案,避免出现局部最优解问题,将总体种群划分成多个子种群,各子种群独立进化,对共享信息实施周期性调控,获取最佳的数据聚类结果,提高数据聚类的效率和精度,增强大数据存储性能。实验结果说明所设计系统收敛性能高,并且具有较高的数据读写性能和分析性能。     

一种基于Bloom-filter表项压缩的TCAM业务识别算法

在三态内容寻址存储器(Ternary Content Addressable Memory, TCAM)表项宽度和存储容量约束下,该文提出一种基于匹配表项压缩的BF-TCAM算法,采用Bloom-Filter(BF)对匹配关键字进行单字节编码压缩关键字长度,解决了匹配吞吐率低和存储空间不足问题。针对BF在表项压缩过程带来的冲突率上升问题,引入向量存储空间策略,利用向量存储空间实现多个哈希函数映射,相对于比特向量策略,有利于降低匹配冲突率。测试实验表明,相对于传统的TCAM匹配算法,BF-TCAM算法不但提高了匹配吞吐率和存储空间利用率,同时可有效降低BF压缩产生的冲突率。     

一种基于Bigram二级哈希的中文索引结构

为通过构建高速的中文索引结构来提高Off-line模式的串匹配速度,提出了一种基于Bigram二级哈希的中文索引结构。该索引采用中文GB2312编码处理中文汉字,以中文Bigram项作为词汇项,并实现了基于二级哈希的词汇表存储结构。实验数据显示,本文索引结构虽然占用存储空间为词索引的2倍多,但其匹配速度是词索引的4倍多。结果表明本文索引在中文匹配中具有速度优势。     

Efficient implementation of error correction codes in hash tables

Hash tables are one of the most commonly used data structures in computing applications. They are used for example to organize a data set such that searches can be performed efficiently. The data stored in a hash table is commonly stored in memory and can suffer errors. To ensure that data stored in a memory is not corrupted when it suffers errors, Error Correction Codes (ECCs) are commonly used. In this research note a scheme to efficiently implement ECCs for the entries stored in hash tables is presented. The main idea is to use an ECC as the hash function that is used to construct the table. This eliminates the need to store the parity bits for the entries in the memory as they are implicit in the hash table construction thus reducing the implementation cost.     

Power‐efficient routing for SDN with discrete link rates and size‐limited flow tables: A tree‐based particle swarm optimization approach

Software‐defined networking is a promising networking paradigm for achieving programmability and centralized control in communication networks. These features simplify network management and enable innovation in network applications and services such as routing, virtual machine migration, load balancing, security, access control, and traffic engineering. The routing application can be optimized for power efficiency by routing flows and coalescing them such that the least number of links is activated with the lowest link rates. However, in practice, flow coalescing can generally overflow the flow tables, which are implemented in a size‐limited and power‐hungry ternary content addressable memory (TCAM). In this paper, a set of practical constraints is imposed to the software‐defined networking routing problem, namely, size‐limited flow table and discrete link rate constraints, to ensure applicability in real networks. Because the problem is NP‐hard and difficult to approximate, a low‐complexity particle swarm optimization–based and power‐efficient routing (PSOPR) heuristic is proposed. Performance evaluation results revealed that PSOPR achieves more than 90% of the optimal network power consumption while requiring only 0.0045% to 0.9% of the optimal computation time in real‐network topologies. In addition, PSOPR generates shorter routes than the optimal routes generated by CPLEX.     

软件定义无人机自组网高效自适应路由维护机制

为解决软件定义无人机自组网路由维护存在的控制开销和数据包延迟偏大的问题,基于现有的OpenFlow协议提出了一种高效自适应的软件定义无人机自组网路由维护机制( Efficient and Adaptive Software-defined Unmanned Aerial Vehicle Ad Hoc Network R...     

Load Balancing Technique for Congestion Control Multipath Routing Protocol in MANETs

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes that can communicate without a central controller or fixed infrastructure. Due to node mobility, designing a routing protocol to provide an efficient and suitable method to route the data with less energy consumption, packet drop and to prolong the network lifetime has become a challenging issue in MANETs. In MANETs, reducing energy consumption and packet loss involves congestion control and load balancing techniques. Thus, this paper introduces an efficient routing technique called the multipath load balancing technique for congestion control (MLBCC) in MANETs to efficiently balance the load among multiple paths by reducing the congestion. MLBCC introduces a congestion control mechanism and a load balancing mechanism during the data transmission process. The congestion control mechanism detects the congestion by using an arrival rate and an outgoing rate at a particular time interval T. The load balancing mechanism selects a gateway node by using the link cost and the path cost to efficiently distribute the load by selecting the most desirable paths. For an efficient flow of distribution, a node availability degree standard deviation parameter is introduced. Simulation results of MLBCC show the performance improvements in terms of the control overhead, packet delivery ratio, average delay and packet drop ratio in comparison with Fibonacci sequence multipath load balancing, stable backbone-based multipath routing protocol and ad hoc on demand multipath distance vector routing. In addition, the results show that MLBCC efficiently balances the load of the nodes in the network.

     

一种动态寻路中的机会转发模型

动态寻路（Dynamic Routing）是一项用以解决城市交通拥堵的智能交通技术.通过让一些车辆产生和转发路况拥堵消息,另一些车辆能够避开拥堵路段,从而缓解交通状况.以“存储-携带-转发”为通信模式的机会网络被广泛运用于动态寻路研究.文中提出了一种新型路况信息的机会转发算法,算法综合考虑车辆的位置和行驶方向.仿真实验表明,算法在保持信息散布效果的前提下,显著降低了网络负载,提升了效率.     

A New Energy Efficient Hierarchical Routing Protocol for Wireless Sensor Networks

Wireless sensor networks consist of low cost sensor nodes which have limited power supplies, memory capacity, processing capability and transmission rate. Sensor nodes gather information from the environment and send the collected information to base station with help of a routing cooperation. Because of limited resources in Wireless Sensor Networks, fulfilling these routing operations is a major problem. Routing protocols are used to perform these operations. The most important thing by considering while these protocols are designed is energy efficiency. Because wireless sensor networks are widely used in intelligent systems, the energy efficiency of these networks is very important in IoT. Researchers have proposed several hierarchical routing protocols such as LEACH, PEGASIS, TEEN and APTEEN. In this study, an energy efficient routing protocol is developed which is more efficient than currently avaliable routing protocols. The developed protocol involves mapping of the network, sleep–wake/load balancing, data merge processes. The proposed protocol gives better results than other protocols in number of surviving nodes and amount of energy consumed criterias.     

A framework for inter-domain routing in virtual coordinate based mobile networks

Routing is considered to be one the most challenging problems in mobile ad hoc networks. It has been shown that the use of virtual coordinates or identifiers for efficient routing and data management has several advantages compared to classical topology control techniques based on pre-defined addresses or geographical coordinates. However, these advantages only hold for single domain networks with limited mobility. In a previous paper, we discussed the challenges arising from using virtual coordinates for routing (to a particular destination ID or to indexed data or resources) in mobile networks in multi-domain network scenarios. We developed a solution by managing data with a distributed hash table scheme. Based on our virtual cord protocol, we then implemented inter-domain routing using appropriate indirections. That approach, however, was still limited in finding efficient routes over multiple transit networks. In this paper, we extend that work by defining a framework for optimized inter-domain routing. In particular, we investigate the use of ant colony optimization for optimizing routes between multiple network domains. We show how distributed routing tables can be created and maintained and we outline a heuristic for finding candidate routes. Simulation experiments confirm the efficiency of the selected routes both on a intra and on a inter-domain level.     

Load balancing routing for single-layered satellite networks

The varying population density leads to imbalanced utilization rate of satellites. To ensure an intelligent engineering of traffic over satellite networks, a distributed routing scheme for single-layered satellite network, load balancing routing protocol based on mobile agent (LBRP-MA) is proposed. For LBRP-MA, mobile agents explore route by migrating autonomously. Upon arriving at destination, mobile agents migrate back. On each intermediate satellite, mobile agents evaluate path cost considering satellite geographical position as well as inter-satellite link (ISL) cost, and finally take ISL congestion index into account to update routing tables. Through simulations on the Courier-like constellation, the proposed approach is shown to achieve guaranteed end-to-end delay bound and decrease packet loss ratio with better throughput, which is especially suitable for data transferring in case of high traffic load. Moreover, results of the complexity analysis demonstrate that LBRP-MA can have low onboard signaling, storage and computation requirements. Furthermore, issues of LBRP-MA such as ISL congestion index and cost modification factor are discussed.     

A resource-efficient and scalable wireless mesh routing protocol

By binding logic addresses to the network topology, routing can be carried out without going through route discovery. This eliminates the initial route discovery latency, saves storage space otherwise needed for routing table, and reduces the communication overhead and energy consumption. In this paper, an adaptive block addressing (ABA) scheme is first introduced for logic address assignment as well as network auto-configuration purpose. The scheme takes into account the actual network topology and thus is fully topology-adaptive. Then a distributed link state (DLS) scheme is further proposed and put on top of the block addressing scheme to improve the quality of routes, in terms of hop count or other routing cost metrics used, robustness, and load balancing. The network topology reflected in logic addresses is used as a guideline to tell towards which direction (rather than next hop) a packet should be relayed. The next hop is derived from each relaying node’s local link state table. The routing scheme, named as topology-guided DLS (TDLS) as a whole, scales well with regard to various performance metrics. The ability of TDLS to provide multiple paths also precludes the need for explicit route repair, which is the most complicated part in many wireless routing protocols. While this paper targets low rate wireless mesh personal area networks (LR-WMPANs), including wireless mesh sensor networks (WMSNs), the TDLS itself is a general scheme and can be applied to other non-mobile wireless mesh networks.     

DSR路由协议的改进

DSR路由协议是移动Ad Hoc网络常用的按需路由协议之一。由于采用洪泛机制寻找和维护路由表,DSR路由协议能量开销高、分组交付率低。针对此问题,提出局部化路由查询方法,限制路由请求跳数,改进DSR路由协议的路由发现过程,有效地平衡了路由信息存储量、网络拥塞和能量消耗。分析表明,改进的DSR路由协议将路由请求分组控制在一定的网络范围内,减少数据传输时延、降低网络能量开销。仿真结果显示,在选择适当的最大跳数时,改进的DSR路由协议在分组交付率、路由载荷方面均优于传统的DSR路由协议。