The Concord Algorithm for Synchronization of Networked Multimedia Streams

Synchronizing di erent 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 de nes a single framework to deal with both problems, and operates under the in uence of parameters which can be supplied by the application involved. In particular, these parameters are used to allow a trade-o 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 bu er delay size required.

• Type: Conference
• Year: 1995
• Where: ICMCS
• Authors: Narayanan Shivakumar, Cormac J. Sreenan, B. Narendran, Prathima Agrawal
• Keywords: End-to-end Delay, Erent Data Streams, ICMCS 1995, Multimedia, Total End-to-end Delay