{"title":"一种基于蚂蚁算法的QoS路由算法","authors":"Zhang Subing, Liu Zemin","doi":"10.1109/LCN.2000.891102","DOIUrl":null,"url":null,"abstract":"The requirements of routing due to multimedia applications are discussed. In order to solve the QoS constrained routing effectively and efficiently, we construct a globally optimizing ant algorithm, which is based on the ability of ants to find the shortest path between their nest and the food source during their search for food. Simulation results show that the proposed approach can realize QoS routing effectively and efficiently.","PeriodicalId":369604,"journal":{"name":"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"A QoS routing algorithm based on ant algorithm\",\"authors\":\"Zhang Subing, Liu Zemin\",\"doi\":\"10.1109/LCN.2000.891102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The requirements of routing due to multimedia applications are discussed. In order to solve the QoS constrained routing effectively and efficiently, we construct a globally optimizing ant algorithm, which is based on the ability of ants to find the shortest path between their nest and the food source during their search for food. Simulation results show that the proposed approach can realize QoS routing effectively and efficiently.\",\"PeriodicalId\":369604,\"journal\":{\"name\":\"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2000.891102\",\"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 25th Annual IEEE Conference on Local Computer Networks. LCN 2000","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2000.891102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The requirements of routing due to multimedia applications are discussed. In order to solve the QoS constrained routing effectively and efficiently, we construct a globally optimizing ant algorithm, which is based on the ability of ants to find the shortest path between their nest and the food source during their search for food. Simulation results show that the proposed approach can realize QoS routing effectively and efficiently.