Stanford InfoLab Publication Server

The Concord Algorithm for Synchronization of Networked Multimedia Streams

Shivakumar, N. and Sreenan, C. and Narendran, B. and Agrawal, P. (1995) The Concord Algorithm for Synchronization of Networked Multimedia Streams. In: 2nd IEEE International Conference on Multi-media Computing and Systems'95 (ICMCS 1995), May 1995, Washington, DC.




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.

Item Type:Conference or Workshop Item (Paper)
Uncontrolled Keywords:Jitter-free, Multimedia, Packet networks
Subjects:Computer Science > Mobile Computing
Projects:Digital Libraries
Related URLs:Project Homepage
ID Code:93
Deposited By:Import Account
Deposited On:25 Feb 2000 16:00
Last Modified:05 Feb 2009 15:12

Download statistics

Repository Staff Only: item control page