面向媒体流的主动故障弹性覆盖组播

B. B. Bista
{"title":"面向媒体流的主动故障弹性覆盖组播","authors":"B. B. Bista","doi":"10.1109/NBiS.2009.23","DOIUrl":null,"url":null,"abstract":"IP multicast has been suffering from a large scale deployment due to various issues such as upgrading of routers, policy making, negotiation and so on. To overcome problems of IP multicast, overlay multicast in which multicast functionalities are implemented at end hosts has been proposed. However, unlike IP multicast non-leaf nodes in the multicast delivery tree are normal end hosts which can join and leave the tree freely. This causes the multicast tree unstable and disrupted nodes to rejoin the tree. In this paper, we propose that each node when joining the multicast tree sets its leaving time, i.e. how long it will stay in the tree, and sends join request to a number of nodes which are already on the tree. Using the leaving time of nodes, new nodes are joined at the tree such that a child's leaving time is earlier than its parent, i.e. the child will leave the tree earlier than its parent. This makes the tree more stable than joining at random nodes in the tree. Furthermore, we propose a proactive recovery mechanism so that even if a parent leaves the tree and children do not, children can rejoin at predetermined nodes immediately, so that the recovery time of the disrupted nodes is minimum. We have shown by simulation that there is less overhead when joining the multicast tree and the recovery time of the disrupted nodes is much less than the previous works.","PeriodicalId":312802,"journal":{"name":"2009 International Conference on Network-Based Information Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Proactive Fault Resilient Overlay Multicast for Media Streaming\",\"authors\":\"B. B. Bista\",\"doi\":\"10.1109/NBiS.2009.23\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"IP multicast has been suffering from a large scale deployment due to various issues such as upgrading of routers, policy making, negotiation and so on. To overcome problems of IP multicast, overlay multicast in which multicast functionalities are implemented at end hosts has been proposed. However, unlike IP multicast non-leaf nodes in the multicast delivery tree are normal end hosts which can join and leave the tree freely. This causes the multicast tree unstable and disrupted nodes to rejoin the tree. In this paper, we propose that each node when joining the multicast tree sets its leaving time, i.e. how long it will stay in the tree, and sends join request to a number of nodes which are already on the tree. Using the leaving time of nodes, new nodes are joined at the tree such that a child's leaving time is earlier than its parent, i.e. the child will leave the tree earlier than its parent. This makes the tree more stable than joining at random nodes in the tree. Furthermore, we propose a proactive recovery mechanism so that even if a parent leaves the tree and children do not, children can rejoin at predetermined nodes immediately, so that the recovery time of the disrupted nodes is minimum. We have shown by simulation that there is less overhead when joining the multicast tree and the recovery time of the disrupted nodes is much less than the previous works.\",\"PeriodicalId\":312802,\"journal\":{\"name\":\"2009 International Conference on Network-Based Information Systems\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Network-Based Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NBiS.2009.23\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Network-Based Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NBiS.2009.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

由于路由器升级、策略制定、协商等问题,IP组播技术在大规模部署过程中一直处于瓶颈期。为了克服IP组播存在的问题,提出了在终端主机上实现组播功能的覆盖组播。然而,与IP组播不同,组播交付树中的非叶节点是可以自由加入和离开树的普通终端主机。这会导致组播树不稳定,中断的节点会重新加入树。在本文中,我们提出每个节点在加入组播树时设置其离开时间,即它将在树中停留多长时间,并向已经在树上的多个节点发送加入请求。使用节点的离开时间,在树中加入新节点,使子节点的离开时间早于其父节点,即子节点将早于其父节点离开树。这使得树比在树中随机节点连接更稳定。此外,我们提出了一种主动恢复机制,即使父节点离开树而子节点没有,子节点也可以立即在预定节点重新加入,从而使中断节点的恢复时间最小。仿真结果表明,该方法减少了加入组播树时的开销,并且大大缩短了中断节点的恢复时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Proactive Fault Resilient Overlay Multicast for Media Streaming
IP multicast has been suffering from a large scale deployment due to various issues such as upgrading of routers, policy making, negotiation and so on. To overcome problems of IP multicast, overlay multicast in which multicast functionalities are implemented at end hosts has been proposed. However, unlike IP multicast non-leaf nodes in the multicast delivery tree are normal end hosts which can join and leave the tree freely. This causes the multicast tree unstable and disrupted nodes to rejoin the tree. In this paper, we propose that each node when joining the multicast tree sets its leaving time, i.e. how long it will stay in the tree, and sends join request to a number of nodes which are already on the tree. Using the leaving time of nodes, new nodes are joined at the tree such that a child's leaving time is earlier than its parent, i.e. the child will leave the tree earlier than its parent. This makes the tree more stable than joining at random nodes in the tree. Furthermore, we propose a proactive recovery mechanism so that even if a parent leaves the tree and children do not, children can rejoin at predetermined nodes immediately, so that the recovery time of the disrupted nodes is minimum. We have shown by simulation that there is less overhead when joining the multicast tree and the recovery time of the disrupted nodes is much less than the previous works.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信