会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Content associative caching method for web applications
    • Web应用程序的内容关联缓存方法
    • US08793307B2
    • 2014-07-29
    • US12695996
    • 2010-01-28
    • Wei LuJamshid MahdaviDarrell Long
    • Wei LuJamshid MahdaviDarrell Long
    • G06F15/16
    • H04L67/2842
    • A cache logically disposed in a communication path between a client and a server receives a request for a content item and, in response thereto, requests from the server header information concerning the content item and an initial portion of data that makes up the content item. The cache then computes a first hashing value from the header information and a second hashing value from the initial portion of data. A content identifier is created by combining the first hashing value and the second hashing value. Using the content identifier, the cache determines whether a copy of the content item is stored by the cache; and, if so provides same to the client. Otherwise, the cache requests the content item from the server and, upon receipt thereof, provides it to the client.
    • 逻辑上设置在客户端和服务器之间的通信路径中的高速缓存器接收对内容项目的请求,并响应于此,来自服务器的关于内容项目的信息的请求以及组成内容项的数据的初始部分。 然后,高速缓存从头信息计算第一散列值,并从数据的初始部分计算第二哈希值。 通过组合第一哈希值和第二散列值来创建内容标识符。 使用内容标识符,缓存确定高速缓存是否存储内容项的副本; 如果是这样,给客户端一样。 否则,高速缓存从服务器请求内容项,并在接收到该内容时将其提供给客户端。
    • 2. 发明申请
    • CONTENT ASSOCIATIVE CACHING METHOD FOR WEB APPLICATIONS
    • WEB应用的内容相关缓存方法
    • US20100191805A1
    • 2010-07-29
    • US12695996
    • 2010-01-28
    • Wei LuJamshid MahdaviDarrell Long
    • Wei LuJamshid MahdaviDarrell Long
    • G06F15/16G06F12/08
    • H04L67/2842
    • A cache logically disposed in a communication path between a client and a server receives a request for a content item and, in response thereto, requests from the server header information concerning the content item and an initial portion of data that makes up the content item. The cache then computes a first hashing value from the header information and a second hashing value from the initial portion of data. A content identifier is created by combining the first hashing value and the second hashing value. Using the content identifier, the cache determines whether a copy of the content item is stored by the cache; and, if so provides same to the client. Otherwise, the requests the content item from the server and, upon receipt thereof, provides it to the client.
    • 逻辑上设置在客户端和服务器之间的通信路径中的高速缓存器接收对内容项目的请求,并响应于此,来自服务器的关于内容项目的信息的请求以及组成内容项的数据的初始部分。 然后,高速缓存从头信息计算第一散列值,并从数据的初始部分计算第二哈希值。 通过组合第一哈希值和第二散列值来创建内容标识符。 使用内容标识符,缓存确定高速缓存是否存储内容项的副本; 如果是这样,给客户端一样。 否则,请求来自服务器的内容项,并在收到时将其提供给客户端。
    • 6. 发明申请
    • Reliable leader election in storage area network
    • 可靠的领导选举在存储区域网络
    • US20050132154A1
    • 2005-06-16
    • US10678858
    • 2003-10-03
    • Sudhir RaoRobert ReesRandal BurnsDarrell Long
    • Sudhir RaoRobert ReesRandal BurnsDarrell Long
    • G06F12/00G06F13/00G06F15/16
    • H04L67/1097G06F11/1425H04L67/322
    • A method and system for election of a cluster leader in a storage area network is provided Each node in a grouping of storage area network nodes communicates with each of the nodes on a periodic basis to determine if any of the nodes have failed (42). In the event of a cluster fault, each node may request a position of cluster leader. A pruning protocol (60) is invoked to ensure efficient convergence of a single cluster leader candidate to favor a majority grouping leader candidate to become the new cluster leader. In the event the leader candidate from the majority grouping has failed to become the new cluster leader, a minority grouping leader candidate can become the cluster leader. Following the pruning protocol, a voting protocol (100) is invoked followed by lock of the quorum disk (138) by the elected cluster leader candidate.
    • 提供了一种用于选择存储区域网络中的簇头的方法和系统,存储区域网络节点分组中的每个节点周期性地与每个节点进行通信,以确定任何节点是否已经失败(42)。 在发生群集故障的情况下,每个节点可以请求簇头的位置。 调用修剪协议(60)来确保单个群组领导候选人有效地融合,以支持多数群体领导候选人成为新的群组领导者。 如果大多数分组的领导候选人未能成为新的集群领导者,少数群体领导者候选人可以成为集群领导者。 根据修剪协议,调用投票协议(100),随后由选举的集群首领候选人锁定法定磁盘(138)。