Technical Field
This application relates generally to relaying communications between end user devices.
Brief Description of the Related Art
The establishment of a peer-to-peer connection between mobile devices to enable the devices to communicate with one another (e.g., over a video calling application) is complicated by the use of Network Address Traversal (NAT) devices. If one or both peers are located behind NAT devices that provide connectivity using address-mapping or address-and-port-mapping techniques, then it might not be possible for the peers to establish direct end-to-end connectivity. Protocols exist that allow peers to overcome the problem of NAT traversal through the use of public packet relays, the most common of which is “Traversal Using Relays around NAT” (TURN). Use of a public TURN relay service has some drawbacks for performance, most notably the penalty that may be associated with the location of the relay server.
It would be desirable to provide a NAT traversal relay service that does not have the same performance drawbacks associated with a more centralized TURN relay service.
This disclosure addresses this need in the art.
An accelerated relay service enables host A and host B, two peers attempting to communicate with one another, to each connect to a publicly-accessible relay server, which servers are associated with an overlay network and are selected by a directory service that is also responsible for exchanging other information (necessary for connection establishment) between the hosts. After end-to-end connectivity is established, preferably the hosts communicate with each other by relaying data packets via the overlay network relay servers. Preferably, communication (both connection control messages and data being relayed) between a host and a relay server occurs at an application layer using a modified version of the TURN protocol. Typically, TURN protocol messages are transported between the host and its associated relay server within UDP datagrams, but under some circumstances, such message are also transported as a TCP stream or encapsulated within pseudo-SSL records.
The foregoing has outlined some of the more pertinent features of the disclosed subject matter. These features should be construed to be merely illustrative. Many other beneficial results can be attained by applying the disclosed invention in a different manner or by modifying the subject matter as will be described.
For a more complete understanding of the disclosed subject matter and the advantages thereof, reference is now made to the following descriptions taken in conjunction with the accompanying drawings, in which:
The technical solution herein provides a relay service to enable end user devices to communicate with one another in a peer-to-peer manner more efficiently. Representative peer devices are shown in
In a representative embodiment, the mobile device is a cellular telephone that operates over GPRS (General Packet Radio Service), which is a data technology for GSM networks. In addition to a conventional voice communication, a given mobile device can communicate with another such device via many different types of message transfer techniques, including SMS (short message service), enhanced SMS (EMS), multi-media message (MMS), email, WAP, paging, or other known or later-developed wireless data formats. Generalizing, a mobile device as used herein is a 3G—(or next generation) compliant device that includes a subscriber identity module (SIM), which is a smart card that carries subscriber-specific information, mobile equipment (e.g., radio and associated signal processing devices), a man-machine interface (MMI), and one or more interfaces to external devices (e.g., computers, PDAs, and the like). The techniques disclosed herein are not limited for use with a mobile device that uses a particular access protocol. The mobile device typically also has support for wireless local area network (WLAN) technologies, such as Wi-Fi. WLAN is based on IEEE 802.11 standards. Of course, a particular peer may be any computing machine such as a desktop, laptop, or the like. Generalizing, a peer is any system, machine, device, or combinations thereof.
As will be described, the relay service of this disclosure (sometimes referred to as an “accelerated relay”) may be implemented within the context of an overlay IP (OIP) routing mechanism that comprises a portion of an overlay (or “content delivery”) network (“CDN”). This implementation, however, is not intended to be limiting, as the solution may be supported in any wireless or wire-line network, whether public or private, virtual or otherwise. As is well-known, an overlay network typically comprises a set of machines distributed around the Internet. Many of the machines are servers located near the edge of the Internet, i.e., at or adjacent end user access networks. Third party web sites and application providers offload delivery of content and applications to the network, which operates as a managed service. The overlay network includes distributed infrastructure for data collection, monitoring, logging, alerts, billing, management and other operational and administrative functions. A typical CDN machine comprises commodity hardware (e.g., an Intel® Pentium® processor) running an operating system kernel (such as Linux or variant) that supports one or more applications. To facilitate content delivery services, for example, given machines typically run a set of applications, such as an HTTP Web proxy, a name server, a local monitoring process, and one or more data collection processes. The Web proxy includes or has associated therewith an edge server manager process to facilitate one or more functions associated with the content delivery network.
A known OIP routing mechanism comprises a representative set of components, as illustrated in
In one known use scenario of the overlay network, one or more clients desire to send packets to a single IP address. This is illustrated in
The various connections used in the overlay network and as described typically are secured via SSL or other transport layer security (TLS) techniques.
In the following discussion, familiarity with TURN (“Traversal Using Relay NAT,” as specified in Internet Request for Comment 5766) is presumed. The reader is also presumed to be familiar with the STUN protocol, as described in RFC 3489.
With the above as background, the accelerated relay service of this disclosure is now described.
As seen in
Preferably, and with reference to UML diagram in
The first step (identified as [Step 1] in the drawing) involves each of the hosts contacting the directory service to obtain overlay relay server addresses. At 602, and to establish a session with Host B, Host A contacts directory service 515; in so doing, host A sends its expected NAT IP and a service port that it will use to connect to the relay server. Likewise, at 604, the directory service obtains from host B the IP address of NAT B and the anticipated relay server port. At 606, the directory server performs a hostname lookup against the overlay network DNS 520. This step is described in more detail below. The hostname lookup is used to obtain IP addresses for good regions for the relay servers (and thus the IP addresses for hosts A and B). At 608, the directory service sends all addresses and ports to Host A and Host B. After this exchange, both hosts know NAT A IP address, NAT B IP address, relay server A IP/port, and relay server B IP/port. In addition, the directory service generates and provides (at step 608) each host with a unique token that represents the connection.
The connection setup then continues with a second step (identified as [Step 2]) by which TURN sessions are then established between each host and the overlay network relay server to which it has been associated (by the directory service). As is known in the art, standard TURN expects a XOR-RELAYED-ADDRESS that is identical for all remote peers, so the attribute is included as part of an allocation request. In this embodiment, the XOR-RELAYED-ADDRESS is exchanged as part of the initial allocation, because it eases both connection identification and connection authentication. A preferred operation is as follows. At 610, hosts A and B each prepare a TURN allocation request to send to the overlay network. This request includes two standard TURN attributes, namely: XOR-RELAYED-ADDRESS=overlay network relay server IP/Port used by the other host, and RESERVATION-TOKEN=the unique ID generated by the directory service and provided to each host at 608. Preferably, TURN allocation requests also use STUN digest authentication to prepare a MESSAGE-INTEGRITY attribute. When the allocation request is received by the overlay, the relay server that receives the request performs necessary verifications, initializes necessary state, and accepts the allocation. In particular, the relay server must verify the XOR-RELAYED-ADDRESS value to ensure that the IP address could have been handed out by overlay network DNS 520 for the customer configuration in question and that the port is one the customer's configuration uses for TURN. At 614, each relay server responds with an allocation accept that includes an XOR-MAPPED-ADDRESS attribute with the NAT IP/port that were reserved for the client.
The connection method then continues with the overlay network notifying the directory service 515 with the NAT address and port. In particular, this step (identified as [Step 3]) goes back to the directory service to propagate the NAT port numbers (the only additional bit of information that was discovered in Step 2. Technically, the NAT port is not required, because the connection token could be used for connection identification. It is preferred, however, because it provides a synchronization point, ensuring that both clients have set up their TURN allocations before either attempts end-to-end communication. In addition, providing the directory service with the NAT address and port information allows both relay servers to verify all elements of the connection, including the NAT ports, before allowing data to be relayed. This approach also provides better support for multi-homed networks. The notifying step preferably works as follows. Following 614, the host has almost all required information for the connection, namely: the host's own IP address/port, address/port of its associated NAT, both relay server addresses, and a unique token representing the connection. Both hosts still need to know the other host's NAT port, and they will need to be updated on the other host's NAT IP if it has changed. To this end, at 616, each host sends its NAT address and port to the directory service 515. Note that the address from the second operation above might have changed if the host's network is multi-homed and the relay server IP address selected for the host uses a different outgoing IP than expected. At 618, the directory service 515 relays the necessary NAT IP/port information to the other host.
A final step (identified as [Step 4]) is then executed to create TURN permission/channel for remote peer. At 620, each host sends a CreatePermission request or a ChannelBind to its associated overlay network (relay) server. This request contains an XOR-PEER-ADDRESS field to identify the other peer. At 622, the hosts send data to the relay server using either TURN Send indication packets or TURN channel headers. After the remaining TURN protocol operations are complete, the relays A and B operate to forward data received from their respective peers. Thus, at 624, data from host A is received at relay A, relayed from relay A to relay B, and then forwarded from relay B to host B. At 626, data from host B is received at relay B, relayed from relay B to relay A, and then forward from relay A to host A. Thus, hosts A and B are now in peer-to-peer communication via the relay service.
Thus, in the described embodiment, each client (a peer) has a connection to a directory service. The directory service performs DNS lookups to determine which overlay network relay server (a virtual IP, or VIP) to which each of the clients should connect. The directory service then tells each client the VIP it should use and the VIP the other machine will use. The directory service also assigns a unique connection ID for the end-to-end connection. Each client then sends a session allocation request to the assigned overlay relay server. The allocation request includes the connection ID and the remote peer's relay server VIP. The overlay relay server responds with the NAT IP/port that was provisioned for the connection. The information is relayed to the remote peer via the directory service. Each client then sends a channel binding request to its assigned overlay relay server, indicating the NAT IP/port of the remote peer. At this point, each overlay relay server is aware of all necessary identifying information for the connection, namely: connection ID, each client's NAT IP/port, and each client's relay server VIP (and service port, if it is necessary for the port to be different).
After the connection is established, it may be maintained using TURN refresh requests and channel bind requests as needed. The connection may be shut down using a TURN refresh request and response.
Certain NAT devices (such as deep inspection firewalls) may terminate the SSL sessions to inspect the data being transmitted via SSL. In such case, overlay-based relay connections might not be able to bypass such a firewall unless the data being transmitted in the SSL stream looks like a valid HTTP exchange. To address this possibility, the protocol described herein may be extended to allow session establishment and data relay using pseudo-SSL session negotiation and tunneling. In this approach, TURN messages preferably are encapsulated in SSL application data protocol headers. If the relay server can verify the received SSL message, the connection can proceed; if not, however, the relay server resets the connection accordingly.
As has been described, the relay service communication between a host and its overlay network relay server functions at the application layer using a modified version of the TURN protocol. Preferably, this is the case for both connection control messages and data being relayed to the remote peer. Typically, TURN protocol messages are transported between the host and its overlay network relay within UDP datagrams, but under some circumstances they can also be transported as a TCP stream or encapsulated within pseudo-SSL records. Because the application-layer protocols used by the described technique preferably are modifications of standard protocols, typically the peer will include client software that can be used to relay data via the relay service.
As can be seen, the relay servers provide the following necessary elements for establishing and maintaining end-to-end connectivity:
As described, the accelerated relay service requires both peers to use the modified TURN protocol. In addition, typically both peers will be required to use the same transport protocol (TCP or UDP), although if both peers are using TCP as the transport, it is possible for one peer to use pseudo-SSL encapsulation and the other peer to use TCP. The accelerated relay service also requires a separate peer-to-relay connection for each peer-to-peer connection. If additional peers are to be included in the communication, a full-mesh of connections between each pair of peers in the group is required.
Preferably, the accelerated relay service selects a “best” (or optimal) relay server for the client to connect to, which means that the relay server cannot be selected until both NAT IP addresses are known. As a result, the service may rely upon the directory service infrastructure to determine the expected NAT IP. As used herein, the term “best” may be a relative term in that an optimal relay server may be optimal at a particular time or under a particular circumstance, or based on some other criteria such as cost, latency or some combination thereof.
As described above, Step 1 in the process involves the directory service (as opposed to the clients themselves) performing DNS lookups for the peers. Preferably, the overlay network authoritative DNS includes an edge mapping mechanism that comprises various data collection and processing machines, load balancing algorithms and the like. Such mapping techniques are well-known in the prior art, such as described in U.S. Pat. No. 7,716,367, in U.S. Pat. No. 7,996,531, and in others. The edge mapping mechanism includes or is associated with overlay network distributed name server processes, databases, and the like. A database typically includes hostname-to-IP address mappings or, more generally, a “map.” In one approach, a first step for edge mapping is to communicate the client address pair to the overlay network DNS by using a unique overlay hostname. Generally, the edge mapping mechanism determines a good pairing of edge regions for the end-to-end connection by first determining a candidate set of edge regions for each client. This determination may take into account information such as path quality between the client and the edge region, current edge region load, and the like. Using these two region sets, the edge mapping mechanism then determines the full end-to-end path quality, preferably including any middle-mile, for each unique pair of regions, and then it selects the region pair that will provide the best (relatively-speaking) end-to-end connectivity. While such “full path” mapping is preferred, it is not required. The algorithm for evaluation of the region pairs may take into account information such as path quality, load on the middle regions, and so forth. Preferably, if a same region appears in both sets it is selected to reduce load, although this setting is configurable based on the load conditions within that region. Once the regions are identified, the individual relay servers therein (in other words, relay server A, and relay server B) are determined, preferably using known in-region load balancing techniques such as described in U.S. Pat. No. 6,108,703, simple round-robin, or the like.
Although not required, typically a peer has or can establish a persistent connection between it and the directory service.
Each above-described process preferably is implemented in computer software as a set of program instructions executable in one or more processors, as a special-purpose machine.
Representative machines on which the subject matter herein is provided may be Intel Pentium-based computers running a Linux or Linux-variant operating system and one or more applications to carry out the described functionality. One or more of the processes described above are implemented as computer programs, namely, as a set of computer instructions, for performing the functionality described.
While the above describes a particular order of operations performed by certain embodiments of the invention, it should be understood that such order is exemplary, as alternative embodiments may perform the operations in a different order, combine certain operations, overlap certain operations, or the like. References in the specification to a given embodiment indicate that the embodiment described may include a particular feature, structure, or characteristic, but every embodiment may not necessarily include the particular feature, structure, or characteristic.
While the disclosed subject matter has been described in the context of a method or process, the subject matter also relates to apparatus for performing the operations herein. This apparatus may be a particular machine that is specially constructed for the required purposes, or it may comprise a computer otherwise selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including an optical disk, a CD-ROM, and a magnetic-optical disk, a read-only memory (ROM), a random access memory (RAM), a magnetic or optical card, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus. A given implementation of the present invention is software written in a given programming language that runs in conjunction with a DNS-compliant name server (e.g., BIND) on a standard Intel hardware platform running an operating system such as Linux. The functionality may be built into the name server code, or it may be executed as an adjunct to that code. A machine implementing the techniques herein comprises a processor, computer memory holding instructions that are executed by the processor to perform the above-described methods.
While given components of the system have been described separately, one of ordinary skill will appreciate that some of the functions may be combined or shared in given instructions, program sequences, code portions, and the like.
While given components of the system have been described separately, one of ordinary skill will appreciate that some of the functions may be combined or shared in given instructions, program sequences, code portions, and the like. Any application or functionality described herein may be implemented as native code, by providing hooks into another application, by facilitating use of the mechanism as a plug-in, by linking to the mechanism, and the like.
Having described our invention, what we now claim is as follows.
Number | Name | Date | Kind |
---|---|---|---|
8374188 | Yahyaoui | Feb 2013 | B2 |
20040139228 | Takeda | Jul 2004 | A1 |
20090215438 | Mittal | Aug 2009 | A1 |
20100027418 | Rodrig | Feb 2010 | A1 |
20100100630 | Jiang | Apr 2010 | A1 |
20100257276 | Savolainen | Oct 2010 | A1 |
20110055392 | Shen | Mar 2011 | A1 |
20120099599 | Keranen | Apr 2012 | A1 |
Entry |
---|
J. Rosenberg, R. Mahy, P. Matthews, Traversal Using Relays around NAT (TURN): Relay Extensions to session Traversal Utilities for NAT (STUN), Jul. 3, 2009, Internet Engineering Task Force (IETF), draft-ietf-behave-turn-16, pp. 1-81. |
Number | Date | Country | |
---|---|---|---|
20150381566 A1 | Dec 2015 | US |
Number | Date | Country | |
---|---|---|---|
61428875 | Dec 2010 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14082635 | Nov 2013 | US |
Child | 14852655 | US | |
Parent | 13339479 | Dec 2011 | US |
Child | 14082635 | US |