By Topic

Communication architectures and algorithms for media mixing in multimedia conferences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
P. V. Rangan ; Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA ; H. M. Vin ; S. Ramanathan

The problem of media mixing that arises in teleconferencing applications such as teleorchestra is addressed. The mixing algorithm presented minimizes the difference between generation times of the media packets that are being mixed together in the absence of globally synchronized clocks, but in the presence of jitter in communication delays on packet switched networks. In order to support applications, such as teleorchestra, that involve a large number of participants, hierarchical mixing architectures are proposed, and it is shown that they are an order of magnitude more scalable than purely centralized or distributed architectures. Furthermore, mechanisms for minimizing the delays incurred by mixing in various communication architectures are presented. The mixing algorithms are implemented on a network of workstations connected by Ethernets, and the performance of various mixing architectures is experimentally evaluated. The results reveal the maximum number of participants that can be supported in a conference

Published in:

IEEE/ACM Transactions on Networking  (Volume:1 ,  Issue: 1 )