IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
UP-0886956
(2004-07-08)
|
등록번호 |
US-7664881
(2010-04-04)
|
우선권정보 |
FR-03 08318(2003-07-08) |
발명자
/ 주소 |
- Le Pennec, Jean-François
- Galand, Claude
|
출원인 / 주소 |
|
인용정보 |
피인용 횟수 :
4 인용 특허 :
16 |
초록
▼
Header compression system for compressing the header of the data packets of a flow transmitted from an ingress node to an egress node through a data transmission network comprising template creating means, in both ingress node and egress node, adapted for creating the same compression template from
Header compression system for compressing the header of the data packets of a flow transmitted from an ingress node to an egress node through a data transmission network comprising template creating means, in both ingress node and egress node, adapted for creating the same compression template from a predetermined number of uncompressed data packets at the beginning of the flow respectively transmitted by the ingress node and received by the egress node, and header compression means, in the ingress node, adapted for compressing the header of each packet following the predetermined number of uncompressed data packets before transmitting it through the data transmission network, the compression being achieved by using the compression template.
대표청구항
▼
The invention claimed is: 1. A header compression system for compressing a header of a plurality of data packets of a flow transmitted through a data transmission network, comprising: an ingress node and an egress node comprising hardware; flow lookup code in said ingress node adapted to determine
The invention claimed is: 1. A header compression system for compressing a header of a plurality of data packets of a flow transmitted through a data transmission network, comprising: an ingress node and an egress node comprising hardware; flow lookup code in said ingress node adapted to determine if an existing compression template matches at least a source address or a destination address of said flow in a template and label table; template creating code, in both said ingress node and said egress node, adapted to create a new compression template in said template and label table from a predetermined number of uncompressed data packets at a beginning of said flow respectively transmitted by said ingress node and received by said egress node, wherein said new compression template is identical in said ingress node and said egress node, wherein said new compression template is created if said existing compression template is not found by said flow lookup code; and header compression code, in said ingress node, adapted to compress the header of each packet of said plurality of data packets following said predetermined number of uncompressed data packets before transmitting said plurality of data packets through said data transmission network, wherein said compressing of the header of each packet is achieved by using said new compression template. 2. The header compression system according to claim 1, wherein said egress node comprises decompression code adapted to decompress the header of each packet received after said predetermined number of data packets, wherein said decompressing of the header of each packet is achieved by using said new compression template. 3. The header compression system according to claim 2, wherein said ingress node further comprises a label management block adapted to provide a first label to be added to the header of each data packet amongst said predetermined number of uncompressed data packets and a second label to be added to the header of each compressed data packet transmitted after said predetermined number of uncompressed data packets. 4. The header compression system according to claim 3, wherein said first label and second label include a compression bit which has a predetermined value (0) in said first label and wherein said second label corresponds to said first label in which said compression bit is set to the complementary value (1). 5. The header compression system according to claim 4, wherein said template creating code comprises said template and label table containing the one or more templates which have been created, a packet analysis and lookup block for respectively comparing the header of each packet to be transmitted by said ingress node. 6. The header compression system according to claim 1, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed and wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 7. The header compression system according to claim 2, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed and wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 8. The header compression system according to claim 3, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed and wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 9. The header compression system according to claim 4, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed and wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 10. The header compression system according to claim 5, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed and wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 11. A compression process for compressing a header of a plurality of data packets of a flow transmitted from an ingress node to an egress node through a data transmission network, comprising: determining whether there is an existing compression template that matches at least a source address or a destination address of the flow in a template table; creating a new compression template in said template table in both said ingress node and said egress node when said existing compression template is not found in said template table by using a predetermined number of uncompressed data packets at a beginning of said flow respectively transmitted from said ingress node and received by said egress node, wherein said compression template is identical in said ingress node and said egress node; and compressing the header of each packet of said plurality of data packets following said predetermined number of uncompressed data packets before transmitting said plurality of data packets through said data transmission network, wherein said compressing of the header of each packet is achieved by using said new compression template. 12. The compression process according to claim 11 wherein, in said ingress node, a label of a first type (LABX) is added to the header of each data packet amongst said predetermined number of uncompressed data packets and a label of a second type (LABC) is added to the header of each compressed data packet transmitted after said predetermined number of uncompressed data packets. 13. The compression process according to claim 12, wherein said label of a first type (LABX) includes a compression bit which has a predetermined value (0) and wherein said label of a second type (LABC) corresponds to said first label in which said compression bit has a complementary value (1). 14. The compression process according to claim 13, wherein a label of a third type (LABU) is added to the header of each data packet of a flow for which a header compression is not required. 15. The compression process according to claim 14, wherein said determining determines several existing compression templates for said flow and wherein a compression template having less undefined fields relative to other compression templates of said several existing compression templates is chosen amongst said several existing compression templates. 16. The compression process according to claim 14, wherein said creating said new compression template in said ingress node is used in an update mode when it is determined that there is no existing compression template for the flow to which said data packet belongs but there is a previous flow having same source and destination addresses, wherein a compression template corresponding to the previous flow is referenced in said update mode. 17. The compression process according to claim 16, wherein said label of a first type (LABX) to be added to the header of each uncompressed data packet amongst the predetermined number of uncompressed data packets is the label of a second type (LABC) associated with said previous flow in which said compression bit has been set to said predetermined value (0). 18. The compression process according to claim 17, wherein said creating said new compression template is achieved only if the header of the data packet being received includes a label of a first type (LABX). 19. The compression process according to claim 18, wherein a label of a second type (LABC) corresponding to said label of a first type (LABX) included in the header of said received data packet in which the compression bit has been set to said complementary value (1) is stored. 20. The compression process according to claim 19, further comprising decompressing the header of each packet received by said egress node and including said label of a second type (LABC). 21. The compression process according to claim 20, wherein the header of each data packet including said label of a second type (LABC) is decompressed in said egress node by using said new compression template created by using said predetermined number of uncompressed data packets. 22. The compression process according to claim 21, wherein the label of said first type (LABX) added to the header of each data packet belonging to said predetermined number of uncompressed data packets includes a sequence number in order to check in said egress node that no data packet has been lost. 23. The compression process according to claim 11, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 24. The compression process according to claim 12, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 25. The compression process according to claim 13, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 26. The compression process according to claim 14, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 27. The compression process according to claim 15, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 28. The compression process according to claim 16, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 29. The compression process according to claim 17, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 30. The compression process according to claim 18, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 31. The compression process according to claim 19, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 32. The compression process according to claim 20, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 33. The compression process according to claim 21, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets. 34. The compression process according to claim 22, wherein said new compression template includes a mask composed of as many bytes as the header to be compressed wherein changing bits of said header are reflected in said mask as bits 1 whereas constant bits of said header are reflected in said mask as bits 0, said mask resulting from a logical exclusive OR between corresponding bits of the packet headers belonging to said predetermined number of uncompressed data packets.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.