软件定义网络中快速和一致的流更新策略

在软件定义网络中,为了实现各种网络性能优化目标,控制面需要频繁的对数据面进行更新.然而,由于数据面的异步性,不合理的更新将严重降低网络性能.针对此问题,该文提出一种快速和一致的流更新策略(FCFU).该策略通过流分段减弱其原有的强依赖关系,使能并行更新,通过分析子流段与多个资源间的依赖关系得到总更新轮数较少的更新安排,最后基于延时队列完成一致性流更新.实验结果表明,与现有的流更新算法相比,该策略能够缩短流更新总时间达20.6％,同时保证了更新期间无拥塞和包乱序等问题的发生.     

基于启发式调度的OpenFlow网络规则一致更新方案

针对OpenFlow网络在状态转换过程中会暂时性出现转发回路、路由黑洞和违反访问控制策略等问题,提出了一种基于启发式调度的规则一致更新方案.首先,设计基于谓词的更新分解算法,利用并行网络属性验证技术得到子更新依赖图;其次,采用任务图生成算法对子更新依赖图进行分割,降低更新调度的复杂度;之后,设计启发式更新调度算法,采用规则增删操作交替执行策略,减少交换机的规则存储开销,并通过建立更新实施和监听并发执行机制,提升更新效率.仿真实验从更新时间开销和更新过程中交换机规则存储开销两方面验证了方案的有效性.     

软件定义网络中一种快速无循环路径迁移策略

针对软件定义网络中数据平面转发设备的分布式部署及异步操作导致的路径迁移缓慢及故障等问题,提出了一种快速无循环路径迁移策略。首先,提出了一种基于节点排序的快速循环检测算法。该算法通过对比流的新旧路径上相邻节点的位置差异,可快速判定路径迁移过程中是否存在转发循环以及检测循环发生位置。然后,提出了一种基于节点松弛依赖关系的贪婪更新机制。该机制利用快速循环检测算法发掘出新旧路径上公有交换机之间存在的松弛依赖关系,进而保证了迁移过程每轮更新的交换机数量最大化。仿真实验结果表明,相比于现有迁移方案,所提策略在不同网络状态下均可有效避免迁移循环且获得最佳更新时间开销。     

软件定义WSN规则一致更新研究

遵循控制转发分离思想,软件定义无线传感器网络（Wireless Sensor Network,WSN）数据转发采用基于流的实现方式.因此,软件定义WSN规则更新过程中节点行为可能违背网络属性一致性.针对此,提出每包前向一致性概念,并证明其可保持所有网络属性的更新一致性.在此基础上,通过引入缓存节点与缓存规则简化规则依赖关系,提出一种规则前向一致更新算法,在满足每包前向一致性的同时,支持规则快速并行更新.实验结果表明,算法在规则开销、更新时间和通信开销等关键性能指标上具有较为明显的优势.     

利用小区更新规避掉话

TD-SCDMA系统掉话主要为上下行的无线链路控制层和L1层失步问题。下行L1层失步,可通过小区更新流程,使用户终端选择合适的小区,恢复业务,而上行L1层失步和上下行RLC层问题,系统都会释放资源,造成掉话。通过对RLC层及L1层失步问题的分析,结合小区更新流程进一步研究,提出以小区更新规避RLC层及L1层失步问题引起的掉话,通过合理设置及用户终端、系统侧的策略修改,使终端及网络策略更合理,性能更优。     

基于移动代理的一种减少网络负载的数据更新机制

针对分布式控制中，节点间的信息广播武交换，占用了大量网络资源这一问题，文章介绍了基于移动代理的负载均衡结构，在传统负载信息更新的基础上，提出了基于移动代理的减少网络负载的新更新机制ULIMA算法，较大的提高了系统的性能和效率，并通过仿真实验证明了该数据更新机制的有效性。     

模式分解保持函数依赖的意义

规范化过程通过模式分解提高关系的范式级别,分解的评判准则是无损连接性和保持函数依赖。文中证明了保持函数依赖的一个定理,说明了模式分解保持函数依赖的意义是在减小数据冗余度的同时不会影响数据更新的性能,通过具体分析实例进一步说明了该结论。     

无线传感网络节点软件高效远程更新方法设计

以MSP430F149单片机为例,针对无线传感网络中节点软件维护与更新成本较高的难题,设计了一种无线传感网络节点软件远程更新方法。通过程序文件差异比较、变格式传输和数据压缩提高了远程更新效率,通过程序冗余存储和强制更新提高了远程更新的可靠性。经过高速铁路现场应用情况表明,该方法可显著降低节点维护更新成本、远程更新稳定可靠,适于推广。     

应用于协议无感知转发交换机的流缓存方法

协议无感知转发支持任意协议的解析和处理,增强了软件定义网络的可编程能力。为提高转发性能,该文提出一种应用于协议无感知转发交换机的流缓存方法,通过识别匹配和动作的依赖关系,得到匹配字段的绝对位置,用以预先解析报文。为确保流缓存的加速效果,根据匹配类型与表项数量选择应用流缓存的流表。此外,该文对比了单流表缓存与多流表缓存对转发性能的提升,并提出了根据网络流量实际情况的自适应切换策略。通过扩展POFSwitch实现所提方法,并用实际规则与骨干网流量进行验证,应用流缓存后,交换机报文转发速率提升了220%。流缓存可以为可编程数据平面提供更高的转发性能。     

怎样消除移动通信网络中的乒乓位置更新效应

本文介绍了移动通信网络中的乒乓位置更新效应的产生原因及各种方案对其抑制或消除的原理和性能。然后引出一种既简单易行又能从根本上完全消除乒乓位置更新效应的位置管理模型。这种模型还能与最优位置更新策略和最优寻呼策略同时使用 ,使位置管理开销降到最低。     

A genetic algorithm‐based flow update scheduler for software‐defined networks

Software‐defined networking (SDN) facilitates network programmability through a central controller. It dynamically modifies the network configuration to adapt to the changes in the network. In SDN, the controller updates the network configuration through flow updates, ie, installing the flow rules in network devices. However, during the network update, improper scheduling of flow updates can lead to a number of problems including overflowing of the switch flow table memory and the link bandwidth. Another challenge is minimizing the network update completion time during large‐network updates triggered by events such as traffic engineering path updates. The existing centralized approaches do not search the solution space for flow update schedules with optimal completion time. We proposed a hybrid genetic algorithm‐based flow update scheduling method (the GA‐Flow Scheduler). By searching the solution space, the GA‐Flow Scheduler attempts to minimize the completion time of the network update without overflowing the flow table memory of the switches and the link bandwidth. It can be used in combination with other existing flow scheduling methods to improve the network performance and reduce the flow update completion time. In this paper, the GA‐Flow Scheduler is combined with a stand‐alone method called the three‐step method. Through large‐scale experiments, we show that the proposed hybrid approach could reduce the network update time and packet loss. It is concluded that the proposed GA‐Flow Scheduler provides improved performance over the stand‐alone three‐step method. Also, it handles the above‐mentioned network update problems in SDN.     

A novel method of link-state update in wavelength-routed networks

Link-state update is a critical component of the routing protocol in wavelength-routed networks. High-frequency updates impose heavy traffic on network control channels as well as excessive burden of electronic processing, while stale link-state information seriously degrades network performance. Therefore, a tradeoff has to be made between control overhead and network blocking probability. This paper proposes a novel link-state update method. By actively regulating the link-state update rate, the proposed method efficiently handles the inherent burstiness of link-state changes without overloading control network with excessive update messages. To improve the blocking performance under limited control bandwidth, it assigns different types of updates with different priorities such that the stale link-state information of more negative impact has a higher chance to be removed. Comprehensive performance evaluations show that the method successfully enforces the control bandwidth quota while achieving much lower blocking probability than existing link-state update methods.     

Mobility management for personal communications systems

Using a combination of empirical data and theoretical models, this paper develops a model of user behavior for a personal communications system environment. This model is used to analyze a mobility management strategy that combines automatic updates by the users-either when they make significant moves or when they go extended periods without network interaction; multiple hysteresis in the form of dynamic registration areas and delayed updates; and a focused paging strategy that minimizes the number of pages given a constraint on the time allowed to a page. Over a range of system and user parameters, the total paging and update traffic can be kept below 1 per 2000 user seconds. The impact on the user's handset is less than ten brief updates per day. The total traffic is only a factor of three more than the minimum, immobile users case     

Low-cost binding update scheme based on pointer forwarding in HMIPv6 network

By introducing a mobility anchor point(MAP),hierarchical mobile IPv6(HMIPv6)reduces the binding update signaling cost associated with mobile IPv6,but there still exist deficiencies.For instance,a mobile node(MN)needs to orderly accomplish two binding updates with the MAP and home agent(HA)when the MN performs inter-MAP mobility.This results in a high signaling cost,thus affecting network performance.To reduce the inter-MAP binding update cost of idle MN in HMIPv6,an optimization scheme based on pointer forwarding with a threshold is proposed.The scheme can reduces the binding update cost of idle MN by using the binding update between MAP to replace several home binding updates.The signaling cost difference is derived by analyzing the cost of the basic scheme and the optimization scheme between two successive sessions.Simulation results show that,the optimization scheme can reduce the binding update signaling cost and improve the network performance as long as a suitable threshold is chosen.The discussions on the sensitivity of tele-parameters are also given.     

A profile-based strategy for managing user mobility in third-generation mobile systems

Several strategies have been proposed recently to improve the performance of the location management scheme in mobile systems, the influence of mobility on network performance must be reduced, mainly due to the huge number of mobile hosts in conjunction with the small cell size. In this article we present a profile-based strategy (PBS) to reduce location update signaling cost by increasing the intelligence of the location procedure. This strategy associates with each user a list of cells where she is likely to be at a given probability in each time interval. The implementation of this strategy has been subject to extensive evaluation. The results obtained confirm the effectiveness of PBS in significantly reducing the costs of both location updates and call delivery procedures when compared to IS-41 and other well-known strategies in the literature.     

软件定义网络一致性协同更新算法

为实现软件定义网络的一致性更新,本文提出一种协同利用分段路由、顺序更新、两步复制三种机制的更新算法.算法首先启用分段路由机制,尝试用现有路径规则拼接待更新数据流的最终路径,并根据最终路径是否能由现有规则拼接,将数据流分为可拼接与不可拼接两种.对于可拼接流,分段路由可将最终路径信息封装入数据包包头,使得数据包能立即沿最终路径转发.对于不可拼接流,算法计算最长一致性更新序列,并按照此序列依次更新节点,最后利用两步复制机制来完成剩余未更新节点的更新.并且经实验验证,算法比之前研究提出的算法不仅消耗更少的三态内容寻址存储器的空间资源,并且有更好的适用性与稳定性.     

Data update algorithm based on secure network coding in cloud environment

In the cloud environment for data storage,the use of secure network coding technology can be a good solution to the data privacy and reliability issues.However,each coding block usually has a high correlation after network coding,very few updates to the file need to be re-encoded which is extremely easy to cause information leakage and serious consumption of system resources.To solve this problem,a network coding cloud storage data updating algorithm was proposed.Just by sending files change difference matrix,the storage node could update parts of the coding block accordingly which could complete the entire update files.Experimental results show that compared with RS coding and Tornado coding,the algorithm can not only ensure data security,but also greatly improve the efficiency of data update and data reconstruction.     

SRv6-based Time-Sensitive Networks (TSN) with low-overhead rerouting

Time-Sensitive Networks (TSN) aims at providing a solid underpinning for the support of application connectivity demands across a wide spectrum of use cases and operational environments, such as industrial automation and automotive networks. However, handling network updates in TSN entails additional challenges, stemming from the need to perform both flow rerouting and TSN schedule reconfiguration. To address this issue, we propose a software-defined network (SDN)-based approach for low-overhead TSN network updates, exploiting segment routing over IPv6 (SRv6) for path control. To this end, we introduce the concept of TSN subgraphs in order to quickly reschedule the flows traversing the problematic area and propose a TSN-aware routing heuristic to minimize the convergence time. We further describe the control plane implementation and its integration into Mininet, which empowers us to conduct a wide range of performance tests. Our evaluation results indicate that our approach yields faster recovery and reduces significantly the number of required reconfigurations upon failures, at the expense of a small SRv6 encoding/decoding overhead.     

高速IP路由查找中改善更新性能的方法

现有的高速IP路由查找算法更多地强调路由表的查找,却忽视了路由表的更新。而路由表的更新对整个路由查找算法的性能和实际应用有不可忽视的影响。分段式查找树(Multibittrie)查找算法作为常用的IP路由查找算法,具有算法简单、有效等特点,但是更新速率较慢。作者提出一种在分段式查找树中控制路由表更新时间的方法,此方法能够较大地改善分段式查找树的更新性能。文章对更新性能的改善作了论述。