A universal approach to queuing with distortion control

An efficient buffer-management algorithm is developed for queues that handle distortion-tolerant data under finite memory limitations. We avoid overflows and realize significant performance gains through the use of multiresolution source codes. These codes enable us to reduce the fidelity of signal...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on automatic control Vol. 50; no. 4; pp. 532 - 537
Main Authors Draper, S.C., Trott, M.D., Wornell, G.W.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.04.2005
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Acoustic distortion
Algorithm design and analysis
Applied sciences
Buffer management
Buffer storage
Communication system control
Computer science; control theory; systems
congestion control
Control theory. Systems
Educational institutions
Exact sciences and technology
Image storage
Legged locomotion
Miscellaneous
multimedia communications
multiresolution source coding
Performance gain
queuing analysis
Signal resolution
Statistics
successive refinement
transcoding
Overflow(computer arithmetics)
Multimedia
multimedia communications
Statistical analysis
successive refinement
Finite memory
Refinement method
congestion control
Buffer system
Multiresolution analysis
Overflow
Arrival time
Service time
Optimal trajectory
queuing analysis
Buffer management
Optimal path
Queue
multiresolution source coding
Traffic congestion
transcoding
Online AccessGet full text

Cover

More Information
Summary:An efficient buffer-management algorithm is developed for queues that handle distortion-tolerant data under finite memory limitations. We avoid overflows and realize significant performance gains through the use of multiresolution source codes. These codes enable us to reduce the fidelity of signal descriptions in a controlled progressive manner. The proposed approach is universal, i.e., it works without knowledge of queue arrival and departure statistics. More strongly, we show that its performance is sample-path optimal, i.e., it achieves an average distortion equal to the best achievable by any algorithm, including those designed with full noncausal knowledge of queue arrival and service times.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2005.844911