专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US6011918A Methods, systems and computer program products for generating client/server applications 失效
标题翻译：用于生成客户端/服务器应用程序的方法，系统和计算机程序产品
公开(公告)号：US6011918A
公开(公告)日：2000-01-04
申请号：US64925
申请日：1998-04-22
申请人： Geoffrey Alexander Cohen , James P. Gray , David Louis Kaminsky , Manoj V. S. Kasichainula , Richard Adam King , Zhiyong Li , Phillip Allan Stone
发明人： Geoffrey Alexander Cohen , James P. Gray , David Louis Kaminsky , Manoj V. S. Kasichainula , Richard Adam King , Zhiyong Li , Phillip Allan Stone
IPC分类号： G06F9/44 , G06F9/46
CPC分类号： G06F8/30 , G06F9/465
摘要： Methods, systems and computer program products are provided for automatically generating client/server applications from an application written to execute on a single processing system. The application has program classes and programmed methods associated with the objects. Each program class in the application is identified and the relationships between programmed methods in the classes is determined. The relationships between the programmed methods in the identified classes are then weighted based on the activity of the relationship. Similarly, each identified class in the application is also weighted based on the computing resources required by the identified class. The identified classes are then partitioned into client classes and server classes based on the weighted relationships between the programmed methods in the classes, the weight associated with each class and a computing topology associated with a target client processing system. The resulting client and server partition may then be used for code generation and distribution based on the capabilities of a requesting computer system.
摘要翻译：提供了方法，系统和计算机程序产品，用于从写入在单个处理系统上执行的应用程序自动生成客户端/服务器应用程序。应用程序具有与对象相关联的程序类和编程方法。识别应用程序中的每个程序类，并确定类中编程方法之间的关系。然后基于关系的活动来对所识别的类中的编程方法之间的关系加权。类似地，应用程序中的每个已标识的类也基于所识别的类所需的计算资源进行加权。然后，基于类中编程的方法，与每个类相关联的权重和与目标客户端处理系统相关联的计算拓扑之间的加权关系，将所识别的类划分为客户端类和服务器类。然后，所得到的客户端和服务器分区可以用于基于请求计算机系统的能力的代码生成和分发。

2. 发明授权

US5613060A Asynchronous resynchronization of a commit procedure 失效
标题翻译：提交过程的异步重新同步
公开(公告)号：US5613060A
公开(公告)日：1997-03-18
申请号：US963889
申请日：1992-10-19
申请人： Kathryn H. Britton , Andrew P. Citron , James P. Gray , Barbara A. M. Maslak , Timothy J. Thatcher
发明人： Kathryn H. Britton , Andrew P. Citron , James P. Gray , Barbara A. M. Maslak , Timothy J. Thatcher
IPC分类号： G06F11/00 , G06F9/46 , G06F9/52 , G06F12/00 , G06F13/00
CPC分类号： G06F9/466
摘要： A computer system and process efficiently provides resource recovery for a failure during a commit procedure. An application is run on a processor and requests a work operation involving a resource such as a protected conversation with another application in a different real machine. A commit procedure is begun for the work request, and if the commit procedure fails before completion, the following steps are taken to optimize the use of one or both of the applications. At some time after the commit procedure fails, a return code is sent to at least the application that initiated the commit indicating the result of the application commit order and that the application can continue to run and does not have to wait for resynchronization (recovery). Then, while the initiating application continues to run and do other useful work, resynchronization is implemented in parallel, asynchronously.
摘要翻译：计算机系统和过程在提交过程期间有效地为故障提供资源恢复。应用程序在处理器上运行，并且请求涉及诸如与不同实际机器中的另一应用程序的保护对话的资源的工作操作。为工作请求开始提交过程，如果提交过程在完成之前失败，则采取以下步骤来优化一个或两个应用程序的使用。在提交过程失败后的某个时间，返回代码至少发送到启动提交的应用程序，该应用程序指示应用程序提交顺序的结果，并且应用程序可以继续运行，并且不必等待重新同步（恢复）。然后，当启动应用程序继续运行并执行其他有用的工作时，异步并行执行异步。

3. 发明授权

US5224098A Compensation for mismatched transport protocols in a data communications network 失效
标题翻译：数据通信网络中错配的传输协议的补偿
公开(公告)号：US5224098A
公开(公告)日：1993-06-29
申请号：US731564
申请日：1991-07-17
申请人： Raymond F. Bird , Kathryn H. Britton , Tein-Yaw D. Chung , Allan K. Edwards , Johny Mathew , Diane P. Pozefsky , Soumitra Sarkar , Roger D. Turner , Winston W. Chung , Yue T. Yeung , James P. Gray , Harold D. Dykeman , Willibald A. Doeringer , Joshua S. Auerbach , John H. Wilson
发明人： Raymond F. Bird , Kathryn H. Britton , Tein-Yaw D. Chung , Allan K. Edwards , Johny Mathew , Diane P. Pozefsky , Soumitra Sarkar , Roger D. Turner , Winston W. Chung , Yue T. Yeung , James P. Gray , Harold D. Dykeman , Willibald A. Doeringer , Joshua S. Auerbach , John H. Wilson
IPC分类号： G06F13/00 , H04L29/06
CPC分类号： H04L29/06 , H04L69/08 , H04L69/24
摘要： A Transport Layer Protocol Boundary (TLPB) architecture is described which will permit an application program to run over a non-native transport protocol without first generating a protocol compensation package tailored to the transport protocols assumed by the program's application programming interface and by the available transport provider. All transport functions required by the program are converted to standardized or TLPB representations. When a connection between the first application program and a second remote application is requested, the individual required TLPB transport functions are compared to corresponding functions supported by the transport provider. Compensations are invoked only where there is a mismatch. The node on which the remote application program runs is informed of the compensations so that necessary de-compensation operations can be performed before the data is delivered to the remote application program.

4. 发明授权

US5109483A Node initiating XID exchanges over an activated link including an exchange of sets of binding signals between nodes for establishing sessions 失效
标题翻译：在启动链路上启动XID交换，包括用于建立会话的节点之间的绑定信号集合的交换
公开(公告)号：US5109483A
公开(公告)日：1992-04-28
申请号：US062280
申请日：1987-06-15
申请人： Alan E. Baratz , John E. Drake, Jr. , George A. Grover , James P. Gray , Melinda R. Pollard , Diane P. Pozefsky , Lee M. Rafalow
发明人： Alan E. Baratz , John E. Drake, Jr. , George A. Grover , James P. Gray , Melinda R. Pollard , Diane P. Pozefsky , Lee M. Rafalow
IPC分类号： G06F13/00 , H04L29/00
CPC分类号： H04L29/00
摘要： Enhanced type 2.1 nodes for SNA networks provide network routing of information between non-adjacent network nodes and program-to-program linkage across the network. These nodes are called "advanced peer to peer networking" (abbreviated APPN) nodes. Network state information, describing the topology and resources of the network is disseminated betweeen APPN nodes by a first data link control exchange of identification (XID) information indicating node type (and thereby distinguishing APPN nodes from other nodes) and other exchanges conducted over a newly defined control point to control point (abbreviated CP--CP) session having a message architecture unique to APPN type nodes. The XID exchange is conducted whenever a link between nodes is activated, and when the exchanging nodes are both APPN, and if both are available to participate in as CP--CP session, they automatically engage in a second exchange of session binding signals which establish a pair of sessions between the nodes. By internal conventions, the node components which use the session pair for exchanging their network state information adapt the sessions to be used in simplex modes with one session flowing from one node to the other and the other flowing in reverse from the other node to the one node. Within these sessions, for the sake of efficiency, communications are not directly acknowledged. Instead, a process transparent to the sessions monitors for link failure and upon such occurrence notifies all affected components to terminate their use of the session and deactivate the session.

5. 发明授权

US5892754A User controlled adaptive flow control for packet networks 失效
标题翻译：用于分组网络的用户控制的自适应流量控制
公开(公告)号：US5892754A
公开(公告)日：1999-04-06
申请号：US660317
申请日：1996-06-07
申请人： Vachaspathi P. Kompella , James P. Gray , Frank D. Smith , Kevin Jeffay
发明人： Vachaspathi P. Kompella , James P. Gray , Frank D. Smith , Kevin Jeffay
IPC分类号： H04L12/56
CPC分类号： H04L12/5695 , H04L47/10 , H04L47/11 , H04L47/29 , H04L47/743 , H04L47/745 , H04L47/762 , H04L47/803 , H04L47/805 , H04L47/822
摘要： A flow control system for packet transmission networks is centered in the user applications supplying data to the network. Changes in control are responsive to changes in the transmission parameters of the network, measured in the network and transmitted to the user application. The user application specifies desired ranges of Quality of Service parameters and, when the measured network parameters fall outside of the desired range, the user application modifies the transmission strategy to match the available transmission parameters. Measurements of network parameters are made over a pre-selected observation period to average the values of the transmission parameters.
摘要翻译：用于分组传输网络的流控制系统集中在向网络提供数据的用户应用中。控制变化响应网络传输参数的变化，在网络中测量并发送给用户应用程序。用户应用程序指定所需的服务质量参数范围，并且当测量的网络参数落在所需范围之外时，用户应用修改传输策略以匹配可用的传输参数。网络参数的测量是通过预先选择的观测周期进行的，以平均传输参数的值。

6. 发明授权

US5432926A Method and apparatus for improving database reliability and response time in a distributed transaction processing system 失效
标题翻译：在分布式事务处理系统中提高数据库可靠性和响应时间的方法和装置
公开(公告)号：US5432926A
公开(公告)日：1995-07-11
申请号：US985391
申请日：1992-12-04
申请人： Andrew P. Citron , James P. Gray
发明人： Andrew P. Citron , James P. Gray
IPC分类号： G06F12/00 , G06F11/14 , G06F17/30 , G06F11/00
CPC分类号： G06F17/30371
摘要： A transaction network in which, in appropriate cases, a transaction is allowed to complete at each node and new work to commence, before all transaction resources at the node actually complete a syncpoint operation. This desirable result is obtained without the risk of unreported database corruption. At each node in response to a prepare to commit syncpoint command from a parent node, the node in question determines if it or any of its descendant nodes can make a unilateral heuristic decision to commit or backout the transaction irrespective of whether or not the final syncpoint command is to commit or backout. Each node informs its parent node that it is reliable or unreliable. Reliable means that neither this node nor any of its descendant nodes can make a unilateral heuristic decision. Unreliable means that this node or one or more of the descendant nodes may make such a unilateral decision. If a node is reliable, the transaction is released at the node after receiving and propagating to descendant nodes the final commit or backout command and before completion or acknowledgement of completion of the commit or backout command by the node or any of its descendant nodes. If the node is unreliable, then it waits for acknowledgement of completion of the commit or backout syncpoint operation at all unreliable nodes, including itself, before releasing the transaction at the node.
摘要翻译：一种交易网络，在适当的情况下，允许交易在每个节点完成并且新工作开始，在节点的所有事务资源实际完成同步点操作之前。获得这个理想的结果，而不会导致未报告的数据库损坏。在每个节点响应于准备从父节点提交syncpoint命令时，所讨论的节点确定其或其任何后代节点是否可进行单边启发式决定来提交或退回该事务，而不管最终同步点是否命令是提交或退出。每个节点通知其父节点它是可靠的或不可靠的。可靠的意味着这个节点和它的任何后代节点都不能进行单边启发式决策。不可靠意味着该节点或一个或多个后代节点可以进行单方面决策。如果一个节点是可靠的，则在节点或其后代节点完成或完成提交或退出命令之后，在接收到传播到后代节点的最后提交或退出命令之后，该节点被释放。如果节点不可靠，则在释放节点处的事务之前，它将等待所有不可靠节点（包括其自身）完成提交或退出同步点操作的确认。

7. 发明授权

US5101348A Method of reducing the amount of information included in topology database update messages in a data communications network 失效
标题翻译：降低数据通信网络拓扑数据库更新信息中包含的信息量的方法
公开(公告)号：US5101348A
公开(公告)日：1992-03-31
申请号：US210251
申请日：1988-06-23
申请人： Andrew H. Arrowood , Kathryn E. Clarke , John E. Drake, Jr. , John L. Eisenbies , James P. Gray , Karla J. Norsworthy , Diane P. Pozefsky , Terence D. Smetanka
发明人： Andrew H. Arrowood , Kathryn E. Clarke , John E. Drake, Jr. , John L. Eisenbies , James P. Gray , Karla J. Norsworthy , Diane P. Pozefsky , Terence D. Smetanka
IPC分类号： H04L12/24 , H04L12/56
CPC分类号： H04L45/02 , H04L41/12
摘要： In a communications network, each network node can maintain its own list of network resources in a topology database. When the state of a resource "owned" by a particular node changes, that node broadcasts a topology database update (TDU) message to adjacent nodes. Each adjacent node updates its own topology database and rebroadcasts the message. To minimize the amount of information that must be included in TDU messages when two nodes are reconnected after an outage, each node assigns flow reduction sequence numbers (FRSNs) to TDU meassages and keeps a record of the FRSN for the last TDU message sent to an adjacent node. The node also records, for each resource in its database, the FRSN of the last TDU message including that resource. When two nodes are reconnected, the sending node includes in the TDU message only those resources having a FRSN greater than the FRSN assigned to the last TDU sent to the adjacent node to which the TDU message is directed.

8. 发明授权

US4873517A Method for selecting least weight end node to end node route in a data communications network 失效
标题翻译：在数据通信网络中选择最小权重终端节点到终端节点路由的方法
公开(公告)号：US4873517A
公开(公告)日：1989-10-10
申请号：US210273
申请日：1988-06-23
申请人： Alan E. Baratz , Kathryn E. Clarke , Melinda R. Pollard , Diane P. Pozefsky , Lee M. Rafalow , William E. Siddall , James P. Gray
发明人： Alan E. Baratz , Kathryn E. Clarke , Melinda R. Pollard , Diane P. Pozefsky , Lee M. Rafalow , William E. Siddall , James P. Gray
IPC分类号： H04L12/56 , H04Q3/66
CPC分类号： H04Q3/665 , H04L45/00 , H04L45/44
摘要： When computing a least weight path from an origin node to a destination node in a data communication network, a route-computing network node uses information provided by the origin and destination nodes to compute least weight routes from those nodes to adjacent network nodes. The route-computing network node uses information in the topology database to compute least weight routes from network nodes adjacent the origin node to network nodes adjacent the destination node. The results of the computations are concatenated to determine an optimum route from the origin node to the destination node. The topology database need not include information about the transmission groups connecting the origin/destination nodes to network nodes.

9. 发明授权

US5642421A Encryption of low data content ATM cells 失效
标题翻译：加密低数据内容ATM信元
公开(公告)号：US5642421A
公开(公告)日：1997-06-24
申请号：US528822
申请日：1995-09-15
申请人： James P. Gray , Stephen M. Matyas , Mohammad Peyravian , Gene Tsudik
发明人： James P. Gray , Stephen M. Matyas , Mohammad Peyravian , Gene Tsudik
IPC分类号： H04L12/56 , H04Q11/04 , H04L9/00
CPC分类号： H04Q11/0478 , H04L2012/5638 , H04L2012/5673
摘要： The security provided by encryption of ATM cells is enhanced by testing each cell for low data content level. If a cell has a low data content, its contents are nevertheless compressed and the resulting string is used to replace the original data. A length character and a randomly generated number which are added to the freed-up byte positions in the data field of the cell. The entire, modified data field is encrypted before the cell is transmitted. At a receiving system, a compression indicator is checked to determine whether the cell contains original or compressed data. If necessary, the length field and the random number are stripped and the remaining cell data is decompressed before the cell data is decrypted.
摘要翻译：通过对每个小区进行低数据内容级别的测试，增强了通过ATM信元加密提供的安全性。如果单元格具有低数据内容，则其内容仍然被压缩，并且使用结果字符串来替换原始数据。长度字符和随机生成的数字，被添加到单元格的数据字段中的释放字节位置。整个修改的数据字段在传输单元之前被加密。在接收系统中，检查压缩指示符以确定小区是否包含原始或压缩数据。如果需要，长度字段和随机数字被去除，并且在单元数据被解密之前对剩余的单元数据进行解压缩。

10. 发明授权

US5131016A Communications network data compression control system and method 失效
标题翻译：通信网络数据压缩控制系统及方法
公开(公告)号：US5131016A
公开(公告)日：1992-07-14
申请号：US638928
申请日：1991-01-09
申请人： John C. Broughton , Robert S. Cahn , James P. Gray , John P. O'Donnell
发明人： John C. Broughton , Robert S. Cahn , James P. Gray , John P. O'Donnell
IPC分类号： H03M7/30 , H04L29/06
CPC分类号： H04L69/04 , H04L29/06 , H04L69/24
摘要： Data communication nodes in a network comprising a plurality of nodes linked together to form communication paths negotiate by passing messages to identify to one another the maximum supportable degree of data compression capability. Logical comparisons are made at each node between indications received from upstream and downstream nodes, if any, regarding their own or their received indications of data compression capability with the present node's own degree of compression capability. This enables logical decisions to be made to suport the maximum degree of compression capability over each link or portion of a link between terminal nodes which define the ends of the overall link, thus improving data transmission by providing the highest degree of supportable compression over the longest path length.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式