公开(公告)号：US06789255B1

公开(公告)日：2004-09-07

申请号：US09670116

申请日：2000-09-26

申请人： Raymond D. Pedrizetti ,  Scott D. Quinn ,  Timothy W. Bragg

发明人： Raymond D. Pedrizetti ,  Scott D. Quinn ,  Timothy W. Bragg

IPC分类号： G06F944

CPC分类号： G06F8/65

摘要： A low bandwidth link can be used optimally for software updates, by successively transferring more information about the updates only as the likelihood of an applicable update successively increases. A many-to-one mapping function (e.g. a hash function) is applied to update identifiers on a server to generate a table of single bit entries corresponding to the updates. At a client, the same mapping function is applied to program identifiers to determine whether the server has a potential update. If a potential update is noted, a second transmission is requested for conveying additional data from the server by which hash collisions can be identified. A third transmission from the server is received conveying the actual update only after the availability of an actual update (versus a hash collision) is confirmed. The same arrangement can be employed in reverse.

摘要翻译： 只有随着适用更新的可能性不断增加，连续传送有关更新的更多信息，才能最佳地利用低带宽链路进行软件更新。 应用多对一映射函数（例如，散列函数）来更新服务器上的标识符以生成与更新相对应的单个位条目的表。 在客户端，将相同的映射函数应用于程序标识符，以确定服务器是否具有潜在的更新。 如果注意到潜在的更新，则请求第二传输来传送来自服务器的附加数据，通过该数据可以识别哈希冲突。 仅在确认实际更新（相对于散列冲突）的可用性之后才接收到来自服务器的第三次传输，传送实际更新。 相反的布置可以反过来使用。

公开(公告)号：US6151708A

公开(公告)日：2000-11-21

申请号：US994594

申请日：1997-12-19

申请人： Raymond D. Pedrizetti ,  Scott D. Quinn ,  Timothy W. Bragg

发明人： Raymond D. Pedrizetti ,  Scott D. Quinn ,  Timothy W. Bragg

IPC分类号： G06F9/445 ,  G06F9/45

CPC分类号： G06F8/65

摘要： A set of software programs on a client computer is compared against a set of updates on a server computer to determine which updates are applicable and should be transferred from the server to the client. If the link between the client and server is slow, the listing of available updates must be represented in compact form. A many-to-one mapping function (e.g. a hash function) is applied to update identifiers to generate a table of single bit entries indicating the presence of particular updates on the server. This table is transferred to the client over the slow link. At the client, the same mapping function is applied to program identifiers, and corresponding entries of the transferred table are checked to determine whether the server has a potential update. If such a potential update is noted, a second transmission is requested by the client from the server--this one conveying additional data by which hash collisions can be identified by the client and disregarded. If availability of an actual update (versus a hash collision) is thereby confirmed, the client requests a third transmission from the server--this one conveying the actual update data. By this arrangement, optimized use is made of the low bandwidth link, with successively more information transferred as the likelihood of an applicable update is successively increased. (The same arrangement can be employed in reverse, with the bit table generated at the client and identifying program files available for possible updating, transferred to the server, etc.).

摘要翻译： 将客户端计算机上的一组软件程序与服务器计算机上的一组更新进行比较，以确定哪些更新是可应用的，并应从服务器传输到客户端。 如果客户端和服务器之间的链接速度较慢，则必须以紧凑的形式表示可用更新的列表。 应用多对一映射函数（例如散列函数）来更新标识符以生成指示在服务器上存在特定更新的单个位条目的表。 该表通过慢速链接传输到客户端。 在客户端，将相同的映射函数应用于程序标识符，并检查传输表的相应条目以确定服务器是否具有潜在的更新。 如果这样的潜在更新被注意到，客户端从服务器请求第二传输 - 这一个传送附加数据，通过该附加数据可以由客户端识别哈希冲突并被忽略。 如果由此确认了实际更新的可用性（相对于散列冲突），则客户机从服务器请求第三次传输 - 这是传送实际更新数据的传输。 通过这种安排，优化使用低带宽链路，随着连续更多的信息被传送，因为适用的更新的可能性被连续增加。 （相同的布置可以反过来使用，客户端产生的位表和识别可用于更新的程序文件，传输到服务器等）。