公开(公告)号：AT448617T

公开(公告)日：2009-11-15

申请号：AT03818596

申请日：2003-09-11

Applicant: ERICSSON TELEFON AB L M

Inventor： MEIRICK INGO ,  NORDSTROEM HAKAN ,  WESTERBERG ERIK ,  SCHLIWA-BERTLING PAUL ,  EKSTROEM HANNES

IPC: H04L12/56 ,  H04L29/06 ,  H04Q11/04

Abstract: The technology described relates to management of data packets and buffers comprising segments of data packets in a mobile communication system. Information associated with data packet segments is analyzed by a Base Station System (BSS) housing a data buffer. Based on this information analysis, the BSS can identify those segments in the buffer that constitute a complete data packet. Once identified, the segments can be discarded from the buffer. The information can include size information, whereby the analysis comprises pairwise comparing the size of a current segment with the size of a next consecutive segment. This size comparison enables identification of a first segment and a last segment of the complete data packet. The information could also, or alternatively, include a notification provided in the header of the segment. This notification identifies the associated segment as the first or last segment of the data packet or an intermediate segment.

公开(公告)号：AU2003263702A1

公开(公告)日：2005-03-29

申请号：AU2003263702

申请日：2003-09-11

Applicant: ERICSSON TELEFON AB L M

Inventor： MEIRICK INGO ,  NORDSTROM HAKAN ,  WESTERBERG ERIK ,  SCHLIWA-BERTLING PAUL ,  EKSTROM HANNES

IPC: H04L12/56 ,  H04L29/06 ,  H04Q11/04

Abstract: The technology described relates to management of data packets and buffers comprising segments of data packets in a mobile communication system. Information associated with data packet segments is analyzed by a Base Station System (BSS) housing a data buffer. Based on this information analysis, the BSS can identify those segments in the buffer that constitute a complete data packet. Once identified, the segments can be discarded from the buffer. The information can include size information, whereby the analysis comprises pairwise comparing the size of a current segment with the size of a next consecutive segment. This size comparison enables identification of a first segment and a last segment of the complete data packet. The information could also, or alternatively, include a notification provided in the header of the segment. This notification identifies the associated segment as the first or last segment of the data packet or an intermediate segment.

公开(公告)号：DE60330069D1

公开(公告)日：2009-12-24

申请号：DE60330069

申请日：2003-09-11

Applicant: ERICSSON TELEFON AB L M

Inventor： MEIRICK INGO ,  NORDSTROEM HAKAN ,  WESTERBERG ERIK ,  SCHLIWA-BERTLING PAUL ,  EKSTROEM HANNES

IPC: H04L12/56 ,  H04L29/06 ,  H04Q11/04

Abstract: The technology described relates to management of data packets and buffers comprising segments of data packets in a mobile communication system. Information associated with data packet segments is analyzed by a Base Station System (BSS) housing a data buffer. Based on this information analysis, the BSS can identify those segments in the buffer that constitute a complete data packet. Once identified, the segments can be discarded from the buffer. The information can include size information, whereby the analysis comprises pairwise comparing the size of a current segment with the size of a next consecutive segment. This size comparison enables identification of a first segment and a last segment of the complete data packet. The information could also, or alternatively, include a notification provided in the header of the segment. This notification identifies the associated segment as the first or last segment of the data packet or an intermediate segment.

公开(公告)号：ES2335880T3

公开(公告)日：2010-04-06

申请号：ES03818596

申请日：2003-09-11

Applicant: ERICSSON TELEFON AB L M

Inventor： MEIRICK INGO ,  NORDSTROM HAKAN ,  WESTERBERG ERIK ,  SCHLIWA-BERTLING PAUL ,  EKSTROM HANNES

IPC: H04L12/56 ,  H04L29/06 ,  H04Q11/04

Abstract: Un método para permitir la identificación de un paquete de datos completo en una memoria intermedia (buffer) de datos (120) que comprende una cola de segmentos de paquetes de datos consecutivos, caracterizado por: - comparar un tamaño S(k) de un segmento de paquete de datos (P(k)) con un tamaño (S(k+1)) de un segmento de paquete de datos (P(k)) en la citada memoria intermedia (buffer) de datos (120); e - identificar el citado paquete de datos completo basándose en la citada comparación.