利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

11 条记录 (耗时 0.021 秒)

    USING PRESENCE PROXIES TO CONSTRAIN LOCAL PRESENCE INFORMATION TO A SUB-NETWORK WHILE USING A PRESENCE SERVER EXTERNAL TO THE SUB-NETWORK TO HANDLE OTHER PRESENCE INFORMATION
    1.
    发明申请
    USING PRESENCE PROXIES TO CONSTRAIN LOCAL PRESENCE INFORMATION TO A SUB-NETWORK WHILE USING A PRESENCE SERVER EXTERNAL TO THE SUB-NETWORK TO HANDLE OTHER PRESENCE INFORMATION 审中-公开
    使用现在的条款在本地存在信息的情况下，将现有的服务器外部使用到子网以控制其他存在信息

    公开(公告)号：US20080285540A1

    公开(公告)日：2008-11-20

    申请号：US11750566

    申请日：2007-05-18

    申请人： Erik J. Burckart ,  John P. Cammarata ,  Madhu Chetuparambil ,  Victor S. Moore

    发明人： Erik J. Burckart ,  John P. Cammarata ,  Madhu Chetuparambil ,  Victor S. Moore

    IPC分类号： H04L12/28

    CPC分类号： H04L67/24

    摘要： The present invention discloses a solution that uses presence proxies to handle local presence information while using a presence server to handle extra-local presence information. In the invention, a computing system can include multiple presence user agents (PUAs), multiple watchers, multiple presence proxies, and a presence server. The PUAs can be are grouped into two or more sub-networks. The watchers can also be grouped by sub-network. The PUAs and the watchers can each be associated with a presentity. A presence proxy can be associated with each of the sub-networks. Exclusively local presence services for each sub-network ears be handled by the associated presence proxy. The presence proxy can route presence information for other presence services (those not exclusively local) to and from the presence server.

    摘要翻译： 本发明公开了一种使用存在代理来处理本地呈现信息的解决方案，同时使用呈现服务器来处理额外的本地存在信息。 在本发明中，计算系统可以包括多个存在用户代理（PUAs），多个观察者，多个存在代理和存在服务器。 PUA可以被分组成两个或更多个子网络。 观察者也可以通过子网分组。 每个PUA和观察者都可以与一个呈现体相关联。 存在代理可以与每个子网络相关联。 每个子网络的独家本地存在服务耳朵由相关联的代理处理。 存在代理可以将呈现信息路由到存在服务器和来自存在服务器的其他存在服务（不属于本地的）。

    Method and apparatus for space efficient identification of candidate objects for eviction from a large cache
    4.
    发明授权
    Method and apparatus for space efficient identification of candidate objects for eviction from a large cache 失效
    用于空间有效识别候选物体以从大型缓存驱逐的方法和装置

    公开(公告)号：US07536512B2

    公开(公告)日：2009-05-19

    申请号：US11531818

    申请日：2006-09-14

    申请人： Madhu Chetuparambil ,  Andrew C. Chow ,  Andrew Ivory ,  Nirmala Kodali

    发明人： Madhu Chetuparambil ,  Andrew C. Chow ,  Andrew Ivory ,  Nirmala Kodali

    IPC分类号： G06F12/00

    CPC分类号： G06F12/121

    摘要： The eviction candidate sorting tool (ECST) is used with existing eviction algorithms that utilize a database for tracking objects stored in a cache. Rather than storing all the metadata associated with an object in a cache, the ECST extracts only certain attributes from the metadata, creating an “evict table” listing all the cached objects and the chosen attributes, or “classes.” The table can be sorted by class based on an eviction algorithm. An eviction mechanism can use the sorted table to identify candidates for eviction.

    摘要翻译： 驱逐候选排序工具（ECST）与现有驱逐算法一起使用，该算法利用数据库来跟踪存储在缓存中的对象。 ECST不是将所有与对象相关联的元数据存储在缓存中，而是从元数据中只提取某些属性，创建列出所有缓存对象和所选属性或“类”的“驱逐表”。 可以根据逐出算法对类进行排序。 驱逐机制可以使用排序表来识别驱逐的候选人。

    DISPATCHING REQUEST FRAGMENTS FROM A RESPONSE AGGREGATING SURROGATE
    8.
    发明申请
    DISPATCHING REQUEST FRAGMENTS FROM A RESPONSE AGGREGATING SURROGATE 审中-公开
    从响应聚合现象中分配请求片段

    公开(公告)号：US20080016194A1

    公开(公告)日：2008-01-17

    申请号：US11457937

    申请日：2006-07-17

    申请人： Madhu Chetuparambil ,  Srinivas Hasti ,  Stephan Hesmer ,  Todd E. Kaplinger ,  Subbarao K. Meduri ,  Maxim A. Moldenhauer ,  Aravind Srinivasan

    发明人： Madhu Chetuparambil ,  Srinivas Hasti ,  Stephan Hesmer ,  Todd E. Kaplinger ,  Subbarao K. Meduri ,  Maxim A. Moldenhauer ,  Aravind Srinivasan

    IPC分类号： G06F15/173

    CPC分类号： H04L67/02 ,  G06F16/958 ,  H04L67/2842

    摘要： Embodiments of the present invention address deficiencies of the art in respect to edgified content delivery and provide a method, system and computer program product for dispatching of request fragments from a response aggregating surrogate. In one embodiment, an edgified content distribution data processing system can include an origin server configured to server markup specified pages formed from dynamically arranged fragments and a surrogate server communicatively linked to the origin server over a computer communications network and acting as a surrogate at an edge of the network on behalf of the origin server. A dependency engine can be coupled to the surrogate server and can include program code enabled to group the fragments according to interdependencies among the fragments and to load fragment groups in sequence to satisfy the interdependencies.

    摘要翻译： 本发明的实施例解决了关于加密内容传递的本领域的缺陷，并且提供了用于从响应聚合代理分发请求片段的方法，系统和计算机程序产品。 在一个实施例中，加密内容分发数据处理系统可以包括原始服务器，其被配置为服务器标记由动态排列的片段形成的指定页面以及通过计算机通信网络通信地链接到原始服务器的代理服务器，并且用作在边缘处的代理 的网络代表原始服务器。 依赖引擎可以耦合到代理服务器，并且可以包括能够根据片段之间的相互依赖性对片段进行分组并且按顺序加载片段组以满足相互依赖性的程序代码。

    Method and Apparatus for Space Efficient Identification of Candidate Objects for Eviction from a Large Cache
    10.
    发明申请
    Method and Apparatus for Space Efficient Identification of Candidate Objects for Eviction from a Large Cache 失效
    用于空间有效识别从大型缓存驱逐的候选对象的方法和装置

    公开(公告)号：US20080071992A1

    公开(公告)日：2008-03-20

    申请号：US11531818

    申请日：2006-09-14

    申请人： Madhu Chetuparambil ,  Andrew C. Chow ,  Andrew Ivory ,  Nirmala Kodali

    发明人： Madhu Chetuparambil ,  Andrew C. Chow ,  Andrew Ivory ,  Nirmala Kodali

    IPC分类号： G06F12/00

    CPC分类号： G06F12/121

    摘要： The eviction candidate sorting tool (ECST) is used with existing eviction algorithms that utilize a database for tracking objects stored in a cache. Rather than storing all the metadata associated with an object in a cache, the ECST extracts only certain attributes from the metadata, creating an “evict table” listing all the cached objects and the chosen attributes, or “classes.” The table can be sorted by class based on an eviction algorithm. An eviction mechanism can use the sorted table to identify candidates for eviction.

    摘要翻译： 驱逐候选排序工具（ECST）与现有驱逐算法一起使用，该算法利用数据库来跟踪存储在缓存中的对象。 ECST不是将所有与对象相关联的元数据存储在缓存中，而是从元数据中只提取某些属性，创建列出所有缓存对象和所选属性或“类”的“驱逐表”。 可以根据逐出算法对类进行排序。 驱逐机制可以使用排序表来识别驱逐的候选人。