Arrow Research search
Back to FOCS

FOCS 1994

Priority Encoding Transmission

Conference Paper Accepted Paper Algorithms and Complexity · Theoretical Computer Science

Abstract

We introduce a novel approach for sending messages over lossy packet-based networks. The new method, called Priority Encoding Transmission, allows a user to specify a different priority on each segment of the message. Based on the priorities, the sender uses the system to encode the segments into packets for transmission. The system ensures recovery of the segments in order of their priority. The priority of a segment determines the minimum number of packets sufficient to recover the segment. We define a measure for a set of priorities, called the rate, which dictates how much information about the message must be contained in each bit of the encoding. We develop systems for implementing any set of priorities with rate equal to one. We also give an information-theoretic proof that there is no system that implements a set of priorities with rate greater than one. This work has applications to multi-media and high speed networks applications, especially in those with bursty sources and multiple receivers with heterogeneous capabilities. >

Authors

Keywords

  • Encoding
  • Computer science
  • Application software
  • Decoding
  • High-speed networks
  • Error correction
  • Buffer overflow
  • Bandwidth
  • Propagation losses
  • Positron emission tomography
  • Multiple Receivers
  • Multimedia Applications
  • Service Quality
  • Heterogeneous Network
  • Probability Of Failure
  • Video Images
  • Codeword
  • Close Approximation
  • Packet Loss
  • Priority Level
  • Information Messages
  • Packet Size
  • Nice Properties
  • Random Bits
  • Message Length
  • Random String
  • N Words
  • Probabilistic System

Context

Venue
IEEE Symposium on Foundations of Computer Science
Archive span
1975-2025
Indexed papers
3809
Paper id
219121151601920632
v2026.09.13