168 results about "Link weight" patented technology

A method and apparatus for using network traffic logs for search enhancement is disclosed. According to one embodiment, network usage is tracked by generating log files. These log files among other things indicate the frequency web pages are referenced and modified. These log files or information from these log files can then be used to improve document ranking, improve web crawling, determine tiers in a multi-tiered index, determine where to insert a document in a multi-tiered index, determine link weights, and update a search engine index.

Disclosed is a method of segmenting one or more objects from one or more backgrounds in an image, the method comprising defining a plurality of image nodes, each said image node corresponding to one or more pixels of said image, connecting pairs of adjacent nodes with n-links, each said n-link weighted with an n-link cost, defining a source node, defining a sink node, defining one or more object seeds, said object seeds corresponding to image nodes within said objects, defining one or more background seeds, said background seeds corresponding to image nodes within said backgrounds, connecting said source node with each said object seed with a plurality of t-links, connecting said sink node with each said background seed with a plurality of t-links, wherein each said t-links is weighted with a t-link cost, and calculating a segmentation cut having the smallest total cost of all cuts separating said source from said sink, wherein said total cost of each said cut is defined as the sum of the costs of all said n-links and t-links that each said cut severs.

A packet network of interconnected nodes employing dynamic backup routing of a Network Tunnel Path (NTP) allocates an active and backup path to the NTP based upon detection of a network failure. Dynamic backup routing employs local restoration to determine the allocation of, and, in operation, to switch between, a primary/active path and a secondary/backup path. Switching from the active path is based on a backup path determined with iterative shortest-path computations with link weights assigned based on the cost of using a link to backup a given link. Costs may be assigned based on single-link failure or single element (node or link) failure. Link weights are derived by assigning usage costs to links for inclusion in a backup path, and minimizing the costs with respect to a predefined criterion.

The present invention comprises methods for increasing the rank of the routing matrix of an IP network by systematically altering link weights in the IP network. A full rank routing matrix may be used with further methods in accordance with the present invention to estimate the mean traffic of the IP network based upon the full rank routing matrix and measured link utilization values. The mean traffic and the covariance of the traffic may be iteratively estimated until the estimates coverage. Example methods in accordance with the present invention for estimating mean traffic and covariance of traffic are described for both stationary and non-stationary link utilization data.

A data network wherein network links have an assigned service weight and a restoration weight that are used as factors for respectively determining an optimum primary data path and a back-up data path through the network. The restoration path is used in the event of a failure of the primary service path and a Dijkstra or similar algorithm may be used for determining these paths. Service weights may be assigned to the links to prioritize finding the shortest possible path, whereas restoration weights may be assigned to the links to find a path with the maximum available capacity.

Systems and methods are described for restoring IP traffic flows routed in an IP network in less than 100 ms after the IP network sustains a network failure. The systems and methods are a two-phase fast reroute that uses distributed optimized traffic engineering during backup tunnel restoration and end-to-end tunnel restoration that maximizes sharing among all independent failure scenarios and minimizes the total capacity, total cost, or a linear combination of the two. For defined failure condition scenarios, restoration traffic is routed using pre-computed backup tunnels using a constrained shortest path first method where link weights along the path are chosen dynamically and depend on available and total capacity of the link, latency, and other cost measures such as IP port costs. During the capacity allocation phase, the method reuses capacity already allocated for other independent failure scenarios as much as possible but also adds capacity, if necessary. When an actual IP network failure occurs, the backup tunnels are used to immediately restore service to affected IP network traffic flows. In parallel, end-to-end tunnels corresponding to each affected traffic flow are rerouted and once the rerouting process is complete, traffic is switched over from the old end-to-end tunnel routes (using backup tunnels) to new end-to-end tunnel routes without using backup tunnels.

The invention provides a synthesis persuasion business method WDM OTN. Wherein, building a persuasion chart model combined with virtual topological design, rout and wavelength allocation problem, calculating on the chart to find out proper persuasion path. For business request, using built optical link for persuasion. This invention uses dynamic regulation link weight to regulate dynamically whole network link weight at any moment to balance load, and saves optical transceiver resources to reduce cost.

In an occupant weight detection system, a pair of weight detection units are mounted along upper faces of base members fixed to a floor of an automobile. A square-frame-shaped linking member made of an iron sheet is interposed between the pair of weight detection units and a pair of seat rails. The pair of weight detection units are integrally linked by the linking member to maintain a positional relationship to each other at a predetermined relationship. Therefore, it is possible to prevent these weight detection means from being mounted in a state in which they are twisted or displaced relative to each other, thereby maintaining the detection accuracy.

The present invention includes a method and system for determining link weights that when utilized will optimize the performance of a network in the event of a link failure without the need to alter the link weights. The method includes determining two sets of links, one that includes links with a significant amount of loading and one that includes links with a modest amount of loading. A set of permissible solutions is generated utilizing one randomly chosen link from each set. After omitting recent best permissible solutions, the remaining permissible solutions are evaluated by analyzing for the complete network topology and for the topologies corresponding to all single-link failure states and the best permissible solution is found. If the best permissible solution is better than the current optimal solution, then the best permissible solution is made the optimal solution. These steps are repeated until a predetermined number of iterations have been evaluated without a change in the optimal solution. When that occurs, the number of links used to generate the set of potential solutions is randomly changed and the above-described steps are repeated. The method is complete after a second predetermined number of iterations have been evaluated no matter how many changes to the optimal solution.

The invention relates to a routing selection method for a software defined network, and belongs to the field of mobile communication technology. The method comprises the following steps: obtaining an SDN (Software Defined Network) connection diagram by a controller according to a user equipment (UE) routing request message; determining a candidate base station (BS), a candidate switch (SW) and a candidate link according to the business demand of the UE; and determining each link weight based on power consumption and a delay joint utility function, generating a network weighted graph, and determining a target routing based on a Dijkstra algorithm. According to the routing selection method provided by the invention, the business demand of the UE, the transmission rates of the BS and the SW,a power message and delay and other information are comprehensively considered, the optimized routing selection of the UE under SDN architecture is realized for jointly optimizing the routing power consumption and the delay, the network power consumption can be effectively saved, the delay is shortened and the network stability is improved.

The present invention relates generally to routing of circuits in a network. More particularly, the invention encompasses a method and an apparatus for routing circuits using dynamic self-adjusting link weights within a network. The invention further includes multiple schemes for routing circuits with dynamic self-adjusting link weights in a SCN (Switched Communication Network). The network could consist of optical, ATM, FR, or IP/MPLS switches and cross-connects.

There is described a method and a configuration system for the automatic readjustment of limits for access controls used to restrict the traffic in a communication network formed by links, said communication network comprising control bodies for performing the access controls. The readjustment of limits for access controls is triggered by an event. A traffic matrix of the network is recorded in the configuration system of the communication network, and a recalculation of link weights is carried out by the configuration system by means of a traffic matrix. New limits are determined limits are respectively transmitted to associated control bodies for performing the access restriction and are activated for access controls. The method enables the limits for the access controls to be automatically monitored.

An integrated circuit comprising a plurality of processing modules (M, S; IP) and a network (N) arranged for coupling said modules (M, S; IP) is provided. Said integrated circuit further comprises a plurality of network interfaces (NI) each being coupled between one of said processing modules (M, S; IP) and said network (N). Said network (N) comprises a plurality of routers (R) coupled via network links (L) to adjacent routers (R). Said processing modules (M, S; IP) communicate between each other over connections using connection paths (C1-C12) through the network (N), wherein each of said connection paths (C1-C12) employ at least one network link (L) for a required number of time slots. At least one time slot allocating unit (SA) is provided for computing a link weight factor for at least one network link (L) in said connection path (C1-C12) as a function of at least one connection requirement for said at least one network link (L), for computing a connection path weight factor for at least one connection path (C1-C12) as a function of the computed link weight factor of at least one network link (L) in said connection path (C1-C12), and for allocating time slots to said network links (L) according to the computed connection path weight factors.

Provided are an apparatus and method of selecting a label switched path (LSP) in a network management system. The apparatus comprises a status analyzing unit which analyzes and digitizes performance information, fault occurrence, and fault history of a link in order to convert the performance information, fault occurrence, and fault history into standardized values, a link weight managing unit which determines link weight values using values obtained by adding and subtracting reference values, calculated using a predetermined weight calculation algorithm on second constraints that corresponds to qualitative information related to performance analysis of a path required by an administrative network policy, to and from the standardized values of the status analyzing unit, and an LSP selecting unit which prepares a path list by using a method of executing a predetermined background task by appointing a source and a destination from among all nodes in the administrative network, selects a path, from among paths on the path list, that satisfies first constraints which corresponds to objective information related to a path selection required by the administrative network policy, and, when there are several selected paths, selects a path that minimizes expense using the link weight values. Using the apparatus, the optimum path according to the administrative network policy can be selected.

The present invention comprises methods for increasing the rank of the routing matrix of an IP network by systematically altering link weights in the IP network. A full rank routing matrix may be used with further methods in accordance with the present invention to estimate the mean traffic of the IP network based upon the full rank routing matrix and measured link utilization values. The mean traffic and the covariance of the traffic may be iteratively estimated until the estimates coverage. Example methods in accordance with the present invention for estimating mean traffic and covariance of traffic are described for both stationary and non-stationary link utilization data.

The invention discloses a semi-structured transmission dispatching method orienting wireless sensor network data collection. The method is characterized by comprising the steps that 1, breadth-first search is carried out on a network communication graph, so that a slack semi-structured data collection route topological graph is constructed; 2, a link interference graph is constructed according to the main interference and subsidiary interference relation between transmission links in a network; 3, link weight interference factors are defined, so that the interference intensity caused to other links of the network from transmission loads of sending nodes and sending links is comprehensively weighed; 4, the dynamic link selection and time slot allocation strategy based on preference of the minimum weight is carried out; 5, a node dormant state is controlled in an explicit mode, and a data collection period is adjusted in a self-adaptive mode. According to the method, routing and dispatching are designed in a unified mode on the basis of a cross-layer design idea, the time slot utilization rate of dispatching is increased by fully utilizing the redundancy of a path, time delay of data collection is shortened, and the handling capacity of the network is improved. The method is applied to the wireless sensor network with the high requirement for the real-time property.

A control apparatus which is capable of compensating for a control error properly and quickly even under a condition where the control error is temporarily increased e.g. by degradation of reliability of the detection results of reference parameters other than controlled variables, thereby making it possible to ensure a high accuracy of control. An air-fuel ratio controller of the control apparatus calculates modified errors by multiplying e.g. an air-fuel ratio error estimated value by link weight functions, calculates basic local correction values such that the modified errors become equal to 0; calculates local correction values by multiplying the basic local correction values and the like by the link weight functions; calculates corrected valve lift by adding a lift correction value, which is the total sum of the local correction values, to a value of valve lift; calculates a first estimated intake air amount for feedforward control of an air-fuel ratio, based on the corrected valve lift; calculates an air-fuel ratio correction coefficient for feedback control of the air-fuel ratio; and calculates a fuel injection amount based on these.

The present invention comprises methods for increasing the rank of the routing matrix of an IP network by systematically altering link weights in the IP network. A full rank routing matrix may be used with further methods in accordance with the present invention to estimate the mean traffic of the IP network based upon the full rank routing matrix and measured link utilization values. The mean traffic and the covariance of the traffic may be iteratively estimated until the estimates coverage. Example methods in accordance with the present invention for estimating mean traffic and covariance of traffic are described for both stationary and non-stationary link utilization data.