智慧网络组件协同机制研究

现有互联网网络体系和机制相对"静态"和"僵化",缺乏支持智慧网络的有效机制.要从根本上解决现有互联网存在的严重弊端,必须创建新的网络体系、理论及机制.本文在多年信息网络基础理论研究和前期973项目"一体化可信网络与普适服务体系基础研究"的基础上,在智慧协同网络"三层"、"两域"总体结构模型的指导下,提出了一种智慧网络组件协同体系结构模型,提出了智慧网络组件模型与族群聚类机制,给出了网络复杂行为博弈决策机制及智慧网络组件协同工作机制等,实现了基于网络组件协同配合的网络智慧通信,有效解决了现有互联网资源利用率低、网络能耗高等问题.     

智慧协同网络体系基础研究

现有互联网具有"三重绑定"特征,即:服务的"资源和位置绑定"、网络的"控制和数据绑定"及"身份与位置绑定".这种网络体系与机制是相对"静态"和"僵化"的,在此基础上的演进与发展无法从根本上满足信息网络"高速"、"高效"、"海量"、"泛在"等通信需求,难以解决网络可扩展性、移动性、安全性等问题,更难以实现网络资源的高效利用、节能等.本文创造性提出了以"三层"、"两域"为典型特征的智慧协同网络体系结构模型."三层"即:智慧服务层、资源适配层和网络组件层;"两域"即实体域和行为域.在"三层"、"两域"体系模型的基础上,分别建立了智慧服务层、资源适配层和网络组件层的基本理论,以在有效解决网络可扩展性、移动性、安全性等问题的基础上,大幅度提高网络资源利用率,降低网络能耗等,显著提升用户体验.     

智慧协同标识网络

创造性地提出了以"三层"、"两域"为典型特征的智慧协同标识网络结构模型。"三层"即智慧服务层、资源适配层和网络组件层;"两域"即实体域和行为域。在此基础上,分别建立了智慧服务层、资源适配层和网络组件层的基本理论,以在有效解决网络可扩展性、移动性、安全性等问题的基础上,大幅度提高网络资源利用率,降低网络能耗,显著提升用户体验。     

一种智慧协同网络多参数的多路径路由算法

多路径路由技术采用多条路径同时传输,作为优化资源配置和负载均衡的重要技术,在路由可靠性、QoS路由、传输效率等多方面比单路径传输具有优势.现有互联网网络资源配置和路由机制相对静态和僵化,导致多路径技术的发展存在发展的局限性.现有多路径技术考虑在路由层面不利于多路径路由选择和计算,难以保证传输性能,降低网络传输效率.智慧协同网络能够动态感知网络需求,灵活适配网络资源,更好的支持路由可扩展性.本文在智慧协同网络架构下提出了一种智慧协同网络多参数的多路径路由算法.该算法制定了智慧协同网络多参数的多路径路由协议,对网络性能参数CPU占用率、往返时延(RTT)、带宽进行加权计算得到路径权重值,根据权重值进行流量分配.采用图论理论对网络流量分配及模型进行了分析.并在Mini-Net平台上进行了开发和实验,结果表明,该算法能够优化网络配置,减小往返时延,提高网络吞吐量,从而提高网络性能,实现负载均衡.     

智慧协同网络中的服务机理研究

现有互联网在服务支持方面具有服务命名方式复杂、服务适配过程僵化等严重弊端,难以满足未来互联网的需求,亟待研究新的服务机制.为此,本文在智慧协同网络体系总体模型的基础上,提出了一种新的智慧服务层工作原理与设计方案,包括服务标识的统一命名与服务行为表征方法,服务的注册与查询方法,服务资源的存储方法,服务动态感知方法,以及服务标识到族群标识的智慧映射机制等,实现了服务的普适化和智慧化,显著提升了用户的体验.     

面向多样化服务定制的多态路由机制研究

如何基于有限且确定的路由结构来支持多样化服务是当前研究面临的问题,采用路由结构的自组织和自调节来实现路由与业务的“自适配”,提出一种面向多样化服务定制的多态路由机制。该机制通过自适配网络路由结构的基本“微内核”,实现到个性化定制寻址路由结构的派生与重载,使网络具有动态适应多样化业务的路由服务功能,并且支持多样网络寻址与路由的多模多态共存。     

一种控制消息广播与合并策略的低开销路由算法

针对现有基于社区的机会社会网络多副本消息传输机制中网络控制开销较大和网络资源浪费的问题,提出了一种基于广播策略的机会社会网络低开销路由算法.该算法采用了"ACK消息快速产生机制"和"控制消息合并机制"两种新机制,能够有效减少网络中数据消息副本不必要的转发次数和降低网络控制开销.理论分析和仿真验证表明,相较于现有的基于社区的消息机会传输路由算法和基于重叠社区的消息机会转发路由算法,所提算法能有效减少网络控制开销和节省网络资源.     

支持业务需求灵活定制的多态路由系统

传统僵化单一的路由机制已经无法适应未来多样化的业务需求和各种新型网络体系结构的试验与部署。针对此问题,本文基于路由功能与业务需求自适配的思想提出了多态路由模型,并设计实现了多态路由原型系统。该系统通过虚拟化技术以及灵活可编程的数据平面结构,实现了同构和异构网络中多种路由协议的共存,完成了基于路由服务描述的路由协议个性化定制和数据平面的多表选择查询与转发处理。最后,基于NetFPGA-10G平台设计实现了多态路由原型系统。相较于现有路由试验系统,多态路由系统在实现路由协议定制化及异构网络共存的同时,更好地保证了业务的服务质量,具有更高的转发速率以及可扩展性。     

基于分布式选择探测算法的服务路由机制

当前网络中间件服务部署方式僵化单一，难以支持未来多样化的网络服务需求.针对此问题，本文从可重构信息通信基础网络中引入元服务的思想，提出一种支持在控制层进行定制编排以及在数据面按需部署的服务路由机制.该机制将服务路径构建问题建模为多约束最优化问题，并针对性设计了分布式选择探测算法，通过对探针的分布式选择处理进行最优服务路径的构建.仿真结果表明，相较于现有算法，本文提出的服务路由机制在付出较小探测开销的情况下，有效提高了路径服务质量以及服务请求成功率.     

广义确定性标识网络

随着智能制造、智能交通等重大国家战略实施,确定性成为信息网络尤其是行业专网的新焦点.现有确定性网络技术始终关注网络传输要素（带宽、时隙等）来保障数据流的确定性传输.然而,仅靠保障传输要素无法支撑新兴行业应用的多样化需求.例如,在算网融合场景,智算任务要求同时保障传输与计算要素的确定性来实现高性能通信;在绿色通信场景,需要考虑节点能量要素的确定性以维持网络稳定运行.针对上述需求,本文基于前期提出的标识网络技术,研究面向传输、计算、存储、能量等多要素的广义确定性网络.首先提出广义确定性标识网络架构,包括差异化服务层、异构融合网络层和智慧化适配层.差异化服务层和异构融合网络层,分别实现差异化确定性应用需求和异构化确定性网络要素的统一标识和描述,并通过标识解析映射实现确定性信息向智慧化适配层的统一封装和传递;智慧化适配层完成差异化确定性应用需求和异构化确定性网络要素的适配.现有确定性资源适配方法,即使仅考虑单一网络内的基本确定性要素,仍面临计算时间长、求解复杂性高、灵活度低等问题,为了支持更加复杂的多确定性要素、多种异构网络的协同适配,设计了基于深度强化学习的端到端的确定性调度（End-to-...     

Flow-based load-balancing architecture for the agile all-photonic network

A novel routing architecture that balances incoming Internet flows over the agile all-photonic network (AAPN) is proposed. The architecture is based on the adaptive highest random weight (adaptive HRW) algorithm proposed to design load-balanced Internet routers. Extensive numerical evaluation of static and adaptive variations of the routing architecture is studied, and their effect on the network performance in terms of packet drop and flow remapping is presented. The architecture can be seen as a combination of adaptive core node scheduling and adaptive load balancing at the edge nodes. It is stateless and can compute routes quickly based on the packet flow identifier.     

Research on the full-dimensional defined polymorphic smart network

For current Internet is confronted with some defects such as rigid structure,single IP bearing,and disability in suppressing unknown threats,the functions,performance,efficiency and security of the Internet were promoted from the perspective of network structure,the “structure definition” was introduced through all levels of the Internet,and a network architecture of multi-modal presentation of network functions was provided in all levels:full-dimensional defined polymorphic smart network (PINet),which supported full-dimensional definition and multi-modal presentation of addressing and routing,switching mode,interconnection mode,network element,transmission protocol,service properties and so on.Then the vision and goal,architecture and model,as well as the key technologies of PINet were discussed.The proposed architecture can provide a possible solution to the development of new network technologies.     

Oblivious routing in wireless mesh networks

As new network applications have arisen rapidly in recent years, it is becoming more difficult to predict the exact traffic pattern of a network. In consequence, a routing scheme based on a single traffic demand matrix often leads to a poor performance. Oblivious routing (Racke in Proceedings of the 43rd annual IEEE symposium on foundations of computer science 43–52, 2002) is a technique for tackling the traffic demand uncertainty problem. A routing scheme derived from this principle intends to achieve a predicable performance for a set of traffic matrixes. Oblivious routing can certainly be an effective tool to handle traffic demand uncertainty in a wireless mesh network (WMN). However, a WMN has an additional tool that a wireline network does not have: dynamic bandwidth allocation. A router in a WMN can dynamically assign bandwidth to its attached links. This capability has never been exploited previously in works on oblivious routing for a spatial time division multiple access (STDMA) based WMN. Another useful insight is that although it is impossible to know the exact traffic matrix, it is relatively easy to estimate the amount of the traffic routed through a link when the routing scheme is given. Based on these two insights, we propose a new oblivious routing framework for STDMA WMNs. Both analytical models and simulation results are presented in this paper to prove that the performance—in terms of throughput, queue lengths, and fairness—of the proposed scheme can achieve significant gains over conventional oblivious routing schemes for STDMA based WMNs.     

End-to-end TCP-friendly streaming protocol and bit allocation for scalable video over wireless Internet

With the convergence of wired-line Internet and mobile wireless networks, as well as the tremendous demand on video applications in mobile wireless Internet, it is essential to an design effective video streaming protocol and resource allocation scheme for video delivery over wireless Internet. Taking both network conditions in the Internet and wireless networks into account, in this paper, we first propose an end-to-end transmission control protocol (TCP)-friendly multimedia streaming protocol for wireless Internet, namely WMSTFP, where only the last hop is wireless. WMSTFP can effectively differentiate erroneous packet losses from congestive losses and filter out the abnormal round-trip time values caused by the highly varying wireless environment. As a result, WMSTFP can achieve higher throughput in wireless Internet and can perform rate adjustment in a smooth and TCP-friendly manner. Based upon WMSTFP, we then propose a novel loss pattern differentiated bit allocation scheme, while applying unequal loss protection for scalable video streaming over wireless Internet. Specifically, a rate-distortion-based bit allocation scheme which considers both the wired and the wireless network status is proposed to minimize the expected end-to-end distortion. The global optimal solution for the bit allocation scheme is obtained by a local search algorithm taking the characteristics of the progressive fine granularity scalable video into account. Analytical and simulation results demonstrate the effectiveness of our proposed schemes.     

Multi-Layer Differentiated Integrated Survivability for Optical Internet

In this paper, we study the problem of multi-layer integrated survivability (MLIS) for efficiently provisioning reliable traffic connections of arbitrary bandwidth granularities in the integrated optical Internet. We decompose the MLIS problem into three sub-problems: survivable strategies design (SSD), spare capacity dimensioning (SCD), and dynamic survivable routing (DSR). First, a review of network survivability in multi-layer IP/WDM networks is provided. Then, multi-layer survivability strategies are proposed and it is observed how these strategies could be applied to the integrated optical Internet architecture. We also present an enhanced integrated shared pool (ISP) method for solving the static MLIS problem (i.e., the SCD sub-problem) and the priority-based integer programming formulations are also given. Moreover, we design a novel scheme called the differentiated integrated survivability algorithm (DISA) to solve the dynamic MLIS problem (i.e., the DSR sub-problem), which employs flexible survivable routing strategies according to the priority of the traffic resilience request. Performance simulation results of DISA show that our adaptive survival schemes perform much better in terms of traffic blocking ratio, spare resource requirement, and average traffic recovery ratio compared with other solutions in the optical Internet.     

Dynamic routing in translucent WDM optical networks: the intradomain case

Translucent wavelength-division multiplexing optical networks use sparse placement of regenerators to overcome physical impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks at a much less cost. In previous studies, we addressed the placement of regenerators based on static schemes, allowing for only a limited number of regenerators at fixed locations. This paper furthers those studies by proposing a dynamic resource allocation and dynamic routing scheme to operate translucent networks. This scheme is realized through dynamically sharing regeneration resources, including transmitters, receivers, and electronic interfaces, between regeneration and access functions under a multidomain hierarchical translucent network model. An intradomain routing algorithm, which takes into consideration optical-layer constraints as well as dynamic allocation of regeneration resources, is developed to address the problem of translucent dynamic routing in a single routing domain. Network performance in terms of blocking probability, resource utilization, and running times under different resource allocation and routing schemes is measured through simulation experiments.