CN101800631B - Frame processing method and device in logic link control - Google Patents
Frame processing method and device in logic link control Download PDFInfo
- Publication number
- CN101800631B CN101800631B CN 201010104204 CN201010104204A CN101800631B CN 101800631 B CN101800631 B CN 101800631B CN 201010104204 CN201010104204 CN 201010104204 CN 201010104204 A CN201010104204 A CN 201010104204A CN 101800631 B CN101800631 B CN 101800631B
- Authority
- CN
- China
- Prior art keywords
- frame
- bitmap
- bit
- field
- effective
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Detection And Prevention Of Errors In Transmission (AREA)
- Communication Control (AREA)
Abstract
The embodiment of the invention discloses a frame processing method and a device in logic link control, wherein the method comprises the following steps: receiving a sending acknowledgement frame sent by a data receiving terminal; acquiring effective bitmap fields in bitmap fields carried by the sending acknowledgement frame, wherein the effective bitmap fields are fields from the most significant bit of 1 to the least significant bit in the bitmap fields; and computing missing frames through the effective bitmap fields. In the realization mode, the most significant bit of 1 of the bitmaps of the sending acknowledgement frame and the bits following the most significant bit are used as the effective bitmap fields, the missing frames are computed by the effective bitmaps, and the problem of retransmission of an I frame sent in a delay period caused by computing the missing frames by redundant bits of 0 is avoided, thereby saving vacancy resources.
Description
Technical field
The present invention relates to communication technical field, particularly frame processing method and the device in a kind of logic link control.
Background technology
(General Packet Radio Service, GPRS) for the user provides wireless data transfer services, (Logical Link Control LLC) belongs to link layer protocol in the GPRS protocol stack to general packet radio service in logic link control.LLC supports two kinds of data-transmission modes: asynchronous disconnected pattern (Asynchronous Disconnected Mode, ADM) and asynchronous stable mode (AsynchronousBalanced Mode, ABM).Wherein, under ABM, the receiving terminal of LLC layer will confirm that transmitting terminal need retransmit the data of losing according to the affirmation information of receiving terminal to the data that transmitting terminal sends.
Among the LLC ABM, the I frame is used for data and sends, and the S frame is used for data validation; Wherein, Parameter N S represents the sequence number of transmitting terminal I frame in the I frame frame head, Parameter N R represents to wish the sequence number of the next I frame that sends in opposite end in the S frame frame head, the S frame roughly has 4 types, wherein send and confirm (Send ack, SACK) Parameter N R represents that sequence number is that NR-1 and former I frame thereof have all been received in the frame frame head, does not receive but sequence number is the I frame of NR; The SACK frame head also has bitmap in addition, bitmap is the longest to be 32 bytes (byte contains 8 bits (Byte)), each bit of bitmap represents the reception condition of an I frame, and R (n)=1 expression sequence number is that the I frame of NR+n has been received, R (n)=0 expression sequence number is that the I frame of NR+n is not received.If agreement regulation bitmap lengths is not the integral multiple of 8 bits, then the R of redundance (n) extends this as 0.
Frame processing method in the explanation prior art that now cites an actual example in the logic link control, transmitting terminal be mobile device (Mobile Station, MS) receiving terminal be Serving GPRS Support Node (Serving GPRSSupport Node, SGSN)
001) MS-＞SGSN: send the I frame, NS=0
002) MS-＞SGSN: send the I frame, NS=1
003) MS-＞SGSN: send the I frame, NS=2
004) MS-＞SGSN: send the I frame, NS=3
005) SGSN-＞MS: receive the RR frame, NR=1, expression SGSN has received the I frame of NS=0
006) MS-＞SGSN: send the I frame, NS=4
007) SGSN-＞MS: receive the RR frame, NR=2, expression SGSN has received the I frame of NS=1
008) MS-＞SGSN: send the I frame, NS=5
009) MS-＞SGSN: send the I frame, NS=6
010) MS-＞SGSN: send the I frame, NS=7
011) SGSN-＞MS: receive the SACK frame, NR=2, bitmap lengths is 1 byte, bitmap is:
| 0 | ?1 | ?0 | ?0 | ?0 | ?0 | ?0 | ?0 |
012) MS-＞SGSN: retransmit the I frame, NS=2
013) MS-＞SGSN: retransmit the I frame, NS=3
014) MS-＞SGSN: retransmit the I frame, NS=5
015) MS-＞SGSN: retransmit the I frame, NS=6
016) MS-＞SGSN: retransmit the I frame, NS=7
017) MS-＞SGSN: send the I frame, NS=8
From above-mentioned flow process, SGSN has returned the SACK frame when receiving the I frame of NS=4, transfer of data has time-delay owing to eat dishes without rice or wine, when receiving the SACK frame, MS sent NS and is 5,6,7 I frame, and bitmap is unit with Byte in the SACK frame, when the actual bit length of bitmap was not 8 integral multiple, it was 0 bit that bitmap has unnecessary.The I frame (NS is 5,6,7 I frame in the example) that can cause data sending terminal to think like this to send between time delay has also been lost, and has caused the re-transmission of unnecessary I frame.
The inventor finds in realizing process of the present invention: because the transfer of data of eating dishes without rice or wine has time delay, data receiver also has delay to the affirmation of the I frame of data transmitting terminal, has the I frame at the timing period data sending terminal and sends.When the actual bit length of bitmap was not 8 integral multiple, it was 0 bit that bitmap has unnecessary.The I frame that can cause data sending terminal to take for the timing period transmission has also been lost, and the I frame that causes timing period to send retransmits, the waste interface-free resources.
Summary of the invention
The technical problem that the embodiment of the invention will solve provides frame processing method and the device in a kind of logic link control, saves interface-free resources.
For solving the problems of the technologies described above, the frame processing method embodiment in the logic link control provided by the present invention can be achieved through the following technical solutions:
Receive the transmission acknowledgement frame that data receiver sends;
Obtain the effective bitmap field that sends in the bitmap field that acknowledgement frame carries, described effective bitmap field is from being that 1 most significant bit begins to the field of the bit of lowest order in the bitmap field;
Calculate the frame of losing by described effective bitmap field.
Frame processing apparatus in a kind of logic link control comprises:
Send the acknowledgement frame receiving element, be used for receiving the transmission acknowledgement frame that data receiver sends;
The bitmap confirmation unit is used for obtaining the effective bitmap field that sends the bitmap field that acknowledgement frame carries, and described effective bitmap field is from being that 1 most significant bit begins to the field of the bit of lowest order in the bitmap field;
The frame computing unit is used for calculating the frame of losing by described effective bitmap field.
Technique scheme has following beneficial effect: will send acknowledgement frame bitmap be 1 most significant bit, and the following effective bitmap field of bit conduct of above-mentioned most significant bit, use effective bitmap to calculate the frame of losing, having avoided using unnecessary is that 0 bit calculates lost frames, the problem that the I frame that causes timing period to send retransmits, thus interface-free resources saved.
Description of drawings
In order to be illustrated more clearly in the technical scheme in the embodiment of the invention, the accompanying drawing of required use is done to introduce simply in will describing embodiment below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is the embodiment of the invention one method flow schematic diagram;
Fig. 2 is the embodiment of the invention one method example process schematic diagram;
Fig. 3 is embodiment of the invention two devices structural representation;
Fig. 4 is embodiment of the invention two devices structural representation;
Fig. 5 is embodiment of the invention two devices structural representation;
Fig. 6 is embodiment of the invention two devices structural representation;
Fig. 7 is embodiment of the invention two devices structural representation.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that obtains under the creative work prerequisite.
Embodiment one, and the invention process provides the frame processing method in a kind of logic link control, comprising:
101: receive the transmission acknowledgement frame that data receiver sends;
102: obtain the effective bitmap field that sends in the bitmap field that acknowledgement frame carries, above-mentioned effective bitmap field is from being that 1 most significant bit begins to the field of the bit of lowest order in the bitmap field;
Above-mentioned 102 implementation method can for: read successively from a high position to the low level of the bitmap of above-mentioned transmission acknowledgement frame, when read determine when being 1 bit above-mentioned be 1 bit and above-mentioned be that bit below 1 the bit is effective bitmap field.More than to 102 realize be not for example confirm bitmap a high position first be the sole mode of 1 bit, for example can also be from the low level to a high position, to read, when reading 1, record this position, continue then to read to a high position, if upgrade the position of above-mentioned record when reading 1, up to running through whole bitmap, with the lowest order of bitmap to the field of 1 position of record as effective bitmap, also can realize; So above to 102 realize should not be construed as restriction to the embodiment of the invention as a preferred implementation for example.
103: calculate the frame of losing by above-mentioned effective bitmap field.
Above-mentioned 102 and 103 specific implementation comprises: calculate above-mentioned be 1 bit following be the frame of 0 bit correspondence, the frame that obtains above-mentioned correspondence is the frame of losing.Above-mentioned 102 and 103 specific implementation be not unique implementation of above-mentioned 102 and 103 for example, for example all right: read successively from low level to the high position of above-mentioned effective bitmap, if 0 to calculate this be that the frame of 0 bit correspondence is the frame of losing.。So above to 102 and 103 realize should not be construed as restriction to the embodiment of the invention as a preferred implementation for example.
The executive agent of the scheme of embodiment one is the transmitting terminal of data, with send acknowledgement frame bitmap be 1 most significant bit, and the following effective bitmap field of bit conduct of above-mentioned most significant bit, use effective bitmap to calculate the frame of losing, having avoided using unnecessary is that 0 bit calculates lost frames, the problem that the I frame that causes timing period to send retransmits, thus interface-free resources saved.
The embodiment of the invention also provides an example to come the frame processing method in the logic link control provided by the invention is described further, as shown in Figure 2:
201) MS-＞SGSN: send the I frame, NS=0
202) MS-＞SGSN: send the I frame, NS=1
203) MS-＞SGSN: send the I frame, NS=2
204) MS-＞SGSN: send the I frame, NS=3
205) SGSN-＞MS: receive the RR frame, NR=1, expression SGSN has received the I frame of NS=0
206) MS-＞SGSN: send the I frame, NS=4
207) SGSN-＞MS: receive the RR frame, NR=2, expression SGSN has received the I frame of NS=1
208) MS-＞SGSN: send the I frame, NS=5
209) MS-＞SGSN: send the I frame, NS=6
210) MS-＞SGSN: send the I frame, NS=7
211) SGSN-＞MS: receive the SACK frame, NR=2, bitmap lengths is 1 byte, bitmap is
| 0 | ?1 | ?0 | ?0 | ?0 | ?0 | ?0 | ?0 |
212) MS-＞SGSN: retransmit the I frame, NS=2
213) MS-＞SGSN: retransmit the I frame, NS=3
214) MS-＞SGSN: send the I frame, NS=8
It is 5,6,7 I frame that above example has retransmitted NS less than existing processing mode, thereby saves interface-free resources.
Embodiment two, and as shown in Figure 3, the embodiment of the invention provides the frame processing apparatus in a kind of logic link control, comprising:
Send acknowledgement frame receiving element 301, be used for receiving the transmission acknowledgement frame that data receiver sends;
Alternatively, as shown in Figure 4,
Above-mentioned bitmap confirmation unit 302 comprises: first bitmap is confirmed subelement 401, be used for reading successively from a high position to the low level of the bitmap of above-mentioned transmission acknowledgement frame, when read determine when being 1 bit above-mentioned be 1 bit and above-mentioned be that bit below 1 the bit is effective bitmap field.
Alternatively, as shown in Figure 5,
Above-mentioned frame computing unit 303 comprises: the first frame computation subunit 501, be used for to calculate above-mentioned be 1 bit following be the frame of 0 bit correspondence, the frame that obtains above-mentioned correspondence is the frame of losing.
Alternatively, as shown in Figure 6,
Above-mentioned bitmap confirmation unit 302 comprises: second bitmap is confirmed subelement 601, be used for from the low level to a high position, reading successively bitmap, when reading 1, record this position, continue then to read to a high position, if upgrade the position of above-mentioned record when reading 1, up to running through whole bitmap, with the lowest order of bitmap to the field of 1 position of record as effective bitmap.
Alternatively, as shown in Figure 7,
Above-mentioned frame computing unit 303 comprises: the second frame computation subunit 701, be used for reading successively from low level to the high position of above-mentioned effective bitmap, if 0 to calculate this be that the frame of 0 bit correspondence is the frame of losing.
The device of the scheme of embodiment two is the transmitting terminal of data, with send acknowledgement frame bitmap be 1 most significant bit, and the following effective bitmap field of bit conduct of above-mentioned most significant bit, use effective bitmap to calculate the frame of losing, having avoided using unnecessary is that 0 bit calculates lost frames, the problem that the I frame that causes timing period to send retransmits, thus interface-free resources saved.
One of ordinary skill in the art will appreciate that all or part of step that realizes in above-described embodiment method is to instruct relevant hardware to finish by program, above-mentioned program can be stored in a kind of computer-readable recording medium, the above-mentioned storage medium of mentioning can be read-only memory, disk or CD etc.
More than frame processing method and device in a kind of logic link control that the embodiment of the invention is provided be described in detail, used specific case herein principle of the present invention and execution mode are set forth, the explanation of above embodiment just is used for helping to understand method of the present invention and core concept thereof; Simultaneously, for one of ordinary skill in the art, according to thought of the present invention, the part that all can change in specific embodiments and applications, to sum up, this description should not be construed as limitation of the present invention.
Claims (10)
1. the frame processing method in the logic link control is characterized in that, comprising:
Receive the transmission acknowledgement frame that data receiver sends;
Obtain the effective bitmap field that sends in the bitmap field that acknowledgement frame carries, described effective bitmap field is from being that 1 most significant bit begins to the field of the bit of lowest order in the bitmap field;
Calculate the frame of losing by described effective bitmap field.
2. according to the described method of claim 1, it is characterized in that, obtain the effective bitmap field that sends in the bitmap field that acknowledgement frame carries, described effective bitmap field be in the bitmap field from being that 1 most significant bit begins to comprise to the field of the bit of lowest order:
Read successively from a high position to the low level of the bitmap of described transmission acknowledgement frame, when read determine when being 1 bit described be 1 bit and described be that bit below 1 the bit is effective bitmap field.
3. according to the described method of claim 2, it is characterized in that, calculate the frame of losing by described effective bitmap field and comprise:
Calculate described be 1 bit following be the frame of 0 bit correspondence, the frame that obtains described correspondence is the frame of losing.
4. according to the described method of claim 1, it is characterized in that the described effective bitmap field that sends in the bitmap field that acknowledgement frame carries of obtaining comprises:
From the low level to a high position, read bitmap successively, when reading 1, record this position, continue then to read to a high position, if upgrade the position of above-mentioned record when reading 1, up to running through whole bitmap, with the lowest order of bitmap to the field of 1 position of record as effective bitmap.
5. according to the described method of claim 4, it is characterized in that, calculate the frame of losing by described effective bitmap field and comprise:
Read successively from low level to the high position of described effective bitmap, if 0 to calculate this be that the frame of 0 bit correspondence is the frame of losing.
6. the frame processing apparatus in the logic link control is characterized in that, comprising:
Send the acknowledgement frame receiving element, be used for receiving the transmission acknowledgement frame that data receiver sends;
The bitmap confirmation unit is used for obtaining the effective bitmap field that sends the bitmap field that acknowledgement frame carries, and described effective bitmap field is from being that 1 most significant bit begins to the field of the bit of lowest order in the bitmap field;
The frame computing unit is used for calculating the frame of losing by described effective bitmap field.
7. according to the described device of claim 6, it is characterized in that described bitmap confirmation unit comprises:
First bitmap is confirmed subelement, be used for reading successively from a high position to the low level of the bitmap of described transmission acknowledgement frame, when read determine when being 1 bit described be 1 bit and described be that bit below 1 the bit is effective bitmap field.
8. according to the described device of claim 7, it is characterized in that described frame computing unit comprises:
The first frame computation subunit, be used for to calculate described be 1 bit following be the frame of 0 bit correspondence, the frame that obtains described correspondence is the frame of losing.
9. according to the described device of claim 6, it is characterized in that described bitmap confirmation unit comprises:
Second bitmap is confirmed subelement, be used for from the low level to a high position, reading successively bitmap, when reading 1, record this position, continue then to read to a high position, if upgrade the position of above-mentioned record when reading 1, up to running through whole bitmap, with the lowest order of bitmap to the field of 1 position of record as effective bitmap.
10. according to the described device of claim 9, it is characterized in that described bitmap confirmation unit comprises:
The second frame computation subunit is used for reading successively from low level to the high position of described effective bitmap, if 0 to calculate this be that the frame of 0 bit correspondence is the frame of losing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010104204 CN101800631B (en) | 2010-01-27 | 2010-01-27 | Frame processing method and device in logic link control |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010104204 CN101800631B (en) | 2010-01-27 | 2010-01-27 | Frame processing method and device in logic link control |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101800631A CN101800631A (en) | 2010-08-11 |
| CN101800631B true CN101800631B (en) | 2013-08-14 |
Family
ID=42596140
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010104204 Active CN101800631B (en) | 2010-01-27 | 2010-01-27 | Frame processing method and device in logic link control |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101800631B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102404098B (en) * | 2010-09-14 | 2015-01-07 | 中兴通讯股份有限公司 | Transmission method and transmission device of link access procedure of D channel |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101124762A (en) * | 2004-07-30 | 2008-02-13 | 诺基亚公司 | System and method for variable length acknowledgements in a shared resource network |
| CN101189831A (en) * | 2005-06-17 | 2008-05-28 | 株式会社东芝 | Responder (e.g. 802.11n) transmitting acknowledgements in an extra physical frame at a first transmission rate |
-
2010
- 2010-01-27 CN CN 201010104204 patent/CN101800631B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101124762A (en) * | 2004-07-30 | 2008-02-13 | 诺基亚公司 | System and method for variable length acknowledgements in a shared resource network |
| CN101189831A (en) * | 2005-06-17 | 2008-05-28 | 株式会社东芝 | Responder (e.g. 802.11n) transmitting acknowledgements in an extra physical frame at a first transmission rate |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101800631A (en) | 2010-08-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102067497B (en) | Method and apparatus for acknowledgement and retransmission of multicast data in wireless local area networks | |
| CN102057608B (en) | Confirm and the equipment that transmission multi-case data confirms for asking in WLAN (wireless local area network) | |
| TWI272802B (en) | Flexible ARQ for packet data transmission | |
| CN100359839C (en) | Method for minimizing feedback responses in ARQ protocols | |
| CN101103579B (en) | Techniques to manage retransmissions in a wireless network | |
| US8559365B2 (en) | After transmission return signal | |
| US9025460B2 (en) | Method and transmitting unit for reducing a risk of transmission stalling | |
| CN102611537B (en) | A kind of repeating method of packet and device | |
| US20060195753A1 (en) | Bitmap manager, method of allocating a bitmap memory, method of generating an acknowledgement between network entities, and network entity implementing the same | |
| KR100750170B1 (en) | Method and apparatus for transmitting data frame efficiently in communication network | |
| JP2011501483A (en) | Millimeter-wave communication for peripheral devices | |
| CN101682557A (en) | Transmitting data in a mobile communication system | |
| US20110107168A1 (en) | Apparatus and method for generating arq feedback message in wireless communication system | |
| US11991599B2 (en) | Configuring a multicast or broadcast wireless network | |
| CN111770428B (en) | Monitoring method of wireless equipment | |
| US9081905B2 (en) | Low latency interconnect bus protocol | |
| CN107172649A (en) | A kind of data transmission method and equipment | |
| US9729269B2 (en) | Wireless communication system including communication apparatus and data communication method thereof | |
| CN103036657A (en) | Method and device for data transmission | |
| CN101174927B (en) | Feedback method for processing data accepting state and its receiving and transmitting device | |
| CN101494531B (en) | Method and apparatus for adjusting slide window | |
| CN103368865B (en) | Adaptive communication method and system based on Multi net voting access interface | |
| CN107209713A (en) | The method and system that file is repaired on demand | |
| CN102299777A (en) | Data retransmission method and device | |
| EP3790213B1 (en) | Mac-based hybrid automatic repeat request (harq) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 518129 Building 2, B District, Bantian HUAWEI base, Longgang District, Shenzhen, Guangdong. Patentee after: Huawei terminal (Shenzhen) Co.,Ltd. Address before: 518129 Building 2, B District, Bantian HUAWEI base, Longgang District, Shenzhen, Guangdong. Patentee before: HUAWEI DEVICE Co.,Ltd. |
|
| CP01 | Change in the name or title of a patent holder | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20181218 Address after: 523808 Southern Factory Building (Phase I) Project B2 Production Plant-5, New Town Avenue, Songshan Lake High-tech Industrial Development Zone, Dongguan City, Guangdong Province Patentee after: HUAWEI DEVICE Co.,Ltd. Address before: 518129 Building 2, B District, Bantian HUAWEI base, Longgang District, Shenzhen, Guangdong. Patentee before: Huawei terminal (Shenzhen) Co.,Ltd. |
|
| TR01 | Transfer of patent right |