CA2428788A1 - Static information knowledge used with binary compression methods - Google Patents
Static information knowledge used with binary compression methods Download PDFInfo
- Publication number
- CA2428788A1 CA2428788A1 CA002428788A CA2428788A CA2428788A1 CA 2428788 A1 CA2428788 A1 CA 2428788A1 CA 002428788 A CA002428788 A CA 002428788A CA 2428788 A CA2428788 A CA 2428788A CA 2428788 A1 CA2428788 A1 CA 2428788A1
- Authority
- CA
- Canada
- Prior art keywords
- communication
- dictionary
- symbol string
- given
- communication protocol
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
- H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/04—Protocols for data compression, e.g. ROHC
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/18—Multiprotocol handlers, e.g. single devices capable of handling multiple protocols
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Theoretical Computer Science (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Communication Control (AREA)
- Computer And Data Communications (AREA)
Abstract
A system, method, and apparatus for increasing the efficiency of the compression of a communication protocol for use over bandwidth limited communication links (250, 255, 550). One aspect of the present invention uses the knowledge of the structure and content of communication protocols to form a static dictionary (220, 420, 430) or static binary code tree. As a result, the compression efficiency can be greatly increased. Another aspect of the present invention provides a combined static and dynamic dictionary (520, 540) or binary code tree to perform communication protocol compression. In one aspect of the invention, the static binary code tree or static dictionary (220, 420, 430) is constructed by studying flows of data protocols in the conditions of their intended usage.
Claims (37)
1. A communication entity (210) for compressing messages transmitted using a communication protocol, said communication entity characterized by:
a dictionary (220) containing at least one symbol string therein, said at least one symbol string corresponding to at least one symbol of a given communication protocol, wherein at least one entry within said dictionary is based upon statistical data flows of said given communication protocol; and a compressor (215) in communication with said dictionary, said compressor using said dictionary to compress said at least one symbol string within a first communication message pursuant to said given communication protocol.
a dictionary (220) containing at least one symbol string therein, said at least one symbol string corresponding to at least one symbol of a given communication protocol, wherein at least one entry within said dictionary is based upon statistical data flows of said given communication protocol; and a compressor (215) in communication with said dictionary, said compressor using said dictionary to compress said at least one symbol string within a first communication message pursuant to said given communication protocol.
2. The communication entity of claim 1, said communication entity further comprising:
a decompressor (225) in communication with said dictionary, said decompressor using said dictionary to decompress at least one symbol string within a second communication message pursuant to said given communication protocol.
a decompressor (225) in communication with said dictionary, said decompressor using said dictionary to decompress at least one symbol string within a second communication message pursuant to said given communication protocol.
3. The communication entity of claim 1, said communication entity further comprising:
a binary code tree in communication with said compressor, said compressor using said binary code tree to compress said at least one symbol string within said first communication message pursuant to said given communication protocol.
a binary code tree in communication with said compressor, said compressor using said binary code tree to compress said at least one symbol string within said first communication message pursuant to said given communication protocol.
4. The communication entity of claim 3, wherein said binary code tree comprises a Huffman binary code tree.
5. The communication entity of claim 3, wherein said binary code tree comprises a static binary code tree.
6. The communication entity of claim 1, wherein said dictionary comprises a static dictionary.
7. The communication entity of claim 1, wherein said at least one symbol of said given communication protocol comprises at least one field-name of said given communication protocol.
8. The communication entity of claim 1, said communication entity further comprising:
a dynamic dictionary (520) in communication with said compressor, said dynamic dictionary containing at least one second symbol string therein, said at least one second symbol string corresponding to at least one second symbol of a given communication protocol, said compressor using at least one of said dynamic dictionary and said dictionary to compress at least one symbol string within a subsequent communication message pursuant to said given communication protocol.
a dynamic dictionary (520) in communication with said compressor, said dynamic dictionary containing at least one second symbol string therein, said at least one second symbol string corresponding to at least one second symbol of a given communication protocol, said compressor using at least one of said dynamic dictionary and said dictionary to compress at least one symbol string within a subsequent communication message pursuant to said given communication protocol.
9. The communication entity of claim 8, wherein said compressor uses a sliding window dictionary compression method.
10. A communication entity (230) for decompressing messages received using a communication protocol, said communication entity characterized by:
a dictionary (220) containing at least one symbol string therein, said at least one symbol string corresponding to at least one symbol of a given communication protocol, wherein at least one entry within said dictionary is based upon statistical data flows of said given communication protocol; and a decompressor (235) in communication with said dictionary, said decompressor using said dictionary to decompress said at least one symbol string within a first communication message pursuant to said given communication protocol.
a dictionary (220) containing at least one symbol string therein, said at least one symbol string corresponding to at least one symbol of a given communication protocol, wherein at least one entry within said dictionary is based upon statistical data flows of said given communication protocol; and a decompressor (235) in communication with said dictionary, said decompressor using said dictionary to decompress said at least one symbol string within a first communication message pursuant to said given communication protocol.
11. The communication entity of claim 10, said communication entity further comprising:
a compressor (245) in communication with said dictionary (220), said compressor using said dictionary to compress at least one symbol string within a second communication message pursuant to said given communication protocol.
a compressor (245) in communication with said dictionary (220), said compressor using said dictionary to compress at least one symbol string within a second communication message pursuant to said given communication protocol.
12. The communication entity of claim 10, said communication entity further comprising:
a binary code tree in communication with said decompressor, said decompressor using said binary code tree to decompress said at least one symbol string within said first communication message pursuant to said given communication protocol.
a binary code tree in communication with said decompressor, said decompressor using said binary code tree to decompress said at least one symbol string within said first communication message pursuant to said given communication protocol.
13. The communication entity of claim 12, wherein said binary code tree comprises a static binary code tree.
14. The communication entity of claim 12, wherein said binary code tree comprises a Huffman binary code tree.
15. The communication entity of claim 10, wherein said dictionary comprises a static dictionary.
16. The communication entity of claim 10, wherein said at least one symbol of said given communication protocol comprises at least one field-name of said given communication protocol.
17. The communication entity of claim 10, said communication entity further comprising:
a dynamic dictionary (520) in communication with said decompressor, said dynamic dictionary containing at least one second symbol string therein, said at least one second symbol string corresponding to at least one second symbol of a given communication protocol, said compressor using at least one of said dynamic dictionary and said dictionary to decompress at least one symbol string within a subsequent communication message pursuant to said given communication protocol.
a dynamic dictionary (520) in communication with said decompressor, said dynamic dictionary containing at least one second symbol string therein, said at least one second symbol string corresponding to at least one second symbol of a given communication protocol, said compressor using at least one of said dynamic dictionary and said dictionary to decompress at least one symbol string within a subsequent communication message pursuant to said given communication protocol.
18. The communication entity of claim 17, wherein said decompressor uses a sliding window dictionary decompression method.
19. A communication system for facilitating compressed message communication, said communication system characterized by:
a first communication entity (210, 410) for sending a first communication message, said first communication entity comprising:
a first dictionary (220, 420) containing at least one symbol string therein, said at least one symbol string corresponding to at least one symbol of a given communication protocol, wherein at least one entry within said first dictionary is based upon statistical data flows of said given communication protocol; and a first compressor (215, 415) in communication with said first dictionary, said first compressor using said first dictionary to compress a given symbol string within a first communication message pursuant to said given communication protocol; and a second communication entity (230, 440), in communication with said first communication entity, for receiving said first communication message, said second communication entity comprising:
a second dictionary (220, 420) containing at least one symbol string therein, said at least one symbol string corresponding to said at least one symbol of said given communication protocol; and a first decompressor (245, 445), in communication with said second dictionary, said first decompressor using said second dictionary to decompress said given symbol string within said first communication message pursuant to said given communication protocol, said first dictionary being substantially equivalent to said second dictionary.
a first communication entity (210, 410) for sending a first communication message, said first communication entity comprising:
a first dictionary (220, 420) containing at least one symbol string therein, said at least one symbol string corresponding to at least one symbol of a given communication protocol, wherein at least one entry within said first dictionary is based upon statistical data flows of said given communication protocol; and a first compressor (215, 415) in communication with said first dictionary, said first compressor using said first dictionary to compress a given symbol string within a first communication message pursuant to said given communication protocol; and a second communication entity (230, 440), in communication with said first communication entity, for receiving said first communication message, said second communication entity comprising:
a second dictionary (220, 420) containing at least one symbol string therein, said at least one symbol string corresponding to said at least one symbol of said given communication protocol; and a first decompressor (245, 445), in communication with said second dictionary, said first decompressor using said second dictionary to decompress said given symbol string within said first communication message pursuant to said given communication protocol, said first dictionary being substantially equivalent to said second dictionary.
20. The communication system of claim 21, wherein said first communication entity further comprises:
a second decompressor (225) in communication with said first dictionary (220), said second decompressor using said first dictionary to decompress a given symbol string within a second communication message pursuant to said given communication protocol, said second communication message being received from said second communication entity (230).
a second decompressor (225) in communication with said first dictionary (220), said second decompressor using said first dictionary to decompress a given symbol string within a second communication message pursuant to said given communication protocol, said second communication message being received from said second communication entity (230).
21. The communication system of claim 20, wherein said second communication entity further comprises:
a second compressor (245) in communication with said second dictionary (220), said second compressor using said second dictionary to compress a given symbol string within said second communication message pursuant to said given communication protocol.
a second compressor (245) in communication with said second dictionary (220), said second compressor using said second dictionary to compress a given symbol string within said second communication message pursuant to said given communication protocol.
22. The communication system of claim 19, wherein said first communication entity (410) further comprises:
a third dictionary (430) containing at least one symbol string therein, said at least one symbol string corresponding to at least one symbol of a given communication protocol; and a second decompressor (425) in communication with said third dictionary, said second decompressor using said third dictionary to decompress a given symbol string within a second communication message pursuant to said given communication protocol, said second communication message being received from said second communication entity (440).
a third dictionary (430) containing at least one symbol string therein, said at least one symbol string corresponding to at least one symbol of a given communication protocol; and a second decompressor (425) in communication with said third dictionary, said second decompressor using said third dictionary to decompress a given symbol string within a second communication message pursuant to said given communication protocol, said second communication message being received from said second communication entity (440).
23. The communication system of claim 22, wherein said second communication entity (440) further comprises:
a fourth dictionary (430) containing at least one symbol string therein, said at least one symbol string corresponding to at least one symbol of a given communication protocol; and a second compressor (455) in communication with said fourth dictionary, said second compressor using said fourth dictionary to compress said given symbol string within said second communication message pursuant to said given communication protocol, said third dictionary being substantially equivalent to said fourth dictionary.
a fourth dictionary (430) containing at least one symbol string therein, said at least one symbol string corresponding to at least one symbol of a given communication protocol; and a second compressor (455) in communication with said fourth dictionary, said second compressor using said fourth dictionary to compress said given symbol string within said second communication message pursuant to said given communication protocol, said third dictionary being substantially equivalent to said fourth dictionary.
24. The communication system of claim 19, wherein said at least one symbol of said given communication protocol comprises at least one field-name of said given communication protocol.
25. The communication system of claim 22, wherein at least one entry within said third dictionary is based upon statistical data flows of said given communication protocol.
26. The communication system of claim 19, wherein said first dictionary comprises a static dictionary.
26. The communication system of claim 19, wherein said second dictionary comprises a static dictionary.
26. The communication system of claim 19, wherein said second dictionary comprises a static dictionary.
27. The communication system of claim 22, wherein said third dictionary comprises a static dictionary.
28 The communication system of claim 23, wherein said fourth dictionary comprises a static dictionary.
29. A method of facilitating compressed message communication using a communication protocol, said method characterized by the steps of:
matching at least one symbol string within a first communication message to at least one matched symbol string within a first dictionary, wherein at least one entry within said first dictionary is based upon statistical data flows of said communication protocol;
transmitting reference information indicative of a location of said at least one matched symbol string within said first dictionary;
receiving said reference information indicative of a location of said at least one matched symbol string within said first dictionary;
associating said received reference information to at least one corresponding symbol string within a second dictionary, said at least one corresponding symbol string within said second dictionary substantially equal to said at least one matched symbol string within said first dictionary; and reconstructing said first communication message from said at least one corresponding symbol string within said second dictionary.
matching at least one symbol string within a first communication message to at least one matched symbol string within a first dictionary, wherein at least one entry within said first dictionary is based upon statistical data flows of said communication protocol;
transmitting reference information indicative of a location of said at least one matched symbol string within said first dictionary;
receiving said reference information indicative of a location of said at least one matched symbol string within said first dictionary;
associating said received reference information to at least one corresponding symbol string within a second dictionary, said at least one corresponding symbol string within said second dictionary substantially equal to said at least one matched symbol string within said first dictionary; and reconstructing said first communication message from said at least one corresponding symbol string within said second dictionary.
30. The method of claim 29, wherein at least one of said first dictionary and said second dictionary comprises a static dictionary.
31. The method of claim 29, wherein at least one of said first dictionary and said second dictionary comprises a dynamic dictionary.
32. A method of facilitating compressed message communication using a communication protocol, said method characterized by the steps of:
searching a dictionary for a symbol string corresponding to said communication protocol, said symbol string being contained within a communication message, wherein at least one entry within said dictionary is based upon statistical data flows of said communication protocol;
upon affirmative confirmation that said dictionary contains said symbol string, retrieving from said dictionary a compressed symbol string associated with said symbol string;
replacing, in said communication message, said symbol string with said compressed symbol string; and transmitting said communication message using said communication protocol.
searching a dictionary for a symbol string corresponding to said communication protocol, said symbol string being contained within a communication message, wherein at least one entry within said dictionary is based upon statistical data flows of said communication protocol;
upon affirmative confirmation that said dictionary contains said symbol string, retrieving from said dictionary a compressed symbol string associated with said symbol string;
replacing, in said communication message, said symbol string with said compressed symbol string; and transmitting said communication message using said communication protocol.
33. The method of claim 32, wherein said dictionary comprises a static dictionary.
34. The method of claim 32, wherein said dictionary comprises a dynamic dictionary.
35. A method of facilitating compressed message communication using a communication protocol, said method characterized by the steps of receiving a communication message based upon said communication protocol, said communication message including a compressed symbol string;
retrieving from a dictionary, an uncompressed symbol string associated with said compressed symbol string, said uncompressed symbol string corresponding to said communication protocol, wherein at least one entry within said dictionary is based upon statistical data flows of said communication protocol; and replacing, in said communication message, said compressed symbol string with said uncompressed symbol string.
retrieving from a dictionary, an uncompressed symbol string associated with said compressed symbol string, said uncompressed symbol string corresponding to said communication protocol, wherein at least one entry within said dictionary is based upon statistical data flows of said communication protocol; and replacing, in said communication message, said compressed symbol string with said uncompressed symbol string.
36. The method of claim 31, wherein said dictionary comprises a static dictionary.
37. The method of claim 35, wherein said dictionary comprises a dynamic dictionary.
Applications Claiming Priority (5)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US24992300P | 2000-11-16 | 2000-11-16 | |
| US60/249,923 | 2000-11-16 | ||
| US09/814,406 | 2001-03-21 | ||
| US09/814,406 US6985965B2 (en) | 2000-11-16 | 2001-03-21 | Static information knowledge used with binary compression methods |
| PCT/SE2001/002549 WO2002041497A2 (en) | 2000-11-16 | 2001-11-15 | Static information knowledge used with binary compression methods |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2428788A1 true CA2428788A1 (en) | 2002-05-23 |
| CA2428788C CA2428788C (en) | 2010-09-14 |
Family
ID=26940466
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA2428788A Expired - Lifetime CA2428788C (en) | 2000-11-16 | 2001-11-15 | Static information knowledge used with binary compression methods |
Country Status (7)
| Country | Link |
|---|---|
| EP (1) | EP1334557A2 (en) |
| JP (1) | JP3958211B2 (en) |
| CN (1) | CN1316749C (en) |
| AU (1) | AU2002215287A1 (en) |
| CA (1) | CA2428788C (en) |
| TW (1) | TW543311B (en) |
| WO (1) | WO2002041497A2 (en) |
Families Citing this family (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7120666B2 (en) | 2002-10-30 | 2006-10-10 | Riverbed Technology, Inc. | Transaction accelerator for client-server communication systems |
| US8176186B2 (en) | 2002-10-30 | 2012-05-08 | Riverbed Technology, Inc. | Transaction accelerator for client-server communications systems |
| JP3863130B2 (en) * | 2003-08-18 | 2006-12-27 | 株式会社コナミデジタルエンタテインメント | COMMUNICATION SYSTEM, SERVICE METHOD, TERMINAL METHOD, AND PROGRAM |
| CN101658015A (en) * | 2007-04-13 | 2010-02-24 | 汤姆森特许公司 | Communication protocol, developing and network operating methods therefore |
| TWI386069B (en) * | 2007-08-10 | 2013-02-11 | Univ Nat Cheng Kung | System and method for encoding a data set, and program product |
| JP4930305B2 (en) * | 2007-09-20 | 2012-05-16 | 日本電気株式会社 | Data communication system, terminal, catalog server, data communication method, and communication program |
| JP2010258787A (en) * | 2009-04-24 | 2010-11-11 | Mitsubishi Electric Corp | Signaling compression device, signaling elongation device, and signaling compression and elongation device |
| WO2013079999A1 (en) * | 2011-12-02 | 2013-06-06 | Canon Kabushiki Kaisha | Methods and devices for encoding and decoding messages |
| CN102857230B (en) * | 2012-09-21 | 2015-05-20 | 中国科学院武汉物理与数学研究所 | High-speed program controller on basis of lossless compression data transmission technology |
| US9166620B2 (en) * | 2012-09-26 | 2015-10-20 | Qualcomm Incorporated | Method and apparatus for a memory based packet compression encoding |
| CN104283777B (en) * | 2013-07-03 | 2018-08-21 | 华为技术有限公司 | The method and apparatus of message compression |
| US20150121111A1 (en) * | 2013-10-24 | 2015-04-30 | Qualcomm Incorporated | System and method for providing multi-user power saving codebook optmization |
| JP6742692B2 (en) | 2015-01-30 | 2020-08-19 | 富士通株式会社 | Encoding program and decompression program |
| JP6511836B2 (en) | 2015-01-30 | 2019-05-15 | 富士通株式会社 | Compression program, compression method, compression apparatus and decompression program |
| JP6641857B2 (en) | 2015-10-05 | 2020-02-05 | 富士通株式会社 | Encoding program, encoding method, encoding device, decoding program, decoding method, and decoding device |
| DE102016108403A1 (en) * | 2016-05-06 | 2017-11-09 | Haroon van Rikxoort | Method for data transmission |
| JP6984321B2 (en) * | 2017-10-31 | 2021-12-17 | 富士通株式会社 | Data generation program, data generation method and information processing equipment |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5455576A (en) * | 1992-12-23 | 1995-10-03 | Hewlett Packard Corporation | Apparatus and methods for Lempel Ziv data compression with improved management of multiple dictionaries in content addressable memory |
| GB9314516D0 (en) * | 1993-07-13 | 1993-08-25 | Philips Electronics Uk Ltd | Digital communications system and a reiceiving apparatus for use in the system |
| JP3277792B2 (en) * | 1996-01-31 | 2002-04-22 | 株式会社日立製作所 | Data compression method and apparatus |
| CA2260289A1 (en) * | 1998-01-29 | 1999-07-29 | Steven Michael Bellovin | A method of improving data compression over unreliable underlying networks |
| KR100277061B1 (en) * | 1998-11-04 | 2001-01-15 | 윤종용 | Short message compression device of mobile communication terminal and corresponding short message transmission method |
-
2001
- 2001-10-30 TW TW90126862A patent/TW543311B/en not_active IP Right Cessation
- 2001-11-15 CA CA2428788A patent/CA2428788C/en not_active Expired - Lifetime
- 2001-11-15 WO PCT/SE2001/002549 patent/WO2002041497A2/en active Application Filing
- 2001-11-15 EP EP01983894A patent/EP1334557A2/en not_active Withdrawn
- 2001-11-15 AU AU2002215287A patent/AU2002215287A1/en not_active Abandoned
- 2001-11-15 JP JP2002543788A patent/JP3958211B2/en not_active Expired - Lifetime
- 2001-11-15 CN CNB01822069XA patent/CN1316749C/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| TW543311B (en) | 2003-07-21 |
| CN1316749C (en) | 2007-05-16 |
| CA2428788C (en) | 2010-09-14 |
| JP2004514366A (en) | 2004-05-13 |
| WO2002041497A3 (en) | 2002-08-29 |
| CN1486536A (en) | 2004-03-31 |
| WO2002041497A2 (en) | 2002-05-23 |
| JP3958211B2 (en) | 2007-08-15 |
| EP1334557A2 (en) | 2003-08-13 |
| AU2002215287A1 (en) | 2002-05-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2428788A1 (en) | Static information knowledge used with binary compression methods | |
| US6985965B2 (en) | Static information knowledge used with binary compression methods | |
| US6883035B2 (en) | System and method for communicating with temporary compression tables | |
| TW586294B (en) | Communication system and method for shared context compression | |
| US6100824A (en) | System and method for data compression | |
| EP0797158A3 (en) | Document managing apparatus, data compressing method, and data decompressing method | |
| CA2275828A1 (en) | Using discrete message-oriented services to deliver short audio communications | |
| CA2514832A1 (en) | System and method for compression of wireless applications expressed in a structured definition language | |
| US6735186B1 (en) | Method and system for optimizing usage of air link | |
| JP2003524983A (en) | Method and apparatus for optimized lossless compression using multiple coders | |
| GB2392338A (en) | Method and apparatus for temporal wavelet compression | |
| Gupta et al. | A review on different types of lossless data compression techniques | |
| US6750791B1 (en) | Method and device for text data compression | |
| WO2006017804B1 (en) | Compressing xml documents into valid xml documents | |
| US20060291505A1 (en) | Method for extended transmission capabilities of short message service | |
| IL171818A (en) | Pattern driven message oriented compression apparatus and method | |
| JP2004528737A (en) | Method and apparatus for transmitting and receiving data structures in a compressed format based on component frequency | |
| Weiss et al. | Putting data on a diet | |
| CN1964351A (en) | A method to reduce network flow of game server by data package compression | |
| KR100531550B1 (en) | E-mail system with function to compress attaching file and controlling method thereof | |
| EP1605595A1 (en) | Method for compressing a short message | |
| CN1332527A (en) | WAP-based transmitted data compressing process | |
| CN106790462B (en) | Short sentence transmission method and system, server, sending client and receiving client | |
| WO2002075929A1 (en) | A method for compressing data | |
| Das et al. | Design an Algorithm for Data Compression using Pentaoctagesimal SNS |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKEX | Expiry |
Effective date: 20211115 |