Peer communication channel partitioning

Description

FIELD OF THE INVENTION

[0001] The invention generally relates to distributed computing architectures. More specifically, the invention relates to enabling peers to communicate with each other.

BACKGROUND OF THE INVENTION

[0002] Distributed computing systems are generally known in the art. However, known distributed computing systems typically divide a single large computing task into sub-tasks, and each participant in the distributed computing system performs or solves the sub-task that it was given. In addition, each distributed computer generally only works on its assigned sub-task when its processor or other resources necessary to the sub-task would otherwise be idle.

[0003] For example, one known distributed computing system is the Intel-United Devices Cancer Research Project sponsored by United Devices, Inc. of Austin, Tex. and Intel Corporation of Santa Clara, Calif. The Cancer Research Project allows PC owners to volunteer idle processor time on their own computers to help find a cure for cancer. Each user downloads a software client that periodically receives a research sub-task from a server, and performs the sub-task when the local computer processor would otherwise be idle. Upon completion of the sub-task, the local client sends the results to the server, and receives a new sub-task. At all times the local client is dependent on the central server that divides the task into sub-tasks and assigns sub-tasks to volunteer client machines. In addition, each client does not contribute to the computing space except that the client performs an assigned sub-task. That is, each client only executes sub-tasks defined by the server; because each client is not capable of executing any arbitrary application program

[0004] Another known pseudo-distributed computing space is demonstrated by online role-playing games such as Ultima Online®. In an online role-playing game (RPG), each remote user typically must log in to a central server that administers and oversees the game playing of the RPG. The virtual world in which characters live is defined by and maintained by the central server, and appears identical to each remote client (player characters) connected to that central server. In addition, all interaction between players goes through the central server. Thus, while online RPGs may be thought of as distributed computing environments, they are in reality large client-server applications.

[0005] The prior art may necessitate that a node (associated with a client or a peer) in a fully connected distributed system may need to know about addresses of every other node in the distributed computing environment or may need to know about a subset of the other nodes and about an associated network topology. In either case, the amount of information may be quite formidable with a large distributed computing environment.

[0006] Also, the need to know about every other node in the distributed computing environment may pose a security and privacy problem while necessitating an additional task of updating the node as the configuration of the distributed computing environment changes.

[0007] Thus, it would be an advancement in the art to provide a method or apparatus in which a node knows only about a subset of the other nodes in the distributed computing environment without the need to know about the network topology while the distributed computing environment maintains fully connected properties. It would be a further advancement in the art if the computing space provided both scalability and security.

BRIEF SUMMARY OF THE INVENTION

[0008] The inventive method and system overcome the problems of the prior art by providing a partitioning (which may correspond to a subset of IP addresses) in an unbounded computing space, in which nodes may communicate with each other. In an embodiment of the invention, a node registers with a discovery system in order to obtain an address window. The node communicates only with nodes in the address window. Even though a partition corresponds to a subset of the nodes in the unbounded computing space, the partition overlaps with partitions of other nodes so that all nodes may interact either directly or indirectly. Because the node may be cognizant of a small subset of active nodes in the unbounded computing space, the length of messaging between the discovery system and the node is constrained, thus providing scalability as the number of nodes within the unbounded computing space increases. In addition, because the node has a limited knowledge of other nodes, security is enhanced.

BRIEF DESCRIPTION OF THE DRAWINGS

[0009] A more complete understanding of the present invention and the advantages thereof may be acquired by referring to the following description in consideration of the accompanying drawings, in which like reference numbers indicate like features, and wherein:

[0010]
FIG. 1 illustrates a schematic diagram of an exemplary general-purpose digital computing environment that may be used to implement various aspects of the invention.

[0011]
FIG. 2 illustrates a schematic diagram of an unbounded computer space according to an illustrative embodiment of the invention.

[0012]
FIG. 3 illustrates a screenshot of a user interface for an unbounded computing space used as an unbounded gaming application according to an illustrative embodiment of the invention.

[0013]
FIG. 4 shows a first process in which a discovery system provides an address window to a node according to an illustrative embodiment of the invention.

[0014]
FIG. 5 shows a second process in which a discovery system provides an address window to a node according to an illustrative embodiment of the invention.

[0015]
FIG. 6 shows a process in which a node de-registers with a discovery system according to an illustrative embodiment of the invention.

[0016]
FIG. 7 shows a third process in which a discovery system provides an address window to a node according to an illustrative embodiment of the invention.

[0017]
FIG. 8 shows a process in which a receiving node receives a message from another peer according to an illustrative embodiment of the invention.

[0018]
FIG. 9 shows a process in which a transmitting node transmits a message to another peer according to an illustrative embodiment of the invention.

DETAILED DESCRIPTION OF THE INVENTION

[0019] Aspects of the invention provide an unbounded computing space in which programs can execute. One or more aspects of the invention are applicable to any general purpose computing platform capable of running a variety of operating systems, virtual machines, and applications, including PCs running WINDOWS®, LINUX®, MacOS®, or SOLARIS® brand operating systems and the like, as well as PDA devices, Tablet PCs, pen-based computers, and other data processing systems.

[0020]
FIG. 1 illustrates a schematic diagram of an exemplary conventional general-purpose digital computing environment that may be used to implement various aspects of the invention. In FIG. 1, a computer 100 includes a processing unit 110, a system memory 120, and a system bus 130 that couples various system components including the system memory to the processing unit 110. The system bus 130 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. The system memory 120 includes read only memory (ROM) 140 and random access memory (RAM) 150.

[0021] A basic input/output system 160 (BIOS), containing the basic routines that help to transfer information between elements within the computer 100, such as during start-up, is stored in the ROM 140. The computer 100 also includes a hard disk drive 170 for reading from and writing to a hard disk (not shown), a magnetic disk drive 180 for reading from or writing to a removable magnetic disk 190, and an optical disk drive 191 for reading from or writing to a removable optical disk 192, such as a CD ROM or other optical media. The hard disk drive 170, magnetic disk drive 180, and optical disk drive 191 are connected to the system bus 130 by a hard disk drive interface 192, a magnetic disk drive interface 193, and an optical disk drive interface 194, respectively. The drives and their associated computer-readable media provide nonvolatile storage of computer readable instructions, data structures, program modules, and other data for the personal computer 100. It will be appreciated by those skilled in the art that other types of computer readable media that may store data that is accessible by a computer, such as magnetic cassettes, flash memory cards, digital video disks, Bemoulli cartridges random access memories (RAMs), read only memories (ROMs), and the like, may also be used in the example operating environment.

[0022] A number of program modules may be stored on the hard disk drive 170, magnetic disk 190, optical disk 192, ROM 140, or RAM 150, including an operating system 195, one or more application programs 196, other program modules 197, and program data 198. A user may enter commands and information into the computer 100 through input devices, such as a keyboard 101 and a pointing device 102. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices often are connected to the processing unit 110 through a serial port interface 106 that is coupled to the system bus 130, but may be connected by other interfaces, such as a parallel port, game port, or a universal serial bus (USB). Further still, these devices may be coupled directly to the system bus 130 via an appropriate interface (not shown). A monitor 107 or other type of display device is also connected to the system bus 130 via an interface, such as a video adapter 108. In addition to the monitor 107, personal computers typically include other peripheral output devices (not shown), such as speakers and printers. As one example, a pen digitizer 165 and accompanying pen or user input device 166 are provided in order to digitally capture freehand input. The pen digitizer 165 may be coupled to the processing unit 110 via the serial port interface 106 and the system bus 130, as shown in FIG. 1, or through any other suitable connection. Furthermore, although the digitizer 165 is shown apart from the monitor 107, the usable input area of the digitizer 165 may be co-extensive with the display area of the monitor 107. Further still, the digitizer 165 may be integrated in the monitor 107, or may exist as a separate device overlaying or otherwise appended to the monitor 107.

[0023] The computer 100 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 109. The remote computer 109 may be a server, a router, a network PC, a peer device, or other common network node, and typically includes many or all of the elements described above relative to the computer 100, although only a memory storage device 111 with related applications programs 196 have been illustrated in FIG. 1. The logical connections depicted in FIG. 1 include a local area network (LAN) 112 and a wide area network (WAN) 113. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets, and the Internet.

[0024] When used in a LAN networking environment, the computer 100 is connected to the local network 112 through a network interface or adapter 114. When used in a WAN networking environment, the personal computer 100 typically includes a modem 115 or other means for establishing a communications link over the wide area network 113, e.g., to the Internet. The modem 115, which may be internal or external, is connected to the system bus 130 via the serial port interface 106. In a networked environment, program modules depicted relative to the personal computer 100, or portions thereof, may be stored in a remote memory storage device.

[0025] It will be appreciated that the network connections shown are exemplary and other techniques for establishing a communications link between the computers may be used. The existence of any of various well-known protocols such as TCP/IP, Ethernet, FTP, HTTP and the like is presumed, and the system may be operated in a client-server configuration to permit a user to retrieve web pages from a web-based server. Any of various conventional web browsers may be used to display and manipulate data on web pages.

[0026] With reference to FIG. 2, an unbounded computing space (UCS) 200 includes one or more independent nodes 201, 211, 221, 231, 241 and a discovery system 253. Nodes 201, 211, 221, 231, and 241 are peers of each other. Discovery system 253 may be a server that provides a discovery functionality for unbounded computing space 200. Each node that is a part of the unbounded computing space 200 provides an environment in which software programs, referred to as independent agents, can run. In addition, because each node added to unbounded computing space 200 may have a different configuration from the other nodes (e.g., varying software, resources, hardware, attached peripheral devices, etc.), each node provides a unique computing space. Thus, two different nodes executing the same independent agent may yield different results.

[0027] Each node in the unbounded computing space may be thought of similar to a plot of land, with unique characteristics, that executes independent agents received from other nodes within the unbounded computing space. Thus, as each node is added to the unbounded computing space 200, the environment in which independent agents can run increases. Likewise, as nodes are removed from the unbounded computing space 200 (e.g., as a result of a user closing the node application program executing on a computer system), the environment in which independent agents can execute decreases.

[0028] The individual nodes that make up the unbounded computing space may depend upon a server for the receipt of independent agent software modules. That is, each node in the unbounded computing space can introduce an independent agent, which may subsequently be copied or transferred to another node within the unbounded computing space.

[0029] A node 201 in unbounded computing space 200 includes a peer discovery module 203 and a peer interaction module 205, and often (but not always) includes one or more independent agents 207, 209. Node 201 calls peer discovery module 203 to detect other nodes within the unbounded computing space, and calls peer interaction module 205 to interact with the other detected nodes, e.g., by sending an independent agent to another node and communicating with discovery system 253. As stated above, independent agent 207 or 209 is a code assembly that uses the interaction module to travel to and execute on another node or nodes within the unbounded computing space to perform a function Independent agents can be transported or copied from one node to another, optionally maintaining state information between nodes.

[0030] Peer discovery module 203 may communicate with discovery system 253 that maintains a list of active nodes in the unbounded computing space 200. Each new node, upon initialization, may register with discovery system 253 and consequently obtain a listing of a subset of active nodes within the unbounded computing space 200. Each node may subsequently receive an updated list of active nodes in predetermined intervals (e.g., every 2 minutes, 5 minutes, 15 minutes, etc.). According to one aspect of the invention, discovery system 253 may provide to a requesting node a list of the n nodes, where each of the n nodes have the closest IP addresses relative to other nodes.

[0031] Discovery system 253 in unbounded computing space 200 comprises a discovery module 255 and a system interaction module 257. Discovery system 253 utilizes system interaction module 257 to communicate with nodes 201, 211, 221, 231, and 241. Also, discovery system 253 utilizes discovery module 255 in order to maintain a list of active nodes in unbounded computing space 200 in accordance with communications (e.g. registrations) with the active nodes. (A process for maintaining the list of active nodes is discussed in the context of FIGS. 4, 5, 6, and 7.) Discovery system 253 uses system interaction module 257 in order to send a message that conveys an appropriate subset of the list of active nodes when communicating with a node (e.g. when node 201 registers).

[0032] Unbounded computing space 200 may also include additional nodes 211, 221, 231, 241, with respective peer discovery modules 213, 223, 233, 243, peer interaction modules 215, 225, 235, 245, and independent agents 217, 227, 237. Nodes, generally, are embodied in computer systems interconnected via a network 251 such as the Internet, a LAN, WAN, intranet, etc. Each node may vary in composition from system to system, provided each node can understand the other nodes within the unbounded computing space, e.g., by using a common communication protocol. That is, each node can use a unique algorithm to create and define a computing space that is represented by the node.

[0033] In one illustrative example, with reference to FIG. 3, nodes may represent physical terrain in a virtual world. FIG. 3 illustrates a user interface for a terrain node 301 that is part of an unbounded computing space that interacts to play a game. Each independent agent 303, 305 may represent an animal or plant that lives and grows (and potentially dies) on the terrain in the virtual world, and that may be transported from one terrain node to another terrain node. Another independent agent 307 might execute only on the terrain node on which it is initially introduced and launched. In this example, independent agent 307 represents a sphere that randomly travels around the terrain of its local terrain node and, upon hitting an independent agent representing an animal or plant, causes the local terrain node to “teleport” the animal or plant to another random terrain node within the unbounded computing space by copying the independent agent to another terrain node along with the current state information of the independent agent. FIG. 3 illustrates only a portion of the terrain of the terrain node 301. Map 309 illustrates the entire terrain located on terrain node 301, and box 311 indicates the visible portion shown in window 313.

[0034]
FIG. 4 shows a process 400 in which discovery system 253 provides an address window to a node (e.g. nodes 201, 211, 221, 231, or 241) according to an illustrative embodiment of the invention. The node may directly send or receive a message from another node only if a corresponding IP address of the other node is contained in the address window provided by discovery system 253. (A message may comprise information and agent passing that is included in a payload of an IP message.) In step 401, the node (also referred to as a peer) registers with discovery system 253 when the node wishes to participate with unbounded computing space 200. In the embodiment, the node may send an IP message. (Other embodiments may utilize other messaging protocols.) In step 403, discovery system 253 (utilizing system interaction module 257) determines the IP address of the node. With IPv4 the IP address corresponds to a 32-bit address, while with IPv6 the IP address corresponds to a 128-bit address. However, other embodiments may utilize another identifying attribute rather than the IP address. For example, another embodiment may utilize the name of a user associated with the node in which the name is expressed in an alphanumeric string.

[0035] Discovery system 253 stores the IP address into a data structure that may be external or internal to discovery system 253 in step 405. In step 407, discovery system 253 sorts the IP addresses that correspond to the active nodes, e.g. the nodes in unbounded computing space 200 that have registered with discovery system 200. Discovery system determines an address window in step 409. In the embodiment, discovery system provides N (e.g. 20) neighboring IP addresses (of other active nodes) that are near the IP address of the node. M (e.g. 5) neighboring IP addresses may precede (i.e. be less than) the IP address of the node while N-M (e.g. 15) IP addresses may succeed (i.e. be greater than) the IP address of the node. If the end of the IP list (as stored in the data structure) is reached, discovery system 253 “wraps-around” to the beginning of the IP list. Discovery system 253 returns an address window in step 411, comprising a subset of the sorted neighboring IP addresses, to the node. (In the embodiment, steps 401, 403, and 411 correspond to system interaction module 257, while steps 405, 407, and 409 correspond to system discovery module 255.)

[0036] The IP address of the node (in accordance with IPv4) comprises 4 bytes and may be written as a decimal integer separated by periods (e.g. 192.19.241.18). The IP address comprises two components: a network-prefix portion and a host portion. As an example of the illustrative embodiment, the IP address of the node (e.g. node 201) is 129.61.18.26. The IP address window in the example may be represented as a set of neighboring IP addresses comprising {. . . , 101.33.16.04, 129.61.18.05, 129.61.18.31, 129.71.2 1.01, . . . }, in which the neighboring IP addresses are ordered according to the magnitudes of the corresponding decimal representations of the neighboring IP addresses.

[0037] The parameter N (associated with the number of neighboring IP addresses in the IP address window) and the parameter M (associated with the number of neighboring IP addresses less than the IP address of the node) may be selected in order to improve the operation of unbounded computing space 200. In general, increasing parameters N and M enhances the communicability among the nodes but increases the message length for a message (that may convey the IP address window) between discovery system 253 and the node and may decrease a degree of security in that the node is cognizant of a greater number of neighboring nodes. Also, depending upon the selection of M, the number of preceding neighboring IP addresses and the number of succeeding neighboring IP addresses may or may not be equal. If the number of preceding neighboring IP addresses is not equal to the number of succeeding neighboring IP addresses in an IP address window, then the node may be cognizant of a neighboring node even though the neighboring node is not cognizant of the node. Parameters N and M may be adjusted in accordance with a degree of activity within unbounded computing space 200. Typically, parameters N and M increase as the number of active nodes increases. However, an administrator of unbounded computing space 200 may decrease parameters N and M as the activity increases in order to avoid congestion of network 251 or processing overload of discovery system 253.

[0038]
FIG. 5 shows a process 500 in which discovery system 253 provides an address window to a node according to an illustrative embodiment of the invention. Steps 501, 503, 507, 509, 511, and 513 correspond to steps 401, 403, 405, 407, 409, and 411 respectively as shown in FIG. 4. However, if a node periodically registers with discovery system 253 in order to obtain an updated address window, discovery system 553 determines whether the node has previously registered in step 505. If so, the IP address list is not updated.

[0039]
FIG. 6 shows a process 600 in which a node de-registers with discovery system 253 according to an illustrative embodiment of the invention. In step 601, the node de-registers with discovery system 253. As with registration (steps 401 and 501), the node may send an IP message with the IP address of the node. In step 603, discovery system 253 identifies the IP address and removes the IP address from the data structure in step 605. In step 607, discovery system 253 sorts the data structure in order to update the IP address list. In other embodiments, step 607 may be eliminated if, for example, the data structure is a structured as a linked list.

[0040]
FIG. 7 shows a process 700 in which discovery system 253 provides an address window to a node according to an illustrative embodiment of the invention. In step 701, the node reports that another node has been non-responsive to messages sent to the other node even though the IP address of the other node is contained in the node's address window. Discovery system 253 determines the IP address of the reporting node and the IP address of the non-responsive node in step 703. Discovery system 253 removes the IP address of the non-responsive node from the IP address list in step 705, and the updated IP address list is sorted in step 707. In other embodiments, step 707 may be eliminated if, for example, the data structure is a structured as a linked list. In step 709, discovery system 253 determines the address window for the node in step 709 and returns the address window to the node in step 711.

[0041]
FIG. 8 shows a process 800 in which a receiving node receives a message from another node according to an illustrative embodiment of the invention. If the node receives a message from another node, which has an IP address that is not contained in the receiving node's address window (as determined in step 803), the receiving node may either ignore the message or return a non-acknowledgment message to the other node in step 805. Otherwise, the receiving node will process the message in step 807.

[0042]
FIG. 9 shows a process 900 in which a transmitting node transmits a message to another node according to an illustrative embodiment of the invention. The transmitting node decides to send a message (e.g. an independent agent that is executing on the transmitting node wants to request an update). The transmitting node determines the IP address of the other node in step 903. In the embodiment, the transmitting node restricts communication only to other nodes that correspond to the transmitting node's address window. If the other node does not respond to the transmitted message, the transmitting node marks the other node as being non-responsive in step 907. Otherwise, the transmitting node processes the response in step 909.

[0043] The following table provides an example in accordance with an embodiment of the invention. The example is intended for exemplary purposes. However, unbounded computing space 200 may support thousands or more nodes, and consequently address window parameters may be configured differently in other embodiments than in the example. The table depicts fourteen IP address entries for an address list that is maintained by discovery system 253. Each node (e.g. node A, node B, node C, node D, and node E may correspond to nodes 201, 211, 221, 231, and 241) is assigned an address window. Node A, node B, node C, node D, and node E correspond to IP addresses 01.123.02.131, 11.61.18.26, 12.14.100.201, 129.99.51.101, and 129.99.51.102, respectively. Discovery system 253 assigns address windows WA, WB, WC, WD, and WE to nodes A, B, C, D, and E, respectively. In the example, each address window of a node comprises two IP addresses that precede the IP address of the node and five IP addresses that succeed the IP address of the node. Thus, the window size is equal to seven, in which each node is cognizant of seven other nodes in unbounded computing space 200. If the lower address boundary or the upper address boundary of the address list is encountered when assigning IP address for an address window, discovery system 253 wraps-around to the other boundary of the address list. Even though a node may not be able to communicate with another node, the node may be able to interact indirectly with the other node. For example, Node A can communicate with node E (corresponding to IP address 129.99.51.102) but cannot communicate with a third node having an IP address corresponding to 131.21.18.19. However, for example, node A may indirectly interact with the third node if node A sends an agent program to node E and if node E subsequently sends the agent program to the third node.

1TABLEEXAMPLE FOR ASSIGNING ADDRESS WINDOWS TO NODESaddressaddressaddressaddressaddresswindowwindowwindowwindowwindowofofofofofnode Anode Bnode Cnode Dnode Eaddress list(WA)(WB)(WC)(WD)(WE)01.123.02.131node AWBWC11.61.18.26WAnode BWCWD12.14.100.201WAWBnode CWDWE129.99.51.101WAWBWCnode DWE129.99.51.102WAWBWCWDnode E129.99.51.104WAWBWCWDWE129.99.52.31WBWCWDWE131.21.18.19WCWDWE131.21.18.20WDWE131.21.18.118WE131.123.31.17199.13.18.3199.14.141.10WA201.155.31.18WAWB

[0044] While the invention has been described with respect to specific examples including presently preferred modes of carrying out the invention, those skilled in the art will appreciate that there are numerous variations and permutations of the above described systems and techniques that fall within the spirit and scope of the invention as set forth in the appended claims.

Claims

1. A first node module in which agent programs can execute, comprising: (a) a peer discovery module that receives a window in order to detect a second node module within a distributed computing architecture, wherein the window comprises a list of other node modules within the distributed computing architecture and wherein the list comprises the second node module; and (b) a peer interaction module through which the first node module communicates with the second node module in accordance with the window, wherein the window comprises an identifying attribute of the second node module, and wherein the first node module is capable of introducing an agent program that can be sent to the second node module, through the peer interaction module, and that can execute in the second node module.
2. The first node module of claim 1, wherein the identifying attribute of the second node module corresponds to an IP address that is assigned to the second node module.
3. The first node module of claim 1, wherein the peer discovery module receives the window from a discovery system.
4. A discovery system that is associated with an unbounded computing space, comprising: (a) a system interaction module through which the discovery system communicates with a first node module and determines a first identifying attribute of the first node module; and (b) a system discovery module that determines a window of the first node module in response to a message received from the first node module through the system interaction module, wherein the window comprises a list of other node modules within the distributed computing space, and wherein the list comprises a second node module that is associated with a second identifying attribute.
5. The discovery system of claim 4, wherein the first identifying attribute corresponds to a first IP address of the first node module and the second identifying attribute corresponds to a second IP address of the second node module.
6. A distributed computing architecture, comprising: (a) a plurality of node modules in which agent programs can execute, wherein the plurality of node modules comprises a first node module and a second node module, each node module comprising: (i) a peer discovery module that receives an address window of the first node module in order to detect the second node module within the distributed computing architecture; and (ii) a peer interaction module through which the first node module communicates with the second node module in accordance with the address window, wherein the address window comprises a second address of the second node module, and wherein the first node module is capable of introducing an agent program that can be sent to the second node module, through the peer interaction module, and execute on the second node module; and (b) at least one discovery system, each discovery system comprising: (i) a system interaction module through which the discovery system communicates with the first node module and determines an address of the first node module; and (ii) a system discovery module that determines the address window of the first node module in response to a message received from the first node module through the system interaction module, wherein the address window comprises the second address of a second node module.
7. A method for partitioning an unbounded computing space, the method comprising the steps of: (a) receiving a first notification from a first node in order to register the first node; (b) determining a first address that is associated with the first node; (c) entering the first address into a list of addresses; (d) selecting a subset of the list of addresses, the subset comprising addresses of other nodes that are associated with the unbounded computing space; and (e) providing a first address window to the first node, wherein the first address window comprises the subset of addresses.
8. The method of claim 7, wherein the list of addresses is associated with IP addresses.
9. The method of claim 7, further comprising the step of: (f) sorting the list of addresses.
10. The method of claim 7, further comprising the steps of: (f) receiving a second notification from the first node in order to provide an updated first address window; (g) selecting an updated subset of the list of addresses, wherein the updated subset is derived from the subset; and (h) providing the updated first address window to the first node, wherein the updated first address window comprises the updated subset of addresses.
11. The method of claim 7, further comprising the steps of: (f) receiving a second notification from the first node in order to remove the first node from the unbounded computing space; and (g) removing the first address from the list of addresses.
12. The method of claim 11, further comprising the step of: (h) sorting the list of addresses.
13. The method of claim 7, wherein a second address corresponding to a second node is contained in the address window, further comprising the steps of: (f) receiving a second notification from the first node that the second node is non-responsive; and (g) removing the second address from the list of addresses.
14. The method of claim 13, further comprising the step of: (h) sorting the list of addresses.
15. The method of claim 13, further comprising the step of: (i) providing an updated first address window to the first node.
16. The method of claim 7, wherein the first address window is configured by a first parameter that is associated with a window size and a second parameter that is associated with an overlap with a second address window, wherein the second address window is associated with a second node, and wherein the second node is associated with a closest address to the first address, the first address being associated with the first node.
17. The method of claim 16, further comprising the step of: (f) updating the first parameter in accordance with a degree of activity that is associated with the unbounded computing space.
18. The method of claim 16, further comprising the step of: (f) updating the second parameter in accordance with a degree of activity that is associated with the unbounded computing space.
19. A method for executing a program on a distributed computer system, the method comprising the steps of (a) sending, by a first node, a first notification in order to register the first node on the distributed computer system; (b) receiving, by the first node, a first address window; and (c) sending, by a first node, a first message to a second node only if an address of the second node is contained in the first address window.
20. The method of claim 19, wherein the first message is associated with a first agent program.
21. The method of claim 20, further comprising the steps of: (d) receiving, by the second node, a second address window; and (e) sending, by the second node, the first agent program to a third node only if an address of the third node is contained in the second address window.
22. The method of claim 19, further comprising the steps of: (d) accepting, by the first node, a second message from the second node only if the address of the second node is contained in the first address window.
23. The method of claim 22, wherein the second message is associated with a second agent program.
24. The method of claim 19, further comprising the steps of: (d) sending, by the first node, a second notification in order to obtain an updated first address window, in response to detecting an expiration of a preset time interval; (e) receiving, by the first node, the updated first address window; and (e) sending, by the first node, the first message to the second node only if the address of the second node is contained in the updated first address window.
25. The method of claim 19, further comprising the steps of: (d) determining, by the first node, that the second node is non-responsive; (e) sending, by the first node, a second notification that the second node is non-responsive; and (f) receiving, by the first node, an updated first address window.
26. The method of claim 19, further comprising the step of: (d) sending, by the first node, a second notification to request that the first node be removed from the distributed computer system.

Peer communication channel partitioning

Information

Publication Number

Date Filed

Date Published

Inventors

Original Assignees

CPC

US Classifications

International Classifications

Abstract

Description

Claims