text:
|Publication number
|Publication type
|Application number
|PCT number
|Publication date
|Jun 21, 2011
|Filing date
|Sep 8, 2004
|Priority date
|Sep 15, 2003
|Fee status
|Also published as
|Publication number
|Robert E Hancock, Andrej J Mihailovic, Jochen O Eisl, Philip L Eardley
|Original Assignee
|British Telecommunications Public Limited Company
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (17), Non-Patent Citations (2), Referenced by (6), Classifications (34), Legal Events (2)
|External Links: USPTO, USPTO Assignment, Espacenet
This application is the US national phase of international application PCT/GB2004/003853 filed 8 Sep. 2004 which designated the U.S. and claims benefit of EP 03255750.6, dated 15 Sep. 2003, the entire content of which is hereby incorporated by reference.
1. Technical Field
The present invention relates to a telecommunications system, in particular to a telecommunications system which includes a mobile network.
It is known for portable communication devices to attach to different points on a network. Thus, for example, a user can connect a portable computer to one attachment point, move to a new geographical location where there is provided another attachment point and attach the computer to the network at that new attachment point. Where users travel together, for example on a common vehicle such as a train or aeroplane, it can be advantageous for the communication-equipment of each user to be connected to, a local network, such as a Local Area Network (LAN) within the vehicle. As well as being able to communicate amongst each other, the users will normally be able to receive common services from the local network. Furthermore, if the attachment to the main network is through a radio link, and the local network includes a transmitter/receiver, the communication devices may take advantage of the transmitter/receiver provided by the local network.
2. Related Art
So that the communication devices can be reached at different attachment points on the main network, a directory facility such as a "Home Agent" can be provided in the main network. The directory facility for each communication device normally stores information which can be used to facilitate the routing of data to the current attachment point of the communication device. The directory facility may contain the address corresponding to the current attachment point, or the directory facility may contain another address indicative of a location where further routing information can be found. When the attachment point of a communication device changes, the communication device will normally send a message to the directory facility associated with it, so that the routing information stored in the directory facility can be updated to reflect the change in the attachment point of the communication device.
However, in the case where a plurality of communication devices move together as part of a local or mobile network, the amount of signalling required between the communication device's and their respective directory facilities when the point of attachment changes can be undesirable.
According to one aspect of the present invention, there is provided a telecommunications system including: a mobile network having a plurality of portable communication devices, and router means arranged in use for routing data to and from the portable communication devices; and, a main network which includes a signalling agent, a plurality of directory agents, and a plurality of spaced apart attachment points to which the mobile network can attach in order to communicate with the main network, wherein in use, each directory agent stores routing information for routing data to a respective mobile communication device associated with that directory agent, and wherein, in response to a signalling message from which it can be inferred that the point of attachment of the mobile network has changed, the signalling agent is configured to send a respective update message to each directory agent, the update messages each including updated routing information such that on receipt of the, updated routing information, each directory agent can update the stored routing information thereof so as to take into account the changed point of attachment of the mobile network.
Because the signalling agent is configured to send a respective update message to each directory agent, the need for each communication device to send such a message itself to its respective directory agent is reduced. This will reduce the amount of signalling generated to update the directory facilities when the mobile network changes its attachment point, as compared to the signalling that would be generated if each communications devices were to attempt to contact their respective directory agents. The reduction in traffic will be particularly important in the case of communications devices travelling as part of a mobile network, as such communication devices are likely to each change their point of attachment at the same time. Preferably, the mobile network is configured to (generate and/or) transmit the signalling message, although the signalling message may alternatively be sent by a node at the current point of attachment of the mobile network. The signalling message will preferably include information indicative of the topological position of the changed point of attachment of the mobile network. For example, the signalling message may include a routable network address which corresponds to the current point of attachment.
The respective routing information stored by each directory agent will preferably include information from which the point of attachment of the or each portable communication device associated with that directory agent can be ,inferred or from which the location (e.g. the topological location) of a device can be inferred. The point of attachment may be inferred directly, or indirectly: for example, a directory agent may store the address of an intermediate router, the intermediate router itself storing a record of the current point of attachment of the mobile network.
To allow the mobile network to be temporarily attached to an attachment point on the main network, the attachment points will preferably be provided with respective wireless communication means, the mobile network including further wireless communication means such that a wireless link can be formed between an attachment point and the mobile for communication therebetween. This will conveniently allow a link between the main network and the mobile network to be formed and broken. Alternatively, the link may be electrical, the attachment points having respective releasable electrical connector means.
The attachment points will preferably be stationary, and may be provided by respective ground base stations. However, the attachment points could be formed by satellite nodes, the nodes being either moving with respect to a ground reference point or alternatively stationary, in the manner of a geo-stationary satellite. In a preferred embodiment, the main network is a ground network, the signalling agent and at least one directory agent being provided in one or more ground nodes. This will conveniently allow the signalling agent to be used as part of an existing (modified) network.
The nodes of the portable devices will preferably be configured to send a respective or collective registration message indicative of the identity and/or the network location of the respective directory agent of each portable device. The signalling agent may store and then use this identity and/or location information to send updated routing information to each of the directory agents. Thus, the signalling agent will reduce the need for the mobile network to transmit this identity/location information each time the mobile network changes its point of attachment. This will be particularly advantageous if the directory agents each have a different network address, for example if the network agents are located at different geographical locations. The separation between directory agents may be at least 1 km or 10 km or even 100 km.
The registration message will preferably also include an indication of any caller node(s) which may wish to contact a portable device, or for example which is/are presently in communication with that portable device. This may be useful if the caller nodes are configured to support route optimisation, in which case an update message may be sent to a caller node, such that the caller node can route data directly to the new location of the portable device with which it communicates.
A plurality of signalling agents may be provided, each acting for a plurality of portable devices. A plurality of signalling agents may be useful if for example the mobile network has different classes of portable devices, such as portable "laptop" computers or mobile telephones, where each class of device has different signalling requirements.
The main network will preferably have a predetermined topological structure. Normally, the network will be formed by a plurality of nodes, and a plurality of links for connecting the nodes, each node in the main network having a respective network address for routing data thereto. Each node may be a router or other data processing equipment, and need not be located at the intersection of network paths. For example, a node may be formed by terminal equipment, such as a computer terminal, or other communications equipment. Preferably, the signalling agent and each directory agent will be implemented in one or more nodes, the nodes and/or agents each having a network address which is indicative of the respective topological position of each respective node and/or agent. The functionality of a given agent may be distributed between two or more nodes, which nodes need not be co-located. The main network may include two or more sub-networks, the sub-networks for example being administered by different administrators. The directory agents may be located in the same sub-network, or the directory agents may be distributed-between the sub-networks.
When the mobile network moves, the portable devices of the mobile network will preferably move together, any relative movement between the portable devices being superposed on the movement of the mobile network. Thus, the movement of the portable devices may be described by the movement of a common reference point, any movement of the devices relative to that common reference point being small in comparison to the movement of the reference point itself. Moveable support means may be provided for supporting the portable devices, such that movement of the support means will cause a common movement of the portable devices. The support means may be a platform, or a vehicle, such as a train. Preferably the topological structure of the mobile network will remain the same as the mobile network moves. The mobile network may be a Local Area Network. Alternatively, the mobile network may be a Personal Area Network (PAN), in which a plurality of portable devices are connected together and mounted on a person. The devices forming a PAN may be connected by a wireless link, and may form connections between themselves on an ad hoc basis (for example one of the devices acting as a mobile router, or alternatively, the devices may need to be connected to one another or to a mobile router by a user). The PAN may include attachment means for releasable attaching the devices to a person.
The mobile network may have two or more routing devices for connecting the portable devices, so as to route data within the mobile network. The connections between portable devices and a router may be formed by a respective electrical connection, or a radio link. Although the devices connected within a mobile network may change as devices enter or leave the network, the topological-structure of the mobile-network will preferably remain unchanged as the mobile network moves.
In order to route data efficiently through the main network, the addresses of the nodes in the main network will preferably be arranged in a hierarchical structure relative to one another, each address including an ordered set of components, each node having a hierarchical level associated therewith, each component of an address corresponding to a hierarchical level, wherein a high level node at one hierarchical level is connected to a plurality of low level nodes which are at a lower hierarchical level, the addresses of the respective lower level nodes being such that the value of the component corresponding to the level of the high level node is common to each low level node. In such a system, the respective addresses of the high level node and the lower level nodes connected thereto will share the same prefix, the leading components being the same for each address. To distinguish between the different nodes, the address of each node will preferably have different trailing components; that is, the suffixes will be different for each address. Examples of such a system include systems running according to the Internet Protocol, such as IPv6 or IPv4. In such a system, data will preferably be transported as data packets, each packet having a payload portion, and an address portion in which the destination address of the packet is stored.
Preferably, each portable device will have an identifier such as a network address, name or other identifier associated therewith, which identifier is retained by the portable device as the mobile network moves from one attachment point to another, the directory agent for each portable device storing a mapping between the identifier for that device and a temporary address indicative of (or routable to or through) the current attachment point of the mobile network. In one embodiment, the identifier of a portable device is a network address. The network addresses of a portable device and its associated directory agent will preferably be topologically related, such that the directory agent can intercept data addressed to its portable device, and forward that data towards the portable device. However, if the identifier of a portable device is a name, for example a DNS name or SIP URI, the network addresses of a portable device and its associated directory agent are unlikely to be topologically related.
So that the directory agent for a portable device can more easily route data towards that device and/or so that the directory agent for a portable device can more easily inform a node that wishes to communicate with the portable node of the portable node's current temporary address, the signalling agent will preferably update the directory agents by sending each agent a message, the message for a given directory agent including the current (temporary) address of the or each portable device associated with that agent. Different messages may be addressed to different directory agents, or alternatively the signalling agent may broadcast a collective message to all the directory agents.
In a preferred embodiment, the portable devices and the router means of the mobile network will be allocated related temporary addresses, which related addresses have a common prefix portion. The temporary address associated with the current point of attachment will preferably have a prefix portion which is the same as the prefix portion of the addresses allocated to the mobile network. Since the prefix portion will preferably be indicative of the topological position of the attachment point, the allocation of addresses with this same prefix to the mobile network will facilitate the routing of data to the mobile network. In such a situation, the signalling message from the mobile network will preferably include at least one address, the address having the common prefix portion. Likewise, the update message from the signalling agent to each directory agent will preferably include an address having the common prefix portion. The update message for a directory agent may include the temporary address of a portable device itself, or alternatively, the update message may contain the temporary address allocated to the router means of the mobile network, in which case the router means will preferably be configured to open incoming packets and determine which of the portable devices of the mobile network that packet should be addressed to.
Further aspects of the invention are specified in the appended claims. The present invention is described in further detail below, by way of example, with reference to the following drawings in which:
With reference to
The mobile router 20 has a wireless transmitter/receiver stage for communicating over a wireless radio link 28 with a base station 30 of the fixed network 14 (in the example of
When the mobile network 12 moves from a point within range of a first mobile station BS-A, to a point within range of a second base station, BS-B, a handover process occurs, in which the radio link 28 with BS-A is discontinued and a new radio link is formed with BS-B, such that the-mobile network "attaches" to BS-B. In order for a caller node C1 to communicate with one of the mobile node, say MN1, the data between the caller node C1 and the mobile node MN1 must be routed through the fixed network 14, in particular through the correct base station, the correct base station 30 being dependent on the position of the mobile network as the mobile network moves. Several systems/protocols exist for routing data through the correct base station. In the IPv6 (Internet Protocol version v6) system, each node 13 (including the base stations 30) is allocated a permanent IP address by an allocation unit 32. Each address has a plurality of components, 16 in the case of IPv6, each-component belonging to a different hierarchical level. Addresses can be represented in the form a.b.c.d . . . , where each letter corresponds to a component, higher letters of the alphabet corresponding to lower level components. The topology of the fixed network 14 is arranged such that the addresses of lower level nodes, each of which is connected to a common node at the next level above, will share a component. The level of the shared component corresponding to the level of the common node. This allows packets to be routed between nodes in the fixed network solely on the basis of the IP address of the destination node carried by the packet.
The mobile router 20 and the mobile nodes 16 each have a permanent address allocated to them (by the address allocation unit 32). However, because these nodes do not have fixed topological positions, within the network system 10, the IP addresses of these nodes will not normally indicate their position with regard to other nodes of the fixed network, and thus the IP address of a mobile node will not normally in itself be sufficient for a packet addressed to it position of that node.
To allow a mobile node to "found" in the network system, and to therefore allow packets to be routed to a mobile node, a base station 30 will normally allocate a temporary address to a node connected to it. In IPv6, such an address will normally be a "co-located care of address", this being allocated to a mobile node from a set of spare v6 addresses which that base station has previously been allocated by the allocation unit 32. The care of address allocated by a base station will have a component in common with the permanent address of the base station itself, the position of that component in the address corresponding to the hierarchical position, of the base station, so that packets whose destination is one of the allocated care of addresses can be routed to the issuing base station. To allow the base station to route packets to the appropriate mobile node, the base station will keep a table which maps the care of address of each mobile node to the radio channel which the mobile router 20 is configured to receive. Each base station BS-A, BS-B will normally be connected to the fixed network via respective access routers AR-A, AR-B, which access routers may store and allocate care, of addresses, the base stations serving merely to transmit messages from the access routers.
Each mobile node has associated therewith a home agent (HA) node, the home agent being topologically located such that it can intercept packets being sent to the permanent address of the mobile node with which it is associated (for simplicity, it is assumed that a home agent anode only has one mobile node associated with it). The home agent will store, in a correspondence table, a mapping between the permanent address of its mobile node and the care of address currently allocated to the mobile node. (Thus, each home agent will store a mapping between on the one hand an identifier for the mobile node associated with the home agent, and on the other hand a temporary address for other routing information for routing data to associated mobile node: in the case where a home agent acts for a plurality of mobile nodes, the home agent will store such a mapping for each mobile node). If the home agent intercepts any packets for that mobile node, the home agent is configured to encapsulate each packet it intercepts in a packet whose destination address is the care of address of the mobile node, thereby establishing a "tunnel" between the home agent and the mobile network. The home agent then transmits the encapsulated packet towards the mobile network. Because the care of address is indicative of the topological position of the base station to which the mobile node is connected, the encapsulated packet can be routed to the mobile node in the normal way.
In the case of a mobile network where the mobile nodes are routed through another mobile node such as the mobile router MR of
Although each mobile node may share a common home agent, different mobile nodes will often each have a respective home agent associated with them as indicated in
When a mobile node, say MN1, attaches to the network 14 at a new point, for example through base station BS-B, the mobile node MN1 will register its new care of address with its home agent HA1, and the home agent will update its correspondence table so as to map the mobile nodes permanent address to the new care of address. Likewise, each other mobile node MN2, MN3, which is part of the mobile network 12, will register its new care of address when it attaches to a new point on the network. However, in the case of a mobile network where the mobile nodes MN1-MN3 of the mobile network generally move together, the mobile nodes are likely to connect to a new base station at substantially the same time, in particular where traffic from the mobile nodes is routed through a common mobile router MR as shown in
To reduce the amount of signalling required between the mobile network 12 and the fixed network 14, in particular the amount of signalling over the wireless link between the two networks when the mobile network 12 attaches to a new point on the fixed network 14, there is provided a signalling agent 34 in the fixed network. The signalling agent is configured to notify the home agent (e.g. HA1) for each mobile node (e.g. MN1) when the mobile nodes attach to a new point on the network, and to provide the home agents with the updated address information required for the home agents to "tunnel" packets to the newly located mobile nodes. Since only a single message is required from the mobile network for the signalling agent 34 to be notified of the new location for the mobile nodes, as opposed to a separate message from each mobile node, the amount of bandwidth used over the radio link between a mobile network and a base station is reduced. The base station can then use the limited bandwidth available to communicate more efficiently with other nodes or mobile networks. The amount of bandwidth saved by the presence of the signalling agents will be particularly important where there are many mobile nodes on the mobile network. Although only three nodes are shown in
As shown in
The operation of the signalling agent 34 and/or the signalling stage 40 will be described below with reference to the following steps (which need not be carried out in order): a registration step in which the mobile nodes 16 and the signalling stage 40 register with the signalling agent 34; a de-registration step in which mobile nodes 16 and the signalling stage 40 inform the signalling agent 34 that the signalling agent is no longer to send signals on their behalf; a mobility update stage in which the signalling step informs the signalling agent that the mobile network has moved to a point within range of a new base station; and, a signalling step in which the signalling agent sends messages on behalf of the mobile nodes (and possibly the signalling stage).
In the registration step, (once communication is possible between the fixed network 14 and the mobile network 12 as in the prior art), the signalling stage 40 will send a message to the signalling agent 34 indicative of the identity of the signalling stage. This information will be useful to the signalling agent as the signalling agent may act for several mobile networks, each mobile network having its own signalling stage. If incoming traffic enters the mobile network via a single router co-located with the signalling stage as shown in
Each mobile node will send to the signalling agent 34 a list indicating the respective addresses of the nodes which should be updated with the mobile node's care of address when the mobile network attaches to a new base station. For each mobile node, the "receiving nodes" which should be informed of the mobile node's new care of address include that mobile node's home agent, so that the home agent can update its correspondence table when necessary with the mobile node's current care of address. This list of receiving nodes for a mobile node will preferably also include the addresses of other nodes such as "calling nodes" which are or will be in communication with that mobile node. Such calling nodes could include news providers which send news items at intervals to nodes on their membership list. Alternatively, a calling node may be a mobile telephone in communication with a mobile node. In either case, it would be useful for the signalling agent to be able to update these calling nodes with the mobile node's new care of address. If route optimisation is taking place, and a tunnel has been established between a calling node and a mobile node, then if a calling, node is informed of the mobile node's new care of address, a new tunnel can be established directly, without first contacting the home agent of that mobile node.
As an alternative to the registration method described above, the mobile router 20 may register with the signalling agent 34, (after the mobile nodes have registered with the mobile router), and the mobile router may send to the signalling agent a message indicating the permanent address of each mobile node registered with the mobile router (as opposed to simply routing the registration messages of each mobile node). As a further alternative, the mobile router may intercept the registration messages of the mobile nodes, and send a registration message itself on behalf of the mobile nodes. In this way, the signalling agent 34 will be able to store information indicative of the identity of each mobile node 16 for which it is to act.
In order for mobile nodes to discover the existence of the signalling agent 34, the signalling agent may send each mobile node which enters the mobile network 12 a message. This message will indicate the address of the signalling agent 34 and preferably indicate the type of mobility management messages which the signalling agent 34 can send, as well as other indications of the capabilities of the signaling agent. Alternatively, the signalling agent 34 may be reachable at a "well-known" address which has been previously been entered into the memory of each mobile node. In either case, when the mobile node enters the mobile network 12, for example by connecting to the mobile router 20, the mobile node can attempt to register with the signalling agent.
The mobility update step takes place when the mobile network 12 changes its point of attachment on the fixed network 14, for example when the mobile router 20 ceases to communicate with BS-A and instead communicates with BS-B. When this occurs, the mobile router 20 and the mobile nodes 16 will lose the care of addresses previously allocated to them by the base station BS-A, which care of addresses will each be replaced by a new set of addresses issued by the base station BS-B. The message(s) sent by the mobile router 20 to the signalling agent 34 when the mobility update takes place will depend on the way in which the mobile nodes are allocated care of addresses by the base station. In one embodiment where a base station delivers a set of addresses to the mobile router, which addresses are related by a common prefix, the following steps are carried out: (i) each mobile node is issued with a care of address (for example at a base station) which care of address includes the common prefix, the suffix of the address being related to a unique identifier for the mobile node, (such as the mobile node's MAC address) in order to reduce the risk of address duplication; (ii) at the registration stage, the mobile router informs the signalling agent 34 that upon a change of point of attachment, each mobile node will retain its suffix, the new care of address of each mobile node having the new prefix for the new location, followed by the existing suffix; (iii) when the point of attachment of the mobile network changes, a signalling message with the new prefix for the new location is sent to the signalling agent; and, (iv) the signalling agent (which has stored a mapping between an indication of each mobile node and the suffix for that mobile node received at the registration stage) then combines the new prefix and the existing suffix for each mobile node so as to form the care of address for each mobile node, and the signalling agent then sends respective update messages with the new care of address to each home agent. This will reduce the amount of signalling required over the radio link 28 when carrying out the update step, since only the prefix of each new care of addresses needs be transmitted, as opposed to each entire care of address each time the mobile router attaches to a new point in the fixed network 14.
In another embodiment, the mobile router will not request specified suffixes for the care of addresses it receives from a base station. In the mobility update step, the mobile router will then inform the signalling agent of the entire new care of addresses allocated to itself and to the mobile nodes 16.
Once the signalling agent 34 has received information from the mobile router indicative of the new care of address of at least some of the mobile nodes, the signalling agent 34 can carry out a signalling step in which the signalling agent informs the respective home agent of each mobile node of the mobile node's new care of address. To do that, the signalling agent will retrieve from a memory location the addresses of the home agents previously received at the registration stage, and will send "binding agent" information to each home agent indicating to that home agent the new care of address of its mobile nodes. If a home agent is acting for more than mobile node in the mobile network 12, the signalling agent will send an update message to the home agent which update message will include: an identifier which identifies the list of mobile nodes (identified by their respective permanent addresses) which the signalling agent is acting for (the permanent addresses in the list having previously been sent to the signalling agent at a registration stage); the new care of address for each mobile node; and, an indication that the update is for the aforementioned list.
An update message will preferably also be sent by the signalling stage 34 to one or more correspondence or "calling" nodes, such as node C1 or C2. Although the home agent of a portable device will allow the calling node to reach that portable device without the calling node being aware of any changes in the attachment point of the mobile network, a calling node may be configured to carry out route optimisation, such that the calling node sends messages to the portable device directly rather than through the home agent. In such a situation, an update message from the signalling agent containing the new care of address of a portable device can be used by the caller node to carry out fresh route optimisation and send packets directly to the new location of the portable device.
Clearly, once a mobile node has successful registered with a signaling agent, it may be advantageous that, when the mobile node receives a new care of address because the mobile network has changed its point of attachment on the fixed network, the mobile node ceases to send update messages to its respective home agent, since the signaling agent will send update messages to its directory agent(s) as required on its behalf.
The main network may include more than one signaling agent 34. The mobile router 20 currently registered with a signaling agent may register with another signaling agent. Such re-registration could be carried out following for example a request from the first signaling agent. Alternatively the mobile router may decide to re-register, for example because it is significantly nearer to the second signaling agent, or the second signaling agent has better capabilities or it is cheaper to use. Preferably the second signaling agent would obtain the information from the first signaling agent about the mobile node's 16 currently registered with it. Re-registration would preferably be accompanied by de-registration from the first signaling agent, but this is not required.
It is possible for some mobile nodes 16 to be registered on one signaling agent and other mobile nodes 16 within the same mobile network 12 to be registered on another signaling agent. For example, the signaling agents may be able to support different kinds of update messaging to a directory agent; for example, mobile IPv4 and mobile IPv6. In this case, the mobile router will be registered with each signaling agent and send each message(s) when the mobile network changes its point of attachment on the fixed network 14.
When a mobile network 12 is about to leave the fixed network 14, the manner in which de-registration takes place will depend on how registration was previously achieved. For example, if each mobile node registered directly (through the mobile router), then each mobile node will de-register directly by sending a message to the signalling agent indicating to the signalling agent that it will no longer be required to send update messages to the mobile node's home agent. A mobile node will also send a de-registration message if the mobile node is about to leave the mobile network, even when the mobile network remains attached to the fixed network 14. A de-registration message. when a mobile node is about to leave the mobile network will be important, since without such de-registration, the signalling agent may continue to send to the home agent updated addresses which are no longer indicative of the mobile node's location.
In the case where the mobile network is a Personal Area Network (PAN), the network being formed by a group of nodes that is very localised and closely associated with a single person, travelling together as a single unit, a node may wish to communicate with another node within the PAN. It may also wish to communicate with a node in the main network. Such communication would be through one of the nodes within the PAN that acts as a gateway with the main network.
In another embodiment a mobile node (MN) does not obtain a temporary address from the Base Station. Instead the MN obtains an address from the mobile router 20 which is a "private address", that is to say the address is only meaningful, and should be used, within the mobile network 24. The mobile router includes "Network Address, Translator" (NAT) functionality whereby it stores a mapping between a MN's private address used within the mobile network and a public address, such that the mobile router has sufficient public addresses to allocate one to each MN. The public address is the address by which the MN is known within the main network. A packet sent to this address reaches the mobile router 20, which looks up this address in its mapping table and alters the address to the private address at which the MN can be reached within the mobile network 24. The opposite mapping process occurs in the reverse direction (that is, when a MN sends a packet to a node in the main network). When the mobile network moves to a new base station, it obtains a new set of public addresses. The MN's private address does not change, however the mobile router updates its mapping table by selecting a new one of its public addresses to map to a MN's private address. The mobile router sends a message to the signalling agent 34 informing it about each MN's new public address. The signalling agent 34 updates each of the MN's Home agents. In the case where the mobile router does not have sufficient public addresses to allocate one to each MN, then the mobile router includes "Network Address Port Translator" (NAPT) functionality whereby it stores a mapping between a MN's private address used within the mobile network and a public address combined with a port number. For example, in one embodiment the same public address is used for all the MNs. When the mobile network moves to a new base station, it obtains a new public address. The mobile router sends a message to the signalling agent 34 informing it of this new public address. The signalling agent 34 updates each of the MN's HAs with this new public address. Alternatively, a MN's permanent home address can be used within the mobile network 24, as though it were a "private address". In such a situation, the mobile router 20 will have NAT or NAPT functionality.
The mobile network 12 or some or all of the fixed network 14 may operate according to the IPv4 protocol. When the mobile network 12 is attached to those portions of the fixed network which operates using IPv4, the mobile nodes will preferably be allocated care of addresses which are not co-located, such that a base station attached to the mobile network will not store a mapping between the care of address of a mobile node and a radio channel, but will instead decapsulate the packet, and forward it to the correct mobile node using a mapping between the care of address of the mobile node and its permanent address (a mapping being provided between the permanent address and the correct radio channel).
In an another possible embodiment, when each mobile node is informed that it has a new care of address (because the mobile network has changed its point of attachment on the fixed network 14), then it sends an update message to its directory agent(s), for example to its home agent, and also the "calling nodes" C1,C2 if route optimisation is used. (In some others embodiments, the mobile nodes does not send such update messages). The mobile router has an additional interception stage 99, associated with its routing stage 36, which: (i) recognises such an update message, (ii) stores it temporarily, along with other similar update messages, (iii) creates a new message which contains several or all of the update messages that have been temporarily stored, (iv) sends the new message to the signaling agent. On receiving this message the signaling agent extracts the original update messages, which it then routes as normal i.e. to the directory agent(s). Preferably, the interception, stage 99 will recognise that a packet is an update message (rather than for instance an ordinary data packet) by examining the protocol number in the packet; the interception stage 99 is either pre-configured with the protocol numbers to look out for, or else a mobile node could inform it. Alternatively, the interception stage 99 will recognise that a packet is an update message (rather than for instance an ordinary data packet,) by examining the destination address in the packet, a mobile node having earlier informed the interception stage of the address of its home agent. This will reduce the need for mobile nodes to register with the signaling agent 34, but may increase the amount of traffic over the wireless link in comparison to the bandwidth needed in the case where the signaling stage 40 simply provides the signaling agent with a new location identifier each time the point of attachment changes.
In another embodiment a similar inception stage 101 is included within the Signalling Agent, which stage (i) recognises a response to a mobility update message (eg an Acknowledgement), (ii) stores it temporarily, along with other similar responses to update messages, (iii) creates a new message which contains several or all of the responses messages that have been temporarily stored, (iv) sends the new message to the mobile router. On receiving this message the mobile router extracts the original responses, which it then sends as normal to the mobile node(s). The interception may stage recognise that a packet is a response (rather than for instance an ordinary data packet) through the protocol number (and which mobile router it should send it to through the destination address). In order to be able to intercept a response message, the Signalling Agent will normally be on the forwarding path the response follows, for example it is located at the Base Station.
To allow for secure communication between nodes, a security relationship will normally be established prior to messages being sent. For example, a security relationship may be established between a mobile node and the signalling agent by the use of a shared secret or key. Likewise, a security relationship may be established between the mobile router and the signalling agent. The shared key may be in the form of a token, which token is sent to the signalling agent by a mobile node, such that the signalling agent can provide the token for the related home agent. Normally, each mobile node will provide to its respective home agent details of the token that the signalling agent will send to the home agent, so that the home agent can authenticate the signalling agent.
|Cited Patent
|Filing date
|Publication date
|Jan 15, 1998
|Mar 18, 2003
|Symbol Technologies, Inc.
|Mobile internet communication protocol
|Nov 19, 2001
|Apr 13, 2004
|Motorola, Inc.
|Method and apparatus for providing IP mobility for mobile networks
|Oct 31, 2000
|Sep 21, 2004
|Utstarcom, Inc.
|Hot standby protocol for wireless devices
|Nov 13, 1998
|Sep 20, 2005
|Lucent Technologies Inc.
|Addressing scheme for a multimedia mobile network
|Dec 18, 2002
|Oct 11, 2005
|Flarion Technologies, Inc.
|Methods and apparatus for using a paging and location server to support session signaling
|Jan 18, 2000
|Dec 6, 2005
|Telefonaktiebolaget L M Ericsson (Publ)
|Public mobile data communications network
|Oct 1, 2002
|Apr 18, 2006
|Ntt Docomo, Inc.
|Method and associated apparatus for increment accuracy of geographical foreign agent topology relation in heterogeneous access networks
|Aug 21, 2003
|Jun 5, 2007
|Telefonaktiebolaget Lm Ericsson (Publ)
|Aggregated binding updates and acknowledgments in Mobile IPv6
|Feb 27, 2002
|Oct 16, 2007
|Cisco Technology, Inc.
|Methods and apparatus for Mobile IP Home Agent clustering
|May 6, 2003
|Jul 21, 2009
|Qualcomm Incorporated
|Methods and apparatus for aggregating MIP and AAA messages
|Nov 20, 2001
|Aug 22, 2002
|Kuntal Chowdhury
|Method and apparatus for dynamically assigning a home agent
|May 6, 2003
|Mar 11, 2004
|O'neill Alan
|Methods and apparatus for aggregating MIP and AAA messages
|Jan 21, 2003
|Jul 22, 2004
|Masahiro Maeda
|Location registration using multiple care of addresses
|Mar 18, 2004
|Sep 9, 2004
|Utstarcom, Incorporated
|Virtual home agent service using software-replicated home agents
|May 24, 2000
|Nov 28, 2001
|Motorola, Inc.
|Communication system and method therefor
|Feb 28, 2002
|Jul 16, 2003
|NTT DoCoMo, Inc.
|Method and system for providing location information of a mobile terminal being in a train
|Nov 14, 2002
|May 30, 2003
|Motorola, Inc.
|Method and apparatus for providing ip mobility for mobile networks
|International Preliminary Report on Patentability issued Mar. 16, 2006 in International Application No. PCT/GB2004/003853.
|International Search Report.
|Citing Patent
|Filing date
|Publication date
|Sep 18, 2009
|Feb 11, 2014
|Siemens Enterprise Communications Gmbh & Co. Kg
|Method for switching communication links to a mobile terminal device which is associated with a local radio area of a network
|Dec 17, 2013
|Apr 7, 2015
|Unify Gmbh & Co. Kg
|Method for switching communication links to a mobile terminal device which is associated with a local radio area of a network
|Aug 12, 2008
|Nov 24, 2015
|Nec Corporation
|Connection identifier system and method
|Oct 1, 2007
|Oct 22, 2009
|Panasonic Corporation
|Method and apparatus for mobile ip route optimization
|Aug 12, 2008
|Jun 10, 2010
|Francesca Serravalle
|Connection identifier system and method
|Sep 18, 2009
|Sep 29, 2011
|Bruno Bozionek
|Method for switching communication links to a mobile terminal device which is associated with a local radio area of a network
|U.S. Classification
|370/338, 455/438, 455/436, 370/351, 370/328, 370/352, 455/437, 709/227, 455/439, 709/238, 709/228, 455/41.2, 370/395.52, 370/389, 709/229
|International Classification
|Cooperative Classification
|European Classification
|Mar 14, 2006
Owner name: BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY,
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HANCOCK, ROBERT EDWARD;MIHAILOVIC, ANDREJ JOVAN;EISL, JOCHEN OLIVER;AND OTHERS;REEL/FRAME:017690/0361;SIGNING DATES FROM 20040924 TO 20041117
Owner name: BRITISH TELECOMMUNICATIONS PUBLIC LIMITED COMPANY,
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HANCOCK, ROBERT EDWARD;MIHAILOVIC, ANDREJ JOVAN;EISL, JOCHEN OLIVER;AND OTHERS;SIGNING DATES FROM 20040924 TO 20041117;REEL/FRAME:017690/0361
|Dec 11, 2014
|Fee payment
Year of fee payment: 4


text:
Outdoor Tealight Lanterns
Garden › Garden Décor › Outdoor Tealight Lanterns
Showing 8 Results
Amore Paper Sky Lantern Set of 10 (SLS01)
- Brand: Amore
- Model Number: SLS01
Solar Power Powered Outdoor Garden Light Lamp Balcony Fence LED Wall With Screws
Iris Stoneware Fragrance Vapourizer Diya Lavender & Tealights
- Brand: Iris
- Model Number: IRFV0212LA
- Brand: Malibu
- Model Number: 8508-2110-06
- Brand: HomArt
- Model Number: 4436-0
- Brand: Foreside
- Model Number: 70522
Biedermann & Sons Mini Tealight Candle Lanterns, Box of 6, Antique Red
- Brand: Biedermann & Sons
- Model Number: H-1775RD
Lazy Susan Wall Mount Wire Lantern, Ash
- Brand: Lazy Susan
- Model Number: 594009
Buy Outdoor Tealight Lanterns Online Junglee
If you are looking for a way to improve the ambience of your outdoor garden area, tealight lanterns are the answer to your query. Just by making use of some different types of lanterns you can add a charm to your garden area. You will find various types of lanterns available at Junglee, which are sure to please anyone.
There are indoor as well as outdoor lanterns available on our site that too at a rate which will surely fit your budget. You can use them to decorate your house and garden beautifully for any occasion. The paper bag lantern is made from vellum or some greaseproof paper, and there are designs over the lanterns that make them look pretty. You just need to know how to set up the candle in the lantern. For this, you need to fill up the lantern with 2 to 3 cups of soil or sand and then push and place the candle directly in the middle of the pile. Light up the candle using a large grill lighter or something of that size. The lanterns are reusable if you store them in a dry place.Decorate Your House With Lanterns
You will find the products offered are from a range of brands like Artlivo, Basement Bazaar, BOTTLES NOT EMPTY, Eternal Products and ExclusiveLane; you needn't worry about the quality because of this reason - these brands won't let you down. There is also a sun jar that you can consider purchasing as they come with an automatic switch. The automatic switch has a built-in sensor that can easily indicate when it is dark or bright and automatically switch off and on accordingly. The sun jar will be charged up, fully if kept under direct sunlight. It also can be manually operated if you do not want the jar to light up in the dark and waste the battery. You can also remove the battery and charge it in a normal battery charger. The sun jar is water resistant and that allows you to leave it outside during wet weather.Light Up The Sky With Lanterns!
At Junglee, you will also find lanterns that act as decorative hot air balloons. They are known as sky lanterns or outdoor Chinese lanterns. The material used in designing them is non-flammable and eco-friendly. The lantern can fly out in the air because of the wick that is suspended from the frame. You just have to light up the wick and the lantern will inflate with hot air and fly up high in the air. The lanterns available with us come in a variety of colors that you can choose from. You can also compare the prices with the various dealers present on our site and purchase the one that looks inexpensive to you. You can purchase a variety of products ranging from the Golden Lantern to Recycled Railway Signal Lantern and from Metal Lanterns to Bottle Lamp with LED Lights that are sure to appeal to you.
- ‹ Garden
- ‹ Garden Décor
- Outdoor Tealight Lanterns

subset: commoncrawl


text:
I have known this guy (the big one!) since he was two. He's a hugely important part of my family. It is a delight seeing what a wonderful father and husband he is.
This look! The love! I stood up at their wedding and I am so happy that they are so happy.


text:
It's Wednesday which means I have another MidWeek Muse video for you, and today's is all about using Lindy's Stamp Gang's Flat Fabios sprays.
You might wonder why you need yet another spray in your studio, where there is probably already an assortment. For me it all comes back to color. Make no mistake about it, I am a huge fan of Dylusions and Color Wash sprays, but color is what attracts me and the more I have available at my fingertips that happier and more creative my muse is.
There are 35 colors in the Flat Fabio line and many of them are quite different than what can be found in the others I mentioned. In addition to lots of fun transparent colors, there are also a group of semi-opaque ones. By "semi-opaque" I mean colors that have a base of solid pigment in a solution that sprays on and dries to a chalky, nearly opaque finish.
That will make more sense once you view the video. Because a picture (especially a moving one!) is always worth a 1000 words.
You'll also see that you can combine Flat Fabios with Dylusions and if you MUST have some glimmer and sparkle, with Starburst Sprays and Moon Shadow Mists. They're all water based products, so mixing is as easy as spraying one over another. And another. And another, if you choose. You'll also see that though Flat Fabios are "mostly permanent", you can ghost them to remove color. The effect is not as strong as when you work with a non-permanent color, but ghosting is certainly a technique you can use with them.
Supplies For This Video:
Lindy's Stamp Gang Flat Fabios
Dylusions Ink Sprays and Color Wash Sprays can be combined with the Flat Fabios
Lindy's Starburst Sprays & Moon Shadow Mists (in case you really need some sparkle!)
Strathmore Artist Tiles – create Art Cards using Flat Fabios!


text:
Picnic Basket Defense
Played 2863 times
Picnic Basket Defense game information:
You and your partner have planned for a nice and romantic picnic in the park. All goes well until you suddenly realize that the two of you aren't alone.
From all corners ants come rushing in to take away your precious food. Surely you will not allow this thievery, so it's to you to make optimal use of the available resources and defeat the insect scourge.
How to play:
Strategically position the bottles of mustard, ketchup and other picnic supplies to defend against the invading ants.
The ants come from different sides and try to take the food from the blanket. Food respawns each level in a different place.
Use the points you score to buy new devices. Don't let the steal to much of your food.
Add this game to your website or blog!
Popular Tags
Latest Games
- Bart Shootout
- The Hulk Differences
- Princess doll house 2
- American Trucks Memory
- Sailor Ship Escape
- Defend Kindom Wars
- Deadpool Jigsaw
- Offroad Race Truck
- House Cleaning
- Kings Castle 20
- BMW F32 Jigsaw
- Art Gallery Escape
- Fairy Beauty Salon
- Daredevil Jigsaw
- Semi Truck Jigsaw
- Lexus RS 350 Jigsaw
- Land of the Monsoon
- Kings Castle 19
- Italy Palazzo Escape
- Kings Castle 18
- Steven Adventure 2
- The Flowers of Paris
- Hendersons House
- Cindrella Hidden Objects
- Abandoned Theater Escape
- Phantom Jigsaw Truck
- Silverado Jigsaw
- Fireman Kids Western
- Elsa's Cuisine
- Dora Find Flying Castle


text:
70, Ridgetop, TNLife is good! I wake up with a smile on my face and a song in my heart. Sprituality and my Faith guide my choices. The Lord has Blessed me in so many ways, I can hardly believe it myself. I have a 15 year old son that I cherish. In addition, I was Blessed to be a part of raising three step children who are now productive young adults. I love them as my own. And although my ex and I have moved on, we retain a friendship by virtue of respect. I enjoy my career, restoring our c.1896 Victorian home, music, entertaining, vintage/classic cars, and technology. I give back to my Church through involvement and my community as a Volunteer Firefighter and EMT. I am an optimist and retain no baggage. My health is excellent and I'm very energetic, sincere and financially stable. Starbuck's Venti-Latte is great, but I'm good with Dunkin'. I know how to dress up and how to dress down. If it's broke, I can fix it. If I'm lost, I'll ask for direction. My primaries are my God, my loved-ones, a few close friends, and my country. My heart is warm and I have a passion for life and all of it's wonders. I have a flair for the romantic. Little things mean so much. I'm a pretty good cook, but not a chef. I'm tidy, but my housekeeping is mediocre. My sense of humor is infectious and my profile picture is current. I'm adventurous, outdoorsy, and active.
60, Powell, TNI'm livin' the dream! Great job(s), nice home, loving kids, 2 adorable grand kiddos - and a wonderful parish community where I feel a deep desire to serve! So what's missing? YOU GUESSED IT! That special guy to join my heart and soul with! So, where are you ................???
58, La Vergne, TNHello. I am a professional who likes to volunteer with the Boy Scouts, the Knights of Columbus and the American Legion. I am a retired doctor of Audiology from the VA. I am an outgoing person who likes to eat out and go to the movies. I like to take walks on the beach and through the woods. I am a retired Army officer with 12 years prior service as a Navy officer. In both I was a hearing conservation officer. I would like to meet a lady in the Nashville area for a long term relationship. To be each others best friend.
59, Nashville, TNI am fun loving with a very optimistic/positive personality, and enjoy a wide variety of activities from ballroom dancing & live theatre, to hiking/biking and everything in between. My life is fairly busy, productive, and fulfilling, but I would like to meet that "special" someone with whom I can share my faith. My mother has been the most influential person in my life. Her deep faith life continues to inspire and challenge me to become a better Catholic. A close group of friends provide experiences, support, understanding, and acceptance, so that I can grow as a person. My faith community provides a way for me to minister to others. My leisure time consists of reading spiritual literature, dancing, dinner and social activites with friends, prayer group, and travel.
35, Clarksville, TNI enjoy hunting, camping, boating.. anything outside. Just need someone to enjoy it with me! I also like to workout, even though it is part of my job. I enjoy traveling, again even though it is part of work. I converted to Catholicism about a year and a half ago. I used to be Methodist, and now I regularly attend Traditional Latin Mass! I prefer the Latin Mass, but I will go to Novus Ordo when the TLM is not available.
57, Antioch, TNI am a very caring, compassionate and honest lady, looking for a man with some of the same qualities. I enjoy watching and attending football, and basketball games, dancing, and evening drives just because and most of all a quiet evening at home with that special man in my life. It's my belief relationships are built on chemistry not the outer person Biology (outer appearance). I also enjoy laughing at myself and possibly you :), I'm not into games or lies.
55, Hendersonville, TNI am actively involved in my church and Enjoy socializing with family and friends. ! love to fish and cheer my favorite college football team. I'm a country girl at heart but also enjoy city life. Always open to new adventures and challenges. Regularly attend jazzercise classes and love to dance. I love walks on the beach and hand-holding. I enjoy surprising people and being surprised. I have 3 beautiful grown children and enjoy spending time with them when they are home. God has a plan for me and I am opening myself up to his plan and wherever it may take me.
53, Cookeville, TNI'm looking for a meaningful, loving relationship with someone who is open minded. I am a widow of 6 years and I believe that I can have another wonderful marriage. I am primarily a home body. I love to travel, enjoy photography, cooking, reading and movies.
30, Nashville, TNImmigration attorney and musician who is passionate about helping others. Enjoy traveling, seeing live music, and being outdoors. Also proud owner/father of a puppy.
20, Cleveland, TNI am an engineering major. I want to make something that saves lives in the future. Safety for all people is needed. I plan on becoming a mechanical engineer in the future. Some of the most influential experiences for me have been going to college and experiencing the Air Force Culture in ROTC. I'm not in ROTC now, but I've taken some values with me such as strong integrity and teamwork. Religion at college has been a breakthrough for me. I've come to rely heavily on God every day. Yes to all faith questions is preferred and a strong following of Church Canon is required. In my free time I run, bike, read, paint and play games once in a while. I love hiking but never have enough time to go out and enjoy some time on an 8-mile trail.
58, Etowah, TNIntelligent, caring, passionate about my work. Look forward to traveling. Lots of changes in my life over past year. I am divorced emotionally, almost legally. Did not marry in the Church. Look forward to meeting an intelligent,kind, warm, confident spiritual man who is open to developing a relationship. God and my mom have been influential in my life. She passed in July. I like to exercise, play tennis, repurpose/refinish furniture, read, cook, bake,travel and explore new areas/towns on and off "the beaten path."
35, Jackson, TNI'm recently divorced, and have two beautiful daughters. I was born and raised in Jackson, TN. I enjoy watching and going to sporting events. I enjoy doing anything outdoors. I am very active in my church and attend regularly.
Browse Catholic Singles by Gender:
Catholic Dating By Major City:
- Nashville,
- Memphis,
- Knoxville,
- Chattanooga,
- Murfreesboro,
- Cordova,
- Clarksville,
- Franklin,
- Cleveland,
- Jackson,
- Johnson City,
- Germantown,
- Hendersonville,
- Brentwood,
- Lebanon,
- Maryville,
- Collierville,
- Chennai,
- Kingsport,
- Antioch


text:
Rates market should attract more interest from clearers
A panel of practitioners was asked recently to predict how many of the five or six clearing solutions being developed for credit derivatives would be live with at least one trade by the end of this year. The general response was two or three, although one contrarian posited that it would either be all or none.
Provided that at least one such solution is live, the regulators should be satisfied. But they should also take note of the main caveat raised by the panellists to the prospects for credit default swaps clearing – regulatory uncertainty.
Investors in those providers scrambling to roll out the definitive CDS solution should be even more worried. The noise around CDS clearing has surely exceeded its revenue potential and it may be time for them to question whether the contenders, by focusing all their attentions on the practicalities, are failing to see the bigger picture.
The CDS market has never been the largest of the over-the-counter derivatives markets. And thanks to efforts to compress and tear up trades, it is shrinking in notional terms almost on a monthly basis. This should be a concern for those hoping to reap rewards by novating existing CDS trades, but there is another, even more serious, one – the exit of a host of participants from the CDS market.
The era of insurers writing CDS premiums like confetti has surely passed: structuring desks have been decimated, hedge funds have shut up shop and trading desks have been pared back. Finally, the nationalised or near-nationalised banks are unlikely, one presumes, to be charging back into the market with their previous vigour. True, other entrants might yet come into the market, but they will be hard placed to restore volumes in the immediate future.
In December 2007, the CDS market was worth was worth $62 trillion; by June the figure had fallen to $54 trillion; and by December it had halved to $29.3 trillion. Turnover continues but trading volumes are not what they once were. The notional outstanding amount of index trades – those most targeted by all credit derivatives clearers – is now worth less than $10 trillion.
If you compare that to the interest rate OTC market, which was worth $458 trillion as at last June, one has to wonder why on earth the providers have swarmed around credit derivatives when the pot is so much fatter in the far simpler rates business.
Nearly all the big exchanges are seeing a decline in their listed interest-rate-linked products volumes, but they cannot have failed to notice that the OTC rates business has been cracking on. Large interest rate reductions, a temptingly steep yield curve, fluctuating rate expectations and a surge in bond issuance have all been conducive to the market's expansion. The interdealer-brokers' rates revenues, the SwapClear pool balances and the bankers' bonus pool allocations would – were such data to be publicly available – undoubtedly corroborate this.
If you were to bet on a market that is likely to see good growth in the year or years ahead, then the form-book would suggest that it should be a large, high-volume, standardised, liquid market in which post-trade technologies have been neatly implemented and in which everyone – mortgage providers, corporates, issuers, loan providers, investors and governments – is obliged to participate.
The rates business would seem to satisfy all such criteria, and yet only one clearing house has successfully targeted the OTC rates market – LCH.Clearnet. If, by the end of this year, six or seven other providers are still targeting CDS rather than rates, they may well discover that they have been backing the wrong horse.
• Heavy-handed tactics
Even the most delinquent of teenage boys will, sooner or later, wake up to the fact that being agreeable to girls is generally a more successful strategy than being disagreeable. For exchange groups to take the opposite approach would therefore seem to be counterintuitive.
The Federation of European Securities Exchanges published a missive last week that gave every impression that its primary purpose was to blame and shame the over-the-counter industry – and in as public a fashion as possible. No doubt this tactic found a receptive audience with those who wish to brand the OTC markets as the main culprits in the financial crisis. It would also appeal to those who hope to bring the markets to heel.
But launching such a public attack on the OTC markets – and labelling instruments such as credit default swaps as being "the origin of" and "at the core" of the crisis – is unlikely to foster much goodwill in the areas where it is needed most. For a start, the charges are unsubstantiated. If there is a case to be made against OTC derivatives, it has not yet been well argued and trying to appeal directly to policymakers on the strength of such unreliable evidence is hardly in the spirit of justice.
It was unfortunate that the FESE letter should have been posted just as exchange groups are seeking to bring dealers and customers onside with their ventures. Liffe is struggling to persuade clearing firms to gear up their information technology to correlate with its Bclear credit derivatives clearing facility, and CME Group is attempting to sign up founding members to its putative platform.
And it was doubly unfortunate for Frankfurt-based Eurex. FESE's letter was published in the same week the exchange announced it is to offer banks and other market players up to 90% participation in its proposed credit derivatives clearing service. Eurex has not elaborated on its plans, but at face value the offering is a generous one – and it is certainly a hefty stake for such an avowedly vertical group to be hawking. Perhaps FESE's timing was coincidental – perhaps not. But if the exchange groups believe that being disagreeable will enable them to pressure market participants into partnering them or to start using their services, the outcome may not be a happy one.


text:
|Publication number
|Publication type
|Application number
|Publication date
|Jan 13, 1998
|Filing date
|Nov 7, 1996
|Priority date
|Feb 4, 1994
|Fee status
|Also published as
|Publication number
|James B. Williams, Kenneth K. Chan, John F. Shelton, Ehsan Rashid
|Original Assignee
|Hewlett-Packard Company
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (8), Referenced by (11), Classifications (9), Legal Events (5)
|External Links: USPTO, USPTO Assignment, Espacenet
This is a continuation of application Ser. No. 08/191,865 filed on Feb. 4, 1994 now U.S. Pat. No. 5,600,824.
The present invention relates to electronic circuits constructed from a plurality of chips or circuit blocks connected to a bus, and more particularly, to an improved method of synchronizing the chips to the bus clock.
Many electronic systems such as computers are constructed from a plurality of chips that are interfaced to a synchronous bus. The transfer of data between the various chips and the bus is synchronized with a bus clock whose maximum speed is determined by the electrical characteristics of the bus.
In many cases, the chips are capable of running at significantly higher clock speeds than the bus can support. The internal speed of a chip is limited by the length of conductors in the chip and by the various parasitic capacitances in the chip. Since signal propagation distances in a chip are much smaller than the signal propagation distances on the bus, chips can often run at much higher speeds than the bus. If the chips do not need to transfer data to or from the bus on each bus cycle, a significant speed advantage may be obtained by running the chips at a clock speed that exceeds the bus clock.
Computer systems in which the microprocessor chip runs at a multiple of the bus speed are known to the prior art. For example, systems in which the microprocessor operates at a clock speed that is twice the bus speed are commercially available. Since a microprocessor may require several internal clock cycles to execute an instruction, running the microprocessor at a higher speed than the bus clock results in a significant reduction in the execution of such instructions.
Unfortunately, such microprocessor systems can only run at fixed integer multiples of the bus clock. The optimum ratio between the chip clock and the bus clock is determined by the system parameters. In a system having a very fast bus, the optimum ratio will be smaller than in a system having a slower bus. In prior art synchronous systems, such as the microprocessors discussed above, a different chip, or at least additional bus logic circuits, is needed to implement a few fixed ratios of chip speed to bus speed. The cost of providing a number of different chips is prohibitive; hence, the optimum ratio is seldom achieved.
Systems in which data is transferred asynchronously between the bus and chips avoid these problems, since the internal clock of a chip is free to operate at any speed relative to the bus speed. Unfortunately, these systems require much more complex bus interface hardware. In addition, the timing of the system operations can not always be predicted in asynchronous systems. Such timing uncertainties can lead to problems in multi-processor systems that rely on a predictable execution order for instructions.
Broadly, it is the object of the present invention to provide an improved method for synchronizing chips to a bus.
It is a further object of the present invention to provide a synchronous bus interface system that allows the chips to run at a plurality of different clock speeds for any given bus speed.
These and other objects of the present invention will become apparent to those skilled in the art from the following detailed description of the invention and the accompanying drawings.
The present invention is a data communication system for communicating data between a bus running at a first clock frequency and a circuit block operating synchronously with the data bus at a second clock frequency. The system includes a clock generator for generating a bus clock signal at the first clock frequency and a chip clock signal at the second clock frequency wherein the first and second clock signal frequencies are in the ratio of (N-1):N. Here, N is an integer greater than 1. The bus and chip clock signals are synchronized once every N cycles of the chip clock signal. The clock generator also generates a synchronization signal indicating the chip clock signal cycle in which the bus and chip clock signals are synchronized. The circuit block includes an interface circuit for receiving and transmitting data on the bus. The system also includes circuits connected to each circuit block for identifying a chip clock signal cycle in which data cannot be transmitted by the circuit block on the bus and a chip clock signal cycle in which data cannot be received by the circuit block from the bus, there being one of each type of cycle in each contiguous block of N chip clock cycles. In addition, the present invention allows the bus to chip clock ratios of 1:1 without increased complexity or loss of performance.
FIG. 1 is a block diagram of a chip utilizing the present invention and which is connected to a synchronous bus.
FIG. 2 illustrates the relationship between the chip and bus clocks for the case in which the respective clock frequencies are in the ratio of 4:3.
FIG. 3 is a block diagram of a first interface circuit according to the present invention for transmitting and receiving data from the bus shown in FIG. 1.
FIG. 4 is a block diagram of a second interface circuit according to the present invention for transmitting and receiving data from the bus shown in FIG. 1.
The present invention may be more easily understood with reference to FIG. 1 which is a block diagram of a chip 15 connected to a synchronous bus 11. Chip 15 operates at a frequency set by a chip clock. Bus 11 operates at a frequency set by a bus clock which, in general, has a frequency less than or equal to that of the chip clock. Both the chip and bus clocks are derived from a single clock crystal in clock generator 12. In the present invention, the chip clock frequency is either equal to the bus clock frequency or is related to it in the ratio of N:(N-1), where N is an integer greater than 1. That is, the possible chip clock to bus clock frequencies are 2:1, 3:2, 4:3, and so on. As will be explained in more detail below, the case in which the chip and bus clocks are the same frequency can also be accommodated by the present invention.
Consider the case in which the chip to bus clocks are in the ratio of 4:3. The chip processing circuitry 13 operates at the chip clock rate. However, chip 15 receives and transmits data based on the bus clock. In the embodiment of chip 15 shown in FIG. 1, data is transferred between the bus and the chip via an interface circuit 14 which moves data between the bus domain and the chip domain. The manner in which this interface circuit operates will be discussed in more detail below.
For every 4 chip clock cycles, there are only 3 bus clock cycles. Hence, there must be at least one chip clock cycle out of four in which chip 15 cannot receive new data from the bus and at least one chip clock cycle in four in which chip 15 cannot transmit new data on the bus, since at most three data bits per data line can be transmitted or received in the corresponding 3 bus clock cycles.
The present invention is based on the observation that the chip cycles in which data cannot be read or written between the chip and the bus are independent of the value of N if the clocks are in the ratio of N:(N-1). Refer now to FIG. 2 which illustrates the relationship between the chip and bus clocks for the case in which the respective clock frequencies are in the ratio of 4:3. The clock pulses occur in repetitive groups corresponding to 4 chip clock pulse for each 3 bus clock pulses. Once every 4 chip clock pulses, the two clocks will have coincident rising edges as shown by the broken lines. It will be assumed in the following discussion that data is clocked into latches and registers on the rising edges of the respective clock pulses. It will also be assumed that data is passed through a transparent latch when its enable input is high, and that data is held in the latch on the falling edge of its enable signal. If chip 15 sends data at time 20 determined by the chip clock, the data can be received by a latch connected to the bus at time 21. Out-bound data leaving chip processing circuit 13 at time 22 will pass through latch 14 when the chip clock signal is low and will be sent on the bus at time 23, and the data can be received by another chip on the bus at time 25. However, if data were clocked into latch 14 in the later half of the third chip clock pulse, i.e., time 24, the data would be replaced by the data clocked in at time 26 before the data would be sent on the bus at time 25. Hence, data cannot be send on the chip clock pulse at time 24.
Now consider the case in which data is to read into chip 15. Data placed on the bus by another chip at time 25 cannot be read until time 27; however, this is after the start of the chip clock pulse shown at time 28. Hence, this data cannot be read by chip 15 until time 29. Data that was placed on the bus at time 23 can be read at time 31. Hence, no data can be read from the bus at time 28. It should be noted that the time chip time slots in which data cannot be sent or received are two chip clock cycles before the point of synchrony of the two clocks and two chip clock cycles after the point of synchrony of the two clocks, respectively. It can be shown that this is truely independent of the value of N. Hence, if chip 15 can determine when the point of synchrony occurs, it can always identify the two cycles in question without any other information.
In the preferred embodiment of the present invention, chip 15 receives a synchronization signal that is generated by clock generator 12. The synchronization signal informs the synchronization processing circuitry 16 of the chip cycle at which synchronization takes place. For example, the synchronization signal can be sent a predetermined number of chip clock cycles before synchrony occurs. Synchronization processing circuitry 16 preferably generates send and receive inhibit signals that prevent the other circuitry 13 on the chip from attempting to receive or transmit data during the forbidden receive and transmit time slots.
The manner in which interface 14 operates will now be explained in more detail. The complexity of interface circuit 14 depends on the maximum value of N. The case in which N is less than or equal to 4 will be discussed first, as this is the simplest case. Refer now to FIG. 3 which is a block diagram of an interface circuit 30 according to the present invention. Interface circuit 30 can be divided into two domains, a chip domain which operates in synchrony with the chip clock whose signal is denoted by CCK and a bus domain that is controlled by the bus clock whose signal is denoted by UCK. A pad 36 on the chip is used to make the physical connection to the bus.
Out-bound data is placed in a transparent latch 31. The data is read from latch 31 into an edge triggered D register 33 which is preferably an edge triggered flip-flop that is controlled by the bus clock signal. A buffer 35 is used to drive the bus line off of the output of register 33. Similarly, in-bound data from the bus is read into a D register 34 which is preferably an edge triggered flip-flop that is controlled by the bus clock. The data is transferred to the chip domain via a transparent latch 32 operating off of the chip clock.
When the worse case timing occurs (i.e., beginning at time 22) for N=4. Data will be moved between the latch-register pairs before new data is moved into the input stage of the pair. For example, out-bound data previously loaded into latch 31 and now on the Q output of latch 31 is transferred to the Q output of register 33 on the rising edge of UCK at time 21 before new data at the input to latch 31 arrives on the next falling edge of CCK after time 22.
Unfortunately, when N>4, the simple latch/flip-flop arrangement shown in FIG. 3 is not reliable because of the overlap between UCK and CCK. Consider the worse case in which N=5, there will be a data cycle in which UCK clocks data into registers 33 just as latch 31 opens and changes its output to the new data at its input. This situation presents a race between UCK rising and CCK falling. Hence, it cannot be guaranteed that register 33 will receive the correct data. This situation becomes worse as N increases.
To avoid this race problem, systems in which N>4 preferably utilize the interface circuit shown in FIG. 4 at 40. Consider the transfer of data between two chips connected to the bus. The chip domain in which the data originates will be referred to as the sender, and the chip domain to which the data is to be transferred will be referred to as the receiver. The basic mechanism by which synchronization is achieved involves gating the clock of the sender with a locally generated synchronization signal such that whenever the receiver's latch is updating, the output of the sender's latch remains steady. The sender's latch only updates when the receiver's latch is not updating. However, when the clocks of the sender and receiver are synchronous, as is the case when the rising edges are coincident, both the sender's latch and the receiver's latch are allowed to update simultaneously. This assures that the receive's data will always be stable and will be in step with the data the sender intends to transfer.
In interface circuit 40, register 34 shown in FIG. 3 is split into a pair of transparent latches 51 and 52. Control circuitry 55 assumes that latch 51's data is captured by latch 42 before new data from latch 52 is received. Control circuit 55 includes a control flip-flop which is set low at the falling edge of the sender's clock if and only if a signal referred to as NRSYNC is high. The control flip-flop is cleared HIGH unconditionally on the falling edge of the receiver's clock. The control flip-flop is also cleared HIGH when NRSYNC is low. Since, as explained in more detail below, NRSYNC will be low when the clock edges from the two frequency domains are coincident, the control flip-flop will allow simultaneous update of sender and receiver domain latches when a concurrent clock edge occurs. When the edges are not coincident, the control flip-flop guarantees that the receiver domain latch has completed updating (i.e., its clock edge has fallen) before the sender domain latch updates its contents.
To optimize circuit performance, the physical implementation of the transfer latch 42 along the in-bound path resides at the destination inside chip 15. This eliminates duplication of data latches in the receiver clock domain. Similarly, control circuit 56 assures that register 43 has clocked out its data before loading new data from latch 41.
The control circuits utilize signals NDSYNC and NRSYNC which are generated from a single USYNC which informs the chip when coincident rising edges of CCK and UCK will occur. NDSYNC is asserted low from the rising edge of CCK from one cycle before the coincident edge of CCK and UCK to the rising edge of CCK one cycle after the coincident edge of CCK and UCK. NRSYNC is asserted low from the failing edge of CCK from one half cycle before the coincident rising edge of CCK and UCK to the second falling edge of CCK after the coincident edge of CCK and UCK.
As noted above, it is advantageous to also be able to operate a chip according to the present invention in environments in which the bus and chip clocks operate at the same frequencies. This mode of operation will be referred to as the non-ratioed mode in the following discussion. The interface circuit shown in FIG. 4 can provide this operation if the outputs of circuits 55 and 56 are always high. This can be accomplished by forcing NDSYNC and NRSYNC low in this mode of operation. In the preferred embodiment of the present invention, each chip uses the synchronization input to detect non-ratioed operation, i.e., chip and bus clocks being the same. The circuitry on the chip that generates the NDSYNC/NRSYNC signal determines that this input is not periodic and forces these signals to the appropriate value to provide non-ratioed operation. In this case, circuit 56 eliminates the need to wait on the sender's clock edge to transmit data to the receivers clock domain when operating in non-ratioed mode. Hence, circuit performance is maintained at its optimal level in non-ratioed operation.
In non-ratioed operation, the send and receive inhibition signals shown in FIG. 1 must also be disabled. This is accomplished by connecting the synchronization signal input of the present invention to ground. If no synchronization signal is received, then the send and receive inhibit signals will not be generated. As a result, the chip will send and receive data on each clock cycle.
While the preferred embodiment of the present invention utilizes an external synchronization signal to define the points at which the two clocks are in synchrony, it will be apparent to those skilled in the art that other means may be used. For example, each chip could detect the synchronization point by comparing the chip and bus clock signals received by the chip. This approach; however, would require this circuitry to be duplicated in each chip. The cost of the additional circuitry makes this approach less attractive. In addition, some other means of providing operation for clock ratios having a frequency of 1:1 would be needed.
Various modifications to the present invention will become apparent to those skilled in the art from the foregoing description and accompanying drawings. Accordingly, the present invention is to be limited solely by the scope of the following claims.
|Cited Patent
|Filing date
|Publication date
|Nov 24, 1976
|Jun 13, 1978
|Tokyo Electric Co., Ltd.
|Clock pulse control system for microcomputer systems
|Sep 12, 1989
|Aug 10, 1993
|Acer Incorporated
|Bus interface synchronization control system
|Dec 30, 1992
|Sep 13, 1994
|Digital Equipment Corporation
|Apparatus and method of data transfer between systems using different clocks
|Nov 8, 1991
|Jan 3, 1995
|Texas Instruments Incorporated
|Color palette timing and control with circuitry for producing an additional clock cycle during a clock disabled time period
|Jul 29, 1991
|Jan 10, 1995
|Unisys Corporation
|System for switching between a plurality of clock sources upon detection of phase alignment thereof and disabling all other clock sources
|Apr 16, 1981
|Jan 6, 1982
|International Business Machines Corporation
|Data transfer apparatus
|Dec 24, 1988
|Jul 4, 1990
|International Business Machines Corporation
|Method of synchronizing signals which are generated on different chips having on-chip clocking systems with different speed
|Aug 12, 1991
|Apr 1, 1992
|Tandem Computers Incorporated
|Mutiple-clocked synchronous processor unit
|Citing Patent
|Filing date
|Publication date
|Dec 11, 1996
|Jul 13, 1999
|Intel Corporation
|Method and apparatus for transferring signals between multiple clock timing domains
|Nov 19, 1996
|Sep 21, 1999
|Unisys Corporation
|Method and apparatus for optimizing a circuit design having multi-paths therein
|Mar 14, 2000
|Mar 18, 2003
|International Business Machines Corporation
|Optimizing performance of a clocked system by adjusting clock control settings and clock frequency
|Aug 23, 2001
|Aug 9, 2005
|Hewlett-Packard Development Company, L.P.
|System and method for transferring data from a lower frequency clock domain to a higher frequency clock domain
|Aug 23, 2001
|Aug 16, 2005
|Hewlett-Packard Development Company, L.P.
|System and method for transferring data from a higher frequency clock domain to a lower frequency clock domain
|Nov 25, 2003
|Sep 23, 2008
|Infineon Technologies Ag
|Electronic circuit with asynchronous clocking of peripheral units
|Mar 10, 2005
|Oct 7, 2008
|Cisco Technology, Inc.
|Method and apparatus for eliminating sampling errors on a serial bus
|Nov 25, 2003
|Jul 15, 2004
|Infineon Technologies Ag
|Electronic circuit with asynchronous clocking of peripheral units
|Mar 26, 2003
|Sep 30, 2004
|Akkerman Ryan L.
|System and method for transferring data from a first clock domain to a second clock domain
|Jun 6, 2001
|Sep 2, 2004
|Infineon Technologies Ag
|Elektronische Schaltung mit asynchroner Taktung von Peripherieeinheiten
|Jun 4, 2002
|Dec 12, 2002
|Infineon Technologies Ag
|Electronic circuit having peripheral units with asynchronous clock pulses
|U.S. Classification
|713/400, 713/501, 710/61
|International Classification
|Cooperative Classification
|European Classification
|Jan 16, 2001
Owner name: HEWLETT-PACKARD COMPANY, COLORADO
Free format text: MERGER;ASSIGNOR:HEWLETT-PACKARD COMPANY;REEL/FRAME:011523/0469
Effective date: 19980520
|Jul 12, 2001
|Fee payment
Year of fee payment: 4
|Jul 13, 2005
|Fee payment
Year of fee payment: 8
|Jul 13, 2009
|Fee payment
Year of fee payment: 12
|Sep 22, 2011
Owner name: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P., TEXAS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:HEWLETT-PACKARD COMPANY;REEL/FRAME:026945/0699
Effective date: 20030131


text:
Welcome to the First Baptist Church in Dorchester! Come join us for praise and worship on Sundays at 10:30am!
Our Wednesday evening Bible Study has concluded for the summer. Please join us again when we resume in September.
We are sad to announce the departure of our beloved Rev. Jamie Spriggs. She has been called to serve at Melvin Village Community Church at Lake Winnepesaukee in New Hampshire. Pastor Jamie, we love you and will miss you dearly! Many blessings to you and best wishes on your future endeavors!
Schedule of Guest Pastors for August and September 2016: August 7 Rev. Charles Hightower August 14 Rev. Mark Weaver August 21 The Rev. Dr. F. Lee Jones August 28 The Rev. Dr. F. Lee Jones September 4 Rev. Maurice Greaves September 11 To be arranged September 18 Rev. Baffour Nkrumah-Appiah September 25 Rev. Baffour Nkrumah-Appiah


text:
The Middletons by Ralph Dunagin and Dana Summers
- April 13, 2013
- From Beginning
- Previous feature
- Next feature
- Current
Comments (1) (Please sign in to comment)
I got all those "benefits" by waiting 65 years … I haven't run "5 K" total in all that time!
In fact: I guess I've been "physically fit" for over twenty years!
- Refresh Comments.
You must be signed in to make a comment.


text:
VIDEO: Sea Ray sees future in jetboats
Consumers find them fun to drive thats the obvious appeal of jetboats. They are quick, responsive and maneuverable. But Brad Anderson, vice president of marketing and planning for the Brunswick Recreational Boat Group, told me at this weeks Sea Ray press event in Vonore, Tenn., that the jetboat offers much more than a high…more


text:
Random Thoughts!
I'm goin' to Sizzler baby!
- Ben and Jerry's sends the waste from making ice cream to local pig farmers to use as feed. Pigs love the stuff, except for one flavor: Mint Oreo.
- If you're gonna play, you gotta pay--but don't let it affect your professional responsibilities.
- We've got three new professors ready to join the 'Ville and I assure you that each will add substantial value. There's an energy guru, a macro sage and an astute wavist who will be immediately accretive to the educational vibe.
- The original name for the butterfly was "flutterby."
- Crude just got tagged for 2%.
- Tapes that are up all day tend to end that way. Hence, the longer we're green, the worse Boo's chances are of spoiling this herd. The one caveat to that thesis is that if the bulls get loaded to the gills for a push through the weekly highs and they don't hold, there could be some "unwinding" into the weekend "unknowns."
- One gallon of used motor oil can ruin approximately one million gallons of fresh water.
- The semis have filled the gap (from yesterday's opening) and struggled since.
- An average cow poops 16 times per day and can smell odors six miles away. I would assume that one thing has nothing to do with the other.
- Somebody tell Ben that I'm a buyer of Mint Oreo.
- Please note the gaps in the S&P and NDX (as a function of this morning's higher opening). They should eventually fill back in...
- The metals have found some traction (as the dollar index slips anew). Gold is up $3 and silver has added 1.5%.
- Will somebody please tell the critters that these holiday weeks are supposed to be slow.
- Reuters is reporting that 22/22 primary dealers see Elmer taking a 1/4 pt. hike in June.
- Sometimes I'm 'feeling' the Randoms--and sometimes the mojo just ain't flowin'.
- See that S&P gap from April 28th?
- Brazil has tacked on two percent.
- Fleck did some good fishin' on the money supply vacillations in his recent Rap.
- Friday night face plant?
- Cisco (CSCO:NASD) has pushed back through its 200-day moving average (on the upside).
- We're still under BKX 98.
- Remember Dan Quisenberry?
- My grandfather taught me to take the high road but I don't think that precludes me from writing a "tell all" book one day. If you only knew...
- The Fed's Kohn is on the tape saying that there is no major U.S. inflation threat. It is unclear at this point if pink flamingos and purple dinosaurs live in that part of the country.
- I woulda preferred Warner over Collins but will let it go if the Raiders sign Eddie George.
- We're seeing size QQQ September 32 puts being accumulated.
- 1
Todd Harrison is the founder and Chief Executive Officer of Minyanville. Prior to his current role, Mr. Harrison was President and head trader at a $400 million dollar New York-based hedge fund. Todd welcomes your comments and/or feedback at email@example.com.
The information on this website solely reflects the analysis of or opinion about the performance of securities and financial markets by the writers whose articles appear on the site. The views expressed by the writers are not necessarily the views of Minyanville Media, Inc. or members of its management. Nothing contained on the website is intended to constitute a recommendation or advice addressed to an individual investor or category of investors to purchase, sell or hold any security, or to take any action with respect to the prospective movement of the securities markets or to solicit the purchase or sale of any security. Any investment decisions must be made by the reader either individually or in consultation with his or her investment professional. Minyanville writers and staff may trade or hold positions in securities that are discussed in articles appearing on the website. Writers of articles are required to disclose whether they have a position in any stock or fund discussed in an article, but are not permitted to disclose the size or direction of the position. Nothing on this website is intended to solicit business of any kind for a writer's business or fund. Minyanville management and staff as well as contributing writers will not respond to emails or other communications requesting investment advice.
Copyright 2011 Minyanville Media, Inc. All Rights Reserved.
Daily Recap Newsletter
entertainment, education and
smart market commentary.


text:
When Strawberries Bloom (Lizzie Searches for Love #2)
Lizzie's dream of teaching school has finally come true. She loves the brand-new school building, the sound of the children singing, and the independence she has in the classroom. Even the occasionally unruly boys can't ruin the excitement she feels each morning when she starts the school day.
But at home things are in turmoil again. What do Dat's sudden health problems mean for the future of their farm? And what about Lizzie's future? Emma and Mandy are so certain that Joshua and John are their perfect matches, but Lizzie doesn't know what to think about Stephen and how he might fit into her life.
What will Lizzie decide? Will she continue to teach school? Or will she give up that dream so that her wish for marriage and a family can come true?
Stephen says he loves her, but Lizzie isn't sure he really understands her. Can she hope to find anyone within her Amish community who loves her bright mind, her ever-active imagination, her competitive spirit and her stormy humor?
Books by Linda Byler
(March 2014)
(February 2014)
(October 2013)
(September 2013)
(May 2013)


text:
You're just a few simple steps away from joining Green Schools Revolution! Once
registered we'll post you a FREE starter pack and you'll have access to hundreds
of online resources as well as some fantastic opportunities for your school to kick-start
its Green Schools Revolution!
1 - Find and select your school
2 - Complete your registration
Start typing or click in the box to view the list
It seems we can't find your school in our database. Don't worry, you can still register
for Green Schools Revolution by adding your school to our database.
You are the first teacher from your school to register for Green Schools Revolution. Please proceed to complete your registration.
Another teacher from your school has already registered for Green Schools Revolution. Great to have you on board too! Please proceed to complete your registration.
Please enter your email and password below to login.
Forgot password? Get a reminder
To ensure you dont miss out on any Green Schools Revolution news sign up for our Newsletter here.


text:
Cherry Almond Nanaimo Bars
Total Time
Prep 25 mins
Cook 2 hrs
These go well on any goody platter. They're great for valentine's day parties 'cause they're pink! I also pair these with my Chocolate Mint Nanaimo Bars on Christmas platters. Green and red, what's more Christmasy? The filling is so good with chunks of cherries throughout YUM!Note: Don't let the long list intimidate you...these are really easy to make and time below includes chilling times.
Ingredients Nutrition
- 1⁄2 cup margarine
- 1⁄4 cup sugar
- 1⁄3 cup cocoa
- 1 teaspoon vanilla
- 1 medium egg (beaten)
- 1 cup desiccated coconut
- 1 3⁄4 cups graham cracker crumbs
- 1⁄2 cup almonds (chopped)
- 1⁄4 cup margarine (softened)
- 1 tablespoon cherry juice (from maraschino cherries)
- 2 cups icing sugar
- 1⁄3 cup maraschino cherry (chopped)
- 2 ounces semisweet chocolate (2 squares)
- 1 tablespoon margarine
- Base:.
- Melt margarine, sugar, cocoa, vanilla and egg in saucepan over low heat stirring constantly until it begins to thicken.
- Remove from heat and stir in coconut, graham cracker crumbs, and chopped almonds.
- Press into greased 9x9-inch pan.
- Chill 1 hour.
- Filling:.
- Cream butter, cherry juice, and vanilla.
- Gradually beat in, with hand mixer or by hand, icing sugar to make a smooth spreading consistency.
- Stir in chopped cherries.
- Spread evenly over chilled base.
- Chill until firm.
- Topping:.
- Heat chocolate and butter over medium heat until smoothly melted. Drizzle over filling.
- Chill.
- Cut into 30 bars with sharp knife pressing down gently to break the drizzle first then drag to slice.
Most Helpful
These tasted great! There was alittle bit of base leftover in the pan but i still I got quite a few nice pieces i also used 1/3 cup chocolate chips for the topping. Thanks for the recipe LuckyMomof2!
These were so good! I had pecans on hand so I used those instead of almonds for the base. Added a bit more chopped maraschino cherries to the filling and we enjoyed this so much. Chilling time should be followed closely for the bars to set up.


text:
CL-0615-19 coreless motor (speed: insane)
CL-0615-19 - pure insanity, its like riding a fire cracker!
Motor life time: short! (4 hours if you are lucky)
Battery runtime: short! (30-90 seconds)
Giggle factor on punch out: priceless!
With the stock power connector, you might experience short and weak flights.
To deliver enough power to these hungry little monsters, we suggest to replace the stock power connector on the Inductrix and Nano QX with this one:
performance data:
- speed: 19.000Kv
- operating voltage: 1.5-3.7V
- 2.0A load current at 3.7V (direct drive)
- lifetime rating: 3-4 hours
- can diameter: 6mm
- can length: 15mm
- shaft diameter: 0.8mm
- shaft length: 5mm
- weight: 1.8g
- wire length: 70mm
- plug: Micro-JST-1.25
To maximize performance and life span, don't run them in reverse!
Motor rotation and correct polarity is indicated by the wire color:
clockwise: red +, blue -
counter clockwise: white +, black -
Please note: wire color coding is reversed from the stock motors. (Blade has decided to code their motors differently to everyone else in the industry..) Please click here for installation instructions! (Inductrix and Nano QX have the same motor positions)