1. For use in a system having a source module with a plurality of source queues, each of the source queues for storing one or more cells of one or more packets, a destination module with a plurality of destination queues, each of the destination queues for storing one or more cells of one or more packets, and a multistage link between the source module and the destination module, a method for scheduling the communication of cells over the link comprising:
determining a non-empty source queue to grant access to the link at a given time;
determining whether to transmit a head-of-line cell of the determined non-empty source queue wherein the determination is to transmit the-head-of line cell if the transmission of cells from the same packet would only be interleaved with cells of packets destined for different destination queues and the head-of-line cell is a beginning-of-packet cell, and a buffer has sufficient space for all of the cells stored in the plurality of destination queues, cells on the multistage link, and cells of partial packets in the plurality of source queues, and
wherein the determination is not to transmit the-head-of line cell if the transmission of cells from the same packet would be interleaved with the transmission of cells of different packets destined for the same destination queue;
if it is determined to transmit the head-of-line cell of the determined non-empty source queue, then transmitting the-head-of line cell.
2. The method of claim 1 wherein if it is determined not to transmit the head-of-line cell of the determined non-empty source queue, then determining a next non-empty source queue to grant access to the link using a round-robin scheduling.
3. The method of claim 2 wherein the act of determining a next, non-empty source queue to grant access to the link uses round-robin scheduling.
4. The method of claim 1 wherein if the head-of line cell is transmitted, then a next non-empty source queue to grant access to the link is determined.
5. The method of claim 1 wherein if the head-of-line cell is transmitted and the head-of-line cell is an end-of-packet cell, then a next non-empty source queue to grant access to the link is determined.
6. The method of claim 1 wherein if the head-of-line cell is transmitted and the head-of-line cell is a single-cell-packet cell, then a next non-empty source queue to grant access to the link is determined.
7. The method of claim 1 wherein if the head-of-line cell is transmitted and the head-of-line cell is either an end-of-packet cell or a single-cell-packet cell, then a next non-empty source queue to grant access to the link is determined, but otherwise, the same source queue will continue to have access to the link.
8. The method of claim 1 wherein the act of determining whether to transmit a head-of-line cell of the determined non-empty source queue includes determining whether or not the head-of-line cell is eligible for transmission, wherein if the head-of-line cell is determined to be eligible for transmission, then transmitting the head-of-line cell, and wherein if the head-of-line cell is not determined to be eligible for transmission, then not transmitting the head-of-line cell.
9. The method of claim 1 wherein the source module and the destination module are provided in a multi-plane, multistage switch having p planes, m central modules, and supporting q priorities, and wherein an egress traffic manager module needs only p*m*q reassembly queues to ensure packet reassembly.
10. The method of claim 1 wherein the source module and the destination module are provided in a multi-plane, multistage switch having p planes and m central modules and wherein an egress traffic manager module needs only p*m reassembly queues to ensure packet reassembly.
11. The method of claim 8 wherein the act of determining whether or not the head-of-line cell is eligible is used to reserve memory space in a buffer in which the destination queue is defined, for one or more partial packets stored in the destination queues.
12. The method of claim 8 wherein the head-of-line cell is determined to be eligible if:
the head-of-line cell is a beginning-of-packet cell;
the destination queue is not storing cells of another packet;
a sum of a buffer outstanding cell count, a buffer reserved cell count-and-a maximum reserved cell constant is not greater than a size of a buffer in which the destination queue is defined, and
a sum of a queue outstanding cell counter and the maximum reserved cell constant is not greater than a size of the destination queue.
13. The method of claim 8 wherein the head-of-line cell is determined to be eligible if:
the head-of-line cell is one of a continue-of-packet cell and an end-of-packet cell, and
a queue reserved cell count is greater than zero.
14. The method of claim 8 wherein the head-of-line cell is determined to be eligible if:
the head-of-line cell is one of a continue-of-packet cell and an end-of-packet cell,
a sum of a buffer outstanding cell count and a buffer reserved cell count is less than a size of a buffer in which the destination queue is defined, and
a queue outstanding cell count is less than a size of the destination queue.
15. The method of claim 8 wherein the head-of-line cell is determined to be eligible if:
the head-of-line cell is a single-cell-packet cell
the destination queue is not storing cells of another packet
a sum of a buffer outstanding cell count and a buffer reserved cell count is less than a size of a buffer in which the destination queue is defined, and
a queue outstanding cell count is less than a size of the destination queue.
16. For use in a system having a source module with a plurality of source queues, each of the source queues for storing one or more cells of one or more packets, a destination module with a plurality of destination queues, each of the destination queues for storing one or more cells of one or more packets, and at least a first multi-stage link between the source module and the destination module, a scheduler comprising:
means for determining a non-empty source queue to grant access to the at least a first link at a given time;
means for determining whether to transmit a head-of-line cell of the determined non-empty source queue wherein the determination is to transmit the-head-of line cell when the transmission of cells from the same packet would only be interleaved with cells of packets destined for different destination queues and the head-of-line cell is a beginning-of-packet cell, and a buffer has sufficient space for all cells stored in the plurality of destination queues, cells on the multi-stage link, and cells of partial packets in the plurality of source queues, and
wherein the determination is not to transmit the-head-of line cell when the transmission of cells from the same packet would be interleaved with the transmission of cells of different packets destined for the same destination queue; and
means for transmitting the-head-of line cell only if it is determined to transmit the head-of-line cell of the determined non-empty source queue, wherein the means for determining a non-empty source queue determines a next, non-empty source queue to grant access to the link if it is determined not to transmit the head-of-line cell of the determined non-empty source queue.
17. The scheduler of claim 16 wherein the means for determining a non-empty source queue to grant access to the link at a given time uses round-robin scheduling.
18. The scheduler of claim 17 wherein the means for determining a next, non-empty source queue to grant access to the link uses a round-robin scheduling.
19. The scheduler of claim 16 wherein the means for determining a non-empty source queue determines a next non-empty source queue to grant access to the link if the head-of-line cell is transmitted.
20. The scheduler of claim 16 wherein the means for determining a non-empty source queue determines a next non-empty source queue to grant access to the link if the head-of-line cell is transmitted and the head-of-line cell is an end-of-packet cell.
21. The scheduler of claim 16 wherein the means for determining a non-empty source queue determines a next non-empty source queue to grant access to the link if the head-of-line cell is transmitted and the head-of-line cell is a single-cell-packet cell.
22. The scheduler of claim 16 wherein the means for determining a non-empty source queue determines a next non-empty source queue to grant access to the link if the head-of-line cell is transmitted and the head-of-line cell is either an end-of-packet cell or a single-cell-packet cell, but otherwise, the same source queue will continue to have access to the link.
23. The scheduler of claim 16 wherein the means for determining whether or not to transmit a head-of-line cell of the determined non-empty source queue includes means for determining whether or not the head-of-line cell is eligible, wherein if the head-of-line cell is determined to be eligible, then transmitting the head-of-line cell, and wherein if the head-of-line cell is not determined to be eligible, then not transmitting the head-of-line cell.
24. The scheduler of claim 16 wherein the source module and the destination module are provided in a multi-plane, multistage switch having p planes, m central modules, and supporting q priorities, and wherein an egress traffic manager module needs only p*m*q reassembly queues to ensure packet reassembly.
25. The scheduler of claim 16 wherein the source module and the destination module are provided in a multi-plane, multistage switch having p planes and m central modules and wherein an egress traffic manager module needs only p*m reassembly queues to ensure packet reassembly.
26. The scheduler of claim 23 wherein the means for determining whether or not the head-of-line cell is eligible for transmission reserves memory space in a buffer in which the destination queue is defined for one or more partial packets stored in the destination queues.
27. The scheduler of claim 23 wherein the head-of-line cell is determined to be eligible if
the head-of-line cell is a beginning-of-packet cell
the destination queue is not storing cells of another packet
a sum of a buffer outstanding cell count, a buffer reserved cell count and a maximum reserved cell constant is not greater than a size of a buffer in which the destination queue is defined, and
a sum of a queue outstanding cell counter and the maximum reserved cell constant is not greater than a size of the destination queue.
28. The scheduler of claim 23 wherein the head-of-line cell is determined to be eligible if:
the head-of-line cell is one of a continue-of-packet cell and an end-of-packet cell, and
a queue reserved cell count is greater than zero.
29. The scheduler of claim 23 wherein the head-of-line cell is determined to be eligible if:
the head-of-line cell is one of a continue-of-packet cell and an end-of-packet cell,
a sum of a buffer outstanding cell count and a buffer reserved cell count is less than a size of a buffer in which the destination queue is defined, and
a queue outstanding cell count is less than a size of the destination queue.
30. The scheduler of claim 23 wherein the head-of-line cell is determined to be eligible if:
the head-of-line cell is a single-cell-packet cell,
the destination queue is not storing cells of another packet,
a sum of a buffer outstanding cell count and a buffer reserved cell count is less than a size of a buffer in which the destination queue is defined, and
a queue outstanding cell count is less than a size of the destination queue.
31. For use in a system having a source module with a plurality of source queues, each of the source queues for storing one or more cells of one or more packets, a destination module with a plurality of destination queues, each of the destination queues for storing one or more cells of one or more packets, and a multi-stage link between the source module and the destination module, a method for scheduling the communication of cells over the link comprising:
performing cell scheduling to determine which of a plurality of head-of-line cells to transmit over a link at any given time; and
sending head-of-line cells in the source queues in accordance with the cell scheduling determinations, wherein the cell scheduling determinations are made wherein the determination is to transmit the-head-of line cell when the transmission of cells from the same packet would only be interleaved with cells of packets destined for different destination queues and the head-of-line cell is a beginning-of-packet cell, and a buffer has sufficient space for all cells stored in the plurality of destination queues, cells on the multi-stage link, and cells of partial packets in the plurality of source queues, and wherein the determination is not to transmit the-head-of line cell when the transmission of cells from the same packet would be interleaved with the transmission of cells of different packets destined for the same destination queue.
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 treating a fibrotic chronic total occlusion associated with atherosclerotic disease of an artery of an animal, which occlusion cannot be crossed by a guide wire, the method comprising the steps of:
administering a therapeutically effective amount of a collagenase enzyme containing formulation into the occlusion, and retaining the formulation at the site of the occlusion for a collagenase enzyme treatment period of at least 10 minutes;
waiting for a pre-angioplasty waiting period sufficient to degrade the occlusion and permit crossing thereof by a guide wire; and
crossing the occlusion with an angioplasty guide wire.
2. A method of treating a fibrotic chronic total occlusion associated with atherosclerotic disease of an artery of an animal, which occlusion cannot be crossed by a guide wire, the method comprising the steps of:
advancing an angioplasty balloon catheter on a guide wire into the artery;
inflating the balloon;
removing the guide wire;
administering a therapeutically effective amount of a collagenase enzyme containing formulation into the occlusion;
removing the balloon after a collagenase enzyme treatment period of at least 10 minutes;
waiting for a pre-angioplasty waiting period sufficient to degrade the occlusion and permit crossing thereof by a guide wire; and
crossing the occlusion with an angioplasty guide wire.
3. The method of claim 1 wherein the duration of the pre-angioplasty waiting period is between 1 hour and 108 hours.
4. The method of claim 3 wherein the duration of the pre-angioplasty waiting period is between 12 hours and 86 hours.
5. The method of claim 4 wherein the duration of the pre-angioplasty waiting period is between 24 hours and 72 hours.
6. The method of claim 4 wherein the duration of the pre-angioplasty waiting period is about 24 hours.
7. The method of claim 3 wherein the administration of the formulation is through the wire port of an angioplasty catheter.
8. The method of claim 3 wherein the administration of the formulation is through an infusion needle.
9. The method of claim 3 wherein the administration of the formulation is through a catheter.
10. The method of claim 3 wherein the balloon is inflated to a pressure in the range of 1-5 atmospheres.
11. The method of claim 1 wherein the formulation is administered under a pressure of between 1 and 5 atmospheres.
12. The method of claim 2 wherein the balloon is inflated to a pressure in the range of 1-5 atmospheres.
13. The method claim 1 wherein the formulation comprises 50-2000 \u03bcg of collagenase.
14. The method claim 13 wherein the formulation comprises a dosage of from 150 \u03bcg to 500 \u03bcg of collagenase.
15. The method of claim 1, wherein the collagenase is type 1A collagenase.
16. The method of claim 1, wherein the occlusion is at least 10 weeks old.
17. The method of claim 16, wherein the occlusion is at least 12 weeks old.
18. The method of claim 14, wherein the occlusion is at least 16 weeks old.
19. The method claim 16 wherein the formulation comprises 50-2000 \u03bcg of collagenase.