text:
A novel scheduling method is provided which may be used for rate-based scheduling (e.g., for scheduling flows at some assigned rates in a computer network) or for weighted fair sharing of a common resource (e.g., scheduling weighted jobs in a processor). The method is based on hierarchical application of Relative Error (RE) scheduling. The present method of a Hierarchical RE Scheme (HRE) with complexity O(log(N)), where N is the maximum number of jobs supported by the scheduler, is provided.
1. A method of scheduling data flows in a shared resource in a computer system, each of the data flows containing data cells, comprising the steps of:
receiving the data flows, each of the data flows containing an assigned flow rate and a relative error rate;
transmitting, each of the data flows such that each of the data flows is maintained at its assigned flow rate, comprising the steps of:
applying a relative error method to a virtual queue and to a root of a proportional tree structure in a memory to determine whether a real flow or a virtual flow should be scheduled;
sending an idle cell if the virtual queue is scheduled by the relative error method;
applying the relative error method to a root of a proportional tree in the memory to determine which branch of the proportional tree to schedule;
applying the relative error method to each of the two children of a node in the proportional tree which is chosen for transmission;
applying the relative error method to the two children such that a link capacity of a left child flow rate and a right child flow rate is equal to a flow rate of the parent.
2. The method of scheduling data flows in a shared resource in a computer system according to claim 1 wherein the relative error method comprises the step of:
transmitting, each of the data flows such that a sum of each of the predetermined flow rates of each of the data flows is less than an available bandwidth in the shared resource and a relative error is reduced between an actual scheduling time and an ideal scheduling time on a per cell basis comprising the steps of
determining whether a data flow and a cell of the data flow are available;
sending a null cell if the step of determining determines that said data flow and said cell of the data flow are unavailable;
sending said cell if the step of determining determines that said flow and said cell of the data flow are available;
incrementing said link cell slot;
setting the error term for said data flow at said link cell slot equal to the error term for the data flow at the link cell slot plus the rate of data flow relative to the total available bandwidth minus 1; and
for all rates of data flow not equal to the rate of flow, the error term for the data flow at the link cell slot is set equal to the error term for the flow at link cell slot plus a rate of flow relative to the total available bandwidth.
3. The method of scheduling a plurality of data flows in a shared resource in a computer system according to claim 2 wherein the step of scheduling comprises the steps of:
determining whether a data flow and a cell of the data flow are available;
sending a null cell if the step of determining determines that said data flow and said cell of the data flow are unavailable;
transmitting said cell if the step of determining determines that said data flow and said cell of the data flow are available;
incrementing said link cell slot;
setting an the error term for said data flow at said link cell slot equal to the error term for the data flow at the link cell slot plus the rate of data flow relative to the total available bandwidth minus 1; and
for all rates of data flow not equal to the rate of flow, the error term for the data flow at the link cell slot is set equal to the error term for the flow at link cell slot plus a rate of flow relative to the total available bandwidth.
4. A method of scheduling data flows in a shared resource in a computer system, each of the data flows containing data cells, comprising the steps of:
receiving the data flows, each of the data flows containing an assigned flow rate and a relative error rate;
transmitting, each of the data flows using a hierarchical relative error method such that the rate achieved by each of the data flows is maintained at its assigned rate of flow.
The present invention relates to an improved method and apparatus of rate-based scheduling and weighted fair sharing of a common resource. The problem of rate-based scheduling and weighted fair sharing arise in many different contexts and relate, for example, to the field of computer networks or to processor design. In general, this invention relates to any problem of scheduling jobs according to some rates in a broad context of environments and applications.
The problem of scheduling different jobs sharing a common resource occurs in many different contexts. In the most general terms it can be formulated as follows:
A single resource of some kind is shared by several entities indexed by integers i=1,2, . . . n. Every entity has a rate R(i) associated with it. The rates are assigned in such a way that sum of all R(i) does not exceed the capacity of the resource. For example, in computer networks the entity is an individual flow, and the shared resource may be a bottleneck communications link or a server capacity. The entities can be served in some service increments, one at a time. For example, the service increment for a network flow is one packet (or cell, in the ATM terminology). A device, called the Scheduler, needs to determine the order of service for different entities so that average service rate received by an entity is its assigned rate R(i). Aside from guaranteeing the long-term average rate, an important goal is to bound the discrepancy between the ideal and the actual service times of each individual service increment, i.e., each packet of each flow.
An example of an environment where such problem occurs is a processor which must schedule jobs competing for its cycles must. If all jobs are of equal importance, then it is desirable to provide all jobs an equal share of the processor capacity. If, however, the jobs have different importance, a possible strategy is to assign weights to all jobs corresponding to their importance, and provide each job a share of processor capacity proportional to the weight assigned to the jobs. In this case the desired service rates are determined by the weights of the flows. An alternative approach might be to assign rates to flows according to some other rule, which is specific to a particular policy and environment of the problem. For example, a rule might be to give some fixed allocation to high priority jobs and then share the remaining bandwidth among low priority jobs.
As mentioned earlier, another example when a similar problem might occur is in computer networks. For example, in ATM networks there is usually some rate associated with every flow traversing the network. This rate can be either the result of negotiation with the network at setup time, as for example for Constant Bit Rate (CBR) traffic, or can be the result of a traffic management feedback control scheme as is the case for Available Bit Rate (ABR) traffic. The set of rates can be either relatively static, as for long-term CBR flows, or may change quickly in response to congestion as in the case of ABR flows.
Even if the rates are not assigned explicitly, which is the case, for example, in many packet-switching networks, different flows may be of different importance. For example, one flow may be a compound flow of data from 1000 users, while another flow may represent a single user. It may be reasonable in such case to assign weights to different flows given their relative importance. If the total demand of flows exceeds the capacity of the bottleneck resource, typically a communication link, then a possible policy is to service the congested switch to all flows proportionally to their weights just as described earlier in the example of processor sharing. This effectively assigns rates to the flows.
In recent years, rate-based scheduling disciplines at the switching points in computer networks have received a lot of attention. A comprehensive review of such schemes can be found in Hui Zhang, Service Disciplines for Guaranteed Performance in Packet-Switching Networks, Proceedings IEEE, October 1995.
These schemes generally are applicable at network switches and can guarantee rates assigned to the flows.
The problem of scheduling of different flows in computer networks exists not only for the switches in the network, but in host adapters as well. For example, an adapter in an ATM network must schedule different flows each having a rate associated with it. Typically, the CBR flows are serviced at a higher priority according to a pre-computed schedule. One of the disadvantages of pre-computing the CBR schedule is that because it is computed without taking any non-CBR flows into account, the service of non-CBR flows may be unnecessarily adversely affected by the CBR bursts. Pre-computing the schedule also has the disadvantage that it is computationally expensive and is usually done in software on a slow time scale. While this may be acceptable for CBR flows which only need to perform this once a new connection is established, it is not feasible if many flows with frequently changing rates need to be scheduled.
Another scheme that is known for rate-based scheduling is the so-called Leaky Bucket , described for example in The ATM Forum Traffic Management Specification Version 4.0. The scheme requires a large amount of per flow state and therefore is prohibitive for a large number of flows.
Also frequently used is the so called "time-wheel" or "calendar queue" approach. An example of the calendar queue approach may be found in Brown., R, Calendar Queue: A fast O(1) priority queue implementation for the simulation even set problem, Communications of the ACM, vol. 31, pp. 1220-1227. Unlike the Leaky Bucket scheme, the calendar queues are simple to implement. Unfortunately, in general the calendar queue approach cannot guarantee that the long-term average rate achieved by the flow is equal to its assigned rate.
Therefore, it is desirable to design a scheme that can be used for rate-based scheduling of flows with dynamically changing rates at networks adapters and can guarantee the assigned rate of the flow.
It is also desirable that this scheme can be used for CBR-type traffic (also known as guaranteed service in packet switching networks) and ABR-type traffic (also known as adaptive traffic) simultaneously, as well as VBR traffic (variable bit rate) in ATM networks (also known as predictive traffic in packet switching networks). Finally it is desirable that this scheme can be used in a more general context of rate-based scheduling as described earlier.
The approaches described in the paper by Hui Zhang for switch scheduling are not easily applicable to the adapters. One of the reasons for that is that most of the scheduling schemes for the switches rely on packet arrival times to the switch to determine the scheduling order of packets from different flows. The notion of arrival time is not always well-specified for the adapter, since typically the adapter requests data from the application when it is ready to transmit its data.
What is needed is a general approach to rate scheduling that will work in many different environments. In particular, the new approach should work well for network adapters as well as for network switches.
The Relative Error (RE) Scheduling approach, is a scheme that is suitable for both network adapters and network switches. In the RE method the scheduler in a shared resource receives flows (jobs) containing a plurality of cells, each of the flows having a requested flow rate. The RE scheduler schedules each of the flows received such that the sum of each of the requested flow rates of each of the flows is less than an available bandwidth in the shared resource and a relative error, computed on a per cell basis is minimized between an actual scheduling time and an ideal scheduling time relative to the interval between cell transmissions at the assigned rate of flow. The steps of receiving and scheduling are then repeated. The description of the RE method is provided in Appendix B. However, the RE scheme requires that at each iteration of the method, the scheduler finds a maximum of and updates N entries, where N is the number of jobs (flows) to be scheduled. Especially in the context of high-speed communication networks, a scheduler may need to support thousands of flows, which makes it difficult to perform the computation of such scale within a short time available for making the scheduling decision. Thus, ways of reducing the computational complexity of the Relative Error Approach are desirable. One way of achieving this goal might be to restrict the supported rates to a discrete set of rates. However, a drawback of the discrete approach is that in order to significantly reduce the computational complexity, the granularity of the discrete rates must be significantly coarse. In turn, the coarse granularity may cause the underutilization of precious network resources. Therefore, other ways of reducing the computational complexity of the Relative Error approach are needed.
A method of scheduling a plurality of data flows in a shared resource in a computer system is provided, each of the data flows containing a plurality of data cells, including the steps of providing a scheduler in the shared resource, the scheduler having a plurality of link cell slots, initializing the scheduler to receive the plurality of data flows, receiving each of the plurality of a data flows in the scheduler, each of data flows containing an assigned flow rate and a relative error rate, scheduling, by the scheduler, each of the plurality of data flows such that each of the plurality of data flows is guaranteed its assigned flow rate, and repeating the steps of receiving and scheduling.
The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself, however, as well as features and advantages thereof, will be best understood by reference to the detailed description of specific embodiments, which follow, when read in conjunction with accompanying drawings, wherein:
FIG. 1 is a block diagram of an exemplary computer network in which the present invention may be used;
FIG. 2 is a block diagram of the main data structure used by the scheduler in accordance with the principles of the present invention;
FIG. 3 is an example of how storage requirements of the preferred embodiment may be reduced; and
FIG. 4 is a flow chart illustrating the preferred embodiment according to the present invention.
A preferred embodiment of the present invention will be described in the context of a computer network. Referring to FIG. 1, an exemplary network is shown to include four host nodes labeled as 10, 12, 14, and 16. Each of the host nodes is also shown to be shared by a number of users. Specifically, host node 10 has users labeled as 26 and 28, host node 12 has users labeled as 30 and 32, host node 14 has users labeled as 34 and 36, and host node 16 has users labeled as 38 and 40.
The exemplary network shown if FIG. 1 also includes two switches labeled as 42 and 44, respectively. Users communicate through the network with each other. For example, user 26 at host node 10 communicates with user 36 at host node 14, user 28 at host node 10 communicates with user 38 at host node 16, and user 30, user 32 at host node 12 communicate with user 38 and user 40 at host node 16, respectively.
The host nodes are shown connected to the switches, and the switches are shown connected to each other, by way of communication links. For example, link 18 connects host node 10 to switch 42, and switches 42 and 44 are connected by a link 20. Link 22 connects host node 12 to switch 42, link 24 connects switch 42 to host node 14, and link 25 connects switch 44 to host node 16. For convenience, we shall associate the flow of data from a source to a destination with the source of this flow. For example, we shall refer to flow from user 26 to user 36 as "flow of user 26."
Each of the host nodes 10, 12, 14, and 16 are shown to include a scheduler. Specifically, host node 10 has a scheduler 50, host node 12 has a scheduler 52, host node 14 has a scheduler 54, and host node 16 has a scheduler 56. Typically, the scheduler resides in a host adapter card (not shown).
Each of the switches 42 and 44 is also shown as having a scheduler associated with each link connected to the switch. For example, switch 42 contains a scheduler 58 associated with link 18. Scheduler 60 is associated with link 22, scheduler 62 is associated with link 24, and scheduler 64 is associated with link 20. Switch 44 contains a scheduler 66 associated with link 20, while scheduler 68 is associated with link 25.
Each of the schedulers shown in FIG. 1 is responsible for scheduling different flows which share common resources within the exemplary network. By way of example, we shall assume that a limiting (or "bottleneck") resource is a link's capacity. For example, assume that all links in the network are of capacity 155 Mbs except link 20, which has capacity of 50 Mbs. Therefore, user 28, user 30, and user 32 share a common bottlenecked link, i.e., link 20. To insure fairness, each of these users can therefore transmit data at one third of the capacity of link 20, i.e., at approximately rates R(2)=R(3)=R(4)=16.67 Mbs. User 26 can therefore transmit data at the full remaining bandwidth of link 18, i.e., at R(1)=138.33 Mbs. However, any other transmission rate assignment is possible, as long as the sum of rates of user 26 and user 28 does not exceed 155 Mbs, which is the capacity of link 18, and the sum of the rates of user 28, user 30, and user 32 does not exceed 50 Mbs, which is the capacity of link 20. The average service rate that the scheduler provides to each user must be equal to the rate assigned to these users. Thus, the scheduler 50 is responsible for scheduling flows submitted to host node 10 by user 26 and user 28 at rates R(1) and R(2) respectively.
The present invention may reside in any of the schedulers shown in FIG. 1 and relates to a method and apparatus of rate-based scheduling and weighted fair sharing of a common resource.
By way of example, an exemplary embodiment of the present invention will be described in the context of flows in the exemplary network of FIG. 1. However, the present invention is adapted to any computer application that requires a weighted fair rate service in scheduling computer jobs. The exemplary embodiment will use an Asynchronous Transfer Mode (ATM) network as an example. ATM networks use fixed length data packets generally referred to as ATM cells. However, as mentioned above, the present invention may be generalized to variable length data packets.
Using an ATM network as a specific example, the present invention may reside in an adapter (not shown), the adapter having a scheduler (i.e., 50, 52, 54, and 56) contained in each of the host nodes 10, 12, 14, and 16, and/or in the schedulers 58, 60, 66, 62, 64 and 68 of switches 42 and 44.
The present method and apparatus builds on the ideas of the RE scheme described in Appendix B. It describes a new scheme, referred to as Hierarchical Relative Error (HRE) Scheduling. A preferred embodiment of the HRE scheme is described below which has the complexity O(log N), where N is the number of flows supported by the scheduler. This is a significant improvement over the RE scheme which had to scan the state of all jobs/flows and therefore had complexity O(N). The HRE scheme, described fully below, does not restrict the supported rates - it can operate on arbitrary assigned rates. Another feature of the HRE scheme is that, unlike the RE scheme, which operated on the relative rates, the preferred embodiment described below allows both the RE scheme and the HRE scheme to operate in absolute rates. This eliminates the necessity of rate conversion completely. The HRE scheme provides strict rate/fairness guarantees, as fully described below.
The exemplary preferred embodiment, described fully below, will be illustrated in the context of scheduling flows in ATM-like networks with fixed cell size. It is assumed that the flows which are being scheduled are assigned some rates. The rates can either be determined by the fair sharing of the resource in proportion to some assigned weights, or can be assigned as a result of some negotiation with the network. Once the rates have been assigned, the goal of the HRE scheduler is to ensure that all flows achieve their rates, and that the difference between the ideal and the actual transmission times of each cell is well-bounded.
Referring now to FIG. 2, a basic data structure used by a scheduler using the HRE scheme is shown. The data structure consists of a tree 60, referred to as the "Proportional Tree" (PT), and optionally an isolated node called a "Virtual Queue" (VQ) 62. In FIG. 2 the tree 60 is chosen to be binary. However, in general any shape of the tree 60 can be used. The worst case bounds on the discrepancy between the actual and the ideal transmission time of each cell depend on the choice of the tree shape. For simplicity, we shall assume that the tree 60 is binary in the following description.
Each node j of the tree 60, labelled generally as 64, has two variables associated with it: R(j) and D(j). The leaves of the tree 60 correspond to the flows being scheduled by the scheduler, while the VQ 62 corresponds to the "virtual flow" of the RE scheme as described in appendix B. For any leaf j of the tree 60 R(j) is simply the assigned rate of flow j. For the Virtual Queue 62 R(VQ)=max(0, C-ΣR(j)), where the sum is over all leaves of the tree 60. For any other node in the tree 60, R(parent)=R(left-- child)+R(right-- child). Variables D(j) are analogous to the relative error terms of the RE scheme, and satisfy the condition that D(right-- sibling)+D(left-- sibling)=0. In addition, D(VQ)+D(RPT)=0 as well, where RPT is the root of the tree 60. Note that R(RPT) is simply the sum of all rates of all real flows. If the VQ 62 is used and the sum of assigned rates of all flows does not exceed the link bandwidth, then the HRE scheme guarantees all flows their assigned rates. If the VQ 62 is not used, or the sum of assigned rates exceeds the link bandwidth, then the assigned rates of all flows are automatically scaled proportionally to link bandwidth and all flows are guaranteed its scaled assigned rate.
The concept of the HRE scheme is to determine the scheduling order of flows by applying the RE scheme hierarchically as follows. At each step the HRE scheduler uses the simple RE scheme applied to VQ 62 and RPT to determine whether a "real" flow or "virtual" flow should be scheduled. If VQ 62 is scheduled by the RE scheme, an idle cell is sent. Otherwise, the HRE scheduler applies the RE scheme to the two children of RPT to determine which branch of the tree to schedule. Once the branch is chosen, the HRE scheduler descends one level and applies the RE scheme to the children of the node chosen at the previous level . The process is repeated at each level of the tree, until a leaf is chosen for transmission. When the HRE scheduler arbitrates between any two siblings j, k, it applies the RE scheme to the two siblings as if j,k were two flows on a link of capacity R(j)+R(k)=R(Parent(j)). One of the main advantages of the HRE scheduler over the RE scheduler is that while RE updated state variables for all N flows at each iteration, the HRE looks at and updates only the state variables of one branch of the tree, which is log N for the binary tree.
As mentioned above, another difference from the RE scheme is that instead of using the relative rates at each application of the RE scheme, the actual rates R(j) of flows j are used for the leaves. (For any non-leaf node j in the PT, the variable R(j) corresponds to the sum of rates of all leaves which are descendants of node j.)
As mentioned earlier, the principle of the operation of the HRE scheme does not depend on whether the tree 60 is binary or n-ary, and whether the length of the branches are balanced or not. However, the longer the longest branch of the tree, the larger the worst case error bound can be guaranteed. One possible implementation of the tree 62 is to build a balanced binary tree for the maximum number of flows N supported by the scheduler. Flows which are not active have zero rates assigned to them. Given N, the tree can be built at initialization, for example, as illustrated in Data Structures, by S. Lipschuts, McGraw Hill (1986).
The following pseudocode, which sets out the invention in detail, assumes that the tree 60 is binary and is pre-built at initialization, so that leaf i corresponds to flow I. The pseudocode is only one preferred embodiment.
The following elementary operations on the tree are assumed supported by the data structure:
______________________________________Parent(j)--returns the parent node of node jSibling(j)--returns the sibling of node j /* Note: Sibling(VQ) = RPT */ Lchild(j)--returns left child of node j Rchild(j)--returns right child of node j______________________________________
Index j is used interchangeably with G(j) to denote the corresponding node in the data structure. If flow i is not activated, it is assumed that R(i)=0.
______________________________________Initialization:for all nodes kR(k)=0;D(k) = 0;Add-- flow(i, R(i)): /* add flow i with assigned rate R(i) */find leaf i corresponding to flow i set R(i) corresponding to the assigned rate of the flow/* go up Proportional Tree until reach the root PTR updating R(j),D(j) */j = i;while (j ≠ RPT)R(Parent(j) = R(Parent(j) + R(i)Adjust-- D(j);j = Parent(j);}if(VQ used){R(VQ) = max(0, R(VQ) - R(i));Adjust-- D(VQ);}Delete-- flow(i, R(i)):find leaf i corresponding to flow i R(i) = 0;/* go up Proportional Tree until reach the root PTR updating R(j),D(j) */j = i;while (j ≠ RPT){R(Parent(j)) = R(Parent(j) )-R(i); Adjust-- D(j);}if(VQ is used){R(VQ) = R(VQ) + R(i);Adjust-- D(VQ);}HRE-- Scheduler:do forever{/* if VQ used and if the link is not fully utilized and it is the turnof VQ to send */if((VQ is used) && (R(VQ) > 0) && (D(VQ) > 0))send idle cell;D(VQ) = D(VQ) + R(VQ) - C; /* C is the linkbandwidth */D(RPT) = D(RP7) + R(RPT);else /* if here, PT must be scheduled */{if(VQ is used){ D(VQ) = D(VQ) + R(VQ); D(RPT) = D(RPT) + R(RPT) - C;}/* descend the tree */j = RPT;while j |= leaf){ j = Lchild(j); if ((R(j) > 0) && (D(j) > 0) /* if node j active and itis its turn */{ D(j) = D(j) + R(j) - R(Parent(j)); D(Sibling(j)) = D(Sibling(j)) + R(Sibling(j)); } else { D(j) = D(j) + R(j); D(Sibling(j)) = D(Sibling(j)) + R(Sibling(j)) -R(Parent(j)); j = Sibling(j); if (R(j) = = 0) /* sibling's turn, but sibling notactive */ { send idle cell; break; } { /* here j points to the node which we have justscheduled */ if (j is leaf) { if (flow j corresponding to this leaf has cell tosend) send cell of j; else send idle cell; }}}}Rate-- Change (i, Rnew(i)):find leaf i corresponding to flow iRnew = Rnew(i);Rold = R(i);R(i) = Rnew(i);j = i; while (j ≠ RPT){R(j) = Rnew(j);R(Parent(j)) = R(Parent(j)) - Rold + Rnew;Adjust-- D(j);j = Parent(j);}/* now update D(RPT) and D(VQ) */if (VQ is used){R(VQ) = max(0, R(VQ) - Rold (i) + Rnew (1));Adjust-- D(VQ);}Adjust-- D(j) /* this function adjusts D(j), D(Sibling(j) so thatD(j) +D(Sibling(j) = 0 and R(j) - R(Parent(j)) ≦ D(j) ≦ R(j) issatisfied afterthe rate change */if (D(j) > R(j))D(j) = R(j);if(D(j) > R(j) - R(Parent(j)D(j) = R(j) - R(Parent(j);D(Sibling(j)) = -D(j);______________________________________
The preferred embodiment, illustrated by the above detailed pseudocode, has the following property, referred to herein as Property 1:
given assigned rates R(j) and the initial conditions of variables D(j) for all nodes j satisfying R(j)-R(Parent(j))≦D(j)≦R(Parent(j)),
the HRE scheme provides the following guarantees:
1) if the virtual queue VQ is used and the sum of all assigned rates R(j) does not exceed the link bandwidth then any flow j achieves rate r(j)=R(j)
2) if the virtual queue VQ is not used, or if the sum of all rates assigned R(j) exceeds the capacity of the link, then any flow then all flows achieve rates r(j) proportionally scaled up or down to the available link bandwidth so that r(i)/r(j)=R(i)/R(j) for any flows i,j and Σr(i)=C.
3) the difference between actual time A(j, n) and the ideal time B(j,n) of the n-th scheduling opportunity of flow j at its achieved rate r(j) is bounded by
T(j)+cell-- time(C)≦A(j)-B(j)≦T(j)(logN-1) if the Virtual Queue is not used or if R(VQ)=0 and
T(j)+cell-- time(C)≦A(j)-B(j)≦T(j)(logN)) if the VQ is used and R(VQ)>0
Here T(j)=cell-- length/r(j) is the ideal inter-cell interval at the achieved rate r(j) of flow, and cell-- time(C) is the time to transmit one cell at link rate C.
Application to Resource Sharino Between Classes of Users
The present invention, i.e., the HRE scheme, naturally extends to sharing the resource (e.g. link or processor capacity) between classes of users. For example, in the context of the network traffic, flows can be grouped according to the requested quality of service. Suppose there are K classes of with some rates assigned to them according to some rule. Then the HRE scheduler can be applied to the classes exactly in the same way as it is applied to the individual users as described above. Scheduling inside each class can be either class-specific, or can use the HRE scheduler as well. As will be shown below, the HRE scheme guarantees that each entity it is applied to (whether it is an individual user (job, flow) or a class uniting lower-level entities) is guaranteed the rate assigned to this entity, or proportionally scaled to the available resource capacity.
Although HRE provides strict service guarantees described by Property 1 to all classes, as described it does not reallocate service opportunities unused by one class (because it had no cell available when scheduled) to other classes. If all classes require these guarantees, then this behavior is necessary. However, in practice some of the classes may tolerate large discrepancies from the ideal transmission patterns, or even not require any guarantees at all. An example of such class of service is the Unspecified Bit Rate (UBR) service in the ATM networks. In packet-switching networks this type of service is frequently referred to as elastic service. By way of example, we will use UBR as a class that does not require guarantees given by Property 1 and that would benefit from using all available scheduling opportunities. A simple modification to the HRE scheduler achieves this goal without violating any guarantees for other classes - simply send a UBR cell any time the HRE scheduler would send an idle cell. Note that all variables are modified as if an idle cell were actually sent. This ensures that cell other (guaranteed) classes still have all the guarantees of Property 1, while UBR may get more service than is guaranteed.
An optimization in the amount of storage required for the HRE Scheme
The preferred embodiment has so far assumed that at each nodej two variables D(j) and R(j) are stored and updated. However, it turns out that the storage requirements may be substantially reduced. It can be shown that the scheme always preserves two invariants:
Invariant 1: For any two children and their parent R(parent)=R(left child)+R(right child)
Invariant 2: For any two siblings of the binary tree D(right sibling)+D(left-- sibling)=0.
The proof of these invariants are in Appendix A. These invariants allow to store D(j) and R(j) for only one of any two siblings (e.g. the left sibling of each pair of siblings, as for example in the example shown in FIG. 3) .
Referring now to FIG. 3, the black nodes store the variables of D(j), R(j), while the white nodes do not. For example, consider node 112. Since 112 is a right sibling (colored white), its variables D(112), R(112) are not stored. However, they can be computed from the "black" node information as
Thus, using Invariants 1,2 the storage requirements of the HRE scheme can be reduced by the factor of 2, and the updates of one variables of one of each two siblings can be eliminated. The modifications of the pseudocode to accommodate these changes are straightforward.
The proof of Property 1 is shown in Appendix A for completeness.
Referring now to FIG. 4, a flow chart of the preferred embodiment of the present invention is illustrated. At step 200, the scheduler executes an initialization. During this initialization, for all nodes k, the flow rate R(k) and the relative error D(k) are set equal to zero. At step, 204, scheduling begins. At step 204, the scheduler checks to determine whether the Virtual Queue (VQ) is used and the flow rate R(VQ) is greater than zero and the relative error rate D(VQ) is greater than zero. If so, at step 206, the scheduler sends an idle cell, sets the value of the relative error rate D(VQ) to D(VQ) plus R(VQ) plus the link capacity C, and returns to step 204.
If not, at step 208, the schedule determines whether VQ is used. If so, at step 210 D(VQ) is set equal to D(VQ)+R(j)-R(Parent(j)), and then proceeds to step 212 wherej is set equal to RPT (i.e., the root of the tree). At step 216 the scheduler then determines at step 218 whether R(j) is greater than zero and D(j) is greater than zero. If so, at step 220 D(j) is set equal to D(j) plus R(j) minus R(Parent(j)), D(Sibling(j)) is set equal to D(Sibling(j)) plus R(Sibling(j)), and the process goes to step 228. If not, at step 222 D(j) is set equal to D(j) plus R(j), D(Sibling(j)) is set equal to D(Sibling(j)) plus R(Sibling(j)), and j is set equal to Sibling(j). The process then continues to step 224, where the scheduler determines whether R(j) is equal to zero. If so, at step 226 the scheduler sends an idle cell and then returns to step 202. If not, at step 228 the scheduler determines whether j is a leaf. If not, the process returns to step 202. If so, at step 230 the scheduler determines whether flow j corresponding to this leaf has a cell to send. If not, at step 234 an idle cell is sent and the process returns to step 202. If so, at step 232 a cell of j is sent and the process returns to step 202.
Having described a preferred embodiment of the invention, it will now become apparent to those skilled in the art that other embodiments incorporating its concepts may be provided. It is felt therefore, that this invention should not be limited to the disclosed invention, but should be limited only by the spirit and scope of the appended claims.
APPENDIX A__________________________________________________________________________Property 1 will be proved using several Lemmas given below.For simplicity, we shall assume that variables D(j), R(j) are stored andupdated for each node.First, we prove the invariants given at the end of the previous section.Note first that Invariant 1 holds simply by the construction of the tree:the rate of parent is always thesum of the rates of the two children.Proof of Invariant 2:Initially, D(j) + D(Sibling(j) = 0) for any node j. When the HREscheduler schedules any node j, D(j)and D(Sibling(j)) are updated asD(j) = D(j) + R(j) - R(Parent(j))D(Sibling(j)) = D(Sibling(j)) + R(Sibling(j))By Invariant 1, R(Parent(j)) = R(j) + R(Sibling(j). Therefore, each timeD(j) or D(Sibling(j)) is updated.their sum is incremented by R(j) + R(Sibling(j)) - R(Parent(j)) = 0, i.e.remains unchanged.Thus HRE-- Scheduler preserves the invariant. Note finally, thatAdd-- Flow, Delete-- Flow andChange-- Ratealso preserve this invariant.Lemma 1 If initially for all jR(j) - R(Parent(j)) ≦ D(j) ≦ R(j) (1)and rates do not change, then (1) holds for all j at any iteration of theHRE algorithm.Proof of Lemma 1Suppose Lemma 1 holds at some iteration for all j. Then, by Invariant 2D(j) + D(Sibling(j)) = 0.Therefore, we can assume without loss of generality that D(j) ≧ 0,D(Sibling(j)) ≦ 0. If at the nextiteration of the algorithm nodes j, Sibling(j) are not "visited" by theHRE scheduler, the values of D(j),D(Sibling(j)) are unchanged. If the scheduler "visits" these nodes, thennode j will be chosen (becauseD(j) ≧ 0 by assumption). Therefore Dnew(j) = D(j) + R(j) -R(Parent(j)), or, using Invariant 1,Dnew(j) =D(j) + R(j) - R(j) - R(Sibling(j)) = D(j) - R(Sibling(j)).Therefore,Dnew(j) = D(j) - R(Sibling(j)) ≦ D(j) ≦ R(j)because R(Sibling(j)) ≦ 0 andDnew(j) = D(j) + R(j) - R(Parent(j)) ≧ R(j) - R(Parent(j))because D(j) > 0. Therefore, (1) holds for Dnew(j) as well.Similarly, since we assumed that (1) is statisfied at the previousiterationDnew(Sibling(j)) = D(Sibling(j)) + R(Sibling(j)) ≧≧ R(Sibling(j)) - R(Parent(Sibling(j)) + R(Sibling(j)) ≧R(Sibling(j)) - R(Parent(Sibling(j))andDnew(Sibling(j)) = D(Sibling(j)) + R(Sibling(j)) ≦ R(Sibling(j))because D(Sibling(j)) ≦ 0Hence, (1) holds for Sibling(j)) as well.Therefore, by induction HRE-- Scheduler preserves the inequalities(1) for al1 nodes.Finally, note that Add-- flow, Delete-- flow and Change--Rate explicitly ensure that (1) holds after any ratechange aswell. Since initially D(j) = 0 for all j, it means that (1) holdsthroughout the execution of the algorithm.Lemma 2 Consider any two nodes j, Sibling(j) in the PT. Assume that therates of flows are unchangedand that initial conditions are variables D(j) and D(Sibling(j)) satisfyInvariant 2 for all j.Denote by Dn(k) the value of D(k) after the n-th update. Denote D0(k) theinitial conditions on variableD(k). Consider the non-heirarchical RE scheme with relative errorvariables (k, n) operating on twoflows with rates R(j), R(Sibling(j)) sharing a link of bandwidthR(Parent(j)) = R(j) + R(Sibling(j)) withinitial conditions (k, 0) = D0(k)/R(Parent(k)). Then for k = j,Sibling(j), Dn(k) = R(Parent(k))(k).Lemma 2 says that the sequence of the values of variables D(j) obtainedby the HRE for any node j isindistinguishable from the values of variables of the RE scheme operatingon j and its sibling in isolation,scaled by the factor R(j) + R(Sibling(j)).Proof of Lemma 2The values of (k) for the non-hierarchical RE scheme operating on thelink of capacityR(Parent(j)) = R(j) + R(Sibling(j)) are updated as follows:(k, n) = (k) + w(k) - 1 if flow k scheduled (2)(k, n) = (k) + w(k) otherwise (3)where w(k) = R(k)/R(Parent(j)) (see Appendix B for the description of theRE-- Scheduler, also fullydescribed in copending application PD96-0071)Multiplying both sides of (2), (3) by R(Parent(k)) and denoting Dn(k) =R(Parent(k)) (k, n), we obtainthe update formulas for Dn(k) as:D(n) (k) = Dn(k) + R(k) - R(Parent(k)) if flow k scheduled (4)D(n) (k) = Dn(k) + R(k) otherwise (5)which are the update formulas given by the HRE-- Scheduler. QED.Lemma 3. Consider the non-hierarchical RE scheme. Consider two flows j, kwith rates R(j), R(k)operating on a link of capacity C = R(j) + R(k). Assume that at time zerothe initial conditions on thevariables (j,n) satisfy Invariant 2. Denote A(j,m) the beginning of theactual transmission time of the m-th cell of flow j under the RE scheduler. Denote B(m,j) the beginning ofthe "ideal" transmission time ofthe m-th cell of flow j assuming that B(j,0) = -Dinit(j)/T(j), where T(j)= cell-- len/R(j). Then for all m-T(j) + cell-- time(C) ≦ A(j,m) - B(j,m) ≦ cell--time(C) (6)where cell-- time(C) is the time of transmission of one cell overthe link of capacity C.Proof of Lemma 3.This Lemma is a special case of Property 1 of Atty. Dkt. No. PD96-0071.Lemmas 1 and 2 imply that for the non-hierarchical RE scheme operating ononly two flows j,k sharing alink of capacity C = R(j) + R(k),R(j)/C - 1 ≦ (j,n) ≦ R(j)/C (7)Noting that R(j)/C = cell-- time(C)/T(j), and recalling that for thecell scheduled by the non-hierarchicalRE Scheduler at some link cell slot(j,n) = (A(j,m) - B(j,m))/T(j) by definition, (6) can be immediatelyobtained from (7). QED.Lemma 4. The non-hierarchical RE scheme with iterative equationsD(j, n + 1) = D(j,n) + R(j) - ΣR(j) if flow j scheduled (8)D(j, n + 1) = D(j,n) + R(j) otherwise (9)operating on flows j = 1, 2, . . . k. with rates R(j) on the link ofcapacity C and initial conditions Dinit(j) isequivalent to the operation of the non-hierarchical RE scheme withiterative equations (2), (3) operatingon flows j with rates r(j) = R(j)C/ΣR(j) with initial conditionsinit(j) = Dinit(j)/ΣR(j) on the link ofcapacity C.That is, equations (8), (9) can be used in the non-hierarchical RE schemeto provide on-line proportionalscaling of the rates up or down to the available bandwidth of the linkwithout converting the absolute ratesto the relative rates as in Atty. Dkt. Nos. PD96-0071 and PD96-0076.Proof of Lemma 4.Consider the non-hierarchical RE scheme with its relative errorvariablesdenoted (j) to distinguish them from variables D(j) in (8),(9). Theupdate formulas for (j)(j) = (j) + w(j) - 1 if flow j scheduled(j) = (j) + w(j) otherwiseHere w(j) = r(j)/C, where r(j) = R(j)C/ΣR(j) are the assigned ratesR(j) proportionally scaled up or downto achieve Σr(j) = C. Therefore, the update formulas can berewritten as(j) = (j) + R(j)/ΣR(j) - 1 if flow j scheduled(j) = (j) + R(j)/ΣR(j) otherwiseMultiplying both sides by ΣR(j) and denoting D(j) = (j) ΣR(j)we immediately obtain (8),(9).Therefore, by operation of the algorithm the same scheduling decisionswill be made in both cases, QED.Lemma 4 allows to use unconverted rates for the RE and the HREscheduler.Proof of Property 1 of the HRE Scheme.Consider first when R(VQ) = 0 (or VQ is not used), and that ΣR(j) =C. This case corresponds to pre-scaled rates , and PTR is scheduled every link cell slot cell--time(C). Without loss of generality assumethat the initial time is zero.Let Dinit(j) be the initial conditions on D(j), satisfying (1) for anynode j ≠ PTR. At the beginning of everylink cell slot the HRE-- Scheduler traverses one of the treebranches from root to leaf, making a decision ateach level m by applying the non-hierarchical RE scheduler to the twosiblings at this level. We shall saythat a scheduling opportunity of node j occurs when node j is chosen bythe scheduler. Let A (j,n) denotethe actual time of the beginning of the n-th scheduling opportunity ofnode j. Let B (j,n) denote the idealtime of the beginning of the n-th scheduling opportunity of node j atrate R(j). Then B(j,n) = B(j,0) +nT(j), where T(j) = cell-- len/R(j) and) B(j,0) is chosen so thatB(j,0) = -Dinit(j)T(j). That is, B(j,0) is thetime the very first scheduling opportunity should have occurred toaccumulate relative error Dinit(j) bytime zero.Recall that by Lemmas 2 and 4 the sequence of scheduling decisions HREscheme on arbitrating betweenany pair of siblings j, Sibling (j) is indistinguishable from thesequence of scheduling decisions of the non-hierarchical RE scheme operating on j, Sibling (j) in on a link ofcapacity R(Parent(j)). Although thesequences of decisions are equivalent, the actual time of decisions maybe different for the HRE schemecompared to the non-hierarchical RE scheme operating on the two nodes inisolation. Note, however, thatthese times would be identical if Parent(j) were scheduled exactly at itsideal times B(Parent(j),n) =B(Parent(j), 0) + nT(Parent(j)).Denote (j,n) the time of what the actual n-th scheduling opportunity ofnode j should have been, ifParent(j) were always scheduled at its ideal time, and denote A(j,n) theactual time of the n-th schedulingopportunity of j under the HRE scheme. Then, A(j,n) differs from (j,n) bythe absolute error of the timeof corresponding scheduling opportunity of Parent(j) compared to theparent's ideal scheduling time. Thatis, denoting by p the sequence number of the scheduling opportunity ofParent(j) corresponding to the n-thscheduling opportunity of j, we can writeA(j,n) = (j,n) + A(Parent(j),p) - B(parent(j),p) (10)By Lemma 3 for any j ≠ PTR, any n, and p corresponding to n-T(j) + cell-- time(R(Parent(j)) ≦ (j,n) - B(j,n) ≦cell-- time(R(Parent(j)) (11)adding A(Parent(j),p) - B(Parent(j),p) to all sides of (11) andsubstituting (10) into (11) we get-T(j) + cell-- time(R(Parent(j)) + A(Parent(j),p) - B(Parent(j),p)≦ A(j,n) - B(j,n) ≦ (12)≦ cell-- time(R(Parent(j)) + A(Parent(j),p - B(Parent(j),p)Consider any leaf and the branch of the tree going from the leaf up tothe root. Denote the nodes of thenodes of this branch by k(1), k(2), . . . k(logN), where node k(1)corresponds to the leaf and k(logN)corresponds to the root (PTR). Noting that cell-- time(R(Parent(k(i))) = T(k(i + 1)) by definition, we canapply recursively (12) to itself going uptree from k(1) to k(logN - 1),which yeilds ##STR1##or, noting that T(k(logN)) = cell-- time(C) ##STR2##Note also, that T(k) is a non-increasing function of i, since the rate ofthe parent is at least as large as therate of the child. Therefore, (14) can be used to obtain a looser boundfor any leaf j-T(j) + cell-- time(C) ≦ A(j) - B(j) ≦ T(j)(logN - 1)(15)Since the absolute error of the actual transmission time of any flow j(corresponding to a leaf of the tree) isbounded by (14) or (15), any flow is guaranteed its rate R(j). Thiscompletes the proof of Property 1 forthe case when the sum of all assigned rates is equal to the linkbandwidth.Consider now the case when the sum of assigned rates is less than thelink bandwidth and the VirtualQueue is used, the Virtual Queue can be treated as the root of a "virtualsubtree", so that if any leaf of the"virtual subtree" is scheduled, an idle cell is sent. Then the VQ and theroot of the proportional tree can betreated as siblings in a tree obtained from the data structure in FIG. 1by adding one more top-level nodewith rate equal to the link bandwidth. Repeating exactly the sameargument as above on the tree withlogN + 1 levels we prove Property 1 for this case as well.Finally, if the virtual queue is not used, note that Lemmas 2 and 4 implythat we could have gotten anequivalent result by pre-scaling the rates so that the sum of all ratesis equal to the link bandwidth.Since Property 1 has been proved for the case of pre-scaled rates, theproof of Property 1 for this case iscomplete. QED.__________________________________________________________________________
APPENDIX B______________________________________The following variables are used in the RE-- SchemeD(i,j) error term for flow i at link cell slot jR(i) rate of flow i (i = 0 corresponds to the "virtual flow" (fullydescribedbelow), whose rate is simply the differencebetween the available bandwidth C and the sum of rates of all real flowsi = 1,2, . . . N.w(i) rate of flow i relative to the total available bandwidth CNote: R(i) are required for initialization and rate changes only,and do not need to be stored in per flowstate. Variables w(i) and D(i,j) are stored per flow.Initialization of the procedure RE-- Scheduler occursin the following manner:j = 0; ##STR3##for all iw(i) = R(i)/C;D(i,0) = 0;}The RE scheduler operates as described in the following pseudocode.RE-- Scheduler:do forever{find flow f with D(f,j) = max-- {i}D(i,j)if ((f > 0) AND (cell of flow f available))transmit next cell from flow felse do not transmit (transmit an idle cell)j = j + 1;D(f,j) = D(f,j) + w(f) - 1;for all i ≠ fD(i,j) = D(i,j) + w(i);-}______________________________________
Patent Citations
Non-Patent Citations
Referenced by
Legal Events
Original Image


text:
Results 1 to 1 of 1
July 2nd, 2012 #1Registered User
- Join Date
- Jul 2007
- Posts
- 16
- Thanks
- 0
- Thanked 0 Times in 0 Posts
Portfolio - Adam Howie - Fine Art Freelance
My name is Adam Howie, and I am trying to make my way as a freelance artist, and mainly do digital abstract "fine art" (if thats the right phrase).
Any feedback if possible would be awesome, as I am mainly self taught (I say mainly as I have done a handful of evening classes recently and of course high school art too many moon ago). I definitely have a long way to go, particularly with composition, backgrounds (which I am so scared of I tend to miss out ), and shading.
There are more examples of my work if needed on my DeviantArt page - http://kimded.deviantart.com/gallery/
These example were created in Photoshop...
Angel in Glory (artwork)
Entropy of Love (artwork)
Its a Meerkat (artwork)
Adam Jenson (artwork - fanart)
Cthulhu Awakens (artwork)
Adora through a glass Darkly (artwork - commissioned piece)
Soul of a Photographer (artwork)
- Similar Threads
- SketchBook: Howie Things and Stuff
- Art: Freelance Portfolio - Adam Wayne
- Art: Adam Russ portfolio
- Art: Adam Milicevic Art & Design Portfolio
Last edited by kimded; July 19th, 2012 at 08:33 PM.

subset: commoncrawl


text:
The web's original travel blog
Create a Free Travel Blog
Sign in
The Icefield Parkway - Banff to Hinton
's Profile
About this blog
from Hinton
Trip Start
May 25, 2008
Trip End
Aug 03, 2008
Loading Map
Map your own trip!
Map Options
Show trip route
Hide lines
Where I stayed
KOA Hinton/Jasper
Monday, June 9, 2008
Today was our 250 mile drive through two national parks - Banff & Jasper. We did the highlight of Banff NP with our tour of Lake Louise yesterday. Today, our main stop was to be a tour on a glacier. I've never done that before so it should be a little adventure. On our drive this morning, our first stop was an overlook of Lake Peyto. This is yet another one of those lake's with a turquoise blue color. The lake was about 1,000 feet below and we would have taken the trail except it was steep and still covered in ice. So we took a one mile trail around the rim. There were many people at the lookout, but once you get just a little ways away there is hardly anyone one around. Being the Canadian parks system, we took the dogs for the walk too. Since not many people were around we let Queque off the leash to run around in the snow - most of this trail was covered in snow. I know this sounds mean, but sometimes I would throw Queque in a snow bank and watch her climb out of it. I don't think she minded at all. She had so much fun just running around and sniffing for animal smells
A map showing the triple divide
. Back in the RV we drove for another hour to a place called the Icefields Center. It is put up by a joint effort of Parks Canada and a private tour company called Brewtser - kinda like our Aramark in our national parks. The main attraction was to ride this HUGE tractor type vehicle onto a Glacier. The actually place is called the Columbia Icefield. The icefield sits in a bowl of high mountains. This ice has been accumulating for thousands of years. It is around 325 square kilometers - this is Canada so we have to use KM. When the compressed ice needs a release, it spills out from the sides via a glacier. The glacier we were to ride on is called Athabasca Glacier which is 6 km long. The price to do this was a little steep for us - $36 per person for the hour plus tour. By the end of the trip, we were glad we did. It is well worth the splurge. You first travel via bus to the edge of the glacier on the moraine. A moraine is the rock and sand the glacier leaves behind. This moraine was about 300 feet high!!! At the moraine we got on what is called an Ice Explorer. This thing cost $750,000, and each tire - 6 of them - cost $5,000 each. (I thought mine at $210 a pop were expensive). It is also 6 wheel drive with computer driven transmission. The engine is a Detroit Diesel. It needs this power to go down and up a 45 degree hill. After descending this hill we were riding on a glacier - a river of ice. About midway on the glacier we got out and took a 20 min. walk around. While most people hung around the trucks, Pooh and I and a few other brave souls took off on a brisk walk to the edge of the icefield - or as far as we could go. We did get so far as to where the people looked like little small specks. At times our feet would sink down a little. This was one of those "wow!" moments you have in your life. Just standing on this glacier with high snow covered mountains and more glaciers above you, could not be told in words. In no time at all, we had to head back. The whole trip took just over an hour, but these memories will last a lifetime
Animal Overpass
. (the $75 bucks we spent will now only fill 1/3 a tank in Canada!!). After this we were very hungry to I drove to RV to a back parking lot to set up a temporary camp for lunch. To do this we leave the RV hooked to the truck and just open up the slides inside. Since we only run on battery power, electrical appliances will not work. So we have to rely on the propane powered oven or stove-top. This time for lunch we had a college favorite - Raman noodles. However, we have the Indian style so as to give it a little kick with the spices. I parked the RV so we could have lunch with a view of the glacier - priceless viewing. After lunch we went on with the drive. After another hour we did stop again at the Athabasca Falls. Yes, another waterfall - I can't seem to get enough of these things. Being snowmelt, the waterfall was pretty full. This time, it fell in a canyon where it pooled around so much it created sinks. We spent about an hour here with the dogs walking along on the trails and view-points. Now came another two hours of driving to our destination in Hinton, Alberta which is an hour outside the parks and down the mountain. Again, this part of the drive was still awesome. Hinton, however, was just an OK city. We stayed at the KOA which is located in a large farm area a few miles outside Hinton. The town is built on the forestry industry with a few pulp mills in the area. It is very dusty here. During this trip, I am using a TomTom GPS device. It had done me well, up to this point when now, half the roads are wrong - I guess TomTom does not do Canada well. Now, the cold rain started to fall and I needed to fix my bike-rack (there is always something to fix on this trip). But when we got back to camp, it was raining harder and I was worn out. I did a little blogging but the internet was so slow I hardly downloaded any videos or pictures. As I was going to bed, Pooh was busy fixing little things here - and it was mid-night!
Report as Spam
Post your own travel photos for friends and family
More Pictures & Videos
Another look at the Athabasca Glacier
Athabasca Falls Video #1
Athabasca Falls Video #2
Athabasca Falls Video #3
Athabasca Falls Video #4
Athabasca Falls Video #5
Athabasca Falls pic #1
Closeup of Crowfoot Glacier
Glacier Video #1
Glacier Video #2
Glacier Video #3
Glacier Video #4
Glacier Video #5
Lake Peyto Video
Looking back from the Athabasca Glacier
Mt. Snowdon - behind it the triple divide
Ol' Snocoach from the 50's & 60's
One of the glaciers from the Columbia Icefield
Our view for lunch
Panorama of Peyto Lake
Panorama of the Athabasca Glacier
Panorama of the Crowfoot Mts. w/ Glacier on left
Pooh eating our staple food during a lunch break
Pooh going up the stairs of the gorge
Pooh on Lake Peyot Trail with Max
Pooh standing next to the Glacier Snocoach
Pooh walking on Glacier
QueQue Running up the trail to Pooh
Queque taking a rest after a long hike
Scott & the Dogs at the Peyot Lake lot
Scott at the Athabasca River with Queque
Scott standing next to the Athabasca Glacier
Scott standing next to the Snocoach wheel
Snocoach from before WW II
So high-up there is still snow in the trees
The Athabasca River after the falls & gorge
The small canyon of the Athabasca River
The top of Athabasca falls
Traveling the Icefield Parkway - video
Previous Entry
Next Entry
About the Author
Send a message
Add as favorite
Get email updates
Turn blog into a book
About this Blog
From Atlanta to Alaska: An RV adventure across ...
Start your own travel blog
13 Votes
20,876 all time
8 this month
Other Travel Blogs
by Scoonpooh
Spring break in Italy 2013
10 entries
447 photos
Up North!! A trip from the South to Michigan's...
15 entries
866 photos
The National Parks of the Southwest by RV
60 entries
1595 photos
Dubai and Oman - From 21st century buildings to...
35 entries
1106 photos
Spring Break in Italy
8 entries
238 photos
China- Tibet by train
27 entries
493 photos
View all Scoonpooh's blogs
Use this image in your site
Copy and paste this html:
Open Link in New Window
Table of Contents
From Yellowstone to Glacier NP
St. Mary
Jun 2, 2008
Glacier National Park - The East Side
Glacier National Park
Jun 3, 2008
Glacier National Park - Two Medicine Area
Glacier National Park
Jun 4, 2008
On to CANADA!!! Glacier NP to Calgary
Jun 6, 2008
Calgary - The Zoo & The Glenbow
Jun 6, 2008
Calgary to the Canadian Rockies
Jun 8, 2008
Lake Louise
Banff National Park
Jun 9, 2008
The Icefield Parkway - Banff to Hinton
Jun 9, 2008
Hinton to Dawson Creek
Dawson Creek
Jun 11, 2008
RV Breaks apart!!!!
Sikanni Cheif
Jun 12, 2008
Sikanni Chief to Laird Hot Springs via Alaska Hwy.
Liard Hotsprings
Jun 13, 2008
Laird Hot Springs to Watson Lake via Alaska Hwy.
Watson Lake
Jun 14, 2008
Watson Lake to Teslin, Yukon via the Alaska Hwy.
Jun 14, 2008
Teslin to Whitehorse
Jun 16, 2008
Whitehorse, Yukon
Jun 16, 2008
Start your own travel blog
View all 72 entries from this travel blog
Privacy Policy
Terms of Use
Owner FAQ
Contact Us
Copyright © 1997 - 2015 TravelPod.com, a proud founder of travel blogs on the web. All Rights Reserved.


text:
|Find court records by County
|Find court records by town or zip code
|Find court resources by category
|Find court records in other states
|Please select a Kentucky County below to view directory of all courts with links to court record resources for each court.
|Find Kentucky court pages by Town or Zip Code.
|Select a court record or online resource category below to view all resources at both the statewide and county level.
|Go to the court records pages for another state.
Fleming County Judicial Center
101 North Main Cross Street, Flemingsburg, KY 41041
Phone: 606-845-7011 Fax: 606-849-2400


text:
As for the latest shake-ups in the Kerry campaign, Kucinich took the Dean line, saying with a chuckle "I can hardly keep track of what's going on with own staff … .I couldn't comment on another campaign."
Kucinich fields marriage proposals
Nov. 11 — Rep. Kucinich has had an interesting week since Wednesday night's joke about looking for a special someone to join him in the White House. He told ABC News, "I've been getting marriage proposals slipped to me! One woman at the rally in Bellingham Friday had a huge sign that said 'Marry Me.'"
The Congressman seems genuinely surprised and amused at the response, and for now is unsure whether he'll pay any heed to the PoliticsNH.com contest trying to find him a mate, wary of detracting from the seriousness of the candidacy while intrigued by the opportunity for the publicity his campaign craves.
Over dinner at the Minneapolis airport en route to Des Moines (hot water with lemon, two pieces of dry wheat toast accompanied by his ever-present plastic bag of granola), Kucinich went on to talk about how difficult it is to maintain a relationship with the schedule of a Congressman-cum-presidential-candidate, but that he would absolutely be open to having more children: "I'm in great health and I absolutely love kids." Kucinich has a daughter Jackie, 21, with whom he is very close but who does not appear on the campaign trail.
But whatever void a lack of romance may leave, perhaps campaign cash can fill it. Kucinich had a special spring in his step Monday due to some fundraising success last weekend in the Bay Area, which brought in around $100,000. He wrapped up the trip with a press conference and speech to students at San Francisco State University on sustainable energy, calling for a national commitment to creating renewable energies akin to the nation's devotion to the space program during the Kennedy administration.
On the endorsement watch, Kucinich has picked up actor Joaquin Phoenix, actress Shelley Morrison (Rosario on "Will & Grace"), and Dave Mathews Band drummer Tim Reynolds. Possible endorsements coming down the pipe include actor Casey Affleck (brother of Ben) and perhaps the entire Dave Matthews Band. Willie Nelson has scheduled a benefit concert for Kucinich in Austin on Jan. 3. According to the AP, "The Ohio congressman, a long shot in the Democratic race, outpaces his eight rivals in endorsements from the entertainment industry."
Kucinich will appear with veterans at his events tomorrow and will visit Des Moines' Veterans Hospital tomorrow in honor of the holiday.
Kucinich campaign appeals to base
Nov. 10 — 7:30 pm Welcome to Temple and Evening
8:00 pm Invocation, Meditation and Prayer
8:40 pm: Performance of "Tantric Gospel" by the Radical Spirit Band
11:00 pm Collective Visualization Process
You might be thinking we've mistakenly printed the evening schedule at Canyon Ranch, but no, it's just some of the program notes from Dennis Kucinich's Saturday night fundraiser at a private home in Marin County. And you won't find any un-p.c., manifest destiny-tinged titles like "Pioneers" among this group. Organizers described fundraising levels as Prophets ($2,000), Trailblazers ($1,000), Visionaries ($500), Change Agents ($250), and Soul Allies ($100).


text:
December 12, 2011
Jessica Simpson hasn't given birth yet, but she's already signed a $3 million endorsement deal with Weight Watchers to shed her baby weight. "The deal is in place, and after having her baby, she'll start with Weight Watchers to lose her baby weight," a source told Page Six.
Simpson is reportedly loving being pregnant. She recently hired a chef to ensure her growing baby gets the best nutrition possible.
Image Sources:
Related Articles
- Will Jessica Simpson Lose her Weight Watchers Deal Because of Chocolate Binges?
- Jessica Simpson Talks Losing Baby Weight
- Jessica Simpson's Post-Pregnancy Diet
- Jessica Simpson Changes Diet While Breast Feeding Baby Maxwell
- Jessica Simpson Has a Crazy Pregnancy Craving
- Jessica Simpson Wants to Make Healthier Choices for Second Pregnancy
- Jessica Simpson: "A Great Souffle Would Make Me Cry"
- Ginnifer Goodwin Follows a Weight Watchers Diet
- Popular Diets Ranked By U.S. News
- Weight Watchers Italian Meatballs
Related Recipes
- Spicy Chipotle Couscous Salad
- Spicy Chipotle Couscous Salad
- Trader Joe's Harvest Grain Pasta Salad
- Egg and Sweet Potato Cups
- Chicken Wraps with Mediterranean Flair
- Whole Wheat Blueberry Brownies
- Apple Stuffed Tortillas
- Fresh Tarragon and Lentil Salad
- Roasted Asparagus with Egg Salad
- Savory Chicken Meatballs with Penne Pasta
Want more from Foodista? Sign up below!


text:
You are using an outdated browser. Please upgrade your browser to improve your ReverbNation experience.
Great tune's you have you here!... enjoying the listen. Check us out when you can! It would be much appreciated!! ~MykonMan
GREAT CHEMISTRY, TIGHT SOUND. BURZZA "LIKES" \m/
you did it well, you make the great work, full & much respect...regards
Excellent! -Blab
Fantastic work guys :-))))
we r looking forward to taking the stage wtih u guys too there july 1st ...should be a kewl time
MMm nice tasty
thank you for the compliment!! we are looking forward to playing with you at The Madison Theater on March 5th! Have a great weekend ~ rock ~ trice :)
Wow you guys sound awesome! You guys are the only local band we can find that have even remotely the same sound as us. We should play a show together sometime. Email me if you guys are ever interested.
email@example.com My name is Seth. Let me know keep up the great work!


text:
|Thread Tools
|Search this Thread
|Display Modes
just passin' through
Joined: May 2005
Location: Tumalo, Oregon
Oddometer: 4,912
Thanks Brad, Leisure, Steve and all. Yes, we have lots of new stuff coming, stay tuned. In the meantime, I just received this note from another happy rider in Washington State:
"I own one of the original GL saddlebags that I use on my 525XC/XR650R, I brutalized that bag and it just keeps coming back for more. Now being a complete believer in Go light, Go fast philosophy, there was no way I could continue to ride my 990 with panniers. I ordered my Great Basin Saddlebag Wednesday night and by Friday afternoon, I had the instructions in hand performing the 1 minute install. The Great Basin has well thought out items like the top case and bottle compartments and just as the original saddlebag, durability is not a factor. But the greatest feature is how quickly you can remove/install, it is literally less than a minute. Also, being big boned, I was worried that my larger sleeping bag would not fit in the storage compartment, no problem, room to spare. I was worried that it may cramp my riding position a touch, again no problem. Actually on one long paved section I did this weekend, I moved the bag forward so I had a little backrest! Plenty of storage space as well, for weekend getaways there is no need for a backpack (hydration pack only) and your tank bag is freed up to be the cooler at that last stop before camping for the night."
I think that'd be Mt Rainier poking up back there.
How about the matching Spot locator?!
What's next? More action!
Joined: May 2008
Location: the Cascade foothills, WA USA
Oddometer: 83
I have looked and looked :)...maybe its behind the next click...anyway is any way to mount this on the KTM 690e without covering the gas cap? If not, how hard is it (how many buckles to unclasp/unthread to get at the gas cap?
Also, any experience with putting your new tank bag on the 690e?
'14 KTM Adv R
Gnarly Adventurer
Joined: Nov 2007
Location: Northern CA
Oddometer: 313
Joined: May 2008
Location: the Cascade foothills, WA USA
Oddometer: 83
Thanks Redline - thats the Giant Loop (as opposed to the great basin).
Just found someplace local that has a demo that I can try on the bike. Gonna head 'fer Tacoma tomorrow I guess...
'14 KTM Adv R
just passin' through
Joined: May 2005
Location: Tumalo, Oregon
Oddometer: 4,912
KTM 690 fitment
Just returned from an impromptu photo shoot with the KTM 690. My friend and neighbor Steve is a former National ISDE team member from England who is also a retired Grand Prix Equestrian competitor (now trainer) and has several nice KTMs. He has a Dakar Rally 690 which was in the shop for some electrical work but I guess it's quite a sight - looking forward to test ride on that unit someday!
With a few creative additions to the stock bike the Great Basin will fit this machine.
You can see the fuel filler cap just barely poking out underneath the kit here. Steve will need the passenger grab bars or simply two small holes in the rear fender and one of those heavy-duty zip ties that he uses on the footrest brackets. A replacement fender for this bike is only $92.00 through KTM-parts.com https://www.ktm-parts.com/mm5/mercha...=7650801300030 . If they don't already, Cycra will probably have the same unit for much less which would allow you to dedicate that rear fender to multi-day rips. That's exactly what I do with my 525 EXC - just get another fender.
Our latest production run of Great Basins will have another 6 inches of strap to allow wrapping directly around the stock passenger footrest brackets but Steve created a loop out of those heavy-duty zip ties then feeds the bags Ballistic Cordura webbing through and back to the cam-lock buckle for a very secure attachment.
Here's another view (right). These are not normal zip ties, they are those super burly units - plumbers sometimes use them in home construction. Don't know exactly the rating but they're plenty in this application.
Steve has the Akro pipe and a kinda hokey shield cobbled on but if it was my machine, I'd install at least one of these supermoto sliders to the pipe and forget all about the heat issue once and for all. - http://www.rg-racing.com/browseType/.../EP0005BK.aspx
Not only will this slider device add heat protection but also help defend your bike in the case of a crash just like the way the saddle bag design does.
To access the fuel filler, the rear connection will need to be loosened or partially removed. I know, what a pain but hey, you're the one that bought this crazy cool bike and boo hoo, every time you stop for fuel (what's that, every 120 miles or so?) it will take you another 1 minute to serve that process. Small price to pay for a much better handling way to carry a load on this righteous bike IMHO.
Steve has this OEM shielding on the pipe too and even if the Ballistic Cordura webbing was touching it (which is isn't) this pipe doesn't get hot enough to melt anything.
There's that heavy duty zip tie again. I'd probably double those up just to be sure.
That unusual sticker on the side of his tank is supposed to look like sea gull poop. Must be English humor.
Here you can clearly see the Fandango fits pretty nicely. I'll get some more photos with Steve on the bike so you can get some perspective of the passenger area. There's plenty of strap to wrap around the trellis frame and the other attachment around the steering head tube up front. It took about 2 minutes. Key access is no problem because of the tailoring that also allows for the vent tube on conventional fuel cells and once the base layer is strapped on the whole bag completely zips off. Has a nice carry handle too. That's a whole different thread though.
What's next? More action!
just passin' through
Joined: May 2005
Location: Tumalo, Oregon
Oddometer: 4,912
No photos of this one but an interesting testimonial worth sharing here.
"Here's a war story for you involving a Great Basin bag:
My brother-in-law and riding buddy Jon has a brand-new (600 miles) 990 Adventure, and was riding home from work on the hottest day of the year two thursdays ago. He was doing 65-70mph on I-5 just south of Woodburn in the center lane.
A guy in an old pickup with bald tires was on his right and my brother was going around him. Just as he pulled up even with the pickup bed, the left front tire blew out explosively, and the driver lost control and swerved to the left very hard.
My brother-in-law didn't even have time to hit the brakes or swerve. The truck hit him hard and threw him across two lanes onto the left shoulder, but miraculously, Jon kept it upright and didn't dump the bike. The guy in the lane to the left, an old hippie, was watching the whole thing and slammed on his brakes as soon as the tire blew, making a buffer zone for Jon.
He got the bike stopped in the median, and the guy who stopped traffic stopped to help and to give a police report.
The bike survived remarkably well... the radiator mounts are bent, and the plastic tank guard, plastic cowl cover, and right side mirror need replacing, but that's it. His two-week-old Great Basin bag was full, and it took most of the impact... he doesn't think the truck ever hit his leg. He can't find any scratches on the bike rear of the tank guard. The Great Basin bag was mostly just dirty, though he did find one abrasion point, and he's wondering if it will still be waterproof there. It's just one 1/8" spot where a wrinkle on the bag rubbed the truck.
His right arm has a large bruise in the shape of the arm padding in his jacket (ATGATT even in hot weather). Overall, it's a shock that he came out so squeaky clean.
The last three digits of his bike's VIN is 777. Maybe that's why.
The whole driver's door on the pickup was caved in, and the mirror destroyed. The door no longer opens."
What's next? More action!
just passin' through
Joined: May 2005
Location: Tumalo, Oregon
Oddometer: 4,912
Another satisified customer
We've been lucky enough to use (abuse lovingly) this customer's machine last winter and again at the Sound Rider Rally in the Gorge a couple weeks ago. In case you don't believe in the intensity of this guy let me show you a photo of him skiing on Mt Bachelor (Oregon).
This was the second time he'd hit this natural feature after over-shooting it by at least 75' - he does not hesitate - the perfect 'test pilot' for our designs!
That's at least a one hundred foot air as he landed outside the image to the left.
Back to motorcycles and his report.
"After working hard all last month, I decided I needed a little break. Saturday morning I packed up a few things for an overnight trip to Winter Ridge in the Fremont National Forest. It has been at least 15 yrs since I had been to Fremont Point so, i figured a night of stealth camping up on the rim would be just what I needed. I missed out on my last trip due to mechanicals. So, I was excited to try out my new Giant Loop luggage.
I made some notes so I wouldn't have to stop and look at the map every 5 min. Mostly I mapped out some big gravel roads that would allow me to make some good time to my intended destination.
I took a couple of smaller connecting trails, that brought me through some pretty cool areas.
As I entered this bid grassy plain called
I saw a Bald eagle take off from it's perch and fly over the lake. I stopped so I could check it out and try and get a picture. It flew pretty far away but, as I watched I noticed another Bald eagle and a couple of falcons(?). I was able to get a pic of a falcon.
After some more big gravel roads I was getting pretty warm so I took a little break at this junction, to lose a layer and have a snack.
From there I cruised up into the hills. Here's a shot of where I came from.
2 yrs ago there was a big fire here and something like 380,000 acres got burned up. I found a route thru some of the burn, it was really cool.
I ended up on the north side of Winter Rim near the town of Summer Lake, I decided to bust the 34 miles of tarmac from there to Paisley and get some fuel for the bike and me. Paisley is on the south end of Winter Rim so from there I road up towards the top. After an hour of riding I had reached my destination.
I enjoyed the view for awhile; then headed north on a little road that paralells the rim to find a campsite.
After riding into a couple of beautiful grassy meadows only to discover they were boulder fields with grass growing around them,I found this killer spot.
It got cold that night at almost 7000', I put on all the clothes I had with me and walked up to the rim to watch it get dark over Summer lake and drink a couple of barley sodas I bought in Paisley.
I jumped in Big Agnes and snuggled up for the nite.
Woke up early and made some oatmeal with chocalate outrage GU topper, and some really strong coffee. The breakfast of champions.
After letting my bag and tent dry off, I packed up Leave No Trace style and hit the dirt.
These were everywhere in my little meadow.
This is the road that parallels the rim, how I started the day. Absolutely beautiful up there.
I took a slightly different route home about 10 miles to the west of my way down. I was caught out in this corner when I washed the front end at about 50mph, let off a little and preceded to highside the bike. I road the windscreen and mirror with my chest for a bit and then slammed over the front. The bike went down hard and landed right on my new bags. I was pretty impressed when I picked up the bike and there was no damage to the luggage. My crash bars looked worse.
You can see where the bag hit the dirt.
The crash bar.
I smacked my knee on the bike going down and bruised it a bit, AttGatt works. My kneegaurds saved me.
From here home it was all big gravel except this sweet pumice road that went for miles.. Triple digits yaa.
Great trip, just what I needed.
The Great Basin luggage worked perfectly. Very well thought out system; I could barely tell it was there.
You be the judge.
What's next? More action!
Gunga galunga.
Joined: Aug 2006
Location: Minden/Gardnerville, NV
Oddometer: 3,658
Stihl is a lunatic.
2k4 Wee-Strom, black, farkled, smells like bacon.
Use this code when opening a Smugmug account and get $5 off! HkVR4XuSGKW46
just passin' through
Joined: May 2005
Location: Tumalo, Oregon
Oddometer: 4,912
Yeah -perfect test pilot!!!!!
What's next? More action!
PROUD 2B Riff Raff!
Joined: Oct 2006
Location: Drinking from the Stanley Cup!
Oddometer: 10,905
Do you think the Great Basin is too big for a WR250R?
Adventure Mojo
Joined: Oct 2006
Location: Sydney Hills - Australia
Oddometer: 2,681
Same bomb proof design but 30Liters instead of 50Liters.
Agito ergo sum - I ride therefore I am!
Your ride.. Your adventure!
just passin' through
Joined: May 2005
Location: Tumalo, Oregon
Oddometer: 4,912
There is a couple that rode their KLR250 (2 bikes, not 2 up!) up to Alaska and back using the Great Basin though. Real easy, sit-down riding I'm sure but they were quite pleased with the kit on their smaller machines.
But if it was my choice, I'd go with the COYOTE for sure!
What's next? More action!
Mookish Mook
Joined: Aug 2007
Location: Either UK or Australia ...
Oddometer: 4,396
Here is mine on a trip to Spain, through France
I seem to set mine back much further than anyone else...
Its a fantastically well thought out system. The removable compartments, sleeping bag compartment & stuff sacks are excellent!
My only issue is that I cant really ride with it further fwd like most seem to be using it. I find it gets in the way when I stand (maybe because I am taller I get more reach fwd-back on the seat than most - my hips get quite far back if I am braking or descending).
Also, if I have it further fwd, my backpack starts interfering with it when I am seated. (I tend to ride with a climbing backpack that has a proper harness system and carries the weight low on my hips - as a consequence its bulkier at the bottom)
Im well-impressed with it - but would love it more if it had capacity to carry weight lower down - ie longer side-lobes.
I rode through pissing rain for most of the length of France, and nothing got wet. Not even a little damp. I was well-happy with that.
Id used Kriega packs before I got the GL, and my tools in the zippered compartment got wet. After a 2 week trip, they came out with a nice sheen of rust
In one of the side-lobes of the GreatBasin, I carried a Kriega US10 with my spare tubes & tools, etc - it fits perfectly! When dirt bashing, I was able to park the GL at camp and go even lighter - with just the toolkit on the back.
I didnt have an opportunity to crash-test the luggage like some others have ...
But its so sturdy, I had no hesitation laying my bike on top of it (serving as a padded chock) while I did some work on the cooling system.
just passin' through
Joined: May 2005
Location: Tumalo, Oregon
Oddometer: 4,912
Hey MOOK - Thanks so much for the honest review brotha! We're listening and appreciate the feedback sir!
Crash test close-up
What's next? More action!
Mookish Mook
Joined: Aug 2007
Location: Either UK or Australia ...
Oddometer: 4,396
Its going to get some good crash-testing in Morocco in October (if I can still make it happen)
|Thread Tools
|Search this Thread
|Display Modes
Linear Mode


text:
Zebre v Ospreys - RaboDirect PRO12 match preview
Last Updated: 04/10/12 1:35pm
Zebre will be without injured fly-half Luciano Orquera for Friday's PRO12 clash with reigning champions the Ospreys at Stadio XXV Aprile.
Orquera has a sprained ankle and is replaced by Alberto Chiesa in the number 10 jersey while Giovanbattista Venditti returns on the wing.
In the only other change to Christian Gajan's starting line-up, Emiliano Caffini is included ahead of Filippo Cristiano on the blindside.
There is a great deal of movement on the bench however as Carlo Festuccia, Salvatore Perugini, Flavio Tripodi, Filippo Ferrarini, Josh Sole, Alberto Benettin and Leonardo Sarto all make the squad.
Ospreys back rowers Justin Tipuric and Joe Bearman are injury concerns and will be monitored before the trip to Italy.
Prop Adam Jones is set to make his first start of the season after making his comeback from injury against Munster last weekend.
Zebre: 15 D Halangahu, 14 G Venditti, 13 M Pratichetti, 12 G Garcia (capt), 11 S Sinoti, 10 A Chiesa, 9 A Chillon, 8 Andries Van Schalkwyk, 7 M Bergamasco, 6 E Caffini, 5 M Van Vuren, 4 Q Geldenhuys, 3 L Redolfini, 2 Davide Giazzon, 1 Matias Aguero. Replacements: 16 C Festuccia, 17 S Perugini, 18 F Tripodi, 19 F Ferrarini, 20 J Sole, 21 L Martinelli, 22 A Benettin, 23 L Sarto.
Ospreys: 15 R Fussell, 14 H Dirksen, 13 A Beck, 12 A Bishop, 11 E Walker, 10 D Biggar, 9 K Fotuali'I, 1 R Bevington, 2 S Baldwin, 3 Adam Jones, 4 Alun Wyn Jones (Capt), 5 Ian Evans, 6 Ryan Jones, 7 Sam Lewis, 8 Jonathan Thomas, Replacements: 16 R Hibbard, 17 D Jones, 18 A Jarvis, 19 J Bearman, 20 G Stowers, 21 R Webb, 22 R Jones, 23 J Spratt
What they said...
Ospreys forwards coach Jonathan Humphreys
"I know they are bottom of the league but a couple of their games could have gone either way - the Glasgow game and certainly the defeat to Connacht," he said.
"We've gone out to Italy before and Italian sides have played particularly well against us. They are competitive, dangerous and I find them to be very inventive teams."


text:
Economics and Globalization Events
Infrastructure Integration and Environmental Preservation in the Amazon
January 16, 2008 // 11:00am — 4:30pm
Brazil Institute
The Initiative for the Integration of the Regional Infrastructure of South America is meant to forge links between South American countries by integrating the transportation, energy, and telecommunications sectors. The full environmental and social impacts of IIRSA investments should be weighed against the need to promote the continent's economic development and reduce poverty.
Today's Trade Policy Landscape
January 15, 2008 // 10:30am — 11:30am
Program on America and the Global Economy
With Ambassador Susan C. Schwab, United States Trade Representative
Innovative Partnerships for Peace: The Role of Extractive Industries in Resource-Based Conflict Prevention and Mitigation
January 09, 2008 // 11:00am — 1:00pm
Environmental Change and Security Program
Panelists analyze existing frameworks for preventing resource-based conflict and present Latin American case studies in which extractive industry companies have attempted to promote peace and stability.
Urban Life in China's Brave New World
January 03, 2008 // 12:00pm — 2:00pm
China Environment Forum
Jeffrey Wasserstrom, a U.C. Irvine China specialist and urban historian, draws on material from his book China's Brave New World – And Other Tales for Global Times (Indiana University Press, 2007) to reflect on the dramatic way that Chinese cities have changed over the past two decades.
China Grapples with Its Energy Challenges
December 12, 2007 // 8:00am — 10:00am
China Environment Forum
Whether and how well China deals with its energy dilemmas will have deep consequences for the rest of the world, which has a large stake in its success.
Stimulating U.S. Technological Innovation in Energy
November 29, 2007 // 8:00am — 10:00am
Program on America and the Global Economy
With Charles Weiss, Distinguished Professor, Georgetown University and William Bonvillian, Director, Massachusetts Institute of Technology's Washington Office
OECD: Meeting New Challenges in a Changing World
October 23, 2007 // 2:00pm — 3:00pm
Program on America and the Global Economy
A Director's Forum with The Honorable Angel Gurría, Secretary-General of the Organization for Economic Cooperation and Development (OECD)
Book Discussion - America Works: Critical Thoughts on the Exceptional U.S. Labor Market
October 04, 2007 // 12:00pm — 1:30pm
Program on America and the Global Economy
With Richard B. Freeman, Herbert S. Ascherman Professor in Economics, Harvard University and Faculty Director of the Labor and Worklife Program, Harvard Law School.
Why is Urban Assistance Important? Inserting Urban Issues Into the Development Agenda
September 24, 2007 // 9:00am — 1:00pm
Urban Sustainability Laboratory
This is the concluding seminar of the CUSP series on Global Urban Poverty.
Creating Opportunities for Peace Through Regional Trade in the African Great Lakes Region
September 10, 2007 // 10:00am — 12:00pm
Environmental Change and Security Program
There is a strong regional and international market for the minerals and forest products extracted from the Great Lakes countries. The challenge is for this lucrative trade to directly benefit the majority of the people living in the region, rather than the corrupt few who have typically exploited these resources.


text:
Videos: Discover Hang
Gliding & Paragliding
Click here for more videos
USHPA once again has a true "one-stop-shop" for all your free flight needs. The new USHPA Store launches today (Friday, May 1). In addition to t-shirts, hats, and jackets with the USHPA logo, there are books and DVDs for both training and entertainment, new free flight charms designed by a San Diego-based pilot (that can be worn as a necklace, earring, or on your keychain) , and of course the cool KEEN bags.
Want to help support The Cloudbase Foundation? All proceeds from the KEEN Bags go directly to The Cloudbase Foundation, who are currently on the ground in Nepal helping communities at the epicenter of the devasting earthquake.
All of your flight document needs are in the new store as well: 30-day membership forms, rating certificates, IPPI cards, and log books. Also new to the store: Gift Cards!
Visit the USHPA Store - now with a new easy-to-remember URL: http://ushpastore.com.
A team from The Cloudbase Foundation and KarmaFlights were in Nepal during the recent earthquake. They marshalled all their resources and made their way to the villages in need to render aid and support. Due to the widespread impact of the quake, they were the first responders and continue to be the primary source of relief for some of the remote villages at the epicenter. For more on their efforts, read News from Nepal. For additional updates from the field, visit the KarmaFlights Facebook page.
They could use YOUR help. Every dollar donated goes directly to supporting those affected by the earthquake in Nepal. Make your donation through The Cloudbase Foundation:
Donate Now
SupAir and the DHV have issued Safety Notices. SupAir harness models Walibi2 and Evasion2 may have too much velcro, resulting in difficulty extracting the reserve parachute. For more information: Walibi2 and Evasion2 Safety Notice. The plastic batten clips on some hang gliders may come open during steeply banked downward turns, resulting in unrecoverable spiral dives. For more information: DHV Spiral Dive Warning
The Delaware Water Gap National Recreation Area is a large area with great potential for free flight, just a few hours by car from New York City and Philadelphia. The National Park Service is considering changes to the permitted use of this land. The local USHPA chapter (Water Gap Hang Gliding Club) has been providing feedback, but could use our help.
If you want to support free flight at Delaware Water Gap National Recreation Area - and other NRAs throughout the US! - please submit your comments today. The comment period closes on April 30, 2015.
NOTE CORRECT LINK IS HERE: Submit Your Comments Here
For more information from the local Chapter on this issue, refer to their DWGNRA Post. For ideas when submitting comments, refer to our Call to Action Guidelines.
Read all about it in Outside Magazine May 2015.
Go to the Sweepstakes page to learn more and Enter the Sweepstakes
Chapter officers should have all received information about how to put on a Film Festival. If you want to help make it happen in your area - contact your local USHPA Chapter to find out more.
Thanks for 10 years of excellent service in support of our organization. For a very brief look back, read 10 Years of Service. Even better, tell Martin "Thanks!" next time you see him!


text:
'At the level we are, it's much easier for quality to go down than up', said Paul Pontallier, the general director and winemaker at Château Margaux (pictured, centre). It was a pragmatic rather than an immodest statement, since their wines are consistently acknowledged as achieving the very best standards, and any wobble therefrom would surely…
Written by 23 Feb 2012
Discovery and disclosure at Ch Margaux
Further reading
You must be logged in as a member to suggest an article.
Annual membershipPerfect for wine lovers £69 annual Join Save £15
Monthly membershipPerfect for wine lovers £6.99 monthly Join
Still unsure?Find out more about membership and the Jancis Robinson Team. Find out more
This article is for members only


text:
One easy answer lies in the patrilineal history of LEGO itself.
Back in 1983, Reform Judaism recognized the Jewish identity of children of "patrilineal descent."
Sadly, his proposal was spurned and the "patrilineal" experiment failed.
patrilineal pat·ri·lin·e·al (pāt'rə-lĭn'ē-əl)
Relating to, based on, or tracing ancestral descent through the paternal line.
Tracing kinship and descent through the male line. (Compare matrilineal.)


text:
Related Questions
So a baby survives at 22 weeks and it is a miracle, a baby is removed from a healthy mother at 24 and it is a choices?Removed from a healthy mother and incinerated no less
Who's a mom on here of a baby thats 6 months and under? How do u feel about going to work and babysitters?My daughter is 5 months old. My bf works for 1pm-10pm everyday except sunday and tuesday. idk how to get a job with him working those hours. he asked his boss if he could change...EskimoChocolate 18-21, F 1 Answer 1 Jan 26, 2012
boobookittygrrrl 26-30, F 6 Answers 0 Nov 6, 2013 in Parenting & Family
zankhanapatel 26-30, F 6 Answers 0 Jun 7, 2014 in Health
Do you guys ever have hard time getting healthy because your marriage is so depressing or have a hard time NOT gettting into emotional eating?darktippedrose 31-35, F 9 Answers 2 Jun 9, 2012
What would you think of someone who had a 5% chance of living, but was born and is now healthy and in 10th grade?I change that "somone" to tripletscamoflaugegirl3 18-21, F 8 Answers 3 Aug 5, 2012 in Health
Jeannetx3 22-25, F 3 Answers 1 Jul 24, 2013 in Image & Weight
WizGeezer 56-60, M 4 Answers 0 Nov 18, 2014 in Parenting & Family


text:
Just wondering if there's any other diabetics here due in October?
I'm a Type 2 pre-pregnancy so basically I have to take insulin and watch my carbs.
I'm also part of the Pregnant with Diabetes Group so I have questions answered there, but just trying to see if anyone in this group is diabetic...


text:
Your can't-miss list for Indie Memphis Film Festival
Featuring screenings, panels, live music, technology workshops and more.
Continues Friday through Sunday at Playhouse on the Square, Circuit Playhouse, Malco Studio on the Square and the Memphis Brooks Museum of Art. For tickets, a full schedule and more information, visit indiememphis.com.
A viewer's guide to the films can be found on The Commercial Appeal's movie blog, TheBloodshotEye.com.
Continuing today through Sunday at various Midtown venues, the 15th annual Indie Memphis Film Festival has too many highlights — worthwhile films, potentially interesting panels and filmmaking and technology workshops — to be covered definitively in any one article.
Instead, here's a selection of a very few film highlights:
"Indie Game: The Movie": Even those indifferent to video games will be mesmerized by this fascinating film about the dedicated artists and visionaries who dedicate years of their lives to creating independent games for discerning players. The move is a compelling eye-opener as it makes the argument that video games deserve to be taken as seriously as movies, novels, paintings and more esteemed art forms. (10:30 a.m. Friday, Malco Studio on the Square.)
"Red Flag": Partly filmed in Memphis, this faux/authentic documentary from writer-director-star Alex Karpovsky (a regular on HBO's "Girls") may be the funniest film at the festival, a chronicle of a disastrous Southern road trip that establishes Karpovsky as the Woody Allen of the digital media generation. (7 p.m. Friday, Circuit Playhouse)
Short Films #2: Hometowner: Eight local filmmakers will introduce their latest work, including such shorts as Edward Valibus Phillips' ingeniously hilarious "Bad Bikes," and Mike McCarthy's "G*****n Goddard," inspired by the director's youthful run-in with the former movie critic of The Commercial Appeal. (9:15 p.m. Friday, Playhouse on the Square)
"Pilgrim Song": Produced by Memphis-based Paper Moon Films, this second feature from writer-director Martha Stephens is a candidate for best film at the fest, and a demonstration that no-budget filmmakers still produce inspired work. Timothy Morton stars as a recently fired public-school music teacher and restless husband who copes with his disaffection by deciding to hike Kentucky's 282-mile Sheltowee Trace Trail. (4:15 p.m. Saturday, Circuit Playhouse)
"Very Extremely Dangerous": This harrowing documentary by Ireland's Paul Duane and Memphis' Robert Gordon might be described as "Grey Gardens" on the highway to hell — a portrait of an old-timer living on the edge that is as funny as it is frightening, and as compassionate as it is shocking. The film follows rediscovered Sun rockabilly artist, real-life outlaw and cancer-stricken drug addict Jerry McGill from one misadventure to another; the idea that his reckless behavior is encouraged by the presence of the camera becomes part of the story. (10 p.m. Saturday, Playhouse on the Square)
"Silver Linings Playbook": Accumulating Oscar buzz along with festival acclaim, the new movie from David O. Russell ("Three Kings," "The Fighter") is an oddball romantic comedy with Bradley Cooper and Jennifer Lawrence, here making its Memphis debut. (11:30 a.m. Sunday, Playhouse on the Square)
"Big Star: Nothing Can Change Me": The Thursday night U.S. premiere of the long-awaited feature documentary about the influential 1970s Memphis power pop band led by the late Chris Bell and the late Alex Chilton was a sellout, so this second screening was added. (8 p.m. Sunday, Circuit Playhouse)
Subscribe to The Commercial Appeal
Need Help? Call us at 1-888-789-0831.
Monday-Friday: 6am-5pm / Saturday: 6:30am-11:30am / Sunday: 6am-1pm


text:
Put one foot in this tapas bar and (as its name foretells) suddenly you've stepped inside a surrealist painting. The walls bombard the senses, covered as they are with trinkets, tchotchkes, knick-knacks, and accouterments from all over the Iberian peninsula. The food follows suit, starting with the tapas menu, which offers a palette of wildly disparate tastes in a few small bites, from juicy duckling smothered in berry sauce to delicate scallops swimming in saffron cream. But the entrées are the genuine masterpieces—especially the house special, melt-on-your-fork pescado a la sal (striped bass cooked in coarse salt that tenderizes the fish as it's baked).
Previous Winners:
2015 Best Spanish Restaurant
This was a winner in our 2015 Best of Boston Readers' Poll. See all the 2015 winners...
Readers' Choice
2014 Best Spanish Restaurant
2013 Best Spanish Restaurant
2012 Best Spanish Restaurant
2011 Best Spanish Restaurant
Even diners who prefer their atmospheres serene are willing to brave the frenetic crowd here for one reason: the food. Simple tapas like tortilla espanola shine; the wine-braised short ribs...
2009 Best Spanish Restaurant
A place needs more than good sangria and jamn to qualify as a genuine tapas joint: It must also be a lively gathering spot, not one that's empty by 11...
2008 Best Spanish Restaurant
Tweaking tradition here and there (as anyone who's had the hamburguesas de Kobe can attest), Ken Oringer's tapas joint is nonetheless an exemplar of the form. The bistec de faldilla...
2007 Best Spanish Restaurant
Although the distinctly un-Spanish corn on the cob is one of the most popular orders at this glamorous shrine to tapas, Toro shows its true genius with more authentic fare,...
2006 Best Spanish Restaurant
The hype, for once, is justified: Ken Oringer's achingly trendy taberna not only outclasses its Boston competition, but would stand proud among the top eateries in Barcelona. The tapas are...
2005 Best Spanish Restaurant
2004 Best Spanish Restaurant
Spanish culture is bar culture, and a Spaniard knows no greater delight than pushing up against a crowd, glass in hand, and shouting for a pincho de tortilla. That's why...
2003 Best Spanish Restaurant
2001 Best Spanish Restaurant
Everything about this dark Somerville caverna qualifies as an aphrodisiac: the richly colored, bordello-inspired décor, the hum of loud conversation, and, above all, the lusty and authentic food. That means...
2000 Best Spanish Restaurant
Granted, a tapas joint run by a couple of Irishmen in Brighton might not seem like the most authentic Spanish restaurant in town. But one bite of Chef Brendan Gallagher's...
1998 Best Spanish Restaurant
With its various Andalusian artifacts, scarlet walls, and mysterious clothesline of lingerie strung through the middle of the restaurant, Daft looks like a whorehouse from a Bunuel film. We like...


text:
Skip to Content
Rush-Copley Medical Group
Home > Health & Fitness > Healthwise > Overuse Injuries
Overuse injuries occur from stressing your joints, muscles,
or other tissues without allowing them to recover. For example, throwing a
baseball at high speeds over and over can stress your shoulder joint and cause
an injury to part of that joint (the
rotator cuff).
Stress fractures, in which a bone breaks from the
pressure placed on it through activity, are also common for athletes.
Overuse injuries can be caused by:
For more information, see the topic:
ByHealthwise StaffPrimary Medical ReviewerE. Gregory Thompson, MD - Internal MedicineSpecialist Medical ReviewerHeather Chambliss, PhD - Exercise Science
Current as ofFebruary 20, 2015
Next Section:
Previous Section:
Current as of:
February 20, 2015
Healthwise Staff
Medical Review:
E. Gregory Thompson, MD - Internal Medicine & Heather Chambliss, PhD - Exercise Science
This information does not replace the advice of a doctor. Healthwise, Incorporated disclaims any warranty or liability for your use of this information. Your use of this information means that you agree to the Terms of Use.
How this information was developed to help you make better health decisions.
To learn more, visit Healthwise.org
© 1995-2015 Healthwise, Incorporated. Healthwise, Healthwise for every health decision, and the Healthwise logo are trademarks of Healthwise, Incorporated.
Retrieving newsletters from the Web service...
Sorry, the newsletter Web service is unavailable at this time.
You have signed up for the selected newsletters.
© Copyright 2015 Rush-Copley Medical Center • 2000 Ogden Avenue; Aurora, IL 60504
Main: 630-978-6200 • Physician Referral & Information: 630-978-6700 or 866-4COPLEY (866-426-7539)