A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks.On the basis of traditional multi-path routing,the algorith...A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks.On the basis of traditional multi-path routing,the algorithm uses a random linear network coding strategy to code data pack-ets.Code number is determined by the next hop link status and the number of current received packets sent by the upstream node together.The algorithm improves retransmission and cache mechanisms through using redundancy caused by network coding.Meanwhile,the algorithm also adopts the flow distribution strategy based on time delay to balance network load.Simulation results show that the proposed routing algorithm can effectively improve packet delivery rate,reduce packet delay,and enhance network performance.展开更多
An algorithm of traffic distribution called active multi-path routing(AMR)in active network is proposed.AMR adopts multi-path routing and applies nonlinear optimizeapproximate method to distribute network traffic amon...An algorithm of traffic distribution called active multi-path routing(AMR)in active network is proposed.AMR adopts multi-path routing and applies nonlinear optimizeapproximate method to distribute network traffic among multiple paths.It is combined to bandwidthresource allocation and the congestion restraint mechanism to avoid congestion happening and worsen.So network performance can be improved greatly.The frame of AMR includes adaptive trafficallocation model,the conception of supply bandwidth and its'allocation model,the principle ofcongestion restraint and its'model,and the implement of AMR based on multi-agents system in activenetwork.Through simulations,AMR has distinct effects on network performance.The results show AMRisa valid traffic regulation algorithm.展开更多
A Mobile Ad hoc NETwork(MANET)is a self-configuring network that is not reliant on infrastructure.This paper introduces a new multipath routing method based on the Multi-Hop Routing(MHR)technique.MHR is the consecutiv...A Mobile Ad hoc NETwork(MANET)is a self-configuring network that is not reliant on infrastructure.This paper introduces a new multipath routing method based on the Multi-Hop Routing(MHR)technique.MHR is the consecutive selection of suitable relay nodes to send information across nodes that are not within direct range of each other.Failing to ensure good MHR leads to several negative consequences,ultimately causing unsuccessful data transmission in a MANET.This research work consists of three portions.The first to attempt to propose an efficient MHR protocol is the design of Priority Based Dynamic Routing(PBDR)to adapt to the dynamic MANET environment by reducing Node Link Failures(NLF)in the network.This is achieved by dynamically considering a node’s mobility parameters like relative velocity and link duration,which enable the next-hop selection.This method works more efficiently than the traditional protocols.Then the second stage is the Improved Multi-Path Dynamic Routing(IMPDR).The enhancement is mainly focused on further improving the Quality of Service(QoS)in MANETs by introducing a QoS timer at every node to help in the QoS routing of MANETs.Since QoS is the most vital metric that assesses a protocol,its dynamic estimation has improved network performance considerably.This method uses distance,linkability,trust,and QoS as the four parameters for the next-hop selection.IMPDR is compared against traditional routing protocols.The Network Simulator-2(NS2)is used to conduct a simulation analysis of the protocols under consideration.The proposed tests are assessed for the Packet Delivery Ratio(PDR),Packet Loss Rate(PLR),End-to-End Delay(EED),and Network Throughput(NT).展开更多
Many ＂rich - connected＂ topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize t...Many ＂rich - connected＂ topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize the high network capacity by appropriate multi- path routing algorithms. As flow-level path splitting may lead to trafl＇ic imbalance between paths due to flow- size difference, packet-level path splitting attracts more attention lately, which spreads packets from flows into multiple available paths and significantly improves link utilizations. However, it may cause packet reordering, confusing the TCP congestion control algorithm and lowering the throughput of flows. In this paper, we design a novel packetlevel multi-path routing scheme called SOPA, which leverag- es OpenFlow to perform packet-level path splitting in a round- robin fashion, and hence significantly mitigates the packet reordering problem and improves the network throughput. Moreover, SOPA leverages the topological feature of data center networks to encode a very small number of switches along the path into the packet header, resulting in very light overhead. Compared with random packet spraying （RPS）, Hedera and equal-cost multi-path routing （ECMP）, our simulations demonstrate that SOPA achieves 29.87%, 50.41% and 77.74% higher network throughput respectively under permutation workload, and reduces average data transfer completion time by 53.65%, 343.31% and 348.25% respectively under production workload.展开更多
Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path r...Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path routing protocol based on the credible cluster heads. The protocol chooses nodes with more energy remained as cluster heads at the cluster head choosing phase, and then authenticates them by the neighbor cluster heads. Using trust mechanisms it creates the credit value, and based on the credit value the multi-path cluster head routing can finally be found. The credit value is created and exchanged among the cluster heads only. Theoretical analysis combined with simulation results demonstrate that this protocol can save the resource, prolong the lifetime, and ensure the security and performance of the network.展开更多
The layer 2 network technology is extending beyond its traditional local area implementation and finding wider acceptance in provider’s metropolitan area networks and large-scale cloud data center networks. This is m...The layer 2 network technology is extending beyond its traditional local area implementation and finding wider acceptance in provider’s metropolitan area networks and large-scale cloud data center networks. This is mainly due to its plug-and-play capability and native mobility support. Many efforts have been put to increase the bisection bandwidth in a layer 2 network, which has been constrained by the spanning tree protocol that a layer 2 network uses for preventing looping. The recent trend is to incorporate layer 3’s routing approach into a layer 2 network so that multiple paths can be used for forwarding traffic between any source-destination (S-D) node pair. ECMP (equal cost multipath) is one such example. However, ECMP may still be limited in generating multiple paths due to its shortest path (lowest cost) requirement. In this paper, we consider a non-shortest-path routing approach, called EPMP (Equal Preference Multi-Path) that can generate more paths than ECMP. The EPMP is based on the ordered semi-group algebra. In the EPMP routing, paths that differ in traditionally-defined costs, such as hops, bandwidth, etc., can be made equally preferred and thus become candidate paths. We found that, in comparison with ECMP, EPMP routing not only generates more paths, provides higher bisection bandwidth, but also allows bottleneck links in a hierarchical network to be identified when different traffic patterns are applied. EPMP is also versatile in that it can use various ways of path preference calculations to control the number and the length of paths, making it flexible (like policy-based routing) but also objective (like shortest path first routing) in calculating preferred paths.展开更多
Geography rectangle is used to reduce signaling overhead of the LEO satellite networks.Moreover,a multi-path routing algorithm based on an improved ant colony system(MPRA-AC) is proposed.Matrix indicating the importan...Geography rectangle is used to reduce signaling overhead of the LEO satellite networks.Moreover,a multi-path routing algorithm based on an improved ant colony system(MPRA-AC) is proposed.Matrix indicating the importance of the link between satellites is introduced into MPRA-AC in order to find the optimal path more quickly.Simulation results show that MPRA-AC reduces the number of iterations to achieve a satisfactory solution.At the same time,the packet delivery ratio of LEO satellite networks when running MPRA-AC and DSR-LSN(dynamic source routing algorithm for LEO satellite networks) is compared.The packet delivery ratio is about 7.9%lower when running DSR-LSN.Moreover,because of the mechanism of active load balancing of MPRA-AC,simulation results show that MPRA-AC outperforms DSR-LSN in link utilization when data packets are transmitted in the networks.展开更多
The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this p...The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this paper.The new routing protocol utilize an act of orientation of UWB and tries to get sufficient route information and decrease the network load caused by route discovery at the same time.Simulation results show that the routing load of the new protocol is lower and throughput is higher than that of DSR.While the node’s mobility increases,these advantages become more obvious.展开更多
Traditional multi-path routing mechanisms aim to establish complete node or link disjoint paths. However, under some circumstances if multiple paths cannot be established based on the current network topology, the tra...Traditional multi-path routing mechanisms aim to establish complete node or link disjoint paths. However, under some circumstances if multiple paths cannot be established based on the current network topology, the traditional multi-path routing mechanism will degenerate into single path routing mechanism, thus the advantages of multi-path routing cannot be exhibited. To enhance the end-to-end path reliability, an adaptive multi-path routing mechanism with path segment is proposed, in which multi-path can be established at part of the end-to-end path. In this way the reliability of the path can be enhanced. This path segment mechanism can divide the end-to-end path into several short segments, and a parallel forwarding mechanism is proposed for guaranteeing the quality of service of multimedia services over the wireless network. Simulations show that the network performance metrics such as the packet delivery ratio, the end-to-end delay and the number of route discoveries are all improved by using the adaptive multi-path routing mechanism.展开更多
Quality of service （QoS） routing algorithms have been hardly discussed in the scientific community, most previous work on QoS routing concentrates on the performance of the single route. Cognitive packet network （...Quality of service （QoS） routing algorithms have been hardly discussed in the scientific community, most previous work on QoS routing concentrates on the performance of the single route. Cognitive packet network （CPN） has been designed for providing QoS routing. In this paper, to balance the loads among networks, we present a multi-path routing algorithm based on load-balance （MPRLB）, which is carried out in two steps. The algorithm with low computational complexity is firstly applied to establish multi path routing for each source and destination node pairs （SD-pair） nodes in the network. Then, we propose the hopfield neural network algorithm, which is applied to improve the efficiency of the flow deviation method for fast flow allocation among the links of the network based on load balance. Extensive simulation results demonstrate that the proposed scheme significantly improves the performance compared with the existing scheme that ignores load balancing.展开更多
This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shap...This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shape, algorithm QSRA shapes disjoint-alternate-path structure, but is not limited to. It also contains another structure that every primary node has several links to alternate paths. This structure has two advantages, the first one is that primary nodes can select one alternate path immediately when primary routing is failure without going back to source node to re-discover a new routing or choose an alternate path; the second is that it guarantees primary nodes can select another alternate path as quickly as possible once one of alternate paths fails. Strongpoint of algorithm QSRA is reducing frequency of routing re-discovering. Besides, the structure occupies fewer resources than other routing algorithms due to its distributed structure. Simulation shows that QSRA has higher packets received ratio and lower control packet overhead and lower end-to-end delay.展开更多
As an important secure routing mechanism, multi-path routing is one of the major ways to improve network efficiency and to guarantee the network security, which ensures the reliability of data transmission by using ba...As an important secure routing mechanism, multi-path routing is one of the major ways to improve network efficiency and to guarantee the network security, which ensures the reliability of data transmission by using backup paths when the primary one is unavailable due to local node or link failures. Most current studies on multi-path routing mechanism are based on experiments or simulations. The resulta are usually specific application scenarios oriented heuristic algorithms, lacking universal significance. In this paper, a theoretic analysis is performed on the relationship between the multi-path routing policy, the network efficiency and its survivability. Starting with point-to-point communication network, an impactoriented analysis is made on the network interference under multi-path routing mechanism. Based on the analysis, the upper-limit of network performance under interference impact is also discussed.展开更多
Wirreless sensor networks are being widely researched and are expected to be used in several scenarios. On the leading edge of treads, on-demand, high-reliability, and low-latency routing protocol is desirable for ind...Wirreless sensor networks are being widely researched and are expected to be used in several scenarios. On the leading edge of treads, on-demand, high-reliability, and low-latency routing protocol is desirable for indoor environment applications. This article proposes a routing scheme called robust multi-path routing that establishes and uses multiple node-disjoint routes. Providing multiple routes helps to reduce the route recovery process and control the message overhead. The performance comparison of this protocol with dynamic source routing （DSR） by OPNET simulations shows that this protocol is able to achieve a remarkable improvement in the packet delivery ratio and average end-to-end delay.展开更多
Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To sa...Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.展开更多
Cross-domain routing in Integrated Heterogeneous Networks(Inte-HetNet)should ensure efficient and secure data transmission across different network domains by satisfying diverse routing requirements.However,current so...Cross-domain routing in Integrated Heterogeneous Networks(Inte-HetNet)should ensure efficient and secure data transmission across different network domains by satisfying diverse routing requirements.However,current solutions face numerous challenges in continuously ensuring trustworthy routing,fulfilling diverse requirements,achieving reasonable resource allocation,and safeguarding against malicious behaviors of network operators.We propose CrowdRouting,a novel cross-domain routing scheme based on crowdsourcing,dedicated to establishing sustained trust in cross-domain routing,comprehensively considering and fulfilling various customized routing requirements,while ensuring reasonable resource allocation and effectively curbing malicious behavior of network operators.Concretely,CrowdRouting employs blockchain technology to verify the trustworthiness of border routers in different network domains,thereby establishing sustainable and trustworthy crossdomain routing based on sustained trust in these routers.In addition,CrowdRouting ingeniously integrates a crowdsourcing mechanism into the auction for routing,achieving fair and impartial allocation of routing rights by flexibly embedding various customized routing requirements into each auction phase.Moreover,CrowdRouting leverages incentive mechanisms and routing settlement to encourage network domains to actively participate in cross-domain routing,thereby promoting optimal resource allocation and efficient utilization.Furthermore,CrowdRouting introduces a supervisory agency(e.g.,undercover agent)to effectively suppress the malicious behavior of network operators through the game and interaction between the agent and the network operators.Through comprehensive experimental evaluations and comparisons with existing works,we demonstrate that CrowdRouting excels in providing trustworthy and fine-grained customized routing services,stimulating active participation in cross-domain routing,inhibiting malicious operator behavior,and maintaining reasonable resource allocation,all of which outperform baseline schemes.展开更多
This paper systematically reviews the latest research developments in Vehicle Routing Problems(VRP).It examines classical VRP models and their classifications across different dimensions,including load capacity,operat...This paper systematically reviews the latest research developments in Vehicle Routing Problems(VRP).It examines classical VRP models and their classifications across different dimensions,including load capacity,operational characteristics,optimization objectives,vehicle types,and time constraints.Based on literature retrieval results from the Web of Science database,the paper analyzes the current state and trends in VRP research,providing detailed explanations of VRP models and algorithms applied to various scenarios in recent years.Additionally,the article discusses limitations in existing research and provides perspectives on future development trends in VRP research.This review offers researchers in the VRP field a comprehensive overview while identifying future research directions.展开更多
This paper proposes an efficient strategy for resource utilization in Elastic Optical Networks (EONs) to minimize spectrum fragmentation and reduce connection blocking probability during Routing and Spectrum Allocatio...This paper proposes an efficient strategy for resource utilization in Elastic Optical Networks (EONs) to minimize spectrum fragmentation and reduce connection blocking probability during Routing and Spectrum Allocation (RSA). The proposed method, Dynamic Threshold-Based Routing and Spectrum Allocation with Fragmentation Awareness (DT-RSAF), integrates rerouting and spectrum defragmentation as needed. By leveraging Yen’s shortest path algorithm, DT-RSAF enhances resource utilization while ensuring improved service continuity. A dynamic threshold mechanism enables the algorithm to adapt to varying network conditions, while its fragmentation awareness effectively mitigates spectrum fragmentation. Simulation results on NSFNET and COST 239 topologies demonstrate that DT-RSAF significantly outperforms methods such as K-Shortest Path Routing and Spectrum Allocation (KSP-RSA), Load Balanced and Fragmentation-Aware (LBFA), and the Invasive Weed Optimization-based RSA (IWO-RSA). Under heavy traffic, DT-RSAF reduces the blocking probability by up to 15% and achieves lower Bandwidth Fragmentation Ratios (BFR), ranging from 74% to 75%, compared to 77% - 80% for KSP-RSA, 75% - 77% for LBFA, and approximately 76% for IWO-RSA. DT-RSAF also demonstrated reasonable computation times compared to KSP-RSA, LBFA, and IWO-RSA. On a small-sized network, its computation time was 8710 times faster than that of Integer Linear Programming (ILP) on the same network topology. Additionally, it achieved a similar execution time to LBFA and outperformed IWO-RSA in terms of efficiency. These results highlight DT-RSAF’s capability to maintain large contiguous frequency blocks, making it highly effective for accommodating high-bandwidth requests in EONs while maintaining reasonable execution times.展开更多
The integration of the dynamic adaptive routing(DAR)algorithm in unmanned aerial vehicle(UAV)networks offers a significant advancement in addressing the challenges posed by next-generation communication systems like 6...The integration of the dynamic adaptive routing(DAR)algorithm in unmanned aerial vehicle(UAV)networks offers a significant advancement in addressing the challenges posed by next-generation communication systems like 6G.DAR’s innovative framework incorporates real-time path adjustments,energy-aware routing,and predictive models,optimizing reliability,latency,and energy efficiency in UAV operations.This study demonstrated DAR’s superior performance in dynamic,large-scale environments,proving its adaptability and scalability for real-time applications.As 6G networks evolve,challenges such as bandwidth demands,global spectrum management,security vulnerabilities,and financial feasibility become prominent.DAR aligns with these demands by offering robust solutions that enhance data transmission while ensuring network reliability.However,obstacles like global route optimization and signal interference in urban areas necessitate further refinement.Future directions should explore hybrid approaches,the integration of machine learning,and comprehensive real-world testing to maximize DAR’s capabilities.The findings underscore DAR’s pivotal role in enabling efficient and sustainable UAV communication systems,contributing to the broader landscape of wireless technology and laying a foundation for the seamless transition to 6G networks.展开更多
As commercial drone delivery becomes increasingly popular,the extension of the vehicle routing problem with drones(VRPD)is emerging as an optimization problem of inter-ests.This paper studies a variant of VRPD in mult...As commercial drone delivery becomes increasingly popular,the extension of the vehicle routing problem with drones(VRPD)is emerging as an optimization problem of inter-ests.This paper studies a variant of VRPD in multi-trip and multi-drop(VRP-mmD).The problem aims at making schedules for the trucks and drones such that the total travel time is minimized.This paper formulate the problem with a mixed integer program-ming model and propose a two-phase algorithm,i.e.,a parallel route construction heuristic(PRCH)for the first phase and an adaptive neighbor searching heuristic(ANSH)for the second phase.The PRCH generates an initial solution by con-currently assigning as many nodes as possible to the truck–drone pair to progressively reduce the waiting time at the rendezvous node in the first phase.Then the ANSH improves the initial solution by adaptively exploring the neighborhoods in the second phase.Numerical tests on some benchmark data are conducted to verify the performance of the algorithm.The results show that the proposed algorithm can found better solu-tions than some state-of-the-art methods for all instances.More-over,an extensive analysis highlights the stability of the pro-posed algorithm.展开更多
Border Gateway Protocol(BGP),as the standard inter-domain routing protocol,is a distance-vector dynamic routing protocol used for exchanging routing information between distributed Autonomous Systems(AS).BGP nodes,com...Border Gateway Protocol(BGP),as the standard inter-domain routing protocol,is a distance-vector dynamic routing protocol used for exchanging routing information between distributed Autonomous Systems(AS).BGP nodes,communicating in a distributed dynamic environment,face several security challenges,with trust being one of the most important issues in inter-domain routing.Existing research,which performs trust evaluation when exchanging routing information to suppress malicious routing behavior,cannot meet the scalability requirements of BGP nodes.In this paper,we propose a blockchain-based trust model for inter-domain routing.Our model achieves scalability by allowing the master node of an AS alliance to transmit the trust evaluation data of its member nodes to the blockchain.The BGP nodes can expedite the trust evaluation process by accessing a global view of other BGP nodes through the master node of their respective alliance.We incorporate security service evaluation before direct evaluation and indirect recommendations to assess the security services that BGP nodes provide for themselves and prioritize to guarantee their security of routing service.We forward the trust evaluation for neighbor discovery and prioritize the nodes with high trust as neighbor nodes to reduce the malicious exchange routing behavior.We use simulation software to simulate a real BGP environments and employ a comparative experimental research approach to demonstrate the performance evaluation of our trust model.Compared with the classical trust model,our trust model not only saves more storage overhead,but also provides higher security,especially reducing the impact of collusion attacks.展开更多
基金supported by the National Natural Science Foundation of China(No.60929003)
文摘A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks.On the basis of traditional multi-path routing,the algorithm uses a random linear network coding strategy to code data pack-ets.Code number is determined by the next hop link status and the number of current received packets sent by the upstream node together.The algorithm improves retransmission and cache mechanisms through using redundancy caused by network coding.Meanwhile,the algorithm also adopts the flow distribution strategy based on time delay to balance network load.Simulation results show that the proposed routing algorithm can effectively improve packet delivery rate,reduce packet delay,and enhance network performance.
基金Supported by the National Natural Science Foun dation of China(90204008)
文摘An algorithm of traffic distribution called active multi-path routing(AMR)in active network is proposed.AMR adopts multi-path routing and applies nonlinear optimizeapproximate method to distribute network traffic among multiple paths.It is combined to bandwidthresource allocation and the congestion restraint mechanism to avoid congestion happening and worsen.So network performance can be improved greatly.The frame of AMR includes adaptive trafficallocation model,the conception of supply bandwidth and its'allocation model,the principle ofcongestion restraint and its'model,and the implement of AMR based on multi-agents system in activenetwork.Through simulations,AMR has distinct effects on network performance.The results show AMRisa valid traffic regulation algorithm.
基金supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2022R195),Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.
文摘A Mobile Ad hoc NETwork(MANET)is a self-configuring network that is not reliant on infrastructure.This paper introduces a new multipath routing method based on the Multi-Hop Routing(MHR)technique.MHR is the consecutive selection of suitable relay nodes to send information across nodes that are not within direct range of each other.Failing to ensure good MHR leads to several negative consequences,ultimately causing unsuccessful data transmission in a MANET.This research work consists of three portions.The first to attempt to propose an efficient MHR protocol is the design of Priority Based Dynamic Routing(PBDR)to adapt to the dynamic MANET environment by reducing Node Link Failures(NLF)in the network.This is achieved by dynamically considering a node’s mobility parameters like relative velocity and link duration,which enable the next-hop selection.This method works more efficiently than the traditional protocols.Then the second stage is the Improved Multi-Path Dynamic Routing(IMPDR).The enhancement is mainly focused on further improving the Quality of Service(QoS)in MANETs by introducing a QoS timer at every node to help in the QoS routing of MANETs.Since QoS is the most vital metric that assesses a protocol,its dynamic estimation has improved network performance considerably.This method uses distance,linkability,trust,and QoS as the four parameters for the next-hop selection.IMPDR is compared against traditional routing protocols.The Network Simulator-2(NS2)is used to conduct a simulation analysis of the protocols under consideration.The proposed tests are assessed for the Packet Delivery Ratio(PDR),Packet Loss Rate(PLR),End-to-End Delay(EED),and Network Throughput(NT).
基金supported by the National Basic Research Program of China(973 program)under Grant No.2014CB347800 and No.2012CB315803the National High-Tech R&D Program of China(863 program)under Grant No.2013AA013303+1 种基金the Natural Science Foundation of China under Grant No.61170291,No.61133006,and No.61161140454ZTE IndustryAcademia-Research Cooperation Funds
文摘Many ＂rich - connected＂ topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize the high network capacity by appropriate multi- path routing algorithms. As flow-level path splitting may lead to trafl＇ic imbalance between paths due to flow- size difference, packet-level path splitting attracts more attention lately, which spreads packets from flows into multiple available paths and significantly improves link utilizations. However, it may cause packet reordering, confusing the TCP congestion control algorithm and lowering the throughput of flows. In this paper, we design a novel packetlevel multi-path routing scheme called SOPA, which leverag- es OpenFlow to perform packet-level path splitting in a round- robin fashion, and hence significantly mitigates the packet reordering problem and improves the network throughput. Moreover, SOPA leverages the topological feature of data center networks to encode a very small number of switches along the path into the packet header, resulting in very light overhead. Compared with random packet spraying （RPS）, Hedera and equal-cost multi-path routing （ECMP）, our simulations demonstrate that SOPA achieves 29.87%, 50.41% and 77.74% higher network throughput respectively under permutation workload, and reduces average data transfer completion time by 53.65%, 343.31% and 348.25% respectively under production workload.
文摘Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path routing protocol based on the credible cluster heads. The protocol chooses nodes with more energy remained as cluster heads at the cluster head choosing phase, and then authenticates them by the neighbor cluster heads. Using trust mechanisms it creates the credit value, and based on the credit value the multi-path cluster head routing can finally be found. The credit value is created and exchanged among the cluster heads only. Theoretical analysis combined with simulation results demonstrate that this protocol can save the resource, prolong the lifetime, and ensure the security and performance of the network.
文摘The layer 2 network technology is extending beyond its traditional local area implementation and finding wider acceptance in provider’s metropolitan area networks and large-scale cloud data center networks. This is mainly due to its plug-and-play capability and native mobility support. Many efforts have been put to increase the bisection bandwidth in a layer 2 network, which has been constrained by the spanning tree protocol that a layer 2 network uses for preventing looping. The recent trend is to incorporate layer 3’s routing approach into a layer 2 network so that multiple paths can be used for forwarding traffic between any source-destination (S-D) node pair. ECMP (equal cost multipath) is one such example. However, ECMP may still be limited in generating multiple paths due to its shortest path (lowest cost) requirement. In this paper, we consider a non-shortest-path routing approach, called EPMP (Equal Preference Multi-Path) that can generate more paths than ECMP. The EPMP is based on the ordered semi-group algebra. In the EPMP routing, paths that differ in traditionally-defined costs, such as hops, bandwidth, etc., can be made equally preferred and thus become candidate paths. We found that, in comparison with ECMP, EPMP routing not only generates more paths, provides higher bisection bandwidth, but also allows bottleneck links in a hierarchical network to be identified when different traffic patterns are applied. EPMP is also versatile in that it can use various ways of path preference calculations to control the number and the length of paths, making it flexible (like policy-based routing) but also objective (like shortest path first routing) in calculating preferred paths.
基金Supported by the National High Technology Research and Development Programme of China(No.SS2013AA010503)the National Natural Science Foundation of China(No.61271281,61201151,61275158)the Fundamental Research Funds for the Central Universities(No.2482012PTB0004)
文摘Geography rectangle is used to reduce signaling overhead of the LEO satellite networks.Moreover,a multi-path routing algorithm based on an improved ant colony system(MPRA-AC) is proposed.Matrix indicating the importance of the link between satellites is introduced into MPRA-AC in order to find the optimal path more quickly.Simulation results show that MPRA-AC reduces the number of iterations to achieve a satisfactory solution.At the same time,the packet delivery ratio of LEO satellite networks when running MPRA-AC and DSR-LSN(dynamic source routing algorithm for LEO satellite networks) is compared.The packet delivery ratio is about 7.9%lower when running DSR-LSN.Moreover,because of the mechanism of active load balancing of MPRA-AC,simulation results show that MPRA-AC outperforms DSR-LSN in link utilization when data packets are transmitted in the networks.
基金National Nature Science Foundation of China (No. 60496311)Nature Science Foundation of Jiangsu Province (No. BK2004067&BK2005409)Foundation of Huawei Technology (No. YJCB2004018NP).
文摘The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this paper.The new routing protocol utilize an act of orientation of UWB and tries to get sufficient route information and decrease the network load caused by route discovery at the same time.Simulation results show that the routing load of the new protocol is lower and throughput is higher than that of DSR.While the node’s mobility increases,these advantages become more obvious.
基金supported by the Hi-Tech Research and Development Program of China (2008AA01A322)the National Natural Science Foundation of China (60772109)
文摘Traditional multi-path routing mechanisms aim to establish complete node or link disjoint paths. However, under some circumstances if multiple paths cannot be established based on the current network topology, the traditional multi-path routing mechanism will degenerate into single path routing mechanism, thus the advantages of multi-path routing cannot be exhibited. To enhance the end-to-end path reliability, an adaptive multi-path routing mechanism with path segment is proposed, in which multi-path can be established at part of the end-to-end path. In this way the reliability of the path can be enhanced. This path segment mechanism can divide the end-to-end path into several short segments, and a parallel forwarding mechanism is proposed for guaranteeing the quality of service of multimedia services over the wireless network. Simulations show that the network performance metrics such as the packet delivery ratio, the end-to-end delay and the number of route discoveries are all improved by using the adaptive multi-path routing mechanism.
基金supported by the Ministry of Industry and Information Technology of China (2011ZX03001-007-03)the Nature Science Foundation of Beijing (4102044)the National Science Foundation for Young Scientists of China (61001115)
文摘Quality of service （QoS） routing algorithms have been hardly discussed in the scientific community, most previous work on QoS routing concentrates on the performance of the single route. Cognitive packet network （CPN） has been designed for providing QoS routing. In this paper, to balance the loads among networks, we present a multi-path routing algorithm based on load-balance （MPRLB）, which is carried out in two steps. The algorithm with low computational complexity is firstly applied to establish multi path routing for each source and destination node pairs （SD-pair） nodes in the network. Then, we propose the hopfield neural network algorithm, which is applied to improve the efficiency of the flow deviation method for fast flow allocation among the links of the network based on load balance. Extensive simulation results demonstrate that the proposed scheme significantly improves the performance compared with the existing scheme that ignores load balancing.
文摘This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shape, algorithm QSRA shapes disjoint-alternate-path structure, but is not limited to. It also contains another structure that every primary node has several links to alternate paths. This structure has two advantages, the first one is that primary nodes can select one alternate path immediately when primary routing is failure without going back to source node to re-discover a new routing or choose an alternate path; the second is that it guarantees primary nodes can select another alternate path as quickly as possible once one of alternate paths fails. Strongpoint of algorithm QSRA is reducing frequency of routing re-discovering. Besides, the structure occupies fewer resources than other routing algorithms due to its distributed structure. Simulation shows that QSRA has higher packets received ratio and lower control packet overhead and lower end-to-end delay.
基金the National Basic Research Development Program of China (Grant No. 2003CB314805)the National Nature Science Foundation of China (Grant No. 60603022)
文摘As an important secure routing mechanism, multi-path routing is one of the major ways to improve network efficiency and to guarantee the network security, which ensures the reliability of data transmission by using backup paths when the primary one is unavailable due to local node or link failures. Most current studies on multi-path routing mechanism are based on experiments or simulations. The resulta are usually specific application scenarios oriented heuristic algorithms, lacking universal significance. In this paper, a theoretic analysis is performed on the relationship between the multi-path routing policy, the network efficiency and its survivability. Starting with point-to-point communication network, an impactoriented analysis is made on the network interference under multi-path routing mechanism. Based on the analysis, the upper-limit of network performance under interference impact is also discussed.
文摘Wirreless sensor networks are being widely researched and are expected to be used in several scenarios. On the leading edge of treads, on-demand, high-reliability, and low-latency routing protocol is desirable for indoor environment applications. This article proposes a routing scheme called robust multi-path routing that establishes and uses multiple node-disjoint routes. Providing multiple routes helps to reduce the route recovery process and control the message overhead. The performance comparison of this protocol with dynamic source routing （DSR） by OPNET simulations shows that this protocol is able to achieve a remarkable improvement in the packet delivery ratio and average end-to-end delay.
基金National Key Research and Development Program(2021YFB2900604)。
文摘Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.
基金supported in part by the National Natural Science Foundation of China under Grant U23A20300 and 62072351in part by the Key Research Project of Shaanxi Natural Science Foundation under Grant 2023-JC-ZD-35+1 种基金in part by the Concept Verification Funding of Hangzhou Institute of Technology of Xidian University under Grant GNYZ2024XX007in part by the 111 Project under Grant B16037.
文摘Cross-domain routing in Integrated Heterogeneous Networks(Inte-HetNet)should ensure efficient and secure data transmission across different network domains by satisfying diverse routing requirements.However,current solutions face numerous challenges in continuously ensuring trustworthy routing,fulfilling diverse requirements,achieving reasonable resource allocation,and safeguarding against malicious behaviors of network operators.We propose CrowdRouting,a novel cross-domain routing scheme based on crowdsourcing,dedicated to establishing sustained trust in cross-domain routing,comprehensively considering and fulfilling various customized routing requirements,while ensuring reasonable resource allocation and effectively curbing malicious behavior of network operators.Concretely,CrowdRouting employs blockchain technology to verify the trustworthiness of border routers in different network domains,thereby establishing sustainable and trustworthy crossdomain routing based on sustained trust in these routers.In addition,CrowdRouting ingeniously integrates a crowdsourcing mechanism into the auction for routing,achieving fair and impartial allocation of routing rights by flexibly embedding various customized routing requirements into each auction phase.Moreover,CrowdRouting leverages incentive mechanisms and routing settlement to encourage network domains to actively participate in cross-domain routing,thereby promoting optimal resource allocation and efficient utilization.Furthermore,CrowdRouting introduces a supervisory agency(e.g.,undercover agent)to effectively suppress the malicious behavior of network operators through the game and interaction between the agent and the network operators.Through comprehensive experimental evaluations and comparisons with existing works,we demonstrate that CrowdRouting excels in providing trustworthy and fine-grained customized routing services,stimulating active participation in cross-domain routing,inhibiting malicious operator behavior,and maintaining reasonable resource allocation,all of which outperform baseline schemes.
文摘This paper systematically reviews the latest research developments in Vehicle Routing Problems(VRP).It examines classical VRP models and their classifications across different dimensions,including load capacity,operational characteristics,optimization objectives,vehicle types,and time constraints.Based on literature retrieval results from the Web of Science database,the paper analyzes the current state and trends in VRP research,providing detailed explanations of VRP models and algorithms applied to various scenarios in recent years.Additionally,the article discusses limitations in existing research and provides perspectives on future development trends in VRP research.This review offers researchers in the VRP field a comprehensive overview while identifying future research directions.
文摘This paper proposes an efficient strategy for resource utilization in Elastic Optical Networks (EONs) to minimize spectrum fragmentation and reduce connection blocking probability during Routing and Spectrum Allocation (RSA). The proposed method, Dynamic Threshold-Based Routing and Spectrum Allocation with Fragmentation Awareness (DT-RSAF), integrates rerouting and spectrum defragmentation as needed. By leveraging Yen’s shortest path algorithm, DT-RSAF enhances resource utilization while ensuring improved service continuity. A dynamic threshold mechanism enables the algorithm to adapt to varying network conditions, while its fragmentation awareness effectively mitigates spectrum fragmentation. Simulation results on NSFNET and COST 239 topologies demonstrate that DT-RSAF significantly outperforms methods such as K-Shortest Path Routing and Spectrum Allocation (KSP-RSA), Load Balanced and Fragmentation-Aware (LBFA), and the Invasive Weed Optimization-based RSA (IWO-RSA). Under heavy traffic, DT-RSAF reduces the blocking probability by up to 15% and achieves lower Bandwidth Fragmentation Ratios (BFR), ranging from 74% to 75%, compared to 77% - 80% for KSP-RSA, 75% - 77% for LBFA, and approximately 76% for IWO-RSA. DT-RSAF also demonstrated reasonable computation times compared to KSP-RSA, LBFA, and IWO-RSA. On a small-sized network, its computation time was 8710 times faster than that of Integer Linear Programming (ILP) on the same network topology. Additionally, it achieved a similar execution time to LBFA and outperformed IWO-RSA in terms of efficiency. These results highlight DT-RSAF’s capability to maintain large contiguous frequency blocks, making it highly effective for accommodating high-bandwidth requests in EONs while maintaining reasonable execution times.
文摘The integration of the dynamic adaptive routing(DAR)algorithm in unmanned aerial vehicle(UAV)networks offers a significant advancement in addressing the challenges posed by next-generation communication systems like 6G.DAR’s innovative framework incorporates real-time path adjustments,energy-aware routing,and predictive models,optimizing reliability,latency,and energy efficiency in UAV operations.This study demonstrated DAR’s superior performance in dynamic,large-scale environments,proving its adaptability and scalability for real-time applications.As 6G networks evolve,challenges such as bandwidth demands,global spectrum management,security vulnerabilities,and financial feasibility become prominent.DAR aligns with these demands by offering robust solutions that enhance data transmission while ensuring network reliability.However,obstacles like global route optimization and signal interference in urban areas necessitate further refinement.Future directions should explore hybrid approaches,the integration of machine learning,and comprehensive real-world testing to maximize DAR’s capabilities.The findings underscore DAR’s pivotal role in enabling efficient and sustainable UAV communication systems,contributing to the broader landscape of wireless technology and laying a foundation for the seamless transition to 6G networks.
文摘As commercial drone delivery becomes increasingly popular,the extension of the vehicle routing problem with drones(VRPD)is emerging as an optimization problem of inter-ests.This paper studies a variant of VRPD in multi-trip and multi-drop(VRP-mmD).The problem aims at making schedules for the trucks and drones such that the total travel time is minimized.This paper formulate the problem with a mixed integer program-ming model and propose a two-phase algorithm,i.e.,a parallel route construction heuristic(PRCH)for the first phase and an adaptive neighbor searching heuristic(ANSH)for the second phase.The PRCH generates an initial solution by con-currently assigning as many nodes as possible to the truck–drone pair to progressively reduce the waiting time at the rendezvous node in the first phase.Then the ANSH improves the initial solution by adaptively exploring the neighborhoods in the second phase.Numerical tests on some benchmark data are conducted to verify the performance of the algorithm.The results show that the proposed algorithm can found better solu-tions than some state-of-the-art methods for all instances.More-over,an extensive analysis highlights the stability of the pro-posed algorithm.
基金funded by the National Natural Science Foundation of China,grant numbers(62272007,62001007)the Natural Science Foundation of Beijing,grant numbers(4234083,4212018)The authors also extend their appreciation to King Khalid University for funding this work through the Large Group Project under grant number RGP.2/373/45.
文摘Border Gateway Protocol(BGP),as the standard inter-domain routing protocol,is a distance-vector dynamic routing protocol used for exchanging routing information between distributed Autonomous Systems(AS).BGP nodes,communicating in a distributed dynamic environment,face several security challenges,with trust being one of the most important issues in inter-domain routing.Existing research,which performs trust evaluation when exchanging routing information to suppress malicious routing behavior,cannot meet the scalability requirements of BGP nodes.In this paper,we propose a blockchain-based trust model for inter-domain routing.Our model achieves scalability by allowing the master node of an AS alliance to transmit the trust evaluation data of its member nodes to the blockchain.The BGP nodes can expedite the trust evaluation process by accessing a global view of other BGP nodes through the master node of their respective alliance.We incorporate security service evaluation before direct evaluation and indirect recommendations to assess the security services that BGP nodes provide for themselves and prioritize to guarantee their security of routing service.We forward the trust evaluation for neighbor discovery and prioritize the nodes with high trust as neighbor nodes to reduce the malicious exchange routing behavior.We use simulation software to simulate a real BGP environments and employ a comparative experimental research approach to demonstrate the performance evaluation of our trust model.Compared with the classical trust model,our trust model not only saves more storage overhead,but also provides higher security,especially reducing the impact of collusion attacks.
