公开(公告)号：US07774380B2

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

申请号：US11963338

申请日：2007-12-21

申请人： Thomas C. Burke ,  Annapureddy S. Reddy ,  Aravind Srinivasan

发明人： Thomas C. Burke ,  Annapureddy S. Reddy ,  Aravind Srinivasan

IPC分类号： G06F17/30

CPC分类号： G06F17/30961 ,  Y10S707/99942

摘要： The present invention discloses a data structure which, given an identifier for a Representational State Transfer (REST) resource, can rapidly yield a configured target and simultaneously yield all configured pattern based rules and constraints for the target. The disclosed data structure is a tree structure including nodes for URL portions. Each node is associated with a hash tree specifically grown in a manner that ensures collision occurrences are non-existent. The tree structure is effectively two or more superimposed trees; one for URL pattern matching to determine a target, another for determining constraints. A single tree traversal, which can be based on a progressive hash, can be used to concurrently determine a target and a set of constraints, which represents improved performance over conventional implementations that require multiple, distinct query/response operations to produce equivalent results.

摘要翻译： 本发明公开了一种数据结构，其给出了用于表示状态转移（REST）资源的标识符，可以快速产生配置的目标并且同时产生针对目标的所有配置的基于模式的规则和约束。 公开的数据结构是包括URL部分的节点的树结构。 每个节点与确保冲突发生不存在的方式专门生长的散列树相关联。 树结构实际上是两个或多个叠加的树; 一个用于URL模式匹配以确定目标，另一个用于确定约束。 可以使用可以基于渐进散列的单个树遍历来同时确定目标和一组约束，其表示与需要多个不同的查询/响应操作以产生等效结果的常规实现相比改进的性能。

公开(公告)号：US20070108057A1

公开(公告)日：2007-05-17

申请号：US11651269

申请日：2007-01-09

申请人： Jonathan Dordick ,  Moo-Yeal Lee ,  Aravind Srinivasan ,  Bosung Ku

发明人： Jonathan Dordick ,  Moo-Yeal Lee ,  Aravind Srinivasan ,  Bosung Ku

IPC分类号： G01N27/00

CPC分类号： C07K17/14

摘要： Disclosed herein is a method and apparatus of immobilizing a biocatalyst on a microfluidic biochip for conducting reactions in the presence of electroosmotic flow. The biochip includes a polymer on its microfluidic flow surfaces, wherein the polymer includes a first substituent selected from ionic groups of the same polarity or precursors thereof, a second substituent that is a hydrophobic group, and a third substituent comprising an immobilized biocatalyst-or precursor thereof. The biochip can be used to conduct multiple sequential biocatalyzed reactions in the presence of electroosmotic flow.

摘要翻译： 本文公开了将生物催化剂固定在微流体生物芯片上以在存在电渗流的情况下进行反应的方法和装置。 生物芯片包括在其微流体流动表面上的聚合物，其中聚合物包括选自相同极性的离子基团的第一取代基或其前体，作为疏水基团的第二取代基和包含固定的生物催化剂或前体的第三取代基 其中。 生物芯片可用于在电渗流的存在下进行多次连续的生物催化反应。

公开(公告)号：US20080028086A1

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

申请号：US11460443

申请日：2006-07-27

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

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

IPC分类号： G06F15/16

CPC分类号： G06F9/5055 ,  G06F2209/5013 ,  G06F2209/506

摘要： A Fragment Aggregator utilizes an application independent surrogate to dispatch fragments and receive responses between isolated web applications. Clients send web application requests to the surrogate, which forwards the request to an isolated web application. When a web application requires other isolated web applications to execute the request, the web application responds to the request with a deferred response. The deferred response includes request fragments for the other isolated web applications. The Fragment Aggregator dispatches the fragments to the other isolated web applications. After receiving responses from the isolated web applications, the Fragment Aggregator combines the response and sends them to the client.

摘要翻译： 片段聚合器利用独立于应用程序的代理来分派片段并在隔离的Web应用程序之间接收响应。 客户端将Web应用程序请求发送到代理程序，代理将请求转发到单独的Web应用程序。 当Web应用程序需要其他隔离的Web应用程序来执行请求时，Web应用程序将以延迟响应响应该请求。 延迟响应包括其他隔离Web应用程序的请求片段。 片段聚合器将片段分派到其他隔离的Web应用程序。 在收到隔离Web应用程序的响应后，Fragment Aggregator组合了响应并将其发送给客户端。

公开(公告)号：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.

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

公开(公告)号：US07172682B2

公开(公告)日：2007-02-06

申请号：US10351976

申请日：2003-01-24

申请人： Jonathan S. Dordick ,  Moo-Yeal Lee ,  Aravind Srinivasan ,  Bosung Ku

发明人： Jonathan S. Dordick ,  Moo-Yeal Lee ,  Aravind Srinivasan ,  Bosung Ku

IPC分类号： C07K17/14

CPC分类号： C07K17/14

摘要： Disclosed herein is a method and apparatus of immobilizing a biocatalyst on a microfluidic biochip for conducting reactions in the presence of electroosmotic flow. The biochip includes a polymer on its microfluidic flow surfaces, wherein the polymer includes a first substituent selected from ionic groups of the same polarity or precursors thereof, a second substituent that is a hydrophobic group, and a third substituent comprising an immobilized biocatalyst-or precursor thereof. The biochip can be used to conduct multiple sequential biocatalyzed reactions in the presence of electroosmotic flow.

公开(公告)号：US20050278283A1

公开(公告)日：2005-12-15

申请号：US10857782

申请日：2004-05-27

申请人： Erik Burckart ,  Madhu Chetupararnbil ,  Rohit Kelapure ,  Jeffrey Lee ,  Aravind Srinivasan ,  Kevin Vaughan

发明人： Erik Burckart ,  Madhu Chetupararnbil ,  Rohit Kelapure ,  Jeffrey Lee ,  Aravind Srinivasan ,  Kevin Vaughan

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

CPC分类号： G06F17/30985

摘要： A system and method for searching a bytestream or other string in a case insensitive manner. In a preferred embodiment, the present invention includes an ASCII tree that associated both upper and lower case letters of an incoming header key (or other symbols) with nodes. When enough nodes are gathered, a target word is found.

摘要翻译： 用于以不区分大小写的方式搜索字节流或其他字符串的系统和方法。 在一个优选实施例中，本发明包括一个ASCII树，它将输入报头密钥（或其他符号）的大小写字母与节点相关联。 当收集足够的节点时，找到目标字。

公开(公告)号：US06687363B1

公开(公告)日：2004-02-03

申请号：US09517658

申请日：2000-03-03

申请人： Murali Aravamudan ,  Krishnan Kumaran ,  Kajamalai Gopalaswamy Ramakrishnan ,  Aravind Srinivasan

发明人： Murali Aravamudan ,  Krishnan Kumaran ,  Kajamalai Gopalaswamy Ramakrishnan ,  Aravind Srinivasan

IPC分类号： H04M700

CPC分类号： H04Q3/66 ,  H04M7/006

摘要： A method is disclosed for designing a signaling network of call coordinators (CCs) for internet telephony. The new method can be used to design a CC network of arbitrary size that satisfies, with high probability, limitations on the maximum number of sockets per CC and on the maximum number of hops between an arbitrary pair of switches in the network. According to the disclosed method, the network of CCs is treated initially as a collection of isolated points, one point for each CC. Then, links are added between pairs of CCs, excluding pairs lying within the same switch. The links are added randomly, but with a particular probability p, which may be different for different pairs. Thus, whether a given link is added depends, in effect, upon the outcome of a loaded coin toss in which the probability of a positive outcome is p.

摘要翻译： 公开了一种用于设计用于互联网电话的呼叫协调器（CC）的信令网络的方法。 该新方法可用于设计任意大小的CC网络，其高概率地限制每CC的最大插座数以及网络中任意一对交换机之间的最大跳数。 根据所公开的方法，CC的网络最初被视为孤立点的集合，每个CC是一个点。 然后，在成对的CC之间添加链路，不包括位于同一交换机内的对。 链接是随机添加的，但具有特定概率p，对于不同的对可能是不同的。 因此，给定的链接是否被添加取决于实际上是一个加载的硬币的结果，其中肯定结果的概率是p。

公开(公告)号：US08176051B2

公开(公告)日：2012-05-08

申请号：US10857782

申请日：2004-05-27

申请人： Erik John Burckart ,  Madhu K. Chetuparambil ,  Rohit Dilip Kelapure ,  Jeffrey A. Lee ,  Aravind Srinivasan ,  Kevin Edward Vaughan

发明人： Erik John Burckart ,  Madhu K. Chetuparambil ,  Rohit Dilip Kelapure ,  Jeffrey A. Lee ,  Aravind Srinivasan ,  Kevin Edward Vaughan

IPC分类号： G06F17/30

CPC分类号： G06F17/30985

摘要： A system and method for searching a bytestream or other string in a case insensitive manner. In a preferred embodiment, the present invention includes an ASCII tree that associated both upper and lower case letters of an incoming header key (or other symbols) with nodes. When enough nodes are gathered, a target word is found.

摘要翻译： 用于以不区分大小写的方式搜索字节流或其他字符串的系统和方法。 在一个优选实施例中，本发明包括一个ASCII树，它将输入报头密钥（或其他符号）的大小写字母与节点相关联。 当收集足够的节点时，找到目标字。

公开(公告)号：US07543069B2

公开(公告)日：2009-06-02

申请号：US10967533

申请日：2004-10-18

申请人： Srinivas Hasti ,  Gabriel Garcia Montero ,  Aravind Srinivasan ,  Renganathan Sundararaman ,  Kevin Edward Vaughan

发明人： Srinivas Hasti ,  Gabriel Garcia Montero ,  Aravind Srinivasan ,  Renganathan Sundararaman ,  Kevin Edward Vaughan

IPC分类号： G06F15/16

CPC分类号： H04L67/1034 ,  H04L67/02 ,  H04L67/1002 ,  H04L67/14 ,  H04L69/40

摘要： Session state affinity is maintained in a workload balancing system that includes a hypertext transfer protocol (HTTP) routing server and a plurality of application servers. The application servers maintain backup session state information for a first session to a first server of the plurality of application servers at fewer than all of the plurality of application servers, detect the unavailability of the first application server at an application server of the plurality of application servers other than the first application and determine a second server that continues the first session. An identification of the second server and the first session is sent from an application server of the plurality of application servers to a HTTP routing server responsive to detecting the unavailability of the first server. The identification of the second server and the first session is received at the HTTP routing server and communications associated with the first session are routed from the HTTP routing server to the second server responsive to receiving the identification of the second server so that backup session state information maintained at the second server is used to continue the first session from the first server at the second server.

摘要翻译： 在包括超文本传输​​协议（HTTP）路由服务器和多个应用服务器的工作负载平衡系统中维护会话状态关联。 所述应用服务器将所述第一会话的备份会话状态信息保持在所述多个应用服务器中的所有多个应用服务器上的所述多个应用服务器的第一服务器，在所述多个应用服务器的应用服务器处检测到所述第一应用服务器的不可用性 不同于第一个应用程序的服务器，并确定继续第一个会话的第二个服务器。 响应于检测到第一服务器的不可用性，将第二服务器和第一会话的标识从多个应用服务器的应用服务器发送到HTTP路由服务器。 第二服务器和第一会话的识别在HTTP路由服务器处被接收，并且响应于接收到第二服务器的标识，将与第一会话关联的通信从HTTP路由服务器路由到第二服务器，使得备份会话状态信息 在第二服务器上维护的服务器被用于从第二服务器的第一服务器继续第一会话。

公开(公告)号：US07523171B2

公开(公告)日：2009-04-21

申请号：US10657941

申请日：2003-09-09

申请人： Erik John Burckart ,  Aravind Srinivasan

发明人： Erik John Burckart ,  Aravind Srinivasan

IPC分类号： G06F15/16 ,  G06F7/00 ,  G06F17/30 ,  G06F17/00

CPC分类号： G06F17/30949 ,  G06F17/30887 ,  Y10S707/99933 ,  Y10S707/99942

摘要： A mechanism by which URLs are progressively hashed character by character and clauses of the URL are used to traverse a tree data structure for matching of the URL to resources/rules is provided. The hash code for a single character is appended to a prior hash code for a preceding character in the URL portion. At the time that the entire portion of the URL is hashed, as determined based on the presence of a delimiter character, the particular node in a tree data structure associated with the resulting hash code is identifiable within a hash table of a current node of the tree data structure. Each node in the tree data structure includes a multidimensional hash table for a portion of a URL. The multidimensional hash table is established and grown in a manner that ensures there are no hash collisions. Each portion of the URL is parsed in this manner and the tree data structure is traversed as each portion is processed until the entire URL is parsed at which time the resulting rules/resources may be identified from the leaf nodes of the tree data structure.

摘要翻译： 使用URL逐个散列的机制，按URL的字符和子句遍历一个树数据结构，以便将URL与资源/规则的匹配提供。 单个字符的哈希码附加到URL部分中前一个字符的先前哈希码。 在基于定界符字符的存在确定的URL的整个部分被散列的时间，与所得到的散列码相关联的树数据结构中的特定节点可以被识别在当前节点的哈希表中 树数据结构。 树数据结构中的每个节点包括一部分URL的多维哈希表。 以确保没有哈希冲突的方式建立和生长多维哈希表。 以这种方式解析URL的每个部分，并且随着每个部分被处理直到整个URL被解析，遍历树数据结构，从而可以从树数据结构的叶节点识别生成的规则/资源。