37 results about "Metrics" patented technology

Methods for determining at least two pre-computed paths to a destination in a communications network are provided. The two paths are maximally disjoint. Maximally disjoint paths are paths where the number of links or nodes common to the two paths is minimized. This minimization is given a priority over other path considerations, such as bandwidth or cost metrics. By pre-computing a maximally disjoint pair of paths, the probability that an inoperable link or node is in both paths is minimized. The probability that the inoperable link or node blocks a transfer of data is minimized. Additionally, a pair of maximally disjoint paths is determined even if absolutely disjoint paths are not possible. The communications network may include at least four nodes, and maximally disjoint pairs of paths are pre-computed from each node to each other node. A third path from each node to each other node may also be computed as a function of bandwidth or a cost metric. Therefore, the advantages of the maximally disjoint pair of paths are provided as discussed above and a path associated with a higher bandwidth or lower cost is provided to more likely satisfy the user requirements of a data transfer.

An Optimized Edge Routing (OER) technique provides efficiently data routing at the edge of a network or subnetwork. The technique employs a Master node that manages a set of border nodes located at the edge of the network or subnetwork. The Master node may be a stand-alone network management node or may be incorporated into a network node, such as a border node. Unlike prior implementations, the Master node instructs the border nodes to dynamically acquire (“learn”) prefixes of incoming and outgoing data flows and to selectively filter a set of learned address prefixes whose corresponding data flows match a predetermined set of criteria. The criteria may be based on routing metrics other than, or in addition to, conventional cost-based or distance-based metrics. Further, the criteria may include a set of filtering parameters that may be reconfigured, e.g., by the Master node, from time to time. Using the learned prefixes filtered by the border nodes, the Master node can distribute network traffic and utilize network bandwidth more efficiently than conventionally done.

Each router in a network is configured for executing a link state routing protocol based on outputting a corresponding first link state advertisement message describing a connected link of the router and that specifies a first dynamic routing metric identifying a first cost of the connected link, and a corresponding variation metric identifying a statistical variation of the dynamic routing metric. Each router also is configured for selectively outputting a corresponding second link state advertisement message describing the connected link and that specifies the corresponding variation metric and an updated dynamic routing metric identifying an updated cost of the connected link relative to the first cost, the second link state advertisement message selectively output based on the updated dynamic routing metric differing from the first dynamic routing metric by more than the variation metric, or the router having received another link state advertisement from another router in the network.

A router advertises an aggregated service or route that can be evaluated by other routers as a unitary segment rather than as a group of individual links/paths associated with the aggregated service or route. The aggregated service or route can be based on service and topology state information received from one or more other routers and can be advertised with the router as the nexthop for the aggregated service or route. The router can advertise an aggregated metric for the aggregated service or route for use in such evaluation. An aggregated route can be associated with different aggregated metrics for different services.

A routing system and method are provided which use a composite cost in identifying routes. This allows a simple way of identifying the best route taking multiple metrics into account for each link simultaneously. The system allows for the inclusion of pruning constraints, and allows for various objectives such as bin packing or load balancing to be achieved.

A technique optimizes routing of application data streams on an Internet Protocol (IP) backbone in a computer network. According to the novel technique, a client router learns of server states (e.g., number of pending requests, etc.) of a plurality of application servers and also determines metrics of intermediate links between the application servers and the client router (intermediate link metrics), e.g., particularly link metrics in a direction from the application servers to the client router. Upon receiving an application request from an application client (“client request”), the client router determines to which of the application servers the client request is to be sent based on the server states and intermediate link metrics, and sends the client request accordingly.

An apparatus and method for communicating via a routing protocol in a wireless network having directional transmission capabilities. Reliable peer stations are identified using Beamforming (BF) training feedback metrics. Routing discovery messages are transmitted by unicast to reliable peer stations, with neighborhood discovery lists disseminated among peer stations in a unicast mode. From the above information, routing tables are constructed with best routing between a source and a destination station, wherein messages can be routed using said routing table from a source peer station, through intermediate peer stations, to a destination peer station. In addition, other embodiments are described, including a simplified two-hop routing apparatus and method.

A process for use in conjunction with a communications network routing protocol that automatically adjusts for congestion that may occur due to the presence of advantaged and partially disadvantaged nodes. The network nodes check to determine if they are advantaged or partially disadvantaged. Advantaged nodes may, for example, be airborne or satellite nodes having a high degree of network connectivity. Partially disadvantaged nodes may comprise nodes that are low on power. Advantaged nodes and partially disadvantaged nodes adjust the network metrics entered into the routing tables they use to advertise their routing information over the network to show longer pathways through such nodes. As a result the other nodes in the network reduce the amount of network traffic routed through advantaged and disadvantaged nodes.

The invention discloses a load sharing method of non-equivalent route. The method comprises the following steps: performing route calculation through an FRR (Fast Reroute) technology based on any router in a network of a unicast routing protocol; issuing calculated route information of two non-equivalent paths to an FIB (Forwarding Information Base); and enabling the traffic in proportion pass through two non-equivalent paths according to the metrics included in the path information. Based on the same inventive conception, the invention also provide equipment, which can support the load sharing of the non-equivalent route on the unicast routing protocol, so that the utilization rate of bandwidth is improved and the network bandwidth is increased.

New communication system with packet's retransmission elements that do not use and do not depend on any routing protocol provides definite mechanisms to deliver packets from sender to receiver. Packet's retransmission elements are no longer in charge for calculating and maintaining routing tables in order to make decision regarding packet forwarding from ingress port to egress port. Each packet besides data contains set of instructions that presents complete path description from sender to receiver and rules of packet's processing on its way depending on various network metrics. The set of instructions is devised to be executed or interpreted by each network element that packet passing through. The outcome of instructions execution provides decision regarding packet forwarding and transformation. In order to provide information for path calculation and rules of packet processing there are centralized services—Network map, Pathfinder, Name registrar and Network policy.

The invention relates to routing management by an event stream processing cluster manager. The routing management is characterized by computing a device management router; defining an instantiation manager engine based on the manager engine, and instantiating a manager ESPE based on the created manager ESP model; creating a router profile based on the mapping information read from the manager profile, the mapping information describing a connection between the event publish source and a source window of the manager ESPE; instantiating a router engine based on the created router profile; and initiating a connector to receive an event based on a router profile. The event is received in a source window of a manager ESPE processed based on a manager ESP model. A third computing device is selected by the router engine based on usage metrics received from each of a plurality of windows defined by a remote ESP model configured to further process a processed event upon receiving the processedevent.

Disclosed herein are methods and calculators for configuring traffic allocations for service classes with different Quality of Service (QoS) in a router. Example embodiments involve setting allocations at a router based on traffic rate values and/or traffic weight values provided by a user. The router may monitor actual traffic rates to ensure that traffic is not being dropped due to improper rate allocations and to provide historical data for optimizing traffic allocations. In addition, the router may automatically adjust traffic allocations to avoid dropping high(er) priority traffic. The router may also transmit alarms to the user and/or to other network devices to prompt traffic re-routing and/or re-allocation of traffic rates. Example methods and apparatus ensure appropriate traffic allocation to meet certain QoS metrics.

A Communications system for communicating over low bandwidth or high latency links incorporates a router MR7 configured to route a message to any like-configured router MR8, MR9 linked to it. Communications are implemented at network layer with UDP IP message packets. There are no hello messages. The message format 20 includes routing information but not designated and backup routers, which avoids loss of service from designated router changes and reduces bandwidth requirements. Configured routers MR7 to MR9 have different message formats 20, 40 for communicating with configured routers MR7 to MR9 and with unconfigured routers R1 to R6 respectively, and can link different protocols. A configured router MR7 deletes routes to like-configured routers MR8, MR9 with route metrics not superior to other routes with like destination. It also deletes routes with inferior metrics to related routes in an incoming message, and retains received route information regarding a new route or a route with superior metric. Some routes are not advertised, e.g. loop-back routes, multicast or broadcast routes, experimental destinations, unconfigured or zero-configured addresses, and routes matching a summary route and any user configured routes/networks.

A system, method and apparatus for routing traffic in ad-hoc networks. A routing blockchain network processes routing node information proposals received from manager nodes of network clusters. Performance metrics of one or more nodes in the system are verified using distributed ledger techniques and provided to the manager nodes as updates to each manager node's routing information. The manager nodes further determine routing paths for ad-hoc communication requests based on an authentication event that defines conditions necessary to route traffic streams in association with a particular resource.

The invention relates to the field of opportunistic routing selection in a wireless communication network, in particular to an opportunistic routing selection method based on network coding in a wireless network, which comprises the following steps that: a source node sends a data stream and selects a candidate forwarding set; the node in the candidate forwarding set obtains a coding opportunity and a data packet length according to the monitored information of the downstream node; the candidate node calculates a routing metric according to the node storage information and the information in the candidate forwarding set of the node; and the nodes in the candidate forwarding set set set forwarding priorities according to the routing metrics of the nodes so as to coordinately forward the data packets. When code forwarding is carried out, effective data transmission can be further increased through matching of the length of the data packet and searching of the coding opportunity, and therefore the network throughput and the transmission stability are improved.

Conventional internet routing is handled using routing protocols such as the Border Gateway Protocol (BGP). However, simple BGP does not account for latency, packet loss, or cost. To address this problem, smart routing systems that route traffic fast and in a cost-effective manner are implemented. In one approach, smart routing systems measure, compare, and analyze round-trip latencies and other metrics between a customer premises and one or more endpoints. Optimal inbound and outbound transit providers are selected for each endpoint based on these measurements. Other smart routing systems collect and analyze Real User Monitoring (RUM) data to predict latency performance of different content origins for serving data to a particular client based on the client's IP address and the content origins' IP addresses, which are ranked by performance. These rankings are used to steer traffic along lower latency paths by resolving Domain Name System (DNS) queries based on the performance associated with the IP addresses.

The present disclosure relates to systems, non-transitory computer-readable media, and methods that improve efficiency and flexibility of implementing computer devices by providing efficient user interfaces to provider devices that include optimal digital routes selected based on dynamic route efficiency metrics. In particular, the disclosed systems can identify and surface an optimal alternative route from a pickup location to a drop-off location associated with a transportation match based on a variety of dynamic non-temporal factors. The disclosed systems can utilize a variety of computer implemented models to determine non-temporal factors, such as distance efficiency metrics, route-segment access efficiency metrics, congestion efficiency metrics, risk efficiency metrics, and match-based efficiency metrics. The disclosed systems can then combine these non-temporal factors utilizing a common efficiency framework to determine and surface an optimal alternative route.

The invention discloses a multi-metric fusion objective function construction method of a routing protocol, which comprises the following steps of: respectively calculating a hop count Rank value of each child node, an expected transmission frequency from the child node to a father node and a storage parameter of the father node by collecting child node routing data and cache information data of a Mac layer, and constructing a multi-metric fusion objective function; a multi-metric fusion model is obtained; calculating the Rank value of each sub-node of the topological structure according to the multi-metric fusion model, and constructing a network topological structure; according to the method, on the basis of the link load problem, multiple metrics are constructed through the cache proportion and the cache growth rate and fused to form the high-reliability routing protocol, under the condition that the basic communication quality and the transmission hop count are guaranteed, link balance under the condition that the load is heavy is achieved, the reliability and robustness of the whole routing protocol are improved, and the service life of the routing protocol is prolonged. And the basic communication quality and the transmission hop count are ensured.