单约束路由的链路状态和类蚁算法行为

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI:10.1109/HPSR.2001.923651

T. Michalareas, Lionel Sacks

{"title":"单约束路由的链路状态和类蚁算法行为","authors":"T. Michalareas, Lionel Sacks","doi":"10.1109/HPSR.2001.923651","DOIUrl":null,"url":null,"abstract":"In this paper we examine the steady state behaviour of the link state routing protocol and the AntNet algorithm in simple topologies under uniform load. We show that under our scenario conditions both algorithms behave in the same operational region. We discuss also the applied statistical methodology and the necessary measurements for throughput behaviour in steady state.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Link-state and ant-like algorithm behaviour for single-constrained routing\",\"authors\":\"T. Michalareas, Lionel Sacks\",\"doi\":\"10.1109/HPSR.2001.923651\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we examine the steady state behaviour of the link state routing protocol and the AntNet algorithm in simple topologies under uniform load. We show that under our scenario conditions both algorithms behave in the same operational region. We discuss also the applied statistical methodology and the necessary measurements for throughput behaviour in steady state.\",\"PeriodicalId\":308964,\"journal\":{\"name\":\"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR.2001.923651\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2001.923651","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

在本文中，我们研究了在均匀负载下简单拓扑中链路状态路由协议和AntNet算法的稳态行为。我们证明了在我们的场景条件下，两种算法在相同的操作区域中表现。我们还讨论了应用的统计方法和必要的测量在稳定状态下的吞吐量行为。

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

查看原文本刊更多论文

Link-state and ant-like algorithm behaviour for single-constrained routing

In this paper we examine the steady state behaviour of the link state routing protocol and the AntNet algorithm in simple topologies under uniform load. We show that under our scenario conditions both algorithms behave in the same operational region. We discuss also the applied statistical methodology and the necessary measurements for throughput behaviour in steady state.

求助全文

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

来源期刊

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)

自引率

0.00%

发文量