61 results about "Cost metric" 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.

A system and method for profiling a software application may include means for defining a custom cost metric that includes a cost metric identifier and a cost function. The cost function may apply a mathematical formula to data extracted from an event set to calculate a respective cost metric value for each of one or more events in the event set. The data extracted from the event set may include one or more respective profiling object identifiers and one or more other respective costs associated with each of the one or more events. A cost associated with an event in the event space may be associated with a function or basic block of instructions. The cost function may include a distribution formula for attributing at least a portion of the cost associated with a function or basic block to each of the instructions comprising the function or basic block.

A method and system of congestion control in a network are provided. A required quality of service (QoS) parameter, such as a maximum allowable latency, for a packet received at a queue in the network, and a route cost metric, such as accumulated and estimated latency, are determined, and the packet is either discarded if the route cost metric exceeds the required QoS parameter, or a discard bias value is set for the packet. Also, if the required QoS parameter exceeds the route cost metric, the method includes determining whether a congestion condition exists in the network, and if the congestion condition exists, biasing the packet for discard based on its latency if the route cost metric for the packet exceeds a threshold. The network may be an IP network, and a network such as a mobile ad hoc network (MANET).

Method and apparatus for optimizing mesh routing for stability and system lifetime maximization in networks, for example in wireless networks. A routing module may be instantiated in nodes on the network. The routing module may implement a link quality and node health aware routing protocol on the network that considers a combination of link quality and node health / residual lifetime metrics in the calculation of the desirability of nodes and links between nodes as parts of an overall route. A route selection metric for each route may be determined from routing cost metrics for the nodes on the route and the number of hops on the route. A node may then select a best route according to the determined route selection metrics for the routes.

A generalized method for optimizing the global placement of a VLSI chip across multiple cost metrics, such as total wire length, timing, congestion, and signal integrity is described. The method relies upon a “look ahead” technique, combined with any generic cost function that can be used to set placement directives. These placement directives include net weights and cell spreading. The method of performing the placement involves the iterative reuse of the process of successive partitioning. This iterative reuse establishes the capability of looking ahead to determine what is to happen. Based on the look ahead, it is possible to evaluate the qualities of the placement about to be generated. The method proceeds through the placement from while maintaining the current state of the placement along with the look-ahead state of the placement. Directives are generated and modified in order that the next steps applied to the current state of the placement will cause it to change to achieve an ultimate higher quality final output.

Methods and apparatus are disclosed for dynamically discovering and utilizing an optimized network path through overlay routing for the transmission of data. A determination whether to use a default network path or to instead use an alternate data forwarding path through one or more overlay nodes is based on real-time measurement of costs associated with the alternative paths, in response to a user request for transmission of message data to a destination on the network. Cost metrics include delay, throughput, jitter, loss, and security. The system chooses the best path among the default forwarding path and the multiple alternate forwarding paths, and implements appropriate control actions to force data transmission along the chosen path. No modification of established network communication protocols is required.

A method of system access from a wireless device to a wireless network, the network having a plurality of base stations includes the steps of: selecting at least one reverse link cost metric from a list of predetermined reverse link cost metrics; determining a reverse link cost according to the selected at least one reverse link cost metric; selecting a candidate base station from the plurality of base stations; sending a probe signal at the reverse link cost to the candidate base station; waiting for a response from the candidate base station within a timeout period; and repeating steps until timeout, or until the condition that a response is received from at least one candidate base station so that at least one candidate base station can be used to provide system access from the wireless device to the wireless network.