Compression and Decompression Protocol using Markel Tree Algorithm

Internet-Draft	SWL103K	January 2022
Ocen	Expires 5 July 2022	[Page]

Abstract

This document describes a protocol for the compression and decompression of data using the Markel Tree Algorithm. This protocol allows for the compression of a 103MB file into a 1MB file, which can then be transmitted over a network and decompressed back to its original size at the receiving end.¶

Status of This Memo

This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.¶

Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at https://datatracker.ietf.org/drafts/current/.¶

Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."¶

This Internet-Draft will expire on 5 July 2022.¶

Copyright Notice

This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Revised BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Revised BSD License.¶

1. Introduction

This document specifies a transport protocol for efficiently compressing and decompressing large data files using the Markel Tree Algorithm. The protocol aims to reduce the size of data transmitted over networks, improving bandwidth utilization and transmission speed.¶

1.1. Requirements Language

The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all capitals, as shown here.¶

2. Protocol Overview

This protocol addresses the need for efficient data transmission over networks by compressing data to a fraction of its original size and decompressing it at the destination. The Markel Tree Algorithm is utilized for its high compression ratio and low computational overhead.¶

2.1. Problem Statement

Current transport protocols often transmit large amounts of data without sufficient compression, leading to inefficient bandwidth usage. This protocol aims to minimize the data size during transmission, thus optimizing network resources.¶

2.2. Comparison with Existing Protocols

Unlike traditional transport protocols such as TCP, which do not inherently include data compression mechanisms, this protocol integrates compression directly into the transport layer. This can lead to significant improvements in transmission efficiency, especially for large files.¶

3. Protocol Specification

3.1. Compression Process

The compression process uses the Markel Tree Algorithm to reduce the size of the data file. The original 103MB file is processed by the compression algorithm to produce a 1MB compressed file.¶

<CODE BEGINS> file "compression.py"


def compress(data):
    # Markel Tree Algorithm implementation
    compressed_data = markel_tree_compress(data)
    return compressed_data

def decompress(data):
    # Markel Tree Algorithm implementation
    decompressed_data = markel_tree_decompress(data)
    return decompressed_data


<CODE ENDS>

Figure 1: Compression Algorithm

3.2. Transmission

The compressed data is transmitted over the network using the protocol's defined transmission mechanisms. The protocol ensures that the compressed data is properly encoded and transmitted with minimal overhead.¶

3.3. Decompression Process

Upon receiving the compressed data, the destination device uses the Markel Tree Algorithm to decompress the data back to its original 103MB size.¶

5. Security Considerations

Implementing this protocol requires careful consideration of security implications. Compression algorithms can introduce vulnerabilities if not properly secured. It is recommended to use encryption in conjunction with this protocol to ensure data integrity and confidentiality.¶

6. References

6.1. Normative References

[RFC2119]: Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, DOI 10.17487/RFC2119, March 1997, <https://www.rfc-editor.org/info/rfc2119>.
[RFC8174]: Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174, May 2017, <https://www.rfc-editor.org/info/rfc8174>.

6.2. Informative References

[exampleRefMin]: Smith, J., "Compression Algorithms: A Survey", 2006.
[exampleRefOrg]: Network Optimization Group, "Efficient Data Transmission Techniques", 1984, <http://www.example.com/>.