CN103067971A - TCP (transmission control protocol) header compression method in wireless IPv6 (internet protocol version 6) network - Google Patents

TCP (transmission control protocol) header compression method in wireless IPv6 (internet protocol version 6) network Download PDF

Info

Publication number
CN103067971A
CN103067971A CN2013100364982A CN201310036498A CN103067971A CN 103067971 A CN103067971 A CN 103067971A CN 2013100364982 A CN2013100364982 A CN 2013100364982A CN 201310036498 A CN201310036498 A CN 201310036498A CN 103067971 A CN103067971 A CN 103067971A
Authority
CN
China
Prior art keywords
tcp
compression
rohc
grouping
profile
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.)
Pending
Application number
CN2013100364982A
Other languages
Chinese (zh)
Inventor
程远
冯刚
常宁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
BEIJING TIANDI INTERCONNECTION INFORMATION TECHNOLOGY Co Ltd
Original Assignee
BEIJING TIANDI INTERCONNECTION INFORMATION TECHNOLOGY Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by BEIJING TIANDI INTERCONNECTION INFORMATION TECHNOLOGY Co Ltd filed Critical BEIJING TIANDI INTERCONNECTION INFORMATION TECHNOLOGY Co Ltd
Priority to CN2013100364982A priority Critical patent/CN103067971A/en
Publication of CN103067971A publication Critical patent/CN103067971A/en
Pending legal-status Critical Current

Links

Images

Abstract

The invention discloses a TCP (transmission control protocol) header compression method in wireless IPv6 network, belonging to the technical field of improving the compression ratio and robustness of a wireless link. The invention emphasizes the three compression states, three working modes, W-LSB (window-based least significant bit) algorithm and the like of ROHC (robust header compression). A classification mode of the TCP header field is provided, and the profile of TCP/IP compression is written according to the ROHC profile specification; the sliding window width is dynamically adjusted to adapt to the change characteristics of the wireless link, and performance simulation and analysis are performed on the provided method; a test information source of ROHC is designed to facilitate the writing and test of the TCP/IP compression profile of ROHC; and according to the TCP/IP header compression technology and performance in a wireless IPv6 (internet protocol version 6) network, the imperfection of the ROHC and TCP compression scheme is improved, and the result is verified through a simulation test in a prototype system.

Description

TCP letter head compression method in a kind of wireless IPv6 Internet
Technical field
The invention belongs to the compression ratio that improves Radio Link and the technical field of robustness, particularly TCP letter head compression method in a kind of wireless IPv6 Internet.
Background technology
By studies show that, the Performance Ratio of agreement on Radio Link of compressed IP on these low speed chain circuits/UDP/RTP letter head is relatively poor.Next step target of letter head compression is Radio Link increase robustness and the compression efficiency in high bit-error, low bandwidth.Provide an a series of compression letter scheme with the Huffman encoding that changes.
In order to obtain higher compression ratio and anti-mistake robustness preferably at Radio Link, need a kind of feasible robustness of exploitation to believe a compression scheme.IETF working group can obtain preferably performance at Radio Link in the robustness letter head compression (ROHC, Robust Header Compression) that calendar year 2001 proposes, and revises again and replenishes in February, 2007.ROHC is applicable to error rate height, and the Radio Link that two-way time is long can compress the multiple letter head such as RTP/UDP/IP, UDP/IP, TCP/IP.As robustness and extendible scheme, ROHC has represented the technical merit of current letter head compression.
But ROHC can't Efficient Compression TCP the letter head of stream, ROHC+ has proposed profile and the algorithm of a kind of effectively compression-tcp stream letter on the basis of ROHC.In order to reduce error propagation, ROHC adopts the W-LSB coding, and is combined with three kinds of different impaired compressed packet of repair mechanisms processing.ROHA also for the ROHC-TCP compression, has proposed the context replicanism.
RFC4995 has further defined the related content of ROHC framework on the basis of RFC3095, comprise the TCP profile of symbol RFC4163 demand.RFC4996 has proposed-an individual TCP letter compression scheme, has strengthened robustness and compatibility, especially for the compression that contains tcp option letter header field.Wherein used the ROHC protocol frame that proposes among the RFC4995, supported the context replication strategy that defines among the RFC4l64, the of short duration TCP in bright for RFC4413.It is very useful that data flow, context copy.
In April, 2008, IETF working group has formally released the improvement version ROHCv2 of ROHC compression.Under same operating condition, RFC5225 can obtain identical compression ratio and robustness with RFC3095, and the size of their minimal compression letter head is consistent with bit layout.ROHCv2 has simplified rule and algorithm, has strengthened the robustness mechanism of packet loss or rearrangement, and can process the m letter head of any amount.
Summary of the invention
The objective of the invention is to propose TCP letter head compression method in a kind of wireless IPv6 Internet, it is characterized in that the method comprises:
(1) according to ROHC profile standard, adopt the W-LSB coding method, write the compression profile of TCP/IP grouping;
(2) in order to make things convenient for writing and debugging of ROHC profile, increase the processing function in the ROHC compressor end, can produce the test packet that is applicable to any type, the compression and decompression function of at any time verification profile;
(3) adopt flexibly adjustable sliding window width mechanism, be specially adapted to be connected to the TCP/IP framework in the Radio Link, because the quick variation of channel quality, find the sliding window width value of the optimization that is fit to various situations, change compression and decompressed state transition logic, introduce additional control information, take into account strong robustness and low overhead;
(4) in the writing of RHOC profile, whether what often need test profile writes or revises effective, at this moment need to have especially and test flexibly information source, checks at any time the compression and decompression function of profile, carries out next step modification; For connection-oriented TCP current test, do not needing to connect in advance and loopback is confirmed in the situation of grouping, the RHOC compression/de-compression test of TCP/IP stream can continue to carry out.
The compression profile of described TCP, TCP/IP is connection-oriented stream, adopts two-way reliable connection mode between the sending and receiving two ends, according to three-way handshake, must set up the agreement connection before meaning exchanges data, the TCP guarantee is distributed the error-free client that is grouped into afterwards; TCP divides into groups the data flow that application service produces, and in the grouping that sends, the IP layer comprises the load of grouping and sequence number as first byte of grouping; In client, for any grouping that receives, TCP sends the affirmation grouping that contains the first byte sequence number, shows the next one grouping that the client expectation receives.
The dynamic adjustment of described sliding window width, the W-LSB algorithm does not need synchronously accurate, in W-LSB to each stream, compressor reducer is preserved the sliding window of a nearest SWW reference value, decompression machine is only safeguarded the reference value of nearest successful decompress(ion), and to each grouping, compressor reducer assurance compressed packet can use any reference value in the sliding window to carry out decompress(ion), therefore, the decompress(ion) context can use any one reference value in the decompressor sliding window; The robustness of W-LSB algorithm is can tolerate under the worst case (SWW-1) individual continuous packet loss, and can not cause the infringement diffusion; Wherein, the robustness of W-LSB coding is if the packet loss number is no more than the SWW length of window continuously, and namely the number of lost packets is less than the number of reference value, and decompression machine is correct decompress(ion) still.
The improvement of described dynamic adjustment, in the O of ROHC pattern and R pattern, when the decompress(ion) failure, decompression machine sends NACK and STATIC NACK negative-feedback information to compressor reducer, the request compressor reducer sends complete packet and upgrades context, therefore can utilize NACK and STATIC nack message dynamically to adjust the value of SWW; The sliding window width that described compressor reducer is preserved the reference compression value is made as SWW C, and the sliding window width that decompression machine is preserved the decompress(ion) reference value is made as SWW D, for the width of sliding window is set initial value; Compressor end receives NACK and the STATIC-nack message means the failure of decompression machine decompress(ion), shows to have packet loss, and therefore current SWW C value is too little, need to increase exponentially SWW C value and avoid further decompress(ion) failure; The decompression machine end increases according to same rule before sending NACK and STATIC-NACK negative feedback.
It is of the present invention that beneficial effect is arranged is to have studied algorithm and the working mechanism of the compression of ROHC letter head, analyzed the limitation of CP/IP letter head compression, technology and performance for TCP/IP letter head compression in the wireless IPv6 network, improve ROHC and the incomplete place of TCP compression scheme, in prototype system, verified the result by emulation testing.
Description of drawings
Fig. 1 is TCP compression basic framework figure.
Fig. 2 is the compression process schematic diagram of RHOC.
Fig. 3 is the W-LSB algorithm flow chart.
Embodiment
1, ROHC agreement and realization thereof
The basic principle of paper ROHC.In order to realize the compression of letter head, need in the TCP/IP framework, add two new functional units: a letter compressor reducer and a letter decompression machine, as shown in Figure 1.
The ROHC compressor reducer has three kinds of compressive states, each all is compression in various degree, be respectively: IR state (Initialization and Refresh), FO state (First Order) and SO state (Second Order), these three kinds of compressive state ranks raise successively, compressor reducer is always started working from lowest compression state melon state, then successively to the advanced compression state transitions.Every kind of compressive state is used different letter head types under each mode of operation.
ROHC has defined three kinds of mode of operations: unidirectional mode (Unidirectional, U-Mode), two-way optimistic pattern (Bidirectional Optimistic, O-Mode), bidirectional reliable mode (Bidirectional Reliable, R-Mode).Under every kind of pattern different compressive states and decompressed state are arranged, compression/de-compression state transitions mode corresponding to different mode of operations is also different.
The compression algorithm of ROHC, least significant bit (LSB, Least Significant Bit) and the least significant bit (W-LSB of window based, Windows-Least Significant Bits) encryption algorithm is very important Coding Compression Algorithm in the ROHC agreement, whole compression and decompression procedure through ROHC, general being used for carried out compressed encoding to the little field of continuous grouping numerical value change, the field of compressing is with correctly transmission and field are as a reference compared, only transmit the two different significant bits, play the effect of compression.Decompression machine carries out decompress(ion) according to the reference value of the corresponding field of preserving in the decompress(ion) context to the field that LSB encodes or W-LSB encodes that receives, and these fields are returned to the front original value of coding.
2, the compression profile of TCP
TCP/IP is connection-oriented stream, adopts two-way reliable connection mode between the sending and receiving two ends: must set up agreement before this means exchanges data and connect, generally be three-way handshake, and the TCP guarantee is distributed the error-free client that is grouped into afterwards.TCP divides into groups the data flow that application service produces, and in the grouping that sends, the IP layer comprises the load of grouping and sequence number as first byte of grouping.In client, for any grouping that receives, TCP sends the affirmation grouping that contains the first byte sequence number, shows the next one grouping that the client expectation receives.Before server end sent new grouping, the TCP expectation received all affirmations groupings that send grouping, if expect overtimely, just thought that packet loss retransmits.TCP connects can be described as two streams: data flow (server is to client) and affirmation stream (client is to server end), separate and independently compression these two kinds stream employings.
When formulating packet format, carry out according to ROHC profile standard, the scheme of design can be common to whole ROHC framework like this.In each form, introduce the MSN critical field, be used for sending variable form.Designed packet format has following characteristics:
1) the profile field value in IR and the IR-DYN grouping is made as 9, is used for distinguishing special TCP/IP stream;
2) a letter static fields and a letter dynamic domain all are variable-lengths, represent respectively static fields and dynamic domain in the TCP letter head;
3) the Ex sign is set, Ex=1 represents to exist extra field, supports the transmission of tcp window size and TCP urgent pointer, also can be used as the transmission range that enlarges the SN field;
4) form of all definition all carries CID field (0-16 bit), MSN field (4-16 bit) and TCP check and field (2 bytes).Because these fields need to transmit, this means that minimum compressed packet is 3 byte lengths in each grouping of every flow.
Compressor reducer mainly contains to the grouping of decompression machine and gets grouping, IR-DYN grouping and ROHC compressed packet (compression process such as Fig. 2).
The characteristic of CP data flow, analyzed the variation pattern of a TCP letter field, introduce on this basis chief series MSN as critical field, various compression profile and the feedback packet of TCP/IP grouping have been write, and accomplished in prototype system, designed scheme can be common to whole ROHC framework.
3, the dynamic adjustment of sliding window width
W-LSB algorithm (algorithm flow such as Fig. 3) does not need synchronously accurate, in W-LSB to each stream, compressor reducer is preserved the sliding window of a nearest SWW reference value, and decompression machine is only safeguarded the reference value of nearest successful decompress(ion), and therefore in fact LSB is the special circumstances of SWW=1 among the W-LSB.To each grouping, compressor reducer assurance compressed packet can use any reference value in the sliding window to carry out decompress(ion).Therefore, the decompress(ion) context can use any one reference value in the decompressor sliding window.The robustness of W-LSB algorithm is can tolerate under the worst case (SWW-1) individual continuous packet loss, and can not cause the infringement diffusion.
The robustness of W-LSB coding is if the packet loss number is no more than the SWW length of window continuously, and namely the number of lost packets is less than the number of reference value, and decompression machine is correct decompress(ion) still.Therefore, the effect in the W-LSB coding of SWW value is very large, and the ROHC performance is had a direct impact.If window width SWW is too small, the reference value that is used as compression is just few, needs the number of bits k of compression short, can improve compression efficiency.But in case lose grouping more than the SWW at Radio Link, exceeded the scope that reference value can be deciphered, decompressor is correct decompress(ion) just, has affected the robustness of ROHC.On the contrary, if the SWW value is excessive, although can guarantee the robustness of ROHC, but reduced compression performance.
Therefore, if packet loss rate is smaller on the link, select less SWW value to get final product, in the time may larger packet loss rate occurring, can select larger SWW.In wireless environment, packet loss rate is usually caused by error rate BER and continuous packet loss may occur, if the mobility of further considering, channel quality may change fast, is difficult to find the fixedly SWW value that is fit to various situations.Therefore, should dynamically adjust the SWW value and satisfy the wireless channel demand.
That 4, dynamically adjusts improves one's methods
In the O of ROHC pattern and R pattern, when the decompress(ion) failure, decompression machine sends NACK and STATIC NACK negative-feedback information to compressor reducer, and the request compressor reducer sends complete packet and upgrades context, therefore can utilize NACK and STATIC nack message dynamically to adjust the value of SWW.
It is as follows to improve one's methods: the sliding window width that compressor reducer is preserved the reference compression value is made as SWW C, and the sliding window width that decompression machine is preserved the decompress(ion) reference value is made as SWW D, for the width of sliding window is set initial value.
Compressor end receives NACK and the STATIC-nack message means the failure of decompression machine decompress(ion), shows to have packet loss, and therefore current SWW C value is too little, need to increase exponentially SWW C value and avoid further decompress(ion) failure; The decompression machine end increases according to same rule before sending NACK and STATIC-NACK negative feedback.
When successfully the grouping number of compression (or decompress(ion)) is greater than current sliding window width continuously, means and work as front slide
The width of window can provide stronger robustness, and link-quality is better, in this case, can geometric ratio the value of reduction SWW C (or SWW D) obtain less coded-bit and compression speed faster.
5, the test information source of design ROHC
In the writing of RHOC profile, whether what often need test profile writes or revises effective, at this moment need to have especially and test flexibly information source, checks at any time the compression and decompression function of profile, carries out next step modification.In the modification of TCP compression profile, owing to be in the debug phase, the correct arrival that possibly can't guarantee handshake packet or confirm to divide into groups, thus driver or TCP re-transmission may be produced, affected normally carrying out of test.
Designed test information source can produce the test packet that is applicable to any type, and easy to use, packet format is not limit.For connection-oriented TCP current test, do not needing to connect in advance and loopback is confirmed in the situation of grouping, the RHOC compression/de-compression test of TCP/IP stream can continue to carry out.

Claims (4)

1. TCP letter head compression method in the wireless IPv6 Internet is characterized in that the method comprises:
(1) according to ROHC profile standard, adopt the W-LSB coding method, write the compression profile of TCP/IP grouping;
(2) in order to make things convenient for writing and debugging of ROHC profile, increase the processing function in the ROHC compressor end, can produce the test packet that is applicable to any type, the compression and decompression function of at any time verification profile;
(3) adopt flexibly adjustable sliding window width mechanism, be specially adapted to be connected to the TCP/IP framework in the Radio Link, because the quick variation of channel quality, find the sliding window width value of the optimization that is fit to various situations, change compression and decompressed state transition logic, introduce additional control information, take into account strong robustness and low overhead;
(4) in the writing of RHOC profile, whether what often need test profile writes or revises effective, at this moment need to have especially and test flexibly information source, checks at any time the compression and decompression function of profile, carries out next step modification; For connection-oriented TCP current test, do not needing to connect in advance and loopback is confirmed in the situation of grouping, the RHOC compression/de-compression test of TCP/IP stream can continue to carry out.
2. TCP letter head compression method in described a kind of wireless IPv6 Internet according to claim 1, it is characterized in that, the compression profile of described TCP, TCP/IP is connection-oriented stream, between the sending and receiving two ends, adopt two-way reliable connection mode, according to three-way handshake, mean that must set up agreement before the exchanges data connects, afterwards TCP guarantee distribution is error-free is grouped into client; TCP divides into groups the data flow that application service produces, and in the grouping that sends, the IP layer comprises the load of grouping and sequence number as first byte of grouping; In client, for any grouping that receives, TCP sends the affirmation grouping that contains the first byte sequence number, shows the next one grouping that the client expectation receives.
3. TCP letter head compression method in described a kind of wireless IPv6 Internet according to claim 1, it is characterized in that, the dynamic adjustment of described sliding window width, the W-LSB algorithm does not need synchronously accurate, in W-LSB to each stream, compressor reducer is preserved the sliding window of a nearest SWW reference value, decompression machine is only safeguarded the reference value of nearest successful decompress(ion), to each grouping, compressor reducer assurance compressed packet can use any reference value in the sliding window to carry out decompress(ion), therefore, the decompress(ion) context can use any one reference value in the decompressor sliding window; The robustness of W-LSB algorithm is can tolerate under the worst case (SWW-1) individual continuous packet loss, and can not cause the infringement diffusion; Wherein, the robustness of W-LSB coding is if the packet loss number is no more than the SWW length of window continuously, and namely the number of lost packets is less than the number of reference value, and decompression machine is correct decompress(ion) still.
4. TCP letter head compression method in described a kind of wireless IPv6 Internet according to claim 1, it is characterized in that, the improvement of described dynamic adjustment, in the O of ROHC pattern and R pattern, when the decompress(ion) failure, decompression machine sends NACK and STATIC NACK negative-feedback information to compressor reducer, and the request compressor reducer sends complete packet and upgrades context, therefore can utilize NACK and STATIC nack message dynamically to adjust the value of SWW; The sliding window width that described compressor reducer is preserved the reference compression value is made as SWW C, and the sliding window width that decompression machine is preserved the decompress(ion) reference value is made as SWW D, for the width of sliding window is set initial value; Compressor end receives NACK and the STATIC-nack message means the failure of decompression machine decompress(ion), shows to have packet loss, and therefore current SWW C value is too little, need to increase exponentially SWW C value and avoid further decompress(ion) failure; The decompression machine end increases according to same rule before sending NACK and STATIC-NACK negative feedback.
CN2013100364982A 2013-01-30 2013-01-30 TCP (transmission control protocol) header compression method in wireless IPv6 (internet protocol version 6) network Pending CN103067971A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2013100364982A CN103067971A (en) 2013-01-30 2013-01-30 TCP (transmission control protocol) header compression method in wireless IPv6 (internet protocol version 6) network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2013100364982A CN103067971A (en) 2013-01-30 2013-01-30 TCP (transmission control protocol) header compression method in wireless IPv6 (internet protocol version 6) network

Publications (1)

Publication Number Publication Date
CN103067971A true CN103067971A (en) 2013-04-24

Family

ID=48110395

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2013100364982A Pending CN103067971A (en) 2013-01-30 2013-01-30 TCP (transmission control protocol) header compression method in wireless IPv6 (internet protocol version 6) network

Country Status (1)

Country Link
CN (1) CN103067971A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104618961A (en) * 2015-01-21 2015-05-13 普天信息技术有限公司 Single-channel TCP/ IP header compression method and system for intelligent power grid
CN109239071A (en) * 2018-11-20 2019-01-18 帝麦克斯(苏州)医疗科技有限公司 Pathological section scanner control method and pathological section scanner
CN111149384A (en) * 2017-09-29 2020-05-12 苹果公司 ROHC header compression for MPTCP
CN117675716A (en) * 2024-01-26 2024-03-08 北京天维信通科技股份有限公司 Method and device for accelerating file transmission based on modification of TCP sliding window parameters

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6967964B1 (en) * 2000-10-03 2005-11-22 Telefonaktiebolaget Lm Ericsson (Publ) Context identification using header compression key at link layer
CN102255972A (en) * 2011-08-10 2011-11-23 北京邮电大学 HTTP (hyper text transport protocol)-oriented TCP (transmission control protocol) header compression method in 6LoWAPN (IPv-over low-power wireless personal area network)

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6967964B1 (en) * 2000-10-03 2005-11-22 Telefonaktiebolaget Lm Ericsson (Publ) Context identification using header compression key at link layer
CN102255972A (en) * 2011-08-10 2011-11-23 北京邮电大学 HTTP (hyper text transport protocol)-oriented TCP (transmission control protocol) header compression method in 6LoWAPN (IPv-over low-power wireless personal area network)

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
张载龙等: "无线因特网中信头压缩技术研究", 《南京邮电大学学报(自然科学版)》, 31 December 2008 (2008-12-31), pages 23 - 29 *
李祥中: "鲁棒性报头压缩中实现滑动窗口动态调整", 《科技信息》, 5 March 2012 (2012-03-05), pages 97 - 98 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104618961A (en) * 2015-01-21 2015-05-13 普天信息技术有限公司 Single-channel TCP/ IP header compression method and system for intelligent power grid
CN111149384A (en) * 2017-09-29 2020-05-12 苹果公司 ROHC header compression for MPTCP
CN111149384B (en) * 2017-09-29 2022-05-27 苹果公司 ROHC header compression for MPTCP
US11445047B2 (en) 2017-09-29 2022-09-13 Apple Inc. ROHC header compression for MPTCP
US11824959B2 (en) 2017-09-29 2023-11-21 Apple, Inc. ROHC header compression for MPTCP
CN109239071A (en) * 2018-11-20 2019-01-18 帝麦克斯(苏州)医疗科技有限公司 Pathological section scanner control method and pathological section scanner
CN117675716A (en) * 2024-01-26 2024-03-08 北京天维信通科技股份有限公司 Method and device for accelerating file transmission based on modification of TCP sliding window parameters

Similar Documents

Publication Publication Date Title
CN106464713B (en) System and method for layered compression
US9125088B2 (en) Dynamic robust header compression
JP4317403B2 (en) Header compression apparatus and header compression method
US7620870B2 (en) Data compression method and system
US7430617B2 (en) Method and system for header compression
US8811431B2 (en) Systems and methods for compressing packet data
US9166931B2 (en) Method and device for improving robustness of context update message in robust header compression
CN101146025B (en) Packet transmission method, system and compression unit for compression real time transmission protocol
CA2472908A1 (en) Packet header compression system and method based upon a dynamic template creation
CN100433841C (en) Robustness header compression/decompression method for MIPv6
US8761197B2 (en) Method and apparatus for mode transition, compression, and decompression in robust header compression
CN103067971A (en) TCP (transmission control protocol) header compression method in wireless IPv6 (internet protocol version 6) network
CN102342079B (en) Do not improve flow rate and reliably transmit the method and apparatus of the stream of the packet with header compression
Jin et al. Performance comparison of header compression schemes for RTP/UDP/IP packets
Woo et al. Performance analysis of robust header compression over mobile wimax
CN102045311B (en) Robust header compression state transition method and decompressor
Penchalaiah et al. Performance of TCP/IP/UDP adaptive header compression algorithm for wireless network
Wang et al. An Efficient Network Coding Scheme for Heterogeneous Wireless Networks
Gu et al. A robust header compression simulator & visualizer
Shivare et al. Performance Evaluation of Robust Header Compression over Mobile WiMAX
Bakota et al. Optimal format indication in distributed profiles ROHC compression
Wu et al. Adaptive robust TCP/IP header compression algorithm for 3G wireless networks
Giouroukos et al. An implementation of ROHC for TCP/IPv6
Gu The adaptive header compression algorithm of mobile IPv6 Network
Wu et al. Channel State Dependent Robust TCP/IP Header Compression for 3G Wireless

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C12 Rejection of a patent application after its publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20130424