公开(公告)号：US20090030881A1

公开(公告)日：2009-01-29

申请号：US11886845

申请日：2006-03-23

申请人： Cefn R Hoile ,  Erwin R Bonsma

发明人： Cefn R Hoile ,  Erwin R Bonsma

IPC分类号： G06F7/06 ,  G06F17/30

CPC分类号： G06F17/30861

摘要： Automatic publishing and retrieval in a networked community of computers based on a Small World Adaptive Network (SWAN) type of network. Each computer installs a program which automatically scans data items in its computer's environment to find unique IDs in accordance with UID templates. For each data item found containing a UID, a data record is created comprising the UID associated with the network address of the data item. If permitted by a ruleset, that data record is published to the network by creating a node having the (hashed) UID as its identity or by adding the network address of that data item to common ID lists of existing nodes having that same UID identity. A search request in respect of a UID will find a node and obtain all the network addresses in its list, enabling the requester to send retrieval requests for each corresponding data item.

摘要翻译： 基于小型世界自适应网络（SWAN）网络的网络社区计算机自动发布和检索。 每台计算机都安装一个程序，可以自动扫描计算机环境中的数据项，以便根据UID模板查找唯一的ID。 对于包含UID的每个数据项，创建包括与数据项的网络地址相关联的UID的数据记录。 如果规则集允许，则通过创建具有（散列）UID作为其身份的节点或通过将该数据项的网络地址添加到具有相同UID身份的现有节点的公共ID列表来将该数据记录发布到网络。 关于UID的搜索请求将找到一个节点并获得其列表中的所有网络地址，使请求者能够发送每个相应数据项的检索请求。

公开(公告)号：US07787395B2

公开(公告)日：2010-08-31

申请号：US10558882

申请日：2004-09-17

申请人： Erwin R Bonsma

发明人： Erwin R Bonsma

IPC分类号： H04L12/28 ,  H04L12/50 ,  H04Q11/00 ,  G06F15/177

CPC分类号： H04L67/104 ,  H04L12/4641 ,  H04L45/02

摘要： Each node of a virtual network can store only a predetermined number of address links to other nodes. In response to receiving a link request between a first node and a second node, it is determined whether both the first and second nodes have less than the predetermined numbering their lists. If this condition is satisfied, the address of the first node is inserted into the second node's list and the address of the second node is inserted into the first node's list. If this condition is not satisfied, it is determined whether the first node list has at least two less than the predetermined number and, if so, then the link between the second and third nodes is broken and they are instead newly linked to the first node.

摘要翻译： 虚拟网络的每个节点只能存储预定数量的到其他节点的地址链路。 响应于在第一节点和第二节点之间接收到链路请求，确定第一节点和第二节点是否都具有小于其列表的预定编号。 如果满足该条件，则将第一节点的地址插入到第二节点的列表中，并将第二节点的地址插入到第一节点的列表中。 如果不满足该条件，则确定第一节点列表是否具有至少小于预定数量的两个，如果是，则第二节点和第三节点之间的链路被破坏，并且它们被新链接到第一节点 。

公开(公告)号：US07568049B2

公开(公告)日：2009-07-28

申请号：US10558883

申请日：2004-09-13

申请人： Erwin R Bonsma

发明人： Erwin R Bonsma

IPC分类号： G06F15/16 ,  G06F15/173

CPC分类号： H04L41/0893 ,  H04L29/12113 ,  H04L41/12 ,  H04L61/1541 ,  H04L67/02 ,  H04L67/104 ,  H04L67/1068

摘要： Nodes of a computer network are found by performing, in response to input of a label, a first retrieval operation (32) to identify the address of a node matching that label, and performing, in response to an address identified by the first retrieval means, a second retrieval operation (35) to identify the addresses of further nodes matching the same label. Each node matching a given label has a data storage area for containing the addresses of other nodes matching the same label and is responsive to inquiry messages to return a message containing the addresses of the list. The second retrieval operation includes sending an inquiry message to the address identified by the first retrieval means and upon receipt of a response iteratively sending further inquiry messages to addresses contained in the response to the previous inquiry message.

摘要翻译： 通过响应于标签的输入执行第一检索操作（32）来识别与该标签相匹配的节点的地址，并且响应于由第一检索装置识别的地址执行计算机网络的节点 ，第二检索操作（35），用于识别与相同标签匹配的其他节点的地址。 匹配给定标签的每个节点具有用于包含与相同标签相匹配的其他节点的地址的数据存储区域，并响应于查询消息返回包含列表地址的消息。 第二检索操作包括将查询消息发送到由第一检索装置识别的地址，并且在接收到响应时迭代地向另外的询问消息发送包含在对先前查询消息的响应中的地址的响应。

公开(公告)号：US08131690B2

公开(公告)日：2012-03-06

申请号：US11886845

申请日：2006-03-23

申请人： Cefn R Hoile ,  Erwin R Bonsma

发明人： Cefn R Hoile ,  Erwin R Bonsma

IPC分类号： G06F7/00

CPC分类号： G06F17/30861

摘要： Automatic publishing and retrieval in a networked community of computers based on a Small World Adaptive Network (SWAN) type of network. Each computer installs a program which automatically scans data items in its computer's environment to find unique IDs in accordance with UID templates. For each data item found containing a UID, a data record is created comprising the UID associated with the network address of the data item. If permitted by a ruleset, that data record is published to the network by creating a node having the (hashed) UID as its identity or by adding the network address of that data item to common ID lists of existing nodes having that same UID identity. A search request in respect of a UID will find a node and obtain all the network addresses in its list, enabling the requester to send retrieval requests for each corresponding data item.

摘要翻译： 基于小型世界自适应网络（SWAN）网络的网络社区计算机自动发布和检索。 每台计算机都安装一个程序，可以自动扫描计算机环境中的数据项，以便根据UID模板查找唯一的ID。 对于包含UID的每个数据项，创建包括与数据项的网络地址相关联的UID的数据记录。 如果规则集允许，则通过创建具有（散列）UID作为其身份的节点或通过将该数据项的网络地址添加到具有相同UID身份的现有节点的公共ID列表来将该数据记录发布到网络。 关于UID的搜索请求将找到一个节点并获得其列表中的所有网络地址，使请求者能够发送每个相应数据项的检索请求。

公开(公告)号：US07953875B2

公开(公告)日：2011-05-31

申请号：US10583964

申请日：2004-12-10

申请人： Erwin R Bonsma ,  Cefn R Hoile

发明人： Erwin R Bonsma ,  Cefn R Hoile

IPC分类号： G06F15/16

CPC分类号： G06F17/30864 ,  H04L29/12047 ,  H04L61/15 ,  H04L67/104 ,  H04L67/1068 ,  H04L67/1078

摘要： Computers store data items, each data item being assigned to one of a plurality of virtual directories. Each computer has at least one node of a virtual network for directory look-up, with linking data including addresses of other nodes associated with the same virtual directory and software that, in response to an enquiry message either replies, identifying itself or forwards the message to another node of the network, according to whether the node is or is not associated with the directory specified in the enquiry message.

摘要翻译： 计算机存储数据项，每个数据项被分配给多个虚拟目录之一。 每个计算机具有用于目录查找的虚拟网络的至少一个节点，链接数据包括与相同虚拟目录相关联的其他节点的地址以及响应于询问消息的回复，识别自身或转发消息的软件 根据该节点是否与查询消息中指定的目录相关联，来到网络的另一个节点。

公开(公告)号：US07805731B2

公开(公告)日：2010-09-28

申请号：US10468768

申请日：2002-03-01

申请人： Paul Marrow ,  Erwin R Bonsma ,  Cefn R Hoile ,  Fang Wang

发明人： Paul Marrow ,  Erwin R Bonsma ,  Cefn R Hoile ,  Fang Wang

IPC分类号： G06F15/16 ,  G06F9/54

CPC分类号： G06F9/544 ,  G06F9/468 ,  G06F9/485 ,  G06F9/4862

摘要： A system for distributed process management uses a plurality of units of software installed on a computing platform. Further software controls operation of the plurality of units in use. Each unit of software communicates with other units of software, and at least some of the units of software further provides one or more elements of a software process. The further software being capable of defining at least one set of software units and controlling communication by the units in the set to be limited to communication only with other units of the set

摘要翻译： 用于分布式过程管理的系统使用安装在计算平台上的多个软件单元。 进一步的软件控制使用中的多个单元的操作。 每个软件单元与其他软件单元通信，并且至少一些软件单元进一步提供软件过程的一个或多个元素。 所述另外的软件能够定义至少一组软件单元，并且控制由该组中的单元进行的通信，仅限于与该组的其它单元的通信

公开(公告)号：US07586853B2

公开(公告)日：2009-09-08

申请号：US10491086

申请日：2002-10-11

申请人： Erwin R. Bonsma ,  Cefn R. Hoile

发明人： Erwin R. Bonsma ,  Cefn R. Hoile

IPC分类号： H04L12/28

CPC分类号： H04L61/00 ,  H04L29/12009 ,  H04L45/44 ,  H04L67/104 ,  H04L67/1046 ,  H04L67/1048 ,  H04L67/1068 ,  H04L67/1072 ,  H04L69/329 ,  H04W8/26 ,  H04W64/00

摘要： In a communications network environment, nodes, such as personal computers, are assigned co-ordinates in a co-ordinate space which is independent of network address and physical location. Each node maintains links to a limited set of other nodes by storing the network addresses for those selected nodes. Each stored network address represents a link in co-ordinate space. It becomes possible for any node to obtain the network address for a target node by initiating a query message to a node for which it has the network address, which query message is propagated through the network between nodes which have the network address for a next node across co-ordinate space. When a receiving node finds it is the target node, or is as close in co-ordinate space as it is possible to forward the query message, it returns its own network address to the initiating node. This technique can also be used to retrieve information other than network addresses—such as objects.

摘要翻译： 在通信网络环境中，诸如个人计算机的节点在独立于网络地址和物理位置的协调空间中被分配坐标。 每个节点通过存储那些选定节点的网络地址来维护到有限的其他节点集合的链接。 每个存储的网络地址表示协调空间中的链接。 任何节点可以通过向具有网络地址的节点发起查询消息来获得目标节点的网络地址，该查询消息在具有下一个节点的网络地址的节点之间通过网络传播 跨坐标空间。 当接收节点发现它是目标节点时，或者在可能转发查询消息的情况下在协调空间中相同，则将其自己的网络地址返回给发起节点。 此技术也可用于检索除网络地址之外的信息（如对象）。