text:
|Publication number
|Publication type
|Application number
|Publication date
|Feb 1, 2011
|Filing date
|Dec 11, 2002
|Priority date
|Dec 12, 2001
|Fee status
|Also published as
|Publication number
|Dirk Eugčne Ida Ooms
|Original Assignee
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (10), Referenced by (1), Classifications (19), Legal Events (4)
|External Links: USPTO, USPTO Assignment, Espacenet
The present invention relates to a packet header for a data packet, and more particularly to a packet header associated with the forwarding of a data packet through a telecommunications network. It also relates to a telecommunications network and to a node comprised in the telecommunication network.
Since a given two computer networks may typically possess quite different architectures, and therefore different data transmission and communication protocols, it is generally not possible to transmit/communicate data directly between those networks. Such networks are known as heterogeneous networks. An aim of inter-networking is to provide a method of packet communication that permits an application running on a first computer on one network to send information to or generally to communicate with a second computer on a different heterogeneous network.
These aims are typically achieved by use of Internet Protocol (IP) software which provides a uniform addressing scheme between heterogeneous networks so as to permit packet communication therebetween. Data packets transported across networks using IP are often referred to as IP datagrams, and these typically consist of a header followed by a data area or 'payload'. The header contains information pertaining to the route to be taken across the inter-network, such as the IP address of the node (computer) that originated the message and the IP address of the destination node (computer). The data area contains the data to be transported.
As is well known in the art, Internet nodes called 'routers' or 'gateways' implement internet protocol to forward datagrams/packets between networks and are arranged to physically interconnect heterogeneous networks.
Two basic forms of communication protocol are in wide use in today's communication networks for transporting data packets. These are known generally as Connection-Oriented (CO) and Connection-Less (CL) transport protocols. The former uses a connection identifier in the packet header while the later uses a destination address in the packet header.
In both CL and CO networks a 'forwarder' in a given node (including a router) serves to forward that packet, incoming to that node on an 'input port', to an output port of that node from which the packet may be output. The forwarder forwards the packet from the input port typically, in the case of CO, by obtaining network connection information from the packet header in order to determine the appropriate output port to output the packet on.
In CO transport, nodes (e.g. the source and destination) must first establish a connection before sending data across that connection. A network operating under such protocol is characterized in that a connection table must be kept in the network nodes. The connection table translates some connection identifier together with the input port into a new connection identifier and the output port and as such determines the path to be taken by the packet through the network (or networks). Each data packet transported across the network(s) must contain a Connection Identifier (CID) in its header. The CID is used by a given network node, as the packet is transported through the network, to index the connection table so as to determine the address of the subsequent node to which the packet should be transported or to determine the appropriate output port from which to output the packet. ATM and MPLS are examples of CO networks.
In practice the size of a CID is limited by the computational power or memory of the forwarder in a node. As a result available CID space is often too limited to build a full mesh of network connections for example. Furthermore, when processing a CID a node must generally process all the data bits within the CID when forwarding.
In a CL network, instead of using a CID, only a destination address is looked-up (by a node forwarder) in a routing table using a longest-prefix match operation. However, although CIDs are not required, this look-up operation is generally more complex than that required in CO networks.
It has to be remarked here that with a CL network according to a predefined destination address in a routing table the output port is selected independent of the source of the packet. This means an intermediate node for a packet originating at a first source or at a second source will always select according to this routing table, an identical output port. In this way a CL network is limited. It does not allow having independent paths for each source-destination pair.
Still another method is the well-known method of IP Strict Source Routing (SSR) in IP protocols. In this method, a packet header is attached to a data packet. This header provides, amongst other things, a pointer field and a list of IP addresses that are called routing information field. The routing information field comprises a series of IP addresses, each 4 octets (32 bits) in length, which each correspond to an address of a node (e.g. router) on a network (or inter-network). The pointer field contains a pointer that points in to the route data indicating the position of the next IP address to which the packet is to be sent on its route to the destination address (also provided in the header). A given node reading this information will act accordingly, thus, strict source routing provides a means for the source of an IP packet to supply routing information to be used by relevant nodes in the network in forwarding a packet to its destination.
The method is known as strict source routing since the router or host internet protocol must send the packet directly to the next address in the route data field, and must do so only through the directly connected network indicated by the pointer. A drawback of SSR is that it requires the use of globally unique IP addresses in the routing data field of the header. These addresses are costly of header space (high header overhead) and processing resources of a forwarder. This is generally undesirable.
U.S. Pat. No. 5,721,820 discloses a method for adaptive routing of messages in a computer network. Each message packet comprises a packet header that contains routing information, followed by the packet data. A source processor places route words in the packet header which route words identify the path which the message packet will follow. As the message packet traverses the network it is passed between switches and each switch receiving the packet examines the first route word to determine which output port of the switch the packet is to be routed to. The switch then deletes the first route word before forwarding the packet to the next network element. Therefore the next route word becomes the first route word and the switch receiving the packet will use that route word. Thus a packet has no route words left upon arriving at the destination processor. In an alternative the route words are proceeded by a route word identifier that points to the current route word, and instead of removing the first route word in each packet, each switch which the message packet passes through increments this identifier.
A disadvantage of the system described in U.S. Pat. No. 5,721,820 is that it is not suitable for use with networks having multi-access links, such as Ethernet, since they allow different nodes or switches to be reached via the same output port. It will be appreciated that specifying the output port to be used by a multi-access link node will be of no use in directing a message packet as that output port leads to several different nodes.
It is an object of the present invention to overcome at least some of the deficiencies of prior art transport protocols. The present invention aims to do so by providing a transport protocol that, for example, may provide a look-up operation less complex than that of CO protocols and obviously also less complex than that of CL. The present invention may also allow to have independent paths for each source-destination pair. Furthermore, the present invention requires less header overhead and less processing power as strict source routing. The present invention can also be used with multi-access links, such as Ethernet or Wireless LAN (IEEE 802.11), which allow more than one node to be reached from a given output port.
According to a first aspect of the present invention, there is provided a packet header for a data packet to be transported via at least one node of a network wherein the packet header includes;
It is to be understood that the term network is intended to cover both local networks and inter-connected (e.g. heterogeneous) networks, and the term node may be applied to any node of either type of network and also to a node in a multi-access link.
Thus, it will be understood that, according to the first of its aspects, the present invention employs local node identifier (LNI) data of a given node (or nodes) of a network for the purposes of providing routing information for a data packet. Note that no IP addresses are used as in the CL, CO and SSR prior art discussed above. Neither are port identifiers used as they are not suitable for multi-access links. Instead the invention employs local node identifiers which are only locally valid.
In some embodiments, the local node identifier(s) (LNI) is/are assigned to the neighboring node(s) by the at least one node. For example, referring to a router operable to implement the present invention as an "SLF router" (StateLess Forwarding (SLF)), when a given SLF router boots it identifies, via a "hello" mechanism (e.g. an OSPF Hello message), all of the neighboring routers connected to it. The given SLF router will then assign a number or symbol to each of the neighbors so identified, and each such number or symbol serves as the local node identifier (LNI) for the neighboring router to which such number has been assigned. Typically, the given SLF router will merely assign the number 1 (one) to the first identified neighbor, the number 2 (two) to the next identified neighbor, and so on. These numbers or symbols are 'local' identifiers in the sense that they are assigned to a neighboring node by a node and only have semantics (i.e. are meaningful) for the node that assigns the identifier.
It is to be noted that a local node identifier may be used to identify a neighbouring node, which comprises a plurality of, or group of, sub-nodes, or may be assigned by a node comprising a plurality of sub-nodes to identify a node which neighbours the assigning node. Furthermore, a 'neighbouring node' of a given node is preferably a node connected to the given node by a network/inter-network connection within which there are no intermediate nodes present.
It is to be noted that it is well known in the art to exchange information between routers/nodes of a network which indicates the link states between those routers/nodes. The method by which this is achieved is known as LSA (Link State Advertising) whereby each router originates one LSA message that describes the list of its own interfaces with other nodes in the network. According to the present invention, LSA may be extended so as to exchange not only link states between routers/nodes, but also to exchange local node identifiers (LNI) and information indicating which routers/nodes are SLF-aware.
Since the local node identifiers, which are only locally valid, typically require less space than full IP addresses, the packet header overhead is reduced compared to previous technologies, which used full IP addresses in the packet header. Furthermore as the local node identifiers do not specify a particular output port of a given node, but may merely specify the next node to which the packet is intended to be forwarded from the given node (the "next-hop"), a packet header according to the present invention is suitable for use in networks including multiple-access links.
Typically, the LNI will be distributed together with routing information such that they may be used as far as the routing protocol is distributing them over the network. The distribution with routing information works particularly well with link-state routing protocols (e.g. OSPF). Since link-state protocols are typically used intra-domain, the most probable usage of LNI will be within one network.
An example of the distribution of LNI "next-hop" identifiers together with routing information could be: an OSPF router receives link-state information from other routers in the network and subsequently builds a spanning tree (or "shortest-path tree") which contains the shortest path to all other routers. If the LNI "next-hop" identifiers are distributed together with the link-state information, this permits a node to read from the spanning tree which LNI "next-hop" identifiers to use to define a path to a particular destination node.
Preferably, the packet header according to the first aspect of the invention provides local node identifier data wherein the node identified by the local node identifier data is the node to which the data packet is to be transported to after reaching said at least one node of the network which the data packet is to be transported through.
Thus, the forwarder in the node(s) of a given network is able to forward the headed data packet to a neighbouring node appropriate to the route intended to be taken by the packet.
The neighbouring node may be a node reached via a multi-access link such as Ethernet.
More preferably, the packet header for a data packet, according to the first aspect of the present invention, provides a routing information field containing data associated with a plurality of nodes of the network, and wherein;
the data associated with the plurality of nodes is a list of local node identifiers each local node identifier identifying a node through which the data packet is intended to be transported, and wherein;
In other words the packet header contains a list of local node identifiers, each specifying the next-hop in a specific node along the path. This list is used as routing/forwarding data and on receipt of the data packet by a given node, that node determines from the local node identifier list in the packet header, the appropriate neighbouring node to which it is intended to forward the packet. The packet can thus be transported through the network by each consecutive receiving node.
Accordingly, it will be understood that the routing information field provides routing information through a plurality of the nodes of a given network by listing the nodes through which the data packet should be transported in order to follow the route towards the destination node. In order that any one node may determine the relevant neighbouring node to which the packet is to be forwarded, a pointer is provided in the packet header to point to the relevant local node identifier (associated with the relevant neighbouring node) in the routing information field when the packet is received at the given node. Thus, the node is able to determine which neighbouring node to send the packet to. Once this has been ascertained, the pointer may then be incremented by the node, prior to outputting, so as to point to the relevant neighbouring (or next-hop) node identifier associated with the next node to which the packet is to be subsequently sent. Clearly, when the next and further subsequent node repeat this operation, the packet will traverse the path contained in the routing information field of the header.
This is based on the premise that the pointer is incremented just prior to outputting the data packet to the next node. However, it would be possible to increment the pointer just after reception of the data packet by a node. For example, a data packet is transported via nodes A, B and C. When the data packet is received by node A the pointer in its packet header points to node B, accordingly node A prepares the packet for output to node B, but just prior to output the pointer is incremented so that it points to node C. However, it would be possible to use the following alternative technique: when the data packet is received by node A the pointer in its data packet points towards node A, shortly after reception by node A the pointer is incremented so that it points to node B, the packet is then output to node B, shortly after reception by node B the pointer is incremented so that it points to node C etc.
Also, it would be possible to delete individual local node identifiers from the front of the header when the relevant node has been reached rather than using a pointer.
Ideally the packet header for a data packet includes a length field for containing a quantity representing the number of local node identifier data items contained within the routing information field.
Preferably, in the packet header according to the first aspect of the present invention, the routing information field may be modified (at a current node and prior to transmission therefrom) by replacing the local node identifier data ('local' with respect to the current node) associated with the next-hop node with local node identifier data ('local' with respect to the next-hop node) which identifies the current node. (Note: a node X may be aware of the local node identifiers used by its neighbours to identify the node X).
Thus it will be understood that a record of the reverse path for the route may be recorded in the routing information field as the packet progresses along its route through the network. Clearly, this reverse route may be used by the packet to subsequently retrace its route (in reverse) through the network to the source (originating) node.
According to a second of its aspects, the present invention provides method of transporting a data packet via at least one node of a network wherein the method includes the steps of;
Thus it will be understood that the neighbouring node identified by the local node identifier data is the "next-hop" node to which the data packet is intended to be transported after passing through said at least one node of the network which the data packet is to be transported via.
The neighbouring node may be a node reached via a multi-access link such as Ethernet.
Ideally, this method further includes the step of;
providing routing information containing data associated with a plurality of nodes of the network, wherein the data associated with the plurality of nodes is a list of local node identifiers, each local node identifier identifying a neighbouring node for a node through which the data packet is intended to be transported, and;
providing the packet header with a pointer;
indicating with the pointer the position of an individual local node identifier in the routing information;
incrementing the pointer at each node so as to indicate the position of a local node identifier which identifies a node to which the data packet is to be subsequently transported.
The invention, according to the second of its aspects, may further provide a method of transporting a data packet wherein, at a current node and prior to transmission therefrom, the method further includes the step of;
modifying the routing information by replacing the local node identifier data associated with the current node with local node identifier data identifying the previous node from which the data packet was received at the current node.
It has to be explained that different ways are possible to obtain the routing information by a node. A possible way is making use of the method known as Link State Protocol. Indeed, by extending the Link State Protocol with local node identifier information and thereby determining which nodes a given node is coupled, a node according to the invention is able to construct the routing information field.
Another way is making use of a scout packet. Indeed, in the method of transporting a data packet, according to the second aspect of the present invention, the routing information is obtained by;
providing a scout packet at a given node which packet is operable to record the route it takes through a network and information relating to the topology of the network;
transmitting such a scout packet in to the network from the given node of that network;
receiving the scout packet at a second node after the packet has been transmitted through the network;
retrieving the route and network topology information recorded by the scout packet and using that information in the compilation of routing information.
Thus it will be appreciated that such a scout packet may provide information enabling an appropriate or optimal route from packet source to destination. For example, changes in network topology (e.g. network connections) may be monitored and the routing information in subsequent packet headers may be modified accordingly. Ideally, the said given node and the said second node may be the same node such that a scout packet is both transmitted and received by the same node.
Preferably, when a node is unable to transport a data packet directly from a first node, to a second node (the first node being the current node and the second node being the intended next node);
the routing information in the header is modified by replacing the local node identifier data which identifies the intended next node as a neighbouring node of said first node, with additional routing information;
which additional routing information routes the data packet to the intended next node via an alternative route e.g. via at least one additional node or via a parallel link.
Thus, should the link associated with the intended output port of a given node be un-usable (e.g. a link failure occurs), the second aspect of the invention may provide a method whereby a data packet may be transported from the given node to the intended subsequent node (which would otherwise have received the packet via the un-usable link). It will be understood that this is achieved by re-routing the data packet around a failed link in the network. That is to say, the given node chooses the route to be taken around the un-usable link, using the network topology information available to it, and compiles the routing information to be placed in the header accordingly.
Preferably, in accordance with the second aspect of the present invention, the packet header may be removed from the data packet at a node in a network. Ideally, subsequent to removal of the packet header, the data packet may be further transported through the network in accordance with another packet transport protocol.
Thus, the packet may be stripped of the header (of the present invention) at a given node and subsequently transported across the network using, for example, a standard IP protocol. This ensures that, should the routing information in the packet header provide only a partial route or a segment of an intended route, the data packet may still be transported through the parts of the network not included in that partial route (i.e. the rest of the full route) once that partial route has been traversed. Clearly, this represents a form of mixed routing.
Furthermore, in accordance with any of its aspects, the present invention provides a telecommunications network including at least one node operable to receive and process data packets possessing a header according to any aspect of the present invention. Preferably, this header is compiled by a node containing port identifier data for a number of the at least one nodes of the network.
Thus, it will be understood that a node originating a data packet, headed in accordance with any aspect of the present invention, compiles the route to be taken by the packet in accordance with a set of local node identifier data items (associated with nodes of the network) known to that originating node. That is to say, the originating node chooses the route to be taken, using the information available to it, and compiles the routing information to be placed in the header accordingly.
The present invention will now be further illustrated by way of non-limiting examples and embodiments, with reference to the following drawings:
Referring to
The SLF-header, according to the present embodiment, consists of an array of lines, each 4 octets (32 bits) in length, with three distinct fields, the 'LEN' field, the 'PTR' field and the 'LNI' field.
The first field in this header is denoted 'LEN' in
The second field in the header, denoted 'PTR' in
These LNI define the intended route to be taken by the SLF-headed packet when being transported through the nodes of a network. That is to say, the LNI field is equivalent to a packet routing information field. The pointer therefore points to a given item (i.e. a LNI) in a routing information field and identifies a particular neighbouring node of a given node on that route. Note that the SLF-header may terminate with a number of bytes of padding so as to ensure that the header length is an integer multiple of 32 byte words.
Indeed, according to the present embodiment, when the pointer field is first read by the forwarder of a particular node, that pointer will point to the LNI of the node to which the packet is intended to be subsequently output. Prior to such output, the pointer 'PTR' is incremented so as to point to the next LNI in the LNI field.
By providing LNIs of length 1-byte, each such LNI may uniquely identify up to 256 output ports for a given node. Of course, a larger or smaller LNI size could be used according to the present invention, however, a larger LNI size would undesirably increase the header size (i.e. the LNI field) for a given number of LNIs. Conversely, a smaller LNI size would typically be harder to process. In order to be more flexible in the encoding of LNIs in an SLF-header, and to reduce the header overhead thereof, the present embodiment also provides a method of variable-length encoding of LNIs as follows.
Each item of local node identifier data is stored in the LNI field (i.e. the routing information field) with a binary prefix attached thereto such that;
if the prefix is binary value 0, then the local node identifying data is contained in the subsequent 3 bits of that item;
if the prefix is binary value 10, then the local node identifying data is contained in the subsequent 6 bits of that item;
if the prefix is binary value 110, then the local node identifying data is contained in the subsequent 9 bits of that item, etc.
Each additional binary digit of 1 which is added to the prefix binary value introduces an extension of 3 additional bits for the LNI data as can be seen from the three examples above.
Thus, the encoding 'class' of an encoded LNI is indicated by the first one or more bits thereof, and the LNI field may contain LNIs of variable length, e.g. half a byte, one byte, 1.5 byte or two bytes etc. Clearly, the pointer 'PTR' is to be incremented according to the class of the LNIs, so as to ensure that LNIs are pointed to sequentially.
It is to be understood that the SLF-header is intended to be attached as a header to any type of payload. Such a payload might be, for example, an IP datagram such that the payload also includes a header (i.e. the IP header) encapsulating another payload. Accordingly, to further illustrate the invention according to any of its aspects, there follows an embodiment wherein the payload of the SLF-header is just such an IP datagram wherein the SLF-header is implemented as a layer below IP. The header may contain a field (not shown) which contains data identifying the next (i.e. higher) layer protocol, such as IP. In addition, a reserve field could also be inserted between the "LEN" field and the "PTR" field to allow either the room to expand as and when required.
Referring to
To be a SLF router, a given router (or more generally a given node) must have available to it, or be capable of receiving, a number of LNI associated with other SLF-aware nodes in the network with which it can construct a LNI list (to put in the LNI field of the SLF-header). Put another way, a SLF router/node is a router/node able to so define a valid route intended to be taken by the SLF-headed packet when being transported through the nodes of the network.
Returning to
It has to be remarked that according to another implementation and since node B has to execute some routing processing anyway, LNI=3 relating to the 'next-hop' (router C) is not necessarily required in the routing information field.
The route so calculated is placed in the LNI field of a SLF-header and the SLF header, complete with LEN and PTR fields, is used to encapsulate the IP datagram. Router B then determines, with the pointer in the SLF-header, which neighbouring node to transmit the SLF packet to. This may entail determining which of the router's output ports to transmit the SLF packet through. The router then increments the pointer (so as to point to LNI=4) before outputting the SLF packet 4. Thus, having been output of router B through an appropriate port, the SLF packet is subsequently received at an input port of router C.
Router C reads the SLF header of the SLF packet. The pointer PTR having been previously incremented now points to LNI=4. Accordingly, the router determines that the SLF packet is to be output to router D and towards router D. Were the LNI field to contain more than two LNIs (or were there to be more than three linked SLF routers), the router C would then increment the pointer PTR so as to point to the next LNI in that list before outputting the SLF packet to the next SLF router. However, in the present example, the pointer in the SLF header received by router C already points to the terminal LNI in the LNI field. This implies that the router to which the SLF packet is to be sent, from router C, is the terminal SLF-aware router in the local route (i.e. router D).
Thus, it will be understood that in such a case it is not necessary to increment the pointer PTR prior to output to such a terminal SLF router, since there will be no LNI in the LNI field associated with that router. Furthermore, SLF-headed packets will not be output from a terminal SLF router to a non-SLF router since, clearly, the latter type are not SLF-aware and thus are incapable of processing SLF headers.
It has to be remarked that according to another example the LNI field could include a LNI for router E and that the SLF packet output from router C could then point to that LNI. When the SLF packet is received router D could then read that LNI before stripping the SLF header off of the SLF packet. The router would then know which node to output the IP packet to and would still only have used the SLF protocol.
Consequently, the pointer PTR is set to 0 (zero), or some other predefined symbol, so as to indicate this condition to router D (i.e. that it is the terminal SLF router). As a result, on receipt of SLF packet 5 the router D strips that packet of its SLF header thereby revealing the original IP datagram. Subsequent packet transportation, from router D to router E takes place according to IP protocol. Of course, should that IP datagram encounter a further one or more SLF-aware routers before reaching destination address 'IP_dest=192.168.x.x', then the process of SLF header encapsulation and transmission, as discussed above, would be initiated once more.
In a further embodiment of the present invention, according to any of its aspects, there is provided a technique of 'Reverse Path Recording' (RPR) an SLF packet as shall be described below.
In general terms, this technique involves modifying the routing information at each SLF router/node, prior to transmitting the SLF packet from that node, so as to contain the route travelled by the packet in reaching the current node. This must be done without corrupting the routing information corresponding to the remaining un-travelled route.
Each router transmits an OSPF "Hello" message in order to enable LNIs to be formed. When an SLF router receives an OSPF message from a neighbouring node/router it is able to construct a table of local node identifiers in which each next-hop interface with another node is assigned an LNI. Note that LNIs are assigned to neighbours that are not SLF-aware (SLF capabilities are not announced via OSPF "Hello" messages). Each such SLF router assigns a locally valid identifier to each of the neighbouring routers connected to it (whether or not they are SLF aware) using a semantic valid only to the assigning router. For example, router C assigns LNI=C1 to identify neighbouring router B, LNI=C2 to identify neighbouring router G, LNI=C3 to identify neighbouring router D and LNI=C4 to identify neighbouring router H.
The table illustrated in
The LNI information constructed by the various SLF routers in the network is communicated to other SLF routers in the network by 'flooding' the network with the information. The flooding of the LNI information is done via Opaque-LSA type 10 (area flooding-scope). Thus, each SLF router must be Opaque-LSA capable in this embodiment. Each router creates an Opaque-LSA to advertise its SLF information by forming an LSA packet the header of which identifies the originating router (e.g. router C) and the payload of which includes a list of the pairs:
<IP address, LNI>
for each neighbour interface (see second and fourth column of
Turning to
This packet is received by router C on an input port of the latter. Once received, router C then replaces the LNI previously pointed to i.e. LNI=C3, for router D, with LNI=C1 for router B), thus yielding SLF packet 16 with a modified LNI field containing elements {C1, D3}. Subsequently, PTR is incremented and the SLF packet transmitted to router D whereupon it is received at the latter via an input port thereof. Router D then replaces the LNI last pointed to (i.e. LNI=D3, for router E) with that for router C (i.e. LNI=D1), thus yielding SLF packet 17 with a modified LNI field containing elements {C1, D1}.
Thus, it can be seen that both SLF packets 16 and 17 contain a route (in terms of LNI) to both the originating SLF node B and the destination node E. For either packet, the forward route may then be read (by e.g. a router) by incrementing the pointer PTR, while the reverse route may be read by decrementing PTR. Either packet may be forward routed or reverse routed by incrementing or decrementing PTR respectively.
Prior to transmission each of the routers C and D may store the respective forward and reverse routes. These routes may then be used in future SLF packet routing.
It is to be noted that it is well known in the art to exchange information between routers/nodes of a network which indicates the link states between those routers/nodes. The method by which this is achieved is known as LSA (Link State Advertising). According to the present invention, LSA may be extended so as to exchange not only link states between routers/nodes, but also to exchange LNI and information indicating which routers/nodes are SLF-aware.
Alternatively, the provision of link-state information for and in respect of SLF nodes, according to the present invention, may be achieved by employing a method hereafter referred to as 'packet scouting'. Packet scouting may be initiated by any one node of a network (a SLF node or otherwise) and involves the transmission of a 'scout request' from that node, i.e. the originating node, to some destination node of the network (a SLF node or otherwise). This scout request may be transmitted from the former to the latter by any transmission or communication means as would be known to a person skilled in the art but, typically, would be effected by transmission of a data packet (a SLF packet or otherwise).
The request includes the address of the originating node and, of course, the destination node.
Once the destination node receives the scout request it accordingly transmits a 'scout packet' back to the originating node. In the course of transportation across the network, the scout packet, so transmitted, may encounter a group of interconnected SLF nodes. These interconnected nodes may form part of the route followed by the scout packet, or may comprise the whole route. At each such SLF node the scout packet is recognised as being such and, accordingly, each SLF node in the group thereafter processes the SLF header of the packet (after encapsulation thereby) using the method of reverse routing, as described above, when transporting the scout packet through the group. Each SLF node in the group which is intermediate the first and the last nodes of the group, records the reverse-routing information of the SLF header attached to the SLF packet received by it. Thus, it will be understood that the reverse route so recorded corresponds to the reverse of the route taken in a direction from the node originating the scout packet to the node Receiving the scout request. Clearly, this route is equivalent to a forward route from the latter to the former. Thus, each SLF node having recorded the reverse rout information is thereby able to update its route information relating to that group.
Any subsequent groups so encountered by the scout packet would, obviously, be able to operate in the same fashion.
Note that, should all the nodes encountered by the scout packet be SLF nodes then the complete route taken by that packet would be available to the node originating the scout request. Furthermore, it is to be understood that the node originating the scout request could also be the node that receives the scout packet. That is to say, a given originating node may launch a scout packet in to the network, which scout packet is destined for that same node. This would, for example, allow an originating SLF node to determine the route information and network topology of the network local to it. This is particularly useful in re-routing SLF packets around failed links between SLF nodes as will now be discussed.
An SLF node can obtain the SLF path to a certain destination without the direct co-operation of a routing protocol. First, the SLF node sends a Scout Request towards a destination address (e.g. triggered by an IP packet to this destination). The Scout Request records the SLF path and the last network prefix towards the destination until it reaches the last SLF node (not necessarily the destination). The last SLF node sends a Scout Reply back to the first SLF node. The Scout Reply contains the SLF path and the network prefix, which was set by the last-but-one SLF node in the Scout Request. If an intermediate SLF node receives an SLF packet with a LNI that became invalid (due to e.g. a link failure), this can be signaled to the originating node with a Path Failure message. Several cases can occur:
If a network topology change occurs inside a group of interconnected SLF nodes, e.g. due to link failure, the routing information contained in those nodes may be rendered invalid. There may be a significant amount of time during which a node originating an SLF packet is left unaware of this topology change and, during this time, would consequently launch SLF packets containing invalid routing information. To overcome this problem the present invention, according to any of its aspects, provides a technique by which such an originating node may be informed of such a topology change, and by which link failures may be overcome.
Clearly, the packet could be re-routed via any number of suitable SLF nodes and the present invention is not intended to be limited to re-routing only via one additional SLF node as illustrated in
The node B may obtain the necessary route information relating to node E by e.g. employing the method of packet scouting as discussed above. Furthermore, by employing reverse routing in SLF headers, node B is able to determine the reverse route of the packet arriving from node A (i.e. determine the route from B to A) and thereby signal to node A that the originally intended link between nodes B and C has failed. This signal may also include the re-routing information used by node B such that node A may update its routing information. The signal may be sent using a packet (SLF packet or otherwise).
It has to be remarked that a possible distribution of the SLF functionality in a telecommunication network could be as follows: comprising in routers at the edge of the network i.e. edge routers, extended route information and network topology information and comprising in routers in the core of the network i.e. core routers, only a limited route and network topology information of the network e.g. only related to its neighboring nodes.
The embodiments described herein merely provide examples of the inventive concept of the present invention and are not intended to be limiting. Variations and alterations to those embodiments, such as have been identified in the above description, may be made without departing from the scope of the invention.
|Cited Patent
|Filing date
|Publication date
|Dec 7, 1993
|Dec 19, 1995
|Picard; Jean L.
|Method and system for routing information between nodes in a communication network
|May 31, 1994
|Jan 23, 1996
|International Business Machines Corporation
|Network layer packet structure
|Sep 11, 1995
|Feb 24, 1998
|International Business Machines Corporation
|System for adaptively routing data in switching network wherein source node generates routing message identifying one or more routes form switch selects
|Jul 10, 1995
|Dec 8, 1998
|Behaghel; Denis
|Local area network interconnection system implementing a routing protocol of the "source routing" type and interconnection equipment intended to be used in such a system
|Nov 26, 1997
|Aug 22, 2000
|International Business Machine Corp.
|Method and apparatus for optimizing route generation in a connection oriented network
|Oct 15, 1999
|Jan 27, 2004
|Nokia Wireless Routers, Inc.
|System for routing and switching in computer networks
|Dec 29, 2000
|Mar 9, 2004
|Tropos Networks, Inc.
|Method and apparatus to provide a routing protocol for wireless devices
|Jan 10, 2000
|Jul 20, 2004
|Lucent Technologies Inc.
|Address option for use in an internet protocol-based multimedia mobile network
|Jun 15, 2000
|Dec 19, 2001
|Telefonaktiebolaget Lm Ericsson
|Methods and arrangements in a telecommunications system
|Oct 16, 2000
|Apr 26, 2001
|Nokia Wireless Routers, Inc.
|System for routing and switching in computer networks
|Citing Patent
|Filing date
|Publication date
|Dec 27, 2012
|Jul 3, 2014
|Deep River Ventures, Llc
|Methods, Systems, and Computer Program Products for Determining a Protocol Address For a Node
|U.S. Classification
|370/351, 370/474, 709/238, 370/392
|International Classification
|Cooperative Classification
|European Classification
|Feb 26, 2003
Owner name: ALCATEL, FRANCE
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:OOMS, DIRK EUGENE IDA;REEL/FRAME:013796/0694
Effective date: 20030113
|Jan 30, 2013
Owner name: CREDIT SUISSE AG, NEW YORK
Free format text: SECURITY AGREEMENT;ASSIGNOR:LUCENT, ALCATEL;REEL/FRAME:029821/0001
Effective date: 20130130
Owner name: CREDIT SUISSE AG, NEW YORK
Free format text: SECURITY AGREEMENT;ASSIGNOR:ALCATEL LUCENT;REEL/FRAME:029821/0001
Effective date: 20130130
|Jul 24, 2014
|Fee payment
Year of fee payment: 4
|Sep 30, 2014
Owner name: ALCATEL LUCENT, FRANCE
Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CREDIT SUISSE AG;REEL/FRAME:033868/0001
Effective date: 20140819


text:
Producer/reporter/anchor, NewsChannel 21
I was raised in Central Oregon from an early age and am elated to produce, report and anchor the news for the community that helped me grow into a young adult.
I did not know what I wanted to be when I was growing up, but by high school I realized that "anything-but-math" could work for me. Journalism and public speaking sparked my interest during high school. I graduated from Summit High School in 2012, and attended the University of Oregon thereafter. I recently graduated Cum Laude from the School of Journalism and Communications with a minor in political science in June 2016. I was raised in a family of Beaver fans, so imagine the shock when a first-generation Duck emerged! During my time at Oregon, I worked with the Daily Emerald newspaper as an opinion columnist, was a member of the Delta Gamma sorority, reported and anchored for the student-run Duck TV Broadcasting, and studied cultural journalism in Greece and Italy during my junior year. In the summer of 2014, I interned with KTVZ and acquired the essential skills that I needed to pursue my career as a broadcast journalist and future storyteller. This history with NewsChannel 21 makes me all the more delighted to work in my hometown. While I'm not covering the news, I'll either be on horseback or at a rodeo, hiking the Cascades, enjoying the local brewery community, running the river trail, hanging out with dogs, or stuffing my nose into a good book. Everyone has a story, and I am thrilled to work at KTVZ with inspiring coworkers around me to share those stories with the community and the world.

subset: commoncrawl


text:
SB Game Hacker
Download SB Game Hacker
Android 6 and above
Android 5
Android 4
Android 4 and below
The best reasons for exploitation Sb Game Hacker APK is that it's free. It may be used with none pertinent ads barging their method within the middle of your activities. Secondly, Game Hacker apk has options like speed hack, deep search and multi address search, tools that assist you in cracking the games in your phone quicker and easier. The Sb Game Hacker worth program is additionally pretty and advanced such there's a choice once installation allows} you to pause your game within the middle of action and enables you to hack the sport then and there. Games like Candy Crush, Subway Surfers and Hungry Shark Evolution becomes quite simple to play with facilitate of SB Game Hacker APK.


text:
Personal shopper
Annalisa Barbieri finds solutions to your shopping dilemmas
I'm looking for new transport options to get myself and my toddler around town. Can you find any innovative solutions for us?
I'm looking for a tent for two adults and two small children. Do you have any recommendations?
My niece is about to have a bone-marrow transplant for leukaemia and will be in isolation, possibly for several months. All the belongings she takes in with her must be sterilised, and in the case of soft toys, machine-washed at 60C. Could you suggest any teddies or other cuddly animals that will survive this process without damage?
My son has turned 10 and has had a couple of school lessons about puberty and I feel it is time he knew a bit more. I would like to find a book that gives the facts without being patronising or moralistic.
We are a family with two small children and have been considering buying a portable DVD player to use in all the other rooms - we have a growing DVD collection and little time to sit and watch them.
My partner and I are in a rut - we've forgotten how to have fun as a couple. We've decided we'd like to spend a bit more active time together - just the two of us - and would welcome a bit of advice about sporting activities for fortysomethings with little time to spare.
My mother, who is 81 and lives alone, has begun to suffer from dementia. Are there any pre-printed checklists on the market that would help her with her shopping.
Annalisa Barbieri on high-visibility clothing for children.
Annalisa Barbieri on Christmas presents that you can make yourself.
Annalisa Barbieri finds clever ways to keep children busy on long car journeys
Annalisa Barbieri on football coaching classes for children.
Annalisa Barbieri searches out the best suncreams for your family this summer.
Personal shopper Annalisa Barbierishops around for garden playhouses.
Annalisa Barbieri on buying a school lunch box and a food flask.
My daughter, Philippa, is going to Sheffield university to study biochemistry and microbiology next week. I'd like to help out, but I don't want to just hand over a lump sum. In what other ways can I help?


text:
Lemon Meringue Martini
Driftwood Room Portland, Oregon
The roof of this boutique hotel bar's parking garage hosts summer screenings of offbeat classic films such as John Waters's Polyester.
Plus: Ultimate Cocktail Guide
- Servings: Makes 1 drink
- 1 lemon wedge
- Granulated sugar
- Ice
- 1 1/2 ounces vanilla vodka
- 1 1/2 ounces Cointreau or other triple sec
- 3/4 ounce fresh lemon juIce
- 1/4 ounce simple syrup
- 1/4 ounce heavy cream
How to make this recipe
Moisten the outer rim of a martini glass with the lemon wedge and coat lightly with granulated sugar. Fill a cocktail shaker with ice and add the vanilla vodka, Cointreau, fresh lemon juice, simple syrup and heavy cream. Shake well and strain into the prepared martini glass.


text:
As part of the Royal Savoy Vacation Club increased service portfolio, we have now started a rental programme on behalf of our members.
Since the early 1900's, the Hotel Savoy has welcomed discerning visitors to Madeira. From a small family business with humble ambitions and the name "Royal Hotel", grew a tradition of sincere and discerning hospitality. In 1914 the hotel's name was changed to the Hotel Savoy and subsequently had so much success that the hotel was twice extended to be able to cater for the ever increasing demand for its unique atmosphere and facilities.
In the early days, visitors were brought to the hotel by bullock cart from the harbour. The first taxi on the island was hired to replace the bullock carts and well before the islands airport was built, a flying boat service was introduced from Southampton to Madeira. Many famous celebrities came to the Hotel Savoy, as its reputation for excellence grew worldwide.
The Royal Savoy opened in April 2002, a century after its first inauguration and is the latest enhancement to the facilities offered by the Savoy Group. Built at a cost of some €40 million, the complex consists of 162 Apartments of which there are 101 Studio's, 41 One-bedrooms units and 20 Two-bedroom suites.
As part of the Royal Savoy Vacation Club increased service portfolio, we have now started a rental programme on behalf of our members.
As a special marketing promotion for people interested to visit the resort and to get to know more about the Vacation Club Membership.
You can view images of the 1st phase of construction here. The 2nd phase has been temporarily deferred. New images will be added as soon work recommences.


text:
|<< Previous book
|Next book >>
Unreasonable Hours(1995)
A novel by Julio Cortázar
"Seven stories from Cortâazar's volume Deshoras (see HLAS 48:5600). Useful afterword by Manguel places work in biographical, literary, and political context. Powerful, often fantastic narrations told from different points of view, compellingly translated by Manguel. Important contribution to Cortâazar bibliography in English"--Handbook of Latin American Studies, v. 58.
Used availability for Julio Cortazar's Unreasonable Hours
See all available used copies of this book at Abebooks UK or Abebooks US
Paperback Editions
June 1995 : Canada Paperback
|Title: Unreasonable hours
Author(s): Julio Cortazar
ISBN: 0-88910-494-8 / 978-0-88910-494-5 (Canada edition)
Publisher: Coach House Pr
Availability: Amazon Amazon UK Amazon CA
Genre Pages


text:
Canadian Summer Olympic Athletes
January 6, 2012 by staff
Canadian Summer Olympic Athletes, There's no looking back now. We're in an Olympic year, and already the rush is on to the London 2012 Games. Canadian summer athletes are facing the inevitable "do or die" scenarios right out of the gate, even as winter deepens in the land of ice and snow.
The artistic gymnasts are embroiled in a last-ditch attempt to qualify early next week at North Greenwich Arena on the outskirts of the Olympic city. If they're successful on both the men's and women's fronts, they'll qualify full teams of six for the real deal at the very same venue in August.
Olympic gold medallist Kyle Shewfelt is accompanying the Canadian team on its English odyssey and knows full well that making the Olympic grade in one of the most high-profile sports at the Games is essential to the long-term health of gymnastics in Canada.
"The future of gymnastics in Canada will be decided right here," said Shewfelt from the Canadian training camp in England. "This competition is ridiculously crucial. It's undoubtedly the most important time for them in the entire Olympic cycle – kind of like the seventh game in the Stanley Cup final."
After his victory in Athens in 2004, enrolment spiked remarkably at gymnastics clubs across the country. There was no doubt that in Shewfelt Canadian youngsters had finally found a champion to emulate.
Women's soccer team embraces 2nd chance
Back home in mid-January, CONCACAF Olympic qualifying takes place in women's soccer. Vancouver's B.C. Place Stadium will be familiar turf for the Canadians who are favoured to claim one of the two spots available for the Olympic tourney in London. Captain Christine Sinclair and her teammates are, however, coming off a brutal FIFA Women's World Cup in Germany, which saw them fail to claim a result and score only one goal.
The good news is they have a new coach in John Herdman, who comes over having worked wonders in New Zealand. In addition, the Canadians played inspired football to win the gold medal at the Pan American Games in Guadalajara. Still, the women from the United States are the reigning Olympic champions and you can bet they'll return to defend their title in London. Mexico is also a very good side and the Canadians will have to be ultra-organized in order to get their spot.
Once again, there's a lot riding on the success of the Canadians with regard to their Olympic aspirations. After the failure at the World Cup, and because Canada is hosting the next World Cup in 2015, there's a sense of urgency to keep the fastest-growing sport in the country in the spotlight. Failure to make the Olympic cut would be a real setback to women's soccer across the nation.
As the calendar continues turning, there will be hundreds of seminal moments to come in the careers of so many Canadian hopefuls. They all know that just to get to the Olympics is a victory in itself. But most who will wear the Maple Leaf at the next Games are also aware that just getting there isn't good enough. In this day and age, Canadian athletes are expected to perform and to contend. The Canadian Olympic Committee has targeted a top-12 finish for London 2012, and that means winning more than the 18 medals, including three gold, Canada claimed in Beijing nearly four years ago.
Veteran diver and two-time Olympic silver medallist Alexandre Despatie knows that reaching that goal will be tough. He's aspiring to make his fourth Olympic appearance this summer.
"Everyone is at the height of their abilities. Everyone is after the same thing and that's to be the best," Despatie said of the Olympic challenge. "It's always the feeling of wanting to be better than the time before. But it's the Olympics and there is this undeniable energy. There's something in the air."
Yes, there is something in the air, and in spite of the mid-winter frost Canadian athletes can most certainly sense it – they can even hear it.
There's no question that in early January an Olympic journey to London in July is calling out to them.
Please feel free to send if you have any questions regarding this post , you can contact on
Disclaimer: The views expressed on this site are that of the authors and not necessarily that of U.S.S.POST.


text:
Product code: 20858
Despatched in 1-3 days.
The Essential Blends have been carefully formulated by Absolute Aromas team of experts to bring you 12 distinctive blends designed to assist, support and offer relief from all of life's eventualities. They are so versatile and easy to use; you can diffuse them, dilute them or even add them directly to running bath water.Basil and Bergamot are both stimulating oils that help to channel the mind.
Sign up for the latest news, offers and ideas.
eChemist.co.uk © 2017. All rights reserved.


text:
Five questions Gators need to answer to get back to Omaha
Published: Friday, February 17, 2012 at 6:01 a.m.
Last Modified: Thursday, February 16, 2012 at 9:02 p.m.
Sure, Florida is loaded, The Gators are the nation's preseason No. 1 team and return their starting rotation and most of their position players. But there are still plenty of questions with any team playing at a high level. These are the five biggest:
Numbers you should know
0: The number of errors made by outfielder Tyler Thompson in 89 chances last season.
1: The number of games Florida lost last year when leading after the seventh inning.
7: The number of RBIs Preston Tucker needs to break Brad Wilkerson's 14-year-old record for career RBIs.
8: The number of home runs catcher Mike Zunino hit in SEC games in 2011, the most on the team.
13: The number of times Florida scored 10 or more runs in a game last year.
28: The number of games Florida plays against teams ranked in Baseball America's preseason top 25 this year.
65: The number of runs Florida scored in the seventh inning last year.
97: The number of strikeouts for Karsten Whitson as a freshman last year, the most on the team.
1. Florida was hit hard in its bullpen, so can they find a way to solidify that area?
The Gators will be looking for both midweek starters and middle relief early in the schedule. They have closers in Steven Rodriguez, who had a 1.91 ERA and was brilliant in Omaha, and Austin Maddox, who had an ERA of 0.67 last year. Rodriguez has added a cutter to his repertoire, making him even more effective. Greg Larson is a likely candidate for middle of the week starts as is sophomore Johnathon Crawford. Florida will also count on a freshman class of pitchers led by Johnny Magliozzi to eat up some innings.
"The interesting thing is going to be whether we can use those midweek starters to bridge the gap from the starters to the closers," said Florida coach Kevin O'Sullivan. "Can we score enough runs in the midweek games to get those guys out of there and have them ready, especially for Saturdays? Can they come back and be effective?"
2. Can Florida generate some power from players other than Preston Tucker and Mike Zunino?
Last year, those two accounted for 34 of Florida's 69 homers.
"We've got some guys who can hit 5-to-10 homers," O'Sullivan said. "Brian Johnson, Daniel Pigott, Tyler Thompson can all do that. We need them to supply some power."
Johnson could be ready for a big year after gaining 12 pounds during the offseason.
"It's what we were looking to do," Johnson said. "I've been hitting the ball a lot harder. I just have to keep being selective."
3. Who will play second base?
For four years, O'Sullivan was able to pencil Josh Adams into the lineup. He's gone now, and it's a position that is crucial to this team not only at the plate but defensively.
O'Sullivan said he plans to play both freshman Casey Turgeon and sophomore Cody Dent at second. Dent played third last year and will also share some time there with freshman Josh Tobias. Dent came on late in the year with his bat as well as his glove.
4. Can the Gators generate some stolen bases?
A year ago, Florida wasn't much of a running team with only 56 steals in 72 games.
"We have to be able to get the running game going this year," O'Sullivan said. "The younger kids are going to get a hard look from us."
Florida's freshman class should be able to provide a spark in that area with Justin Shafer, Turgeon and Tobias.
5. Is junior-itis going to be an issue?
The Gators are loaded with players who will be high picks in the next Major League Baseball amateur draft in June. In other words, they are playing in their contract years.
It can be a distraction, but O'Sullivan doesn't think it will be.
"With the guys we have, I see them being able to handle it," he said. "I trust them. They're all baseball players. They are so competitive, they just want to win."
Reader comments posted to this article may be published in our print edition. All rights reserved. This copyrighted material may not be re-published without permission. Links are encouraged.


text:
Ex-Miss USA & TSA
May 4, 2011 by Post Team
Ex-Miss USA & TSA, A former Miss USA Authority said that the Transportation Security "violated" in her "patdown entire body" after she refused to go through a body scanner in Dallas.
Susie Castillo, who was Miss USA in 2003, said he felt "raped" by a female TSA agent at the patdown, based on the agent touched her genitals on four occasions, while her pat down the back and front, The Boston Globe reported Wednesday.
"She really touched my vgna," she said. Castillo, who works as an actress, said he travels frequently and tries to keep the explorers as it has concerns about radiation.
TSA requires passenger airlines that refuse to pass even though the scanner to undergo a patdown.
"I am now so upset that they are making me choose to get upset – because that's what I want. – O pass through a machine that is totally unhealthy and dangerous"
Castillo said that when she complained to TSA officials in Dallas gave him a complaint form to fill.
Please feel free to send if you have any questions regarding this post , you can contact on
Disclaimer: The views expressed on this site are that of the authors and not necessarily that of U.S.S.POST.


text:
BÉABA Clip Portion Containers
Freeze, store and transport baby's meals with ease thanks to this set of stackable portion-sized containers that clip together to make them easy to track down in your diaper bag or stroller caddy. Color(s): peacock. Brand: BEABA. Style Name:Béaba Clip Portion Containers (6-Pack). Style Number: 5156644. Available in stores. Learn More


text:
Please enter search term
Dial up her classic look with delicate jewelry
Iconic Swan Pierced Earrings
$ 99.00
Iconic Swan Ring
$ 79.00
Iconic Swan Ring, Black
Iconic Swan Small Pendant
Lovely Crystals Mini Watch, Pink
$ 349.00
Lovely Crystals Mini Watch, Silver Tone
$ 399.00
Mini Cross Pendant, White
$ 75.00
Solitaire Pierced Earrings
$ 69.00
Sparkling Dance Heart Necklace, White
$ 129.00
Sparkling Dance Pear Set, Small, White
$ 169.00
Sparkling Dance Round Necklace, White
Please enter a valid email address!
Since 1895, founder Daniel Swarovski's mastery of crystal cutting has defined the company. His enduring passion for innovation and design has made it the world's premier jewelry and accessory brand.
Our member-only collective that offers exclusive gifts and rewards, events, and sparkling surprises.
Join the exclusive world of brilliance and live your crystal passion to the fullest.
It seems that cookies are not enabled in your web browser. Please activate cookies and reload this page.


text:
Vitamin E can prevention white hair and promotes hair growth role.
Vitamin E can improve hair follicle micro circulation, ensure sufficient nutrition supply hair follicle, make the hair regeneration. Simple alopecia areata is caused by small angiogenesis contraction, and it can be cured by apply natural vitamin E and eating food contain rich vitamin E.
The main ingredient of hair is keratoprotein, and if you lack of vitamin corneous protein will appear the phenomenon of hair. To cure this disease must eat artificially extraction and manufacturing of vitamin outside, and we should eat more green vegetables, fruits, meat, milk, eggs, lean, soy, fish, shellfish, yeast, vitamin supplements to prevent falling hair.
Because vitamin E can make cell division speed, this new hair cycle divided synthesis will be accelerated, so the hair won't appear hair, and has been very healthy growth.
[Trichomadesis prevention]: trichomadesis also called bald disease, on medicine can be divided into temporary trichomadesis and permanent trichomadesis two kinds big. Temporary trichomadesis mostly due to various reasons make hair follicle blood supply decrease, or local neuromodulation function obstacles that hair follicle malnutrition but no structural damage, after treatment, and new refunded renewable restorable. Common has all the bald, disease areata, hair loss, drugs after sexual trichomadesis, etc. Sex outside of trichomadesis is forever various lesions million, leading to the structural damage hair follicle new hair do not regenerate. Common permanent hair loss have to bacteria bald hair sex folliculitis or acne caused by fungus, HuangXuan or black tinea with brains countries shape lupus erythematosus, flat Zhang moss tinea, pseudo alopecia areata, etc. Early bald are genetic, although not form the scar, but due to the hair follicle atrophy, hair regeneration is often difficult.
Trichomadesis classification: spiritual trichomadesis, postpartum trichomadesis, menopause trichomadesis, hair sex trichomadesis, salt sex hair loss and sugar sex hair loss, etc.
Spiritual trichomadesis: mental pressure of excessive and cause hair loss. In mental pressure, under the action of the human body standing hair muscle contraction, the hair follicle, and erect on conveying the micro nutrient vasomotor, make a hair nutrient supply is restricted, must hair ecological change and malnutrition mental pressure will cause excessive sweating the sebaceous glands secretes growth, produce severe head hair scale, reduce the environmental quality of survival resulting fall off.
Treatment: by sending mental state, reduce mental pressure.
Hairstyle sex hair loss: such as braid, such hairdo can never send applogized for hair loss.
Treatment: the hair needs to keep a certain degree of natural fleeciness and proper elasticity, otherwise they will be broken or fall off.
Salt sex hair loss and sugar sex hair loss: the reason is salt and sugar excessive. Because salt minister hair organization stranded excessive moisture, affect a hair to normal growth; Sugar will destroy vitamin B group, disrupt the pigment metabolism, make hair hair bent, and too much sugar in vivo inducing seborrheic dermatitis into fat, then cause great hair loss.
Prevention and treatment: control sugar and salt intake.
Seborrheic trichomadesis: is based on the sebum overflow excessive a hair loss occur, often accompanied by scurf, scalp fat, itching obvious. Seborrheic hair loss occur in the sebaceous glands to secrete exuberant male youths, so sometimes called "male pattern bald hair".
Treatment: first notice hair care and nursing and less food excitant food. Shampoo shouldn't be too frequent, and local drug to remove grease, reduce scurfy, antiphlogistic anti-itching primarily.
Limitations: erythema shape trichomadesis (bald spot with neurological and psychiatric factors may cause hair growth, endocrine disorders, depress immune function disorder, infection, poisoning or other internal disorders related.
Treatment: can use spirit smell method, oral vitamin B and E, etc. Hair loss serious or revised the side take off with corticosteroids can add and immune strength agent. Local therapeutics can choose stimulate local skin blood circulation, promote the external use hair growth.


text:
Ben's Kosher Delicatessen
Ben's Kosher Delicatessen
Ben's Kosher Delicatessen
Ben's Kosher Delicatessen
Ben's Kosher Delicatessen
Knishes, hot pastrami, chopped liver—you'll find deli classics and much more at Ben's, proud sponsor of an annual matzo-ball-eating contest. (The 2002 winner downed 16 and a quarter in five minutes.) The granddaddy of 6 statewide locations and 1 in Boca Raton, FL, Ben's Gotham branch features a loud, 250-seat purple dining room and even louder yellow menus, chock-full of exclamation points. Half an overstuffed sandwich, served on soft, tangy rye or wheat, is thicker than War and Peace, and the beef, turkey and veggie burgers are bursting out of their buns. There are also steaks, veal chops and chicken livers, plus lighter choices, such as a Caesar salad. Ben's is midtown-pricey and lacks the bustling charm of the 2nd Avenue Deli, but with so many choices, stop kvetching and eat already.
|Venue name:
|Ben's Kosher Delicatessen
209 W 38th St
New York
|Cross street:
|between Seventh and Eighth Aves
|Opening hours:
|Daily 11am–9pm
|Subway: N, Q, R, 42nd St S, 1, 2, 3, 7 to 42nd St–Times Sq
|Average main course: $12. AmEx, DC, Disc, MC, V
|Do you own this business?


text:
Artificial Intelligence (AI) has been trending since August, with interest in the hot topic spiking even higher following a release from MEXT (Ministry of Education, Culture, Sports, Science and Technology) announcing the allocation of 10 billion Japanese yen to build a research center dedicated to Artificial Intelligence. Despite the trend toward broader applications – Nikkei Big Data just recently published a special 100-page feature titled Everything You Wanted to Know about AI – Artificial Intelligence in Japan remains almost exclusively the purview of robot R&D.
At a special occasion held on September 25 at Academy Hills in Tokyo, Chih-Han Yu, CEO and co-founder of Appier, and Nobuyuki Idei (出井伸之), former chairman of Sony Group and current CEO of Quantum Leap, came together to discuss at length The Future of Artificial Intelligence as a Cutting-edge Technology for Businesses.
During the forward-looking discussion, the two CEOs delved into how AI and Big Data are changing the way we do business, especially in the areas of advertising and marketing.
Yu said the implications for AI are far-reaching, and that AI will soon help businesses make smarter decisions, personalize information, and decide on a course of action through real-time intelligent analysis of feedback. Elaborating further, Yu described how AI's built-in learning mechanism would allow for continuous self-improvement, leading businesses straight to the best solution every time.
Applying AI to the mainstream business model won't happen overnight, but as Yu pointed out, Appier has already harnessed the power of AI to create highly accurate prediction models that help marketers gain insight into cross-screen user behaviors, giving them the inside information they need to achieve their business goals.
Yu takes pride in his accomplishments in robotics. He has researched and developed several prototypes in projects at Stanford and Harvard, including four-legged robots and transformers. He was also on the Stanford University team that developed the winner of the 2005 DARPA Grand Challenge. The self-driving vehicle has since gone on to gain worldwide fame as the Google Self-Driving Car.
Idei has been credited with making SONY a household name in the 1990s, and overseeing SONY Group's greatest period of growth. He has also been a leading figure in the development of Japan's IT strategy, laying the foundation of Japan's Information Technology Basic Law.


text:
Posted by admin on Wednesday, August 8, 2012
Comments are closed.
Learn about the bold steps we're taking to ensure children are hunger-free, all year long!
Copyright © 2017 Alameda County Community Food Bank | Terms of Use | Privacy Policy | Contact Us | Search |
This website was made with the support of the Taproot Foundation.


text:
|Manfred Mayer - He is a real nice guy and very supportive in any kind of...
Mr. Konstantin Mayer
Moscow, Moscow - Russian Federation
About Mr. Konstantin Mayer
Interim Management, broad experience in all aspects of sales, B2B, Channel, start up's, branding as well as service oriented business and customer service optimisation.
IT channel history:
• Sales of UPS & Generator Power Supply solutions for
Telco's - Best Power / Invensys / Powerware.
• New Market development for SUSE Linux Retail &
Business Products / Services
• Market Development for Red Hat Linux across Eastern
• Market Development for OpenXchange across Eastern
• Leading and coaching of Sales & Marketing Teams
• Managing & expanding International Vendor relations
• Partner / Customer Helpdesk set up
• Planning & execution of various country specific
marketing campaigns
• Establishment of a non profit Education Programs
together with Universities in Eastern Europe
Food & Retail / FMCG:
• allocating niche markets and future trends
• development of new products
• guidance of products till market launch
• high quality HORECA network
• diabetic, fitness, low cal, low fat, organic & Bio products
• kosher baked products
+ 13 years of experience in IT channel sales & Retail FMCG., Broad range of skill in International Business as well as team and partner management., International work experience, Organized, with demonstrated ability to manage workload and meet deadlines., Excellent cross Industry Network across Eastern Europe., Extensive experience in customer service and support, High attention to detail and ability to multi task., Interim Management, Crisis resilient
Professional History
If you notice offensive or incorrect information, please contact us.
Mr. Juergen H. Geck
Denis Sosnovtsev
Channel Solutions Ma@
IBM East Europe/Asia
Mr. Kirill Grachev
Marketing director@
Softline Company


text:
Gilbert Edward Archey
Sir Gilbert Edward Archey CBE (9 August 1890 – 20 October 1974) was a zoologist, ethnologist, World War I officer, and museum director from New Zealand. He wrote one of the major works on moas, based on his own field work and collection. During his life he published numerous articles and described many new species of animals.
Early life and education[edit]
Archey was born in York, England in 1890 and emigrated to New Zealand in 1892 with his parents Thomas Archey and Sarah Triffitt. He graduated from Canterbury University College, Christchurch, with the degree of M.A. with honours in zoology in 1913.[1]
After a period teaching at Nelson College, he was Assistant Curator of the Canterbury Museum from 1914 to 1923, where he studied and published papers on numerous New Zealand fauna. He was then appointed Director of the Auckland Institute and Museum in 1924, and was personally responsible for getting funding from the Carnegie Corporation of New York in 1935.[1]
In the First World War, he served in the New Zealand Field Artillery, rising to the rank of captain. In the Second World War he was attached to the British Military Administration in Malaya with the rank of lieutenant-colonel.[1]
He was on the New Zealand University Grants Committee, 1948–51, 1954–60, and on the Council of the Royal Society of New Zealand, being president from 1941 to 1942. He was a member of the Maori Purposes Fund Board, the Waitangi National Trust Board, and the Auckland branch of the Royal Society, and the Queen Elizabeth II Arts Council.[1] He retired from the Auckland Museum early in 1964. His publications, apart from contributions to learned journals, include The Moa, a Study of the Dinornithiformes (1941), South Sea Folk (1937 and 1949); Sculpture and Design, an Outline of Maori Art (1955); and Whaowhia: Maori art and its artists (1977).[2]
He was appointed an Officer of the Order of the British Empire in 1919, for services in connection with military operations in France and Flanders,[3] and promoted to Commander of the Order of the British Empire in the 1958 Queen's Birthday Honours.[4] In 1935, he was awarded the King George V Silver Jubilee Medal.[5] He was appointed a Knight Bachelor in the 1963 Queen's Birthday Honours.[6]
- ^ a b c d Morton, John. "Archey, Gilbert Edward". Dictionary of New Zealand Biography. Ministry for Culture and Heritage. Retrieved 5 July 2013.
- ^ R. M. S. Taylor, "Obituary: Gilbert Edward Archey (C.B.E., D.Sc., F.R.S.N.Z.) 1890-1974" in Journal of the Polynesian Society, pp. 336-340. Retrieved 2010-02-05.
- ^ "No. 31684". The London Gazette (Supplement). 26 May 1953. p. 15457.
- ^ "No. 41406". The London Gazette (Supplement). 12 June 1958. pp. 3553–3555.
- ^ "Official jubilee medals". Evening Post. 6 May 1935. p. 4. Retrieved 2 July 2013.
- ^ "No. 43012". The London Gazette (Supplement). 5 June 1963. pp. 4831–4833.
- 1890 births
- 1974 deaths
- English emigrants to New Zealand
- New Zealand ethnologists
- New Zealand zoologists
- University of Canterbury alumni
- New Zealand Commanders of the Order of the British Empire
- Presidents of the Royal Society of New Zealand
- New Zealand military personnel of World War I
- Nelson College faculty
- New Zealand Army officers
- New Zealand Knights Bachelor
- 20th-century New Zealand scientists


text:
Cremation Urns for Human ashes – Funeral Urn Keepsake box for Pets – Memorial Gift for home or Columbarium If Love could have save you would have lived forever by DaySpring Premier (Ivory)
Our customers appreciate the attention to detail and elegant look of this cremation urn for ashes designed to last for generations. The wood provides a warm look that accents any décor. This urn will hold the ashes of a loved one of approx 17 cubic inches. Access the bottom of the urn by simply unscrewing
(as of 6:19 am UTC - Details) + Add To Shopping List


text:
Η Gameloft ανακοίνωσε την σύναψη συνεργασίας με την Capcom με σκοπό να μεταφέρει τους δημοφιλής της τίτλους στο iPhone! Οι πρώτοι 6 τίτλοι οι οποίοι θα διατεθούν από την Gameloft μέσω του App store (μέσα στο 2010) είναι:
Resident Evil
Street Fighter Alpha
Super Puzzle Fighter II Turbo
Lost Planet 2
Dead Rising 2
Where's Wally 2
Ακολουθεί το δελτίο τύπου της Gameloft:
November 23rd, 2009
Paris – Gameloft®, a leading publisher and developer of downloadable video games, today announced a deal with Capcom Mobile™ to publish six upcoming mobile titles: Resident Evil®: Uprising, Street Fighter® Alpha, Super Puzzle Fighter™ II Turbo, Lost Planet™ 2, Dead Rising™ 2 and Where's Wally 2. The highly anticipated mobile games will become available to a wider consumer base in Europe, The Middle East, and Africa through Gameloft's extensive distribution channels. This is the first partnership between Gameloft and Capcom®.
With a network of over 180 carriers' worldwide across 80 countries, Gameloft has the resources, tools and know-how to distribute Capcom's games to a broad base of consumers in Europe.
"At Gameloft we have pretty high standards when it comes to game development and distribution," said Gonzague de Vallois, senior vice president of publishing, Gameloft. "These are great titles coming from Capcom and we are very excited to partner with them to bring these games to all consumers using different distribution channels and marketing resources."
"Gameloft has tremendous strength with its massive distribution network in Europe," said Matt Gillis, executive vice president of publishing, Capcom Mobile. "The company has continually proven to excel at publishing the best games for all types of audiences and we are fully confident that this partnership will not only benefit both parties involved, but most importantly the end user."
The mobile games are scheduled for release in 2010.
About Gameloft
Gameloft is a leading international publisher and developer of downloadable video games. For 10 years, Gameloft has been established as one of the top innovators in its field. The company creates games for mobile phones, smartphones, iPhone and iPod touch. The total number of game-enabled devices is anticipated to exceed four billion units by 2012. Gameloft games are also available to players on WiiWare, DSiWare, Microsoft Xbox LIVE Arcade and PlayStation®Network.
Partnership agreements with leading licenses such as UNO™, Ferrari, Shrek, CSI, Spider-Man and Brothers in Arms allow Gameloft to form strong relationships with international brands. In addition to the partnerships, Gameloft owns and operates titles such as Real Football, Asphalt and Brain Challenge. Gameloft is present on all the continents with its own production studios, employing over 3,500 developers, and distributes its games in over 100 countries. Gameloft is listed on Euronext Paris (ISIN: FR0000079600, Bloomberg: GFT FP, Reuters: GLFT.PA)
About Capcom
Capcom is a leading worldwide developer, publisher and distributor of interactive entertainment. Founded in 1983, the company has created world-renowned franchises including Resident Evil®, Street Fighter®, Mega Man®, Breath of Fire®, Devil May Cry® and the Onimusha® series. Headquartered in Osaka, Japan the company maintains operations in the U.S., The United Kingdom, Germany, Tokyo, Korea and Hong Kong. More information about Capcom and its products can be found on the company's web site at www.capcom.com
Συζήτηση στο forum: Gameloft partners with Capcom
[via gameloft.com]
About Vasilis Ananiadis
Ο ζωντανός θρύλος της Ελληνικής blogόσφαιρας, ο αβυσσαλέος master του SEO, o πρίγκηπας των Social Media, ο τυφώνας των Web Startups, ο οργασμός της ιντερνετικής επιτυχίας. Τώρα και στο twitter: @vananiadis
Tags: iPhone


text:
Sold Out
Ever had a hard time picking out an out fit? What if you could wear the best of two. With two great patterns combined it allows the bow to suit your male as a bow tie and your female as a side bow. These classic styles combined to create a new look that says I'm worth both. Your cat won't be blue, wearing blue. The look is bold and fun.
Collar size: 20cm to 29cm, width: 10mm.
About the Cat Collar & Bow Tie Set
Collar size: 20cm to 29cm (8-11"), width: 10mm (0.4").
Luxurious in Blue. Great ideas dont happen overnight. The first recorded collar appearance was in Ancient Egypt, 1500BC. The first recorded...
Ready for adventure! The Polka Bow Tie and Collar Set is pure delight, resilient, comfortable, and made for adventure. My...
Have your dog strut in style on those daily walks! The Didgeridoo Bow Tie and Collar Set, adds a fun,...


text:
Unique New Orleans Convention Center HotelA restored property housed in a historic landmark building, the Hampton Inn & Suites New Orleans Convention Center provides unique, luxurious accommodations in an ideal location. Set amid the vibrant Arts & Warehouse District, across from the Ernest N. Morial Convention Center, our upscale New Orleans hotel is the perfect home base for business travelers. It's also situated near popular leisure attractions, including Riverwalk Market Place, Louisiana Children's Museum, National World War II Museum, Riverboat Cruises and the Mercedes-Benz Superdome. With spacious, beautifully-appointed rooms, free Wi-Fi, a hot daily breakfast, premium amenities and good, old-fashioned Southern hospitality, our New Orleans Convention Center hotel provides an unforgettable lodging experience in one of the world's most unforgettable destinations.
Don't forget to visit our Warehouse Bar, located in the lobby, during your stay. The historic and laid back atmosphere is a great place to unwind after a long day and to gather with friends to enjoy a few cocktails before hitting the town. Not to mention all guest 21+ will receive a buy one, get one free drink coupon at check-in! The Warehouse Bar is open daily from 5-11 pm.


text:
Littlefoot's Adventures of Robin Hood is another Land Before Time crossover film planned to be re-edited by yru17. It is unknown when the film will be shown on YouTube.
Littlefoot and his friends (along with Stan, Mikey, Scooby-Doo, and their friends) have time-traveled to Nottingham, England and met the Greatest Legendary Hero ever: Robin Hood. Together, they rob from the rich to feed the poor and save England from an evil lion named Prince John, whom Oogie Boogie, Carface, Killer, Lord Rothbart, Bowser, Mistress Nine, Bowser Jr., Pete, Ursula, The Machine, and The Grand Duke of Owls work for.
- Stan Marsh, Kyle Broflovski, Eric Cartman, Kenny McCormick, The Goonies (Mikey Walsh, Brand Walsh, Mouth Devereaux, Data Wang, Chunk Cohen, Andy Carmichael, Stef Steinbrenner, and Sloth Fratelli), Zazu, Scooby-Doo, Shaggy Rogers, Fred Jones, Daphne Blake, Velma Dinkley, Genie, Jesse Greenwood, Elvis, Randolph Johnson, Nadine, Mickey Mouse, Donald Duck, Goofy, Charlie Barkin, Itchy Itchiford, Princess Odette, Prince Derek, Jean-Bob, Speed, Puffin, Rex, Woog, Elsa, Dweeb, Aladar, Neera, Plio, Yar, Zini, Suri, Baylene, Eema, Url, Chanticleer, Sebastian, King Louie, Fu Dog, Kenai, Koda, Rutt and Tuke, Roger Rabbit, Jack Skellington, Oogie Boogie, Carface, Killer, Lord Rothbart, Bowser, Mistress Nine, Bowser Jr., Pete, Ursula, The Machine, and The Grand Duke of Owls guest star in this film.
- This film marks the first debut of Mr. Thicknose.
- Unlike Disneydaniel93's film Pooh's Adventures of Robin Hood, this is an NTSC film with NTSC bits from The Land Before Time movies, South Park: Bigger, Longer & Uncut, The Goonies, The Lion King 1 and 2, the Scooby-Doo movies, the Aladdin movies, Free Willy 1-3, Mickey, Donald, Goofy: The Three Musketeers, A Goofy Movie, An Extremely Goofy Movie, the All Dogs Go to Heaven movies, The Swan Princess movies, We're Back! A Dinosaur's Story, Dinosaur, Rock-A-Doodle, The Little Mermaid movies, The Jungle Book 1 and 2, Brother Bear 1 and 2, Who Framed Roger Rabbit, and The Nightmare Before Christmas.
- Don Bluth (the director of The Land Before Time, All Dogs Go to Heaven, and Rock-a-Doodle) was one of the animators on Robin Hood.
- Robin Hood had another home video release in 1994, the same year that The Land Before Time II: The Great Valley Adventure and The Return of Jafar were released straight to video, The Swan Princess was released in theaters, and the film-based animated TV series Free Willy aired on ABC Saturday Mornings.
- Aladdin, Princess Jasmine, Abu, and Genie were originally planned to guest star in this film, but DisneyMovieLover103 already made Robin Hood's Adventures of Aladdin and the idea was dropped. However, Yru17 only wanted to use Genie for this film and the four reasons for Genie to guest star in it are to have this film take place after Robin Hood's Adventures of Aladdin (making Genie an old friend of Robin Hood and Little John from that film onwards), Simba, Timon, and Pumbaa's Adventures of Robin Hood was made before Genie became a member of the Jungle Adventure Crew, Iago and Jafar were in SpongeBob and Friends Meet Robin Hood, and Yru17 thought it would be unfair for Genie not be able to guest star in a single Land Before Time crossover film with a 1970's Disney animated film.
- Like in Pooh's Adventures of Robin Hood and Yogi Bear's Adventures of Robin Hood, Littlefoot, Ducky, Petrie, Chomper, Guido, Kyle, Cartman, Mikey, Mouth, Data, Chunk, Zazu, Scooby-Doo, Shaggy, Genie, Jesse, Randolph, Mickey, Goofy, Odette, Jean-Bob, Speed, Puffin, Elsa, Dweeb, Charlie, Itchy, Aladar, Zini, Chanticleer, Sebastian, King Louie, Rutt, Tuke, Roger and Jack will team up with Robin Hood to steals a large amount of taxation money from Prince John's Bedroom while Cera, Spike, Ruby, Littlefoot's Grandparents, Stan, Kenny, Brand, Andy, Stef, Sloth, Fred, Daphne, Velma, Elvis, Nadine, Donald, Derek, Rex, Woog, Neera, Plio, Yar, Suri, Baylene, Eema, Url, Fu Dog, Kenai and Koda will team up with Little John to frees Friar Tuck and the other townsfolk, who all escape on a cart.


text:
In the last 90 days, 4 listings have been made available, which means leases most likley are going fast. You'll want to be prepared to make an offer immediately. There aren't many listings below 2,000 square feet posted, so finding a space for a small business might be tough.
The standard measurement for office space in this area is around sqft. Most buildings in this region are around 1 stories. Most buildings in this region were built in 2009 and are Class Class B.
Not much of the real estate is used for commercial space, so it might be hard to find office space. Health care is the dominant industry in this region. Commute by walking is the most popular way to get to work amongst Sarabay Acres residents. Commuting under 5 minutes a day is the norm for those who opt to reside in this part of town.
Trends and status of the commercial real estate market in Sarabay Acres.
Market Report
Real time and historical data on commercial real estate listings in Sarabay Acres.


text:
GraphicRiver A Rusted Grunge Textures Pack in 5 Colours 126163
Texture \ Industrial \ Grunge
YELLOW \ Grunge \ Photoshop \ Resolution \ Edited \ ORANGE \ Colours \ Containing
Texture - A Rusted Grunge Textures Pack in 5 Colours 126163 by melaniap @ GraphicRiver
Texture \ Industrial \ Grunge
This is a pack containing 5 colors of a rusted grunge texture,
with a very wornout look.
Shots taken witha Canon Eos 500, then edited in photoshop cs4.
Resolution 1800×1200
Colours: BLUE , PINK, YELLOW , ORANGE, LIGHT YELLOW
Layered: No; Graphics Files Included: JPG Image; Pixel Dimensions: 1800x1200.
Page Corner Buttons Plus Two Borders; Black Vintage phone 2#; Vintage Floral backgrounds in 7 colors 2448x3264; Embroidered Silky Fabric Backgrounds Three Colors; Black Vintage Phone.
Keywords: blue, blue, grunge, orange, pink, rust, yellow.


text:
Platinum Stinger Lo
Platinum Stinger Lo
Made in Australia, the EMU Australia Platinum Stinger Lo is a handcrafted, water resistant, double face sheepskin boot.
Product Variations
Please consultSize Chart
Product Actions
Made in Australia
Water resistant Australian double face sheepskin
Sheepskin breathes and keeps your feet perfectly warm in winter and cool in summer
Removable anatomically correct sheepskin lined in sole
Reinforced suede heel cup for better fit and support
Soft EVA midsole for comfort and support
Durable, hardwearing and flexible rubber outsole
Superior double stitched seams for added strength
Product Description
A truly iconic style, our famously comfortable Platinum Stinger Lo surrounds your feet with the natural fibres of double-face sheepskin delivering a warm, soft and durable fit. Technically advanced, they are water resistant and feature a removable anatomically correct sheepskin lined insole, moulded heel cup and a dual layered EVA and rubber outsole for unmatched comfort.
Platinum Stinger Lo is rated out of 5 by 55.
Rated 5 out of 5 by Nini from warm and cosy These are my second pair or Emus. Bought my first pair in black 4 years ago and they are sill going. They are warm, cosy and better quality than the other well known brand. I too wanted a pair of genuine sheepskin boots and these do not disappoint. As other reviewers I usually wear a size 4/5 so always order a size 4. When you first wear them they feel tight, the sheepskin is really thick and this does flatten a little bit with wear. As with any other product if you look after them they last, I use weatherproof spray the night before wearing them and sheepskin refresher after wear and always put them back in the box when I am not wearing them. These boots are worth every penny for the comfort and warmth factor alone.
Date published: 2015-10-31
Rated 1 out of 5 by Krystald from Terrible quality Straight from the box they look worse then the pair I've had the last 5 years. I swore by Emu, the quality has always been superior to the other brand. Until this pair. I always buy the stinger lo in a size 9. That is what I initially bought, but had to return at my expense because they were TINY. I now have a size 10 and they fit but the quality is horrendous. I have other pairs at home that I've abused that look better then these. I regret now regret this purchase but am forced to keep this as I will be charged at my expense again to return. :(
Date published: 2016-12-30
Rated 5 out of 5 by JJsMom from Platinum Stinger Lo's are the bees knees! I bought this boots a little over a month ago and have worn them everyday day since. They are incredibly comfortable, warm, and well made. The reason I went with Emu Australia as opposed to another brand, is that Emu offered a selection of footwear that are handcrafted in Australia as opposed to an assembly line in China. That was something that was really important to me. Emu Australia was the best option I found for what I was looking for. You now have a customer for life!
Date published: 2015-02-05
Rated 5 out of 5 by xime612 from Beautiful sheepskin I bought these because I wanted the real thing, sheepskin boots made in either Australia or new Zealand and they did not disappoint me. I love everything about these boots, both the quality of the sheepskin as well as the beautiful shade of grey. My only caveat is that the inner sole is a bit too thin but its an issue easily solved. Also, I bought a size too small because I am between sizes and even though they stretch naturally I will definitely order a size up next time.
Date published: 2015-01-27
Rated 4 out of 5 by Jordan Navarro from Wife loves them I ordered the platinum stinger lo in the chestnut brown color. Shipping was quick only took 3 days which was nice since they were a Christmas gift. This was the first time ordering expensive items online especially since I was not familiar with this brand. However when my wife opened them on Christmas Day she was so happy. She loves her boots. She hasn't had any boot like it before. The only concern I have is that it looks like the wool is trying to come out of the seams. Idk if that's how it's supposed to be or not. And online it says they are supposed to be water resistant? But when my wife spilt some tea on them it didn't roll off the boot just soaked in so now there are some tea stains on the boots that I'm not sure how to get out. Other than that she loves them and would purchase some for my daughters soon.
Date published: 2015-02-06
Rated 5 out of 5 by celticlass1888 from Love my Emu's black boots :) I finally caved and decided to spend the money and buy the black Emu's as I have had a pair of the dark brown ones for over 4 years that I still get a good wear out of lol...I knew I wanted to get a black pair as my boots and shoes normally last a couple years and I am so glad I got them as they are perfect here in Toronto,Canada with our winter so far being in -20's for temperatures and my new Emu's keep my feet so very warm and even wore them in the snow and they were great :). I am very happy with my boots. I bought a size 5 cause I am normally a 5.5 to 6 and my last pair was 6 and too big but I find these ones fit different from my last pair but it being over a few years I understand why. I think if I had gotten a size 6 it would have been too big like my last ones and there are no half sizes. Thank you Emu for your good quality boots from this wee Canadian lass. Kindest regards, Claire :)
Date published: 2015-02-21
Rated 2 out of 5 by Kyle from Incosistant Sizing Bought these for a christmas present for the girlfriend. She has the same pair but they are a few years old. Her old ones are size 9, so I got her size 9. They are significantly smaller than the old pair. I understand that they may feel tighter due to being new, and might need some time to stretch out and be comfortable, this is beyond that. I had to send them back to Emu for an exchange for a size 10 (at my expense) and as of December 22 I have not received the new boots. It is unlikely that she will get them in time for Christmas, and I am disappointed with Emu's quality control/sizing consistencies.
Date published: 2016-12-22
Rated 5 out of 5 by Gale from Awesome boots! Like another reviewer I bought these because they use authentic sheepskin and are made in Australia. They have not disappointed. They are great quality and so good looking! The sheepskin keeps my feet warm on these cold winter days. I usually wear a 7 and a half but bought a 7. So glad I did. They are actually a bit big and slide a bit but not so much as to be uncomfortable. I bought the black this time but am seriously considering getting another color. Love them!
Date published: 2015-02-06


text:
Bordermate features
Bordermax by Bordermate
Which includes a
Full 2 year warranty
"Curbing is a ONE time investment that will Provide beauty and ease of use for many years and last as long as your home"
Our curbing is 100% reinforced concrete. Our edging will not move, shift, rot, crumble, warp or fail. Pick from over 30 colors and numerous designs. Even design your own!
Call for our Free no obligation estimate!
Bordermate curbing is custom designed on site according to the requests and needs of the customer.
Our Curbing is extruded onsite in one continuous piece allowing the customer greater design flexiblility. Bordermate curbing can follow the contour of most shapes and sizes that the customer requests.
Our concrete curbing has several features, advantages and benefits that you should consider: A continuous concrete root barrier keeps lawns in check. Concrete is durable. It won't rot, shatter, splinter, etc.
Maintenance is simple. Lawn mower wheels fit easily on the leading edge. Clean up with an edger or trimmer without damaging the edging.
Beautifies your yard placing a picture-perfect frame around your flowerbeds.
Design flexibility allows for straight lines, curves, turns and contours.
Fast, clean and efficient installation without the problems associated with costly form work.
Save hours of edging, trimming and weeding time.
Less expensive. Higher quality.
If you want Curb Appeal with service satisfaction, Call Bordermate
Free no obligation estimate!


text:
A great product from Crayola and does the job. I didn't know they made these and my grandson was with me shopping and saw them. He had to have them because 2 of his favorite colors were in the package. I keep another brand here for him, so he took these home to use. He loves these also.
Love this product.My 4 year old girl has learned to floss using them. She loves the colours and has learned the importance of flossing.
These flossers are perfect for little hands. Great for flossing between each teeth with ease. Kids like the fun colours that invite them to floss daily. Works without any problems and can easily be used by kids which is a plus. Much easier than regular floss.
These reviews are the subjective opinions of ChickAdvisor members and not of ChickAdvisor Inc.