# US 2008/0186864 A1 · Flexible Cost and Constraint Assignment Method and System For Hierarchical Networks

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2008/0186864 A1
- Document ID: US20080186864A1
- Status: Published application
- Kind: A1
- Application number: 12/022,882
- Filed: 2008-01-30
- Published: 2008-08-07
- Earliest claimed: 2007-02-02
- Assignees: Motipate, Inc.
- Inventors: Tsz-Tak Daniel Ho
- Web page: https://patentgrep.com/patent/US20080186864A1

## CPC

- G06Q 10/10: Office automation; Time management
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

A method and system for flexible cost management in a hierarchical network is disclosed. The method and system define paths and a cost function for each type of node in a hierarchical network. The cost function depends on the hierarchical level of the node, cost function of the node's parent node, and cost functions for the node's child nodes. Constraints can be placed on the costs of the nodes by introducing time periods and/or various user defined criteria in their cost functions. Constraints on the total network can also be defined to bound the total cost of the network. In this manner, flexibility is injected in the management of costs in the hierarchical network.

## Claims

### Claim 1

A computer implemented method for flexible cost and constraint assignment for a hierarchical network comprising a plurality of nodes, comprising the steps of:
(a) defining one or more constraints on a total cost for the hierarchical network;
(b) defining a path and types of nodes for the hierarchical network; and
(c) defining a cost function for each node in the hierarchical network, wherein the cost function depends on a cost function of the node's parent node, cost functions for the node's child nodes, and the type of the node.

### Claim 2 (depends on 1)

The method of claim 1, wherein the one or more constraints on the total cost for the hierarchical network comprises a valid time period.

### Claim 3 (depends on 1)

The method of claim 1, wherein the cost function for each node further depends on a valid time period for a cost of the node.

### Claim 4 (depends on 1)

The method of claim 1, wherein the cost function for each node further depends on one or more user definable criteria.

### Claim 5 (depends on 1)

The method of claim 1, wherein the hierarchical network comprises a social network, wherein the pluralities of nodes represent users of the hierarchical network.

### Claim 6 (depends on 1)

The method of claim 1, wherein the defined path comprises definitions of a starting node and an ending node for the path.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
(d) adding a new node to the hierarchical network;
(e) identifying parameters for the added node, wherein the parameters comprises a node type, hierarchical level, and a path relationship with other nodes in the hierarchical network;
(f) identifying one or more cost functions matching the parameters for the added node;
(g) validating a time period for the added node according to the identified cost functions;
(h) calculating a cost for the added node according to the identified cost functions;
(i) calculating costs of other affected nodes in the hierarchical network; and
(j) calculating the total cost for the hierarchical network.

### Claim 8 (depends on 7)

The method of claim 7, further comprising:
(k) determining that the valid time period has been triggered;
(l) recalculating the costs of each node in the hierarchical network; and
(m) recalculating the costs of the hierarchical network.

### Claim 9

A computer readable medium with program instructions for flexible cost and constraint assignment for a hierarchical network comprising a plurality of nodes, comprising the instructions for:
(a) defining one or more constraints on a total cost for the hierarchical network;
(b) defining a path and types of nodes for the hierarchical network; and
(c) defining a cost function for each node in the hierarchical network, wherein the cost function depends on a cost function of the node's parent node, cost functions for the node's child nodes, and the type of the node.

### Claim 10

A system, comprising:
a server for receiving parameters for a hierarchical network, wherein the parameters comprises:
one or more constraints on a total cost for the hierarchical network,
a path and types of nodes for the hierarchical network, and
a cost functions for each node in the hierarchical network, wherein the cost function depends on a cost function of the node's parent node, cost functions for the node's child nodes, and the type of the node; and
a database for storing the received parameters.

### Claim 11 (depends on 10)

The system of claim 10, wherein the parameters further comprises one or more of the following:
a valid time period for the total cost of the network;
a valid time period for a cost of the node; and
one or more user definable criteria.

### Claim 12 (depends on 10)

The system of claim 10, wherein the server:
adds a new node to the hierarchical network;
identifies parameters for the added node, wherein the parameters comprises a node type, hierarchical level, and a path relationship with other nodes in the hierarchical network;
retrieving the stored parameters from the database;
identifies one or more cost functions matching the parameters for the added node;
validates a time period for the added node according to the identified cost functions;
calculates a cost for the added node according to the identified cost functions;
calculates costs of other affected nodes in the hierarchical network; and
calculates the total cost for the hierarchical network.

### Claim 13 (depends on 12)

The system of claim 12, wherein the server further:
determines that the valid time period has been triggered;
recalculates the costs of each node in the hierarchical network; and
recalculates the costs of the hierarchical network.