Patent Application
20140189082
Not applicable.
Not applicable.
Not applicable.
A communications network may include nodes connected by links that enable communication between users. Each node in a network has a unique identifier (e.g., an Internet Protocol (IP) address) that enables data or connections to be routed to the correct recipient. Communications networks commonly rely on statically configured connectivity and routing, which can be manual, error prone, and rigid. Additionally, communications networks may require communication across different locales (e.g., across a wide area network). This cross-locale traffic can increase communication costs and decrease network performance, for example by increasing system latency.
In one embodiment, the disclosure includes an apparatus for communicating in a distributed system. The apparatus comprises an identifier space and a processor. The identifier space associates data in the distributed system with one or more ranges of values, and the processor distributes cross-locale routing and caching across local nodes in the distributed system using the one or more ranges of values.
In another embodiment, the disclosure includes a method for communicating in a distributed system. Identifiers for nodes in the distributed system are determined and are associated with locations on an identifier space. Cross-locale routing and caching across local nodes in the distributed system are distributed using the locations on the identifier space.
In yet another embodiment, the disclosure includes an apparatus for retrieving data in a distributed system. The apparatus comprises a processor that is configured to obtain an identifier for the data, locate a position of the identifier on an identifier space, and determine a local node that is responsible for the data based at least in part on the position.
These and other features will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings and claims.
For a more complete understanding of this disclosure, reference is now made to the following brief description, taken in connection with the accompanying drawings and detailed description, wherein like reference numerals represent like parts.
It should be understood at the outset that, although an illustrative implementation of one or more embodiments are provided below, the disclosed systems and/or methods may be implemented using any number of techniques, whether currently known or in existence. The disclosure should in no way be limited to the illustrative implementations, drawings, and techniques illustrated below, including the exemplary designs and implementations illustrated and described herein, but may be modified within the scope of the appended claims along with their full scope of equivalents. While certain aspects of conventional technologies have been discussed to facilitate the present disclosure, applicants in no way disclaim these technical aspects, and it is contemplated that the present disclosure may encompass one or more of the conventional technical aspects discussed herein.
Disclosed herein are systems and methods that enable local partitioning in a distributed communication system. In an embodiment, nodes and data in a communication system are dynamically mapped to a global identifier space. For example, in one implementation, a hash function is applied to a node or data key to generate a global identifier. The global identifiers can be used to determine which nodes are locally and globally responsible for data. This enables dynamic routing and distribution across a wide area global network resulting in more flexible and easier to manage deployment. Embodiments may also simplify network maintenance and replication across locales resulting in more cost effective availability and reduced cross-locale traffic. Additional features and benefits of embodiments of the present disclosure are discussed below.
Each node 120, 122, 124, 140, 142, and 144 is optionally an active electronic device that is attached to network 100 and is capable of sending, receiving, or forwarding information over a communications channel. Some examples of nodes include data circuit-terminating equipment (DCE) such as a modem, hub, bridge, or switch, and data terminal equipment (DTE) such as a digital telephone handset, a printer, a host computer, a router, a workstation, or a server. In one particular embodiment, for illustration purposes only and not by limitation, a node comprises a Unified Communication Application Server. However, embodiments are not limited to any particular type of node.
Network 100 connects nodes 120, 122, 124, 140, 142, and 144 together using links that enable telecommunication between nodes 120, 122, 124, 140, 142, and 144. Each node 120, 122, 124, 140, 142, and 144 in network 100 has a unique address such that messages or connections can be routed to the correct node. The collection of addresses in network 100 is called a global identifier space 160.
Global identifier space 160 is represented in
Each node 120, 122, 124, 140, 142, and 144 (shown in
As previously mentioned, node 120 (shown in
The second interval 224 includes the portion of the global identifier space 160 that is between locations 170 and 174. Node 120 is locally responsible for any data having an identifier that is located within interval 224. For instance, node 120 provides data having an identifier located within interval 224 to other nodes in its locale (e.g. nodes 122 and 124 in
The local interval for a node is determined by identifying the location of the node's identifier on the global identifier space, and then moving counterclockwise along the global identifier space until the next node from the same locale is encountered. The local interval for the node is the interval between its identifier and the identifier of the next node from the same locale located counterclockwise from it. For example, node 140 (shown in
It is worth noting that the methods of assigning local and global intervals described above are given merely for illustration purposes only. Embodiments of the present disclosure can include any method for assigning local and global intervals. For example, in another embodiment, instead of local and global intervals corresponding to a single range of values, local and global nodes may correspond to a group of ranges. For example, one or both of a local and a global interval may include two or more discontinuous ranges of values. The groups of ranges are optionally in the form of a list of ranges or data segments. This may be useful to further randomize the assignments of data elements to nodes. Alternatively, other consistent hashing methods or any other methods of assigning data elements to nodes can also be used. Accordingly, embodiments of the present disclosure cover local and global intervals designed using any methodology and are not limited to the specific examples described above.
If the locally responsible node is also globally responsible for the data, then the method continues from block 308 to block 310 where the data is obtained from the locally responsible node. If the locally responsible node is not globally responsible for the data, then the method continues from block 308 to block 312. At block 312, it is determined whether or not the locally responsible node has the data cached. If the locally responsible node has the data cached, then at block 314 the data is obtained from the locally responsible node's cache. If the locally responsible node does not have the data cached, then at block 316 the locally responsible node obtains the data from the globally responsible node and sends it to the requestor. At block 318, the locally responsible node optionally caches the data so that if the same data is needed again that it can retrieve the data from its cache instead of having to retrieve the data from the globally responsible node.
Each group of nodes is associated with multiple users. For instance, in
Network 400 also includes a wide area network (WAN) 440 that enables communications across the locales. For instance, WAN 440 enables a communication 441 between nodes 415 and 421, and a communication 442 between nodes 415 and 431. In an embodiment, communications across the WAN 440 may be reduced by utilizing the local partitioning and data retrieval methods described above. For example, if user 418 needs to obtain data (e.g., IP addresses) from users 428 and 438 in different locales, user 418 does not need to communicate across the WAN 440. Instead, user 418 can communicate 419 with a local node 415 that is locally responsible for the data. Accordingly, network latency may be reduced by limiting cross-locale communications.
Local cache 600 may also store other information. In the specific example shown in the figure, local cache 600 includes a last used metric 604 and a frequency metric 606 for each key 602. These metrics can be used to manage the cache. For instance, the last used metric 604 can represent how recently data in the cache was used, and the frequency metric 606 can represent how frequently data in the cache is used. The local cache 600 may utilize this information to retain data that was used more recently and/or that is used more frequently. This can improve system performance by making it more likely that the local cache 600 will have data that is needed, as compared to data that has not been used recently and/or is infrequently used.
As has been described above, embodiments of systems and methods provide local partitioning in a distributed communication system. Cross-locale nodes are associated based on overlapping of locally assigned key partitions in a global node identifier space. This enables distributing cross-locale routing and caching across local nodes based on the associations. The dynamic routing and distribution across a wide area global deployment may result in more flexible and easier to manage deployment. Additionally, the location independence of services may result in more efficient mobility. Some other potential benefits include simplifying network maintenance and replication across locations, reduced WAN traffic, and better resiliency to node and WAN failures. Embodiments are not however limited to any particular benefits or features, and may include any one or more of the features described above or shown in the figures.
The schemes described above may be implemented on any general-purpose network component, such as a computer or network component with sufficient processing power, memory resources, and network throughput capability to handle the necessary workload placed upon it.
The secondary storage 704 is typically comprised of one or more disk drives or tape drives and is used for non-volatile storage of data and as an over-flow data storage device if the RAM 708 is not large enough to hold all working data. The secondary storage 704 may be used to store programs that are loaded into the RAM 708 when such programs are selected for execution. The ROM 706 is used to store instructions and perhaps data that are read during program execution. The ROM 706 is a non-volatile memory device that typically has a small memory capacity relative to the larger memory capacity of the secondary storage 704. The RAM 708 is used to store volatile data and perhaps to store instructions. Access to both the ROM 706 and the RAM 708 is typically faster than to the secondary storage 704.
At least one embodiment is disclosed and variations, combinations, and/or modifications of the embodiment(s) and/or features of the embodiment(s) made by a person having ordinary skill in the art are within the scope of the disclosure. Alternative embodiments that result from combining, integrating, and/or omitting features of the embodiment(s) are also within the scope of the disclosure. Where numerical ranges or limitations are expressly stated, such express ranges or limitations should be understood to include iterative ranges or limitations of like magnitude falling within the expressly stated ranges or limitations (e.g., from about 1 to about 10 includes, 2, 3, 4, etc.; greater than 0.10 includes 0.11, 0.12, 0.13, etc.). For example, whenever a numerical range with a lower limit, R1, and an upper limit, Ru, is disclosed, any number falling within the range is specifically disclosed. In particular, the following numbers within the range are specifically disclosed: R=R1+k*(Ru−R1), wherein k is a variable ranging from 1 percent to 100 percent with a 1 percent increment, i.e., k is 1 percent, 2 percent, 3 percent, 4 percent, 5 percent, . . . , 70 percent, 71 percent, 72 percent, . . . , 95 percent, 96 percent, 97 percent, 98 percent, 99 percent, or 100 percent. Moreover, any numerical range defined by two R numbers as defined in the above is also specifically disclosed. The use of the term about means +/−10% of the subsequent number, unless otherwise stated. Use of the term “optionally” with respect to any element of a claim means that the element is required, or alternatively, the element is not required, both alternatives being within the scope of the claim. Use of broader terms such as comprises, includes, and having should be understood to provide support for narrower terms such as consisting of, consisting essentially of, and comprised substantially of. Accordingly, the scope of protection is not limited by the description set out above but is defined by the claims that follow, that scope including all equivalents of the subject matter of the claims. Each and every claim is incorporated as further disclosure into the specification and the claims are embodiment(s) of the present disclosure. The discussion of a reference in the disclosure is not an admission that it is prior art, especially any reference that has a publication date after the priority date of this application. The disclosure of all patents, patent applications, and publications cited in the disclosure are hereby incorporated by reference, to the extent that they provide exemplary, procedural, or other details supplementary to the disclosure.
While several embodiments have been provided in the present disclosure, it may be understood that the disclosed systems and methods might be embodied in many other specific forms without departing from the spirit or scope of the present disclosure. The present examples are to be considered as illustrative and not restrictive, and the intention is not to be limited to the details given herein. For example, the various elements or components may be combined or integrated in another system or certain features may be omitted, or not implemented.
In addition, techniques, systems, subsystems, and methods described and illustrated in the various embodiments as discrete or separate may be combined or integrated with other systems, modules, techniques, or methods without departing from the scope of the present disclosure. Other items shown or discussed as coupled or directly coupled or communicating with each other may be indirectly coupled or communicating through some interface, device, or intermediate component whether electrically, mechanically, or otherwise. Other examples of changes, substitutions, and alterations are ascertainable by one skilled in the art and may be made without departing from the spirit and scope disclosed herein.
