实时多媒体会议中与会者的统计同步

P. Zarros, Myung J. Lee, T. Saadawi
{"title":"实时多媒体会议中与会者的统计同步","authors":"P. Zarros, Myung J. Lee, T. Saadawi","doi":"10.1109/SCAC.1995.523643","DOIUrl":null,"url":null,"abstract":"In this paper, an algorithm to determine the set of packets generated continuously and periodically from different participants that are arriving at a node either for mixing at the master of a conference, or for simply playing back at a regular participant of a conference, is proposed. The essence of the algorithm is to estimate the average packet arrival time (or reference time) for each participant. With the reference time at hand, the maximum jitter and the optimum waiting time for a mixer to wait packets from all participants can be determined. The error of the proposed algorithm is enumerated by the Chernoff bound and is shown to be acceptable in practical application.","PeriodicalId":90699,"journal":{"name":"Proceedings. IEEE Symposium on Computers and Communications","volume":"03 1","pages":"30-36"},"PeriodicalIF":0.0000,"publicationDate":"1995-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Statistical synchronization among participants in real-time multimedia conference\",\"authors\":\"P. Zarros, Myung J. Lee, T. Saadawi\",\"doi\":\"10.1109/SCAC.1995.523643\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an algorithm to determine the set of packets generated continuously and periodically from different participants that are arriving at a node either for mixing at the master of a conference, or for simply playing back at a regular participant of a conference, is proposed. The essence of the algorithm is to estimate the average packet arrival time (or reference time) for each participant. With the reference time at hand, the maximum jitter and the optimum waiting time for a mixer to wait packets from all participants can be determined. The error of the proposed algorithm is enumerated by the Chernoff bound and is shown to be acceptable in practical application.\",\"PeriodicalId\":90699,\"journal\":{\"name\":\"Proceedings. IEEE Symposium on Computers and Communications\",\"volume\":\"03 1\",\"pages\":\"30-36\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IEEE Symposium on Computers and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCAC.1995.523643\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE Symposium on Computers and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCAC.1995.523643","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

本文提出了一种算法,用于确定从不同参与者连续和周期性地产生的数据包集,这些数据包将到达一个节点,以便在会议的主会场混合,或者在会议的常规参与者中简单地播放。该算法的核心是估计每个参与者的平均数据包到达时间(或参考时间)。有了参考时间,就可以确定混合器等待来自所有参与者的数据包的最大抖动和最佳等待时间。用切尔诺夫界列举了该算法的误差,并在实际应用中证明该算法的误差是可以接受的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Statistical synchronization among participants in real-time multimedia conference
In this paper, an algorithm to determine the set of packets generated continuously and periodically from different participants that are arriving at a node either for mixing at the master of a conference, or for simply playing back at a regular participant of a conference, is proposed. The essence of the algorithm is to estimate the average packet arrival time (or reference time) for each participant. With the reference time at hand, the maximum jitter and the optimum waiting time for a mixer to wait packets from all participants can be determined. The error of the proposed algorithm is enumerated by the Chernoff bound and is shown to be acceptable in practical application.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.10
自引率
0.00%
发文量
0
期刊最新文献
A Two-Pass Exact Algorithm for Selection on Parallel Disk Systems. Network outage impact measures for telecommunications Automatic restoration of telecommunication networks Brazil: the envisaged telecommunication scenario in the near future Impact of network transmission delay and echo on Group 3 facsimile performance
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1