基于拉格朗日松弛的分组网络组播路由算法

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS) Pub Date : 2010-11-09 DOI:10.1109/NETWKS.2010.5624921

M. Piechowiak, M. Stasiak, P. Zwierzykowski

{"title":"基于拉格朗日松弛的分组网络组播路由算法","authors":"M. Piechowiak, M. Stasiak, P. Zwierzykowski","doi":"10.1109/NETWKS.2010.5624921","DOIUrl":null,"url":null,"abstract":"The paper presents a proposal of a new multicast routing algorithm for finding a multicast tree in packet-switched networks. The objective of the MLRA (Multicast Routing Algorithm with Lagrange Relaxation) is to minimize the cost of paths between the source and each destination node using Lagrange relaxation, and eventually, minimize the total cost of multicast tree. A wide range of simulation experiments carried out by the authors for many network topologies and parameters confirmed the effectiveness of the proposed algorithm.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Multicast Routing Algorithm for packet networks with the application of the Lagrange Relaxation\",\"authors\":\"M. Piechowiak, M. Stasiak, P. Zwierzykowski\",\"doi\":\"10.1109/NETWKS.2010.5624921\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents a proposal of a new multicast routing algorithm for finding a multicast tree in packet-switched networks. The objective of the MLRA (Multicast Routing Algorithm with Lagrange Relaxation) is to minimize the cost of paths between the source and each destination node using Lagrange relaxation, and eventually, minimize the total cost of multicast tree. A wide range of simulation experiments carried out by the authors for many network topologies and parameters confirmed the effectiveness of the proposed algorithm.\",\"PeriodicalId\":202408,\"journal\":{\"name\":\"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)\",\"volume\":\"138 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NETWKS.2010.5624921\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETWKS.2010.5624921","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

针对分组交换网络中寻找组播树的问题，提出了一种新的组播路由算法。基于拉格朗日松弛的组播路由算法(MLRA)的目标是利用拉格朗日松弛使源节点和目的节点之间的路径开销最小，最终使组播树的总开销最小。作者对许多网络拓扑和参数进行了广泛的仿真实验，证实了所提出算法的有效性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Multicast Routing Algorithm for packet networks with the application of the Lagrange Relaxation

The paper presents a proposal of a new multicast routing algorithm for finding a multicast tree in packet-switched networks. The objective of the MLRA (Multicast Routing Algorithm with Lagrange Relaxation) is to minimize the cost of paths between the source and each destination node using Lagrange relaxation, and eventually, minimize the total cost of multicast tree. A wide range of simulation experiments carried out by the authors for many network topologies and parameters confirmed the effectiveness of the proposed algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)

自引率

0.00%

发文量