TRAFFIC SCHEDULING DEVICE
    2.
    发明公开
    TRAFFIC SCHEDULING DEVICE 有权
    VERKEHRSPLANUNGSVORRICHTUNG

    公开(公告)号:EP2695325A1

    公开(公告)日:2014-02-12

    申请号:EP12702255.6

    申请日:2012-02-02

    IPC分类号: H04L12/00

    摘要: The invention relates to a Traffic scheduling device (100) for scheduling a transmission sequence of data packets, stored in a plurality of traffic flow queues (102), an eligibility state of each of the traffic flow queues (102) for the scheduling is being maintained in a hierarchical scheduling database (104) describing a relationship among the plurality of traffic flow queues (102), the traffic scheduling device (100) comprising: a plurality of interconnected memory cluster units (106a, 106b, 106c, 106d), each of them being associated to a single or more levels (L1, L2, L3, L4, L5, L6) of the hierarchical scheduling database (104) and each of them being coupled to at least one co-processors (108, 110, 112), at least one co-processor (108, 110, 112) being software-programmable to implement a scheduling algorithm; and an interface (114) to the plurality of traffic flow queues (102), the interface (114) being used to identify one or more packets associated to a particular traffic flow queue (102) selected for transmission according to the scheduling algorithm and the interface (114) being configured to signal the eligibility state of each of the traffic flow queues (102) of the plurality of traffic flow queues (102).

    摘要翻译: 本公开涉及一种用于调度存储在多个业务流队列中的数据分组的传输序列的业务调度设备,用于调度的每个业务流队列的资格状态正在维护在描述关系的分层调度数据库中 在多个业务流队列中。 交通调度装置包括:多个互连的存储器簇单元。 每个存储器簇单元与分层调度数据库的单个或多个级别相关联,并且每个存储器簇单元耦合到至少一个协处理器。 至少一个协处理器是软件可编程的,以实现调度算法。 流量调度设备还包括到多个业务流队列的接口。

    PACKET REASSEMBLY AND RESEQUENCE METHOD, APPARATUS AND SYSTEM
    5.
    发明公开
    PACKET REASSEMBLY AND RESEQUENCE METHOD, APPARATUS AND SYSTEM 有权
    分组重组和重新排序方法,装置和系统

    公开(公告)号:EP2736197A1

    公开(公告)日:2014-05-28

    申请号:EP11866504.1

    申请日:2011-08-17

    IPC分类号: H04L12/56

    摘要: A method for packet reassembly and reordering, comprising: receiving a cell sent by a source port, wherein the cell carries a Source Identification (SID), a packet sequence number and a cell sequence number; preprocessing the received cell according to the SID to determine whether the cell shall be inserted into a packet reassembly database; ordering cells in the packet reassembly database according to the packet sequence number to obtain a correctly ordered packet; if the correctly ordered packet is a complete packet, ordering the cells of the correctly ordered packet according to the cell sequence number to obtain correctly ordered cells; and performing a packet reassembly for the correctly ordered cells. Correspondingly, a network device and a communication system are provided.

    摘要翻译: 1。一种分组重组和重排序的方法,其特征在于,包括:接收源端口发送的信元,所述信元携带源标识SID,分组序号和小区序号; 根据所述SID预处理所接收的信元以确定所述信元是否应被插入到分组重组数据库中; 根据分组序列号在分组重组数据库中排序小区以获得正确排序的分组; 如果正确排序的数据包是完整的数据包,则根据小区的序列号排序正确排序的数据包的小区,以获得正确排序的小区; 并为正确排序的单元执行数据包重组。 相应地,提供了一种网络设备和通信系统。

    TRANSMISSION AND RECEPTION DEVICES FOR REDUCING THE DELAY IN END-TO-END DELIVERY OF NETWORK PACKETS
    7.
    发明公开
    TRANSMISSION AND RECEPTION DEVICES FOR REDUCING THE DELAY IN END-TO-END DELIVERY OF NETWORK PACKETS 有权
    SENDE- UND EMPFANGSVORRICHTUNGEN ZUR VERRINGERUNG DERVERZÖGERUNGBEI End-to-END-LIEFERUNG VON NETZWERKDATENPAKETEN

    公开(公告)号:EP3047617A1

    公开(公告)日:2016-07-27

    申请号:EP13765711.0

    申请日:2013-09-19

    摘要: The invention relates to a transmission device (110) comprising a processor, configured: (1) to submit multiple read request messages (ReadA, ReadB) over a host interface corresponding to buffers of one or more network packets, (a) to assign for each network packet a unique packet identifier, (b) to calculate for each read request message a start byte offset indicating a relative location of a first completion byte of the read request message within the original network packet, (c) to store the unique packet identifier and the start byte offset as an entry within a transmission database (113); and (3) upon arrival of completion data from the host interface for the submitted read request messages, for each read response message (CPL A1): (a) to associate the read response message (CPL A1) with an entry of the transmission database (113) and extract the packet identifier, (b) to transform the read response message (CPL A1) into a fabric cell by the following operations: (c) to mark the fabric cell with the packet identifier, (d) to mark the fabric cell with a byte offset indicating a relative start byte offset of the fabric cell within the associated network packet, wherein the byte offset is calculated by summing a relative start offset of the corresponding read request message and a location of the read response message (CPL A1) within an entire stream of completion bytes of that read request message, (e) to mark the fabric cell with a first flag if the fabric cell represents a first fabric cell of the network packet and a last flag if the fabric cell represents a last fabric cell of the network packet, (f) to release the transmission database (113) entry if the fabric cell is marked with the last flag, and (g) to submit the fabric cell over a fabric interface.

    摘要翻译: 用于减少网络分组的端到端传送的延迟的方法和设备可以通过使设备的传输(TX)侧标记具有唯一分组标识符的每个小区并且具有字符偏移参数来实现,其中标签 允许目的地设备的接收(RX)侧通过直接将它们放置在相应的主机缓冲器上来将小区即时组合成分组,并且该方法可以同时对多个分组进行,因此存储和转发缓冲是 在源或目的设备中不需要,并且实现了尽可能低的端到端切入延迟。

    P-SELECT N-PORT ROUND ROBIN ARBITER FOR SCHEDULING REQUESTS
    8.
    发明公开
    P-SELECT N-PORT ROUND ROBIN ARBITER FOR SCHEDULING REQUESTS 有权
    P-SELECT N-PORT ROUND ROBIN ARBITER ZUM EINTEILEN VON ANFORDERUNGEN

    公开(公告)号:EP3011706A1

    公开(公告)日:2016-04-27

    申请号:EP13733966.9

    申请日:2013-06-19

    IPC分类号: H04L12/54 H04L12/869 G06F9/48

    摘要: The invention relates to a scheduling device (200) for receiving a set of requests (202) and providing a set of grants (204) to the set of requests (202), the scheduling device (200) comprising: a lookup vector prepare unit (203) configured to provide a lookup vector prepared set of requests (208) depending on the set of requests (202) and a selection mask (210) and to provide a set of acknowledgements (212) to the set of requests (202); and a prefix forest unit (205) coupled to the lookup vector prepare unit (203), wherein the prefix forest unit (205) is configured to provide the set of grants (204) as a function of the lookup vector prepared set of requests (208) and to provide the selection mask (210) based on the set of grants (204).

    摘要翻译: 本发明涉及一种用于接收一组请求并向该组请求提供一组授权的调度装置,所述调度装置包括:查找向量准备单元,被配置为根据所述一组请求提供准备的请求集合的查找向量 请求和选择掩码,并向该组请求提供一组确认; 以及耦合到所述查找向量准备单元的前缀林单元,其中所述前缀林单元被配置为根据所述查询向量准备的请求集合来提供所述一组授权,并且基于所述一组授权来提供所述选择掩码。

    MEMORY AGGREGATION DEVICE
    9.
    发明公开
    MEMORY AGGREGATION DEVICE 审中-公开
    存储器汇集DEVICE

    公开(公告)号:EP3011427A1

    公开(公告)日:2016-04-27

    申请号:EP13733967.7

    申请日:2013-06-19

    IPC分类号: G06F5/06

    摘要: The invention relates to a memory aggregation device for storing a set of input data streams and retrieving data to a set of output data streams, the memory aggregation device comprising: a set of first-in first-out (FIFO) memories each comprising an input and an output; an input interconnector configured to interconnect each one of the set of input data streams to each input of the set of FIFO memories according to an input interconnection matrix; an output interconnector configured to interconnect each output of the set of FIFO memories to each one of the set of output data streams according to an output interconnection matrix; an input selector; an output selector; and a memory controller.