131 results about "Multi path routing" patented technology

PCIe is a point-to-point protocol. A PCIe switch fabric has multi-path routing supported by adding an ID routing prefix to a packet entering the switch fabric. The routing is converted within the switch fabric from address routing to ID routing, where the ID is within a Global Space of the switch fabric. Rules are provided to select optimum routes for packets within the switch fabric, including rules for ordered traffic, unordered traffic, and for utilizing congestion feedback. In one implementation a destination lookup table is used to define the ID routing prefix for an incoming packet. The ID routing prefix may be removed at a destination host port of the switch fabric.

A method of providing unordered packet routing in a multi-path PCIe switch fabric is provided. Fabric egress port congestion is measured and distributed to all ports within a switch and to neighboring switches. An unordered route choice vector is generated by table lookup. The local congestion mask vector identifies which of these choices has local congestion. A next hop masked choice vector generated by table lookup is gated with the next hop congestion mask vectors, received from neighboring switches, to identify the choices that have next hop congestion. Congested choices are excluded by masking. If multiple choices remain at the conclusion of the masking process, then a selection is made by round-robin among the surviving choices. If no choices remain, the selection is made by round robin among the original choices. The final selection is mapped to an egress port on the switch by table lookup.

Multi-path routing techniques using intra-flow splitting are disclosed. For example, a technique for processing traffic flows at a node in a network comprises the following steps/operations. At least one traffic flow is obtained. The at least one traffic flow comprises multiple packets or bytes. The at least one flow is split into at least two sub-flows, wherein each of the at least two sub-flows comprises a portion of the multiple packets or bytes. The packets or bytes of the at least two sub-flows are respectively routed on at least two paths in the network.

A multi-path routing method is provided a multi-path routing method for selecting appropriate multiple paths when information sensed from a source node is transmitted to a sink node in wireless sensor networks. The source node for transmitting the sensed information first transmits a Hello message to the sink node to identify the existence and position of the sink node. The sink node receives the Hello message and then re-transmits the Hello message with respect to all the received Hello messages. Respective middle nodes accumulate distances between the middle nodes while the Hello message is transmitted to the source node through a reverse path of the Hello message, and all the middle nodes maintain a real distance from the sink node. The source node receiving all the Hello messages can rout a plurality of appropriate paths through Hop-by-hop to the sink node by providing respective weights to an energy remaining amount, an appropriate transmission radius and a real distance from the sink node. Accordingly, priorities can be provided to lifetime of the source node, average energy consumption and the shortest path by adjusting the respective weights when routing the plurality of paths. In addition, appropriate paths can be routed considering the transmission success rate of a path, and a load balancing effect can be obtained using path cost.

A multi-route routing method based on network coding in wireless network includes the following steps: 1) routing discovering from originating nodes to object nodes; 2) after the routing discovering stage is finished, comparing route conversion incomes of each route, and originating nodes selecting the optimum W routes therein for data transmission. Compared with the prior technology, the invention proposes a multi-route routing method based on network coding in wireless network, dynamically transmits data packets on multiple routes according to reliability and coding opportunity of routes, dynamically creates rather than only waiting for coding opportunity through conversion transmission path, and multiple routes share network flow quantity loads, and maximize the route conversion, accordingly improving network output.

The invention discloses a data packet sending method and device, and a network architecture. The method is applied to a data network switch in the network architecture. The method comprises the following steps of receiving a first packaging packet of a target data packet sent by a first computing node, an open shortest path priority routing protocol and an equivalent multi-path routing protocol which are configured in the data network switch, and an open shortest path priority routing protocol configured in the network node, and determining a first network node from the network node; sending the first network node to the first packaging packet, so that the first network node sends the target data packet to the destination host. By adopting the provided scheme, the data flow forwarded by the same group of virtual routers serving virtual machines on the same network segment can realize the distributed flow forwarding in all the virtual routers in the group, so that the performance bottleneck problem of a single virtual router in the prior art during the data packet forwarding is solved.

The invention discloses a double-bounce multi-path route method of a wireless sensor network based on the energy collection technology. The wireless sensor network comprises a base station and a plurality of nodes, wherein each node comprises a wireless sensor and an energy collection device for supplementing energy for the wireless sensor. The wireless sensor network is characterized by adopting the following forwarding standard: 1. forwarding by a node nearest to a target node; 2. forwarding by a node with the shortest distance with the target node; and 3. according to distance between nodes, residual energy, energy supplementing rate and consumption rate, forwarding by a node with the optimal effect. The invention has the beneficial effect that a node sleeping scheduling mechanism is led in, and energy is collected from the environment so as to prolong network service life. According to different requirements and environments, the greedy forwarding mechanisms which are based on distance between nodes, shortest path and node energy levels and utilize double-bounce neighborhood node information are designed, and the reliability and the instantaneity of data transmission are given consideration to avoid a routing void.

The invention discloses a method for route-identifying in a wireless mesh network, including: It set up different routing strategies for different types of business, and the source nodes receive multi-path routing response with routing information, then the source determines the related routing according to the strategy of the business and the routing information. The invention can ensure data transmission between the source node and the destination node, and greatly improves the network performance.

The invention relates to a greedy multi-path routing method of a wireless multimedia sensor network based on QoS (Quality of Service), which comprises the steps of: (1) adjusting the status of a network node per se by a sleep dispatching method of duty ratio by the network node; and (2) discovering a plurality of node-disjoint shortest paths from a source node to a base station by means of a greedy strategy. The greedy strategy is that the current node selects a node nearest to the base station from one and two hops of neighbor nodes as a forwarding node. The plurality of node-disjoint shortest paths from the source node to the base station are established by utilizing one and two hops of neighbor node information in the invention, immediate and reliable transmission of the multimedia information is ensured and data transmission failure caused by routing empty and individual path failure is avoided. Connectivity of the whole network is controlled by the sleep dispatching mechanism of the duty ratio simultaneously, so that energy of the node for transmitting data is ensured, unnecessary energy consumption of idle monitoring is reduced, therefore, the node utilization is maximized, the utilization ratio of the network resources is improved and the service life of the network is prolonged.

The invention discloses a multi-channel multi-path routing protocol for vehicle team ad-hoc networks. The multi-channel multi-path routing protocol mainly comprises: (1) each vehicle node is made to work on a service channel, the vehicle nodes using the same service channel form a channel transmission path in a vehicle team, and multiple transmission paths of multiple channels are formed in the vehicle team; (2) each vehicle node acquires position, speed and motion direction information of other vehicle nodes through an adaptive distributed position service; and (3) a multi-channel greedy forwarding algorithm is adopted: when the vehicle nodes send or forward a data message, a next-hop neighbor node is selected by use of the greedy forwarding algorithm according to the position of a destination node and the working channel utilization rate of a neighbor node until the data message reaches the destination node. By adopting the provided multi-channel multi-path routing protocol for vehicle team ad-hoc networks, vehicle team communication is enabled to be fully self-organized without relying on any infrastructure, adjacent vehicle nodes are allowed to communicate on different channel transmission paths at the same moment, the network throughput is improved, and the routing protocol supports multi-hop big data transmission and has practical application prospects.

The invention discloses multi-service and multi-path routing optimization method in a named data network. The multi-service and multi-path routing optimization method comprises the following steps: dividing services in an NDN network into time delay sensitive services and bandwidth sensitive services; marking a corresponding differentiated service code point value in a service type field of an interest packet by use of an edge node; carrying out routing selection and forwarding on the interest packet; and after a content issuer receives the interest packet, generating a corresponding data packet, and updating the pheromone concentration of a core node according a timer field, a bottleneck bandwidth recorder field and the service type field in the data packet. The multi-service and multi-path routing optimization method disclosed by the invention can be used for classifying multiple services in a network and optimizing and selecting routing of different service types according to the measurement requirements thereof by means of ant colony optimization, so as to better support QoS of the NDN network and achieve differentiated services.

The invention provides a self-adapting multi-path routing agreement based on path segmenting that is used for transmitting data package of wireless self-organize network efficiently. The agreement includes steps as follows: A) judging a link state by a note according with decided strategy; B) self-adapting selecting a delay node according with network topology state; C) establishing multi-path routing of path segmenting. The agreement can ensure successful probability for transmitting Ad Hoc network data package efficiently and increase network reliability.

The invention relates to a wireless sensor network multi-path routing method based on network coding, and belongs to the field of wireless sensor network communication. The wireless sensor network multi-path routing method based on the network coding is characterized in that paths between any source node to a destination node are ranked according to the size of path advantages from large to small according to path advantage values based on coding priority nodes, priority selection paths are provided, and I (I>=K) coding data packages formed by K original data packages and sent by source nodes are transmitted in the mode of one-to-one correspondence with the priority selection paths. Firstly, in the data transmitting process of data coded by the source nodes, one coding advantage node is a multi-path interesting point, random coding is carried out on input coded data again, coded numbers indicating the nodes to be receiving nodes in a routing list are taken out, coding coefficients in the second-time coded data marked with the other intermediate nodes or destination node addresses of a lower layer are then decoded and output downstream, and the rest nodes are done in the same way until the destination node is output. The wireless sensor network multi-path routing method based on the network coding combines the network coding and multi-path selection and is good in effect.

The invention relates to a fault-tolerant routing recovery method of a heterogeneous wireless sensor network. The method comprises the following steps: when a path in a cluster of the heterogeneous wireless sensor network is broken due to node failure, establishing a multi-path routing generation graph in the cluster and performing path coding; selecting an optimal substitutive path by a multi-particle swarm immune cooperative optimization algorithm and performing routing recovery; and maintaining the network system by an algorithm-based protocol. The multi-particle swarm immune cooperative optimization algorithm has the characteristics of relatively strong global search capability, relatively high solving precision, fast convergence and the like. The invention improves the fault tolerance of the heterogeneous wireless sensor network, improves the success rate of data transmission by quickly establishing the optimal substitutive path and prolongs the survival time of the network.

The invention relates to a multi-sink deployment and fault tolerance method for a wireless sensor network. A multi-sink optimal deployment method based on improved particle swarm optimization clustering is firstly brought forward, the improved particle swarm optimization is combined with K-means clustering, clustering and partitioning are carried out on all sensor nodes in a network area, the multiple sink nodes are deployed in the center of each cluster respectively, and thus, effects of reasonable partitioning and optimal multi-sink node deployment of the network are achieved. In addition, in view of a condition in which a certain sink node fails in the multi-sink network, a routing algorithm with a fault tolerance mechanism is brought forward, a fault tolerance mechanism with multi-path routing is adopted, two paths from a source node to different sink nodes are built, and when a certain sink node fails, alternate routing is activated. Through deploying multiple sink nodes in the wireless sensor network, the network reliability can be improved, when one sink node fails, other several sink nodes can replace the node for work, reliable operation of the network is ensured, and the service life of the network is prolonged.

The invention discloses a method for realizing congestion control of Ad Hoc networks based on a multi-path routing protocol, which can mainly solve the problem that the prior art is lack of congestion control mechanisms, and the sharply-decreased network throughput and high node packet loss caused by congestion is further produced. The implementation scheme of the method comprises the following steps: 1, obtaining the periodic statistical data of each node in the network, and judging whether the node is congested; 2, analyzing whether the congestion reason of the congested node is caused by using the low-speed links or caused by excessive total flow of the congested node; 3, relieving the congestion of the congested node that is caused by using the low-speed links through the means of suppressing the low-speed links; and 4, relieving the congestion of the congested node that is caused by excessive total flow of the congested node through the means of flow scheduling or random packet loss. Compared with a traditional congestion control method, the method disclosed by the invention ensures that the targeted relief measures can be taken according to different congestion reasons, the network throughput can be further increased, and the method can be applied to the Ad Hoc networks.

The invention discloses a multi-path routing judgment method for an industrial wireless mesh network. Three judging criteria are mainly taken into consideration: 1, constraint conditions required to be met during end-to-end transmission, based on control data which has requirements on timeliness and reliability of wireless Mesh network transmission; 2, a judging mechanism for judging the proper number of concurrent transmission paths between a source node and a target node under a given condition of wireless Mesh network topological structure; and 3, an evaluating criterion for evaluating the path attributes of an equivalent path on a logic formed by multiple concurrent paths between the source node and the target node. By the multi-path routing judgment method for the industrial wireless mesh network, a specific routing judgment method is provided for implementing a multipath concurrent routing mechanism in the wireless Mesh network, so that the timeliness and the reliability of the wireless Mesh network transmission can be improved easily.

The invention provides a method and a system of multi-path routing of a vehicular ad hoc network. The method comprises the following steps that: a source node initiates a route discovery process to a destination node through transmitting a routing request, and the request comprises a moving direction of the source node; a first-jump intermediate node, which receives the routing request, writes the own moving direction into the routing request, and the routing request is continued to transmit; if a non-first-jump intermediate node, which receives the routing request, judges that the own moving direction is the same as the moving direction of the first-jump intermediate node, the own node is taken as an experience node from the source node to the destination node, and the routing request is continued to transmit; if the destination node, which receives the routing request, judges that the moving direction of the first-jump intermediate node is the same as the moving direction of the source node or the moving direction of the first-jump intermediate node is the same as the moving direction of the destination node, a path from the source node to the destination node is taken as a discovered route, and is cooperative with the intermediate node on a discovering route to inform the discovered route to a source vehicle node. According to the method and the system, the stability of a communication link between vehicle nodes is guaranteed.