带宽竞标中的包容性和生存性

Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160) Pub Date : 1998-07-03 DOI:10.1109/ICMAS.1998.699229

J. Bigham, A. L. Hayzelden

{"title":"带宽竞标中的包容性和生存性","authors":"J. Bigham, A. L. Hayzelden","doi":"10.1109/ICMAS.1998.699229","DOIUrl":null,"url":null,"abstract":"Cooperative agents provide layers of competence to control a telecom network. Higher planning layers coordinate lower layers by seeking to globally optimise the survivability of the network. It is shown that the process of finding the best flow in the network can be viewed as a distributed auction where the prices are obtained from the derivatives of the survivability function. In the application, a simple measure of survivability maps into familiar routing heuristics.","PeriodicalId":244857,"journal":{"name":"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Subsumption and survivability in bidding for bandwidth\",\"authors\":\"J. Bigham, A. L. Hayzelden\",\"doi\":\"10.1109/ICMAS.1998.699229\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cooperative agents provide layers of competence to control a telecom network. Higher planning layers coordinate lower layers by seeking to globally optimise the survivability of the network. It is shown that the process of finding the best flow in the network can be viewed as a distributed auction where the prices are obtained from the derivatives of the survivability function. In the application, a simple measure of survivability maps into familiar routing heuristics.\",\"PeriodicalId\":244857,\"journal\":{\"name\":\"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMAS.1998.699229\",\"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 International Conference on Multi Agent Systems (Cat. No.98EX160)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMAS.1998.699229","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

合作代理提供了控制电信网络的权限层。更高的规划层通过寻求全局优化网络的生存能力来协调更低的规划层。结果表明，寻找网络中最优流的过程可以看作是一个分布式拍卖，其价格由生存函数的导数获得。在应用程序中，生存性的简单度量映射到熟悉的路由启发式。

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

查看原文本刊更多论文

Subsumption and survivability in bidding for bandwidth

Cooperative agents provide layers of competence to control a telecom network. Higher planning layers coordinate lower layers by seeking to globally optimise the survivability of the network. It is shown that the process of finding the best flow in the network can be viewed as a distributed auction where the prices are obtained from the derivatives of the survivability function. In the application, a simple measure of survivability maps into familiar routing heuristics.

求助全文

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

来源期刊

Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160)

自引率

0.00%

发文量