Communication line adapter for use with a communications controller
    72.
    发明授权
    Communication line adapter for use with a communications controller 失效
    用于通讯控制器的通讯线适配器

    公开(公告)号:US4504901A

    公开(公告)日:1985-03-12

    申请号:US300846

    申请日:1981-09-10

    CPC分类号: G06F13/385

    摘要: A line adapter for permitting the transfer of information between terminals and a bus connected to the central control unit CCU of a communications controller. The line adapter includes a microprocessor associated with a control memory and a scanner. A random access memory is split into zones, one zone being assigned to each line. During an initiating phase, the zones are personalized under the control of the microcode by sending initiating parameters (which are characteristics of the lines) to the memory, through an asynchronous path bus and external registers. Exchanges of temporarily-stored data between the CCU bus and the lines are carried out through cycle steal operations between the control memory and the random access memory.

    摘要翻译: 用于允许终端之间的信息传输和连接到通信控制器的中央控制单元CCU的总线的线路适配器。 线路适配器包括与控制存储器和扫描器相关联的微处理器。 随机访问存储器被分割成区域,一个区域被分配给每一行。 在启动阶段,通过将异步路径总线和外部寄存器发送启动参数(它们是线路的特性)到存储器,在微代码的控制下对这些区域进行个性化处理。 通过控制存储器和随机存取存储器之间的循环窃取操作来执行在CCU总线和线路之间临时存储的数据的交换。

    Deleting leaves in tree table structures
    74.
    发明授权
    Deleting leaves in tree table structures 失效
    删除树表结构中的树叶

    公开(公告)号:US08135752B2

    公开(公告)日:2012-03-13

    申请号:US12350493

    申请日:2009-01-08

    IPC分类号: G06F7/00 G06F17/00 G06F17/30

    摘要: Techniques and articles of manufacture are provided comprising computer readable programs that, when executed on the computer, cause the computer to delete a leaf from a patricia tree having leaf keys and pattern search control blocks containing a prefix and either an end-of-trail leaf or a pointer to another of the pattern search control blocks, by placing each of the prefixes in a tree prefix table; searching for a key in the tree; searching for the key in the prefix table if the tree searching does not find the key in the tree; confirming that the key is deleted if the key is not found in the prefix table; deleting the key from one of the pattern search control blocks; and collapsing the patricia tree by eliminating the left most pattern search control block from the patricia tree if the patricia tree searching finds the key.

    摘要翻译: 提供的技术和制品包括计算机可读程序,当在计算机上执行计算机可读程序时,使计算机从具有叶键的图案搜索控制块和包含前缀的叶片的叶片中删除叶 或指向另一个模式搜索控制块的指针,通过将每个前缀放置在树前缀表中; 在树中搜索一个键; 如果树搜索没有在树中找到密钥,则在前缀表中搜索密钥; 如果在前缀表中没有找到密钥,则确认该密钥被删除; 从模式搜索控制块之一删除密钥; 并且如果所述爱好者树搜索找到所述密钥,则通过从所述爱好树中消除所述最左图案搜索控制块来折叠所述爱好者树。

    Split socket send queue apparatus and method with efficient queue flow control, retransmission and sack support mechanisms
    75.
    发明授权
    Split socket send queue apparatus and method with efficient queue flow control, retransmission and sack support mechanisms 失效
    拆分套接字发送队列设备和方法,具有高效的队列流控制,重传和备份支持机制

    公开(公告)号:US07818362B2

    公开(公告)日:2010-10-19

    申请号:US11418606

    申请日:2006-05-05

    IPC分类号: G06F15/16 G06F3/00

    摘要: A mechanism for offloading the management of send queues in a split socket stack environment, including efficient split socket queue flow control and TCP/IP retransmission support. An Upper Layer Protocol (ULP) creates send work queue entries (SWQEs) for writing to the send work queue (SWQ). The Internet Protocol Suite Offload Engine (IPSOE) is notified of a new entry to the SWQ and it subsequently reads this entry that contains pointers to the data that is to be transmitted. After the data is transmitted and acknowledgments are received, the IPSOE creates a completion queue entry (CQE) that is written into the completion queue (CQ). The flow control between the ULP and the IPSOE is credit based. The passing of CQ credits is the only explicit mechanism required to manage flow control of both the SWQ and the CQ between the ULP and the IPSOE.

    摘要翻译: 一种卸载分组套接字堆栈环境中发送队列管理的机制,包括高效的分裂套接字队列流控制和TCP / IP重传支持。 上层协议(ULP)创建用于写入发送工作队列(SWQ)的发送工作队列条目(SWQE)。 Internet协议套件卸载引擎(IPSOE)被通知一个新的条目到SWQ,它随后读取这个条目,其中包含指向要发送的数据的指针。 在发送数据并接收到确认之后,IPSOE创建写入完成队列(CQ)的完成队列条目(CQE)。 ULP和IPSOE之间的流量控制是基于信用的。 CQ信用证的通过是在ULP和IPSOE之间管理SWQ和CQ两者流量控制所需的唯一明确的机制。

    Oversubscribing bandwidth in a communications network
    76.
    发明授权
    Oversubscribing bandwidth in a communications network 有权
    在通信网络中超频带宽

    公开(公告)号:US07778178B2

    公开(公告)日:2010-08-17

    申请号:US12272711

    申请日:2008-11-17

    IPC分类号: G01R31/08

    CPC分类号: H04L47/10 H04L47/20

    摘要: A system and computer readable medium for oversubscribing bandwidth in a communication network, is disclosed. The system and computer readable medium includes policing a first data flow and outputting a first output data flow from the first meter, in relation to a first Committed Information Rate (CIR) and a first Peak Information Rate (PIR); policing a second data flow and outputting a second output data flow from the second meter in relation to a second CIR and a second PIR; and policing an aggregated output data flow of the first output data flow and the second output data through a third meter of the oversubscription module, where the aggregated output data flow is policed in relation to a third CIR and a third PIR.

    摘要翻译: 公开了一种用于在通信网络中超额订购带宽的系统和计算机可读介质。 系统和计算机可读介质包括对第一数据流进行管理,并相对于第一承诺信息速率(CIR)和第一峰值信息速率(PIR)从第一仪表输出第一输出数据流; 管理第二数据流,并相对于第二CIR和第二PIR从第二计量器输出第二输出数据流; 以及通过所述超额预订模块的第三计量管理所述第一输出数据流和所述第二输出数据的聚合输出数据流,其中所述聚合输出数据流相对于第三CIR和第三PIR进行监管。

    Longest prefix match lookup using hash function
    77.
    发明授权
    Longest prefix match lookup using hash function 失效
    使用哈希函数的最长前缀匹配查找

    公开(公告)号:US07702630B2

    公开(公告)日:2010-04-20

    申请号:US11353841

    申请日:2006-02-14

    IPC分类号: G06F7/00

    摘要: A method and apparatus are used for finding the longest prefix match in a variable length prefix search when searching a direct table within a routing table structure of a network processor. The search through the routing table structure is expedited by hashing a first segment of an internet protocol address with a virtual private network number followed by concatenating the unhashed bits of the IP address to the result of the hash operation to form an input key. Patterns are compared a bit at a time until an exact match or the best match is found. The search is conducted in a search tree that provides that the matching results will be the best possible match.

    摘要翻译: 当在网络处理器的路由表结构中搜索直接表时,使用方法和装置来在可变长度前缀搜索中找到最长的前缀匹配。 通过路由表结构的搜索是通过用互联网协议地址的第一段与虚拟专用网络号进行散列加速,然后将IP地址的未分配比特连接到散列操作的结果以形成输入密钥。 模式一次比较一点,直到找到完全匹配或最佳匹配。 搜索在搜索树中进行,其提供匹配结果将是最佳匹配。

    Full Virtualization of Resources Across an IP Interconnect Using Page Frame Table
    78.
    发明申请
    Full Virtualization of Resources Across an IP Interconnect Using Page Frame Table 失效
    通过IP帧互连使用页面框架完整的资源虚拟化

    公开(公告)号:US20090198953A1

    公开(公告)日:2009-08-06

    申请号:US12024773

    申请日:2008-02-01

    IPC分类号: G06F12/10

    摘要: An addressing model is provided where devices, including I/O devices, are addressed with internet protocol (IP) addresses, which are considered part of the virtual address space. A task, such as an application, may be assigned an effective address range, which corresponds to addresses in the virtual address space. The virtual address space is expanded to include Internet protocol addresses. Thus, the page frame tables are also modified to include entries for IP addresses and additional properties for devices and I/O. Thus, a processing element, such as an I/O adapter or even a printer, for example, may also be addressed using IP addresses without the need for library calls, device drivers, pinning memory, and so forth. This addressing model also provides full virtualization of resources across an IP interconnect, allowing a process to access an I/O device across a network.

    摘要翻译: 提供了一种寻址模型,其中包括I / O设备在内的设备通过互联网协议(IP)地址进行寻址,这些地址被认为是虚拟地址空间的一部分。 可以为任务(例如应用程序)分配与虚拟地址空间中的地址对应的有效地址范围。 虚拟地址空间被扩展为包括互联网协议地址。 因此,页框表也被修改为包括用于设备和I / O的IP地址和附加属性的条目。 因此,例如,诸如I / O适配器或甚至打印机的处理元件也可以使用IP地址来寻址,而不需要库调用,设备驱动器,固定存储器等。 该寻址模型还可以跨IP互连提供资源的完全虚拟化,从而允许进程通过网络访问I / O设备。

    Split socket send queue apparatus and method with efficient queue flow control, retransmission and sack support mechanisms
    79.
    发明授权
    Split socket send queue apparatus and method with efficient queue flow control, retransmission and sack support mechanisms 失效
    拆分套接字发送队列设备和方法,具有高效的队列流控制,重传和备份支持机制

    公开(公告)号:US07519650B2

    公开(公告)日:2009-04-14

    申请号:US10235689

    申请日:2002-09-05

    IPC分类号: G06F15/16

    摘要: A mechanism for offloading the management of send queues in a split socket stack environment, including efficient split socket queue flow control and TCP/IP retransmission support. As consumers initiate send operations, send work queue entries (SWQEs) are created by an Upper Layer Protocol (ULP) and written to the send work queue (SWQ). The Internet Protocol Suite Offload Engine (IPSOE) is notified of a new entry to the SWQ and it subsequently reads this entry that contains pointers to the data that is to be transmitted. After the data is transmitted and acknowledgments are received, the IPSOE creates a completion queue entry (CQE) that is written into the completion queue (CQ). After the CQE is written, the ULP subsequently processes the entry and removes it from the CQE, freeing up a space in both the SWQ and CQ. The number of entries available in the SWQ are monitored by the ULP so that it does not overwrite any valid entries. Likewise, the IPSOE monitors the number of entries available in the CQ, so as not overwrite the CQ. The flow control between the ULP and the IPSOE is credit based. The passing of CQ credits is the only explicit mechanism required to manage flow control of both the SWQ and the CQ between the ULP and the IPSOE.

    摘要翻译: 一种卸载分组套接字堆栈环境中发送队列管理的机制,包括高效的分裂套接字队列流控制和TCP / IP重传支持。 当消费者发起发送操作时,发送工作队列条目(SWQE)由上层协议(ULP)创建并写入发送工作队列(SWQ)。 互联网协议套件卸载引擎(IPSOE)被通知一个新条目到SWQ,它随后读取这个条目,其中包含指向要发送的数据的指针。 在发送数据并接收到确认之后,IPSOE创建写入完成队列(CQ)的完成队列条目(CQE)。 在编写CQE后,ULP随后处理该条目并将其从CQE中删除,从而释放了SWQ和CQ两者的空间。 SWQ中可用的条目数由ULP进行监视,以使其不会覆盖任何有效的条目。 同样,IPSOE监视CQ中可用条目的数量,以免覆盖CQ。 ULP和IPSOE之间的流量控制是基于信用的。 CQ信用证的通过是在ULP和IPSOE之间管理SWQ和CQ两者流量控制所需的唯一明确的机制。

    Non-coded information and companion data switching mechanism
    80.
    发明授权
    Non-coded information and companion data switching mechanism 失效
    非编码信息和配套数据交换机制

    公开(公告)号:US4811339A

    公开(公告)日:1989-03-07

    申请号:US33276

    申请日:1987-04-02

    CPC分类号: H04L12/64 H04M11/068

    摘要: Mechanism for allowing data and packetized non coded information NCI such as packetized voice or images, to be exchanged between workstations connected to nodes of a communication network. The workstations arrange the bit stream to be sent into a format of regularly occurring time slots separated by flags. The data only containing time slots begin with a first flag (F2), the NCI only containing and NCI and data containing time slots begin with a second flag (F1) and inside these slots, flag F2 separates the NCI and data portions.The route between two workstations is established by a data session using the node resources. Once a route is established, the NCI portions of the bit stream are switched using high speed bus 26 and the data portions are routed using the normal data paths.