多路径优化流量控制

Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium Pub Date : 2000-09-05 DOI:10.1109/ICON.2000.875766

S. Low

{"title":"多路径优化流量控制","authors":"S. Low","doi":"10.1109/ICON.2000.875766","DOIUrl":null,"url":null,"abstract":"We proposed earlier an optimization approach to flow control where the objective of the control is to maximize the aggregate utility of all sources over their transmission rates. The control mechanism is derived as a gradient projection algorithm to solve the dual problem. The algorithm assumes that each source is served by a single path. In this paper we extend the algorithm to the case where there are multiple paths between a source-destination pair. This allows flow control and routing to be jointly optimized.","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Multipath optimization flow control\",\"authors\":\"S. Low\",\"doi\":\"10.1109/ICON.2000.875766\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We proposed earlier an optimization approach to flow control where the objective of the control is to maximize the aggregate utility of all sources over their transmission rates. The control mechanism is derived as a gradient projection algorithm to solve the dual problem. The algorithm assumes that each source is served by a single path. In this paper we extend the algorithm to the case where there are multiple paths between a source-destination pair. This allows flow control and routing to be jointly optimized.\",\"PeriodicalId\":191244,\"journal\":{\"name\":\"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICON.2000.875766\",\"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 IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2000.875766","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 14

摘要

我们之前提出了一种流量控制的优化方法，其中控制的目标是使所有源的总效用超过其传输速率。为解决对偶问题，将控制机制推导为梯度投影算法。该算法假设每个源由单个路径提供服务。在本文中，我们将该算法扩展到源-目标对之间存在多条路径的情况。这使得流量控制和路由可以共同优化。

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

查看原文本刊更多论文

Multipath optimization flow control

We proposed earlier an optimization approach to flow control where the objective of the control is to maximize the aggregate utility of all sources over their transmission rates. The control mechanism is derived as a gradient projection algorithm to solve the dual problem. The algorithm assumes that each source is served by a single path. In this paper we extend the algorithm to the case where there are multiple paths between a source-destination pair. This allows flow control and routing to be jointly optimized.

求助全文

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

来源期刊

Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium

自引率

0.00%

发文量