Traffic resource allocation for complex networks

In this paper, an optimal resource allocation strategy is proposed to enhance traffic dynamics in complex networks. The network resources are the total node packet-delivering capacity and the total link bandwidth. An analytical method is developed to estimate the overall network capacity by using the concept of efficient betweenness (ratio of algorithmic betweenness and local processing capacity). Three network structures (scale-free, small-world, and random networks) and two typical routing protocols (shortest path protocol and efficient routing protocol) are adopted to demonstrate the performance of the proposed strategy. Our results show that the network capacity is reversely proportional to the average path length for a particular routing protocol and the shortest path protocol can achieve the largest network capacity when the proposed resource allocation strategy is adopted.     

水声通信网络定向搜索AODV协议研究

水声通信网络是水声研究的一个热点问题。由于水下声网络带宽窄、传播延迟大、能量受限等特点,无线电网络中一些成熟的路由协议,如DSDV、AODV等的应用受到了很大的限制。本文结合按需距离矢量(AODV)路由协议和地理位置协议,提出了一种适用于水下网络的路由协议——定向搜索AODV(DSAODV)路由协议。DSAODV协议利用地理位置信息约束路由请求分组(RREQ)寻找路由的范围,降低了路由寻径的开销,减少了网络拥塞。仿真结果表明,DSAODV协议在吞吐量、协议开销等方面都优于AODV协议。     

Bandwidth allocation strategy for traffic systems of scale-free network

In this Letter, the bandwidth resource allocation strategy is considered for traffic systems of complex networks. With a finite resource of bandwidth, an allocation strategy with preference parameter α is proposed considering the links importance. The performance of bandwidth allocation strategy is studied for the local routing protocol and the shortest path protocol. When important links are slightly favored in the bandwidth allocation, the system can achieve the optimal traffic performance for the two routing protocols. For the shortest path protocol, we also give a method to estimate the network traffic capacity theoretically.     

Performance enhancement of optical burst switched networks

Optical burst switching (OBS) is an optical switching paradigm which offers a good tradeoff between the traditional optical circuit switching (OCS) and optical packet switching (OPS) since it has the relatively easy implementation of the first and the efficient bandwidth utilization of the second. Hence, OBS is a promising technology for the next generation optical Internet. A buffer-less OBS network can be implemented using ordinary optical communication equipment without the need for either wavelength converters or optical memories. In an OBS network, burst-loss performance is a critical concern. In OBS, the data-burst transmission is delayed by an offset time (relative to its burst control packet (BCP), or header) and the burst follows its header without waiting for an acknowledgment for resource reservation. Thus, a burst may be lost at an intermediate node due to contention, which is generally resolved according to the local routing and bandwidth information. The routing table maintained in each OBS node is generally pre-computed and fixed to forward the data bursts. Such a static forwarding feature might have limited efficiency to resolve contentions. Moreover, a burst may be lost and the network may be congested when a network element (e.g., fiber link) fails. In this paper, an efficient integrated scheme based on dynamic routing and burst segmentation has been proposed to improve reliability of data transport and network load balancing in optical burst switched networks. Simulation results demonstrate that the proposed approach reduces effectively blocking probability and hence contention. Further, it provides end-to-end throughput performance also. Hence, it establishes an appropriate tradeoff between loss rate and end-to-end throughput.     

基于分组交换的量子通信网络传输协议及性能分析

量子纠缠交换能够建立可靠的量子远程传输信道, 实现量子态的远程传输. 然而, 基于纠缠交换的量子信道要求网络高度稳定, 否则会浪费大量纠缠资源. 为节省纠缠资源, 本文根据隐形传态理论, 提出了一种基于分组交换的量子通信网络传输协议, 建立了发送量子态所需的纠缠数目与所经过的路由器数、链路错误率的定量关系, 并与纠缠交换传输协议进行了比较. 仿真结果表明, 在链路错误率为0.1% 时, 分组传输协议所使用的纠缠数目少于纠缠交换的数目, 另外, 随着错误率的升高, 分组传输协议所需的纠缠数比纠缠交换协议明显减少. 由此可见, 基于分组交换的量子通信网络传输协议在网络不稳定时, 能够节省大量纠缠资源, 适用于链路不稳定的量子通信网络.     

Route selection for interference minimization to primary users in cognitive radio ad hoc networks: A cross layer approach

An opportunistic routing problem in a cognitive radio ad hoc network is investigated with an aim to minimize the interference to primary users (PUs) and under the constraint of a minimum end-to-end data rate for secondary users (SUs). Both amplify-and-forward (AF) and decode-and-forward (DF) relaying techniques are considered for message forwarding by SU nodes in the network. Unlike popular transmit power control based solutions for interference management in cognitive radio networks, we adopt a cross layer approach. The optimization problem is formulated as a joint power control, channel assignment and route selection problem. Next, closed form expression for transmission power is derived and corresponding channel selection scheme and routing metric are designed based on this solution. The proposed route selection schemes are shown to depend not only on gains of the interference channels between SUs and PUs but also on the values of the spectrum sensing parameters at the SU nodes in the network. Two distributed routing schemes are proposed based on our analysis; (i) optimal_DF and (ii) suboptimal_AF. The routing schemes could be implemented using existing table driven as well as on demand routing protocols. Extensive simulation results are provided to evaluate performance of our proposed schemes in random multihop networks. Results show significant reduction in PUs’ average interference experience and impressive performance as opportunistic routing schemes can be achieved by our schemes compared to traditional shortest path based routing schemes. Performance improvement is also reported over prominent recent schemes.     

Adaptive coding clustered routing protocol for energy efficient and reliable WSN

In Wireless Sensor Networks (WSNs), the sensor nodes are expected to remain autonomous for a long time and the communication must be successful. So, energy efficiency and communication reliability are the main challenges for WSN. Routing protocols and, in particular, clustering is the key to energy constraints in WSNs. In a loss milieu, data shared between nodes is susceptible to corruption by errors caused by signal fading, random noise, and some other forces. For this reason, channel coding is necessary to assure efficient and reliable transmission. Therefore, energy efficiency and reliability of communications are the most crucial factors in the design of an efficient cluster-based routing protocol. In this context, to raise the reliability of the communication link and minimize the necessary transmission energy, a new adaptive coding routing protocol is proposed, which implements RS and LDPC codes to a routing protocol. Simulation results show that our proposed protocol improves energy consumption, network lifetime, stability, and throughput compared to LEACH and BRE-LEACH. In addition, it reaches a good BER performance and coding gain by using the LDPC code.     

基于纠缠的选择自动重传量子同步通信协议

分析经典选择重传自动请求重传(automatic repeat-request,ARQ)协议之后,利用量子力学中纠缠态的非定域关联性,提出了数据链路层的选择重传ARQ量子同步通信协议.该协议把链路分为准备阶段和发送阶段.在线路准备阶段完成EPR(Einstein-Podolsky-Rosen)关联对的分发,建立量子信道;在发送阶段完成数据帧和量子确认帧的传送.从吞吐量和信道利用率等方面比较分析了几种常见的数据链路层通信协议的性能.研究表明,该协议可以有效地提高数据链路层的最大吞吐量和信道利用率,改善选择重传ARQ协议的性能,在受时间瓶颈限制的通信中有着重要的应用价值.     

Distributed wireless quantum communication networks

The distributed wireless quantum communication network （DWQCN） ha~ a distributed network topology and trans- mits information by quantum states. In this paper, we present the concept of the DWQCN and propose a system scheme to transfer quantum states in the DWQCN. The system scheme for transmitting information between any two nodes in the DWQCN includes a routing protocol and a scheme for transferring quantum states. The routing protocol is on-demand and the routing metric is selected based on the number of entangled particle pairs. After setting up a route, quantum tele- portation and entanglement swapping are used for transferring quantum states. Entanglement swapping is achieved along with the process of routing set up and the acknowledgment packet transmission. The measurement results of each entan- glement swapping are piggybacked with route reply packets or acknowledgment packets. After entanglement swapping, a direct quantum link between source and destination is set up and quantum states are transferred by quantum teleportation. Adopting this scheme, the measurement results of entanglement swapping do not need to be transmitted specially, which decreases the wireless transmission cost and transmission delay.     

基于纠缠的选择自动重传量子同步通信协议

分析经典选择重传自动请求重传（automatic repeat-request,ARQ）协议之后,利用量子力学中纠缠态的非定域关联性,提出了数据链路层的选择重传ARQ量子同步通信协议.该协议把链路分为准备阶段和发送阶段.在线路准备阶段完成EPR (Einstein-Podolsky-Rosen)关联对的分发,建立量子信道;在发送阶段完成数据帧和量子确认帧的传送.从吞吐量和信道利用率等方面比较分析了几种常见的数据链路层通信协议的性能.研究表明,该协议可以有效地提高数据链路层的最大吞吐量和信道利用率,改善选择重传ARQ协议的性能,在受时间瓶颈限制的通信中有着重要的应用价值.     

飞控系统的光传网络的可靠性及实时性

调研了传统光传(FBL)网络的几种拓扑结构, 就可靠性和实时性两方面对它们进行了分析和比较。选择采用一个包含256个节点的mesh光交换网络, 它具有冗余拓扑结构能承受3处链路故障, 保证了网络的可靠性。以网络中发生链路故障的数目, 及多个故障同时发生时故障的邻近程度来衡量网络故障的严重性。对所有链路故障情形进行仿真, 测试端到端的通信延迟。仿真结果表明, 采用这种网络拓扑结构的光传网络, 即使在发生较为严重的故障的情况下, 端到端通信路由的跳数增加不大, 仍能满足实时通信的要求。     

联合空时编码的水声多用户节点协同并行传输多址接人协议设计

针对水声信道长传播时延特点导致水声通信网吞吐量低的问题,提出了一种多节点协同并行传输的多址接入协议。该协议由接收端发起预约,在距离认知的基础上对预约节点划分协同传输小区,从而构建多用户节点的多输入多输出集中式网络架构;采用空时码对数据包编码,并合理规划数据包的发送时刻,使同一小区的多个用户节点发送的数据包在设定时间偏差范围内同时到达接收端,而不同小区的数据包以包链形式到达,实现多用户节点的无干扰、高效并行传输。仿真实验结果表明,与已有的其它两种协议相比,设计的协议通过空时复用的方法大幅缩短了平均端到端时延,显著提升了归一化网络吞吐量。      

Scheduling for end-to-end performance in multi-rate CDMA/HDR systems

An interesting feature of the third generation (3G) cellular networks is their ability to support multiple data rates for data services. Thus, it is important to understand the end-to-end delay and throughput performance over these multi-rate cellular systems. In this work, we consider a multi-rate system such as High Data Rate (HDR) and represent the possible data rates using a Markov chain. Using a M/G/1 queuing model, we calculate the expected data rate and the corresponding link layer delay for each of the initial states. We study the effects of various link layer scheduling techniques for the radio link protocol (RLP) frames destined for multiple user. Though the commonly used link layer scheduling techniques work well, they do not provide the best performance for when end-to-end semantics need to be maintained. In this regard, we propose a scheduling algorithm that aids the transport protocol, for example TCP. Our research shows that the proposed remaining frames first scheduler enhances the transport layer performance compared to the commonly used “best channel scheduler”. Comparative results, based on simulations, are shown with respect to radius of cell, distance of user, number of users, and varying bit error rate.     

Performance of a distributed WR-OBS control architecture

This paper proposes a new distributed wavelength-routed optical burst switching (WR-OBS) network architecture and two corresponding control protocols. By taking advantage of merits from both just enough time (JET) protocol and two-way signaling method, this new control architecture outperforms traditional JET OBS network in points of burst loss probability, system throughput and centralized WROBS network in network scalability confirmed by computer simulations. Further simulation is developed to compare the performance of the two control protocols, which leads to instructive discussion in real WR-OBS network design.     

智能光网络组播梳理协议设计与分析

为了节约网络成本和提高网络性能,将RSVP协议和OSPF协议进行扩展,提出了一个支持业务梳理的智能光网络组播协议,给出了消息类型,信令流程及状态机模型,并通过仿真验证协议性能.仿真表明,业务梳理可以一定程度降低组播业务阻塞率,但业务建立时延却大于不存在梳理的情况.梳理的存在使业务建立时延随着业务量的增大有一个由小变大再减小的过程.     

一种有效提高无标度网络负载容量的管理策略

现有研究表明明显的社团结构会显著降低网络的传输性能. 本文基于网络邻接矩阵的特征谱定义了链路对网络社团特性的贡献度, 提出一种通过逻辑关闭或删除对网络社团特性贡献度大的链路以提高网络传输性能的拓扑管理策略, 即社团弱化控制策略(CWCS 策略). 在具有社团结构的无标度网络上分别进行了基于全局最短路径路由和局部路由的仿真实验, 并与关闭连接度大的节点之间链路的HDF 策略进行了比较. 仿真实验结果显示, 在全局最短路径路由策略下, CWCS策略能更有效地提高网络负载容量, 并且网络的平均传输时间增加的幅度变小. 在局部路由策略下, 当调控参数0<α<2, 对网络负载容量的提升优于HDF策略. 关键词： 复杂网络 社团特性 负载容量 拓扑管理     

Routing and wavelength assignment in WDM networks with dynamic link weight assignment

We consider the routing and wavelength assignment problem on wavelength division multiplexing networks without wavelength conversion. When the physical network and required connections are given, routing and wavelength assignment (RWA) is the problem to select a suitable path and wavelength among the many possible choices for each connection such that no two paths using the same wavelength pass through the same link. In wavelength division multiplexing (WDM) optical networks, there is need to maximize the number of connections established and to minimize the blocking probability using limited resources. In this paper, we have proposed three dynamic link weight assignment strategies that change the link weight according to the traffic. The performance of the existing trend and the proposed strategies is shown in terms of blocking probability. The simulation results show that all the proposed strategies perform better than the existing trend.     

DRL-M4MR: An intelligent multicast routing approach based on DQN deep reinforcement learning in SDN

Traditional multicast routing methods have some problems in constructing a multicast tree. These problems include limited access to network state information, poor adaptability to dynamic and complex changes in the network, and inflexible data forwarding. To address these defects, the optimal multicast routing problem in software-defined networking (SDN) is tailored as a multiobjective optimization problem, and DRL-M4MR, an intelligent multicast routing algorithm based on the deep Q network (DQN) deep reinforcement learning (DRL) method is designed to construct a multicast tree in a software-defined network. First, combining the characteristics of SDN global network-aware information, the multicast tree state matrix, link bandwidth matrix, link delay matrix and link packet loss rate matrix are designed as the state space of the reinforcement learning agent to solve the problem in that the original method cannot make full use of network status information. Second, the action space of the agent is all the links in the network, and the action selection strategy is designed to add the links to the current multicast tree in four cases. Third, single-step and final reward function forms are designed to guide the agent to make decisions to construct the optimal multicast tree. The double network architectures, dueling network architectures and prioritized experience replay are adopted to improve the learning efficiency and convergence of the agent. Finally, after the DRL-M4MR agent is trained, the SDN controller installs the multicast flow entries by reversely traversing the multicast tree to the SDN switches to implement intelligent multicast routing. The experimental results show that, compared with existing algorithms, the multicast tree constructed by DRL-M4MR can obtain better bandwidth, delay, and packet loss rate performance after training, and it can make more intelligent multicast routing decisions in a dynamic network environment. Code and DRL model are available at https://github.com/GuetYe/DRL-M4MR.     

Design and Implementation of a Virtual Multi-channel Optical Ring

1　Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｈｉｇｈ ｐｅｒｆｏｒｍａｎｃｅ ｐａｒａｌｌｅｌｃｏｍｐｕｔｉｎｇｐｌａｔｆｏｒｍｍａｄｅｕｐｏｆｗｏｒｋｓｔａｔｉｏｎｓｏｒｐｅｒｓｏｎａｌｃｏｍｐｕｔｅｒｓｉｎｔｅｒｃｏｎｎｅｃｔｅｄｂｙｎｅｔｗｏｒｋｈａｓｂｅｃｏｍｅｔｈｅｍａｉｎｓｔｒｅａｍｉｎｔｈｅｄｅｖｅｌｏｐｍｅｎｔｏｆｐａｒａｌｌｅｌｃｏｍｐｕｔｉｎｇｔｅｃｈｎｏｌｏｇｙ[1] .Ｃｕｒｒｅｎｔｌｙ ,ｃｏｍｐｕｔｅｒｃｌｕｓｔｅｒｓａｒｅｍａｉｎｌｙｉｎｔｅｒｃｏｎｎｅｃｔｅｄｂｙｌｏｃａｌａｒｅａｎｅ…     

Design and Implementation of a Virtual Multi-channel Optical Ring

The hardware and the communication protocol of a scalable optical ring have been designed. A hardware routing has been achieved on the network interface card to minimize data packet communication latency and a simplified communication protocol has been designed to reduce communication overheads. To reduce the data packet blocking probability and have a more efficient usage of the data link layer bandwidth, a virtual multi-channel transmission mechanism has been achieved. The network supports a maximum of 16 virtual channels for each physical data link. Time slots can be dynamically assigned to each virtual channel. Zero wait time has been achieved for the switching between different virtual channels.