使用多代理为组播树预留资源

Y. Kakuda, K. Ishida, S. Inoue, K. Amano
{"title":"使用多代理为组播树预留资源","authors":"Y. Kakuda, K. Ishida, S. Inoue, K. Amano","doi":"10.1109/RTCSA.1998.726358","DOIUrl":null,"url":null,"abstract":"Multicast is a message delivery scheme from a source node to all nodes that belong to the given membership through a multicast tree. The paper discusses how source based multicast trees are set up such that the maximum damage due to failure of any link to the multicast trees is minimized. Then, the paper proposes a multiagent based method for finding such multiple source based multicast trees. The proposed method assumes that candidates of multicast tree rooted at each source node are given according to some criteria. Under this assumption, first, shared links in multiple multicast trees whose source nodes are different are recognized. Then, a multicast tree rooted at each source node is determined such that damage due to failure of a shared link is minimized. The proposed method has a potentially good adaptability for change of both network resources such as topology and link capacity and resource requirements such as source node, membership, and bandwidth of multicast trees.","PeriodicalId":142319,"journal":{"name":"Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Resource reservation for multicast trees using multiagents\",\"authors\":\"Y. Kakuda, K. Ishida, S. Inoue, K. Amano\",\"doi\":\"10.1109/RTCSA.1998.726358\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multicast is a message delivery scheme from a source node to all nodes that belong to the given membership through a multicast tree. The paper discusses how source based multicast trees are set up such that the maximum damage due to failure of any link to the multicast trees is minimized. Then, the paper proposes a multiagent based method for finding such multiple source based multicast trees. The proposed method assumes that candidates of multicast tree rooted at each source node are given according to some criteria. Under this assumption, first, shared links in multiple multicast trees whose source nodes are different are recognized. Then, a multicast tree rooted at each source node is determined such that damage due to failure of a shared link is minimized. The proposed method has a potentially good adaptability for change of both network resources such as topology and link capacity and resource requirements such as source node, membership, and bandwidth of multicast trees.\",\"PeriodicalId\":142319,\"journal\":{\"name\":\"Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-10-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTCSA.1998.726358\",\"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 Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTCSA.1998.726358","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

多播是一种通过多播树从源节点到属于给定成员的所有节点的消息传递方案。本文讨论了如何建立基于源的组播树,使组播树中任何链路失效所造成的最大损失最小化。在此基础上,提出了一种基于多智能体的多源组播树查找方法。该方法假定在每个源节点上都有候选的组播树,并根据一定的准则给出候选的组播树。在此假设下,首先可以识别源节点不同的多播树中的共享链路。然后,在每个源节点上确定一棵多播树,使共享链路故障造成的损害最小化。该方法对拓扑、链路容量等网络资源的变化和组播树源节点、隶属关系、带宽等资源需求的变化具有较好的适应性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Resource reservation for multicast trees using multiagents
Multicast is a message delivery scheme from a source node to all nodes that belong to the given membership through a multicast tree. The paper discusses how source based multicast trees are set up such that the maximum damage due to failure of any link to the multicast trees is minimized. Then, the paper proposes a multiagent based method for finding such multiple source based multicast trees. The proposed method assumes that candidates of multicast tree rooted at each source node are given according to some criteria. Under this assumption, first, shared links in multiple multicast trees whose source nodes are different are recognized. Then, a multicast tree rooted at each source node is determined such that damage due to failure of a shared link is minimized. The proposed method has a potentially good adaptability for change of both network resources such as topology and link capacity and resource requirements such as source node, membership, and bandwidth of multicast trees.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信