{"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}
引用次数: 0
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.