Packet-based data compression method

作者: David W. Carr

DOI:

关键词:

摘要: A data processing system is described that employs packets which include at least static and dynamic fields, the fields containing information often remains constant during a multi-packet communication interval changes for each packet. Many also user-data fields. compression method comprises: reformatting packet by associating its with first region second region. The process then assembles table includes from an initial packet's It identifies field in subsequent common to table. Such encoded so as reduce length. replaced modified transmitted. similar action occurs respect information. single dictionary created all headers, while separate tables are portion of packet-type experienced network thereby enabling better compression.

参考文章(16)
Manabu Kawabe, Takuro Sato, Yoshihito Shimazaki, Data compression method ,(1988)
Mark N. Wegman, Victor Saul Miller, Data compression method ,(1986)
David J. Van Maren, David W. Ruska, Jeff J. Kato, Performance-based reset of data compression dictionary ,(1988)
Hiroshi Yashiki, Osamu Hirose, Tokuhiro Tsukiyama, Method and apparatus for data compression and restoration ,(1987)
Jacob Ziv, Martin Cohn, Abraham Lempel, Willard L. Eastman, Apparatus and method for compressing data signals and restoring the compressed data signals ,(1981)
Robert D. Wachel, Keith A. Rubow, Data compression method using textual substitution ,(1990)
Joan Laverne Mitchell, Jorma Johannes Rissanen, William Boone Pennebaker, Dynamic model selection during data compression ,(1990)