Methods and apparatus for reorganizing cells buffered after transmission
    1.
    发明申请
    Methods and apparatus for reorganizing cells buffered after transmission 有权
    传播后缓冲细胞重组细胞的方法和装置

    公开(公告)号:US20070153819A1

    公开(公告)日:2007-07-05

    申请号:US11326047

    申请日:2006-01-05

    CPC classification number: H04L49/9094 H04L49/90

    Abstract: A method and apparatus of reorganizing cells received over data communication lines at a receive node is provided. The cells have an initial order identified by monotonically increasing sequence identifiers. The receive node has buffers associated with respective ones of the communication lines. Each of the buffers has an output position. A cell having a smallest sequence identifier is detected from one or more cells at the output positions of the buffers. It is determined if the smallest sequence identifier is sequentially consecutive to a specified sequence identifier. If the smallest sequence identifier is sequentially consecutive to the specified sequence identifier, the cell having the smallest sequence identifier is dequeued from an output position of one of the buffers and the specified sequence identifier is redefined as the smallest sequence identifier.

    Abstract translation: 提供了一种在接收节点上通过数据通信线路重新组合接收的小区的方法和装置。 单元具有通过单调增加序列标识符来识别的初始顺序。 接收节点具有与相应通信线路相关联的缓冲器。 每个缓冲器都有一个输出位置。 从缓冲器的输出位置的一个或多个单元检测具有最小序列标识符的单元。 确定最小序列标识符是否与指定的序列标识符顺序连续。 如果最小的序列标识符与指定的序列标识符顺序连续,则具有最小序列标识符的小区从一个缓冲区的输出位置出出,并且将指定的序列标识符重新定义为最小的序列标识符。

    Methods and apparatus for minimizing sequence identifier difference of simultaneously transmitted cells
    2.
    发明申请
    Methods and apparatus for minimizing sequence identifier difference of simultaneously transmitted cells 失效
    用于最小化同时传输的小区的序列标识符差异的方法和装置

    公开(公告)号:US20070025356A1

    公开(公告)日:2007-02-01

    申请号:US11193799

    申请日:2005-07-29

    CPC classification number: H04L47/30 H04L45/245 H04L47/34 H04L49/90

    Abstract: A method of minimizing SID difference of simultaneously transmitted cells in two or more data communication lines is provided. A data transmission speed of each of the two or more data communication lines is identified. A fullness threshold of at least one buffer of two or more buffers in a transmit node is configured in relation to a size of a data cell for transmission. The two or more buffers correspond to respective ones of the two or more data communication lines. The at least one buffer communicates with a given one of the two or more data communication lines having a data transmission speed slower than another of the two or more data communication lines. One or more data cells for transmission are assigned to the two or more buffers of the two or more data communication lines at the transmit node. The one or more data cells are transmitted from the transmit node to a receive node in accordance with the data transmission speeds of the two or more data communication lines. The fullness threshold of the at least one buffer controls assignment of data cells to the at least one buffer during data cell transmission on the given data communication line and minimizes SID difference of simultaneously transmitted cells in the two or more data communication lines.

    Abstract translation: 提供了一种使两个或多个数据通信线路中的同时发送的小区的SID差异最小化的方法。 识别两条或多条数据通信线路中的每一条的数据传输速度。 发送节点中的两个或更多个缓冲器的至少一个缓冲器的饱和度阈值被配置为用于传输的数据单元的大小。 两个或更多个缓冲器对应于两个或更多个数据通信线路中的相应的缓冲器。 所述至少一个缓冲器与所述两条或更多条数据通信线路中的给定的一条数据传输速度比所述两条或更多条数据通信线路中的另一条数据传输速度慢。 用于发送的一个或多个数据单元被分配给发送节点处的两个或更多个数据通信线路的两个或更多个缓冲器。 根据两条或多条数据通信线路的数据传输速度,一个或多个数据信元从发送节点发送到接收节点。 所述至少一个缓冲器的饱和度阈值在所述给定数据通信线路上的数据单元传输期间控制数据单元向所述至少一个缓冲器的分配,并且最小化两个或更多个数据通信线路中同时发送的小区的SID差异。

Patent Agency Ranking