Publication View

The Concord Algorithm for Synchronization of Networked Multimedia Streams (1996)

Abstract
Synchronizing different data streams from multiple sources simultaneously at a receiver is one of the basic problems involved in multimedia distributed systems. This requirement stems from the nature of packet based networks which can introduce end-to-end delays that vary both within and across streams. In this paper, we present a new algorithm called Concord, which provides an integrated solution for these single and multiple stream synchronization problems. It is notable because it defines a single framework to deal with both problems, and operates under the influence of parameters which can be supplied by the application involved. In particular, these parameters are used to allow a trade-off between the packet loss rates, total end-to-end delay and skew for each of the streams. For applications like conferencing this is used to reduce delay by determining the minimum buffer delay/size required. 1 Introduction The use of packet based communication networks to transport digitized str...

Publication details
Download http://citeseer.ist.psu.edu/68342.html
Source http://www-db.stanford.edu/pub/papers/icmcs95.ps
Publisher unknown
Contributors The Pennsylvania State University CiteSeer Archives
Repository CiteSeer (United States)
Keywords N. Shivakumar,C. J. Sreenan,B. Narendran,P. Agrawal The Concord Algorithm for Synchronization of Networked Multimedia Streams
Language Englisch
Relation oai:CiteSeerPSU:90522, oai:CiteSeerPSU:344343