1. A dispenser for dispensing a fluid comprising:
a flexible ampule having a narrowed tip, the flexible ampule containing a fluid to be dispensed; and
a solid wall formed at the tip, the wall being a weakest point of the dispenser so that, when the container is squeezed by a user, the wall is broken and the fluid escapes through the broken wall.
2. The dispenser of claim 1 where an amount of the fluid in the ampule is only that needed for a one-time use of the ampule.
3. The dispenser of claim 1 wherein the wall and ampule are formed of the same material and are integral.
4. The dispenser of claim 3 wherein the ampule and wall are co-molded.
5. The dispenser of claim 1 wherein the ampule is molded, the wall is pre-formed prior to molding the ampule, and the wall is placed in a mold while molding the ampule so as to be secured in place at the tip of the ampule.
6. The dispenser of claim 1 wherein the ampule holds 1-3 milliliters of the fluid, and the wall is a polymer having a thickness less than 3 mils.
7. The dispenser of claim 1 wherein the ampule is configured to be squeezed between the thumb and index finger of the user.
8. The dispenser of claim 1 wherein the fluid is a single dose of a vaso-constrictor solution for stopping a nose bleed.
9. The dispenser of claim 1 wherein the narrowed tip is conical.
10. The dispenser of claim 9 wherein the narrowed tip is configured to be inserted into a porous dressing having a size that allows the dressing to be inserted into a nostril, the dressing being formed of a material that expands when wetted.
11. The dispenser of claim 1 wherein, after the wall is broken, the broken wall forms an opening that is sized such that fluid does not escape the ampule unless the ampule is squeezed.
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 path management device that manages information about communication paths in a communication network, the communication network including a plurality of routers mutually connected by means of a communication line, link states between the plurality of routers being shared among each of the plurality of routers by means of link state advertisement messages that are announced from each of the plurality of routers, and routing tables being created in each of the plurality of routers based on shortest path trees, the path management device comprising:
a receiving unit that receives the link state advertisement messages;
a routing table creation unit that reproduces the shortest path trees and the routing tables of each of the plurality of routers based on the link state advertisement messages;
a routing table recording unit that records the reproduced routing tables of each of the plurality of routers;
a shortest path tree recording unit that records the reproduced shortest path trees from which the reproduced routing tables are created;
a routing table re-creation unit that determines whether or not to rewrite a shortest path tree and a routing table based on a record of a shortest path tree relating to a changed-state link upon receiving a link state advertisement message announcing a change in a link state,
wherein the routing table re-creation unit rewrites a shortest path tree and a routing table, and the routing table recording unit accumulates the reproduced routing tables and the rewritten routing table;
a path change monitoring unit that compares the reproduced routing tables with the rewritten routing table, and creates path change data that is differential data between the reproduced routing tables and the rewritten routing table; and
a path change recording unit that records the path change data for each of the plurality of routers.
2. The path management device according to claim 1, comprising
a cost recording unit, programmed to be executable by the path management device that records cost of each link included in the recorded shortest path tree,
wherein the routing table re-creation unit evaluates costs based on cost of the changed-state link and on the cost of each link included in the recorded shortest path trees, and determines whether or not to rewrite the shortest path tree.
3. The path management device according to claim 2, wherein, in a case in which a path included in the recorded shortest path tree can be replaced with a change-state link, and the cost of the changed-state link is equal to cost of the path which can be replaced with the changed-state link, the routing table re-creation unit updates the shortest path tree simply by adding the changed-state link to the shortest path tree.
4. A non-transitory storing medium for storing a computer program that executes path management processing to manage information about communication paths in a communication network, the communication network including a plurality of routers mutually connected by means of a communication line, link states between the plurality of routers being shared among each of the plurality of routers by means of link state advertisement messages that are announced from each of the plurality of routers, and routing tables being created in each of the plurality of routers based on shortest path trees, the computer program, executed by a computer, comprising:
a function of receiving the link state advertisement messages;
a function of reproducing the shortest path trees and the routing tables of each of the plurality of routers based on the link state advertisement messages;
a function of recording the reproduced routing tables of each of the plurality of routers;
a function of recording the reproduced shortest path trees from which the reproduced routing tables are created;
a routing table re-creation function that determines whether or not to rewrite a shortest path tree and a routing table based on a record of a shortest path tree relating to a changed-state link upon receiving a link state advertisement message announcing a change in a link state,
wherein in the routing table re-creation function, a shortest path tree and a routing table are rewritten, and
in the function of recording, the reproduced routing tables and the rewritten routing table are accumulated;
a path change monitoring function of comparing the reproduced routing tables with the rewritten routing table, and creating path change data that is differential data between the reproduced routing tables and the rewritten routing table; and
a function of recording the path change data for each of the plurality of routers.