移动网络中的因果组播

P. Chandra, A. Kshemkalyani
{"title":"移动网络中的因果组播","authors":"P. Chandra, A. Kshemkalyani","doi":"10.1109/MASCOT.2004.1348235","DOIUrl":null,"url":null,"abstract":"Distributed applications using file sharing and file replication, conferencing, and delivery in multimedia systems often need to use the semantics of causal multicast. Causal multicast in a mobile system is complicated by the various limitations imposed by the mobile system. Though there are different directions to improve the performance of causal multicast algorithms in mobile systems, at the core of such algorithms is the module to impose causal delivery among a set of nodes, which may be either mobile hosts, or mobile service stations, or peers at a higher level in the interconnection hierarchy. We show how to adapt the optimal causal multicast algorithm of Kshemkalyani-Singhal to mobile networks, and then show simulation results comparing its performance with that of other algorithms for causal multicast in mobile networks.","PeriodicalId":32394,"journal":{"name":"Performance","volume":"21 1","pages":"213-220"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"Causal multicast in mobile networks\",\"authors\":\"P. Chandra, A. Kshemkalyani\",\"doi\":\"10.1109/MASCOT.2004.1348235\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Distributed applications using file sharing and file replication, conferencing, and delivery in multimedia systems often need to use the semantics of causal multicast. Causal multicast in a mobile system is complicated by the various limitations imposed by the mobile system. Though there are different directions to improve the performance of causal multicast algorithms in mobile systems, at the core of such algorithms is the module to impose causal delivery among a set of nodes, which may be either mobile hosts, or mobile service stations, or peers at a higher level in the interconnection hierarchy. We show how to adapt the optimal causal multicast algorithm of Kshemkalyani-Singhal to mobile networks, and then show simulation results comparing its performance with that of other algorithms for causal multicast in mobile networks.\",\"PeriodicalId\":32394,\"journal\":{\"name\":\"Performance\",\"volume\":\"21 1\",\"pages\":\"213-220\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Performance\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASCOT.2004.1348235\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Performance","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.2004.1348235","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

摘要

在多媒体系统中使用文件共享和文件复制、会议和传递的分布式应用程序通常需要使用因果组播的语义。由于移动系统的种种限制,使得移动系统中的因果组播变得复杂。尽管在移动系统中提高因果组播算法的性能有不同的方向,但这种算法的核心是在一组节点之间施加因果传递的模块,这些节点可以是移动主机,也可以是移动服务站,也可以是互连层次中更高层次的对等体。我们展示了如何将Kshemkalyani-Singhal的最优因果组播算法应用于移动网络,然后展示了其与其他移动网络因果组播算法性能的仿真结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Causal multicast in mobile networks
Distributed applications using file sharing and file replication, conferencing, and delivery in multimedia systems often need to use the semantics of causal multicast. Causal multicast in a mobile system is complicated by the various limitations imposed by the mobile system. Though there are different directions to improve the performance of causal multicast algorithms in mobile systems, at the core of such algorithms is the module to impose causal delivery among a set of nodes, which may be either mobile hosts, or mobile service stations, or peers at a higher level in the interconnection hierarchy. We show how to adapt the optimal causal multicast algorithm of Kshemkalyani-Singhal to mobile networks, and then show simulation results comparing its performance with that of other algorithms for causal multicast in mobile networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信