Prophet_TD Routing Algorithm Based on Historical Throughput and Encounter Duration

Opportunistic networks are self-organizing networks that do not require a complete path between the source node and the destination node as it uses encounter opportunities brought by nodes movement to achieve network communication. Opportunistic networks routing algorithms are numerous and can be roughly divided into four categories based on different forwarding strategies. The Prophet routing algorithm is an important routing algorithm in opportunistic networks. It forwards messages based on the encounter probability between nodes, and has good innovation significance and optimization potential. However, the Prophet routing algorithm does not consider the impact of the historical throughput of the node on message transmission, nor does it consider the impact of the encounter duration between nodes on message transmission. Therefore, to improve the transmission efficiency of opportunistic networks, this paper based on the Prophet routing algorithm, fuses the impact of the historical throughput of the node and the encounter duration between nodes on message transmission at the same time, and proposes the Prophet_TD routing algorithm based on the historical throughput and the encounter duration. This paper uses the Opportunistic Networks Environment v1.6.0 (the ONE v1.6.0) as the simulation platform, controls the change of running time and the number of nodes respectively, conducts simulation experiments on the Prophet_TD routing algorithm. The simulation results show that compared to the traditional Prophet routing algorithm, on the whole, the Prophet_TD routing algorithm has a higher message delivery rate and a lower network overhead rate, and its average latency is also lower when node density is large.     

Traffic Engineering in Dynamic Hybrid Segment Routing Networks

The emergence of Segment Routing (SR) provides a novel routing paradigm that uses a routing technique called source packet routing. In SR architecture, the paths that the packets choose to route on are indicated at the ingress router. Compared with shortest-path-based routing in traditional distributed routing protocols, SR can realize a flexible routing by implementing an arbitrary flow splitting at the ingress router. Despite the advantages of SR, it may be difficult to update the existing IP network to a full SR deployed network, for economical and technical reasons. Updating partial of the traditional IP network to the SR network, thus forming a hybrid SR network, is a preferable choice. For the traffic is dynamically changing in a daily time, in this paper, we propose a Weight Adjustment algorithm WASAR to optimize routing in a dynamic hybrid SR network. WASAR algorithm can be divided into three steps: firstly, representative Traffic Matrices (TMs) and the expected TM are obtained from the historical TMs through ultra-scalable spectral clustering algorithm. Secondly, given the network topology, the initial network weight setting and the expected TM, we can realize the link weight optimization and SR node deployment optimization through a Deep Reinforcement Learning (DRL) algorithm. Thirdly, we optimize the flow splitting ratios of SR nodes in a centralized online manner under dynamic traffic demands, in order to improve the network performance. In the evaluation, we exploit historical TMs to test the performance of the obtained routing configuration in WASAR. The extensive experimental results validate that our proposed WASAR algorithm has superior performance in reducing Maximum Link Utilization (MLU) under the dynamic traffic.     

CAN总线时间触发机制的实现

分析了CAN总线的时间触发机制，基于8052单片机和CAN控制器SJA1000设计了时间触发机制的实现方案，给出了网络中基本周期中可传输的最大消息数目及可调度分析方法。以汽车引擎控制系统为例进行的实验结果表明，利用CAN总线时间触发机制不仅可以有效地管理消息的传输，而且提高了总线带宽利用率。     

Transfer coefficients on the shell progressive poisoning model

Abstract

The idle server first (ISF) routing strategy in a finite queueing system with multiple unequal‐rate synchronous servers is studied. This paper extends the work of [4] by considering unequal‐rate servers. The input is assumed to be a batch Poisson distribution. The state transition equations used to describe the queueing behavior of the system are successfully solved. The performance measures, including average message blocking probability, average packet delay, average message delay, and system throughput, are obtained. The results show that ISF routing can have pretty good performance, and its effective measures are almost independent of routing probabilities. Validity of the analysis has also been verified by computer simulations.     

An Energy Based Dynamic AODV Routing Protocol in Wireless Ad Hoc Networks

In recent years, with the rapid development of the Internet and wireless communication technology, wireless Ad hoc networks have received more attention. Due to the limited transmission range and energy of nodes in Ad hoc networks, it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks. This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol, which has the following two aspects of improvement: (1) In the route discovery process, a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a “Mark” bit that representing remaining energy of a node. (2) Based on (1), a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively. Simulation results demonstrate that compared with AODV and other existing routing protocols, proposed algorithm can reduce network energy consumption and balance node energy, thus extending the network lifetime.     

A Distributed LRTCO Algorithm in Large-Scale DVE Multimedia Systems

In the large-scale Distributed Virtual Environment (DVE) multimedia systems, one of key challenges is to distributedly preserve causal order delivery of messages in real time. Most of the existing causal order control approaches with real-time constraints use vector time as causal control information which is closely coupled with system scales. As the scale expands, each message is attached a large amount of control information that introduces too much network transmission overhead to maintain the real-time causal order delivery. In this article, a novel Lightweight Real-Time Causal Order (LRTCO) algorithm is proposed for large-scale DVE multimedia systems. LRTCO predicts and compares the network transmission times of messages so as to select the proper causal control information of which the amount is dynamically adapted to the network latency variations and unconcerned with system scales. The control information in LRTCO is effective to preserve causal order delivery of messages and lightweight to maintain the real-time property of DVE systems. Experimental results demonstrate that LRTCO costs low transmission overhead and communication bandwidth, reduces causal order violations efficiently, and improves the scalability of DVE systems.     

自组网中一种基于跨层负载感知的蚁群优化路由协议

将蚁群优化和跨层优化方法结合起来,提出了一种基于跨层负载感知和蚁群优化的路由协议(CLAOR)。协议将整个路径中各节点MAC层的总平均估计时延和节点队列缓存的占用情况结合起来,共同作为路由选择和路由调整的重要度量标准进行按需路由发现和维护,通过拥塞节点丢弃蚂蚁分组以及借助部分兼具蚂蚁功能的数据分组实现正常路由表的维护等方法,减少了控制开销,增加了算法的可扩展性,较好地解决了自组网中现有基于蚁群优化的路由协议中普遍存在的拥塞问题、捷径问题和引入的路由开销问题。仿真结果表明,CLAOR在分组成功递交率、路由开销以及端到端平均时延等方面具有优良性能,能很好地实现网络中的业务流负载均衡。     

An OpenFlow-Based Load Balancing Strategy in SDN

In today’s datacenter network, the quantity growth and complexity increment of traffic is unprecedented, which brings not only the booming of network development, but also the problem of network performance degradation, such as more chance of network congestion and serious load imbalance. Due to the dynamically changing traffic patterns, the state-of the-art approaches that do this all require forklift changes to data center networking gear. The root of problem is lack of distinct strategies for elephant and mice flows. Under this condition, it is essential to enforce accurate elephant flow detection and come up with a novel load balancing solution to alleviate the network congestion and achieve high bandwidth utilization. This paper proposed an OpenFlow-based load balancing strategy for datacenter networks that accurately detect elephant flows and enforce distinct routing schemes with different flow types so as to achieve high usage of network capacity. The prototype implemented in Mininet testbed with POX controller and verify the feasibility of our load-balancing strategy when dealing with flow confliction and network degradation. The results show the proposed strategy can adequately generate flow rules and significantly enhance the performance of the bandwidth usage compared against other solutions from the literature in terms of load balancing.     

Statistical Analysis with Dingo Optimizer Enabled Routing for Wireless Sensor Networks

Security is a vital parameter to conserve energy in wireless sensor networks (WSN). Trust management in the WSN is a crucial process as trust is utilized when collaboration is important for accomplishing trustworthy data transmission. But the available routing techniques do not involve security in the design of routing techniques. This study develops a novel statistical analysis with dingo optimizer enabled reliable routing scheme (SADO-RRS) for WSN. The proposed SADO-RRS technique aims to detect the existence of attacks and optimal routes in WSN. In addition, the presented SADO-RRS technique derives a new statistics based linear discriminant analysis (LDA) for attack detection, Moreover, a trust based dingo optimizer (TBDO) algorithm is applied for optimal route selection in the WSN and accomplishes secure data transmission in WSN. Besides, the TBDO algorithm involves the derivation of the fitness function involving different input variables of WSN. For demonstrating the enhanced outcomes of the SADO-RRS technique, a wide range of simulations was carried out and the outcomes demonstrated the enhanced outcomes of the SADO-RRS technique.     

Improved Enhanced Dbtma with Contention-Aware Admission Control to Improve the Network Performance in Manets

DBTMA relies entirely on RTS/CTS dialogue for un-collided transmission of data. The purpose is to improve the QoS at MAC layer by developing it over 802.11e standard. However, DBTMA does not guarantee real-time constraints without efficient method for controlling the network loads. The main challenges in MANETs include prediction of the available bandwidth, establishing communication with neighboring nodes and predicting the consumption of bandwidth flow. These challenges are provided with solutions using Contention-Aware Admission Control (CACP) protocol. In this paper, the EDBTMA protocol is combined with CACP protocol that introduces bandwidth calculation using admission control strategy. The calculation includes certain metrics like: admission control and bandwidth consumption. To compute the bandwidth of channel, bandwidth utilization and traffic priority is distinguished through dual busy tone is proposed. This operates distinctly on its own packet transmission operation. This CACP mechanism defends the conventional traffic flows from new nodes and based on the measured status information of the channel, it QoS of the admitted flows is maintained. This ensures maximum amount of bandwidth flows accommodated by resources and determines the resources in a system meet the new flow requirements while maintaining existing bandwidth flow levels.     

Efficient Routing Protocol with Localization Based Priority & Congestion Control for UWSN

The nodes in the sensor network have a wide range of uses, particularly on under-sea links that are skilled for detecting, handling as well as management. The underwater wireless sensor networks support collecting pollution data, mine survey, oceanographic information collection, aided navigation, strategic surveillance, and collection of ocean samples using detectors that are submerged in water. Localization, congestion routing, and prioritizing the traffic is the major issue in an underwater sensor network. Our scheme differentiates the different types of traffic and gives every type of traffic its requirements which is considered regarding network resource. Minimization of localization error using the proposed angle-based forwarding scheme is explained in this paper. We choose the shortest path to the destination using the fitness function which is calculated based on fault ratio, dispatching of packets, power, and distance among the nodes. This work contemplates congestion conscious forwarding using hard stage and soft stage schemes which reduce the congestion by monitoring the status of the energy and buffer of the nodes and controlling the traffic. The study with the use of the ns3 simulator demonstrated that a given algorithm accomplishes superior performance for loss of packet, delay of latency, and power utilization than the existing algorithms.     

QoS Aware Multicast Routing Protocol for Video Transmission in Smart Cities

In recent years, Software Defined Networking (SDN) has become an important candidate for communication infrastructure in smart cities. It produces a drastic increase in the need for delivery of video services that are of high resolution, multiview, and large-scale in nature. However, this entity gets easily influenced by heterogeneous behaviour of the user's wireless link features that might reduce the quality of video stream for few or all clients. The development of SDN allows the emergence of new possibilities for complicated controlling of video conferences. Besides, multicast routing protocol with multiple constraints in terms of Quality of Service (QoS) is a Nondeterministic Polynomial time (NP) hard problem which can be solved only with the help of metaheuristic optimization algorithms. With this motivation, the current research paper presents a new Improved Black Widow Optimization with Levy Distribution model (IBWO-LD)-based multicast routing protocol for smart cities. The presented IBWO-LD model aims at minimizing the energy consumption and bandwidth utilization while at the same time accomplish improved quality of video streams that the clients receive. Besides, a priority-based scheduling and classifier model is designed to allocate multicast request based on the type of applications and deadline constraints. A detailed experimental analysis was carried out to ensure the outcomes improved under different aspects. The results from comprehensive comparative analysis highlighted the superiority of the proposed IBWO-LD model over other compared methods.     

A network-wide exact optimization approach for multiobjective routing with path protection in multiservice multiprotocol label switching networks

A multiobjective routing model for multiprotocol label switching networks with multiple service types and path protection is presented in this article. The routing problem is formulated as a biobjective integer program, where the considered objectives are formulated according to a network-wide optimization approach, i.e. the objective functions of the route optimization problem depend explicitly on all traffic flows in the network. A disjoint path pair is considered for each traffic trunk, which guarantees protection to the associated connection. A link-path formulation is proposed for the problem, in which a set of possible pairs of paths is devised in advance for each traffic trunk. An exact method (based on the classical constraint method for solving multiobjective problems) is developed for solving the formulated problem. An extensive experimental study, with results on network performance measures in various randomly generated networks, is also presented and discussed.     

Hierarchical multiobjective routing model in Multiprotocol Label Switching networks with two service classes – a Pareto archive strategy

The article begins by reviewing a two-level hierarchical multicriteria routing model for Multiprotocol Label Switching networks with two service classes (QoS, i.e. with Quality of Service requirements, and Best Effort services) and alternative routing, as well as the foundations of a heuristic resolution approach, previously proposed by the authors. Afterwards a new variant of this heuristic approach, which includes a Pareto archive strategy, is described. In this archive, non-dominated solutions obtained throughout the heuristic are kept. At the end of the main procedure of the heuristic, these solutions are evaluated and a final solution for the routing problem is chosen using a reference point-based approach. The application of this procedure to two test networks will show, with analytic and discrete-event simulation models, that, in certain initial conditions, this approach provides improvements in the final results concerning the top-level objective functions, especially in more ‘difficult’ situations detected through sensitivity analysis.     

Compatibility of TCP Reno and TCP Vegas in wireless ad hoc networks

Previous work has shown that TCP (transmission control protocol) Vegas outperforms the more widely deployed TCP Reno in both wired and wireless networks. It was also shown that when both TCP variants coexist on the same wired links, Reno dominates because of its more aggressive behaviour. This paper examines for the first time the compatibility between Reno and Vegas in wireless IEEE 802.11 ad hoc networks. It is shown that Vegas generally dominates in the heterogeneous Reno/Vegas network scenario; a startling result that is inconsistent with what is seen in wired networks. It is shown that the wireless ad hoc network environment does not reward the aggressive behaviour of Reno. On the other hand, Vegas, with its more accurate yet more conservative mechanisms, is able to capture most of the bandwidth. This is found to be true when using the on-demand routing protocols of dynamic source routing (DSR) or ad hoc on-demand distance vector (AODV): the failure of a node to reach a next-hop node because of media access control (MAC)-sublayer repeated collisions is reported to the routing protocol, which then declares a route error that impacts Reno in a more serious way than Vegas. When the table-driven routing protocol destination-sequenced distance vector (DSDV) is used, Reno and Vegas share the network bandwidth in a fairer manner. Generally, fairness in this environment can be improved by reducing the TCP maximum window size.     

Mesh模式下基于最小干扰流量的带宽调度算法

研究了干扰链路流量大小对IEEE802．16Mesh网络传输性能的影响,提出了一种通过计算用户站（SS）和基站（BS）的通信路径干扰的总流量来寻找总干扰流量最小的路由算法,并结合路由树给出了一种冲突避免调度的方法。该算法既考虑了干扰链路的数量,又考虑了干扰链路的实际通信强度,在建立路由树的过程中能够更快地使系统达到更佳的负载均衡状态,最大强度地避免调度中可能出现的带宽冲突。由于干扰流量的影响可以得到有效的控制,系统的吞吐量可以明显提高。仿真结果验证了该算法的有效性。     

An Intelligent Hybrid Mutual Authentication Scheme for Industrial Internet of Thing Networks

Internet of Things (IoT) network used for industrial management is vulnerable to different security threats due to its unstructured deployment, and dynamic communication behavior. In literature various mechanisms addressed the security issue of Industrial IoT networks, but proper maintenance of the performance reliability is among the common challenges. In this paper, we proposed an intelligent mutual authentication scheme leveraging authentication aware node (AAN) and base station (BS) to identify routing attacks in Industrial IoT networks. The AAN and BS uses the communication parameter such as a route request (RREQ), node-ID, received signal strength (RSS), and round-trip time (RTT) information to identify malicious devices and routes in the deployed network. The feasibility of the proposed model is validated in the simulation environment, where OMNeT++ was used as a simulation tool. We compare the results of the proposed model with existing field-proven schemes in terms of routing attacks detection, communication cost, latency, computational cost, and throughput. The results show that our proposed scheme surpasses the previous schemes regarding these performance parameters with the attack detection rate of 97.7 %.     

Dynamic O-band to C-band wideband wavelength converter for integrated VCSEL-based optical interconnects

ABSTRACT

Real-time wavelength conversion and traffic routing at key network nodes is a fundamental requirement for current optical interconnects. This work experimentally demonstrates a broadband wavelength conversion from O-band to C-band employing commercially available, power efficient VCSELs. A 1310?nm VCSEL is directly modulated with 8.5 Gbps data and transmitted over 22?km G. 652 fibre with a 0.53 dB penalty. The received data is used to run a 1550?nm VCSEL located at the network integration node, achieving the first reported wavelength conversion from O-to-C-band. VCSEL wavelength tuneability with changing bias current functionality is further exploited to route the converted wavelength over 400?GHz spectra range for integration into wavelength flexible networks. The newly converted wavelength is transmitted over 24.7?km of G. 655 fibre, incurring a maximum penalty of 1.86?dB. Results from this work proves an enabling development technology for wavelength converters for transparent contention resolution in current and future optical Interconnects.     

配载约束下双向搜寻节点的车辆路径问题

目的 研究三维装箱约束的车辆路径问题,即在给定车辆中尽可能多地装入货物且保证车辆行驶路线最优。方法 提出基于双向搜寻路径节点规则的智能水滴节约算法来求解车辆路径问题,并采用基于虚拟组合块的启发式算法来求解装箱问题。结果 通过数值算例检验,混合算法使车厢的平均空间利用率达到了76.14%,并确定了最优行驶路线。结论 基于双向搜寻路径节点规则的智能水滴节约算法可找出最优的行驶路线,而基于虚拟组合块的启发式算法也能合理放置货物,得出较优的装载方案。