1. A method of screening candidate substrates of the OCT6 transporter comprising:
a. providing a test agent;
b. providing a mammalian cell line which expresses OCT6
c. incubating the test agent with the cell line; and
d. determining whether the test agent is a substrate for OCT6.
2. The method of claim 1 wherein the test agent is coupled to a detectable substance.
3. The method of claim 2 wherein the detectable substance is selected from the group consisting of extrinsically activatable enzymes, prosthetic groups, fluorescent materials, luminescent materials, bioluminescent materials, radioactive materials, positron emitting metals using various positron emission tomographies, nonradioactive paramagnetic metal ions, immunogenic tag peptide sequences, extrinsically activatable toxins, extrinsically activatable quenching agents, and antibodies.
4. The method of claim 1 wherein the step of determining whether the test agent is a substrate for OCT6 comprises analyzing whether the test compound is located intracellularly.
5. A method of screening for potential anti-leukemia agents, comprising the steps of:
a. determining viability of a mammalian cell line which expresses OCT6 incubated in the presence of a test compound;
b. identifying the test compound as a potential anti-leukemia agent if the OCT6 intakes the test compound and the test compound causes cell death in the mammalian cell line which expresses OCT6.
6. The method of claim 5 wherein the viability of the OCT6 cell line is determined by applying a dye to the cells, incorporation of the dye by the cells indicating death of the cells.
7. The method of claim 6 wherein the dye is trypan blue.
8. A test kit for determining whether a substance is a substrate for an OCT6 transporter protein comprising:
a. a mammalian cell line which overexpresses the OCT6 protein;
b. a control antibody or compound which does not react with the OCT6 protein; and
c. a detectable label.
9. The test kit of claim 8 wherein the label is selected from the group consisting of extrinsically activatable enzymes, prosthetic groups, fluorescent materials, luminescent materials, bioluminescent materials, radioactive materials, positron emitting metals using various positron emission tomographies, and nonradioactive paramagnetic metal ions, immunogenic tag peptide sequences, extrinsically activatable toxins, extrinsically activatable quenching agents, and antibodies.
10-40. (canceled)
41. A test kit for determining whether a substance is a substrate for an OCT6 transporter protein comprising:
a. OCT6 protein; and
b. a detectable label.
42. The test kit of claim 41 further comprising an antibody that does not react with the OCT6 protein.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method of allocating demands of a plurality of restorable connections transferring data through a network of nodes connected by links, the method comprising the steps of:
(a) initializing a link length of each link;
(b) routing a demand for a current restorable connection by the steps of:
(b1) generating a minimum path length for paths through nodes and links of the network for the current restorable connection, wherein the minimum path length is the least sum of link lengths for links of each path between a source and a destination node of the current restorable connection,
(b2) determining a path set of disjoint paths through nodes and links of the network for the current restorable connection based on the minimum path length,
(b3) routing a portion of a remainder of the demand as flows over the path set, wherein the portion is based on a lesser value of the remainder of the demand and a minimum capacity of links in the optimal path set,
(b4) updating i) the link length of each link based on the routed portion and a capacity of the link and ii) the remainder of the demand, and
(b5) repeating steps (b1)-(b5) until the demand is routed;
(d) repeating step (b) for each restorable connection;
(e) generating a scaling value based on a maximum ratio of a flow over a link and a capacity of the link.
2. The invention of claim 1, further comprising the step of routing each restorable connection based on the path set.
3. The invention of claim 1, further comprising the steps of generating a metric for the updated link lengths and repeating steps (b) through (d) based on the metric.
4. The invention of claim 1, further comprising the step of scaling, based on the scaling factor, either i) each capacity of the plurality of links or ii) each demand of the plurality of restorable connections.
5. The invention of claim 1, wherein, for step (b), each restorable connections is a fast path restorable connection.
6. The invention of claim 5, wherein, for step (b) each restorable connection is a fast path restorable connection with non-shared backup, and wherein:
the shortest path length is determined for a set of disjoint path pairs corresponding to each restorable connection.
7. The invention of claim 5, wherein, for step (b), each restorable connection is a fast path restorable connection with shared backup, and wherein:
the shortest path length is determined for a set of disjoint path sets corresponding to each restorable connection.
8. The invention of claim 1, wherein the method generates an \u03b5-approximation based on a constant \u03b5, for step (b4), the link length is updated based on a combination of \u03b5 and the portion.
9. The invention of claim 1, wherein, for step (a), the network is an optical network, each node is an optical switch, and each link is an optical link.
10. The invention of claim 1, wherein the method is implemented as steps executed by a processor.
11. A method of allocating link capacity for a plurality of restorable connections transferring data through a network, the method comprising the steps of:
(a) generating a graph of the network, wherein the network includes a plurality of nodes interconnected by a plurality of links;
(b) forming a linear programming sizing problem based on the plurality of restorable connections, wherein i) each restorable connection defines a primary and a backup path for a demand and ii) the linear programming sizing problem tends to maximize a first objective function based on a first set of constraints;
(c) forming a dual of the linear programming sizing problem, wherein the dual tends to minimize a second objective function based on a second set of constraints;
(d) solving the dual to generate a scaling factor and routing of the primary path and the backup path for each of the plurality of restorable connections; and
(e) routing data of at least one of the plurality of restorable connections over a corresponding active path.
12. The invention of claim 11, further comprising the step of scaling, based on the scaling factor, either i) each capacity of the plurality of links or ii) each demand of the plurality of restorable connections.
13. The invention of claim 11, wherein, for step (b), the plurality of restorable connections are fast path restorable connections, and wherein:
the linear programming sizing problem maximizes the scaling factor as the objective function;
the first set of constraints are A) a sum of all flows on each link is less than the link’s capacity, B) each demand as a function of the scaling factor is routed through the network, and C) each flow over a link is non-negative;
the dual minimizes a shortest path length through for each of the plurality of restorable connections;
the second set of constraints are D) a sum of all link lengths is less than the minimum shortest path length, E) each demand as a function of the minimum path length is routed through the network, and F) each link length is non-negative.
14. The invention of claim 13, wherein, for step (b) each restorable connection is a fast path restorable connection with non-shared backup, and wherein the shortest path length is determined for a set of disjoint path pairs corresponding to each restorable connection.
15. The invention of claim 13, wherein, for step (b), each restorable connection is a fast path restorable connection with shared backup, and wherein the shortest path length is determined for a set of disjoint path sets corresponding to each restorable connection.
16. The invention of claim 11, wherein, for step (a), the network is an optical network, each node is an optical switch, and each link is an optical link.
17. A computer-readable medium having stored thereon a plurality of instructions, the plurality of instructions including instructions which, when executed by a processor, cause the processor to implement a method for allocating demands of a plurality of restorable connections transferring data through a network of nodes connected by links, the method comprising the steps of:
(a) initializing a link length of each link;
(b) routing a demand for a current restorable connection by the steps of:
(b1) generating a minimum path length for paths through nodes and links of the network for the current restorable connection, wherein the minimum path length is the least sum of link lengths for links of each path between a source and a destination node of the current restorable connection,
(b2) determining a path set of disjoint paths through nodes and links of the network for the current restorable connection based on the minimum path length,
(b3) routing a portion of a remainder of the demand as flows over the path set, wherein the portion is based on a lesser value of the remainder of the demand and a minimum capacity of links in the optimal path set,
(b4) updating i) the link length of each link based on the routed portion and a capacity of the link and ii) the remainder of the demand, and
(b5) repeating steps (b1)-(b5) until the demand is routed;
(d) repeating step (b) for each restorable connection;
(e) generating a scaling value based on a maximum ratio of a flow over a link and a capacity of the link.
18. A computer-readable medium having stored thereon a plurality of instructions, the plurality of instructions including instructions which, when executed by a processor, cause the processor to implement a method for allocating link capacity through a network having a plurality of nodes interconnected by a plurality of links, the method comprising the steps of:
(a) generating a graph of the network, wherein the network includes a plurality of nodes interconnected by a plurality of links;
(b) forming a linear programming sizing problem based on the plurality of restorable connections, wherein i) each restorable connection defines a primary and a backup path for a demand and ii) the linear programming sizing problem tends to maximize a first objective function based on a first set of constraints;
(c) forming a dual of the linear programming sizing problem, wherein the dual tends to minimize a second objective function based on a second set of constraints;
(d) solving the dual to generate a scaling factor and routing of the primary path and the backup path for each of the plurality of restorable; and
(e) routing data of at least one of the plurality of restorable connections over a corresponding active path.