text:
|Publication number
|Publication type
|Application number
|Publication date
|Dec 3, 1996
|Filing date
|Feb 27, 1995
|Priority date
|Feb 27, 1995
|Fee status
|Publication number
|Kadathur S. Natarajan
|Original Assignee
|Motorola, Inc.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (8), Referenced by (47), Classifications (17), Legal Events (6)
|External Links: USPTO, USPTO Assignment, Espacenet
The present invention relates generally to communication networks. More specifically, the present invention relates to the routing of communications through a multiplicity of communication links and to responding to failures in the links.
Communication networks, such as those used to deliver telecommunications, to interconnect computers, and the like, may include any number of nodes interconnected by communication links. The networks may deliver electronic communications between two points by routing the communications over the links from node to node within the network. As the number of nodes in a network increases and as the number of communication paths available to each network node increases, the number of potential paths available for delivering any single communication likewise increases.
Accordingly, networks often use techniques for specifying a route to follow when delivering a communication from an origination node to a destination node. These techniques can be sophisticated and are often carried out by computer analysis based upon models of the entire network. The complexity of the route specification problem and the amount of intelligence and processing power required to solve the route specification problem can force at least a portion of the route determination problem to be solved "off-line" before the communications are actually delivered through the network nodes.
However, selecting routes before communication delivery makes the network vulnerable to link failures. For example, when an off-line process evaluates the route determination problem, a particular link may be operational. Thus, the off-line process specifies the use of the particular link in various routes from various origination nodes to various destination nodes. If this particular link then fails, all communications being delivered in accordance with the off-line process specifications over routes that include the link likewise fail to reach their intended destinations.
The failure of a single link, or even several links, need not permanently impede communications because networks typically support many different routes between potential origination and destination nodes. Thus, the network's off-line route determining process may be repeated taking into account any failed link so that it no longer specifies routes that include the failed link. Unfortunately, this may be a complex and time-consuming process. Moreover, the length of time is increased when the physical configuration is dynamic, such as when network nodes are moving, so that the entire process must be repetitively performed for numerous iterations to track or otherwise simulate the node movement. An additional delay occurs when the solution of the route determination problem is then delivered through the network to all nodes prior to its implementation by the network. The delivery problem may be worse still due the inclusion of failed links in routes over which the solutions are delivered. Consequently, communications may continue to fail for an undesirable long duration after a link failure. Accordingly, there is a significant need for a network and method which respond to a failed link.
A more complete understanding of the present invention may be derived by referring to the detailed description and claims when considered in connection with the Figures, wherein like reference numbers refer to similar items throughout the Figures, and:
FIG. 1 shows a block diagram of a communications network;
FIG. 2 shows a data format diagram of a data packet delivered by the communications network;
FIG. 3 shows a block diagram of a memory structure maintained at switching nodes within the communications network to define routing;
FIG. 4 shows a timing diagram depicting the occurrence of events related to a link failure within the communications network;
FIG. 5 shows a flow chart of a procedure performed by switching nodes;
FIG. 6 shows a flow chart of a procedure performed by a route-determining node;
FIG. 7 shows a graphical depiction of a first route tree for a specified destination node;
FIG. 8 shows a graphical depiction of a second route tree for the specified destination node; and
FIG. 9 shows a flow chart of a generate revised routes process performed by the route-determining node.
FIG. 1 shows a block diagram of a communications network 20. In the preferred embodiments, network 20 includes any number of gateways 22, each of which couples to any number of telephonic devices 24, such as conventional telephone instruments, facsimile machines, modems, and the like. Likewise, network 20 includes any number, potentially but not necessarily in the millions, of subscriber units 26 and one or more route-determining nodes 28. Gateways 22, subscriber units 26, and route-determining nodes 28 use RF communications to communicate with one another through a constellation 30 of switching nodes. In the preferred embodiments, the vast majority of subscriber units 26 are intended to be mobile units which may freely move anywhere on or near the surface of the earth and which may support one call at a time. Gateways 22 and route-determining nodes 28 are also located on or near the surface of the earth, but they may simultaneously support a multiplicity of independent calls. Nothing prevents a route-determining node 28 from also serving as a gateway 22, and vice-versa.
Constellation 30 is formed from any number of switching nodes, which are generally or collectively referred to as switching nodes. In the preferred embodiment, constellation 30 comprises sixty-six switching nodes distributed in low earth, polar orbits to provide coverage over substantially the entire surface of the earth. However, for the sake of clarity FIG. 1 illustrates only an example constellation 30 which includes nine switching nodes, individually referred to with the numbers 31-39. The number of switching nodes may be greater or less than sixty-six switching nodes and the switching nodes may orbit earth in orbits other than polar orbits.
Due to the low-earth orbits, the switching nodes move. In the preferred embodiment, the switching nodes move relative to the earth at speeds of around 25,000 Km/Hr and move relative to each other as their orbits converge while approaching the poles and diverge as they approach the equator. Gateways 22, subscriber units 26, and route-determining nodes 28, which may reside anywhere on the earth, communicate directly with a switching node that is overhead at the moment the communications take place. However, due to the speed at which the switching nodes move, the switching node which supports a given earth-bound link changes from moment to moment.
In the preferred embodiments, gateways 22, route-determining nodes 28 and switching nodes are all computer controlled equipment. In other words, each includes processors, controllers, or other programmable devices which cause the nodes to operate in accordance with computer software which is stored in a memory located in the node. The switching nodes and gateways 22 include switching fabrics which are likewise computer controlled. The switching fabrics cause communications which enter the nodes on any of a variety of links to then leave the nodes over a variety of links. In the preferred embodiments, each switching node has a switching capacity which matches the capacity of all links terminated at the node. In other words, when all links terminated at a switching node carry their maximum amount of communication traffic, the switching node can successfully switch the communication traffic as needed to allow the communication traffic to be delivered through network 20.
In particular, the switching nodes communicate with one another through communication links 40. Desirably, each switching node terminates two or more links 40. For clarity, FIG. 1 illustrates links 40 as terminating only at some neighbor nodes, with no links wrapping around between top and bottom and left and right sides of constellation 30. However, this is not a requirement of the present invention. As a general case, switching node 35 terminates four links 40, which couple to neighbor switching nodes in top (T), bottom (B), left (L), and right (R) directions relative to switching node 35.
In network 20 a communication may originate at any location on or near the surface of the earth. The communication is routed through a gateway 22, subscriber unit 26, or route-determining node 28 to constellation 30. The one of switching nodes 31-39 which receives this up-link communication is considered an origination node. Network 20 routes the communication through switching nodes 31-39 in a manner which is described below. The one of switching nodes 31-39 where the communication is down-linked to the surface of the earth to either a gateway 22, subscriber unit 26, or route-determining node 28 is considered the destination node. All switching nodes that receive the communication from another switching node and transmit the communication to another switching node are considered intermediate nodes.
As an example, FIG. 1 illustrates a scenario where a communication destined for subscriber unit 26 may originate at telephonic instrument 24, and pass through gateway 22, where it is up-linked to switching node 37. Switching node 37 is the origination node, and switching node 31 is the destination node. Network 20 has many options in selecting links 40 for use in routing the communication between origination node 37 and destination node 31. However, a route which passes from node 37, to node 34, and to node 31 is desirable because it is a shortest path route. In other words, any other route will require the use of a greater number of links 40 to deliver the communication between origination and destination nodes 37 and 31. This route makes node 34 an intermediate node for this communication.
Shortest path routes are desirable because they minimize the delay involved in delivering the communication. In addition, they are desirable because they cause network 20 to expend fewer of its finite resources in delivering any single communication, which allows a greater number of resources to remain available for delivering other communications. Further, shortest path routes are more reliable because a failure of a link 40 in constellation 30 is less likely to affect a route which includes fewer links.
FIG. 2 shows a data format diagram of a digital data packet 42 delivered by network 20 (see FIG. 1) in the preferred embodiment. Packet 42 includes a header portion 44 and a payload portion 46. Payload portion 46 conveys the information whose delivery is the purpose for network 20. Header portion 44 conveys overhead data which network 20 uses to manage the delivery of payload portion 46. These overhead data include a routing code 48, which an origination switching node appends to payload data. The routing code defines the route which the packet 42 will take from its origination switching node, through intermediate switching nodes if any, to its destination switching node.
Routing code 48 includes a destination node ID 50 and a logical route ID 52. Destination node ID 50 identifies the destination switching node for packet 42. Route ID 52 specifies one of a plurality of logical routes to follow in delivering packet 42 to its destination switching node. Logical route IDs 52 are assigned to as many physically distinct routes as possible. All packets for a given call desirably follow the same route.
FIG. 3 shows a block diagram of an exemplary routing code table 54 which may be stored at each switching node. Each switching node has its own version of table 54, and no two tables 54 need be identical. Tables 54 are formed off-line at route-determining node 28 (see FIG. 1) and sent to the switching nodes before tables 54 are activated. FIG. 3 illustrates table 54 as being a three-dimensional memory structure. One dimension represents time, another represents route IDs 52 (see FIG. 2), and a third represents destination node IDs 50 (see FIG. 2). FIG. 3 depicts route IDs 52 using codes of zero through seven. Thus, each destination may be reached using any one of eight logically different routes. FIG. 3 depicts destination node IDs 50 using the codes of 31-39 to correspond with the switching nodes 31-39 illustrated in FIG. 1.
A single destination node/route ID array 56 is activated for a given epoch, and table 54 may include any number of arrays 56 to describe routing for any number of epochs. Different arrays 56 are associated with different epochs to track the movement of constellation 30 (see FIG. 1). A routing scheme which may be valid at one moment and defined in one array 56 becomes invalid the next, but another array 56 will define a valid routing scheme for that next moment. In the preferred embodiment, the epochs may be separated from one another by a duration of several seconds to a few minutes. All epochs taken together span a period of time called a planning period. In the preferred embodiments, the planning period lasts longer than 30 hours and is desirably updated at least once a day. Thus, the switching nodes continue to possess valid routing definitions, and these definitions remain valid for several hours should communications with route-determining node 28 become temporarily interrupted.
As discussed above, routing code 48 (see FIG. 2) is appended to a packet 42 (see FIG. 2) at gateway 22 or the origination switching node when the packet's payload data 46 is received over an up-link. When the origination and intermediate switching nodes obtain a packet 42 to which routing code 48 has been appended, they use the routing code 48 as an index into the one of their arrays 56 which is activated for the instant in time when the packet 42 is received. The array 56 produces an identity code for a link 40 (see FIG. 1) to use in routing the packet 42 onto its destination, and the switching node routes the packet 42 in response to this identity code. When the packet 42 arrives at its destination switching node, either array 56 or other controls route the packet 42 on a down-link to a gateway 22, subscriber unit 26, or route-determination node 28 (see FIG. 1). In the example depicted in FIGS. 1 and 3, the identity codes for links 40 specify top (T), bottom (B), left (L), or right (R) links for different routing scenarios.
FIG. 4 shows a timing diagram depicting the occurrence of events related to a possible link failure within network 20. A single planning period extends between time instants T-1 and T0. Prior to time instant T0 new routing data are received at every switching node so that at time instant T0 every switching node activates an array 56 in its table 54 (see FIG. 3) which is associated with time instant T0. The new routing data define routing for the new planning period, which extends from time instant T0 to time instant T4. However, if a link 40 fails in constellation 30, such as link 40' which is terminated by switching nodes 33 and 36 in the example illustrated in FIG. 1, the new routing data become partially invalid. In particular, when tables 54 in various switching nodes specify routes which include link 40', switching nodes 33 and 36 (see FIG. 1) attempt to deliver communications over link 40'. Since link 40' has failed, network 20 now needs to recognize and respond to the failure so that communications will not be dropped.
FIG. 5 shows a flow chart of a procedure 58 performed by each switching node. Procedure 58 is performed by processing, controlling, or like devices which operate in response to software programming instructions stored in a memory of the node. Nothing prevents procedure 58 from performing numerous steps which are not related to the present invention. However, procedure 58 includes a query step 60 which determines whether data intended for storage in routing code table 54 (see FIG. 3) have been received at the node. The data may fill an entire routing code table 54 for an entire planning period or only a small portion thereof which affects selected routing codes on only a selected batch of arrays 56 (see FIG. 3). When such routing code table data are received, step 62 performs any needed decoding and acknowledgments and saves the routing code table data at appropriate locations in table 54.
After step 62 and when step 60 fails to detect the receipt of routing code table data, a query step 64 determines whether the node 30 has received a switched communication. A packet 42 (see FIG. 2) which has routing code 48 appended thereto and which requires routing through origination and switching nodes to a destination node is an example of a switched communication. Of course, a switched communication also refers to a stream of such packets. When no switched communication has been received, program control loops back to perform other steps not directly related to the present invention and to perform step 60, discussed above.
When step 64 detects the receipt of a switched communication packet 42 (see FIG. 2), step 66 reads the routing code 48 (see FIG. 2) appended thereto. Next, step 68 maps this routing code 48 into a link identity through routing code table 54 (see FIG. 3). The link identity specifies whether to use a top (T), bottom (B), left (L), or right (R) link 40 in transmitting the packet 42 onward toward its destination.
After step 68, a query step 70 determines whether the identified link has failed. Step 70 may rely upon conventional tests to verify link integrity. Such conventional tests include internal hardware self-tests, occasional background loop-back procedures conducted in cooperation with neighbor nodes 30, and the like. So long as no failure indication has been detected for the identified link, step 72 delivers the communication packet over the identified link. After step 72, program control loops back to perform other steps not directly related to the present invention and step 60, discussed above.
When step 70 determines that the identified link has failed, a query step 74 determines whether the link failure has been reported yet. If the switching node detecting a link failure is unaware of any link failure reports being previously made, step 76 is performed to report the link failure to route-determining node 28 (see FIG. 1). The link failure report may be made by sending a data communication message to route-determining node 28. While one link terminated by a switching node detecting a link failure, such as link 40' in FIG. 1, may have failed, other links 40 remain operational. Thus, the switching node can still deliver its link failed message through network 20 over the operational links 40. Moreover, if an entire switching node fails, the failure resembles the simultaneous failure of multiple links 40. Other switching nodes are likely to remain operational and be able to report the failures to route-determining node 28. Consequently, route-determining node 28 is highly likely to receive link failed messages shortly after a link fails. Referring briefly to FIG. 4, time "X" denotes an instant when link 40' fails in an example scenario.
After step 76, and when step 74 determines that a link failure has already been reported, step 78 diverts the communication packet in accordance with an interim rerouting procedure. The interim rerouting procedure is one which is driven by internal programming for the switching node, not necessarily table 54 (see FIG. 3). Desirably, the interim rerouting procedure diverts the communication to a link 40 other than the failed link 40'. In addition, the interim rerouting procedure desirably diverts the communication to an operational link 40 which is not the same link 40 over which the communication was received. Within these parameters, several different procedures may be devised. For example, the interim rerouting procedure may divert communications by delivering the communication over a link located counterclockwise (or clockwise) to the failed link, but skipping the incoming link.
The interim rerouting procedure is desirably configured to minimize the likelihood of packets 42 becoming lost in routing loops. Packets 42 which become lost in routing loops are passed back and forth among the same nodes 30. Eventually, when the nodes 30 determine that the packets 42 have become too stale to deliver, the looping packets 42 are dropped without reaching their destination. Giving a packet 42 back to the node 30 from which it was received is likely to cause that node 30 to return it again and initiate a routing loop. Thus, the interim rerouting procedure desirably omits diverting the communication packet to the node from which it was received. However, other interim rerouting procedures cannot guarantee freedom from routing loops, and a certain fraction of diverted communications are likely to be dropped. In addition, even when communications are not dropped unnecessary delay may be imposed on the communications by the interim rerouting procedure.
Consequently, network 20 takes additional actions, discussed below, to quickly revise routing definitions so that the interim rerouting procedure need not be used for a longer duration than necessary. In particular, these actions insure that a recovering response may occur prior to time T4 (see FIG. 4), when the next planning period is scheduled to begin. A quicker response to a link failure is desirable because quicker responses result in fewer communications being dropped and less delay being imposed on communications which are successfully delivered. Moreover, quicker responses reduce the likelihood that network 20 will have to operate with multiple link failures, a situation which, in some situations, may be more difficult to address.
After diverting the communication at step 78, program control loops back to perform other steps not directly related to the present invention and to perform step 60, discussed above. As additional packets 42 are received and directed over failed link 40' by table 54, they will also be diverted in accordance with the interim rerouting procedure. This process continues even when new epochs occur and cause new arrays 56 (see FIG. 3) in table 54 to activate. Eventually, table 54 will be updated through steps 60 and 62. As described in detail below, the updated routing code table data refrain from defining routes that include failed link 40'. Thus, when updated routing code table data are received, stored in table 54, and activated at the appropriate epochs, the interim rerouting procedure will cease operation because steps 68 and 70 will cease to specify the delivery of packets 42 over failed link 40'.
FIG. 6 shows a flow chart of a procedure 80 performed by route-determining node 28 (see FIG. 1). Procedure 80 is performed by processing, controlling, or like devices which operate in response to software programming instructions stored in a memory of node 28. Nothing prevents procedure 80 from performing numerous steps which are not related to the present invention. However, procedure 80 includes a query step 82 which determines whether to generate all routes used by network 20 for an upcoming planning period. Step 82 may respond to the current time so that network routes are automatically generated on a predetermined schedule, or step 82 may respond to user input provided by a human operator at node 28 or elsewhere. When step 82 determines that an entire planning period's routes now need to be generated, step 84 is performed to generate such routes.
Step 84 determines the routing definitions which network 20 will follow in a future planning period. Procedure 80 performs step 84 while operating in a normal mode and not in a failure response mode, discussed below, which quickly responds to link failures. Routing is designed for all potential combinations of origination and destination switching nodes and all epochs in the upcoming planning period. Moreover, step 84 desirably constrains routing to accommodate link capacities. A failed link, such as link 40' (see FIG. 1) has a capacity to convey zero calls. Other links may also have a capacity for zero calls because they may have been intentionally shut down. Desirably, step 84 designs routing to use only non-zero capacity links 40. In a preferred embodiment, step 84 predicts call traffic between all potential origination and destination nodes and designs routes to match this predicted call traffic with link capacities so that each link has sufficient capacity to deliver traffic predicted for the link. However, this is not a requirement of the present invention.
In the preferred embodiments, logical route ID 52 (see FIG. 3) is conveyed using three bits of data. Thus, each packet 42 (see FIG. 2) may specify any one of eight logical routes to a destination switching node. Desirably, these logical routes correspond to shortest path, physically distinct routes as often as possible, given origination and destination node combinations.
FIGS. 7 and 8 show graphical depictions of first and second route trees for an example scenario. This example scenario involves switching nodes 31-39 linked together as shown in FIG. 1 and involves switching node 32 as a destination node. Additional distinct route trees which may be devised for this example scenario are not shown. Each route tree corresponds to one of the many logical route IDs 52. Thus, up to eight different route trees may be prepared for each destination switching node in network 20 in the preferred embodiment. Each route tree depicts shortest paths between each origination node and destination node 32. While the different route trees have some links 40 in common, other links 40 are not commonly used. Of course, for networks with a greater number of switching nodes and/or more complex link interconnections, different route trees may exhibit even greater diversity in physical path selection.
FIG. 7 illustrates a failure in the first route at link 40', which terminates at switching nodes 33 and 36. FIG. 8 shows no route failure because the second route does not include a link between switching nodes 33 and 36. Moreover, while the first route has failed due to the failure of link 40', it remains operational with respect to the non-isolated origination switching nodes, which do not use link 40'. The non-isolated switching nodes for this scenario include nodes 31, 35, 33, 34, 38, and 37. Only nodes 36 and 39 are isolated in the first route by a failure of link 40'.
Referring back to FIG. 6, step 84 generates several different route trees for each switching node acting in a destination node capacity. Moreover, step 84 desirably translates the route tree into data which are sent to routing code tables 54 (see FIG. 3) in each switching node.
After step 84 and when step 82 determines not to generate all routes for a future planning period, procedure 80 performs a query step 86. Step 86 determines whether route determining node 28 has received a link failed message from a switching node. If no link failed message has been received, program control loops back to perform steps unrelated to the present invention and to perform step 82, discussed above.
When a link failed message is detected at step 86, process 80 operates in a failure response mode by proceeding to step 88, where route-determination node 28 begins the process of quickly responding to the failure of a link 40. The link failed message desirably coveys the identity of the failed link. Step 88 determines future start and stop epochs which define a future period of time for which updated routing data are to be generated. In the preferred embodiments, start and stop epochs are defined so that updated routing data are generated for a period of time more brief than the planning period.
Step 88 desirably establishes a start epoch which is no farther in the future than necessary. Thus, network 20 need not operate under the interim rerouting procedure discussed above in connection with step 78 (see FIG. 5) for longer than necessary. On the other hand, the stop epoch is set sufficiently far into the future to allow route-determining node 28 to generate revised routing data and to deliver the revised routing data to the switching nodes throughout network 20. For the example scenario depicted in FIG. 4, the initial start epoch may be set at a time instant T1.
Step 88 desirably establishes a stop epoch which is minimally delayed from the start epoch. For the example scenario depicted in FIG. 4, the initial stop epoch may be set at a time instant T2. A lengthy duration between start and stop epochs, such as might occur by using T4 (see FIG. 4) as a stop epoch, is undesirable because it involves a greater amount of data than a shorter duration. This greater amount of data requires a longer time to generate and a longer time to deliver to the switching nodes. Consequently, greater delay between start and stop epochs causes network 20 to operate under the interim rerouting procedure for a longer duration. On the other hand, the stop epoch needs to be sufficiently delayed from the start epoch to permit route-determining node 28 to generate and deliver a subsequent batch of routing data updates before the actual stop epoch occurs.
After step 88 defines start and stop epochs, step 90 identifies a next future epoch to evaluate in a programming loop. Step 90 is performed in a programming loop which generates updated routing data for the entire network 20 for the future period defined by the start and stop epochs. One iteration of this loop is performed for each epoch between the start and stop limits, inclusive. After step 90, a query step 92 determines whether revised routes have been generated yet for the stop epoch. So long as the stop epoch has not yet been evaluated, a process 94 is performed to generate revised routes for the subject epoch. Process 94 is discussed below in connection with FIG. 9. When process 94 completes its generation of revised routes for a subject epoch, program control loops back to step 90, where the next epoch is evaluated.
When step 92 eventually determines that revised routes have been generated for the stop epoch, step 96 formulates routing code table updates as needed to implement the revised routes. Desirably, process 94 and step 96 are each configured to reduce the quantity of data involved in defining revised routes relative to the quantity of data involved in the normal planning period route definition mode. The reduction of data allows route revision data to be generated more quickly and speeds delivery of the revised routing data to the switching nodes.
After step 96, step 98 sends the routing code table updates to the switching nodes. Step 98 delivers the updated data over network 20, which has a failed link. Consequently, the successful delivery of any one message is not necessarily guaranteed. Thus, step 98 may involve the sending of multiple messages and the verifying of appropriate acknowledgments in delivering the revised routing data.
Next, a query step 100 determines whether the stop epoch occurs before the beginning of the next planning period. So long as the stop epoch occurs before the beginning of the next planning period, program control loops back to step 88 and process 80 remains in its link failure response mode. After looping back to step 88, revised routes are generated for new start and stop epochs. For the example scenario depicted in FIG. 4, a second iteration of step 88 sets time instant T2 as a start epoch and a time instant T3 as a stop epoch, and a third iteration of step 88 sets time instant T3 as a start epoch and time instant T4 as a stop epoch. Thus, revised routes are generated and delivered to the switching nodes in batches until the next planning period begins. When step 100 eventually determines that the stop epoch matches the beginning of the next planning period, process 80 leaves the link failure response mode and program control loops back to perform steps unrelated to the present invention and to perform step 82, discussed above. Until another link failed message is received, network 20 continues to operate in the normal mode where routing is designed and implemented for an entire planning period.
FIG. 9 shows a flow chart of process 94, which generates revised routes as discussed above in connection with FIG. 6. Generally, process 94 implements an outer programming loop, wherein each iteration of the outer loop evaluates a different switching node in a destination node role. Process 94 also implements an inner programming loop, wherein each iteration of the inner loop evaluates a different route tree for the subject destination node. Route trees which include a failed link are identified and altered as necessary to reconnect isolated nodes. The data describing the alteration serve as revised routing data. Routing data resulting from route trees which do not include the failed link and routing data resulting from non-isolated nodes are not altered.
Process 94 performs step 102 to identify a next destination node to evaluate in a programming loop which eventually evaluates all the switching nodes in a destination node role. After step 102, a query step 104 determines whether all destination nodes have been evaluated yet. When all destination nodes are evaluated, process 94 has finished, and program control returns to step 90 (see FIG. 6) in process 80.
When step 104 determines that all destination nodes have not yet been evaluated, step 106 identifies a next route tree to evaluate in a programming loop which eventually evaluates all route trees prepared for the subject destination node. In the preferred embodiment, up to eight different route trees may be prepared for each switching node operating in a destination node role. FIGS. 7 and 8 depict two of the route trees which may be prepared for an example scenario with node 32 as the subject destination node. After step 106, a query step 108 determines whether all route trees for the subject destination node have been evaluated yet. When all route trees have been evaluated, program control loops back to step 102 to process the next destination node.
When step 108 determines that not all route trees have been evaluated, a query step 110 determines whether the subject route tree includes a failed link. As discussed above, the route tree depicted in FIG. 7 includes failed link 40', but the route tree depicted in FIG. 8 does not include a failed link. When step 110 determines that the subject route tree does not include a failed link, as depicted by the route tree in FIG. 8, then the route tree does not define a failed route. Step 112 is performed to take any actions which may be necessary to refrain from altering a route tree which does not include a failed link. Step 112 may be completed quickly, and may even be performed in some situations by taking no action. Accordingly, process 94 quickly deals with routes that have not failed. After step 112, program control loops back to step 106 to evaluate the next route tree for the subject destination node.
When step 110 determines that a subject route tree includes a failed link, as depicted in FIG. 7, process 94 has discovered a failed route. Step 114 identifies all nodes which are isolated in the route tree by the failed link. In the example scenario depicted in FIG. 7, nodes 36 and 39 are isolated by the failure of link 40' because the failed link prevents communications from these origination nodes to be delivered to destination node 32.
Next, step 116 generates a shortest path definition that does not include the failed link. Shortest path definitions are generated for all isolated nodes. The resulting shortest path definitions are saved as a revised route. FIG. 7 indicates the revised shortest path definitions by the dotted line linking nodes 35 and 36. The failed route is revised by altering the route tree to include the link 40 between nodes 35 and 36 rather than failed link 40'. This revised route is configured to divert communications away from the failed link.
After step 116, step 118 is performed to take any actions necessary to refrain from altering the route tree with respect to non-isolated nodes. Step 118 may be completed quickly, and may even be performed in some situations by taking no action. Accordingly, process 94 quickly deals with non-isolated nodes in failed route trees. After step 118, program control loops back to step 106 to evaluate the next route tree for the subject destination node.
In summary, the present invention provides an improved communications network and method for responding to a failed link. The preferred embodiments of the present invention respond to a link failure in a manner that reduces the number of communication failures and delays imposed by the link failure. The preferred embodiments of the present invention respond to a link failure by quickly revising only a fraction of an entire routing plan.
The present invention has been described above with reference to preferred embodiments. However, those skilled in the art will recognize that changes and modifications may be made in these preferred embodiments without departing from the scope of the present invention. For example, those skilled in the art may arrange processes, steps, and procedures differently than described herein while achieving equivalent results. These and other changes and modifications which are obvious to those skilled in the art are intended to be included within the scope of the present invention.
|Cited Patent
|Filing date
|Publication date
|Nov 9, 1989
|Feb 5, 1991
|Nippon Telegraph And Telephone Corporation
|Adaptive routing control method
|Nov 6, 1989
|Mar 12, 1991
|At&T Bell Laboratories
|Automatic fault recovery in a packet network
|Mar 21, 1990
|Jul 2, 1991
|Asea Brown Boveri Ltd.
|Process for transferring data packets
|Mar 30, 1990
|Jul 14, 1992
|Nec Corporation
|Multidrop control network commonly used for carrying network management signals and topology reconfiguration signals
|Jan 3, 1991
|Jan 26, 1993
|At&T Bell Laboratories
|Telecommunications network restoration architecture
|Mar 25, 1992
|Sep 28, 1993
|Motorola, Inc.
|Call processing using logical channel assignments
|Jun 26, 1991
|Nov 9, 1993
|Digital Equipment Corporation
|Intermittent component failure manager and method for minimizing disruption of distributed computer system
|Apr 27, 1992
|Aug 22, 1995
|At&T Corp.
|System for restoration of communications networks
|Citing Patent
|Filing date
|Publication date
|Oct 7, 1994
|Mar 31, 1998
|British Telecommunications Public Limited Company
|Protection network design
|Jun 26, 1996
|Mar 31, 1998
|Mci Corporation
|Segment substitution/swap for network restoration pre-plans
|Mar 12, 1996
|Sep 8, 1998
|International Business Machines Corporation
|Automatic reconfiguration of multipoint communication channels
|Dec 29, 1995
|Jun 22, 1999
|Mci Communications Corporation
|Restoration systems for an optical telecommunications network
|Mar 27, 1997
|Jul 20, 1999
|Nec Corporation
|Alternate routing of management message to simplified network element in a ring network
|Dec 6, 1996
|Jul 27, 1999
|Intel Corporation
|Communication network with reversible source routing that includes reduced header information being calculated in accordance with an equation
|May 1, 1998
|Aug 8, 2000
|Emulex Corporation
|Automatic loop segment failure isolation
|Dec 1, 1997
|Nov 7, 2000
|Samsung Electronics Co., Ltd.
|Technique for discriminating presence of talking path in lattice communication network control system
|May 1, 1998
|Feb 13, 2001
|Emulex Corporation
|Automatic isolation in loops
|Sep 15, 1999
|Mar 13, 2001
|Emulex Corporation
|Automatic loop segment failure isolation
|Jul 31, 1996
|Aug 14, 2001
|Motorola, Inc.
|Automatic timing adjustment for diverse routing of HFC systems
|Sep 15, 1999
|Sep 11, 2001
|Emulex Corporation
|Automatic isolation in loops
|Jun 15, 2000
|May 21, 2002
|Cplane Inc.
|High speed protection switching in label switched networks through pre-computation of alternate routes
|Nov 4, 1998
|Nov 9, 2004
|Gateway, Inc.
|Convenient system, method, and software for online computer users to summon offline computer users
|Feb 3, 2004
|Jan 17, 2006
|Nortel Networks Limited
|Automatic protection switching using link-level redundancy supporting multi-protocol label switching
|May 24, 2001
|Jan 17, 2006
|International Business Machines Corporation
|System and method for enhancing the availability of routing systems through equal cost multipath
|May 4, 2001
|Apr 25, 2006
|Emulex Design & Manufacturing Corporation
|Automatic isolation in loops
|Jun 29, 2001
|Apr 25, 2006
|Corvis Corporation
|Method for wavelength switch network restoration
|Jul 28, 2000
|May 9, 2006
|Cisco Technology, Inc.
|Method and system for routing communications among computer networks
|Dec 21, 2001
|Jul 11, 2006
|Itt Manufacturing Enterprises, Inc.
|Method and apparatus for routing information in satellite communication networks
|Jan 6, 2005
|Nov 6, 2007
|Cisco Technology, Inc.
|Method and system for modeling behavior of elements in a telecommunications system
|Dec 1, 2005
|Jan 1, 2008
|At&T Corp.
|Method for automatically identifying component failure in a communication network
|Mar 31, 2003
|Jul 22, 2008
|Symantec Operating Corporation
|Publishing a network address in a computer network
|Sep 19, 2003
|Aug 19, 2008
|Network Equipment Technologies, Inc.
|Partitioning and categorizing data in a split-plane architecture for fast recovery from data plane failures and fast restarts
|Mar 13, 2006
|Aug 4, 2009
|Cisco Technology, Inc.
|Method and system for routing communications among computer networks
|Mar 2, 2007
|Feb 2, 2010
|Nortel Networks Limited
|Method and apparatus for computing alternate multicast/broadcast paths in a routed network
|Mar 10, 2006
|Mar 30, 2010
|Trilliant Networks, Inc.
|Method and apparatus for maximizing data transmission capacity of a mesh network
|Apr 13, 2007
|Feb 1, 2011
|University Of Ottawa
|Limited perimeter vector matching fault localization protocol for survivable all-optical networks
|Dec 20, 2002
|Sep 25, 2012
|Symantec Operating Corporation
|Peer-to-peer network with recovery capability
|Dec 24, 2009
|Jun 23, 2015
|At&T Intellectual Property I, L.P.
|Determining connectivity in a failed network
|Feb 23, 2012
|Oct 20, 2015
|Donald R. Korb
|High alcohol content sanitizer
|Jun 29, 2001
|Apr 11, 2002
|Daniel Wang
|Method for wavelength switch network restoration
|Feb 7, 2002
|Aug 22, 2002
|Maple Optical Systems, Inc.
|System and method for fault notification in a data communication network
|Feb 7, 2002
|Sep 19, 2002
|Maple Optical Systems, Inc.
|System and method for providing multiple levels of fault protection in a data communication network
|May 24, 2001
|Jan 2, 2003
|International Business Machines Corporation
|System and method for enhancing the availability of routing systems through equal cost multipath
|Dec 21, 2001
|Jul 24, 2003
|Albert Futernik
|Method and apparatus for routing information in satellite communication networks
|Mar 10, 2006
|Feb 8, 2007
|Skypilot Networks, Inc.
|Method and apparatus for maximizing data transmission capacity of a mesh network
|Apr 13, 2007
|Dec 6, 2007
|University Of Ottawa
|Limited perimeter vector matching fault localization protocol for survivable all-optical networks
|Mar 2, 2007
|May 8, 2008
|Nortel Networks Limited
|Method and apparatus for computing alternate multicast/broadcast paths in a routed network
|Mar 12, 2009
|Sep 16, 2010
|Ford Global Technologies, Llc
|Fuel systems and methods for controlling fuel systems in a vehicle with multiple fuel tanks
|Mar 23, 2009
|Sep 23, 2010
|Honeywell International Inc.
|Memory node for use within a data storage system having a plurality of interconnected memory nodes
|Dec 24, 2009
|Jun 30, 2011
|At&T Intellectual Property I, Lp
|Determining Connectivity in a Failed Network
|Dec 5, 2002
|Jul 2, 2003
|Itt Manufacturing Enterprises, Inc.
|Method and apparatus for routing information in satellite communication networks
|Dec 5, 2002
|Mar 9, 2005
|Itt Manufacturing Enterprises, Inc.
|Method and apparatus for routing information in satellite communication networks
|Jun 29, 2001
|Jan 10, 2002
|Cinta Networks Corporation
|Method for wavelength switch network restoration
|Feb 7, 2002
|Aug 22, 2002
|Maple Optical Systems, Inc.
|System and method for fast-rerouting of data in a data communication network
|Nov 1, 2007
|May 8, 2008
|Nortel Networks Limited
|Method and apparatus for computing alternate multicast/broadcast paths in a routed network
|U.S. Classification
|370/221, 379/221.03, 340/2.7, 714/4.2
|International Classification
|Cooperative Classification
|European Classification
|Feb 27, 1995
Owner name: MOTOROLA, INC., ILLINOIS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NATARAJAN, KADATHUR SUBRAMANYA;REEL/FRAME:007356/0275
Effective date: 19950221
|May 30, 2000
|Fee payment
Year of fee payment: 4
|Mar 29, 2004
|Fee payment
Year of fee payment: 8
|Jun 9, 2008
|Maintenance fee reminder mailed
|Dec 3, 2008
|Lapse for failure to pay maintenance fees
|Jan 20, 2009
|Expired due to failure to pay maintenance fee
Effective date: 20081203


text:
"My 20yrs old son had radiotherapy, ..."
About: The Christie The Christie Manchester M20 4BX
Posted by Ann Coleman (as ),
What I liked
My 20yrs old son had radiotherapy, every day for 3 weeks, at the hospital.Whilst there, he was also seen on the Young Oncology Unit daily. The experience for both of us was a totally positive one.Everyone we came into contact with, in both units, was friendly, helpful and professional.Throughout the hospital we also had the same experiences from the ladies on the voluntary run tea bar, restaurant and reception. Parking was no problem. There was a carpark just for patients who were having radiotherapy, and this was free, using a code given to you in the department. We never had to wait long to be seen, in fact most days my son was seen right on time. We were impressed with the cleanliness of all the areas we visited in the hospital, including the toilets. I would wholeheartedly recommend the hospital to any one and would also say to anyone who has to attend the hospital for treatment to not worry at all because they will be so well looked after.
What could be improved
From our experience I could not think of any area which could be improved.
Anything else?
The staff, from volunteers to consultants, do a wonderful job at this hospital and do their very best to try and make your visits stress free and comfortable.

subset: commoncrawl


text:
Dallas Mayoral Candidate Arrested for Painting "666" on Local Buildings, Landmarks, Us
Joe Tone
Richard Sheridan -- perennial gadfly candidate, profane voicemail leaver and word-salad chef extraordinaire -- has been arrested in connection with the June 2014 tagging of a number of Dallas buildings, including the Legacy of Love Monument in Oak Lawn, the Cathedral of Hope and the building where the Observer is located.
Sheridan, who's currently running against Mike Rawlings and Marcos Ronquillo for mayor, was picked up Friday afternoon after a grand jury indicted him for painting "666" on the monument and Cathedral of Hope, the two incidents for which Dallas police have the best case against Sheridan, the department said.
Both charges are state jail felonies, Assistant Dallas Police Chief Randy Blankenbaker said at a press conference, but if prosecutors prove that Sheridan chose to tag Legacy of Love and Cathedral of Hope because of their significance to the gay community, the charges could be upgraded to third-degree felonies.
The candidate told the Morning News in August that he wasn't responsible for the graffiti but that he knew who was. He agreed with the tags, he said, because they were an "act of love" and a warning. Of what, he didn't say, but a January Facebook post gives us some clues:
Who wants to stop the GAY MARRIAGE ATTACK ON OUR CHRISTIAN NATION?WE MUST DO ALL WE CAN TO HELP STOP THE SODOMITES...
Posted by Richard Sheridan on Monday, January 12, 2015
Get the ICYMI: Today's Top Stories Newsletter Our daily newsletter delivers quick clicks to keep you in the know
Catch up on the day's news and stay informed with our daily digest of the most popular news, music, food and arts stories in Dallas, delivered to your inbox Monday through Friday.
Recommended for You
Powered by SailThru
Upcoming Events
University of North Texas Mean Green Football vs. UAB BLAZERS FOOTBALL
TicketsSat., Sep. 23, 5:30pm
SMU Mustangs Football vs. Arkansas State Red Wolves Football
TicketsSat., Sep. 23, 6:00pm
Mesquite Championship Rodeo
TicketsSat., Sep. 23, 7:30pm
Dallas Stars vs. Colorado Avalanche
TicketsMon., Sep. 25, 7:30pm
Sponsor Content


text:
Metal: Platinum Tested Platinum Gemstones/Diamonds French Cut Synthetic Sapphires, Diamonds Approx. 4.00 - 4.40ctw Clarity:Vs1/Si1 Color:H Measurements: Bracelet 7 1/8" Long, 8.2mm Wide ( 1 Inch = 25mm) Weight 32g Description: Excellent Condition !!!
Please enter your question below.
Sign up to get the latest news and promotions!
Please select which emails you would like to receive


text:
Please wait...
1997 Ford Explorer Eddie Bauer 4X4
1997 Ford Explorer Eddie Bauer 4X4 (Four Wheel Drive) Clean & Loaded!!
1997 Ford Explorer Eddie Bauer 4X4 4-Door SUV
Exterior Color: Ivory Metallic
Interior Color: Tan
Stock Number: 5681
Mileage: 215,013
Engine: 5.0L NA V8 overhead valves (OHV) 16V
Fuel: Gasoline
Transmission: Automatic
Warranty: Extended Warranty Available
Title: Clear
CARFAX: CARFAX Buyback Guarantee
Internet Price: $1,950
Vehicle Description
CLEAN CARFAX / 4X4 / 1997 FORD EXPLORER EDDIE BAUER SUV IN GOOD CONDITION INSIDE AND OUT! This do anything 4x4 SUV is an awesome trade in we just received and is presented in White Exterior on Brown Leather interior. With only 2 owners since new, this vehicle comes with an awesome history and Clean Car Fax showing No accidents or unwanted incidents. It comes equipped with All Wheel Drive, Factory Running Boards, JBL Premium Sound System, 6-Disc CD Changer, Tape Deck (with an option to get an AUX connector to play music for your phone), Power Seats, Power Windows and Locks, Cruise Control, Rear Climate and Audio Control, Tow Hitch, Alloy Wheels with good rubber all the way around and more! Don't wait, please give us a call at 425-881-3211 for more information, or for your chance to see this vehicle in person. Thanks for looking!
Contact Information
Championship Motors
: (425) 881-3211
Vehicle Features & Options
Standard Features
Air Conditioning:
Front Air Conditioning
Dual Front Airbags
Audio System:
Power Antenna
AM/FM Radio
4-Wheel ABS
Power Brakes
Comfort Features:
Leather Steering Wheel Trim
Convenience Features:
Center Console
Cruise Control
Trunk Release Multi-Function Remote
Power Steering
Tilt Steering Wheel
Exterior Features:
Two-Tone Paint
Skid Plate(s)
Tachometer Gauge
Exterior Entry Lights
Power Side Mirror Adjustments
Roof Rack
Driver Seat Power Adjustments
Bucket Front Seats
Passenger Seat Power Adjustments
Cloth Upholstery
Power Door Locks
Tires And Rims:
Tire Type
16 Inch Wheel Diameter
Chrome Wheels
Intermittent Front Wipers
Power Windows
Rear Privacy Glass
Rear Wiper
Rear Window Defogger
Vehicle Condition & History
FREE CARFAX Report
Get the FREE CARFAX
Vehicle History Report with
the Buyback Guarantee!
Protect yourself from:
» Major Accidents
» Lemon History
» Odometer Problems
» Major Accidents
» Lemon History
» Odometer Problems
Free CARFAX Report
Dealership Information
Championship Motors
(425) 881-3211
Business Hours
9:00 AM to 7:00 PM
|9:00 Am to 6:00 PM
|11:00 Am to 5:00 PM
8210 Avondale Way NE
Redmond, WA 98052
Redmond, WA 98052


text:
About Toni BuzzeoSee more books from this Author
Concerned mama giraffe knows many threats exist on the African savanna, but her little Twiga ("giraffe" in Swahili) "is so curious." The "tall, tall mama…leans close and whispers a warning, / No, little Twiga.Mar 18 2012 | Read Full Review of Stay Close to Mama
Like all babies, Twiga the giraffe is curious. He hears, smells, or sees something new and off he gallops, oblivious to the anxieties of his âtall, tall mama,â who knows that predators are everywhereJan 30 2012 | Read Full Review of Stay Close to Mama
Browse Book and Journal Content on Project MUSE. OR. Books and ... Stay close, stay safe"), he sets off across the African savannah in search of the smell.| Read Full Review of Stay Close to Mama
An aggregated and normalized score based on 6 user ratings from iDreamBooks & iTunes


text:
"My treatment at Inclusion Matters has been life changing"
About: Inclusion Matters Wirral Inclusion Matters Wirral CH41 1EL
Posted by Moon92 (as ),
My treatment at Inclusion Matters has been life changing. I was an emotional mess when I first started, now I feel fine and like a different person. Michelle is excellent at what she does. She is kind, empathetic and has really helped me through everything. She is an asset to Inclusion Matters. Thank you
Do you have a similar story to tell? Tell your story & make a difference ››


text:
SEHO Systems GmbH, a worldwide leading manufacturer of automated soldering systems and customer-specific solutions, announces that it will cooperate with STANNOL GmbH in the American market. For more than 130 years, STANNOL has been a reliable partner to the electronics industry when it comes to innovative soldering materials such as solder and flux.
The foundation for the cooperation was laid at the 2014 SEHO Technology Days at the end of October at SEHO's North American headquarters in Cincinnati, OH. The focus was on both machine technology from SEHO and the possibilities for sustained improvements in the soldering process. Also, insights into STANNOL's expert knowledge were presented with an emphasis on the characteristics of different flux compositions and the effect of flux residues on the reliability of assemblies.
"We are looking forward to including STANNOL's innovative solders in our portfolio," explained Markus Walter, Managing Partner at SEHO. "We have been very successful in the USA and Mexico for many years. Through the strategic cooperation with STANNOL, we can now offer our customers solutions for the consumables sector, perfectly combining ecological and economic aspects."
With a structured network of trained and experienced sales professionals in the USA and Mexico, SEHO North America, Inc. offers its customers first-class support for all questions related to the soldering process.
"STANNOL is renowned for the high quality standards of its products," added Marco Dörr, Sales Manager at STANNOL GmbH. "We invest heavily in research, and together with partners such as SEHO, are working on the development of new technologies for the electronics industry. With SEHO North America we have found the ideal partner for the future, now enabling us to offer our solders to customers in America."
With the concept of "everything from one supplier," SEHO realizes efficient, high-performance complete solutions. The modern soldering systems for wave, selective and reflow soldering processes are augmented by creative solutions for product handling and integrated solder joint inspection systems. STANNOL's advanced solders and fluxes ideally complete the portfolio.Further information can be found at www.sehona.com and www.stannol.de.


text:
- Trending Now: More Trending:
- Svengali syzygy hegemon repugnant white nationalist, white supremacist
Definition of Cobdenism
: the political and economic doctrines of Richard Cobden, 19th century English statesman and economist whose national policy was for peace, for withdrawal from the European competition for balance of power, and for free trade
There's more!
Love words? You must — there are over 200,000 words in our free online dictionary, but you are looking for one that's only in the Merriam-Webster Unabridged Dictionary.
Start your free trial today and get unlimited access to America's largest dictionary, with:
- More than 250,000 words that aren't in our free dictionary
- Expanded definitions, etymologies, and usage notes
- Advanced search features
- Ad free!
Origin and Etymology of cobdenism
Richard Cobden †1865 English statesman and economist + English -ism
Seen and Heard
What made you want to look up Cobdenism? Please tell us where you read or heard it (including the quote, if possible).


text:
The aib file extension is related to the ArcInfo software and used for its binary coverage data.
Software that works with aib file extension
AIB file extension - ArcInfo binary coverage file
What is aib file? How to open aib files?
File type specification:
The aib file extension is associated with the ArcInfo a full-featured geographic information system for Microsoft Windows and Unix-based operating systems.
The aib file stores some kind of data used by ArcInfo.
The default software associated to aib file type:
Company or developer:
ArcInfo is GIS suite that contains ArcEditor, ArcView and ArcReader and adds advanced spatial analysis, extensive data manipulation, and high-end cartography tools. ArcInfo is now called ArcGIS for Desktop Advanced.
List of recommended software applications associated to the .aib file extension
Recommended software programs are sorted by OS platform (Windows, macOS, Linux etc.) and possible program actions
that can be done with the file: like open aib file, edit aib file, convert aib file, view aib file, play aib file etc. (if exist software for corresponding action in File-Extensions.org's database).
- Others aib file
Unspecified and all other actions for computer programs working with aib file - ArcInfo binary coverage file
Click on the software link for more information about ArcInfo. ArcInfo uses aib file type for its internal purposes and/or also by different way than common edit or open file actions (eg. to install/execute/support an application itself, to store application or user data, configure program etc.).


text:
A man who pleaded guilty in New Orleans' federal court to credit card fraud charges after a Disney cruise ship rescued him from a boat that capsized in waters between Florida and Cuba has received a 2 1/2-year prison sentence.
Additionally, Jesus Enrique Gonzalez Torres could spend up to three years on supervised release, and he was ordered to pay nearly $8,000 in restitution, along with five co-defendants who have also pleaded guilty in the case, U.S. Attorney Kenneth Polite's office said this week.
Gonzalez faced up to seven years in prison after pleading guilty this summer in front of U.S. District Judge Nannette Jolivette Brown to conspiracy to commit credit card fraud as well as aggravated identity theft.
Three admitted credit card thieves can blame their federal convictions in New Orleans on the…
Court records alleged that Gonzalez and the other defendants came to the New Orleans area from Florida in the summer of 2015 and collaborated on placing credit-card skimming devices on gasoline station pumps.
Prosecutors said the group encoded any stolen credit card numbers onto counterfeit gift and prepaid debit cards to make various purchases. They were arrested and then charged by the feds after a cashier examining the pumps at a Harahan gas station spotted two skimming devices and called authorities.
Having made bail, Gonzalez and two of his co-defendants boarded a boat and tried to reach their native Cuba in April, but they capsized about 40 miles north of the Caribbean island's coast.
The Disney Fantasy cruise liner then plucked the would-be fugitives out of the water before they were turned over to authorities and returned to New Orleans to face the federal charges filed against them there.
It is not unusual for groups of Cubans specializing in credit-card fraud and similar crimes to flee to Cuba from the U.S. once they are caught because of that country's policy against extraditing its nationals to American authorities, according to a 2015 investigation by Florida's Sun Sentinel newspaper.
Schemes like the one Gonzalez and the others were charged with running have cost big-box retailers millions of dollars, the Sun Sentinel added.
An attorney for Gonzalez and his co-defendants has said his clients came to the U.S. to escape Cuba's dictatorial government only to discover they could not make a living wage here with their level of education.
Gonzalez was the first of the defendants in the case to be sentenced.


text:
'GTA Online' update: Special discounts, new vehicles and other perks players need to grab while they last
"GTA Online" remains to be one of the most popular games to date. Earlier this month, the title has released the "Bikers" downloadable content (DLC) for Xbox One, PlayStation 4 (PS4) and PC, then added more vehicles after a few days.
As seen on the Rockstar Games official website, the new downloadable content "brings underground motorcycle clubs to the forefront of the Los Santos and Blaine County criminal underworld with a rash of all new competitive and co-operative gameplay, as well as new modes, vehicles, weapons, clothing, and much more."
Two more vehicles were added to the list of choices, allowing gamers to acquire their sixth vehicle. Furthermore, Rockstar Games will reportedly announce more rewards and discounts, which will arrive on Oct. 24.
Right now, players are able to get the Western Logo Hoodie for free. This could be achieved by simply accessing "GTA Online" before the offer ends on Oct. 24. Players who want to earn more GTA money should never miss the Double GTA$ & RP as well. It can be accessed in the Slipstream, which is the new Adversary Mode.
Various Stunt Races are also being conducted right now through the special Double GTA$ & RP Playlist.
"If you need extra back-up for your newly formed Motorcycle Club or you're looking for a break from police attention, both Lester and Merryweather have cut their prices in half across their entire catalog of Services," the post reads.
There is also a 25 percent discount being offered for items like Tire Smoke, Rims, Turbos, Resprays, and other items to customize a vehicle. The Ammu-Nation is also offered at a discounted price, plus further reduction of price for Body Armor, Bullet Ammo, Drum, Box Magazines and Throwables, among others.
If this should not be enough, players have a chance to get more GTA$ when purchasing Shark Cards, aside from the Cash-Back rewards that come with a Whale, Great Whale, Megalodon Shark Card and Bull purchase. See details below.
- Bull Shark — 15 percent money back (GTA$75,000)
- Great White Shark — 30 percent money back (GTA$375,000)
- Whale Shark — 35 percent money back (GTA$1,225,000)
- Megalodon Shark — 50 percent money back (GTA$4,000,000)
All these perks should be grabbed while they last.


text:
Chief Data Officer Europe 2017
Register here.
The Chief Data Officer (CDO) has emerged as one of the most valuable emerging C-Suite positions in today's turbulent business environment. A champion, who has grappled with the strategic advantage that comes with leveraging data as a core strategic asset. Naturally the role's rise to prominence has mirrored the growing abundance and diversity of vast data sources now available to many of today's organisations. However, this transition has not come without it's challenges with Gartner stating that only 50% of Chief Data Officer's will be hailed a success. The CDO Forum, Europe returns to enable the CDO community to establish the best practices in consolidating the evolving data-leadership roadmap and empower data executives in their journey of transformation.


text:
Zemana AntiLogger 2.70.204 Premium Version Free!
Zemana AntiLogger 2.70.204 Pre-Cracked Version is a lightweight application that monitors who is doing what on your PC. Rather than recognizing malware in view of its mark unique finger impression, similar to all malware items with sweep usefulness, the Zemana AntiLogger 2.70.204 Serial Key full gets malware right now it assaults your PC.
Despite the fact that a security application, this is not an antivirus, but rather it could team up with such a product answer for convey the most progressive safeguard for one's PC. It can distinguish keyloggers, screen, webcam and clipboard lumberjacks without backing off Windows and, all the more critically, without influencing the movement of other security devices that may be introduced on the framework.
Zemana AntiLogger 2.70.204 Full Version 2017 is right when a PC is polluted with a keylogger it can see and record all keystrokes that you compose on your PC. It can then log this information and send it to a remote region so that the customer can take your passwords, record accreditation's, and singular information. By using a framework like Zemana AntiLogger 2.70.204 Free Serial Key, your keystrokes are protected from unapproved access by scrambling what you compose so its restrictive open to the venture you are using.
Basic Features of "Zemana AntiLogger 2.70.204 Crack Full":
- Anti-SSL Logger Module that gives security against SSL Logger
- Anti-WebCam Logger that gives security against WebCam Logger
- Anti-Key Logger Module that gives security against Key Logger
- Anti-Screen Logger that gives security against Screen Logger
- Anti-Clipboard Logger that gives security against ClipBoard Logger
- System Defense Module that secures your framework
- Prevent malignant projects from taking your usernames and passwords
- Screens your PC continuously, constantly.
- No outputs are required.
- 100% mark autonomous: does not depend on a database of known dangers
- Intense, yet light. Does not back off your PC
OS: Windows XP/Vista/Vista 64 bit/7/7 64 bit/8/8 64 bit/2003/10/10 64 bit
Least 50 MB Hard Disk Space
Least 128 MB RAM
Least Intel Pentium 300 MHz Processor (or proportionate)
1- Download Zemana AntiLogger trail version from above connection.
2- After Download Install as trail and don,t open the programme.
3- Download Crack along with guideline from the given link.
4- It is compressed file, extract it and introduce it to Zemana AntiLogger programme folder.
5- Use Serial Key to Register.
6- All Done Enjoy! Zemana AntiLogger 2.70.204 Full Version 2017 Registration.


text:
rate her 1-10?
and why?
Most Helpful Guy
I think you look lovely00|00|0
rate her 1-10?
and why?
I think you look lovely
Have an opinion?
Hard to see but seems average if I'm seeing her correctly. Need more detail.
an 8 for me really nice face and from what I can see of the body is fairly skinny/healthy which is really attractive plus I generally find Asian girls really attractive.
Hard to say because it's not a great pic. She looks quite pretty though. Generally I'm not that into Asian girls because they usually have small boobs.
9/10 because she's pretty,,
She's attractive
difficult to rate with these pics. small, dark and shitty quality. but seems to be pretty
She's so hot, i need her right now LD
She looks pretty, but the pics are kinda dark
from what i can see looks fine!!
8/10 because she is pretty
I'd do her.
I can't see all of her, I guess her face looks ok.
God you are hot
Super cute!
honest opinion
7-8. Ummmm... as for why... I can't really put a finger on it.
She is cuteee
1 i dont like em... sorry
8 I guess but a dark photo is hard to judge
You cannot undo this action. The opinion owner is going to be notified and earn 7 XPER points.


text:
The Winklevoss twins have certainly been busy the past several months, adding new features to Winkdex, rolling out new Android and iOS applications, and working on the ETF that is likely to launch soon.
Now, we can add another item to the long list of things they've worked hard on. Gemini is a new bitcoin exchange that Cameron stated is "a next generation bitcoin exchange".
In a letter written on the new website Cameron Winklevoss wrote,
When we began our ETF journey, we soon concluded that a US-regulated ETF wasn't enough. A growing number of US investors, traders, financial institutions and businesses wanted to get involved with bitcoin directly, but had no options other than to trade overseas or sit on the sidelines. So, we began looking into exactly what it would take to create a US-based bitcoin exchange.
Some of the more fascinating parts of the Gemini project include a United States banking partner for the exchange which Cameron describes,
We are also thrilled to announce that we have secured a banking relationship with a New York State-chartered bank. This means that your money will never leave the country. It also means that US dollars on Gemini will be eligible for FDIC insurance and held by a US-regulated bank. Your US dollars on Gemini will be as safe and secure as they are in your bank account today.
It now appears that the twins have assembled a 14 person team to bring this project to a reality.
While the service is not yet online those interested in receiving early access can signup on the Gemini website here.
Coin Fire
Latest posts by Coin Fire (see all)
- Film Distributor Lionsgate Accepting Bitcoin - October 6, 2015
- Federal Investigations of Cryptsy Underway - October 4, 2015
- Security Alert: Used Cloudminr.io? Change ALL Passwords. More than 79 thousand users impacted. - July 13, 2015


text:
Question: What is a cost driver Give three examples of costs
What is a cost driver? Give three examples of costs and their possible cost drivers.
View Solution:
View Solution:
Answer to relevant QuestionsExplain linear-cost behavior.Why should an analyst always plot cost data in addition to applying least-squares regression analysis? "Step costs can be fixed or variable, depending on your perspective." Explain.Describe the methods for measuring cost functions using past cost data.American Sports, an outdoor sports retailer, is planning to add a Web site for online sales. The estimated costs of two alternative approaches are as follows:At the expected level of orders, which online approach has the ...
Post your question


text:
23 April 2004
Yesterday The Rt. Hon, Lord Mayor of the City of London, Alderman, Robert Finch, set the seal on the Spitalfields development, Bishops Square, designed by Foster and Partners, with the burial of a time capsule containing contemporary items, to add to the rich history of the Spitalfields area.
Bishops Square is being developed by the Spitalfields Development Group, a subsidiary of Hammerson plc and its joint venture partners, The Corporation of London. When completed, the scheme will consist of 70,000 m (760,000 ft) of offices and 4,000 m (45,000 ft) of shops, restaurants, cafes and bars, as well as extensive public spaces. The offices will be occupied by international law firm, Allen &Overy.
Hammerson Development Director, Peter Cole, placed a set of coins of the realm in the capsule to mark the next chapter in Spitalfields long and varied history.
The Lord Mayor of the City of London, Robert Finch, added an original Spitalfields Fruit and Vegetable market Porters Badge, a copy of The Times newspaper and a copy of his monthly schedule.
Lord Foster attended the ceremony and added a small model of the Bishops Square scheme to the capsule. He commented:
Today we are marking the contribution that this project and its public open spaces will make towards the continuing renewal and regeneration of Spitalfields, one of Londons most historically important and vibrant neighbourhoods.
Further Information
For further information please contact:
Katy Harris
Senior Partner, Head of Communications
Foster + Partners
E firstname.lastname@example.com


text:
Smoke is the professional choice for all-in-one video editing and effects on the Mac
Autodesk Smoke professional video editing and effects software for Mac is designed to meet the needs of video editors who need to do more than just edit. By integrating a familiar timeline workflow and node-based compositing, Smoke connects editing and effects like never before. Smoke video editing software for Mac includes finishing tools for 3D compositing, color correction, and motion graphics. This all-in-one workflow eliminates the need for round-tripping between multiple creative applications and provides a fast and iterative creative environment for storytelling
Unpack, burn or mount with D-Tools & install
Check Crack/install.txt on DVD1


text: Pharma jobs in Chennai: Latest Pharma job vacancies in Chennai. Search & apply online for best jobs in Chennai in Pharma category. 3 Latest job openings https://www.freshersworld.com/jobs/category/pharma-job-vacancies-chennai 2017-08-22 10:31:47 Pharma jobs for freshers in Chennai: Find your dream job in Chennai from a number of job opportunities in Pharma category. Register now to get latest Pharma job updates.


text:
In DAC& CITIES we have collected all The Danish Architecture Centre's offers related to development of future cities and landscapes. Hear danish and international experts lecture on sustainable city development, or become inspired by cities from all over the world, when we share our knowledge through cases, interviews and talks.
Sustainable Cities™ >
We aim to inspire and engage in conversations about sustainable cities with people, communities and organizations from all over the world. We collect and disseminate knowledge in order to help people and cities become more sustainable in future.
Find more books about cities, urban planning and sustainability
HACK KAMPMANN - Del 1: De unge år belyst gennem tegninger, akvareller og breveElisabth Gehl, Marie Louise Kampmann Soldbro DKR 398,00
Last updated Tuesday, May 30, 2017


text:
Images are generic.
Cusco Weld In Roll Bar End Piece Bracket Only (QTY 1)
Product Details
Roll Cage FIA Joint Kit Bar Side For Steel Safety21
CUSCO products are made after the strictly established standard of CARROSSER with the highest quality based upon the data from each specific vehicle. CUSCO products are tested on actual cars and performance tested as well.
Images used may be generic. Actual product may vary.
Product Reviews and Ratings
This product has no reviews at the moment.
Have a review for this product? Sign in to leave a review


text:
We were commissioned by Rise Nation in West Hollywood to produce a permanent installation to add to their workout experience. Rise Nation is the first-of-its-kind climbing conditioning studio founded by celebrity trainer Jason Walsh. The ceiling installation extends the typical training soundtrack found in high-impact workouts into an immersive spatial environment. While the lights are on in the training studio the irregular surface of the installation invokes the feeling of being under a rocky terrain. Once the workout begins and the lights are turned down the installation comes alive through a large array of internal LEDs. At first glance, the installation appears to be a plain rocky surface, but the precise gaps between the panels allow the reflected light from the LEDs to pass through in irregular ways to create an animated surface that ranges from simple fades to a field of lighting. The LEDs are programmed with various behaviors to accompany the different soundtracks played during workouts. Created with SOFTlab.
We deliberately designed the sculpture to have a specific modern architectural aesthetics so that it would feel like an organic extension of the space even without light activation. The installation serves as both a sculptural ceiling under normal conditions and a high intensity interactive light field during workout sessions. By using an irregular surface in tandem with a low-res pixel grid we were able to achieve intricate patterns that would have required a much more complex LED array on its own.
Each specially fabricated cells contain unique aluminum and komatex components that were put together by hand during the installation. Creating sturdy connecting points between the aluminum frame and komatex panels was a labor intensive process that required careful assembly.
The installation is made of a custom aluminum frame that was designed in a modular way to be flat packed and easily assembled on site. The "grid" is made of 160 cells. Each cell is made of unique aluminum pieces that were labeled and detailed from a computer model of the installation. The sculpture covers almost 500 square feet of the ceiling and uses about 5600 LED's. The aluminum frames were fabricated in Brooklyn and Komatex panels were laser cut using a custom architectural algorithm.


text:
I wholeheartedly support a Stargate swap. New episodes for Atlantis start, what, January 4th on SciFi in the US, right? If there's enough interest sign ups could open up then to celebrate it coming back after the holiday break.
I just want an excuse to craft a felt version of Rodney McKay. Haha.


text:
TJFL Wins Division Championship
|November 2, 2016
News Release: For Immediate Release
Re: Teaneck Junior Highwaymen win again!
The Teaneck Junior Highwaymen/ Pop Warner Pee Wee (11 & 12 year old)football team was again victorious this past weekend at the North Jersey Pop Warner Division 2 Championship. The (6-2) Junior Highwaymen hosted the undefeated (8-0) East Orange Jaguars and came away with a 14-6 victory. Next up is the North Brunswick Indians on Saturday, November 5th in the first round of the regional tournament. If the Junior Highwaymen can continue to win they will find themselves playing for the national championship in Disney World in three weeks!
*To view their game winning photo, please click here


text:
Haven't joined yet? Join MYX |
Happy 15th anniversary to the OPM band that gave us hits like "Torete" and "Migraine", Moonstar88!
Formed in 2000, the female-fronted band began to make waves in the college circuit. Soon after, their music attracted record labels and radio stations - and the rest is history!
In celebration of their 15th year, Moonstar88 will be releasing a new album this 2015. The band is also playing at the UP Fair tonight at 9pm! Their anniversary set will definitely bring out the feels!
Don't forget to follow your favorite music channel on Facebook, Twitter and Instagram!
Do you have a message for Moonstar88? Feel free to leave a comment!


text:
it Seems that Justin Bieber liked to chat with his fans. Recently, he suddenly appeared at a high school graduation than happy not expecting to see his pupils. And recently he decided to continue his communication with the fans in an informal setting.
having a little break at work (singer, worked in a recording Studio), Justin went into the street, where he had groupies, and had a fun time with them. Moreover, he even organized a small concert, singing several songs and danced with the girls. And one of the sports their fans, he even competed in the women's short track.
Satisfied the fans, ... ... plenty of selfies, boasted images in svoih «Instarmac».
Photo: Instagram
the Russian premiere of the new part of the animated film "Madagascar" took place last Thursday, and she began its March on the Russian cinema record number of screens — 1830.
This fact suggests that the distributors "Madagascar 3» do not doubt the love of the Russian audience to the familiar heroes and cartoons in General. And, it should be noted that the risk paid off — in their first day of hire the tape has shown a record box office — 130 million rubles, thus overtaking the previous leader — the fourth part of the "Shrek» from 89 million in 2010.
Well, what drew the audience, can be found in our kiloampere "Madagascar 3".
In September of last year it became known that Gwen Stefani is pregnant for the third time. A 44-year-old singer and her husband, the guitarist of British rock band Bush, Gavin Rossdale has two sons: 7-year-old Kingston and 5-year-old Zuma. And, of course, the artist really wanted to, she had a beautiful assistant. However, on the last day of winter, February 28, in the family Stefani and Rossdale have another defender. Parents gave him quite a complex name — Apollo Bowie Flynn Rossdale (Bowie and Flynn mother's maiden name of Stefani and the Rossdale).
And while Stephanie became the mother of many children, Scarlett Johansson is just getting ready to experience the joy of motherhood. Rumor has it that the actress is pregnant from her fiance, French journalist Romain Doriana, with whom she got engaged last fall. Moreover, as reported by anonymous sources, the star is already in her fifth month of pregnancy. However, the Actresses while this news is not confirmed.
Last Johansson seen at the ceremony of the French prize «Cesar» at the end of February, and as eyewitnesses speak, her rounded tummy was already visible. By the way, «Oscar» the actress has not arrived.