CS631 Paper Response Form
Paper Title: Cyclic-UDP: A Priority-Driven Best-Effort Protocol
Author(s): B.C. Smith
Main Point(s):
The paper describes cyclic-UDP, a prioritized best-effort transmission protocol for
audio and video. Within blocks of temporal samples
of audio and video data, the samples are prioritized using the inverse binary order
to the effect that low-resolution signals are transmitted first, which are then successively
refined as time permits. The best effort protocol sends bursts of packets in order of priority.
After each burst, the sender waits for resend requests from the receiver. The waiting time
depends on an estimation of the channel bandwidth that is computed at the destination
in regular, predefined intervals and sent back to the source, that uses this information to
update a long-term estimate of the channel bandwidth.
Possible Use(s):
The protocol meets the demands of users who want to transmit multimedia data over
networks despite limited bandwidth in general and congestion in particular.
Extensions:
It would be interesting to vary the prioritization scheme. For example, one could
apply the prioritization scheme to scaled-space approaches, thereby avoiding jitters
at the expense of image quality. Another possibility would be to combine it with
algorithms that assign regions within an image different priorities, such that important
regions would be updated before unimportant ones (probably this won't work for camera
sweeps).
CS631 home page