会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Pipelined cryptography processor and method for its use in communication
networks
    • 流水线密码处理器及其在通信网络中的应用
    • US5161193A
    • 1992-11-03
    • US546632
    • 1990-06-29
    • Butler W. LampsonWilliam R. HaweAmar GuptaBarry A. Spinney
    • Butler W. LampsonWilliam R. HaweAmar GuptaBarry A. Spinney
    • H04L29/02
    • H04L29/02
    • Cryptographic apparatus, and a related method for its operation, for in-line encryption and decryption of data packets transmitted in a communication network. A full-duplex cryptographic processor is positioned between two in-line processing entities of a network architecture. For example, in a fiber distributed data interface (FDDI) network, the processor is positioned between a media access control (MAC) sublayer and a ring memory controller (RMC). Incoming information packets are analyzed to decide whether or not they contain encrypted data and, if they do, are subject to decryption before forwarding. Outbound information packets have their data portions encrypted if called for, and are usually forwarded toward the network communication medium. Cryptographic processing in both directions is performed in real time as each packet is streamed through the processor. The processing of outbound information packets includes using optional data paths for looping of the processed information back in a reverse direction, to permit the host system to perform local encryption or decryption for various purposes.
    • 加密装置及其操作的相关方法,用于在通信网络中发送的数据分组的在线加密和解密。 全双工加密处理器位于网络架构的两个在线处理实体之间。 例如,在光纤分布式数据接口(FDDI)网络中,处理器位于介质访问控制(MAC)子层和环形存储器控制器(RMC)之间。 分析传入信息包以决定它们是否包含加密数据,如果是,则在转发之前进行解密。 出站信息包的数据部分被加密,通常被转发给网络通信媒体。 每个数据包通过处理器流式传输,实时执行两个方向的加密处理。 出站信息包的处理包括使用可选的数据路径将处理的信息反向循环,以允许主机系统为各种目的执行本地加密或解密。
    • 3. 发明授权
    • Negotiation protocol for establishment of full duplex communication on a
token ring network
    • 用于在令牌环网上建立全双工通信的协商协议
    • US5414700A
    • 1995-05-09
    • US226423
    • 1994-04-12
    • Henry S. YangBarry A. SpinneyWilliam R. HaweLuc A. Pariseau
    • Henry S. YangBarry A. SpinneyWilliam R. HaweLuc A. Pariseau
    • H04L5/14H04L12/433H04J3/02H04L12/28
    • H04L12/433H04L5/1423
    • A technique for establishing and maintaining full duplex communication between two stations connected to a token ring network, without physically reconfiguring the station connections or otherwise disturbing the network. Each station continually performs a two node test to ascertain whether there are only two active stations on the network, and updates a two node flag that indicates whether or only two active stations are present. The two node test uses both upstream neighbor and downstream neighbor addresses to update the two node flag, and requires validation of either one of these addresses if the other one of them appears to have changed since the previous observation. A concurrently running full duplex control process uses the two node flag and other conditions to decide whether to initiate or continue transition to full duplex mode. The control process uses an exchange of full duplex request and acknowledgment frames and completes the transition to full duplex mode when each station has transmitted and received a Restricted Token.
    • 一种用于在连接到令牌环网络的两个站之间建立和维持全双工通信的技术,而无需物理地重新配置站点连接或以其他方式干扰网络。 每个站连续执行两节点测试,以确定网络上是否只有两个活动站,并更新指示是否存在两个活动站的两个节点标志。 双节点测试使用上游邻居和下游邻居地址来更新两个节点标志,并且如果从上一次观察看,其中一个似乎已经改变,则需要验证这两个地址之一。 同时运行的全双工控制过程使用两个节点标志和其他条件来决定是启动还是继续转换到全双工模式。 控制过程使用全双工请求和确认帧的交换,并且当每个站已经发送和接收到限制令牌时,完成向全双工模式的转换。
    • 4. 发明授权
    • Station-to-station full duplex communication in a token ring local area
network
    • 站点到站在一个丁香环本地区网络的全双工通信
    • US5155726A
    • 1992-10-13
    • US468480
    • 1990-01-22
    • Barry A. SpinneyHenry S. YangWilliam R. Hawe
    • Barry A. SpinneyHenry S. YangWilliam R. Hawe
    • H04L5/14H04L12/433
    • H04L12/433H04L5/1423
    • A technique for establishing and maintaining full duplex communication between two stations connected to a token ring network, without physically reconfiguring the station connections or otherwise disturbing the network. In an auto-configuration full duplex mode of operation, each station ascertains whether there are only two active stations on the network and, if so, performs an exchange of frames with the other station to establish full duplex communication. One way to ascertain whether only two stations are active is for each station to transmit periodically a neighbor information frame, which contains the indentities of the source station and the source station's nearest upstream neighbor. Once established, full duplex communication can proceed at a greater bandwidth than communication in a token ring network, and without latency delays and distance limitations associated with token ring networks. Periodic checks are made by each station in full duplex communication, to ascertain if the other station is still participating or if any third station has become active. In either case, stations in the auto-configuration mode revert to token ring mode automatically. In a variant form of the invention, stations can operate in a fixed full duplex mode, in which the detection of tokens or third stations are merely reported and do not necessarily result in reversion to the token ring mode.
    • 5. 发明授权
    • Station-to-station full duplex communication in a token ring local area
network
    • 令牌环局域网中的站到站全双工通信
    • US5305306A
    • 1994-04-19
    • US23741
    • 1993-02-25
    • Barry A. SpinneyHenry S. YangWilliam R. Hawe
    • Barry A. SpinneyHenry S. YangWilliam R. Hawe
    • H04L5/14H04L12/433H04J3/02H04L12/42
    • H04L12/433H04L5/1423
    • A technique for establishing and maintaining full duplex communication between two stations connected to a token ring network, without physically reconfiguring the station connections or otherwise disturbing the network. In an auto-configuration full duplex mode of operation, each station ascertains whether there are only two active stations on the network and, if so, performs an exchange of frames with the other station to establish full duplex communication. One way to ascertain whether only two stations are active is for each station to transmit periodically a neighbor information frame, which contains the identities of the source station and the source station's nearest upstream neighbor. Once established, full duplex communication can proceed at a greater bandwidth than communication in a token ring network, and without latency delays and distance limitations associated with token ring networks. Periodic checks are made by each station in full duplex communication, to ascertain if the other station is still participating or if any third station has become active. In either case, stations in the auto-configuration mode revert to token ring mode automatically. In a variant form of the invention, stations can operate in a fixed full duplex mode, in which the detection of tokens or third stations are merely reported and do not necessarily result in reversion to the token ring mode.
    • 一种用于在连接到令牌环网络的两个站之间建立和维持全双工通信的技术,而无需物理地重新配置站点连接或以其他方式干扰网络。 在自动配置全双工操作模式下,每个站确定网络上是否只有两个活动站,如果是,则与其他站执行帧建立全双工通信。 确定只有两个站是活动的一种方式是每个站周期性地发送包含源站和源站最近的上游邻居的标识的邻居信息帧。 一旦建立,全双工通信可以以比令牌环网络中的通信更大的带宽进行,并且没有与令牌环网络相关联的延迟延迟和距离限制。 每个台站进行全双工通信进行定期检查,以确定其他站是否仍在参与,或者任何第三站是否已经活动。 在任一情况下,自动配置模式下的站自动恢复为令牌振铃模式。 在本发明的变型形式中,站可以以固定的全双工模式操作,其中仅报告令牌或第三站的检测,并且不一定导致向令牌环模式的逆转。
    • 8. 发明授权
    • System and process for GHIH-speed pattern matching for application-level switching of data packets
    • 系统为数据包的应用层交换提供高速模式匹配的过程
    • US06430184B1
    • 2002-08-06
    • US09058597
    • 1998-04-10
    • Cary B. RobinsKrishna NarayanaswamyTheodore L. RossBarry A. Spinney
    • Cary B. RobinsKrishna NarayanaswamyTheodore L. RossBarry A. Spinney
    • H04L1228
    • H04L45/745H04L12/5601H04L49/351H04L49/354H04L49/40H04L49/602
    • A process and system for switching connections of data packet flows between nodes of data processing system networks operating on diverse protocols according to the application layer information on the data packets. The process retrieves and hashes the header information to from an index into memory where a flow tag pointer is stored. The flow tag points to flow switching information that directs the forwarding of the packet. The switching information is sent along with the packet data to direct the forwarding state information about the flow is updated in the flow switching information. The hash function includes a multiplication and division by polynomials forming a hash result and a signature result. Both hash and signature are used to ensure that the information retrieved is valid. If invalid, The pre hashed header information is parsed to determine the forwarding information. This forwarding information is stored for later use and the appropriate flow tag pointer is stored in the hash result index.
    • 一种用于根据数据分组上的应用层信息,在不同协议上操作的数据处理系统网络的节点之间切换数据分组流的连接的过程和系统。 该进程检索并将标题信息从索引记录到存储流标签指针的存储器中。 流标签指向引导数据包转发的流切换信息。 切换信息与分组数据一起被发送以指示在流切换信息中更新关于流的转发状态信息。 散列函数包括通过形成散列结果和签名结果的多项式的乘法和除法。 哈希和签名都用于确保检索的信息有效。 如果无效,则解析预散列头信息以确定转发信息。 该转发信息被存储供以后使用,并且适当的流标签指针被存储在散列结果索引中。
    • 9. 发明授权
    • Hash-based translation method and apparatus with multiple level
collision resolution
    • 基于哈希的翻译方法和具有多级碰撞分辨率的装置
    • US5920900A
    • 1999-07-06
    • US775091
    • 1996-12-30
    • Nigel T. PooleBarry A. Spinney
    • Nigel T. PooleBarry A. Spinney
    • G06F12/10G06F17/30H04L12/46H04L29/06
    • G06F17/30949H04L12/46H04L29/06H04L45/745
    • A translation is performed by using a programmable hashing technique on an input number to generate a hashed number. A subset of the hashed number bits are used to index a first hash table. In first hash table locations where a hash collision does not occur, the first hash table entry contains an index into an output table which contains the desired translated output number. In first hash table locations where a hash collision occurs, the first hash table entry contains a pointer to a first resolution table area in a second hash table. The first resolution table area contains entries which are indexed by additional bits selected from the hashed number in accordance with a mask field in the first hash table location. If collisions occur in the resolution table a new resolution table is created and the process is repeated. The resolution process thus proceeds in stages until all input numbers have been translated.
    • 通过在输入号码上使用可编程散列技术来执行翻译以产生散列数。 散列数位的子集用于索引第一个散列表。 在不发生哈希冲突的第一哈希表位置中,第一哈希表条目包含输出表中包含所需转换输出数的索引。 在发生哈希冲突的第一哈希表位置中,第一散列表条目包含指向第二散列表中的第一分辨率表区域的指针。 第一分辨率表区域包含根据第一散列表位置中的掩码字段从由散列数选择的附加位索引的条目。 如果在分辨率表中发生冲突,则创建一个新的分辨率表,并重复该过程。 因此,分辨率过程分阶段进行,直到所有输入数字已经被翻译。