Higher Bandwidth X

ABSTRACT

Network bandwidth has always been a key issue for multimedia protocols. Many potential users of networked multimedia protocols will continue to have low bandwidth network connections for some time: copper wire ISDN, infra-red, cellular modems, etc.. Compression provides potential relief for users of slow networks by increasing effective bandwidth. Higher Bandwidth X (HBX) introduces a new technique, based on arithmetic coding and statistical modeling, for compressing structured data. Applied to the X networked graphics protocol, this technique yields 6.3:1 compression across a representative set of traces, performing twice as well as the popular LZW-based Xremote compression protocol. HBX's coding techniques are generally applicable to the graphics and imaging subset of multimedia protocols. Future work will determine whether HBX's coding techniques can be applied to audio and video streams as well.

REFERENCES

• 1: James Gosling , David S. H. Rosenthal , Michele J. Arden, The NeWS book: an introduction to the network/extensible window system, Springer-Verlag New York, Inc., New York, NY, 1989
• 2: Timothy C. Bell , John G. Cleary , Ian H. Witten, Text compression, Prentice-Hall, Inc., Upper Saddle River, NJ, 1990
• 3: (~',ornelius, David, "Xremote: a serial line protocol for X" 6th Annual X Technical Conference, Boston, MA, 1992
• 4: John Danskin , Pat Hanrahan, Profiling the X protocol (extended abstract), Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems, p.272-273, May 16-20, 1994, Nashville, Tennessee, United States
• 5: Danskin, John and Pat Hanrahan, "Compression Performance of the Xremote Protocol," I994 Data (7ompression Con.ference. Full paper in Technical Report CS-TR-441-94, Department of Computer Science, Princeton University, Princeton, N J, January 1994.
• 6: John Moffatt Danskin, Compressing the X graphics protocol, Princeton University, Princeton, NJ, 1994
• 7: James Gettys , Philip L. Karlton , Scott McGregor, The X Window System, version 11, Software—Practice & Experience, v.20 n.S2, p.35-67, Oct. 20, 1990 [doi>10.1002/spe.4380201404]
• 8: Guazzo, M., "A general minintum redundancy source coding algorithm," iEEE Trans. Information Theory, IT-26 (1), 15-25, January 1980.
• 9: Moffatt, A., "A note on the PPM data compression algorithm,'' Research Report 88/7, Department of Cornpurer Science, University of Melbourne, Parkville, Victoria, Australia.
• 10: David A. Patterson , John L. Hennessy, Computer organization & design: the hardware/software interface, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1993
• 11: Rissanen, J. J., and G. G. Langdon, "Arithmetic coding,'' IBM J. Research and Development, 23(2), 149- 162, March 1979.
• 12: Rubin, F., "Arithmetic stream coding using fixed precision registers," IEEE Trans. Information Theory, IT-25 (6), 672-675, November 1979.
• 13: Scheifler Robert W., "The X Window Systein Protocol,'' M.I.T. Laboratory for Computer Science. 1988.
• 14: Robert W. Scheifler , Jim Gettys, The X window system, ACM Transactions on Graphics (TOG), v.5 n.2, p.79-109, April 1986 [doi>10.1145/22949.24053]
• 15: Shannon, C. E., "A mathematicM theory of communication,'' Bell System Technical JournM, 27, 398-403, July 1948

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.2 Network Protocols

          Nouns: X Network Protocol

Additional Classification:
  E. Data
  E.4 CODING AND INFORMATION THEORY
      Subjects: Data compaction and compression

  H. Information Systems
  H.5 INFORMATION INTERFACES AND PRESENTATION (I.7)
      H.5.1 Multimedia Information Systems
          Subjects: Evaluation/methodology

General Terms:
Design, Performance