CoopAI-Route: DRL Empowered Multi-Agent Cooperative System for Efficient QoS-Aware Routing for Network Slicing in Multi-Domain SDN

The emergence of beyond 5G networks has the potential for seamless and intelligent connectivity on a global scale.Network slicing is crucial in delivering services for different,demanding vertical applications in this context.Next-generation applications have time-sensitive requirements and depend on the most efficient routing path to ensure packets reach their intended destinations.However,the existing IP(Internet Protocol)over a multi-domain network faces challenges in enforcing network slicing due to minimal collaboration and information sharing among network operators.Conventional inter-domain routing methods,like Border Gateway Protocol(BGP),cannot make routing decisions based on performance,which frequently results in traffic flowing across congested paths that are never optimal.To address these issues,we propose CoopAI-Route,a multi-agent cooperative deep reinforcement learning(DRL)system utilizing hierarchical software-defined networks(SDN).This framework enforces network slicing in multi-domain networks and cooperative communication with various administrators to find performance-based routes in intra-and inter-domain.CoopAI-Route employs the Distributed Global Topology(DGT)algorithm to define inter-domain Quality of Service(QoS)paths.CoopAI-Route uses a DRL agent with a message-passing multi-agent Twin-Delayed Deep Deterministic Policy Gradient method to ensure optimal end-to-end routes adapted to the specific requirements of network slicing applications.Our evaluation demonstrates CoopAI-Route’s commendable performance in scalability,link failure handling,and adaptability to evolving topologies compared to state-of-the-art methods.

MA-Res U-Net:Design of Soybean Navigation System with Improved U-Net Model

Traditional machine vision algorithms have difficulty handling the interference of light and shadow changes,broken rows,and weeds in the complex growth circumstances of soybean fields,which leads to erroneous navigation route segmentation.There are additional shortcomings in the feature extractFion capabilities of the conventional U-Net network.Our suggestion is to utilize an improved U-Net-based method to tackle these difficulties.First,we use ResNet’s powerful feature extraction capabilities to replace the original U-Net encoder.To enhance the concentration on characteristics unique to soybeans,we integrate a multi-scale high-performance attention mechanism.Furthermore,to do multi-scale feature extraction and capture a wider variety of contextual information,we employ atrous spatial pyramid pooling.The segmented image generated by our upgraded U-Net model is then analyzed using the CenterNet method to extract key spots.The RANSAC algorithm then uses these important spots to delineate the soybean seedling belt line.Finally,the navigation line is determined using the angle tangency theory.The experimental findings illustrate the superiority of our method.Our improved model significantly outperforms the original U-Net regarding mean Pixel Accuracy(mPA)and mean Intersection over Union(mIOU)indices,showing a more accurate segmentation of soybean routes.Furthermore,our soybean route navigation system’s outstanding accuracy is demonstrated by the deviation angle,which is only 3°between the actual deviation and the navigation line.This technology makes a substantial contribution to the sustainable growth of agriculture and shows potential for real-world applications.

Risk-Balanced Routing Strategy for Service Function Chains of Cyber-Physical Power System Considering Cross-Space Cascading Failure

Cyber-physical power system(CPPS)has significantly improved the operational efficiency of power systems.However,cross-space cascading failures may occur due to the coupling characteristics,which poses a great threat to the safety and reliability of CPPS,and there is an acute need to reduce the probability of these failures.Towards this end,this paper first proposes a cascading failure index to identify and quantify the importance of different information in the same class of communication services.On this basis,a joint improved risk-balanced service function chain routing strategy(SFC-RS)is proposed,which is modeled as a robust optimization problem and solved by column-and-constraint generation(C-CG)algorithm.Compared with the traditional shortest-path routing algorithm,the superiority of SFC-RS is verified in the IEEE 30-bus system.The results demonstrate that SFC-RS effectively mitigates the risk associated with information transmission in the network,enhances information transmission accessibility,and effectively limits communication disruption from becoming the cause of cross-space cascading failures.

TaChord: a Chord system using topology-aware routing and super peers

Due to minimum consideration of an actual network topology, the existing peer-to-peer (P2P) overlay networks, such as CAN, Chord, Pastry and Tapestry, will lead to high latency and low efficiency. In TaChord, a topology-aware routing approach in P2P overlays and an improved design in Chord are presented. TaChord and other algorithms are evaluated by physical hops, interdomain-adjusted latency, and aggregate bandwidth used per message. Experimental results demonstrate that TaChord has the drastic improvement in routing performance where average physical hop is half that of chord, and the impact of cache management strategies in the TaChord overlay cannot be neglected.

Modeling commuters' route choice behavior under pre-trip information system

Research about the auto commuter＇s pre-trip route choice behavior ignores the combined influence of the real-time information and all respondents＇ historical information in the existing documents.To overcome this shortcoming,an approach to describing the pre-trip route choice behavior with the incorporation of the real-time and historical information is proposed.Two types of real-time information are investigated,which are quantitative information and prescriptive information.By using the bounded rationality theory,the influence of historical information on the real-time information reference process is examined first.Estimation results show that the historical information has a significant influence on the quantitative information reference process,but not on the prescriptive information reference process.Then the route choice behavior is modeled.A comparison is also made among three route choice models,one of which does not incorporate the real-time information reference process,while the others do.Estimation results show that the route choice behavior is better described with the consideration of the reference process of both quantitative and prescriptive information.

Tactical planning and optimization of a milk run system of parts pickup for an engine manufacturer

A real-life milk run system designing problem of an engine manufacturer adopted JIT(just-in-time)production is studied.In the process of milk run system planning and design,the supply base is identified and a supplier site map is plotted for an arrangement of routes on which parts are periodically collected in a JIT manner from many scattered suppliers.With unit load designing,vehicle choosing and fleet sizing,pickup routing,vehicle assigning and scheduling problems are studied.Among these problems,a CVRP problem is identified and formulated as the key optimization in designing this milk run system,and it is solved through an optimization process.This tactical planning and optimization process gives a good solution to the real problem,and may shed light on the planning of similar systems.

基于DR-System的存贮路径问题研究

本文研究的是基于DR-System的存贮路径问题,即综合考虑配送中心订货成本、配送成本、配送中心和客户库存持有成本的最小化问题。本文提出并运用启发式算法来求解该问题。首先把问题分解为两个子问题,即配送中心的订货问题和客户的配送问题,分别求解得到问题的初始解;然后,通过分析客户配送提前对总成本的影响,来改进初始解,从而得到该问题的一个满意解。

Modeling Delay and Packet Drop in Networked Control Systems Using Network Simulator NS2

Wireless Networked Control Systems (WNCS) are used to implement a control mechanism over a wireless network that is capable of carrying real-time traffic. This field has drawn enormous attention from current researchers because of its flexibility and robustness. However, designing efficient WNCS over Mobile Ad Hoc Networks (MANET) is still a challenging topic because of its less-predictable aspects, such as inconsistent delay, packet drop probability, and dynamic topology. This paper presents design guidelines for WNCS over MANET using the Network Simulator version 2, NS2 software. It investigates the impact of packet delay and packet drop under the AODV and DSR routing protocols. The simulation results have been compared to MATLAB results for validation. Keywords Adhoc On-Demand Distance Vector (AODV) routing - Dynamic Source routing (DSR) - Mobile Adhoc Networks (MANET) - Wireless Networked Control Systems (WNCS) Mohammad Shahidul Hasan received his BSc and first MSc in Computer Science from the University of Dhaka, Bangladesh. He obtained his 2nd MSc in Computer & Network Engineering from Sheffield Hallam University, Sheffield, UK. Currently he is pursuing his PhD under the Faculty of Computing, Engineering and Technology, Staffordshire University, Stafford, UK in Networked Control Systems over MANET.Chris Harding received his BSc in Computing Science and Masters by Research from Staffordshire University, UK. Currently he is pursuing his PhD in Wireless Networked Control Systems, specifically looking at NCS over MANETs, with research interests in this area concentrating on the network routing and effect of routing protocols on the NCS system.Hongnian Yu is Professor of Computer Science at Staffordshire University. He was a lecturer in Control and Systems Engineering at Yanshan University, China in 1985–1990, did his PhD in Robotics at King’s College London (1990–1994), was a research fellow in Manufacturing Systems at Sussex University (1994–1996), a lecturer in Artificial Intelligence at Liver-pool John Moore’s University (1996–1999), a lecturer in Control and Systems Engineering at the University of Exeter (1999–2002), and a Senior Lecturer in Computing at the University of Bradford (2002–2004). He now leads the Mobile Computing and Distributed Systems Research Group at Staffordshire University. He was a founding member of the Modeling Optimisation Scheduling and Intelligent Control research group at the University of Bradford. He has extensive research experience in neural networks, mobile computing, modeling, control of robot manipulators, and modeling, scheduling, planning, and simulations of large discrete event dynamic systems with applications to manufacturing systems, supply chains, transportation networks, and computer networks. He has published over 100 research papers focusing on the following: neural networks, computer networks, adaptive and robust control of robot manipulators, analysis and control of hybrid machines, control of timed delay systems, predictive control, manufacturing system modeling and scheduling, planning, and supply chains. He has held several research grants from EPSRC, the Royal Society, and the EU, as well as from industry. He was awarded the F.C. William Premium for his paper on adaptive and robust control of robot manipulators by the IEE Council in 1997. Professor Yu is an EPSRC college member, a member of IEEE, and a committee member of several conferences and journal editorial boards.Alison Griffiths has been a Senior Lecturer in Telecommunications at Staffordshire University since 2003. She was a lecturer in Computing at Staffordshire University in 2002–2003. She was a Research Associate on an EPSRC funded project whilst doing her PhD on the convergence of Mobile Computing and Telecommunications at Staffordshire University (1999–2003). The investigation consisted of the communication of different types of media (voice, video conferencing, web browsing, and downloading) over a common network, using a mobile device. Problems considered were the complications that occurred when a user moves, and consequently changes their end-point in the network during communication, with respect to the type of service the user is provided with (delays and losses). She obtained both her MEng and 1st Class BEng (Hons) from Staffordshire University in 1999 and 1998 respectively. She is now part of the Mobile Computing and Distributed Systems Research Group at Staffordshire University. She has published 8 research papers focusing on quality of service and access between cellular and IP packet switched networks. Future directions include mobile agents and control of mobile wireless ad-hoc networks. Her current research interests have extended to Wireless Networked Control Systems, specifically looking at NCS over MANETs, with research interests in this area concentrating on the network routing and effect of routing protocols on the NCS system.

Routing Protocols for Transmitting Large Databases or Multi databases Systems

Most knowledgeable people agree that networking and routing technologies have been around about 25 years. Routing is simultaneously the most complicated function of a network and the most important. It is of the same kind that more than 70% of computer application fields are MIS applications. So the challenge in building and using a MIS in the network is developing the means to find, access, and communicate large databases or multi databases systems. Because general databases are not time continuous, in fact, they can not be streaming, so we can't obtain reliable and secure quality of service by deleting some unimportant datagrams in the databases transmission. In this article, we will discuss which kind of routing protocol is the best type for large databases or multi databases systems transmission in the networks.

Multi-type ant system algorithm for the time dependent vehicle routing problem with time windows

The time dependent vehicle routing problem with time windows（TDVRPTW） is considered. A multi-type ant system（MTAS） algorithm hybridized with the ant colony system（ACS）and the max-min ant system（MMAS） algorithms is proposed. This combination absorbs the merits of the two algorithms in solutions construction and optimization separately. In order to improve the efficiency of the insertion procedure, a nearest neighbor selection（NNS） mechanism, an insertion local search procedure and a local optimization procedure are specified in detail. And in order to find a balance between good scouting performance and fast convergence rate, an adaptive pheromone updating strategy is proposed in the MTAS. Computational results confirm the MTAS algorithm＇s good performance with all these strategies on classic vehicle routing problem with time windows（VRPTW） benchmark instances and the TDVRPTW instances, and some better results especially for the number of vehicles and travel times of the best solutions are obtained in comparison with the previous research.

DRRS-BC:Decentralized Routing Registration System Based on Blockchain

The border gateway protocol(BGP)has become the indispensible infrastructure of the Internet as a typical inter-domain routing protocol.However,it is vulnerable to misconfigurations and malicious attacks since BGP does not provide enough authentication mechanism to the route advertisement.As a result,it has brought about many security incidents with huge economic losses.Exiting solutions to the routing security problem such as S-BGP,So-BGP,Ps-BGP,and RPKI,are based on the Public Key Infrastructure and face a high security risk from the centralized structure.In this paper,we propose the decentralized blockchain-based route registration framework-decentralized route registration system based on blockchain(DRRS-BC).In DRRS-BC,we produce a global transaction ledge by the information of address prefixes and autonomous system numbers between multiple organizations and ASs,which is maintained by all blockchain nodes and further used for authentication.By applying blockchain,DRRS-BC perfectly solves the problems of identity authentication,behavior authentication as well as the promotion and deployment problem rather than depending on the authentication center.Moreover,it resists to prefix and subprefix hijacking attacks and meets the performance and security requirements of route registration.

GIS-based Decision Support System for Wood Logistics

A wood logistics system was combined with a linear programming (LP) method utilizing GIS-based techniques on the platform of GIS software-ARC/INFO. The combined costs of road and off-road transport were taken as the objective function to find the least cost route and the optimal landing locations of wood transportation. Then transport costs and allowable wood volume of stands were calculated. An LP model was developed to allocate timber resources among mills in order to minimize the wood logistics costs from harvesting sites to mills. The parameters of the LP model, including the transport costs, allowable wood volume and wood orders, were written into a text file in MPS format which were then accessed by LINDO to solve the LP problem. The system is an effective tool to manage logistics, information and funds together in order to increase the speed of wood logistics and reduce the cost. The benefits and efficiency of mill cluster can be improved. The focal firm in the cluster can be competitive.

Error-detected single-photon quantum routing using a quantum dot and a double-sided microcavity system

Based on a hybrid system consisting of a quantum dot coupled with a double-sided micropillar cavity, we investigate the implementation of an error-detected photonic quantum routing controlled by the other photon. The computational errors from unexpected experimental imperfections are heralded by single photon detections, resulting in a unit fidelity for the present scheme, so that this scheme is intrinsically robust. We discuss the performance of the scheme with currently achievable experimental parameters. Our results show that the present scheme is efficient. Furthermore, our scheme could provide a promising building block for quantum networks and distributed quantum information processing in the future.

A clinical perspective on mucoadhesive buccal drug delivery systems

Mucoadhesion can be defined as a state in which two components, of which one is of biological origin, are held together for extended periods of time by the help of interfacial forces. Among the various transmucosal routes, buccal mucosa has excellent accessibility and relatively immobile mucosa, hence suitable for administration of retentive dosage form. The objective of this paper is to review the works done so far in the field of mucoadhe- sire buccal drug delivery systems （MBDDS）, with a clinical perspective. Starting with a brief introduction of the mucoadhesive drug delivery systems, oral mucosa, and the theories of mucoadhesion, this article then proceeds to cover the works done so far in the field of MBDDS, categorizing them on the basis of ailments they are meant to cure. Additionally, we focus on the various patents, recent advancements, and challenges as well as the future prospects for mucoadhesive buccal drug delivery systems.

Solving material distribution routing problem in mixed manufacturing systems with a hybrid multi-objective evolutionary algorithm

The material distribution routing problem in the manufacturing system is a complex combinatorial optimization problem and its main task is to deliver materials to the working stations with low cost and high efficiency. A multi-objective model was presented for the material distribution routing problem in mixed manufacturing systems, and it was solved by a hybrid multi-objective evolutionary algorithm (HMOEA). The characteristics of the HMOEA are as follows: 1) A route pool is employed to preserve the best routes for the population initiation; 2) A specialized best?worst route crossover (BWRC) mode is designed to perform the crossover operators for selecting the best route from Chromosomes 1 to exchange with the worst one in Chromosomes 2, so that the better genes are inherited to the offspring; 3) A route swap mode is used to perform the mutation for improving the convergence speed and preserving the better gene; 4) Local heuristics search methods are applied in this algorithm. Computational study of a practical case shows that the proposed algorithm can decrease the total travel distance by 51.66%, enhance the average vehicle load rate by 37.85%, cut down 15 routes and reduce a deliver vehicle. The convergence speed of HMOEA is faster than that of famous NSGA-II.

Path-tracking Control of a Tractor-aircraft System

An aircraft tractor plays a significant role as a kind of important marine transport and support equipment. It＇s necessary to study its controlling and manoeuvring stability to improve operation efficiency. A virtual prototyping model of the tractor-aircraft system based on Lagrange＇s equation of the first kind with Lagrange mutipliers was established in this paper, According to the towing characteristics, a path-tracking controller using fuzzy logic theory was designed. Direction control herein was carried out through a compensatory tracking approach. Interactive co-simulation was performed to validate the path-tracking behavior in closed-loop, Simulation results indicated that the tractor followed the reference courses precisely on a flat ground.

Information Collection System of Crop Growth Environment Based on the Internet of Things

Based on the technology of Internet of things, for the issues of large amount data acquisition and difficult real time transport in the data acquisition of crop growth environment, this paper designs one information collection system for crop growth environment. Utilizing the range free location mechanism which defines the node position and GEAR routing mechanism give solutions to the problems of node location, routing protocol applications and so on. This system can realize accurate and automatic real time collection, aggregation and transmission of crop growth environment information, and can achieve the automation of agricultural production, to the maximum extent.

Route design and automatic check in electronic chart display and information system

For an electronic chart display and information system (ECDIS), the most important function is the route design. In this paper, a novel approach to developing ECDIS was given and then an effective method was proposed for route design and automatic check. The mathematical model and logical relationship for coordinate transformation were also provided. They were adopted in ECDIS developing, which was based on the researeh of the Vxworks real-time operating system. The actual system application implies that the method is practical and can help navigation very well.

Aggregator Based RPL for an IoT-Fog Based Power Distribution System with 6LoWPAN

Advanced Metering Infrastructure(AMI)forms an important part in Smart Grids.Routing the data effectively from smart meters to the Edge/Fog node requires an efficient routing protocol.Routing Protocol for Low Power Lossy Area Network(RPL)is a standard routing protocol for IPv6 over Low Power Personal Area Network(6LoWPAN).In a Power Distribution system all the smart meters together form 6LoWPAN network.They communicate with the fog router,which acts as the 6LoWPAN gateway.ContikiRPL was evaluated using Cooja Network simulator for a power distribution network topology.The nodes which were far away from the fog node gave low Packet Delivery Ratio(PDR)and large End to End delay.This paper proposes an aggregation RPL scheme by modifying the existing Contiki RPL.The smart meter nodes communicate to the aggregator,which communicates to the fog node.The results show that the aggregation scheme has 35.6%increase in PDR,lesser hop count and 13.24%decrease in End to End delay on an average compared to existing RPL.

Practical Security Approaches against Border Gateway Protocol (BGP) Session Hijacking Attacks between Autonomous Systems

The border gateway protocol (BGP) is the default inter domain routing protocol used on the internet for exchanging information between autonomous systems. Available literature suggests that BGP is vulnerable to session hijacking attacks. There are a number of proposals aimed at improving BGP security which have not been fully implemented. This paper examines a number of approaches for securing BGP through a comparative study and identifies the reasons why these proposals have not been implemented commercially. This paper analyses the architecture of internet routing and the design of BGP while focusing on the problem of BGP session hijacking attacks. Using Graphical Network Simulator 3 (GNS-3), a session hijack is demonstrated and a solution which involves the implementation of route filtering, policy-maps and route-maps on CISCO routers representing ASes is carried out. In the end, a workable industry standard framework for securing and protecting BGP sessions and border routers from exploitation with little or no modification to the existing routing infrastructure is demonstrated.