text:
|Service channel over the Ethernet inter-frame gap
|December, 2003
|Leroux et al.
|DSL modems with analog voice band support
|March, 2008
|Router and network connecting method
|November, 2006
|Suzuki et al.
|January, 2010
|Viswanath et al.
|Systems and Methods for Bridging a WAN Accelerator with a Security Gateway
|March, 2009
|Chadda et al.
|IP video terminal with function for controlling video transmission/reception bandwidth and image quality and control method thereof
|May, 2005
|Method and system supporting real-time fail-over of network switches
|March, 2005
|Masuyama et al.
|Automatic route configuration in hierarchical wireless mesh networks
|September, 2006
|Castagnoli et al.
|Method of formatting and encoding uplink short length data in a wireless communication system
|March, 2006
|Kim et al.
|April, 2008
|May, 2009
|Boomer et al.
The is a divisional of U.S. application Ser. No. 09/952,808, filed Sep. 13, 2001, titled "Universal Naming Scheme for Peer to Peer Resources", which claims the benefit of U.S. provisional Application No. 60/252,658, titled "A Locator and Tracking Service for Peer to Peer Resources", filed Nov. 22, 2000, and also claims the benefit of U.S. Provisional Application No. 60/252,659, filed Nov. 22, 2000, titled "A Universal Naming Scheme for Peer-to-Peer Resources", all of which are hereby incorporated herein by this reference.
This application is related to U.S. application Ser. No. 09/952,652, filed on Sep. 13, 2001, titled "Locator and Tracking Service for Peer to Peer Networks".
This application is related to U.S. application Ser. No. 09/952,367, filed on Sep. 13, 2001, titled "Resource Coherency among Resources Cached in a Peer to Peer Environment".
This application is related to U.S. application Ser. No. ______, filed on Feb. 11, 2005, titled "Locator and Tracking Service for Peer-to-Peer Resources" (Attorney Docket No. 302373.10).
This application is related to U.S. application Ser. No. ______, filed on Feb. 11, 2005, titled "Locator and Tracking Service for Peer-to-Peer Resources" (Attorney Docket No. 302373.11).
This application is related to U.S. application Ser. No. ______, filed on Feb. 25, 2005, titled "Universal Naming Scheme for Peer-to-Peer Resources" (Attorney Docket No. 302373.13).
This application is related to U.S. application Ser. No. ______, filed on Feb. 25, 2005, titled "Universal Naming Scheme for Peer-to-Peer Resources" (Attorney Docket No. 302373.14).
The present invention pertains to the field of networking. More particularly, this invention relates to peer-to-peer networking.
Data networks are based on "client-server" interactions. Servers provide, or serve, access to various network resources. Clients request access to the resources from the servers. An Internet Service Provider (ISP) is one example of a server. Clients request access to the Internet from the ISP and the ISP provides access. Once a client has access to the Internet through the ISP, the client may request access to a virtually endless variety of additional resources provided by millions of different servers on the Internet.
In a traditional client-server environment, resources are often concentrated in a relatively small number of centralized servers that service requests from a much larger number of clients. Concentrating resources on a few servers in this traditional approach has its drawbacks. For instance, the servers need to run on very fast machines that can process large volumes of client requests. A server machine and a network connection that can handle simultaneous transactions with thousands, or even millions, of clients is likely to be very expensive to purchase and maintain.
Furthermore, during times of exceptionally high network traffic, even the fastest centralized servers can become bottlenecks in the network. For instance, as a nationwide news story breaks, the amount of time it takes to access the latest updates at most news websites tends to increase dramatically due to the increased network traffic. Moreover, if one of these large-scale centralized machines fails for any reason, millions of clients will be denied access to the desired resource. This vulnerability makes centralized servers prime targets for hackers and cyber-terrorists.
A less traditional approach to networking is based on peer-to-peer interactions. In a peer-to-peer environment, transactions take place between end-user, or peer, machines. Each peer can be both a consumer and a provider of resources. That is, a peer can act like a traditional client by requesting access to a resource stored elsewhere, and the same peer can also act like a traditional server by responding to a request for a resource stored at the peer.
Peer-to-peer networking theoretically has a number of advantages over the traditional approach. Rather than funneling huge volumes of client transactions to centralized servers, multiple peers can work together to replace entire servers. For instance, if a resource is copied and cached on many peer machines, a request for the resource can be serviced by any one of the peers, or even by several of these peers at the same time, by having each of the multiple peers only serve a portion of the resource, in order to maximize the aggregate download bandwidth for the resource. By spreading resources out over multiple peers, bottlenecks at centralized servers can be reduced. Also, end-user peer machines tend to be comparatively inexpensive and are already present in most networking environments. Using the available, cumulative processing power and available bandwidth of peer machines can substantially decrease the overall cost of a network by reducing the number of expensive, centralized servers.
An additional benefit of a peer-to-peer networking approach is the frictionless publishing of content. Given that in a peer-to-peer system, every peer machine can be both a consumer and a publisher of information, publishing information in such a system can be as easy as creating a new file. This completely eliminates the friction involved with publishing content in a client-server environment (such as, for instance, the steps involved in publishing on a corporate Intranet portal), and thus encourages users to share more content with each other. This type of sharing is especially relevant in an Intranet context that is made up of "islands of information" (such as user desktops and laptops) that contain up-to-date, enterprise-critical information that is normally never shared by users.
Unfortunately, most traditional approaches to managing network traffic and resources do not conveniently accommodate peer-to-peer networking. For instance, locating servers on the World Wide Web relies on the Domain Name System (DNS). DNS is a well-established hierarchical scheme used for naming Internet hosts, or servers. DNS was designed to resolve host names to Internet Protocol (IP) addresses. That is, DNS resolves the host name part of URLs that are meaningful to humans, such as www.USnews.com, to IP addresses that are meaningful to Internet routers and switches, such as 184.108.40.206. The IP address and related host name of a given host machine are propagated to various DNS servers throughout the Internet so that client requests made using the host's name (such as requesting a URL containing that particular host name) are appropriately routed to the correct IP address. Propagating or updating this information can take a comparatively long period of time, on the order of several hours or even days.
DNS works well for locating network resources that are all available at one particular host, and for hosts that have relatively static IP addresses.
Peers, however, often have dynamically allocated IP addresses. That is, each time a peer logs onto the Internet, the peer is likely to have a different IP address. For instance, a corporate user may alternatively connect their laptop to the Internet from the office or from home, using two different IP addresses, none of which may be statically assigned (assuming both the enterprise and the ISP use Dynamic Host Configuration Protocol (DHCP) for assigning host addresses). It is not uncommon for the duration between peer log-ons to be shorter than the time period needed to propagate a new IP address through the DNS system. In which case, most of the time, it would not be possible or not reliable to find a peer by using its DNS host name.
Furthermore, a peer-to-peer resource that has been copied and cached may be simultaneously available at many locations. In a corporate Intranet environment, this could be the case for a marketing report that is accessed by several users. Caching resources is advantageous for a number of reasons. Firstly, it promotes availability of resources. For instance, if resources published from a laptop are systematically cached on an enterprise server, these resources will continue to be available after the publisher closes their laptop and leaves for the day. Secondly, caching allows resources to be kept. "closer" (in terms of network topology) to where they are used. For instance, in a geographically distributed enterprise it may be advantageous to cache "hot" documents in each office location, to provide better response times when accessing those documents.
As new versions of the resource are created however, old copies of the resource stored on other peers become outdated, and should be invalidated (i.e. not used any longer) as the new version propagates among the peers. This illustrates another shortcoming of DNS, its inability (due to a lack of a fine-enough granularity) to keep track of individual resources, and to track resources that can be available at multiple locations, locations having dynamically changing IP addresses, and locations that potentially store different versions of the same resource.
Furthermore, in the presence of multiple peer copies for the same resource, it is important to be able to select a small set of "best", or "closest", copies for a given request. This ability requires tracking of all equivalent peer locations that have an up-to-date copy of and can serve the cached resource.
Examples of the present invention are illustrated in the accompanying drawings. The accompanying drawings, however, do not limit the scope of the present invention. Similar references in the drawings indicate similar elements.
FIG. 1 illustrates one embodiment of a peer-to-peer realm.
FIG. 2 demonstrates one embodiment of locating a peer resource from the perspective of an RNS server.
FIG. 3 illustrates one embodiment of a peer.
FIG. 4 demonstrates one embodiment of locating a peer resource from the perspective of the peer platform shown in FIG. 3.
FIG. 5 demonstrates one embodiment of a cache coherency scheme.
FIG. 6 demonstrates one embodiment of resolving a peer resource address.
FIG. 7 illustrates one embodiment of a hardware system to perform the present invention.
FIG. 8 illustrates one embodiment of a machine readable storage medium to store machine readable instructions of the present invention.
In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. However, those skilled in the art will understand that the present invention may be practiced without these specific details, that the present invention is not limited to the depicted embodiments, and that the present invention may be practiced in a variety of alternate embodiments. In other instances, well known methods, procedures, components, and circuits have not been described in detail.
Parts of the description will be presented using terminology commonly employed by those skilled in the art to convey the substance of their work to others skilled in the art. Also, parts of the description will be presented in terms of operations performed through the execution of programming instructions. As well understood by those skilled in the art, these operations often take the form of electrical, magnetic, or optical signals capable of being stored, transferred, combined, and otherwise manipulated through, for instance, electrical components.
Various operations will be described as multiple discrete steps performed in turn in a manner that is helpful in understanding the present invention. However, the order of description should not be construed as to imply that these operations are necessarily performed in the order they are presented, or even order dependent. Lastly, repeated usage of the phrase "in one embodiment" does not necessarily refer to the same embodiment, although it may.
A number of inventions are described below with respect to a Resource Naming Service (RNS) that is used to track and locate resources among peers in a peer-to-peer networking environment. RNS relies on a resource naming scheme that uniquely identifies peer resources no matter where among the peers the resources may currently be available. RNS overcomes the inadequacies of existing networking schemes, such as the Domain Name System (DNS) based naming, making it possible to take full advantage of the power of peer-to-peer networking.
FIG. 1 illustrates one embodiment of the inventive peer-to-peer network. In the illustrated embodiment, peer-to-peer realm 150 (hereafter simply called "realm") includes registrar 110, gate server 120, a number of RNS servers 130, and a number of peers 140. Peers 140 store, or otherwise make available, peer resources (not shown). Registrar 110, RNS servers 130, and gate server 120 together provide a locator and access service for tracking, locating, and accessing the peer resources published in the realm. While one each of the registrar and gate server, and several RNS servers and peers are shown in FIG. 1, the present invention may be practiced with any number of these elements.
To participate in the realm, each peer 140 first registers with registrar 110. As part of the registration process, registrar 110 assigns each peer an identifier that is unique within realm 150, and also assigns each peer to a particular RNS server 130, hereafter called the "home RNS server" for that peer. The unique identifier for a given peer 140 is used to identify peer resources within realm 150 that are under the control of, or published by, the peer.
Any number of approaches can be used to register peers 140 with registrar 110. In one embodiment, peers 140 may use a Web-based registration process to obtain and register an identity with registrar 110. Registration may comprise a series of interactions between a peer 140 and registrar 110 to convey a user's identity, encryption keys for secure communications among elements within realm 150, billing information for access various peer resources, downloading and installing software to enable the peer 140 to be compatible with its assigned RNS server, and the like.
Any number of approaches can also be used by registrar 110 to select a home RNS servers for a particular peer 140. In one embodiment, registrar 110 identifies the type, or version, of software that the peer 140 is using, and generates a list of RNS server 130 that are compatible with that software and that are estimated by registrar 110 to be "close" to the registering peer 140 in terms of network topology. Then, registrar 110 provides this list of candidate RNS servers to the peer 140 so that the peer 140 can test the network paths to each listed RNS server and identify one or more that have the best response times. That is, depending on network topology, the peer 140 is likely to be "closer" to some RNS servers than others, either by physical distance or by the speed of the network medium. In one embodiment, the peer's selection is returned to registrar 110 merely as a suggestion. That is, registrar 110 may or may not assign the peer 140 to the RNS server 130 that the peer selected depending on factors such as the relative network traffic loads among the list of candidate RNS servers. In which case, registrar 110 may only assign the suggested RNS server to be the home RNS server for the peer 140 if the suggested RNS server's relative network traffic load is below a particular level. Otherwise, the registrar may assign a different RNS server having, for instance, a lowest relative network traffic load among the candidate RNS servers.
Registrar 110 can also register new RNS servers in realm 150 using many of the same techniques and reassign selected peers 140 to be homed at the new RNS server. That is, in one embodiment, registrar 110 assigns a unique identifier for the RNS server, identifies a set of compatible peers 140, allows the new RNS server to suggest a set of preferred peers, and then selects a set of peers to be homed at the new RNS server based on the suggestion as well as other factors. In alternate embodiments, any number of techniques can be used to register new RNS servers and assign peers. For instance, the new RNS server may simply be allowed to accumulate new peers over time as new peers register with registrar 110.
Each RNS server 130 tracks the current network location (in terms of IP addresses and IP port numbers) and status (on- or off-line) of all peers assigned to that RNS server, as well as the locations and availability of resources among its assigned peers.
In general, accessing a resource is a two step process. First, the resource must be located using the locator service. Second, the resource is actually accessed at the location or set of locations returned by the locator service.
For a peer 140 within realm 150, the first step in accessing a peer resource involves communicating with the peer's assigned home RNS server 130. The home RNS server 130, possibly in cooperation with registrar 110 and another RNS server 130, determines one or more locations within realm 150 where the resource is expected to be available. In one embodiment, the set of locations returned by the home RNS server 130 to the requesting peer 140 may depend on the current network identity (in particular, the current IP address or IP addresses) of peer 140, on the current traffic load on the realm, as well as on other parameters that are known to the RNS servers 130. It is up to the peer 140 to take the second step to actually access the resource at the provided location(s). Once a peer has accessed a resource, it has the option to cache the resource, inform its home RNS server that it is now caching the resource, and make the cached resource available for other peers to access.
Client devices are considered to be outside realm 150 if they have not been endowed with the teachings of the current invention, or if they have not been registered with the registrar 110 of this realm 150. Such devices may be able to access information from the current realm 150, but will usually not be able to publish information in this realm.
For a client device outside realm 150, external network traffic 125 is directed to realm 150 through gate server 120. Gate server 120, possibly in cooperation with registrar 110 and one or more RNS servers 130, determines one or more peer locations 140 within realm 150 where the resource is expected to be available, in accordance to the resource location process described above. Depending on whether the client device is compatible with the peer(s) hosting the resource, gate server 120 may simply respond with the location(s) and allow the client device to directly access the resource on its own. If the client device is not compatible, gate server 120 may take any number of actions, such as accessing the resource on behalf of the client device and responding as if the gate server were the resource.
As used herein, each resource is primarily associated with one peer, referred to as the master publisher, and may also be available at additional peers, referred to as the caching publishers. Usually, only a master publisher has the authority to publish, modify, or delete a resource.
The locating service presumes a resource addressing scheme that uniquely identifies the master publisher of a resource in the resource address and includes a relative path for the resource with respect to the master publisher. The addressing scheme is unique, however, in that an address does not necessarily direct a request to the master publisher itself, but instead to a resource locating service corresponding to the master publisher.
Using this "diverted" addressing scheme, the locating service can direct a request to the master publisher as well as to any number of caching publishers. Even if the master publisher of the resource is not on-line, has crashed, is overwhelmed with other traffic, or is otherwise not immediately available, the resource may still be persistently available from a caching publisher. With potentially many peers caching resources, or with dedicated peers proactively caching resources, the locator service can persistently and reliably service huge volumes of requests.
The locator service can also track resources stored by peers having dynamically changing addresses. For instance, in one embodiment, peers 140 include machines that use modems to connect to the network through an Internet Service Provider (ISP). Each time one of these peers connects to the Internet, the ISP assigns it a new IP address using, for instance, the Dynamic Host Configuration Protocol (DHCP). And, each time one of these peers connects, the peer contacts its home RNS server to let it know what its current IP address and port number are. The home RNS server can then update any records it has for the peer with the new location. Then, while it is logged on, the peer periodically "pings" its home RNS server to let the server know the peer is still logged on. When and if the pings stop, the home RNS server updates its records to show that the location has become inactive. In alternate embodiments, any number of approaches could be used to track the current locations and availability of transient and/or mobile peers.
FIG. 2 illustrates one embodiment of locating a resource in more detail. The illustrated embodiment is from the perspective of an RNS server, although a gate server may perform similar functions. FIG. 2 includes a number of implementation specific details. Other embodiments may not include all of the elements illustrated in FIG. 2, may perform elements in a different order, and may include additional elements.
First, the RNS server 130 receives, from a peer 140 or from the gate server 120, a resource request at 210 for the location of a particular resource. The request uniquely identifies a resource and a master publisher of the resource within the realm to which this RNS server belongs. The request can take any number of forms from a messaging protocol specific to this particular locator service to a universally accepted protocol such as HTTP.
At 220, the RNS server checks its own memory to determine if it has a resource record corresponding to the requested resource. In one embodiment, resource records comprise unique identifiers for resources and master publishers as well as one or more locations where the resources are expected to be located. The record may also indicate whether or not particular locations are expected to be active (logged into the network or not). In which case, the RNS server compares the unique identifier from the request to the list of recorded unique identifiers.
If the RNS server does have a matching record, the RNS server assumes that the record is current. If the record lists an active location for the resource, the RNS server responds in 230 with the resource status and a set of locations. The record may list zero or more active locations where the resource has been cached. If the record lists more than one active location for the resource, the RNS server may respond with multiple locations from which the requester can choose. For successive requests for the same resource, the RNS server may respond with different sets of locations, selecting sets of locations in, for instance, a round robin fashion, in order to balance the network traffic to multiple locations. In one embodiment, the RNS server may select the locations to be returned in 230 based on the requester's network (IP) address, in order to provide the requester with addresses that are "proximal" in terms of network topology, and thus optimize network traffic.
If the RNS server does not have a matching resource record, or if the RNS server has a matching resource record that does not actually list any active locations for the resource, the RNS server checks its memory to determine if it has a publisher record for the publisher of the requested resource in 240. In one embodiment, publisher records comprise unique identifiers for master publishers as well as an identifier for the home RNS server to which the master publisher was assigned. In which case, the RNS server compares the unique identifier from the request to the list of recorded publisher identifiers.
If the RNS server does have a matching publisher record, the RNS server assumes that the record is current and, in 250, determines whether or not the master publisher is local. That is, the RNS server determines whether or not it is the home RNS server for the master publisher.
If the master publisher is local, the RNS server obtains from the master publisher and caches (by creating an internal resource record) status information for the resource in 260 and provides the resource status information to the requester in 230. The status information could include whether or not the master publisher is currently active (logged in to the network or not) and whether or not the resource still exists. In order to determine whether or not a resource exists on an active master publisher, the RNS server queries the master publisher. If the master publisher indicates that the resource exists, the RNS server creates a record for the resource, including the location of the publisher, and caches the record so that subsequent requests for the resource can be satisfied without communicating again with the publisher.
The RNS server may know from its publisher record whether or not a local publisher is active. For instance, in one embodiment, local publishers log in to the RNS server each time they come on-line on the network, and then "ping" the RNS server on a regular basis to let the RNS server know the local publisher is still active. In alternate embodiments, any number of approaches can be used to determine whether a master publisher is active, including a query from the RNS server, a publisher logout procedure, and the like.
If a local publisher is determined to be inactive, the RNS server can update any records it has associated with that publisher. That is, any record for any resource that lists a particular publisher as a source can be updated to show that the publisher is not active. Of course, if the resource does not exist and/or the master publisher of the resource is inactive, the RNS server will return an appropriate error message in 230.
If, in 250, the master publisher is not a local publisher, but the RNS server discovered a publisher record in 240, the RNS server queries the remote RNS server (i.e. the assigned home RNS server for the master publisher) with an identifier of the master publisher and the resource to obtain and cache (by creating a resource record) the status information returned by the remote RNS server for the resource in 270. The remote RNS server may be able to immediately respond to the query based on its own memory records. For instance, the remote RNS server may have records including additional active locations where the resource is expected to be available. If the remote RNS server does not have a record of any active locations for the resource, the remote RNS server may be able to query the master publisher if the master publisher is currently active. Based on the response from the remote RNS server, the local RNS server provides a response in 230. Again, if the resource does not appear to exist, or if the resource is not currently available, the RNS server will respond accordingly. Also, the local RNS server will cache whatever it learns from the remote RNS so that future requests for the resource can be serviced without resorting to the remote RNS. In one embodiment, caching information about resources published by master publishers homed at a remote RNS server can be implemented on a leasing basis, i.e. the cached information can be assumed to be valid for a specified time after it was obtained from the remote RNS server; additional requests for cached information during that time can then be serviced without contacting the remote RNS server.
If, back in 240, the RNS server determines that it does not have a publisher record for the resource, the RNS server in 290 determines if the master publisher is a local publisher (i.e. if this is the home RNS for the master publisher). If the master publisher is homed at this RNS server, the algorithm continues to respond to the request at block 260 as described above.
If at block 290 it is determined that the master publisher is not homed at this RNS server, the RNS server resorts to the registrar 110 in 280. The registrar 110 keeps records of each registered peer and the RNS server to which each peer is assigned or homed at. From the registrar, the RNS server learns whether or not the publisher is registered, and, if so, to what RNS server the publisher has been assigned. Again, the RNS server caches (by creating a publisher record) the information to avoid contacting the registrar for future requests directed to the same master publisher.
Of course, if at 295 the publisher is not registered, there is no remote RNS server to contact in 270, and the local RNS server will return the appropriate message in 230. If, however, the publisher is registered, the RNS server proceeds to contact the remote RNS server in 270 as described above, and to respond to the request in block 230 accordingly.
As mentioned above, one embodiment of an RNS server tracks whether or not peers homed at the RNS server are on- or off-line. The availability of peers can be tracked as part of the publisher records. For instance, a publisher record may be of the form:
unique peer identifier: status/current IP address(es)/current port number(s)
In the illustrated embodiment, each time a peer logs in to its home RNS server, the RNS server updates the peer's record to indicate that the peer's status is on-line and records the peer's current IP address(es) and port number(s). When the peer is determined to have logged out, the RNS server again updates the peer's record to indicate that the peer's status is off-line.
In alternate embodiments, an RNS server also tracks the status of peers homed at other RNS servers. For instance, status information for a remote RNS server can be cached along with current location information on a leasing basis, such that the status information is presumed valid for a certain period of time.
By tracking the status of peers, an RNS server can persistently maintain resource records as the locations of peers change as, for instance, peers logout and log back in with a new IP addresses.
For example, a resource record entry may be of the form:
unique resource identifier: master publisher identifier;
When the RNS server receives a request for the resource, the RNS server identifies the corresponding resource record entry based on the unique resource identifier and selects a set of publisher identifiers from among those listed. Then, the RNS server consults the publisher records to determine the current status of the corresponding publishers and returns the current IP addresses and port numbers for each selected publisher who's status indicates that it is on-line.
In another embodiment, a resource record entry is of the form:
unique resource identifier: IP1, port1; IP2, port2; IP3, port3; . . . .
In this example, rather than listing the unique identifiers of the publishers of the resource, the resource record lists actual network locations for the resource. In which case, when the RNS server receives a request for the resource, the RNS server selects from among the listed locations and returns the selected locations without the intermediate step of consulting the publisher records to determine which of the selected locations are expected to be on-line. In order to maintain current locations for the publishers as their network locations change, the RNS server scans through the resource records and flags locations corresponding to publishers that are determined to be off-line. When the publishers log back in, the RNS server again scans through the resource records, removes the flags, and replaces the old locations with the current locations.
Of course, RNS servers can organize and utilize records in any number of embodiments. For instance, the resource records and the publisher records may comprise one single list instead of two separate lists. Alternately, publisher records could be further divided into a list of peers assigned to the RNS server plus a separate list of peers assigned to other RNS servers. And, of course, a corresponding variety of mechanisms and approaches can be used to track the current status of publishers and update publisher network locations.
FIG. 3 illustrates one embodiment of a peer 140 from FIG. 1 in more detail. Peer 140 includes peer platform 370, peer-to-peer application 345, Web browser 365, and two persistent structures, publication directory 380 and resource cache 385.
Peer-to-peer application 345 represents any of a variety of peer-to-peer applications or Web services such as a distributed gaming application where every participant runs a copy of the game software. Browser 365 represents any of a number of Web browsers, such as Netscape Navigator, Microsoft Internet Explorer, and the like. Persistent structures 380 and 385 represent any of a variety of persistent memory devices such as hard disks, flash memory, or the like, addressed and organized in any of a variety of fashions. Other embodiments of peer 140 may include additional elements, may have elements arranged differently, and may not include all of the illustrated elements.
Peer platform 370 intercepts and directs all peer-to-peer traffic 320 and resource locator traffic 310 for peer 140. Peer platform 370 includes resource locator interface 330 to interface directly with locator services, application programming interface (API) 340 to interface with peer-to-peer application 345, server 350 to serve peer-to-peer requests 320 (described more fully below), and proxy component 360 to interface with web browser 365 and with peer-to-peer application 345. In one embodiment, peer platform 370 runs as an application on peer 140, using the operating system services of peer 140 to perform input/output functions, etc. In one embodiment, peer platform 370 is embedded into the operating system or firmware of peer 140.
Referring to FIG. 3, peer platform 370 can "publish" peer resources by placing the resources, or a reference to these resources, in publication directory 380. In one embodiment, publishing can be accomplished by the user through an appropriate User Interface provided by platform 370 (not shown in FIG. 3). In one embodiment, publishing can be performed by peer-to-peer applications 345 by calling the appropriate function in the API 340 of platform 370.
Other devices can browse the contents published by peer 140 by requesting access to the top-level directory or directories published by this peer 140, just like any other resource. Such requests, coming into peer 140 as peer-to-peer traffic 320, may be the result of other users browsing for content, or may be sent at the request of the RNS server, for instance, after a crash as part of a data recovery operation.
FIG. 4 illustrates another embodiment of locating a resource in more detail, this time from the perspective of platform 370. A gate server may perform similar functions. Other embodiments may not include all of the elements illustrated in FIG. 4, may perform elements in a different order, and may include additional elements.
Referring now to FIG. 4, when peer 140 generates a request for a network or peer resource, either from peer-to-peer application 345 or Web browser 365, the proxy component 360 of platform 370 receives the request at block 410.
At block 420, the proxy component 360 checks whether this is a request for peer-to-peer content. If it is determined that the request is for a regular network resource published on the Web or on the Intranet, the proxy component 360 just acts as a pass-through for the request, sending the request to the specified Web server or chaining with any existing proxy used by, or specified for, peer 140, as necessary. In one embodiment, platform 370 makes this determination based on the format of the URL provided by peer 140. In another embodiment, platform 370 makes this determination dynamically, as will be explained later under "Dynamic Peer-to-peer Realm Identification." Assuming the request is a regular network resource, for instance having a URL including "www" for a World Wide Web page, the request is forwarded in 425 as regular network traffic 325.
If, however, the request is for a peer resource, for instance having a URL including "ppp" or "rns", the platform determines whether or not the addressed locator service is known in 430. That is, platform 370 may need certain contact information for contacting the locator service for the realm under which the peer resource has been published, which may or may not be the same realm under which peer 140 has been registered. For instance, platform 370 may need to know the IP address and IP port number for the locator service.
If the locator service is known, the request is directed in 440 as resource locator traffic 310 to the home RNS server 130 to which the peer 140 has been homed during the registration process, as described earlier. The home RNS server 130 then follows the steps earlier described in FIG. 2 to locate content published under its realm, or to contact the remote locator service to locate a remote peer resource.
If the locator service is not known, platform 370 first tries to obtain and cache the needed contact information in 435. In one embodiment, platform 370 sends a request for the contact information to the locator service as regular network traffic 325. The locator service's gate server 120 will receive and process the request. The request can simply contain the original peer resource address requested by peer 140. Alternately, platform 370 indicates in the request that it is a peer-to-peer platform and includes various kinds of information to enable the locator service to advantageously determine compatibility. If the gate service responds with the needed information, platform 370 can cache the information in cache 385 to avoid having to ask for the information again in the future; following this, platform 370 proceeds to forward the request to its home RNS server in 440, including the obtained contact information for the remote locator. If in 435 the locator service is determined not to exist or does not respond, platform 370 cannot forward the request in 440, but instead skips through 440 and 445 to return an appropriate error message in 450.
If the request was forwarded in 440, platform 370 waits in 445 for a response from its home RNS server and checks to see if one or more locations for the resource have been received. If no locations are received, platform 370 returns an appropriate error message in 450. If one or more locations are received, platform 370 selects one or more locations to try in 460. The request is then forwarded as peer-to-peer traffic 320 directly to the selected location or locations in 425. In one embodiment, if the location or locations selected by the client are not available or do not contain the resource, platform 370 could continue trying other locations that were returned in block 445 by the locator service. In one embodiment, if multiple locations are available and able to serve the resource, platform 370 may decide to stripe the fetching of the resource across multiple locations. Platform 370 may use any number of approaches to determine which location to try first. If a location proves to be non-responsive, platform 370 can select another location for the resource from those locations previously cached.
For types of resources that can be copied, once the resource has been successfully accessed, platform 370 has the option to cache a copy of a resource in its cache 385, and thus become a caching publisher for that resource. In which case, platform 370 will also inform its home RNS server via its resource locator interface 330 that it now has become a caching publisher for the resource. The home RNS server will then add the location of the peer to its list of locations for the resource. Future requests for the resource from this peer or from other peers can be directed by the home RNS server to this peer 140 and be serviced out of cache 385.
In addition to receiving requests from peer 140, platform 370 may also receive requests for the cached resource in the form of resource locator traffic 310 and/or peer-to-peer traffic 320. These requests can similarly be serviced out of cache 385.
In the embodiment illustrated in FIGS. 3 and 4, a separate protocol is used for peer-to-peer traffic 320 and regular network traffic 325, on the one hand, and for resource locator traffic 310, on the other. Since messages exchanged during resource location are of a more specific nature than regular network traffic 325 or peer-to-peer traffic 320, the protocol for the resource locator traffic 310 can be made more concise. For instance, rather than using a text-based protocol such as HTTP, the platform 370 could communicate with its home RNS server by using a more bandwidth-efficient binary encoding of messages. These bandwidth savings can be advantageously used to increase the number of peers 140 homed at the same RNS server 130. In alternate embodiments, a single protocol could be used for all types of traffic.
As mentioned above, gate server 120 from FIG. 1 performs some functions similar to those of RNS servers 130 described in FIG. 2 and peer platform 370 described in FIG. 3. That is, if gate server 120 receives a request for a peer resource in the form of a resource address, as peer platform 370 does, gate server 120 takes steps to convert the access to the resource to an appropriate peer-to-peer form.
For a compatible peer device that is requesting the resource, gate server 120 may provide contact information so that the peer's platform can directly send a peer request. In this case, gate server 120 can simply inform the requester that this is a request to a peer resource that requires the requester to contact its home RNS server. A compatible requester is one that will be able to interpret the response from the gate server, then use its home RNS server to resolve the resource location(s), and directly access the provided location(s).
For a non-compatible device, gate server 120 may itself convert the request to peer form and act as a proxy on behalf of the requesting device. In this case, gate server 120 first processes the request much like platform 370 does, and then takes the extra step of accessing the resource on behalf of the requester. That is, if the requester is requesting a copy of a file, the gate server can access a resource, download the file, and forward it to the requester. In this last respect, gate server 120 also performs some functions similar to peers 140 in that the gate server actually accesses the resource.
As discussed above, the RNS addressing scheme is an important part of the RNS locator service. In one embodiment, the RNS addressing scheme is entirely compatible with the URL scheme that is currently used for naming World Wide Web resources. That is, links between Web pages and peer-to-peer resources are possible, and the transition from one kind of resource to the other can be completely transparent to a user. For instance, a link in a web page has the same syntactic structure and can be de-referenced by an unmodified Web browser, irrespective of whether the link connects to a traditional Web page or a peer-to-peer resource.
This embodiment of the RNS addressing scheme uses a hierarchical naming scheme similar to Universal Resource Locators (URLs). For instance, like URLs, peer resource addresses can be of the following form:
<access protocol>://<realm>/<peer>/<path>
Examples of access protocols include hypertext transfer protocol (HTTP), hypertext transfer protocol over an SSL (Secure Socket Layer) connection (HTTPS), file transfer protocol (FTP), and the like. The realm corresponds to the peer-to-peer realm 150 under which the peer resource has been published, and is chosen to be identical to the DNS (Domain Name Service) host name of the gate server 120 of that realm 150. Thus realm names are unique in a networking environment just as domain names are unique.
Following the realm in the illustrated embodiment is the peer identifier. This corresponds to the peer identifier for the master publisher of a particular resource. As described earlier, peer identifiers are assigned by a registrar 110 to be unique within a realm 150.
Resources can be further organized into any number of levels of hierarchy based, for instance, on path names for resources within a peer.
In one embodiment, a peer-to-peer resource address conforms syntactically to a regular Web URL and cannot be distinguished from a Web URL by any syntactical conventions. Instead, a resource address is dynamically recognized as such when the address is de-referenced. This provides a great deal of flexibility in naming realms. For instance, as discussed above in the embodiment of FIG. 1, external network traffic 125 is received by gate server 120. Gate server 120 can resolve resource addresses and instruct the senders on how to query the resource locator, or gate server 120 can resolve resource addresses and access the resources on behalf of the senders.
FIG. 6 illustrates one embodiment of resolving a resource address from the perspective of a gate server.
At 610, the gate server receives a resource address as a regular Web URL.
At 620, if the requester is a compatible peer device, the gate server instructs the requester in 630 to use its own resource locator service to access the resource. In one embodiment, the gate server may be able to recognize that the requester is a peer device based on a special HTTP header included in the request by the requester. For instance, this can be a "Via" header that specifies the type of the requester as "compatible peer device". Alternately, the requester and the gate server may exchange additional messages to confirm compatibility. If the requester is a compatible peer device, the requester may cache the realm name to avoid sending resource addresses to the gate server in the future.
If the requester is not a peer device in 620, the gate server obtains the requested content and returns it to the requester in 640.
For resources that can be cached in multiple locations and that can change over time, cache coherency can be important. That is, if a resource is cached by multiple peers and then the master publisher updates the resource, it is important not to service requests using outdated cached data. "Coherent cache" means that valid cached copies of resources are equivalent to the master resource.
Depending on the type of resource, outdated data may or may not be a problem. For example, if the resource is an amateur "joke of the day" website, users may not care if cached data is a couple of days old. On the other hand, if the resource is stock ticker data on a day trader website, users will require fast updates. That is, higher priority data is likely to require more stringent cache coherency standards.
In order to account for multiple updates to a resource that maintains the same resource address, resource identifiers are used. A resource identifier for a given resource contains the resource address, as well as a resource version number. In one embodiment, resource identifiers are generated by platform 370, as follows: the resource address is generated as a combination of the realm under which the peer 140 has been registered, the peer's identifier, and the relative file system path of the published resource in the peer's publication directory 380; the resource version number is based on the last creation or modification time of that resource, as determined by peer-to-peer platform 370 by examining its publication directory 380.
Each time a master publisher creates or modifies a resource, the master publisher generates a new resource version number based on the date and time of the latest creation or modification of the resource.
In one embodiment, to ensure that resource version numbers are not influenced by variations in clock settings on peer machines, peers are synchronized to a central realm clock. Clock synchronization can be accomplished, for instance, when a peer machine comes on-line and informs its RNS server of the peer's current IP address. Furthermore, to ensure that clock drift on peer machines does not influence version numbering, peers can be re-synchronized to the central clock on a regular basis. In an alternate embodiment, version numbers can be generated sequentially by platform 370.
One approach to ensure highly coherent data is to enable only the master publisher to modify a resource and to require all requests to check the current resource identifier with the master publisher before each access. For instance, each time a resource is requested, the locator server queries the master publisher for the current version of the resource and returns the current version with a list of locations where the current version is expected to be found.
If a peer caches a resource and subsequently requests the resource again, even though a version of the resource is cached in the peer's own cache 385, the peer will not access the resource until the locator service returns the most recent version number and the peer has verified that its cached copy is the same version. If the version has changed, the requesting peer discards the obsolete version from its cache and accesses the new version of the resource from the list of sources supplied by the locator service.
If a peer 140 or the gate server 120 fetches a resource from a caching publisher, they can check to ensure that the version indication in the resource identifier matches the expected version that was returned as a result of a resource locator request. If the peer 140 sees a different version than expected, this may be due to the caching publisher caching an obsolete version of the resource. In this case, the peer 140 must try any other locations returned by the RNS server as a result of the locator request, or may elect to repeat the locator request altogether.
Proactively querying the master publisher can create a tremendous amount of data traffic for the master publisher. For instance, in a realm having millions of peers, if the master publisher for a resource is a desktop computer coupled to the network by a regular 56K modem, the master publisher could easily become a bottleneck for locator service traffic, even if locator service traffic uses a streamlined format.
A less problematic, yet somewhat lower level of coherency relies on the master publisher to report changes and/or modifications rather than proactively querying the master publisher for current versions. For instance, each time the master publisher publishes an updated version, the master publisher informs its home RNS server of the change. That is, the master publisher informs its home RNS server of the new resource identifier associated with the resource. If the RNS server has not received a notification from the master publisher, the RNS server assumes its current record for the requested resource is accurate. This was the case in the embodiment of FIG. 2.
The RNS server is likely to be running on a more robust machine, with a much higher bandwidth data connection for locator service traffic, than that of the master publisher. In which case, requests could be serviced by the RNS server prior to accessing a resource with a much lower likelihood of creating a bottleneck. Still, in a very large peer-to-peer realm, there is the possibility that a single home RNS server could become a bottleneck. Or, at the very least, this approach could consume a great deal of bandwidth that might better be spent elsewhere.
Rather than always requiring the verification of version numbers from a home RNS server or master publisher, another approach is to simply flush caches from time to time. If an RNS server currently has a record for a resource, the RNS server uses the record. If a peer has a cached copy of a resource, the peer uses the cached copy. The life span of a cached item can be adjusted based on the priority of the resource. Higher priority items can be flushed more often.
If authority to modify a resource is not limited to one master user, cache coherency is possible, but it can require a great deal more overhead. For instance, if a number of users cache a resource and collaboratively modify it, each new version created by each user could be broadcasted to all the other users, assuming the RNS servers tracked every location where the resource had been cached.
Any number of alternate approaches can be used for cache coherency, including combinations of the approaches described above. In certain embodiments, users have the option to select the level of cache coherency desired for various resources.
FIG. 5 illustrates one embodiment of a cache coherency scheme for a particular record from the perspective of an RNS server. In the illustrated embodiment, a peer homed at the RNS server has previously accessed and cached a resource. The RNS server then cached a resource record listing the peer as a caching publisher for the resource, and also listing the resource identifier (including version indication) for the resource cached by the peer. The peer may be just one location among a list of several locations at which the resource is expected to be available.
At 510, the RNS server watches for a request for the cached record. While waiting, the RNS server watches to see if the cached record has timed out in 520. That is, the record has a time limit on how long the RNS server will cache it. If time has run out, the record is flushed in 540 and the process ends. The time limit may apply to the entire record referring to all the locations for a particular resource, or the time limit may only apply the caching publisher's location. If only the location of the caching publisher is flushed in 540, more recently cached locations for the resource may continue to be maintained in the resource record at the RNS server.
While waiting for a request for the cached record, the RNS server also watches to see if a local master has updated the resource in 530. That is, if the master publisher for the resource is also homed at this RNS server, the master publisher will inform the RNS server when the resource is updated by sending the RNS server a new resource identifier. In which case, the RNS server flushes the entire record of locations for the old version of the resource in 540.
In one embodiment, the master publisher can selectively inform its home RNS server of resource updates by only sending its home RNS server information about changed resources that had been previously looked up by the home RNS server (and for which the home RNS server thus has a cached resource record).
In one embodiment, the home RNS server can also notify the master publisher whenever the home RNS server chooses to discard the cached resource record for a resource. Following such a notification, the master publisher can temporarily stop sending change notifications for that resource to its home RNS server until, for instance, the resource is again looked up on the master publisher by the home RNS server.
In another embodiment, the home RNS server can reply to change notifications received from the master publisher after the cached resource record has been deleted with a status indication indicating to the master publisher that the master publisher may temporarily stop sending change notifications for that resource to its home RNS server, until the resource is again looked up on the master publisher by the home RNS server.
While waiting for a resource to time out or to be updated by the master publisher, the RNS server also watches to see if the caching publisher has flushed the resource in 535. If the peer no longer caches the resource, there is no reason to continue caching the peer's location with respect to the resource. In one embodiment, peer platforms notify their RNS servers when a new resource is created, when a resource is modified, and when a resource is deleted. The RNS servers update their records accordingly.
Back at 510, if a request for the cached record is received, the RNS server provides the cached status at 550. Note that the RNS server did not watch for resource modifications from a master publisher homed at a different RNS server. That is, in the illustrated embodiment, changes in the status of resources published by master publishers homed at remote RNS servers are ignored by the RNS server of FIG. 5. In other words, if a resource record has not timed out, the record is presumed valid. This approach can greatly reduce the amount of inter-RNS server traffic. A fairly high level of coherency can also be maintained by keeping the lifespan of records for remote master publishers short.
In alternate embodiments, any number of additional criteria can be used to flush records. For instance, if an RNS server runs low on memory space, it can flush records. Then, when more memory is available, an RNS server can re-create records by querying peers for the current status of published resources.
Peers, such as peers 140 in FIG. 1, can include a wide variety of devices. In one embodiment, the peers are end-user machines, such as desk top computers, laptop computers, handheld devices, and the like. A peer can act like a client to request access to a resource available elsewhere in the networking environment, as well as act like a server to service requests for a resource available at the peer. Resources available at a peer may include files, directories of available files, devices attached to the peer, Web services, Microsoft NET services, application instances, particular users (such as chat participants), and the like.
RNS locator service traffic requires only a small amount of data traffic compared to the amount of data involved in actually accessing most resources. In other words, a peer merely asks an RNS server where a resource can be found and then goes to that location or set of locations to actually access the resource. This two step process makes the RNS network exceptionally "scalable," which means it can support a vast number of peers and can grow rapidly without significant difficulty. For instance, since the first step uses very little data, the RNS servers can handle a very large number of these small requests per time unit. The bulk of the data traffic is exchanged directly among the peers. Adding capacity is as easy as adding more RNS servers and registering more peers.
In FIG. 1, the elements in realm 150 communicate with one another using any of a variety of network transmission protocols, such as the User Datagram Protocol (UDP) or the Transmission Control Protocol (TCP), and any of a variety of application protocols, such as a proprietary protocol, the Hypertext Transfer Protocol (HTTP), the File Transfer Protocol (FTP), or the like. The networking environment including realm 150 may comprise a local area network (LAN), a wide area network (WAN), a private internet, the public Internet, or the like. In alternate embodiments, realm 150 may comprise a standalone network.
The RNS service can use any number of security measures, including encryption, firewalls, and the like. A variety of protocol tools can also be used to accommodate unreliable networking environments where packets can be lost, can be received out-of-order, can be duplicated, etc. For instance, requests and responses can be pipelined and/or sent multiple times. Each transaction can include a "nonce," which is a unique identifier generated by the initiator of a transaction to distinguish among multiple replies to the same request.
FIG. 7 illustrates one embodiment of a hardware system 700 intended to represent a broad category of computer systems such as personal computers, workstations, and/or embedded systems. In the illustrated embodiment, the hardware system 700 includes processor 710 coupled to high speed bus 705, which is coupled to input/output (I/O) bus 715 through bus bridge 730. Temporary memory 720 is coupled to bus 705. Permanent memory 740 is coupled to bus 715. I/O device(s) 750 is also coupled to bus 715. I/O device(s) 750 may include a display device, a keyboard, one or more external network interfaces, etc.
Certain embodiments may include additional components, may not require all of the above components, or may combine one or more components. For instance, temporary memory 720 may be on-chip with processor 710. Alternately, permanent memory 740 may be eliminated and temporary memory 720 may be replaced with an electrically erasable programmable read only memory (EEPROM), wherein software routines are executed in place from the EEPROM. Some implementations may employ a single bus, to which all of the components are coupled, or one or more additional buses and bus bridges to which various additional components can be coupled. Those skilled in the art will be familiar with a variety of alternate internal networks including, for instance, an internal network based on a high speed system bus with a memory controller hub and an I/O controller hub. Additional components may include additional processors, a CD ROM drive, additional memories, and other peripheral components known in the art.
In one embodiment, the present invention, as described above, is implemented using one or more hardware systems such as the hardware system 700 of FIG. 7. Where more than one computer is used, the systems can be coupled to communicate over an external network, such as a local area network (LAN), an internet protocol (IP) network, etc. In one embodiment, the present invention is implemented as software routines executed by one or more execution units within the computer(s). For a given computer, the software routines can be stored on a storage device, such as permanent memory 740.
Alternately, as shown in FIG. 8, the software routines can be machine executable instructions 810 stored using any machine readable storage medium 820, such as a diskette, CD-ROM, magnetic tape, digital video or versatile disk (DVD), laser disk, ROM, Flash memory, etc. The series of instructions need not be stored locally, and could be received from a remote storage device, such as a server on a network, a CD ROM device, a floppy disk, etc., through, for instance, I/O device(s) 750 of FIG. 7.
From whatever source, the instructions may be copied from the storage device into temporary memory 720 and then accessed and executed by processor 710. In one implementation, these software routines are written in the C programming language. It is to be appreciated, however, that these routines may be implemented in any of a wide variety of programming languages.
In alternate embodiments, the present invention is implemented in discrete hardware or firmware. For example, one or more application specific integrated circuits (ASICs) could be programmed with one or more of the above described functions of the present invention. In another example, one or more functions of the present invention could be implemented in one or more ASICs on additional circuit boards and the circuit boards could be inserted into the computer(s) described above. In another example, field programmable gate arrays (FPGAs) or static programmable gate arrays (SPGA) could be used to implement one or more functions of the present invention. In yet another example, a combination of hardware and software could be used to implement one or more functions of the present invention.
Thus, a Resource Naming Service is described. Whereas many alterations and modifications of the present invention will be comprehended by a person skilled in the art after having read the foregoing description, it is to be understood that the particular embodiments shown and described by way of illustration are in no way intended to be considered limiting. Therefore, references to details of particular embodiments are not intended to limit the scope of the claims.


text: Job Discussion Forums :: View topic - Rio de Janeiro: House to Share in Lapa Get TEFL Certified & Start Your Adventure Today! Job Discussion Forums"The Internet's Meeting Place for ESL/EFL Students and Teachers from Around the World!" FAQ Search Memberlist Usergroups Register Profile Log in to check your private messages Log in Rio de Janeiro: House to Share in Lapa Job Discussion Forums Forum Index -> Brazil View previous topic :: View next topic Author Message teaguetodJoined: 01 Jun 2007Posts: 3Location: Rio de Janeiro, Brazil Posted: Sun Jun 01, 2008 2:55 pm Post subject: Rio de Janeiro: House to Share in Lapa Hello Everyone, Im an English teacher in Rio, and I rent a big old house in a vila between Lapa and Barrio de Fátima. I was sharing the place with another English teacher, but hes leaving, so Im looking for another housemate. Any English teachers currently in Rio (or, possibly, arriving very soon) and looking for a place to live are welcome to contact me about sharing this place. Here are the details: 2-story house, 4 bedrooms, 3 bathrooms (+ 1 WC), big front living room, big kitchen, roof terrace where you can get some sun or lie in a hammock in the shade, built-in brick barbecue grill (weve hosted a lot of churrascos and parties here), 2 áreas de servício. 2 of the bedrooms are very big with private bathrooms & air conditioning, the other 2 are smaller but still livable. Located 4 blocks from the Arcos da Lapa (about a 5-minute walk): close, but not too close, to all the noise and craziness of Lapa on the weekends. 10-minute walk to downtown. If you teach classes in companies in the center you can walk to work. The street is safe; none of the people living in this house has ever had a problem. The vila is totally safe inside because the residents all know each other and watch who is coming and going. Its off the street, so the only noise we ever hear is from the children playing inside the vila. Price: R$500 + bills (splitting gas, water, light, phone+internet). No condominium charge like in an apartment building, since its a house. Price will be less if more than 2 people are sharing (weve had 4 teahcers living together here before). Remember, youll pay just as much or more to rent a room in a Brazilian familys house, with a lot less privacy and freedom to do as you please. If youre interested you can call me at (55) (21) 9282-8050 to have a look at the house. (If you contact me on this forum, it will take longer for me to get back to you.) Thanks, Todd Back to top andidance3Joined: 16 Oct 2007Posts: 7 Posted: Wed Sep 17, 2008 9:00 pm Post subject: is this a typical rent for rio? just curious i'd love to live there, sounds great, but i'm not there yet!!! Back to top Display posts from previous: All Posts1 Day7 Days2 Weeks1 Month3 Months6 Months1 Year Oldest FirstNewest First Job Discussion Forums Forum Index -> Brazil All times are GMT Page 1 of 1 Jump to: Select a forum Where to Begin----------------General DiscussionNewbie ForumCurrent Events ForumTechnology ForumOnline Teaching Forum Africa Forums----------------General Africa Forum Asia Forums----------------CambodiaChina (Job-related Posts Only)China (Off-Topic)Hong KongIndiaIndonesiaJapanMalaysiaPhilippinesSingaporeTaiwanThailandGeneral Asia ForumVietnam Caribbean Forums----------------General Caribbean Forum Europe Forums----------------Czech RepublicFranceGermanyGreeceItalyMacedonia and the BalkansPolandRomaniaRussia & C.I.S.SpainTurkeyUkraineUnited KingdomGeneral Europe Forum Latin America Forums----------------ArgentinaBrazilChileColombiaCosta RicaMexicoMexico (off-topic)PeruGeneral Latin America Forum The Middle East Forums----------------BahrainEgyptIsraelKuwaitOmanQatarSaudi ArabiaUnited Arab EmiratesGeneral Middle East Forum North America Forums----------------General North America Forum Oceania----------------Australia/New Zealand You cannot post new topics in this forumYou cannot reply to topics in this forumYou cannot edit your posts in this forumYou cannot delete your posts in this forumYou cannot vote in polls in this forum This page is maintained by the one and only Dave Sperling. Contact Dave's ESL Cafe Copyright © 2018 Dave Sperling. All Rights Reserved. Powered by phpBB © 2001, 2002 phpBB Group Teaching Jobs in China

subset: commoncrawl


text:
Where the Real and Virtual Worlds Meet
The real world blends with the virtual one in a technology known as augmented reality. The WSJ's Maya Pope-Chappell looks at how app makers are using this new technology to do everything from decorating your living room to finding a place to dine.
This transcript has been automatically generated and may not be 100% accurate.
mm ... ay ... ay ay ... ay ay ay ... in reality RAR ... that they listen to what the future could look like ... the technology refers to the overlay of digital information onto the row World's ... and everyone from game designers to publishers and retailers want to cash in ... their hourly some popular apps like it ... some useful some not so much but here's some that I love that ... this was an app that lets you Lincoln innings to digital content like video and animations ... as ... a QR code you point your camera to a real live object ... within recognizes that an inch and a video for animation use that pops up on the screen ... qualifiers against the playlists anti isn't very facts ... few ever wonder how that her from Kaltura Turquoise nightstand looking apartment ... will snapshot Chevron is a practical and fun a are out that led to changes that ... can lead to share with friends ... things are categorized and come from places like achy and CDT ... the downside of the app ... the scale of off and it's a bit and Wellesley ... finally Nokia's City lens is an app for its Lumia phone that uses the camera to display of restaurants shops and points of interest on your phone ... one holding the phone up in front of you ... it displays the name and location distance directions and it is you can also tell the phone different ways to pull the info and lives on Morna Matthew Hoggard it's only available on the Nokia phone ... the the ... his global brand is its consumer release later this year will last you can expect more and better apps to hit the market ... that trades the virtual and real worlds ... I'm I'm


text: It was recorded at my porch in one rainy night beside the track. Trucks were driving fast from the left to the right side and backward on the background of heavy rain. This movements creates a beautiful and wide stereo effect. This track can be used anywhere – in movie, presentation, game or just for relaxing. I hope you will enjoy!


text:
what's inside
Holiday Home Decor
Presents that Pamper
Last-Minute Gifts
Wine Wraps & Labels
More Inspiration
Easy-Sew Christmas Gifts
A handmade Christmas gift is as easy as grabbing a needle and thread. If you're aiming for creative and easy DIY ho...
Christmas Gifts: 20+ Cute and Clever Ideas to Try
Friends and family will adore these cute Christmas gift ideas, including DIY dishware, Christmas candles, and other...
Handmade Hostess Gift Projects
With holiday parties filling your calendar, don't forget to show your hostess some love. Give thanks with a beautif...
Beautiful Handmade Christmas Ornaments
Adorn your Christmas tree with beautiful handmade Christmas ornaments made by you! Hang these easy ornaments on you...
Santa Claus Christmas Crafts Ideas
While eagerly awaiting the arrival of Santa Claus, get ready with these fun Christmas crafts featuring Jolly Old Sa...
Easy Low-Cost Christmas Projects
Keep holiday spending under control with these innovative and easy Christmas crafts that spread holiday cheer. We h...
Creative Candles to Craft
Dress up candles, votives, and hurricane glasses with these ideas that will have your home glowing.
Fun-to-Make Christmas Holiday Crafts
Spruce up your holiday home with these clever handmade Christmas decorations. Including cute ornaments, creative wr...


text:
Twin Eagles 30" Triple Drawer Single Door Combo - TEDD303-B
Shop All by Twin Eagles
Reg. $1347.67
Spec Library
Read more...
- Model #: TEDD303-B
- Soft closing, three way adjustable concealed door hinges.
- Double walled doors with welded inside liners.
- Detailed finish welded corners.
- One-piece mounting frame for precision alignment.
- Flush handle design with hi-polished accents.
- Self latching, and 100 pound capacity, full extension slides.
- Extra deep drawers for oversized utensils.
- Optional Liquid Propane Tank and Trash Slide Kit (TETS-KIT) allows for easy access to an LP tank or trash container, kit occupies the single access door on this combo.
The Twin Eagles TEDD303-B Door Drawer Combo is self-latching and double walled with welded inside liners with 100 lbs capacity and full extension slides. Extra deep drawers are perfect for larger bottle or oversized utensils, and door includes Soft-Closing three-way adjustable concealed door hinges preventing dents, scuffs, and slams. The Flush handle design has high polished accents and a one-piece mounting frame makes precise alignment a breeze.
- Overall Width: 30"
- Overall Height: 20 3/4"
- Overall Depth: 20 3/4"
- Cutout Width: 29 1/4"
- Cutout Height: 19"
Twin Eagles 30" Triple Drawer Single Door Combo - TEDD303-B
Customize Yours


text:
6:00 am
Sesame Street "Great Vibrations" Bob is conducting a class of kids playing different musical instruments. Abby walks by and is amazed by the beautiful music. Bob offers to teach her, but first, she needs to choose an instrument. D
7:00 am
Curious George Swings Into Spring It's springtime! And a little monkey has a big case of spring fever. But serious lobby dogs like Hundley have no time for frolicking, especially when there's a spring cleaning prize to be won. Hundley's dreams are dashed when a burst pipe forces him to evacuate the building and join George in the country. D
8:00 am
Super Why! "Little Miss Muffet" Poor Red wants nothing more than to play with Little Boy Blue, but he keeps running away! The Super Readers venture into the tale of Miss Muffet and meet a spider who is frightening his friend right off her tuffet! The Super Readers help Spider find a better way to approach Miss Muffet, and everyone learns that curds and whey taste better when shared with someone special. Educational Objectives: To learn how to treat a friend, follow the alphabet, practice spelling and use the power to read to change the story. D
8:30 am
Dinosaur Train "Hootin' Hadrosaurs!/Hatching Party" Hootin' Hadrosaurs! - Buddy, Tiny, Shiny and Don meet Perry Parasaurolophus, a dinosaur with a crest on his head who teaches them a new way to hoot some hip music. Hatching Party - Buddy, Tiny and Mrs. Pteranodon attend an egg hatching party and meet their friend Cory Corythosaurus's new brothers and sisters. D
9:00 am
The Electric Company "The Great Compromise" The Electric Company and the Pranksters have to work together to preserve their ability to use their special powers in the neighborhood. D
9:30 am
Wild Kratts "The Gecko Effect" There's a mystery to be solved, as the Wild Kratts team wonders how a Gecko lizard climbs up smooth surfaces and can even climb upside down. The gang uses their Miniaturizer to shrink down and discover it's all about physics: all objects have electrical charges that attract one another and the gecko's marvelous toe pad structure charges so much that they can walk on surfaces as smooth as glass. But in the meantime Zach has stolen their Miniaturizer and now imprisons them in a glass terrarium. D
10:00 am
WordWorld "Flying Ant/The Dancing Duck Bonanza" Flying Ant - WordWorld is all abuzz - today is the Insect Air Show! All the bugs in WordWorld take to the sky to show off their flying skills. All the insects, that is, except Ant, who can't fly. But Ant is a smart, industrious WordFriend, and with the help of his best pal Pig, he finds just the right word to give him the lift he needs to be the hit of the show. D
10:30 am
WordGirl "Where Have All The Villains Gone?/Captain Tangent Returns" WHERE HAVE ALL THE VILLAINS GONE? - Ms. Question comes up with a brilliant plan to get rid of WordGirl: eliminate all of the city's villains so WordGirl is no longer needed. Will Ms. Question be able to keep WordGirl away? Or will a villian-less city need her after all. Vocabulary Words: Eliminate, Entire. D
11:00 am
Outdoor Idaho "Cycling Idaho" Whether you prefer the open road or steep mountains, Idaho is a bicyclist's paradise. We'll take you on some scenic bike trips around the state, from the Teton Valley in eastern Idaho, to the Trail of the Coeur d'Alenes in northern Idaho's Silver Valley, to epic mountain biking in the Boulder Mountains of central Idaho.G
11:30 am
Pati's Mexican Table "Tomatillos" Meet the tomatillo - this small, plump, green fruit was a favorite of the Aztecs and stars in any number of Mexican dishes today. Its tart flavor is worlds apart from the taste of tomatoes, but is just as juicy and unforgettable. In this episode, Pati will show you where to find tomatillos, how to cook with them and offers tips and tricks for creating amazing dishes. D
12:00 pm
Katie Brown Workshop "Sweet" The recipes and projects Katie presents promise to satisfy even the sweetest tooth and awaken your sweet side. In the Kitchen: Colorful Birthday Cake, Heavenly Orange & Cherry Brownies and Kyle's Famous Sugar and Spice Cookies. Projects: Make-and-decorate lip balm. D
12:30 pm
Paint This With Jerry Yarnell "Rocky River, Part 2" This episode is about the river and how it transforms into wet, flowing water. Jerry will demonstrate getting rocks under the water along with balance of negative space by painting IN, AROUND, and THROUGH the painting. D
1:00 pm
Essential Pepin "Fowl Play" Turkey Cutlets In Anchovy-Lemon Sauce; Grilled Chicken With Tarragon Butter; Roast Capon With Cognac And Mustard Sauce; Ballottine Of Chicken With Spinach Filling. D
1:30 pm
On Story "A Conversation with Buck Henry" From THE GRADUATE and CATCH-22 to "Saturday Night Live" and "Get Smart," iconic comedic and distinctly American writer, director, and actor Buck Henry recalls his long and storied career in Hollywood. Followed by the heartwarming story of a failed ukulele player and her talking puppet dog, The Ballad of Friday and June by writer/director Tate English. D
2:00 pm
Dialogue "Kati Marton: Conversations from the Sun Valley Writers' Conference" Marcia Franklin talks with author and former journalist Kati Marton. During the interview, taped at the 2011 Sun Valley Writers' Conference, Franklin talks with Marton about her experience researching her most recent work, Enemies of the People. The book chronicles Marton's search to learn more about her parents, who were imprisoned by the Hungarian government during the Cold War for their work as reporters for American news outlets.G
2:30 pm
MotorWeek "Jaguar F-Type" Road Test: 2014 Jaguar F-Type. Road Test: 2013 Ford Taurus. D
3:00 pm
America's Test Kitchen from Cook's Illustrated "Chicken Classics, Improved" Test cook Julia Collin Davison shows host Christopher Kimball how to make the ultimate Skillet Chicken Fajitas. Next, tasting expert Jack Bishop challenges Chris to a tasting of tortillas, and test cook Bridget Lancaster uncovers the secrets to the best Classic Chicken Salad. And finally, gadget guru Lisa McManus reviews her favorite new kitchen gadgets. D
3:30 pm
Crafting at the Spotted Canary "Things That Decorate Your Work Space" Today's show features the latest in desk accessories. The first segment shows how to make fun and functional binder clips - you'll find they have a lot more uses than just holding papers. Next, guest expert Karen Bulmahn demonstrates a remake of an inexpensive clock. D
4:00 pm
Globe Trekker "Around The World - Panamericana: Incas & Inquisitions" Trekker Brianna Barnes journeys to Peru, home of the legendary Incas, where she begins her trek in Cajamarca, where thousands of Incan soldiers were slaughtered by Pizarro's conquistadors. After visiting one of the world's largest gold mines, Brianna makes her way to Lima, once home to the Spanish Inquisition in South America. In Cusco, she learns about the golden Inca Empire before ending her journey on the volcano El Misti.G
5:00 pm
The Artist Toolbox "David Garrett" "One, two, three, four." In this premiere episode of The Artist Toolbox, come and listen to the gypsy strings of the dazzling David Garrett, whose violin can conquer the classical work of composers such as Bach and Chopin as effortlessly, as gracefully, as old-world Russian folk music, as well as the more contemporary sounds of Metallica and Led Zeppelin. Sit in on a private rehearsal with the virtuoso violinist, known in Britain as "the David Beckham of classical music. D
5:30 pm
Sun Studio Sessions "Lucero" Lucero are a Memphis band whose high energy live performances have gained them fans from coast to coast. In this episode, Lucero performs songs of their latest record "Women and Work" including the title track. D
6:00 pm
Austin City Limits "Coldplay" The Grammy-winners and modern-rock giants have sold more than 50 million records worldwide. They perform their hits and selections from their album Mylo Xyloto.G
7:00 pm
Live From Lincoln Center "Rodgers & Hammerstein's Carousel With the New York Philharmonic" The New York Philharmonic leads an all-star semi-staged performance of this classic featuring Kelli O'Hara, Nathan Gunn, Stephanie Blythe and more. The second collaboration of Richard Rodgers and Oscar Hammerstein, Carousel remains an enduring theater landmark; together with Oklahoma it changed the American musical forever.G
9:30 pm
Sun Studio Sessions "Lucero" Lucero are a Memphis band whose high energy live performances have gained them fans from coast to coast. In this episode, Lucero performs songs of their latest record "Women and Work" including the title track. D
10:00 pm
Austin City Limits "Coldplay" The Grammy-winners and modern-rock giants have sold more than 50 million records worldwide. They perform their hits and selections from their album Mylo Xyloto.G
11:00 pm
Live From Lincoln Center "Rodgers & Hammerstein's Carousel With the New York Philharmonic" The New York Philharmonic leads an all-star semi-staged performance of this classic featuring Kelli O'Hara, Nathan Gunn, Stephanie Blythe and more. The second collaboration of Richard Rodgers and Oscar Hammerstein, Carousel remains an enduring theater landmark; together with Oklahoma it changed the American musical forever.G


text:
Steven Van Zandt May Have to Miss Bruce Springsteen Concerts
Bruce Springsteen's current tour is scheduled to end on Sept. 22. However, there are already whispers of more dates being added in the fall. Should the tour extend into 2013, there is a good chance that Steven Van Zandt will have to miss some of the shows.
Van Zandt is scheduled to begin filming the second season of 'Lilyhammer,' a Norwegian television program in which he stars as an American mobster living in Norway. The guitarist believes both parties will reach an agreement that will allow him to perform both jobs.
"I made commitments before the tour even existed," Van Zandt explained in a recent interview with Rolling Stone. "We're still trying to figure it all out, and we won't know for another couple of months. Bruce and [manager] Jon Landau are very, very understanding about this and very supportive of my TV career. They're gonna try and bend things around as much as they can. And then, if they can't, if I gotta miss a few things, I'll miss a few things. We're gonna try not to, though."
This is not the first time that "Little Steven's" acting career has conflicted with his E Street Band duties. His tenure as Silvio Dante on 'The Sopranos' coincided with Springsteen's decision in 1999 to reunite the E Street Band, which caused the show's creators to reduce his role during tours. Van Zandt signed on to do 'Lilyhammer' in 2011, before the "Wrecking Ball' tour was in the works.


text:
With the success of Samsung Electronics in Vietnam, many other members of the Group has also interested in expanding investment in Vietnam in such fields as energy, insurance.
As reported by the General Director of Samsung Vietnam, the business activities of Samsung Electronics have performed well. Until May 2015, the total workforce working in the factories of Samsung in Bac Ninh and Thai Nguyen are more than 100,000 people. Due to many new models and more phone lines with more orders, Samsung Vietnam has recruited many more manpower. Currently, the total workforce working for the Samsung factory in Bac Ninh and Thai Nguyen are more than 110,000 people.
Not only focusing on production development, Samsung is still very focused on research and development (R&D). Currently, Samsung Vietnam has one R&D center located in Hanoi with over 1,400 employees.
The Samsung investment panorama in Vietnam is very impressive. Samsung has invested in Bac Ninh and Thai Nguyen from 2009, up to now, the total investment is approximately 7 billion USD. As of July 2015, the total export value of Samsung in Vietnam reached 26 billion USD, contributing to the development of Vietnam. Samsung has created jobs for more than 100,000 people.
Recently, Bac Ninh has granted investment certificate of expansion project for Samsung Display Company Ltd Vietnam with total investment capital of 3 billion USD, investing in the factory that is specialized in research and development, manufacturing of new generation monitors with high resolution for mobile devices…
ANT Consulting is here to assist you from the outset; providing corporate intelligence, risk advisory, management consulting services that assist market entrance, and ensure efficient business start-up operation. Our services are as following:
We strive to save your cost by guiding you towards economical solutions that comply with local legislation and procedures. We support you through early logistic solutions and carry you through as your business grows. We aim to bridge the gap between international best practices and local cultures and assist foreign companies and organizations entering Vietnam market to overcome commercial and regulatory issues.


text:
So, welcome to Teenage Gluesniffer, named in homage to two great songs and one great lost fanzine, which I only read in someone else's bedroom, as all good fanzines should be read.
This is a GROUP BLOG - if you want to join it, please drop me a line (you need a blogger account) - I'd love to have ya.
The mission is write about and scan in samples from your favorite saved fanzines, memorabilia of the past. Since my "past" is defined as spanning the years 1979 and on and in case you didn't catch on from the title, the focus is on the post-1979 American / UK punk-alternative-indie music scene but if you're into old lady's lingerie catalogs, then by all means, bring it on. The only constraint is you gotta write about it, talk about what you like, don't like, even try to make it funny and interesting (since I'm blog editor, I reserve the right to be a boring jackass, however).
Note that this is intended to be a "fair use" only site and not an archive nor do we want to infringe on copyright. As such, we accept no advertising or promos or swag or whatever. If you're the owner of one of these fanzines, tough, write insults in the comments section if you don't like it and maybe we'll just start an old-fashioned flame war or maybe I'll just drive to your home and set your lawn on fire, suburban bitchhole.
Please recommend some blogroll and links to put on the side here. Onto the first posting.
DAMP 2 came from, as most fanzines do, a small town - South Millington, Connecticutt (a state which I manifestly refuse to learn how to spell on general principle - please rename it Cutt or something) - issue #2, already a newsprinty, 8 1/2" x 11", staple-binded 46 whopping pages is dated 1987. Editor Kevin Kraynick seemed mostly inspired, like many zines of the era, by Forced Exposure and its jazz editor Byron Coley- so much so that not only is Coley the subject of a two part interview, he's mentioned in the first sentence of the lead editorial and a letter Coley wrote is reprinted in full at the top of their "Letter Nook" section. Coley commends them for covering Mofungo in their first ish and suggests they also investigate the Blinding Headache / Information Nucleus family tree. Not that the guy who rediscovered so many forgotten artists and made the career for a many other deserving folk doesn't deserve his own fanzine, but should have just called this Coley Youth instead of Damp. But then come to think of it, they're pretty much the same thing.
The 'tude is mostly Too Smug in Suburbia or I Know Who The Residents Are, Do You? - here's Kraynick in his lead editorial moaning about people who live in big cities (read: Boston and NYC) and write fanzines full of band gossip:
"You people want to live in a goddamn stinking ant farm go right the fuck ahead, but I'd prefer to kick back here in Nowheresville and be left alone. I see all about all the shows I need to see by shagging my ass to Providence or New Haven every once in a while."He then proceeds to relate all the latest band news and gossip from Boston and NYC (and The Residents).
The record reviews are 2nd-rate Coley - what they lack for in originality and innovativeness, they make up for in unintended artful mockery of his scatological 2nd-rate Melzter imitation. Here's what's reviewer Dead Bob writes about the Grateful Dead's uber-crap In The Dark album: "Following the pattern of the locust, these tour-crazedgestalt emissaries have shit out their first studio log in seven years. Holy bashoogi! About fucking time, I was starting to wonder if Jerry would die first." But you can't hate an acolyte for trying and Bob's Band Equation (reprinted below, page 44) more than make up for it.
Here's their acidic take on the long and properly forgotten Hugo Largo's Drum album:
"Currently standing trial on gange rape charges in Pasadena with tour mates the Beastie Boys. Former mosh monster who now prefer the "hip hop styles." Co-produced by Mumbles Stipe who helped write their tune "Second Skin" about the harrowing operation he recently underwent to have his foreskin reattached to his penis. I was tear-dropping for days"There are more samples of record reviews on page 33 below. The interviews are kinda silly and true to fanzine form, overly long - they ask Snakehand what his favorite salad dressing is only because they want to hear the London-born guitarist say "Raunch, Raunch dressing" so I give them credit for that. An excruciating Zoogz Rift interview crowns the issue. But reading an artist, any artist, yammer and whine about how expensive it is to tour (yawn) and how he debates making his records more accessible with his label to get more radio play (double yawn) - well, you get the picture. Much more interesting is reading Zoogz talk about obsession with Frank Zappa who he calls a "father figure" and brags "cannot kiss Frank Zappa's ass enough" (he then proceeds to trash Zappa's latter period synclavier work) . If Zoogz wasn't a creepy enough guy for ya, he even frets over why Frank won't respond to his mail: "...he might resent my existence thinkin' to himself, 'Oh Christ, I could do alot better than that. This guy's being compared to me? This geek?'" Heh.
On the Internets, Damp 5 is remembered best as it was an all Beefheart issue and Beefheart fans pretty much own a small country in cyberspace. Here's a reprint of Kraynick's embarassing phone call to Don van Vliet
and United Mutations has a photo of Damp 5's cover. Well enjoy these page scans from Damp 2 and tell me if you like this blog. If Kevin or any of the staff writers are out there, please drop in some comments and let me know about your experience with Damp.


text:
Our clean-cut and uniformed crew have plenty of experience as super stain fighters. Working quickly and quietly, they'll descend upon your home like stain-fighting angels, leaving it looking positively heavenly. Whether you have dirty hardwood, tile or upholstery, our staff has plenty of experience fighting the toughest stains. Simply give us a call for a consultation and we'll have a crew out to your home or business, ready to transform your floors and upholstery from dingy to divine.
Serving both commercial and residential customers, our professional crew can make your carpet, upholstery, leather, tile and grout look brand-new.
Contact Us
Give us a call today and say goodbye to that stained carpet or upholstery. It'll look so great that the next call you make will be to brag to all your friends.


text:
This article, entitled "Back to School Adjustments," comes from Taryn Vanderford, MomsEveryday blogger from Lincoln, NE.
It was a big week. And change can be hard. My son entered middle school.
Jacob is excited to be a 6th grader. He loves his school and the new challenges. I'm happy for him, too. We couldn't ask for a better learning environment...
I was actually handling the first day pretty well… until we took my daughter to school. She's a 3rd grader, and made the trip to her elementary school alone for the first time.
"I miss my brother," Olivia said as we drove her to school.
It was when Olivia walked down the sidewalk alone, when the tears started to well up in my eyes.
And then yesterday, after school, Olivia crawled on my lap and gave me a big hug.
She told me how she would always see Jacob in the hallway and found him after school. He would protect her, and she liked that.
"I know," I said (trying to evoke the words my mom would probably use). "I miss him, too. But this is your chance to be a big girl. You can do it. And next year, your little cousin will be here, and you'll need to help her out. She'll look up to you."
Life is about change. And parents have to deal with their kids growing up. You have to be positive...for you and for your kids.
Every stage of parenthood is precious. It's great to see the wonderful little people they are becoming each day. And I've loved every moment (too bad it goes so fast).
Let me know how the first week of school went for you. How do you deal with your kids getting older?
Happy Parenting!


text:
Entire apartment
Apartment Desa A1-Mali(2) Prizba, Island Korcula
Apartment Desa A1-Mali(2) Prizba, Island Korcula
2 guests
1 bedroom
2 beds
1 bath
2 guests
1 bedroom
2 beds
1 bath
Apartment A1-Mali(2). Number of bedrooms: 1. Number of bathrooms: 1. Number of balconies: 1. Apartment has 25 m2. Wifi gratis.
The closest beach is 10 meters away. The property is 10 meters away from the coast. The town center is 7 kilometer away.
Free parking on premises
Wireless Internet
Hair dryer
Unavailable: Smoke detector
Unavailable: Carbon monoxide detector
The host hasn't reported smoke or carbon monoxide detectors on the property.
Sleeping arrangements
Bedroom 1
1 queen bed
House Rules
No pets
No parties or events
Check-in is anytime after 2PM and check out by 10AM
To Islands Travel manages this property on behalf and for the account of the owner. Our agency was founded in 2004. and it has a long experience in running vacation rental properties. Our employees will be at your disposal during your arrival and during your stay at the arrange…
Languages: Deutsch, English, Français, Italiano, Magyar, Polski, Čeština
Response rate: 95%
Response time: within a few hours
Always communicate through AirbnbTo protect your payment, never transfer money or communicate outside of the Airbnb website or app.
The neighbourhood
Things to do near this home
Explore other options in and around Prizba
More places to stay in Prizba:


text:
0 Members and 1 Guest are viewing this topic.
Love how the trailer is two minutes long and gives no actual information about the game....wait, I don't love that.
...I like the original Atelier formula and all, but anyone ever wish they'd try the more RPG-oriented route again like they did for Iris?? I mean that insofar of a more in-depth battle system and bigger emphasis on story/world than characters.
To Dice:Ayesha is definitely more world focused than just about every traditional Atelier title to date. That's one of the main themes of the game: truth and understanding of the world around you. They've put a larger emphasis on lore and background. I like the change, and I think this game might be going in a direction you prefer. All I have to say is, as warned on the previous page, you really need to to Keith's set of events before beating the final boss.
Sorry to revive this thread but I am doing so with purpose...After Rorona left a bad taste in my mouth I found it difficult to return to Arland. As such Totori and Meruru (while I understand to be much better) still sit unopened on my shelf. However, I HATE when a series I appreciate or am interested in gets annual releases and I am left in the dust.. Unable to ride the wave of enthusiasm over siliconera posts and updates because I have fallen behind on the franchise. Thus I decided to, somewhat reluctantly, begin Ayesha this past weekend.On to the purpose...For anyone who may have (like myself) appreciated the art style and charm of the atelier series but was on the fence about returning to the franchise until the franchise returned to something a wee bit more "iris" in nature... for me personally... I am shocked at how impressed I am with this game so far.Explaining what I've found and appreciated about the title would only echo the RPGfan review and well circulated info about the title. All I am truly posting to say is if you have been looking at the new Atelier titles' previews and going "gee, but I never even got to ayesha.... guess I'll pass.." it may be worth rethinking or taking another look. If nothing else, given its length, it should fit in nicely now right before I become tales-obsessed in August! LoL


text:
WTF: 7yr Old Girl Allowed To Enter Brazil's Sexy Samba Queen At The 2010 Carnival!
"The decision to make a seven-year-old girl "queen" of a top samba school taking part in the Rio de Janeiro Carnival has caused controversy in Brazil. A judge is considering banning Julia Lira from her starring role despite her father dismissing the concerns of children's rights groups that the traditionally "sexy" role is inappropriate for children. " - RIO NEWS
Please click the "Report" button below if the video on this page is not working properly.
Comments will only be displayed by verified emails. No Spamming or Racism.