text:
Following failure of part of the network, a restoration process is carried out. A restoration route around the failed part is selected, and at least a portion of the capacity of links along the restoration route is allocated. The restoration route may be completed without delay. If it can be optimised subsequently, it will be changed, to eliminate any loops, or to use routes further away from the failed part, to avoid congestion close to the failed part.
1. A method of restoring a route set up in a network following a failure of part of the network, the network comprising a plurality of fixed nodes, and links interconnecting the nodes, wherein the restored route is allocated, the method comprising the steps of:
selecting one or more of the links of the network, for a restoration route around the failed part;
allocating to the restoration route at least a portion of the capacity of the selected links;
determining if the restoration route can be optimized so as not to use at least one of the selected links by;
changing the restoration route according to the result of the determination; and making available the capacity allocated to the restoration route on the link or links no longer used, for use in setting up other routes.
2. The method of claim 1 wherein the determining step comprises the step of interrogating nodes on the route to gather information on possible alternative routes.
3. The method of claim 2 wherein the step of changing the restoration route is carried out by a node on the route in response to the gathered information.
4. The method of claim 1 wherein the route is set up for passing cell oriented information.
5. The method of claim 1 wherein the route is a virtual path in an ATM network.
6. The method of claim 1 wherein the route is a virtual circuit for frame relay.
7. The method of claim 1 comprising the step of identifying a node in the vicinity of the failed part as a chooser node, and wherein the selecting step is carried out by the chooser node.
8. The method of claim 7 further comprising the steps of: identifying if the restoration route passes one of the nodes twice to form a loop;
eliminating a loop not including the chooser node;
passing a message around the eliminated loop; and
passing a message along the restoration route to the chooser node to enable the chooser node to reuse the relinquished capacity for setting up other routes.
9. The method of claim 1 wherein the determining step comprises the step of identifying possible alternative routes to avoid using links or nodes in the vicinity of the failed part of the network.
10. The method of claim 9 wherein the identifying step comprises the steps of:
assigning a value to each node or link in the vicinity of the failed part, indicating how far away it is from the failed part; and
determining whether a possible alternative route is better than the route set up, on the basis of the values assigned to nodes or links on the route, and on the possible alternative route.
11. The method of claim 10 wherein the identifying step comprises the step of identifying if the restoration route passes the same node twice, to form a loop, and the changing step comprises the step of eliminating the loop.
12. The method of claim 1 wherein the determining step comprises the step of identifying if a portion of the route can be changed to reduce the number of nodes along the route.
13. The method of claim 12 wherein the identifying step comprises the step of sending test messages between nodes on the restoration route to identify shorter paths between nodes on the route.
14. The method of claim 1 further comprising the step of using the changed restoration route for a communication.
15. A method of restoring a route set up in a network following failure of part of the network, the network comprising a plurality of nodes, the method comprising the steps of:
selecting a restoration route around the failed part;
determining if the length of the entire route including the selected restoration route can be shortened, using processing means distributed across the nodes of the network; and
changing the restoration route to shorten the length of the entire route in accordance with the result of the determination.
16. A node arranged for use in a network, the network comprising a plurality of other nodes, and links interconnecting the node and the other nodes, the node comprising:
means for setting up a restoration route following a failure of part of the network, for restoring a route set up in the network, the restoration route using one or more of the links;
means for determining if the restoration route already set up through the node can be optimized so as not to use at least one of the links currently used by the restoration route;
means for changing the restoration route according to the result of the determination; and
means for making available the capacity allocated to the restoration route on the link or links no longer used, for use in setting up other routes.
The present invention relates to methods of optimising a route set up for passing information through a network, methods of restoring a route set up in a network, and nodes arranged for use in such methods.
In networks such as mesh type networks, there are numerous possible routes for passing communication between one node and another node. Many types of routing algorithms are known for finding the shortest route, or for making best use of available capacity. One particular case, or application of routing methods is for the purpose of restoring a network after a failure has been detected. Such a failure may take the form of loss of a link between nodes, or loss of a node. Methods of restoring the network can be categorised as preplanned, or adaptive. Preplanned methods require knowledge of the topology of the network. Adaptive methods involve finding out the topology of the network around the failure, in real time. This involves making use of some processing capability at the nodes.
Conventional methods may involve distributed processing at the nodes, or centralised control by a remote processing means.
Conventionally, there have been three main characteristics by which restoration methods have been assessed. Firstly the percentage of the capacity of the failed link which is restored using the alternative routes, can be measured. Secondly, the length of the alternative routes can be measured (shorter routes are preferred usually). Thirdly, the time taken to identify and establish the alternative routes can be assessed.
Clearly, the performance of a restoration method depends crucially on how much spare capacity there is in the alternative routes. If the alternative routes are heavily loaded already and have little spare capacity, then more such alternative routes will be needed, and they are likely to be longer.
In one known algorithm (Grover WD "Self Healing Networks—a distributed algorithm for k-shortest link—disjoint paths in a multigraph with applications in real time network restoration, pages 76 to 106, PhD dissertation, University of Alberta, Autumn 1989), a completely distributed k-shortest paths processing sequence with no prior knowledge of network topology at any node, is disclosed. The process is shown in FIG. 1, steps 50 to 55. FIG. 2 shows in schematic form, the layout of the nodes involved in the process. FIG. 2 shows a relatively simple arrangement. In practice there are likely to be many around the broken link, and many nodes in each route.
When a link failure occurs, two custodial nodes are cast at the end points of the failed link. Using their unique node identification numbers, they order themselves into sender 63 and chooser 64. The sender creates flooding instances which propagate from sender to chooser, for each failed channel, to search out available spare paths. The nodes involved in the search propagation, known as tandem nodes 65, assign spare channels to the flooding instances, and cause the flooding instances to increase their count of the number of hops used. When a chooser receives a flooding instance, it can read the hop count to identify the shortest route. The shortest route is acknowledged, and capacity assigned by the tandem nodes is relinquished unless it is on the acknowledged shortest route. The same process is carried out for each channel which uses the failed link.
Others have proposed variations on this basic algorithm, including the concept of multiple candidate choosers, as shown in "A Distributed Restoration Algorithm for a Multiple Link and Node Failures of Transport Networks" by H Komine et al (proceedings of the IEEE Globecom 1990, pages 459 to 463). Furthermore, in "Restoration Message Transfer Mechanism and Restoration Characteristics of Double Search Self Healing ATM Network", IEEE Journal of Select Areas in Communications, volume 12 number 1 pages 149 to 157, January 1994, there is disclosure of a double search. The sender and chooser take on each others roles, to enable searches in both directions.
However, such methods can result in a large number of search instances, if there are many channels. It is known to use only a single search instance between the sender and chooser, from "Self Healing Techniques Utilising Virtual Path Concept for ATM Networks", Kawamura et al, Electronics and Communication in Japan, part 1, volume 75, number 4, pages 86 to 96, 1992.
However, this method involves the search instance obtaining information about capacity for groups of channels, on a channel by channel basis. Again, where there are many channels, the flooding instance will become large and complex.
With all the methods discussed, based on spare capacity being identified and allocated by each tandem node, on a channel basis, for example for each virtual path (VP) in an ATM system, the first virtual path may cause temporary allocation of spare capacity on a wide range of alternative routes, until the shortest route is acknowledged. Such temporary allocation may block a succeeding virtual path or force it to find a much longer route than would otherwise be necessary. Accordingly, performance of such restoration methods may be poor, particularly on networks such as wide area telecommunications networks which may be heavily loaded, and have little spare capacity.
It is also known to use complex max-flow algorithms at the network configuration or design stage, to calculate the minimum amount of spare capacity required to achieve 100% restoration of failures on neighbouring links or nodes. These enable performance testing of restoration algorithms, to see how close they come to optimal restoration. This is unrealistic because real networks are often so heavily loaded that 100% restoration is not possible.
Therefore there is a need for algorithms better suited to such heavily loaded networks.
The invention aims to provide improved methods and products.
According to a first aspect of the invention there is provided a method of restoring a route set up in a network following a failure of part of the network, the network comprising a plurality of fixed nodes, and links interconnecting the nodes, wherein the restored route is allocated, the method comprising the steps of:
selecting a restoration route around the failed part;
allocating to the restoration route at least a portion of the capacity of the links it uses;
determining if the restoration route already set up can be optimised so as not to use at least one of the links currently used by the restoration route;
changing the restoration route according to the result of the determination; and
making available the capacity allocated to the restoration route on the link or links no longer used, for use in setting up other routes.
Improved capacity allocation can be achieved if restored routes already set up are examined to see if they can be optimised.
Advantageously the method also comprises the step of interrogating nodes on the route to gather information on possible alternative routes. Gathering information on possible alternative routes means there is no need to have preplanned preferred routes or centralised knowledge of the configuration of the network, and thus the optimisation can be adaptive and easily take account of changes in network configuration.
Advantageously, the determining step comprises the step of interrogating nodes on the route to gather information on possible alternative routes. Having the nodes react to the gathered information means the optimisation processing can be distributed through the nodes, and no centralised control is necessary. Thus message passing to and from a centralised controller can be avoided. Distributing the processing also enables it to adapt more easily to changing network configurations.
Advantageously, the route is set up for passing cell oriented information.
Advantageously, route is a virtual path in an ATM network.
Advantageously, the route is a virtual circuit for frame relay. Virtual paths or virtual circuits can be created or torn down rapidly, and therefore many such routes may be created on a temporary basis.
Advantageously the method also comprises the step of identifying a node in the vicinity of the failed part as a chooser node, and wherein the selecting step is carried out by the chooser node.
Using a local chooser node for restoration route selection enables the advantages of local centralised control, and distributes the processing capability requirements. Speed of response and adaptation network environment can be enhanced.
Advantageously, the determining step comprises the step of identifying possible alternative routes to avoid using links or nodes in the vicinity of the failed part of the network. Avoiding using links or nodes in the vicinity of the failed part of the network can produce a better overall utilisation of the limited spare capacity around the failed part of the network. Where many routes cross the failed part of the network, minimising usage of spare capacity in links closest to the failed part may be critical to minimise blocking of alternative routes.
Advantageously, the identifying step comprises the steps of:
assigning a value to each node or link in the vicinity of the failed part, indicating how far away it is from the failed part; and
determining whether a possible alternative route is better than the route set up, on the basis of the values assigned to nodes or links on the route, and on the possible alternative route. Scoring each alternative route enables preference to be given to routes away from the failed part. The scoring can be tailored to favour routes a given number of nodes away from the failed part.
Advantageously, the determining step comprises the step of identifying if a portion of the route can be changed to reduce the number of nodes along the route, to improve one of the performance parameters directly.
Advantageously, the identifying step comprises the step of sending test messages between nodes on the restoration route to identify shorter paths between nodes on the route. the features of This can facilitate distributed optimisation.
Advantageously, the identifying step comprises the step of identifying if the restoration route passes the same node twice, to form a loop, and the changing step comprises the step of eliminating the loop, to shorten the route.
Advantageously the method also comprises the steps of:
identifying if the restoration route passes the same node twice to form a loop;
eliminating a loop not including the chooser node;
passing a message around the eliminated loop; and
passing a message along the restoration path to the chooser node to enable the chooser node to reuse the relinquished capacity for setting up other routes,
to ensure the chooser is informed of relinquished capacity, and a loop including the chooser is only eliminated last. If loops including the chooser or sender are eliminated, capacity at the most congested areas will become available for reuse.
According to another aspect of the invention, there is provided a method of restoring a route set up in a network following failure of part of the network, the network comprising a plurality of nodes, the method comprising the steps of:
selecting a restoration route around the failed part; determining if the restoration route set up can be shortened, using processing means distributed across the nodes of the network; and
changing the restoration route to shorten it in accordance with the result of the determination.
According to another aspect of the invention there is provided a method of restoring a route set up in a network comprising a plurality of nodes, for passing information across the network, after a failure of a part of a network, the method comprising the steps of:
charging the route to an alternative route avoiding the failed part;
optimising the alternative route to avoid using nodes in the vicinity of the failed part.
According to another aspect of the invention there is provided a node arranged for use in the method of claim 1, comprising:
means for setting up a restoration route;
means for determining if a restoration route already set up through the node can be optimised so as not to use at least one of the links currently used by the restoration route;
means for changing the restoration route according to the result of the determination; and
means for making available the capacity allocated to the restoration route on the link or links no longer used, for use in setting up other routes.
Such preferred features may be combined as would be apparent to a skilled man, and may be combined with any of the aspects of the invention.
For a better understanding of the invention, and to show how the same may be carried into effect, it will now be described by way of example with reference to the drawings in which:-
FIG. 1 shows a known restoration method;
FIG. 2 shows in schematic form a network;
FIGS. 3 and 4 show restoration methods according to the present invention;
FIG. 5 shows in schematic form the internal structure of a node for use in the network of FIG. 2;
FIG. 6 shows in schematic form the routing function of the node of FIG. 5;
FIG. 7 shows in schematic form the databases of the node of FIG. 5;
FIG. 8 shows the restoration function of the node of FIG. 5;
FIG. 9 shows the operation of the chooser node in the method of the invention;
FIG. 10 shows the function of the tandem node in the method of the invention;
FIG. 11 shows the function of the sender node in the method of the invention;
FIG. 12 shows a network including a failed node;
FIG. 13 shows in schematic form the custodial node "H" of FIG. 12;
FIG. 14 shows a network including a candidate chooser node and a primary chooser node;
FIG. 15 shows in schematic form some of the functions of the candidate chooser;
FIG. 16 shows in schematic form a restoration method with optimisation according to the present invention;
FIG. 17 shows in more detail the step of determining if the route can be optimised, shown in FIG. 16;
FIG. 18 shows a network demonstrating evaluation of distance from the failed part;
FIGS. 19A to 19C show nodes in a network, and show the loop elimination process;
FIG. 20 shows a network of nodes and illustrates paths followed by a loop elimination message;
FIGS. 21a and 21 b show the operation of a loop elimination message;
FIG. 22 shows a state diagram for a message performing loop elimination; and
FIG. 23 shows in schematic form non-loop path length reduction.
FIG. 3 illustrates an embodiment of the invention in schematic form. Messages are sent along alternative routes to determine spare capacity of each link of alternative routes around a broken part of the network at step 100. Thus alternative routes are ascertained on a local basis to avoid the need for preplanning or a centralised control of the search or calculation of alternative routes. With reference to FIG. 2, the alternative routes from the end node 61 to end node 62 may be via sender node 63, tandem node 65, chooser node 64 and end node 62.
Step 101 of FIG. 3 involves selecting one of the possible alternative routes on the basis of the spare capacities of the links. Communication may be continued using the selected alternative route as shown at step 102.
Another aspect of the invention is illustrated in schematic form in FIG. 4. At step 110 it is determined that the route has failed. At step 112 alternative routes are determined. At step 111, a chooser node 64, as shown in FIG. 2, is selected in the vicinity of the failed part. At step 113 spare capacity on each of the possible alternative routes is determined.
Finally, at step 114, one or more of the alternative routes is selected, and allocation of the spare capacity on this selected alternative route is controlled by the chooser node 64. In comparison with the prior art method of FIG. 1, there is locally centralised control of the allocation of the spare capacity on the allocation of the spare capacity on the alternative routes by the chooser node, which enables more efficient allocation, and avoids blocking caused by temporary allocation by tandem nodes.
FIG. 5 illustrates in schematic form a node for use in the methods described above. Preferably, each node 70 should be able to perform the function of an end node 61, 62, which may comprise network terminating equipment for converting a communication into the protocols used by the network. The functions of such an end node will not be described in more detail as an implementation appropriate to the type of network protocol being used would be realisable by a person skilled in the art. The node 70 shown in FIG. 5 should also preferably be able to perform the functions of the sender node 63, the chooser node 64, and the tandem node 65. These functions can be summarised as restoration functions, shown in element 73 of the node 70. Switching functions for passing communications between links are shown by element 71. The switching functions are controlled by routing functions 72, which refer to databases held locally, indicated by reference 74. Overhead, administration and maintenance functions (OAM) are shown by element 75.
In practice, the switching function 71 is often carried out by dedicated hardware, to maximise the speed of operation. The routing, restoration and OAM functions may be carried out by a single conventional processor, or by multiple conventional processors.
The invention may be applied to optical hierarchy transport networks based on SONET, but is particularly advantageously applied to ATM networks or frame relay networks. These latter two types are cell oriented, with virtual circuits in the case of frame relay, and virtual paths (VPs) and groups of the VPs called virtual connections (VCs) being set up between end nodes, so that all the packets for a given communication or portion of a communication pass along the same route. Where the communications include telephone calls, a virtual path would be set up at the outset of the call, cells passed along the virtual path during the call, in both directions. At the end of the call the virtual path is torn down. Thus there may be many virtual paths established on a link at any one time.
The switching function 71 of the node 70 in FIG. 5 will read the virtual path identifier from each ATM cell arriving at the node. The switching function will refer to a routing table held in the database section 74, via the routing function 72. The routing table will indicate which link is used by the appropriate virtual path, and will send the packet onward on that link.
The routing function will now be described with reference to FIG. 6. For incoming cells, step 81 shows that the decimation of the cell must be determined. According to the VPI (Virtual Path Indicator) in the cell, or other indicator of the destination or purpose of the cell, the routing function may pass the cell to the restoration process (step 82). Alternatively, it may pass the cell onto another link according to routing tables as described above (step 83). If the cell belongs to a path being restored, it may be buffered as shown in step 84, while if the cell is for use by an application running on the node, or is used by the OAM function, it will be routed within the node, at step 85.
Outgoing cells may be dealt with by the routing function by determining a destination node from routing tables at step 90. According to the content of the routing table, the cell will be passed to an appropriate part of the switching function 91 for onward transmission on a given link.
The databases 74 shown in FIG. 5, will now be discussed with reference to FIG. 7. Path routing tables 120 are shown for keeping track of established virtual paths. Routing tables for all destinations, 120 are also used. The routing function will make use of these tables in the normal operation of the node.
Two other databases 122 and 123 are shown specifically for restoration purposes, for use by the restoration function, when the node is acting as a chooser. Firstly an alternative path database is maintained, with an entry for each alternative path found by the searching messages sent out by the sender. Each entry will include at least a hop count for the given alternative path, in terms of the number of nodes on the route. Furthermore, an indication of the distance of the nodes from the failed part may also be recorded. This "score" for each of the possible alternative routes will be discussed in more detail below, with reference to FIG. 18.
Other parameters of the possible alternative routes may be recorded and stored, to assist the chooser in selecting optimum alternative routes around failed paths.
FIG. 8 illustrates in schematic form the restoration function 73. Typically, the OAM function monitors the state of links around the node, and determines if a link has failed. The restoration function therefore receives an alarm indication from the OAM at step 130. The nodes at either side of the failed link, or failed part, will raise alarms, and commence restoration. The nodes at each side of the failed part will be termed "custodial nodes". The custodial nodes will be aware of the virtual paths which use the failed link, since each node maintains path routing tables 120.
The next step is to determine which of the pair of custodial nodes should be sender and which should be chooser, as shown in step 131 of FIG. 8. Where each of the custodial nodes knows the node ID of the other custodial node, the sender/chooser choice can be made by reference to the node IDs. For example, the higher node ID could be the chooser. At this point, no alternative route has been found, so the determination should be made independently. There may be an advantage in choosing as the chooser node the node with less spare capacity on its remaining working links. This is because the worst bottle neck for restoration is likely to be the final hop to the sender or to the chooser. As the chooser can be bypassed by using candidate choosers as will be discussed below with reference to FIGS. 14 and 15, overall, better restoration performance may be achieved if the bottleneck around the sender is reduced by appropriate choice of the sender and chooser.
As shown in FIG. 8, the next step is to perform the functions of the sender or chooser as appropriate, or the functions of candidate chooser or tandem node, as set out in steps 132, 133 and 134 in FIG. 8.
With reference to FIG. 9, the basic functions of the chooser node are illustrated in schematic form. The chooser node receives floods of search messages from the sender via tandem nodes, at step 140. The flooding instance of messages searches out all spare capacity between the sender and chooser, but does not assign any capacity to a specific path, unlike previous methods. At step 141, the chooser node builds a database of the possible alternative routes, including at least the hop counts of each route, the spare capacity of each link on the route, and other parameters which may assist in enabling the chooser to select the most appropriate alternative route for each virtual path affected by the failed link. To restore the affected virtual paths, the chooser can begin assigning capacity as soon as the first complete path arrives. Assignment depends on the particular assignment algorithm used. Various types of assignment algorithm are conceivable, with differing results in terms of efficiency of use of the spare capacity. A simple FCFS (First Come First Served) algorithm simply assigns virtual paths to spare capacity in a random fashion as soon as the capacity is identified by receipt of flood messages from the sender.
The chooser acknowledges the shortest route for each path with sufficient capacity for the path, by sending a message back to the sender, at step 142 of FIG. 9. The database of alternative routes can be amended to reflect the reduced spare capacity available for other virtual paths, at step 143. The chooser continues through its list of affected virtual paths, until all have been restored, or until all remaining virtual paths are blocked by a lack of spare capacity on alternative routes, as shown at step 144.
At step 145, the chooser node broadcasts to all nodes to relinquish any spare capacity still being reserved for the restoration process. Clearly this would occur only once all the affected virtual paths have been restored.
Any new virtual paths to be set up during the duration of the failure in the link would be re-routed to avoid the failed part. This would normally be carried out not as part of the restoration process using alternative routes identified by the flood messages, but by altering the routing tables in nodes in the vicinity of the failed part, and perhaps over a wider area.
Other possible assignment or allocation algorithms include FCFS with loop elimination, and FCFS with loop elimination and delay. Loop elimination will be discussed in more detail below with reference to FIGS. 19 to 22. Briefly stated, before assigning capacity (or afterwards), a message is sent along the path to identify cross-over points where the path crosses over itself. This may be complex if the path comprises three parts, original sections of the virtual path before and after the failed part, and a third bypass part which joins the two broken sections, around the failed part. The loop elimination message may bypass the loops at the cross over points, then pass around the bypassed loop to relinquish the capacity of each of the links in the loop. Finally the loop elimination message may return to the chooser to inform the chooser of the relinquished capacity so that it may be reassigned to other virtual paths.
To enhance the effect of loop elimination, if a delay is included, then other restoration paths with a hop count less than the current hop count may be prevented for a given time period. The hop count of the current shortest path may be lowered when all the loops have been eliminated from the restored paths which are longer or equal in length to the current restoration path length. If the delay is sufficient for all loop elimination messages to be returned, then the assignment algorithm can be allowed to continue with the shortest loop free restoration path. The maximum delay for the loop elimination process can be estimated and an accurate time out value given in case a loop elimination instance fails. This can provide fail safe operation in case a message becomes corrupted or lost.
With reference to FIG. 10, a tandem node is unaware of the failed part until it receives a flood message from a sender at step 149. At step 150, the message will be discarded if it has previously passed through the tandem node. It is in the nature of flood messages that are passed by each node to every outgoing link, that some messages will go in a loop and return to the same tandem node. To enable such messages to be discarded, each message will record the nodes through which it passes. Alternatively, the node may store which flood messages it has seen and passed on. At step 151 the tandem node will add information on the spare capacity of its links, to the message. At step 152 the hop count in the message is incremented by one. At some point, as shown in step 153, the tandem node will reserve all spare capacity for this restoration process. Each of the flood messages has an indicator of which restoration process it is related to, in case there are multiple failures in the same area of the network. Spare capacity may be shared between restoration processes, as will be discussed below. The node records the amount of spare capacity for that restoration process, to ensure that other messages belonging to the same restoration process are forwarded with the same value of spare capacity.
At step 152, the flood message is broadcast by the tandem node on all other links, unless the hop count is greater than a given threshold. This limit to the hop count enables the range of the flood messages to be limited, so as not to clog the network. The limiting hop count can be chosen according to a desired length of alternative route.
At step 155, the tandem node awaits acknowledgement from the chooser and only then allocates some spare capacity to the virtual path, as requested by the virtual path.
Even if there is no capacity to be assigned, the tandem node will record this and pass it on in the broadcast flood message, so that the database in the chooser node reflects the lack of spare capacity.
With reference to FIG. 11, the functions of the sender node are set out in schematic form. At step 160 the virtual path is set up to a neighbouring node. A failure in the route of the virtual path is detected at step 161. At step 162, the sender floods messages via all its neighbouring nodes, to find alternative routes to the chooser node, and to pass spare capacity information on the links of those alternative routes, to the chooser node. Only when a route acknowledgement is received from the chooser, at step 163, does the sender reroute the virtual path along the selected route, by altering its routing tables. The routing tables in the sender are also changed to ensure that subsequent virtual paths are set up away from the failed part. Like the chooser, the sender may alert other nodes to amend their routing tables for destinations previously served by the failed link, to ensure that subsequent virtual paths avoid the failed part.
Multiple link failure is a complex issue in this algorithm since all the spare capacity is likely to be assigned to one restoration instance. Obviously all the capacity should be assigned to one process if only one process exists. However, deadlock must be avoided whether processes execute, either simultaneously or at separate times.
The quantity of spare capacity available limits any restoration algorithm when two or more links fail. It is suggested that a mechanism exists for a restoration instance to retry after a specific time if another restoration instance has been detected to be executing. This would not prevent the algorithm from attempting an initial restoration search, although when the process is complete another search could take place.
If the two algorithms start simultaneously then a mechanism should exist for both algorithms to pull back and perform either a restoration with capacity divided between the failures, or one process should back off to allow the other to finish. The first method would then make it possible for the two algorithms to create separate flood-searching instances limiting the tandem nodes to assign a set fraction of their spare capacity to each algorithm. The second method increases the restoration time for the delayed restoration instance.
Obviously the first step in dealing with nodal failure is for the neighbouring nodes to determine that it is a node failure and not a link failure; this is discussed in more detail in Fujii H. and Yoshikai N., "Restoration Message Transfer Mechanism and restoration Characteristics of Double-Search Self-Healing ATM Network", IEEE J. Select. Areas Commun., vol 12, no. 1, pp. 149-157, January 1994. It is recommended that once the nodes have recognised the failure as a node, they contain enough information to determine which VPs are destined for each 'end hop' node. The term 2nd refers to the node two hops away backwards or forwards. It would be beneficial to create several sender/chooser instances between the custodial nodes such that all nodes have one sender/chooser instance with each other. This could be achieved as follows, where the failed node is called the suspect node.
When a custodial node has identified the suspect node as inoperable it orders itself with the other custodial nodes; it all other nodes in the node's 2nd hop table entry. Every node has a relative position in the 'custodial node sequence list' with respect to its node ID. The sequencing is such that the custodial node with the highest ID is the first node and the custodial node with the lowest ID is the last node. For example, if the custodial node sequence list is C, D, H, L, as shown in FIG. 12, each custodial node has a sender state for every other custodial node lower in the sequence list. In the same manner each node has a chooser state for every custodial node higher in the sequence list. For this example table I shows the sender/chooser states:
Thus all sender states create flood-searching instances to each chooser state in its table. During the searching instances each tandem node reserves a fraction of the capacity with respect to the number of sender/chooser pairs. This information can be held in the search message and is equal to
where N is the number of custodial nodes. The process of acknowledging capacity and performing loop elimination is the same as that described above. FIG. 13 shows how a custodial node should be able to act as chooser and sender for the various restoration processes for respective sender/chooser pairs.
To avoid a bottle neck around the chooser node 64, some of its functions can be delegated to a candidate chooser node 180, as shown in FIG. 14. Selected alternative paths may bypass the chooser node, and its operation will be described with reference to FIG. 15. At step 181 it receives flood messages from the sender via tandem nodes. These messages are passed to the primary chooser, 64, indicating the candidate chooser termination or the bypassed path around the failed part.
At step 183, the candidate chooser receives acknowledgement from the chooser to restore a path back to the sender. The candidate chooser acknowledges the primary chooser's request back to the sender, and connects the restoration bypass path, and the original failed path, at step 184. Finally, an acknowledgement is sent to the chooser, and the old path between the primary chooser and the candidate chooser is relinquished, to be made available for other restoration paths.
The bottle neck avoided by the candidate chooser can be described in terms of a cutset.
A cutset is a set of links that, when removed, divides a graph into two. For the restoration process, the cutset that separates the sender and the chooser with the least capacity is the limiting factor (minimum cutset), if loop elimination is not implemented in the network. The minimum cutset will probably exist around the custodial node with the smallest cutset capacity, within one hop. Given that either custodial node can be the primary chooser, the minimum cutset will probably be increased by selecting the node with the least cutset capacity as the primary chooser to which candidate choosers can then be assigned. During restoration, the primary chooser maintains a database of all information related to the restoration. The concept of candidate chooser is different from prior methods in that the sender creates a single flooding instance between each candidate chooser and the primary chooser. To implement this, the sender requires the node identification of all 2nd hop nodes. For all search instances the tandem nodes inform the chooser (candidate or primary) of the same spare capacity. When a candidate chooser receives messages for itself, it informs the primary chooser of the received information. From the database the primary chooser identifies failed VPs passing through that candidate chooser and the amount of spare capacity available for its restoration. The primary chooser informs the candidate chooser of any restoration process. Upon completion it is the function of the candidate chooser to initiate any loop elimination processes and inform the primary chooser of any relinquished capacity.
If the chooser has been selected to have the least number of neighbouring nodes, the concept of candidate choosers helps eliminate the most probable minimum cutset. In principle, the same concept can be envisaged for the sender side.
FIG. 16 shows how restoration capability can be improved by optimisation. After selecting a restoration route at step 190, capacity is allocated at step 191 to restore an existing virtual path as soon as possible. Then at step 192 it is determined if the route can be optimised. If so, the route is then changed, and unused capacity is relinquished at step 194.
As discussed above, some optimisation may be carried out before capacity is allocated, by appropriate choice of assignment algorithm. The techniques for optimisation described below can be applied either to optimise before allocation, or after allocation.
FIG. 17 shows three options for optimising a route. The distance from the failed part may be evaluated and relative scores for each route determined (step 200), as will be described with reference to FIG. 18. Non-loop path length reduction, step 201 may be used, and will be described with reference to FIG. 23. Loop elimination, step 202 will be described with reference to FIGS. 19 to 22.
The idea of this scoring system is to force the restoration paths away from the most congested links closest to the failure. Such a technique utilises paths that might be longer, although they could increase the restored capacity. The paths discovered using this technique are called 'silent paths' since they already exist but do not make themselves attractive to the restoration process.
FIG. 18 shows the difference between a silent path and the current restored paths. To evaluate these silent paths they are given a score relative to their distance from the failed link. The optimum path can be selected on the basis of the score, along with other parameters.
The first task is to inform nodes of their distance from the failed link and assign scored. This can be achieved by two pass broadcast between the sender and the chooser. When a failure is detected the custodial nodes broadcast a single message to the other custodial nodes. As the message expands through the network a hop count is maintained. Depending on the lowest hop count received it provides the intermediate nodes with their distance from the failed link. Obviously the search is soon relinquished since a node can terminate a message if it has a hop count greater than the lowest count received.
The score assigned to each link is designed to allow a set number of links that are further from the failed link to be chosen instead of a closer link that is on a shorter path. For example, if the set number of links is given a maximum of 3, then a path can contain 3 links with a score one lower in preference to a link with a score one greater.
To determine the score of a link, there should be a predetermine distance, at which point the score is irrelevant, i.e. zero. This example will assume that links over 4 hops from the failure have a score of zero. Therefore the scores will be as follows if the set number of links is 3:
links that are 4 hops from the failed link score 2,
links that are 3 hops from the failed link score (3*score of link 4 hops away)+1=7
links that are 2 hops from the failed link score (3*score of link 3 hops away)+1=22
and links that are 1 hop away, i.e. connected to the sender or chooser
(3*score of link 2 hops away)+1=67
When this score is minimised a path will take a route further about the failure of the shortest route, although its length will be controlled. This can be achieved using either of the following two schemes or a combination of both with respect to the restoration algorithm presented herein.
Scheme 1
The chooser can choose a restoration route that has the least score. This will normally ensure that the routes via the candidate choosers are filled first since they will incur a lower score.
Scheme 2
An optimisation algorithm could be performed on paths either by the chooser or when the path has been established. Using the established path method means that any relinquished capacity cannot be immediately assigned to the chooser. Optimisations initiated by the chooser or candidate choosers will have the ability to inform the chooser.
The optimisation algorithm used to achieve scheme 2 must notify the chooser of any capacity it wishes to assign to the optimised path. The optimisation algorithm can determine the silent path by use of a search method between the restored path's end points. Once this point has been found a set of rules have to be followed to ensure compatibility with the restoration algorithm presented herein:
request the capacity from the chooser for the silent path,
establish the silent path,
relinquish the redundant capacity on the restoration path,
return an acknowledgement to the chooser to disclose success/failure and any relinquished capacity.
With reference to FIG. 18 the initial restoration route is chosen since the algorithm implements a shortest path first assignment scheme. It can be seen that the capacity on the links could be assigned to other paths or it could be moved to links further from the failed link, and especially from the sender and primary chooser. The scoring system shows how silent paths further from the failed link can be found by minimising the score given to each link.
The silent path establishment is dependent on the controlling scheme used for the overall assignment algorithm. The techniques described for Scheme 2 are suitable for the restoration algorithm presented herein. Alternation may need to be made to ensure compatibility with other restoration methods.
The original path and the path from the sender to chooser (primary or candidate) will, independently, contain no loops. It is the concatenation of the two that may cause loops to occur. FIGS. 19A, 19B and 19C show an example of how simple looping can occur. Particularly when operating at high network loads and when carrying delay-sensitive traffic it is advisable to relinquish all capacity contained in a loop and allow it to be reassigned to assist in restoring damaged paths.
The implementation of the loop elimination algorithm for this restoration algorithm has to consider the primary chooser as the database maintainer. The loop elimination algorithm must therefore converge to a solution and inform the candidate/primary choosers. Implementing the loop elimination in a distributed fashion will reduce the processing power needed at the chooser and helps in the design of a fail-safe solution. The algorithm is described in terms of VPs, although VC loop elimination is also achievable.
With reference to FIG. 20, there is shown a restored path such that A, B and R are the walks of all nodes on the paths es to s, ec to c and s to c respectively: where s and c are the sender and chooser nodes and es and ec are the endpoints of the original path on the sender and chooser sides respectively. Since the original path contains no loops then A and B have no node in common. Within the restored path, formed by the walk of nodes A⊕R⊕B, there may be loops (where ⊕ indicates juxtaposition). An elementary result from graph theory indicates that the walk A⊕R⊕B contains a loop-free path. Assume that this path is A′⊕R′⊕B′ where A′ is a sub-walk of A, with terminators es and s′, R′ is a sub-walk of R, with terminators ec and c′ and B′ is a sub-walk of B, with terminators s′ and c′. It is the function of the algorithm to find s′ and c′ such that the solution can be realised.
The algorithm must alter the path at the nodes s′ and c′ in a fail-safe manner i.e. the loop should be bypassed before being eliminated, and the chooser database should be updated only after spare capacity has actually been relinquished. It can be seen that, since only two possible independent intersections can exist, there can be a maximum of two link-disjoint loops within the restored path, one containing s′ and the other containing c′.
The algorithm is initiated by the chooser when the restoration path is assigned. From the theory above it can be seen that the intersection between the restoration path and the original path sections must be determined. To achieve this, the paths between the sender/chooser and their corresponding end-points, es, ec respectively, are marked to indicate the sets A, B and R. The three path sections are marked using a path type field within each node's routing table. To execute this process a single message, M, is used with which there are several fields: index value, path type, loop relinquish notification (rel), s′ detection (S′), c′ detection (C′) and a table of relinquished capacity.
A single indexed M is sent from the chooser along the VP to ec, with path type=B and S′, C′ and rel cleared, where each node in the path records the index and path type values for that VP. The message is reflected from ec to the chooser indicating identification of set B nodes. The identification of the nodes belonging to A and R can then proceed. The chooser sends M to the sender via the restoration route with path type=R, each node records the index and path type until the sender is reached. The process is repeated between the sender and es with path type=A. Now A, B and R have been identified, valid nodes for s′ and c′ need to be found and the VP cross connected. es reflects M with the S′ bit set and each node in A checks for an identical index recorded in R, i.e. an identically indexed path type R VP. If such a record exists then there is a crossing of paths and M is sent out on the restoration path in the direction of the chooser with the C′ bit set. From this point the first occurrence of an identically indexed path type B VP indicates the intersection node in between R and B, i.e. c′, consequently on receiving M the node checks for an identically indexed VP with path type B. If such a path is found then c′ has been found and a connection can be made between the VPs with types of B and R. The node records the c′ status and returns M, with S′ set and C′ cleared, towards the sender to locate s′. s′ is the first node to locate an identically indexed path of type A (note this may be the same node as c′), therefore locating the intersection between A and R, i.e. s′. The R type and A type VPs connect at s′ to complete the walk A′ is A′⊕R′⊕B′, i.e. a loop-less path.
Now that s′ and c′ have been identified and the path reduced, the loops can be relinquished. The chooser must be informed of the relinquished capacity therefore the loop about s′ must be relinquished first. This is accomplished by simply passing M towards the sender on the restoration route with the rel bit set. Each node relinquishes the incoming VP and records the information M's table. s′ terminates the process, clearing the rel bit when M has completed the loop, and passes M towards c′. At c′, M′ is created, M and M′ pass along the paths of type R and B respectively towards the chooser, with the rel bit set. The relinquished capacity is recorded and both messages terminate at the chooser. The chooser can include the data from M and M′ into the database.
Since loops are not deleted until the path is modified into a loop free form, the algorithm fails safe in the event of either M or M′ being lost. The chooser is only informed of the relinquished capacity when all the loops have been deleted, ensuring no dual capacity assignment. The method seeks loops containing the sender or the chooser, and thus will inevitably facilitate reuse of capacity in the most congested areas near the failed part.
FIGS. 21A and 21B summarise the principal steps in the process. At step 130 the chooser initiates loop elimination and sends a message to the original path end node still connected to the chooser. The messages returned to the chooser to locate the path type B segment. Next the message is sent from the chooser via the restoration path to the sender to locate the path type R segment. The third segment type A is identified by the message being sent from the sender via the original path to the end node still connected to the sender.
At step 134 the message is sent on from the end node via the original path until the path type A segment crosses the path type R segment. Then the first loop around the sender can be disconnected at step 135. At step 136 a second loop can be disconnected. At step 137 capacity is relinquished in the second loop by sending the message around the loop and recording the capacity relinquished. Finally, to enable the relinquished capacity to be reused, at step 138, a message is sent to the chooser. As there are two paths to the chooser, since it is in a loop, the message is duplicated, and the capacity relinquished in each half of the loop is recorded by the message and passed to the chooser.
FIG. 22 shows a state diagram for the message performing the loop elimination. In the state transition table below, for nodes passing the loop elimination message, the current and next state are indicated and for each transition, the message field received by the current node is shown, and the action to be taken by the current node is shown.
This is another distributed optimisation process. It may be used in conjunction with the other processes.
It can be seen from FIG. 23 how a restored link, containing no loops, can occupy unnecessary capacity on a critical link; provided capacity is available to move the path. Currently, the only methods to determine these paths require global restoration algorithms that are time consuming and require significantly more data processing. A locally controlled optimisation method will now be described, developed for high speed restoration techniques, to improve their restoration ability.
The optimisation process simply determines any reduction in the path using a single link. The following description of the basic process is a simplified example.
The algorithm is simple because it attempts to find a single link to replace multiple links occupied by the restored path. Therefore, the end-points of the single link must exist on the restored path. The optimisation process then becomes a simple test for nodes already on the path that are separated by a single link, where that single link is not on the path. This can be achieved by passing a single message from one end-point to the other. As the message passes each node on the path it marks the link with a unique ID. Then each node test to see if any of its neighbouring nodes (excluding the nodes known to be on the path) contain the same ID. If a node is found then it must exist on the same path and must be closer to the end-point with respect to the node(s) previous neighbour. The path can then be reduced, provided enough spare capacity is available over the requested link.
The present invention is particularly suitable for restoration of highly loaded networks using node complex spare capacity assignment. Previous algorithms required an average network utilisation of approximately 60%, giving approximately 40% spare capacity. Even then either preplanned capacity allocation would be needed to ensure sufficient spare capacity, or 100% restoration would not be achieved. However, many networks currently used have loadings of approximately 90%, to minimise costs. The invention is particularly applicable to improve restoration performance where approximately 10% spare capacity exists. The restoration uses distributed techniques, dynamically adaptive to changing network configurations. It can be used to assist in network planning.
If used in an ATM network using virtual paths, spare capacity can be increased by reducing the VPs down to their lowest guaranteed capacity level. Spare capacity can also be increased by reducing the load by prioritisation or a selective removal of traffic.
The capacity of the VPs is defined during connection set up. VPs may be divided into smaller VPs if a path through the network cannot be found for the VP as a whole. This processing can only take place at virtual connection (VC) switches, otherwise VPs must be restored as a whole. This is one advantage of ATM networks which can be exploited to achieve optimal results.
When implementing the restoration algorithm, every node within the network must be able to execute the functions of sender, primary chooser, candidate chooser or tandem node. The loop elimination algorithm must be processed in parallel with these functions. The function of primary chooser is the most processor and memory intensive since for the duration of the restoration it must consolidate and maintain a database of all paths from the sender to itself and every candidate chooser.
The average memory utilisation is dependent on the average degree of the network and can be calculated by using
ND=average network degree,
HC=limiting flood search hop count.
Note that (ND+1) in (2) is for candidate choosers and should be removed for single chooser case. Using candidate choosers increases the number of entries but, when candidates are not used, the significantly increased limiting hop count also requires more entries.
Typically, only 6 hops are required for the candidate choosers method with loop elimination. So, in a network with an average degree of 4, 20,280 entries are needed. For the original FCFS algorithm without candidate choosers up to 13 hops are required, needing 67 million entries.
Processing power is more difficult to estimate since it is very dependent on the design of the software. To gauge the processing ability, simulations were executed on a Sun SPARC Station 10 with 32 Mbytes of memory. For the loop elimination algorithm with added delay and candidate choosers the process took less than 1 second. This also includes the flooding process in determining the restoration paths and distributed processing for the loop elimination algorithm. The processing power not only depends on memory utilisation, but also on the network's spare capacity and its distribution. There should be no sufficient processing power to implement such algorithms in a modern switch.
The algorithms could allow for various levels of quality of service within the network. This means not only the creation of an ordered QoS for VPs, but assigning qualities to different links within the network. The VP routing would then be based on the VP length, link QoS and service QoS parameters. A technique called bumping could be introduced which removes paths with a lower priority and replaces them with paths of a higher priority.
Other variations will be apparent to a skilled man within the scope of the claims.
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
- Get Involved
- News
- Education & Events
- Publications & Research
- Marketplace
- Jobs
- Membership
- Accreditation
- About ACA
Background Check Standard
HR-4 - Staff Screening
Does the camp have written evidence of a policy in practice that requires screening for all camp staff with responsibility for or access to campers that includes:
*Parts A and B - MANDATORY
- Annually for all camp staff, paid, volunteer and contracted:
- A voluntary disclosure statement, and
- A check of the National Sex Offender Public Registry? YES NO
- For new camp staff 18 years and older, paid, volunteer and contracted, a criminal background check? YES NO
- For new camp staff, at least two reference checks and verification of previous work (including volunteer) history? YES NO
- For new camp staff, personal interview by the camp director or a designated representative? YES NO

subset: commoncrawl


text:
With Rep. Colleen Hanabusa, D-Hawaii, opting against a Senate bid and former Honolulu Mayor Mufi Hannemann possibly headed for a run in Hawaii's 2nd District, the possibility of a direct Democratic showdown between Rep. Mazie Hirono and former Rep. Ed Case is looking more likely.
Case, who has in the past found himself opposite the state's Democratic establishment looks like he is headed for a similar spot this cycle. The Honolulu Star Advertiser:
[Hawaii Democratic Party Chairman Dante] Carpenter has pledged that the party will remain neutral in the primary, but many establishment Democrats, labor leaders and progressives are aligning behind Hirono.
Labor leaders met privately Wednesday at the International Longshore and Warehouse Union's headquarters and reached consensus on what participants later described as a "solid front" for Hirono.
The former congressman has already ruffled some feathers by releasing the results of an internal poll showing him faring better than Hirono against former Gov. Linda Lingle, prompting pushback from the Democratic Senatorial Campaign Committee. Meanwhile, Hirono already has the support of EMILY's List, and is working to coalesce local establishment support.
Still, addressing concerns over electability may be more pressing for Hirono, who lost to Lingle in the 2002 governor's race after defeating Case in the primary. In which case, rallying early, widespread support within the party will be crucial for the 2nd District congresswoman. For Case, raising doubts over Hirono's ability to win the general is already an emerging strategic gambit.
Don't Miss Today's Top Stories
Rick, Executive Director for Policy
Concise coverage of everything I wish I had hours to read about."
Chuck, Graduate Student
The day's action in one quick read."
Stacy, Director of Communications
I find them informative and appreciate the daily news updates and enjoy the humor as well."
Richard, VP of Government Affairs
Chock full of usable information on today's issues. "
Michael, Executive Director


text:
The Monu Graphics Is one of the leading Manufacturer, Wholesaler, Importer and Exporter of machinery for making of Offset printing and Corrugated Machines in India.
The name Monu Graphics today is very popular with the Printing and corrugated packaging industry, not only in India, but also in many other countries. Monu Graphics is in this printing and packaging machinery manufacturing since 1994. Monu Graphics from the day one, emphasized to ensure quality products with Zero Error concept.
The growing number of orders and different approaches of each Printers and box maker to solving similar problems. Monu Graphics soon grew as an Exporter for Printing and Corrugated Packaging Machinery and achieved distinction of Exporting India's Best offset Printing machine and Corrugated Board an Carton making plant to Africa, UAE, Sri Lanka, Bangladesh, Nepal, Bhutan, Nigeria as well as many other countries.
Monu Graphics today is recognized as a symbol for quality, performance and excellence Continued relatively strong dedication to work and its commitment to serviceThe company has established a world wide reputation which is continued to the present.
Over the years Monu Graphics has developed "A SOLID REPUTATION" in India and abroad, for its Printing and Corrugated Machine. Monu Graphics has installed thousand of machines in India and abroad.
We are a prominent manufacturer, supplier and exporter of Corrugation Box Making Machine,Paper Cutting, Printing and Lamination Machines.
Our range comprises:
Over the years, we have managed to establish a formidable position for ourselves in this industry. Our efforts have helped us surpass the various other competitors of the market and made us overcome many challenges that have come in our pathway to success. Some of our strengths are outlined as follows:
Our team comprises highly dedicated professionals, who work round the clock to achieve the goals set by the organization. The team is committed towards fulfilling the specifications put forth by the customers and is capable of dealing with their customized demands and requirements. Our team is divided into many sections in accordance with the specific areas of expertise of the personnel. We provide regular training to our team members in order to ensure that they remain updated with the latest technological trends in the industry. Our team comprises following members:
Showcase Gallery
© Monu Graphics. All Rights Reserved (Terms of Use)
Developed and Managed by IndiaMART InterMESH Limited


text:
Explains the fundamentals of simple and complex programming in Perl 5.
Get the skills necessary to edit and install basic Perl and CGI scripts.
"For five days I have been excitedly moving from lesson to lesson, course to course. These are the finest and most reasonably priced tutorials I have ever found!" —David S.
more from our members »


text:
Canada Day is much more than our country's birthday. For as long as I can remember, it has been a great excuse to get out and enjoy some of the outstanding music emanating from the "Great White North." It seems like every city and town across Canada has a festival going on that you'd kill to be at; there are way too many to list, but it would appear that even newlyweds Will and Kate would agree with this. After all, they took in the annual extravaganza on Parliament Hill in Ottawa as part of their whirlwind Canadian tour.
In Toronto, we were treated to a mini-festival curated by The Tragically Hip, a band that had more or less become synonymous with the holiday in the 1990s. I have honestly lost track of the number of times I've seen "The Hip" headline a show on Canada Day. Seeing them again in 2011 took me back to music bashes they'd throw where The Hip would stack the lineup with cool, up-and-coming CANADIAN artists (again, too many to name). Years later, the tradition returned to Downsview Park with avant-garde hip-hopper Buck 65 (originally from Nova Scotia), Newfoundland indie rockers Hey Rosetta!, Toronto prodigies Broken Social Scene, and Weezer, from the, um, rugged hinterland of, um…Los Angeles?! I can just hear the Sesame Street-sounding song ringing in my head: "Which of these bands is not like the other…"
Buck 65 – 3:45 p.m.
He may not exactly look the part, but the only way to adequately describe Buck 65 is by calling him a one-man hip hop machine. Not only does he MC, he's his own DJ as well as dance crew, tweaking the turntable and busting out wicked and weird dance moves left, right, and center. Looking dapper in a light purple pinstripe suit and pink tie, complemented with a streetwise baseball cap, the man born Rich Terfry coolly and carefully delivers clear, well thought-out, and thoroughly entertaining lyrics. Unfortunately for him, the Canada Day crowd at Downsview Park wasn't the most "rap-preciative," although they did come alive somewhat for his hilarious "Zombie Delight," off his latest album 20 Odd Years. FYI, he also hosts the afternoon "Drive" show on CBC Radio 2.
Hey Rosetta! – 4:45 p.m.
Canadians from coast to coast know that if you want to throw a great party, you can't go wrong by inviting a Newfoundlander or two. Folks from the country's easternmost province seem to share an intangible vivacity that can liven up a room. Or, in this case, an entire park! And that's just what the six members of Hey Rosetta! did before they all flew back home as a group for bassist Josh Ward's wedding. It wasn't their salt of the earth-type personalities as much as their unique, St.John's-meets-cosmopolitan indie sound as heard on songs like "There's an Arc" and "Red Heart" that blew everyone away. Hey Rosetta! are carrying on Canada's fine indie tradition of incorporating unconventional rock band instruments like violin and the cello to create critically acclaimed albums such as Seeds, which was recently long listed for the 2011 Polaris Music Prize.
Broken Social Scene – 6:00 p.m.
Even though it was a hometown show, and the band that preceded them looks up to them sonically, Broken Social Scene seemed weirdly out-of-place at Downsview Park. It was if BSS were told to dial things back a little so as not to outshine anyone else. I think I "only" counted eight members on stage as opposed to of the parade of accompanying singers and musicians that is commonplace at their star-studded events. The fact that they only played 11 songs also added to the scaled-down feeling, but Kevin Drew, Brendan Canning, and Co. made the most of the time they were given, wasting little of their set by diving into tracks from 2010's masterful Forgiveness Rock Record like "Forced to Love" and "Texico Bitches". One of the highlights of the entire day had to be when Buck 65 returned with his turntable to make a guest spot on a surprise cover of "Funky Boss" by the Beastie Boys! They even raised the eyebrows of the urban bohemians sojourning from Queen Street West by playing their cool version of Modest Mouse's "The World at Large" before closing their set with a torrid rendering of instrumental gem "Meet Me in the Basement".
Weezer – 7:30 p.m.
I'm still scratching my head as to why Weezer were on this ostensibly all-Canadian lineup, but by the time they hit the stage and soccer jersey-wearing Rivers Cuomo shouted, "Alright, let's do this," the majority the crowd was so far gone drinking-wise that they may as well have been from Siberia. The radio host who introduced them even joked about giving them "a drunken Canadian welcome." To their credit, Weezer didn't rock the boat and make anyone throw up any more than they already had, sticking to the songs people are most familiar with. We only got the four big Blue Album hits ("Undone", "Say It Ain't So", "My Name Is Jonas", and "Buddy Holly"), and nothing from Pinkerton, not even "El Scorcho", but they did pull a rabbit of sorts out of their hat with their first-rate cover of Radiohead's "Paranoid Android", which they've only played a handful of times live. It should be noted that Cuomo looked like he could play midfield for Toronto FC the way he ran around Downsview Park. Admittedly, they sure could use his rawk energy!
The Tragically Hip – 9:00 p.m.
For more than 20 years, Canadians have been trying to explain The Tragically Hip to their counterparts south of the border. Without a doubt, The Hip are the biggest rock band our country has produced who have never really caught on in the States. But in Canada, they've pretty much been proclaimed as saints for a while now thanks to a string of outstanding albums in the '90s, punctuated by chaotic performances that have approached mythological status. I don't think I'm too far off in comparing them to Pearl Jam, another band whose best days are arguably in the past but who can still sell out a venue at the drop of a hat and put on a great show, creating an amazing, party-like atmosphere in the process. Think of The Hip as being like a big-time college football game: The music almost takes a backseat to the tailgating beforehand.
With his straw hat and handkerchief in hand, Gord Downie is as charismatic a frontman as they come, but as a live singer there are definitely times where he'd be better off letting his legion of Hip fans sing his songs for him. While he got progressively better during The Hip's nearly two hour, 22-song Canada Day set, he was prone to rambling, and there was more than one occasion where his voice wasn't in sync with the rest of the band. Much like Weezer before them, Downie and The Hip had a good idea of what the 25,000+ revelers huddled in Downsview Park wanted to hear, so they gave them a heavy dose of sing-along favo(u)rites, namely "Blow at High Dough", "Poets", "Bobcaygeon", and "Wheat Kings". As the 11 p.m. curfew approached and fireworks went off, the only other song that was audibly louder was our country's national anthem being belched by groups of frat boys. Wouldn't be a Canada Day without them!
Gallery by Gilles LeBlanc
[nggallery id=236]


text:
Hold down Control (PC) or Command (Mac) key + mouseclick to select more than one option
|Avg. Dinner Entrée
|Greater than $25
|$18.01 - $25
|$12.01 - $18
|$7.01 - $12
|Less than $7
Posted by Anonymous on 07/14/2006
If anything, the atmosphere was good, and the bathrooms were actually really great! However, I did /not/ care for the food or its price. I got the veggie BLT and found it really bland and it wasn't anything special. Just some soggy toasted bread and some uncooked tofu they chopped up and put sauce on. The service was extreemely slow on top of that. Really wanted to like Vynl a lot more, but I won't be returning.
Posted by Anonymous on 06/30/2006
Stumbled into Vynl my first day in New York after a bunch of flight delays and mess-ups. Was running late to a show, had no luggage, and felt like a mess. Vynl was like a tonic. The atmosphere is bright and fun. The food is refreshing and delicious. I had the tuna steak special and it was perfectly grilled. Though it's kind of a trendy place, there was absolutely NO attitude and the wait staff was so friendly. Try the watermelon lemonade--fantastic!
Posted by Monay on 05/22/2006
My husband and i love trying different cuisine so we went to Vynl. I love the atmosphere and the decor. The waiters are nice and helpful.I'm a vegetarian so he recommended TLT, tofu, lettuce and tomato sandwich. Believe me, its sooo good! Even my husband who's a carnivore admits that's its good. He had french toast and he likes it! The bathroom is something! Don't leave the place w/o going to their bathrooms! Two-thumbs up! I'm definitely coming back!
Posted by Jaclyn on 03/03/2006
My friend and I grabbed an early dinner at their new location after work one Thursday. The atmosphere and decor was adorable and the food was delicious. The salmon wrap and pad thai were great and we each took home leftovers for lunch the next day. Not your typical diner menu. Our waitress was so sweet, helpful and accommodating. When you go, you must take a peek in all four of the celebrity themed bathrooms. Too cute to skip any of them.
Posted by tar heel geo on 02/18/2006
Had lunch at Vnyl last week with friends who live near the place. It had a great retro feel without being too self-conscious and theatrical, the menu has a nice mix of American and Asian crossover dishes, and the food is better than you might expect. The album-cover menus brought back many vinyl memories and the celebrity rest rooms are not to be missed.
Posted by Mossimo on 02/08/2006
Food is great, excellent value. great atmosphere...there is usually a wait but who cares? if anything, a wait says there is something to wait for... best french toast...great mix of food...every variety from southern to thai. salads are great, too.
Posted by Anonymous on 02/07/2006
If you need delivery, they're very dependable and the food is generally very good. A cut above the standard diner/coffee shop.


text:
Rich Milkshakes at Gilles Frozen Custard in Milwaukee
Gilles has been serving frozen custard on the west side of Milwaukee since they opened in 1938—it was the first custard stand in the city. Today, they're still a favorite hangout of local high school students and busy families who want to grab a quick dinner before heading to Hart Park for a football game. My favorite is the Oreo shake. More


text:
Updated at: 10/12/2012 5:35 PM
By KEN THOMAS
(AP) WASHINGTON - President Barack Obama is meeting with three winners of a campaign contest and their guests for dinner at a restaurant in a popular Washington neighborhood.
Obama's motorcade took him to Smith Commons Dining Room and Public House on Friday in the city's H Street neighborhood, which has undergone redevelopment in recent years. He was having dinner with supporters from North Carolina, Ohio and Colorado, three battleground states in next month's election.
The dinner was part of the campaign's "Dinner with Barack" series offering meals with the president to boost online contributions for the 2012 campaign.
Obama's special dinner guests were Kimberley Cathey of Greensboro, N.C., and her husband, Ron; Mario Orosa of North Canton, Ohio, and his wife, Deidra; and Joe Laliberte of Colorado Springs, Colo., and his mother, Patti.
(Copyright 2012 by The Associated Press. All Rights Reserved.)


text:
Posts Tagged With: nose
The Goblin Shark
"Goblin sharks are strange deep sea sharks just like the Megamouth shark. This shark has one unique characteristic that no other shark has. Its head is shaped totally different then other normal sharks with one long snout, you will clearly see this on the pictures. The skin of the goblin shark is also remarkable pink-gray. &hellip Continue reading
Categories: Under the Sea Tags: goblin, nose, pink, shark 2 Comments


text:
Franklin, LA Retirement Care
Franklin Health Care Center
Franklin Health Care Center in Franklin, LA provides professional and caring retirement care and medical services at reasonable rates. We provide you with specialized and individualized care programs for your unique needs.
Learn More About Franklin Health Care Center:
- 24-hour nursing care
- Skilled nursing and psychological services
- Wound, hospice, and respite care
- Diabetes management
- Physician care - physical occupation, speech therapy, and short term rehabilitation
- Social, beauty / barber shop services, and secure unit
- Medicare, Medicaid, secure 20-bed alzheimer's unit, specialized diets, and individualized programs
Call Franklin Health Care Center today at 337-828-1918.
Contact Information


text:
April 7, 2009
WORCESTER, Mass. - Holy Cross junior Tiffany Reid (Poughkeepsie, N.Y.) has been named the Patriot League Female Track Performer of the Week for her performance on the track on Saturday, April 4 at the Wildcat Invitational in Durham, N.H. Reid led the Crusaders with a first place finish in the 100 and the 200.
Reid took first in the 100 with a New England Championship qualifying time of 12.27 seconds and then crossed the line first in the 200 with a New England qualifying time of 25.37 seconds. Reid remains unbeaten in both the 100 and 200 in the outdoor season. This is the first Patriot League weekly honor for Reid.
The Crusaders continue outdoor competition at the Northeastern Invitational hosted by Northeastern University in Dedham, Mass., on Saturday, April 11, starting at 10:00 a.m.


text:
Style #:
For further details regarding our pricavy policies including the use of cookies please click here. For instructions on how to enable cookies please click here. If you need assistance one of our customer service representatives at 1-800-850-7463 would be glad to help.
Price: $149.95
Sale Price: $0.00 Save 100%
Select Your Size
Then, Select Your Width
Additional Views
Chic design in velvety nubuck makes this women's shootie a fashion right choice for fall. An OrthoLite footbed adds morning to night cushioned comfort. With its leather harness strap, hardware clasp, and fabulous leawood heel, this dark brown nubuck shootie looks classy and current at the office and beyond.
No Customers Have Reviewed This Product Yet
Share your thoughts with other customers
Enter email address to join our mailing list


text:
Posted at: 03/12/2013 8:07 AM
By: The Associated Press
ALBUQUERQUE, N.M. (AP) - A Shiprock man will face a prison term after pleading guilty in federal court in Albuquerque to second-degree murder and attempted robbery charges under an agreement with prosecutors.
The U.S. Attorney's Office says 31-year-old Malcolm Altisi will be sentenced to 19 years in prison under the plea agreement. He pleaded guilty Monday.
According to prosecutors, Altisi admitted killing 25-year-old Rolan Joe when Joe confronted Altisi about a robbery attempt earlier that day. Another man awaits trial in the attempted robbery.
(Copyright 2013 The Associated Press. All rights reserved. This material may not be published, broadcast, rewritten or redistributed.)


text:
Adolfo's Dad
Toucher & Rich: A Call To Adolfo's Dad For Father's Day
It's Father's Day this weekend and Toucher & Rich thought it would be nice for Adolfo to give his dad a call.
Toucher and Rich Recap: 7/07/2010
Hour 1: Fred talks about closing on his new home and a bris for his son (the Jewish rite of circumcision performed on a male child on the eighth day of his life). Wallach notes […]
T&R Podcast: 7/7 Hour 4
On this hour of Toucher & Rich they talk to Tampa Bay Rays radio play-by-play announcer Dave Wills, they break some news to Adolfo's dad and you listened now discuss.


text:
Living in apartment or flat: solutions for practice?
View Single Post
The Black Page Dude
Senior Member
Join Date: Jul 2012
Posts: 237
Re: Living in apartment or flat: solutions for practice?
I have been doing my regular kit and putting mesh heads on them ... stuff your kick full of pillows and put a mesh head on it too.
When tensioned, the mesh heads do create a tone ... feels similar to a real head.
The added bonus is that you are playing at a lower volume and you would be shocked at the things you will pick up about your technique/dynamics ... I have opened a who new world with this set up. I even bought nylon brushes and use them.
First night I had them, I set up the kit and went to town at 3am .. (keep in mind I have no downstairs neighnor) .. not one single complaint.
I use rubber cymbals in place of my real ones .. not the best but a far cry from a practice pad!!!
The Black Page Dude
View Public Profile
Send a private message to The Black Page Dude
Visit The Black Page Dude's homepage!
Find all posts by The Black Page Dude


text:
Unidentified couple, ca. 1856
Physical Details: Photographic print : 1 item : tintype ; 7 x 8 cm.
Creator: unidentified photographer
Description: Portrait of an unidentified couple.
Forms part of: Mary, Xanthus, and Russell Smith family papers, 1793-1977, bulk 1826-1977
Citation: Unidentified couple, ca. 1856
Digital ID: 6498
- Portraits
View all Image Gallery items from the Mary, Xanthus, and Russell Smith family papers


text:
4612 Deer Ridge Blvd., Yukon
Price: $234,000 4 bd 2.5 ba 2c
7908 Debra
Price: $144,500 3 bd 2 ba 3c
Welcome to my home on the web! Whether you're a buyer looking for your dream home or a seller looking to sell for the best price possible, you've come to the right place.
Here you will find links to information to help you through the home buying and selling transaction. You can also view my listings or search the entire Oklahoma City Area Multi-List System (MLS).
Want more information on your neighborhood or another area you'd like to live in?
Then be sure to also visit my Homelog website at http://homes.musicaoltranza.net
With Homelog I can provide you with information on schools, churches, home sale prices and lots more. In fact, even if you are moving across country I can get you the information you need.
Enjoy your visit and be sure to contact me if I can help in any way with your real estate needs.
Template by Hoover
Web Design


text:
The PSS-I is a 17-item semi-structured interview that assesses the presence and severity of DSM-IV PTSD symptoms related to a single identified traumatic event in individuals with a known trauma history. The PSS-I takes about 20 minutes to administer and can be administered by lay interviewers trained to recognize the clinical picture in traumatized persons. Each item is assessed with a brief, single question. There are no probes or follow up questions.
Interviewees are asked about symptoms they have experienced in the "past two weeks." This time frame differs from the standard one month time frame of other measures. For each item, the interviewer assigns a rating to reflect a combination of frequency and severity (from O = "not at all" to 3 = "5 or more times per week/very much").
Have you had recurrent or intrusive distressing thoughts or recollections about [the event]?
0 = not at all
1 = Once per week or less/a little bit
2 = 2-4 times per week/somewhat
3 = 5 or more times per week/very much
Foa, E., Riggs, D., Dancu, C., & Rothbaum, B.(1993). Reliability and validity of a brief instrument for assessing post-traumatic stress disorder. Journal of Traumatic Stress, 6, 459-474. doi: 10.1007/BF00974317
Foa, E & Tolin, DF (2000). Comparison of the PTSD Symptom Scale-Interview Version and the Clinician-Administered PTSD Scale. Journal of Traumatic Stress, 13, 181-191. doi: 10.1023/A:1007781909213
Edna Foa, PhD
Department of Psychiatry
University of Pennsylvania
3535 Market Street 6th Floor
Philadelphia, PA 19104
Phone: (215) 746-3327
Email: email@example.com
Measures availability: Information on measures is available to everyone. However, the assessment tools themselves can only be distributed to qualified mental health professionals and researchers. We maintain measures developed by affiliated staff of the National Center for PTSD.


text:
Viewers: in countries Watching now:
In Motion: Principles of Motion Graphics, Ian Robinson shares the core concepts and techniques used to create real-world motion graphic elements in Apple Motion. The course starts with finding the initial inspiration for a project and then covers how to bring those ideas to life using the tools in Motion, including type treatments, filters, textures, and lighting. Two projects demonstrating how to animate a title sequence and how to assemble a graphics package are also included. Exercise files accompany the course.
Okay, so we are in the process of building a graphics package to match back to our title design. Now, the beautiful thing about putting all this work into this title design is the fact that you can then turn around and take the elements to create any subsequent parts of your graphics package. So, for a lower third, we just need a graphic that appears in the lower-left corner of our screen. Now, in order to do that, all we have to do is select our Open Texture here that is already set up at around two seconds.
We'll go ahead and take that and drag it up into its own new layer, so select the topmost layer in the layer hierarchy and click the Plus button. Now, grab the Open Textures and drag it all the way up to the top of your Timeline. Now, I like the font that was used in the title, so I'm just going to grab that as reference. Let's go ahead and drag that up into our top group in the Layers area, and now we can go and collapse everything else in the scene and select all of those groups and just click the Minus button.
Now, we have our animated lower third texture, and all we have to do is go open up the Replicator behavior that's controlling the sequence. So, with the Sequence behavior selected, go up to the Inspector, and in the Behaviors tab, let's look at what we have. And you can see we have two loops going through this animation, and for a lower third, I just only need one, so let's go ahead and change loop to one. And then we can go to the Replicator section. And if you look for the Origin, it's set to Center, and let's change that to Lower Left.
Now, you can see the Replicator is just going to build on from the lower-left. Now, I could tweak the size and the height and width and all that, but I'm just actually going to leave it perfectly alone and select or open Textures layer, and I'm just going to mask off this area down here. So, if you change the layer from a 3D layer to a 2D layer, we can go ahead and grab our Mask tool. So, grab the Square Mask, and let's just click and drag to draw a mask over these bottom squares. And when we let go, now you notice we have our initial design taking up the exact same amount of space as a typical lower third.
Now, I want to duplicate this and fill it with a color, so we have something a little more solid in the background. So let's just go ahead and select the Replicator layer and create a new layer here. So with our new layer, we can just grab the Create Rectangle tool and just draw a rectangle into that specific area, and you notice now the mask is applied. And we can just bring the Opacity of the fill down and let's change it to a warmer tone. So if we adjust our sliders-- we'll go to RGB sliders-- let's go ahead and get a nice orange tone in there.
That looks great, and I can just bring the Opacity down just a little bit more. And now what we need to do is add our text, so I'm going to go ahead and select our Group 2 layer here and just rename this "Lower 3rd Bar" and click the Plus button to create a new group layer here, and we'll just grab the Text tool and type a name. So let's go ahead and just say "Add Name Here" and press Enter on your keypad to set the title. Now, if we want to choose a font, let's go ahead and use this font as reference, so we have this Letter Gothic Standard, so let's go ahead and select the type we just selected and go back up here and change this to Letter Gothic.
And we'll crank up the size, just so we can see it a little better, and under Style, let's add a drop shadow. So if you scroll down, you can add a drop shadow, and now it's a little more eligible. Let's add a little blur on there. Perfect! And for the subtitle, all we have to do is just hold down Option and click and drag in the canvas, and that'll create a second layer where we can go back to the Format options and just change the size down a little bit, and here we can go ahead and say "Add Title Here." Now this font is a little thin, so as I bring this down in size, you just kind of have to be aware of that. Right now it should be okay, but sometimes you might want to bring the white levels down just a little bit, and just to make it a little more legible, I'm going to select both of the Type layers and just bring them up a little bit in our lower third.
Now I'm pretty sure the timing of this is only two seconds, because it's the intro graphic. Yeah, it just disappears. So let's select our Group 3 layer, and it looks like we just need to select a replicator and extend that out. So typically a lower third graphic is anywhere from four to seven seconds, depending upon how long people need to read it. Let's make ours five. Once we get our playhead there, you can go ahead and press O, and that's extended the length of our build. And if it's popped on passed on a mask, that's no problem; we just need to extend the length of the mask as well. Okay.
Now as you can see, we've created our lower third graphic. All we need to do is just time out the appearance of the type and the color bar, and we can do that with one animation. Let's go select the color bar. Go to Add Behavior > Basic Motion and we will just make a Fade In/Fade Out, because everything else is kind of busy in this scene. Now, we can have a fade in over 20 frames. That's perfect, and we could leave the fade-out at 20 frames. Let's just time it out to the lengths of our lower third. So move your playhead back here to five seconds, and make sure the rectangle is out at five seconds, and actually, let's just apply that to the entire layer down here.
So let's drag that up in the Timeline and apply our fade-in/fade-out to the entire layer. So now you see the lower third is fading in and then it fades out. So to apply the same fade-in/fade-out effect to our type, let's just hold down Option and drag that up to layer four. Now in order to make sure this works, again, select Group 4. Let's move our playhead to five seconds and trim the out point. And if we drag our playhead back here, now you'll notice we have them all fading in and fading out.
Now, obviously if you want to stagger anything, just trim the layer. The fade-in/fade-out will trim with it, but for now we've created a lower third from the title element that we created in the last chapter.
There are currently no FAQs about Motion: Principles of Motion Graphics.
Access exercise files from a button right under the course name.
Search within course videos and transcripts, and jump right to the results.
Remove icons showing you already watched videos if you want to start over.
Make the video wide, narrow, full-screen, or pop the player out of the page into its own window.
Click on text in the transcript to jump to that spot in the video. As the video plays, the relevant spot in the transcript will be highlighted.


text:
Thursday, May 3, 2007
From One Mother To Another...
Asha and Sandeepa have been arm twisting us to post something 'mothery' to honor Mother's Day. To get them off my back and because today is a Thursday in May, I thought I should post my take on motherhood right along with my intro..
[Warning: Keep Kleenex box handy. Either to sniffle in or to throw at the screen.]
Motherhood is...
..watching the world go by from 33 inches of height, through innocent eyes and a guiltless heart.
..learning to laugh, instead of yell, when your toddler empties a large box of dry beans on the floor and throws some on himself.
..crying over spilt milk. Breast milk. Pumped breast milk.
..discussing with your mom over an international phone call, the smell, color, texture and other such intricacies of your baby's poop. You know, just to make sure it is normal and all.
..making a milestone out of a mole. And then blogging about it.
..melting like candle, as a playful, loving father emerges out of your no-nonsense husband.
..when you wake up on day 3 and realize in horror that this is not a job that you can walk away from, or a project that you can hand off or a hobby that you can leave incomplete. It is a lifetime responsibility.
..believing that every wiggle and facial movement of your newborn is a Kodak moment.
..realizing later that even the best of Kodaks can never capture the essence of such moments the way your heart does.
..looking at your parents with renewed reverance; and wondering how on earth they raised THREE little monsters into human beings, while you're struggling with just one.
..about keeping promises. Whether it is 'As soon as I finish cooking, I will take you out' OR 'If you tear that book one more time, no more reading today'.
..about realizing that parenting is like a religion...there may be a 100 different ways to it, but the end goal is the same.
..when you change your opinion about Mother's Day. Of course, it is no longer just another Hallmark gimmick, and of course, you're expecting a celebration. After all, you now understand what it means to be a Mother.
Happy Mother's Day, comrades!
15 comments:
- Saheli said...
Welcome @ aka Kodi's mom!
Happy Mother's day to you too.
You have put a mother's emotions in such a wonderful way. I still remember 'crying over spilt pumped breast milk'. Thanks for the laughs!
- May 3, 2007 at 12:22 PM
- Praba said...
Welcome Kodi's Mom! Now that's a Klassic - what I call a quintessential @ style post!
Lovely, lovely! Enjoyed every bit of it!
Happy Mother's Day!
- May 3, 2007 at 12:29 PM
- Sandeepa said...
Ha ha @. Twist, Twist..We want SOME MORE GEMS FROM YOU :)
- May 3, 2007 at 12:29 PM
- Asha said...
Okay!!! So Kodi's mom is @!!!!!!Aha!!
Ok I am off your back and I am sniffing! NO! It's allergy girl!!;D
That was a hilarious list.My girl threw a whole box wheat flour over her head and all over the kitchen when she 2yrs old.I did laugh(usually flip) and took a photo!
Have a great Mother's day.Hugs:)
- May 3, 2007 at 12:53 PM
- swapna said...
welcome to dmc..
happy mother's day to u too.
What a lovely elaboration about motherhood.really a heart touching narration.thanks for these wonderful words.
- May 3, 2007 at 1:07 PM
- Dee said...
very good piece..I enjoyed reading it and had a smile all thru :)
- May 3, 2007 at 1:37 PM
- Tharini said...
Wow @!! That's just gorgeous. Motherhood IS a religion. Goosubumpy read!
- May 3, 2007 at 10:03 PM
- Gabdu's Mommy said...
Wonderful post !!! Crying over spilt milk - breast milk ,pumped milk ! Wow !! So true and waking up and realising you cannot pass the buck to anyone else like in a project ! Making a milestone out of a mole :-))) Too good
- May 4, 2007 at 4:54 AM
- mommyof2 said...
great post:-)
"realizing later that even the best of Kodaks can never capture the essence of such moments the way your heart does." so true:-)
- May 4, 2007 at 10:01 AM
- Sandeepa said...
Hey @ your sayings were so "quote worthy" would you mind if I save them on my private folders ?
- May 4, 2007 at 10:22 AM
- Kodi's Mom said...
All: thanks for the warm welcome, and for resonating with my 'mommyful' thoughts! I knew you guys would understand :)
Sandeepa: now, that's flattering, and why would I say no! sure, go ahead!
- May 4, 2007 at 12:45 PM
- Orchid said...
@...no wait Kodi's mom....that was awesome and i didn't expect any less from you:) and kept nodding my head down the list :)
happy mom's day to you too!
- May 4, 2007 at 8:44 PM
- noon said...
Hi @, Read your comment on my blog site late last night. Just read this post on motherhood after I posted a long one after a long long time. Nice post and so true...enjoyed it. Happy Mom's day to you!
- May 5, 2007 at 6:18 PM
- mummyjaan said...
Hi Kodi's mom. I am commenting rather late here....just read this today and it is *perfect*. I did not use the box of tissues. I laughed at some of the things you said, smiled at some, and agreed with it all.
- December 12, 2007 at 2:02 AM
- Sheela said...
am just catching up here at DMC - beautiful post capturing the wonderful things of modern mommyhood - esp., pumped breastmilk outweighing gold, and the fact that Kodak can't capture the way mommy's heart feels at those moments... you wrote it all so incredibly well!
- August 25, 2008 at 6:14 PM


text: Home > Camping + Hiking > Camp Accessories > First Aid & Personal Care > Z-Medica QuikClot Sport Silver Click Image To Enlarge Z-Medica QuikClot Sport Silver (0 Reviews) Rate This Product $24.00 - $40.00 Please Select Size 25g 50g Item Is In Stock Add To Cart Add To Wishlists Item number: quikclot Free Shipping On Orders Over $45* Learn More 60 Day Return Policy Learn More Have A Question? Contact Us You May Also Enjoy Vargo Titanium Sierra 750 Cup/Pot/Bowl $49.95 Vargo Titanium Pot Lifter $26.95 Vargo Alcohol Fuel Bottle, 8oz Capacity $2.50 Description Whether it is QuikClot® Sport or QuikClot® Sport Silver, you get an outstanding hemostatic agent that stops bleeding fast. With QuikClot® Sport there is the added antibacterial advantage of ionic silver. Silver acts to prevent the growth of bacteria and fungi which can be especially important if medical care is not immediately available. QuikClot® Sport Silver: For temporary external use to control bleeding Accelerates clotting - STOPS bleeding fast. Active antibacterial ingredient: Ionic Silver, 26 mg/g max Customer Reviews Be the first one to review this product!(requires login)