-
公开(公告)号：US4914571A
公开(公告)日：1990-04-03
申请号：US62269
申请日：1987-06-15
申请人： Alan E. Baratz , Inder S. Gopal , James P. Gray , George A. Grover , Jeffrey M. Jaffe , Jean A. Lorrain , Melinda R. Pollard , Diane P. Pozefsky , Mark Pozefsky , Lee M. Rafalow
发明人： Alan E. Baratz , Inder S. Gopal , James P. Gray , George A. Grover , Jeffrey M. Jaffe , Jean A. Lorrain , Melinda R. Pollard , Diane P. Pozefsky , Mark Pozefsky , Lee M. Rafalow
CPC分类号： H04L29/00
摘要： A LOCATE search dynamically locates resources (e.g., logical units (LUs) and transaction program and files associated with LUs) in a computer network so that a session can be established between the origin and the destination of the search.In a network which includes end nodes associated with server nodes, a resource contained in any node is located by a requesting node. The requesting node initiates a search of the resources residing within itself. If the resource does not reside in the requesting node, the server node searches the resources known to the server node that reside anywhere in the nework. If the resource is not known by the server node, it searchers all resources that reside in its associated end nodes. If the resource does not reside in the associated end nodes, either a request is sent to a central directory if one exists or a search of all resources in the network is made.
-
2.发明授权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
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.
-
3.发明授权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
摘要： 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.
-
公开(公告)号：US4954821A
公开(公告)日：1990-09-04
申请号：US168286
申请日：1988-03-15
摘要： The invention enables two nodes in a communications network to dynamically establish the transmission group number used to partially identify a given link between the nodes. When the link is being activated, both nodes simultaneously propose either a zero or a non-zero number to each other in an exchange of exchange identification (XID) messages. If only one of the nodes proposed a non-zero number, that non-zero number is selected as the transmission group number. If both nodes had proposed zero or both had proposed non-zero numbers, predetermined criteria are employed to select a controlling node. The controlling node chooses the final transmission group number and communicates that choice to the non-controlling node.
-
5.发明授权Method and apparatus for policy-based packet classification using hashing algorithm 有权用于基于策略的分组分类的方法和装置，使用散列算法公开(公告)号：US07308501B2
公开(公告)日：2007-12-11
申请号：US09904025
申请日：2001-07-12
申请人： Roberto DeLima , Lap T. Huynh , Dinakaran B. Joseph , John J. Majikes , Robert E. Moore , Lee M. Rafalow
发明人： Roberto DeLima , Lap T. Huynh , Dinakaran B. Joseph , John J. Majikes , Robert E. Moore , Lee M. Rafalow
CPC分类号： H04L67/322 , H04L67/02 , H04L69/329
摘要： A method, apparatus, and computer implemented instructions for processing a request in a data processing system. The request is received. In response to a first hash value being present within the request, the first hash value is compared to a second hash value that was computed locally, wherein the second hash value represents a current policy configuration for assigning a quality of service. In response to a match between the first hash value and the second hash value, other information in the request is used to establish a quality of service for packets associated with the request.
摘要翻译： 一种用于在数据处理系统中处理请求的方法，装置和计算机实现的指令。 收到请求。 响应于在请求内存在第一哈希值，将第一哈希值与本地计算的第二散列值进行比较，其中第二散列值表示用于分配服务质量的当前策略配置。 响应于第一哈希值和第二哈希值之间的匹配，请求中的其他信息用于建立与请求相关联的分组的服务质量。
-
6.发明授权System for locating a node containing a requested resource and for selectively verifying the presence of the resource at the node 失效定位包含所需资源的节点的系统，并选择性地验证资源在节点上的存在
公开(公告)号：US5222242A
公开(公告)日：1993-06-22
申请号：US589356
申请日：1990-09-28
申请人： Owen H. Choi , John E. Drake, Jr. , James C. Fletcher , Johnathan L. Harter , Jeffrey G. Knauth , Dirk K. Kramer , Michael A. Lerner , Joseph L. McKinnon , Lee M. Rafalow , Siddall, William E. , Melinda P. Stump
发明人： Owen H. Choi , John E. Drake, Jr. , James C. Fletcher , Johnathan L. Harter , Jeffrey G. Knauth , Dirk K. Kramer , Michael A. Lerner , Joseph L. McKinnon , Lee M. Rafalow , Siddall, William E. , Melinda P. Stump
IPC分类号： H04L29/00
CPC分类号： H04L29/00
摘要： The present invention is an improvement in a known LOCATE process used to locate resources in a computer network. The known LOCATE process always requires that information about a target resource be verified by forwarding a LOCATE request to the node owning the target resource. The present invention improves upon this process by use of selective verification. If predetermined conditions are met, a node in the network may reply to a received LOCATE request by using information about the target resource found in its cache directory. The LOCATE request need not be propagated to the node owning the target resource except for predetermined types of sessions or where past attempts to use selective verification have not been successful.
-
公开(公告)号：US07809819B2
公开(公告)日：2010-10-05
申请号：US11837266
申请日：2007-08-10
申请人： Roberto DeLima , Lap T. Huynh , Dinakaran B. Joseph , John J. Majikes , Robert E. Moore , Lee M. Rafalow
发明人： Roberto DeLima , Lap T. Huynh , Dinakaran B. Joseph , John J. Majikes , Robert E. Moore , Lee M. Rafalow
IPC分类号： G06F15/16
CPC分类号： H04L67/322 , H04L67/02 , H04L69/329
摘要： A method, apparatus, and computer implemented instructions for processing a request in a data processing system. The request is received. In response to a first hash value being present within the request, the first hash value is compared to a second hash value that was computed locally, wherein the second hash value represents a current policy configuration for assigning a quality of service. In response to a match between the first hash value and the second hash value, other information in the request is used to establish a quality of service for packets associated with the request.
摘要翻译： 一种用于在数据处理系统中处理请求的方法，装置和计算机实现的指令。 收到请求。 响应于请求内存在第一哈希值，将第一哈希值与本地计算的第二散列值进行比较，其中第二散列值表示用于分配服务质量的当前策略配置。 响应于第一哈希值和第二哈希值之间的匹配，请求中的其他信息用于建立与请求相关联的分组的服务质量。
-
公开(公告)号：US20080320147A1
公开(公告)日：2008-12-25
申请号：US11837266
申请日：2007-08-10
申请人： Roberto DeLima , Lap T. Huynh , Dinakaran B. Joseph , John J. Majikes , Robert E. Moore , Lee M. Rafalow
发明人： Roberto DeLima , Lap T. Huynh , Dinakaran B. Joseph , John J. Majikes , Robert E. Moore , Lee M. Rafalow
CPC分类号： H04L67/322 , H04L67/02 , H04L69/329
摘要： A method, apparatus, and computer implemented instructions for processing a request in a data processing system. The request is received. In response to a first hash value being present within the request, the first hash value is compared to a second hash value that was computed locally, wherein the second hash value represents a current policy configuration for assigning a quality of service. In response to a match between the first hash value and the second hash value, other information in the request is used to establish a quality of service for packets associated with the request.
摘要翻译： 一种用于在数据处理系统中处理请求的方法，装置和计算机实现的指令。 收到请求。 响应于请求内存在第一哈希值，将第一哈希值与本地计算的第二散列值进行比较，其中第二散列值表示用于分配服务质量的当前策略配置。 响应于第一哈希值和第二哈希值之间的匹配，请求中的其他信息用于建立与请求相关联的分组的服务质量。
-
-
-
-
-
-
-
搜索结果
8 条记录 (耗时 0.038 秒)
