A survey on energy-aware security mechanisms

The increasing adoption of mobile devices as the preferred tool to access the Internet imposes to deepen the investigation of security aspects. In parallel, their power constrained nature must be explicitly considered in order to analyze security in an effective and comprehensive manner. This aspect, which is often neglected in the literature, allows investigating two important behaviors of mobile devices: (i) evaluate if all the layers accounting for privacy and security can be re-engineered or optimized to save power, and (ii) understand the effectiveness of draining energy to conduct attacks.In this perspective, this paper surveys and highlights the most recent work on energy-awareness and security. Also, it summarizes the current state of the art on general techniques to save energy, as well as tools to perform measurements. The major contributions of this survey are, thus, a review of past work aimed at minimizing the energy footprint of security mechanisms, and the identification of promising research trends, such as detecting attacks via anomalous power consumption.     

Energy-aware traffic engineering: A routing-based distributed solution for connection-oriented IP networks

The present paper deals with energy saving in IP networks and proposes a distributed energy-aware traffic engineering solution, named DAISIES, for switching off network links according to traffic variations. DAISIES works in a connection-oriented network, e.g. an IP/MPLS network, and follows a routing-based approach, i.e. it acts on the routing algorithm whilst link switch-off/on are consequence of routing decisions. The basic idea is to re-compute the path of each traffic demand when its requested capacity changes. A specific cost function is used to compute link weights into the shortest path routing algorithm with the goal of keeping unused as many links as possible. The main advantages of DAISIES can be summarized as follows: (i) no changes are required to current routing and signaling protocols, (ii) packet loss is completely avoided, (iii) both traffic decreasing and increasing and changing network conditions are automatically managed, and (iv) link switch-off/on take place transparently to the routing protocol and to other nodes. The performance of the proposed solution is evaluated in terms of energy saving relative to a static network optimized to support the peak traffic. Results show that DAISIES is able to save about 30% of energy in several traffic conditions. Moreover, it is shown that it is possible keeping the additional complexity low and still reaching high energy efficiency.     

动态二进制翻译中的冗余LOAD删除优化技术

动态二进制翻译系统是根据程序的动态执行信息来将源机器上的可执行代码翻译成目标机器上的可执行代码.在翻译成中间表示的过程中会产生一些冗余的LOAD指令,为提高代码的执行效率,提出对这些LOAD指令进行冗余删除优化.该优化技术可以使优化效果超过其自身的开销,达到优化的目的.     

基于冗余消除和属性数值化的XACML策略优化方法

可扩展的访问控制标记语言(eXtensible Access Control Markup Language,XACML)逐渐成为访问控制的标准之一。为了确保系统可用性,访问控制系统需要高效的XACML策略评估引擎。针对这一问题,从XACML策略本身潜在的不足出发,从冗余消除和属性数值化两个方面对XACML策略进行了优化。冗余消除在不影响策略评估结果的前提下去除策略库中的冗余规则,同时结合规则压缩消除规则间的冗余状态。属性数值化将文本的XACML策略属性转化为数值属性,使评估引擎匹配使用高效的数值匹配方式而不是低效的字符串匹配方式,同时使用Hash表结构存储数值属性与文本属性的映射关系有利于策略维护。仿真实验结果表明,提出的策略优化方法的性能与原始Sun XACML 相比有较大提升。     

Dynamic power management in energy-aware computer networks and data intensive computing systems

Energy awareness is an important aspect of modern network and computing system design and management, especially in the case of internet-scale networks and data intensive large scale distributed computing systems. The main challenge is to design and develop novel technologies, architectures and methods that allow us to reduce energy consumption in such infrastructures, which is also the main reason for reducing the total cost of running a network. Energy-aware network components as well as new control and optimization strategies may save the energy utilized by the whole system through adaptation of network capacity and resources to the actual traffic load and demands, while ensuring end-to-end quality of service. In this paper, we have designed and developed a two-level control framework for reducing power consumption in computer networks. The implementation of this framework provides the local control mechanisms that are implemented at the network device level and network-wide control strategies implemented at the central control level. We also developed network-wide optimization algorithms for calculating the power setting of energy consuming network components and energy-aware routing for the recommended network configuration. The utility and efficiency of our framework have been verified by simulation and by laboratory tests. The test cases were carried out on a number of synthetic as well as on real network topologies, giving encouraging results. Thus, we come up with well justified recommendations for energy-aware computer network design, to conclude the paper.     

移动自组织网络路由选择算法研究进展

移动Ad Hoc无需基础设施,可支持高动态的移动数据通信,具有广泛应用的前景。然而,其高动态特性导致互联网现有路由协议不再适用。近年来学者针对Ad Hoc网络提出了大量的路由选择算法。给出了各种路由技术分类方法,简述了Ad Hoc网络的基本路由协议和路由选择算法,进而从预测模型、能量模型、位置信息、服务质量控制和安全支持等5个角度,深入分析了当前Ad Hoc网络路由选择算法的最新研究进展。预测模型通过基于历史信息的移动预测,降低了路由选择的时间代价;能耗模型则采用适当的数学模型来描述网络能耗情况,在选路过程中实现了分组传送的能耗最小化和能量负担均衡之间的权衡;基于位置的路由选择算法根据节点的地理位置来标识目的地,从而利用该地理位置信息进行路由选择;服务质量感知的路由选择算法在本地计算中考虑带宽、延迟、能量和电池生命周期,从而在选路过程中提供了服务质量支持;安全路由选择算法则利用适合移动Ad Hoc网络的密钥、哈希链、电子签名等技术对协议交互消息进行加密来保障网络安全。最后从通信开销、计算和存储开销、路径数量、关键节点的存在性以及算法类型等方面详细对比总结了近年来提出的30余种典型路由选择算法,指出了各自的特点...     

Minimum–Maximum regret redundancy allocation with the choice of redundancy strategy and multiple choice of component type under uncertainty

This paper deals with a redundancy allocation problem in series–parallel systems with the choice of redundancy strategy, including active and cold standby strategies in which component’s time to failure follows an Erlang distribution. The scale parameter of Erlang distribution and consequently the reliability of each component are imprecise in terms of interval data, and only the lower and upper bounds are known. This problem, for the first time, is formulated through Min–Max regret criterion, which is commonly used to define robust solutions. The resulting problem formulation contains an unlimited number of constraints, and a Benders’ decomposition method is implemented to deal with the given problem. This method is compared with an enumeration method to show its effectiveness. The performance of the proposed model using the Benders’ decomposition method is examined over different problem sizes, and the associated results are analyzed.     

延迟容忍网络路由协议研究*

简介延迟容忍网络,论述和追踪国内外延迟容忍网络路由协议的研究进展,对现有的延迟容忍网络路由协议进行了分类研究,着重介绍了一些经典路由协议,对不同类别路由协议的特点和性能进行了分析和比较,并详细介绍了冗余副本消除,最后提出延迟容忍网络路由协议需要解决的问题和进一步的研究方向。     

基于ICN网络架构的社区感知型MSN路由机制

移动社交网络(mobile social network,简称MSN)利用移动用户之间的社交关系,通过节点间的协作式转发实现消息交付.然而,随着大数据时代的到来,MSN需要满足移动用户日益增长的对内容(如视频)的需求.由于信息中心网络(information-centric networking,简称ICN)对移动性的支持,基于ICN架构,提出了一种MSN中基于社区划分的路由机制.在兴趣决策中,利用节点请求中的内容名字获取用户的兴趣偏好,进而计算用户间的兴趣差异度量;根据兴趣差异将节点划分为兴趣社区,依据这些兴趣社区进行兴趣包路由.在数据决策中,根据节点历史相遇信息计算用户间的相遇规律度量,根据相遇规律将节点划分为社交社区,依据这些社交社区进行数据包路由.同时,根据兴趣社区和社交社区信息优化节点的内容缓存,以快速满足未来的内容请求.进行了仿真实验,通过与现有机制在包交付率、平均延迟、平均跳数和网络开销方面的性能对比,表明所提出的机制是可行且有效的.     

A cross-layer optimization based integrated routing and grooming algorithm for green multi-granularity transport networks

With the development of IP networks and intelligent optical switch networks, the backbone network tends to be a multi-granularity transport one. In a multi-granularity transport network (MTN), due to the rapid growth of various applications, the scale and complexity of network devices are significantly enhanced. Meanwhile, to deal with bursty IP traffic, the network devices need to provide continuous services along with excessive power consumption. It has attracted wide attention from both academic and industrial communities to build a power-efficient MTN. In this paper, we design an effective node structure for MTN. Considering the power savings on both IP and optical transport layers, we propose a mathematical model to achieve a cross-layer optimization objective for power-efficient MTN. Since this optimization problem is NP-hard (Hasan et al. (2010)  [11]) and heuristic or intelligent optimization algorithms have been successfully applied to solve such kinds of problems in many engineering domains (Huang et al. (2011)  [13], Li et al. (2011)  [17] and Dong et al. (2011)  [5]), a G  reen integrated R$R$outing and Grooming algorithm based on Biogeography-Based Optimization (Simon (2008)  [23]) (GRG_BBO) is also presented. The simulation results demonstrate that, compared with the other BBO based and state-of-the-art power saving approaches, GRG_BBO improves the power savings at a rate between 2%–15% whilst the high-level multi-user QoS (Quality of Services) satisfaction degree (MQSD) is guaranteed. GRG_BBO is therefore an effective technique to build a power-efficient MTN.     

Effective elimination of redundant association rules

It is well-recognized that the main factor that hinders the applications of Association Rules (ARs) is the huge number of ARs returned by the mining process. In this paper, we propose an effective solution that presents concise mining results by eliminating the redundancy in the set of ARs. We adopt the concept of δ tolerance to define the set of δ-Tolerance ARs (δ-TARs), which is a concise representation for the set of ARs. The notion of δ-tolerance is a relaxation on the closure defined on the support of frequent itemsets, thus allowing us to effectively prune the redundant ARs. We devise a set of inference rules, with which we prove that the set of δ-TARs is a non-redundant representation of ARs. In addition, we prove that the set of ARs that is derived from the δ-TARs by the inference rules is sound and complete. We also develop a compact tree structure called the δ-TAR tree, which facilitates the efficient generation of the δ-TARs and derivation of other ARs. Experimental results verify the efficiency of using the δ-TAR tree to generate the δ-TARs and to query the ARs. The set of δ-TARs is shown to be significantly smaller than the state-of-the-art concise representations of ARs. In addition, the approximation on the support and confidence of the ARs derived from the δ-TARs are highly accurate.     

随机虚拟骨干树结合改进BDCP的无线传感器网络多级路由算法

针对无线传感器网络(WSN)中传统路由算法簇首能量消耗不平衡而限制网络寿命的问题,提出了一种基于随机虚拟骨干树(RVBT)结合改进退避分布式聚类协议(IBDCP)的能量感知路由算法。首先,将所有传感器节点组成不同的簇;然后,利用IBDCP为每个节点初始化时间延迟,并开始竞争;最后,节点通过考虑自己的剩余能量和距离决定是否加入CH,汇聚节点构建CH的随机虚拟骨干树,以促进数据的路由。仿真结果表明,该算法能够实现恒定消息和线性时间复杂度,在网络寿命、能量消耗和其他参数方面均优于其他现有的算法,其中网络寿命比EMRA延长至少15%,比退避分布式聚类(BDCP)延长至少150%。     

协议无关的数据中心网络源路由机制研究

传统数据中心网络已经不能满足当前大规模网络和云计算架构的需求, 传统数据中心网络的路由策略会导致转发单元的臃肿; 同时当规模增大时传统网络中的拓扑管理策略也不再适用. 协议无感知转发技术是软件定义网络中转发平面的一种创新技术. 本文结合源路由和协议无感知转发技术, 提出两种数据中心网络的关键技术: 首先, 设计一种协议无关的源路由机制, 从而简化转发单元; 其次, 提出一种主机和控制器间协作的拓扑管理算法, 从而减少探测包的冗余. 最后, 本文在数据中心网络中实现了以上技术, 实验结果表明本文提出的源路由机制可以有效降低转发单元的流表规模, 拓扑管理策略可以极大地减少探测包的冗余.     

基于深度学习的SDN虚拟蜜网路由优化

针对传统蜜网所致的成本昂贵、流量控制不便及动态调整困难等问题,提出使用SDN、ODL与Mininet技术部署轻量级虚拟蜜罐,组建虚拟蜜网拓扑,使用深度学习技术DDPG优化路由选择路径.通过实验表明,优化后的路由选择机制具备动态调整网络结构,有较好的收敛性和选择性.使得网络在遭受攻击时,能将攻击转向蜜网,从而减少攻击造成的危害,增强网络主动防御能力.     

大数据访问中信息传输冗余量消除仿真

针对传统的大数据访问中信息传输冗余量消除方法存在查全率、信息传输冗余量消除效率以及速率较低等问题,提出了基于Hamming距离值的大数据访问中信息传输冗余量消除方法。利用滑动以及滚动相结合的窗口移动模式减少窗口计算量,将Rsync滚动校验算法以及MD5算法相结合,在文件任意位置开始计算滚动校验值,通过递进关系,获取连续数据块的校验值,根据不同数据块的校验值进行数据匹配。将经过匹配后的数据块利用CDC分块检测算法进行检测,根据余弦相似度计算公式以及Hamm距离值计算相似度,实现大数据访问中信息传输冗余量消除。实验结果表明,所提方法有效提高了冗余信息查全率、信息传输冗余量消除效率以及速率,能够快速、准确地消除多余的信息。     

基于SDN与NDN的卫星网络多约束路由算法

针对NDN卫星网络内容传输时延高、丢包率高且请求命中率低的问题,提出了一种基于SDN与NDN的卫星网络多约束路由算法,并命名为SNMcRA。基于SDN的集中控制与全局视图,通过建立多约束路由模型,将链路多约束信息与蚁群算法相结合以求解满足时延、带宽、丢包率多约束的代价最小路径,由节点在包转发的过程中动态完成转发表FIB和待定请求表PIT的构建。实验结果表明,该算法与DSP算法相比时延降低了35%,带宽利用率提升了29%,丢包率降低了17%,并且在请求命中率方面也具有显著优势。     

Greener networking in a network virtualization environment

Energy consumption of network operators can be minimized by the dynamic and smart relocation of networking resources. In this paper, we propose to take advantage of network virtualization to enable a smart energy aware network provisioning. The virtualization of networking resources leads to the problem of mapping virtual demands to physical resources, known as Virtual Network Embedding (VNE). Our proposal modifies and improves exact existing energy aware VNE proposals where the objective is to switch off as many network nodes and interfaces as possible by allocating the virtual demands to a consolidated subset of active physical networking equipment. As exact energy efficient VNE approaches are hard to solve for large network sizes and have an adverse effect in the number of successful embeddings, an heuristic approach to reconfigure the allocation of already embedded virtual networks, minimizing the energy consumption, is also proposed.     

基于最小费用最大流的MANET网络路由能量控制模型

MANET是当前无线网络研究的热点领域,作为网络层核心技术的路由协议显得尤为重要。控制节点能量、提高网络生存时间是实现在MANET中传输高效业务的关键。本文借鉴网络最小费用最大流思想,建立网络最大剩余能量最短路数学模型,提出了基于能量控制的网络路由优化模型。并且定义了网络生存时间作为评价指标,进行网络仿真。仿真结果表明,该模型可以有效地延长网络生存时间。     

基于遗传算法的防止无线移动网络路由攻击策略

在无线移动网络中,恶意节点可以通过发送虚假信息和假路由信息、广播假链接等中断路由操作对网络进行攻击。本文在分析了几种常见路由攻击的基础上,提出了一种基于遗传算法的路由优化策略。实验数据表明,这种优化策略可以较好地预防路由攻击,提高网络的整体性能。     

无线传感器网络最优路由算法研究

无线传感器网络存在拓扑规模庞大、Mesh组网及传感器结点能量有限和处理能力差的缺点。为提高无线传感器网络路由效率,提出一种简单的全局路由最优算法。该算法根据变量r的不同取值,使算法输出路径不同,进而预防网络拥塞的发生。仿真实验表明,并行近似最短路由算法所耗时间是Dijkstra算法的1/3,该算法既能满足无线传感器路由需求,又能解决无线传感器网络拥塞的问题。