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

1. 发明授权

US4954821A Method of establishing transmission group numbers for network links 失效
标题翻译：建立网络链路传输组号的方法
公开(公告)号：US4954821A
公开(公告)日：1990-09-04
申请号：US168286
申请日：1988-03-15
申请人： James P. Gray , Jeffrey G. Knauth , Diane P. Pozefsky , Lee M. Rafalow
发明人： James P. Gray , Jeffrey G. Knauth , Diane P. Pozefsky , Lee M. Rafalow
IPC分类号： H04L12/24 , H04L29/06
CPC分类号： H04L41/00 , H04L12/24 , H04L29/06 , H04L69/24
摘要： 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.

2. 发明授权

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.

3. 发明授权

US4736369A Adaptive session-level pacing 失效
标题翻译：自适应会话级起搏
公开(公告)号：US4736369A
公开(公告)日：1988-04-05
申请号：US873908
申请日：1986-06-13
申请人： Tsipora P. Barzilai , Raymond F. Bird , James P. Gray , Bharath K. Kadaba , James B. Kalmbach, Jr. , Jeffrey G. Knauth , Diane P. Pozefsky
发明人： Tsipora P. Barzilai , Raymond F. Bird , James P. Gray , Bharath K. Kadaba , James B. Kalmbach, Jr. , Jeffrey G. Knauth , Diane P. Pozefsky
IPC分类号： G06F3/14 , G06F13/00 , G06F13/42 , H04L12/56 , H04L29/00 , H04J3/24 , H04J3/16
CPC分类号： H04L47/27 , G06F13/4213 , H04L29/00 , H04L47/10 , H04L47/26 , H04L47/30
摘要： A technique called "Adaptive Pacing" permits a receiving node, in a computing networking, to change the size of an information window during an active session. To effect the change, the receiving node sends an "Isolated Pacing Message" (IPM) to the sending node. Thereafter, the sending node adjusts the window size to conform with a window size value in the IPM. The IPM includes a type field, a reset window indicator and a next window size field. There are three types of isolated pacing messages. Two of the messages are used by the receiving node to control the flow of data; while the third message is used, by the sending node, to confirm the beginning of a new window and the ending of an old one.
摘要翻译：称为“自适应起搏”的技术允许计算联网中的接收节点在活动会话期间改变信息窗口的大小。为了实现改变，接收节点向发送节点发送“隔离的起搏消息”（IPM）。此后，发送节点调整窗口大小以符合IPM中的窗口大小值。 IPM包括类型字段，复位窗口指示符和下一个窗口大小字段。有三种类型的隔离起搏消息。接收节点使用两个消息来控制数据流; 而发送节点使用第三个消息来确认新窗口的开始和旧窗口的结束。

4. 发明授权

US4914571A Locating resources in computer networks 失效
标题翻译：在计算机网络中查找资源
公开(公告)号：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
IPC分类号： G06F13/00 , G06F9/50 , H04L29/00
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.

5. 发明授权

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.

6. 发明授权

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.

7. 发明授权

US4827411A Method of maintaining a topology database 失效
标题翻译：维护拓扑数据库的方法
公开(公告)号：US4827411A
公开(公告)日：1989-05-02
申请号：US62272
申请日：1987-06-15
申请人： Andrew H. Arrowood , Alan E. Baratz , Philip F. Chimento, Jr. , John E. Drake, Jr. , John L. Eisenbies , James P. Gray , Karla J. Norsworthy , Diane P. Pozefsky
发明人： Andrew H. Arrowood , Alan E. Baratz , Philip F. Chimento, Jr. , John E. Drake, Jr. , John L. Eisenbies , James P. Gray , Karla J. Norsworthy , Diane P. Pozefsky
IPC分类号： H04L29/00 , G06F15/16
CPC分类号： H04L29/00 , Y10S707/99945 , Y10S707/99957
摘要： Each network node in a communications network maintains its own copy of the network topology database defining network resources. Each resource record contains a "timer" field which is initially set to a maximum value but which may be decremented on a daily basis. If the timer field is decremented to zero without being reset, the node unilaterally removes the resource record from its copy of the database. The timer field will normally reach zero only for obsolete resource records since each network node responsible for a resource broadcasts a timer-resetting message for the resource (1) each time the resource status changes, (2) when the node first joins or rejoins the network, and (3) on a periodic (weekly) basis regardless of whether conditions (1) or (2) have occurred.

8. 发明授权

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.

9. 发明授权

US08494890B2 Keeping working hours and calendar entries up-to-date 失效
标题翻译：保持工作时间和日历项目是最新的
公开(公告)号：US08494890B2
公开(公告)日：2013-07-23
申请号：US13606844
申请日：2012-09-07
申请人： J. Smith Doss , Renee M. Kovales , Diane P. Pozefsky , Robert J. Sundstrom
发明人： J. Smith Doss , Renee M. Kovales , Diane P. Pozefsky , Robert J. Sundstrom
IPC分类号： G06Q10/00
CPC分类号： G06Q10/109 , G06Q10/063114
摘要： Techniques are disclosed for keeping calendars up-to-date, whereby a person's working hours, events, and actual availability are accurately reflected. In response to user-generated input and/or application-generated input, working hours can be updated and calendar events can be added to, deleted from, or changed on the user's calendar. This makes it easy for users to keep calendars (including working hours) up-to-date and helps both people and applications that use calendar data. Profiles are preferably used to specify working hours, and a particular user may have one or more profiles available (including a default profile); the user can then easily select from among these profiles to update the working hours for a date/day, or a range of dates/days. Preferences may be associated with the profiles, providing a convenient way of isolating information that applies only to a particular set of working hours.
摘要翻译：披露了保持日历最新的技术，从而准确反映了一个人的工作时间，事件和实际可用性。响应于用户生成的输入和/或应用程序生成的输入，可以更新工作时间，并且可以在用户的日历上添加，删除或更改日历事件。这使用户可以轻松地将日历（包括工作时间）保持最新，并帮助使用日历数据的人员和应用程序。配置文件优选用于指定工作时间，并且特定用户可以具有一个或多个可用的配置文件（包括默认配置文件）; 用户可以从这些配置文件中轻松地选择日期/日期的工作时间或日期/天的范围。首选项可能与配置文件相关联，提供了仅适用于特定工作时间的信息的便捷方式。

10. 发明授权

US5425028A Protocol selection and address resolution for programs running in heterogeneous networks 失效
标题翻译：异构网络中运行的程序的协议选择和地址解析
公开(公告)号：US5425028A
公开(公告)日：1995-06-13
申请号：US915969
申请日：1992-07-16
申请人： Kathryn H. Britton , Tein-Yaw D. Chung , Willibald A. Doeringer , Douglas H. Dykeman , Allan K. Edwards , Johny Mathew , Diane P. Pozefsky , Soumitra Sarkar , Roger D. Turner
发明人： Kathryn H. Britton , Tein-Yaw D. Chung , Willibald A. Doeringer , Douglas H. Dykeman , Allan K. Edwards , Johny Mathew , Diane P. Pozefsky , Soumitra Sarkar , Roger D. Turner
IPC分类号： H04L29/06 , H04Q11/04 , G06F13/00
CPC分类号： H04L29/06
摘要： The present invention is a general solution to the problem address incompatibility between application programs and transport services. The invention may be embodied in a method for mapping the application program address (program address) to the transport services address (transport Provider address). According to the method, a program address is registered in the network so that it becomes available to other programs that understand the address, even if they are running over a transport protocol that does not understand the address format. When a request is made that a connection be established between a program and a program partner or that a datagram be sent therebetween, the program address is mapped to the transport Provider address (if necessary). The program address is then conveyed to the program partner so that it knows who it is talking to.
摘要翻译：本发明是应用程序和传输服务之间的问题地址不兼容性的一般解决方案。本发明可以体现在将应用程序地址（程序地址）映射到传输服务地址（传输提供者地址）的方法中。根据该方法，程序地址被登记在网络中，使得即使它们在不理解地址格式的传输协议上运行，也可以用于理解地址的其他程序。当请求在程序和程序伙伴之间建立连接或者在其间发送数据报时，程序地址被映射到传输提供者地址（如果需要）。然后将程序地址传送给程序伙伴，以便它知道它正在通话。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式