160 results about "Multipath routing" patented technology

Methods and apparatus that enable more than one server to host a resource using a shared IP address such that a client may generally access the resource on any of the servers using the shared IP address are disclosed. According to one aspect of the present invention, a method for providing paths that allow a client to access a resource in a TCP / IP network includes obtaining an IP address, as well as associating the IP address to first and second servers. The first and second servers support the resource at the IP address, and a first path of the plurality of paths that allow the client to access the resource is between the client and the first server and a second path of the plurality of paths that allow the client to access the resource is between the client and the second server.

The invention provides unique architectures and techniques for routing redundancy in a data switch configured to use label switching. Multiple label switch controllers (LSCs) each operate concurrently but independently of each other to provide routes through a data switching mechanism. Preferred embodiments provide a plurality of LSCs offering MPLS capabilities coupled to a single switch, such as an ATM switch. The similarly configured LSCs each can concurrently support a route for data (e.g., labeled ATM cells) within the data switching mechanism in parallel, thereby providing the ability to support redundant and multiple parallel data networks. The configuration is called a label switch router (LSR). A fully-meshed embodiment allows selected routes to share bandwidth on ports, while a fully parallel embodiment provides separate ports for selected routes. Since each LSC provides parallel routes with the other LSCs in an LSR, a communications between an LSR and a label edge router (LER) can use multipath routing to concurrently distribute data equally across the parallel routes for each destination. Alternatively, unipath routing techniques can select one route for use for each destination from the available routes concurrently offered by each LSC. In the event of a failure of one of the LSCs, multipath routing implementations can exclude transmission of data onto the failed network, while continuing to use the other parallel networks supported by non-failed LSCs in a concurrent manner. Alternatively, if a failure occurs with unipath routing, a new route offered by another LSC can be selected for data transfers. In either case, the LSC that fails does not need to provide state or connection information to the LSCs that operate subsequently to the failure, since they are already configured in parallel to support the same route. Upon an LSC failure, switch resources such as bandwidth that were used by the failed LSC are made available to the remaining non-failed LSCs. The design allows failures are handled gracefully without diminished network capacity or data loss resulting in a highly reliable routing capability provided within connection-based or circuit-switched networks.

Each node or terminal in a communication network is capable of generating routing information for routing packets from an arbitrary source terminal to an arbitrary destination terminal on both a single-path route and a multipath route. The routing information is placed in packets transmitted to neighboring communication terminals, and analyzed in packets received from neighboring terminals. The single-path route is spatially or temporally separated from the multipath route so that the single-path route does not receive interference from the multipath route. Temporal separation may be effected by suspending the transmission of packets temporarily at each communication terminal on the multipath route. Spatial separation may be effected by using the routing information to designate different zones in the network, the single-path route being disposed in one zone, the multipath route in another zone.

A multipath routing architecture for large data transfers is disclosed. The architecture employs an overlay network that provides diverse paths for packets from communicating end hosts to utilize as much capacity as available across multiple paths while ensuring network-wide fair allocation of resources across competing data transfers. A set of transit nodes are interposed between the end-hosts and for each end-to-end connection, a transit node can logically operate as an entry gateway, a relay or exit gateway. Packets from the sender enter the entry node and go to the exit node either directly or through one of a plurality of relay nodes. The exit node delivers the packets to the receiver. A multipath congestion control protocol is executed on the entry node to harness network capacity for large data transfers.

A method and system for directing data packets from an origin node to a destination node in a multipath communication network having a plurality of nodes, where each node is connected to at least one other node by links. The apparatus includes a processor for obtaining cost information relating to each link in the network and for determining the least-cost route between the origin node and the destination node based on the cost information relating to each link. The processor establishes a cost margin representing a range of costs above the cost of the least cost route and identifies one or more alternate routes. A data storage device stores the cost information, and a network interface selectively routes the data packets through one or more of the least cost route and the one or more alternate routes falling within the established cost margin thus balancing the network load and providing alternate data paths in case the least-cost path is unavailable.

Multiple paths in a communication network are provided between at least one source node and at least one destination node. The network arrangement may thus support either unicast transmission of data or multicast transmission. Measurements are made at nodes of the network to determine a partial network cost for data traversing the links in the multiple paths. An optimization procedure determines a distribution of the network traffic over the links between the at least one source node and the at least one destination node that incurs the minimum network cost.

A multipath processing architecture that allows multipath packets to be distributed across multiple paths using a hash function and a modulo-arithmetic-based mapping function is disclosed. In one embodiment, the multipath processing architecture is implemented as part of a packet classification engine of a network node.

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.

The invention relates to a multipath routing establishing method based on chain circuit multi-eigenvalue in a wireless sensor network. The method includes: upon transmitting 'interest' data packets from a destination node to an originating node, endowing a definite selection probability to each route according to three eigenvalues (energy consumption, time-delay and band-width) in network chain, thereby establishing a gradient table; upon transmitting detecting data packets from the originating node to the destination nods, selecting a neighbor node with highest probability every time as the node of next-hop, if the neighbor node with highest probability reject to receive data packets, selecting a neighbor node with next high probability as the node of next-hop, until reaching the destination node; finally the destination node transmitting strengthened signals with different grades to the originating node, thereby establishing multipath from the originating node onto the destination node, so that the data can always been transmitted in multipath with better chain circuit performance. The invention extends survival cycle of network, improves transmission reliability and realizes load proportion.

A method is described for routing network traffic based on distance information to provide multiple paths that need not have equal costs. The routing algorithm MPATH of the present method provide loop-free routing at every instant, without the need of internodal synchronization which spans more than a single hop. Paths are computed using shortest distances and predecessor information in the routing computation. The use of multiple-successors allows for load-balancing within the network. The algorithm is both distributed and scalable to large networks due to its use of only one-hop synchronization. A number of procedures are described by way of example, including path computation, main table updating, neighbor table updating, and a multipath (MPATH) algorithm.

The present invention provides a low overhead multipath routing method of mobile ad hoc network. m non-intersected main paths are established from a source node SN to a destination node DN. Each main path has an equal length and equally comprises n middle nodes MN and n links. Except for the first hop node and the last hop node, each intermediate node on the main path can reach the destination node through the next hop node on k (1<=k<=m) different main paths. When the data is started to be transmitted, the source node SN selects a main path for data transmission. Each hop node is selected with a dynamic congestion control method, and finally the data message is transmitted to the destination node. The low overhead multipath routing method of the invention can be applied to the dynamic topology multi-hop network to establish a multi-path structure of network data transmission and has the advantages of increasing the path stability, reducing the frequency of routing halt between communication node, reducing the routing overhead of data message and increasing the transmission success rate of data message.

Hash-code value ranges are determined for a traffic distribution among the nodes along a multipath route in a packet-oriented network, according to a predefined traffic distribution in the network. Starting from one or more start nodes, the traffic distribution is determined successively as a function of the hash-codes along the multipath route for each node, including branches, and an allocation of value ranges for the hash-codes to the outbound links is defined. The advantage is that it enables a desired distribution of traffic along any number of multipath routes by distribution on the basis of hash-codes.

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.

The invention discloses an AdHoc network multipath routing method oriented to link stability, which is used for solving the technical problem that the QoS (Quality of Service) support ability of the existing AdHoc network concurrent multipath routing method based on load balancing is poor when the topological structure of a large-scale AdHoc network is changed fast. The technical scheme is that firstly a network topological graph is established, then multipath routing is established, and then stable link judgment based on moving projection is conducted, and finally route maintenance is conducted. Since the method combining multipath routing and moving projection is adopted, the network resource is fully utilized; main and backup paths are established among all the nodes, the link stability is ensured by using the moving projection pre-judging method, the route interrupt times is reduced, and the QoS (Quality of Service) support ability is improved when the topological structure of the large-scale AdHoc network is changed fast. The method has strong adaptability on the topological change of the network, has the characteristics of small end-to-end time delay and low packet loss probability, and provides good support for voice and video communication.

The invention provides a method and device for processing an equivalent multipath list as well as network equipment. The method comprises the following steps of: determining whether a next hop is removed from the next hops which correspond to an ECMP (Equal-Cost Multipath Routing) list, wherein the total number of list items included in the ECMP list is greater than the total number of the next hops which correspond to the ECMP list, and each list item in the ECMP list is filled with an index of each of the next hops which correspond to the ECMP list; and updating the list item filled with the index of the removed next hop in the ECMP list by utilizing the index of the un-removed next hop in the next hops which correspond to the ECMP list according to a predetermined filling strategy. By adopting the technical scheme provided by the invention, the problem of change of a TCP (Transmission Control Protocol) transmission path due to link failure can be solved, and reliability of a CDN (Content Distribution Network) is improved.

An inter-domain multipath routing method, for extending multipath routing beyond the limits of packet-oriented networks or autonomous systems is provided. A traffic distribution over several links, outgoing from a packet-oriented network with multipath routing, is carried out. For the determination of alternative paths, leading to neighboring networks, the edge nodes of neighboring networks, by means of which a target can be reached, can be combined as a virtual end point. The virtual edge nodes then permit alternative paths between a starting point and the virtual end point to be determined by means of conventional methods, for example, multipath MPLS. Packets are then distributed over the paths, whereby a distribution beyond the network limit is also induced.

The invention provides a method for realizing rapid path switching and an apparatus thereof. Next hop information and next hop state, which are main / standby paths for each other, are maintained through forming a virtual next hop (VN) table which aims at destination. Prefix information corresponding to the destination in a forwarding information base (FIB) is pointed to the VN table so that when there are changes in the next hop information, the prefix information in the FIB does not need to be modified point by point because there is no change in the point of the prefix information. The next hop information in the updated VN table only needs to be sent to a drive so that the drive can update the next hop information which is written-in hardware. Even if there are a plurality of equal-cost multipath routings (ECMP), the VN table only needs to be updated once and then sends the information so as to realize switching of a plurality of paths. The prefix information in the FIB does not need to be modified point by point. Therefore, speed of switching paths is substantially raised and interruption time in traffic can be reduced.

The invention relates to a multipath routing reliable transmission method based on network coding. The method comprises the steps as follows: a converged node periodically broadcasts routing update information, and each node acquires hop counts from self to the converged node and a neighbor table which contains all neighbor nodes and residual energy thereof; a source node calculates the needed path number; the source node encodes data packets needing to be transmitted, selects the next hop of node and sends the data; after the next hop of node receives the encoded packets, the data packets with the same group of marks are encoded, and the needed path number is recalculated; and the process above is repeated until the last node arrives at the converged node, and then the original data packet is decoded by the converged node. By adopting the method provided by the invention, reliable transmission of the network and the balance of the energy of the network can be guaranteed.

The invention discloses a multipath routing method in delay-tolerant networks (DTN). Current single path routing protocol link resource utilization is low. The method of the invention can solve the above problem. The method comprises the following steps: (1) according to a motion trail of a star in an ephemeris, constructing an original communication sequence chart of a link in a link communication period T of a deep space communication network; (2) according to a communication time segment of the link in the communication sequence chart, finding out all available paths from a star source terminal to a destination; (3) respectively calculating throughput of the all available paths in the period T and an effective transmission time quantum of the link; (4) selecting the path possessing the largest throughput; (5) correcting the communication sequence of every hop link of the selected path so as to obtain the corrective link communication sequence chart; (6) repeating from a step (2) to the step (5) till there is no available path in the link communication sequence chart. By using the method of the invention, the network throughput and a link utilization rate can be substantially raised; unfavorable influence of link discontinuity communication on data transmission can be reduced. The method can be used in the deep space communication network.

The invention discloses a multipath routing method in an Ad Hoc network environment, which provides a new multipath routing method for assuring QoS based on the existing method of ensuring end-to-end time delay by adding the accumulated time delay parameter for path selection in the Ad Hoc network. The routing method comprises the following two parts: 1. screening paths by using the accumulated time delay as the access control parameter for path selection; and 2. introducing a parameter taking node states into account, i.e. node time delay (Ndelay), and further selecting from the paths selected according to the accumulated time delay by using the node time delay (Ndelay) as another criterion for judging the quality of the path. Thus, the method overcomes the defect that the multiple paths selected according to the accumulated time delay can not be compared in the quality aspect, thereby ensuring the QoS performance of the Ad Hoc network.

The invention relates to a multipath routing method based on wireless multi-media sensor network, which aims to the technical scheme of multimedia data stream transmission in the wireless multimedia sensor network. The multipath routing method is mainly used for solving the problem about the real-time transmission of the multimedia steam and prolonging the service life of the network as long as possible. The multipath routing method is characterized in that data from a source node to a target node in the wireless multi-media sensor network are transmitted by adopting a multipath transmission mode, and moreover higher service quality is provided for users by adopting a partitioning service mode.

The invention discloses a dynamic multipath routing algorithm based on mobility prediction, being applied to a high-speed mobile wireless Mesh network. The algorithm comprises the following steps: firstly predicting the route lifetime by utilizing the mobile information of nodes and introducing the ideal of route lifetime into the route discovery process of the DSR protocol; routing multiple paths from the source node to the destination node by utilizing the comprehensive evaluation value generated by non-relevance between the route lifetime and multipath routes and improving the route maintenance, selection and cache mechanism by utilizing the route lifetime. The invention can search for relatively stable routes for the nodes in the high-speed mobile wireless Mesh network, and the searched multiple paths have higher non-relevance, thus reducing the frequency of route discovery, effectively lowering the routing overhead, improving the performances of the original DSR protocols and ensuring the algorithm to be adaptive to the high-speed mobile network environment.

The invention relates to an LEO satellite network optimum profit routing method based on a cooperative game. The method comprises the steps of establishing a grid-shaped LEO satellite communication system of an iridium satellite similar constellation; regarding a plurality of LEO satellite relay nodes on a routing path from a source satellite node to a destination satellite node as a cooperative coalition according to a periodic motion law of an LEO satellite constellation and a grid-shaped multipath routing attribute and defining a coalition profit function through utilization of network performance indexes such as throughput, delay and a packet loss; and allocating coalition cooperative profits through adoption of a Shapley value allocation mechanism based on a thought of a coalitional game in the cooperative game, wherein a routing coalition with the highest cooperative profit is the optimum performance routing path from the source satellite node to the destination satellite node inthe current LEO satellite network. According to the method, traffic loads of hot nodes can be effectively balanced, a resource utilization rate of the satellite network is improved, the data packet network delay is reduced, and the guaranteed QoS routing capability is provided for a data packet.

A packet routing method includes computing, for each source node in the data network and each destination node in the data network, a set of multiple routes providing a full range of performance from the source node to the destination node. The multiple routes are preferably precomputed and stored. The full range of performance is defined by a set of dominant routes, defined in terms of a partial order on a multi-dimensional space whose dimensions correspond to performance metrics such as bandwidth, latency metric, and jitter. The method selects, for a packet originating from a source node and addressed to a destination node, a route from the computed set of multiple routes and forwards the packet in accordance with the selected route.

The invention relates to an AOMDV-based energy aware node-disjoint multipath routing algorithm, and belongs to the technical field of a wireless sensor network. The method includes the following steps: searching all possible disjoint multiple paths through flooding in a routing finding stage and a routing reply stage; and in a data transmission stage, designing a routing data package, increasing node energy fields in a routing table to count energy of current nodes, distributing weights to each path according to the energy of each path node, screening links, and obtaining an optimal link. Factors such a disjoint multiple paths, the link quality and node energy consumption are taken into consideration comprehensively, so node energy consumption is reduced, network loads are equalized, and the energy utilization efficiency is increased.

A multipath routing architecture for large data transfers is disclosed. The architecture employs an overlay network that provides diverse paths for packets from communicating end hosts to utilize as much capacity as available across multiple paths while ensuring network-wide fair allocation of resources across competing data transfers. A set of transit nodes are interposed between the end-hosts and for each end-to-end connection, a transit node can logically operate as an entry gateway, a relay or exit gateway. Packets from the sender enter the entry node and go to the exit node either directly or through one of a plurality of relay nodes. The exit node delivers the packets to the receiver. A multipath congestion control protocol is executed on the entry node to harness network capacity for large data transfers.

A method is described for distance vector routing of on-demand traffic between routers within an ad-hoc network maintaining multiple loop-free paths to destinations. Each router maintains routing table entries only for destinations associated with data flows through the router which reduce the amount of storage space and bandwidth required for routing table maintenance. Diffusing computations are utilized for establishing and maintaining the routes within the network. The sending of unnecessary flood searches and search-to-infinity problems are avoided, while the protocol decreases the vulnerability of the network to various service attacks along with router failures, fading, and drop outs.

A mobile communication system capable of improving the reception characteristic using a small circuit size and low power consumption is provided. The channel vector estimating section 181 estimates channel vectors in a method such as a method in which the section 181 multiplies, according to the multipath timings sent from the multipath timing detecting section, the input signal from the base-station receiving section by a complex conjugate of a known pilot signal to average the input signal (to average the input signal by de-spreading the pilot signal in the case of CDMA). The noise estimating section 182 estimates noise power using received signals and generates a Channel matrix by arranging the estimated channel vectors according to the multipath timings. The weight calculating section 184 calculates a weight matrix using the noise estimation value and the Channel matrix and sets the obtained filter weight vectors to the equalizing filter 185.

Provided is a node-disjoint multipath routing method in a cognitive wireless sensor network. In the process of establishing the routing, a routing request packet records node available channel information; a node receiving a packet sends back a routing reply packet; a link spectrum utility value is known according to a message unit in the routing reply packet; and the spectrum utility value and a set spectrum utility threshold value are compared for the selection of a next hop node. If propagation paths in two routing request packets are only intersected with each other, a second selection is performed according to average spectrum utility of the propagation paths in the routing request. With the routing method, routing selection and channel selection are combined with the spectrum utility together, and each path has no shared node except a source node and a destination node, and thus, conflict is reduced, stability of the routing is greatly improved, and the routing method is widely used in multi-channel distributed cognitive wireless sensor networks.

The invention provides a bandwidth constraint multipath routing method and system for an SDN controller. The method and the system are applied to multimedia or other SDN networks with QoS requirements. The SDN controller can acquire accurate topology information of the network from an LLDP, and can further update changes of the network topology information, so that the result of the routing algorithm is more accurate; The routing method comprises the steps of invoking the routing algorithm to carry out path calculation according to the network topology information and an unknown path with a bandwidth constraint condition input by a user, and at the same time generating and sending flow table items in a path-by-path and interchanger-by-interchanger manner according to the calculation result. The method can calculate all feasible paths or the optimal path under the condition of a single path bandwidth constraint condition, and can also calculate all feasible path combining schemes and the optimal path combining scheme under the multipath bandwidth constraint condition. The bandwidth constraint multipath routing system for the SDN controller laid a basis on which the bandwidth constraint multipath routing method can be realized, the method and the system are combined to realize the bandwidth constraint multipath routing scheme of the SDN controller.