{"title":"Anycast routing in Delay Tolerant Networks using genetic algorithms for route decision","authors":"É. da Silva, P. R. Guardieiro","doi":"10.1109/ICCITECHN.2008.4803128","DOIUrl":null,"url":null,"abstract":"Delay/Disruption Tolerant Networking (DTN) architecture adopts the concept of intermittent networks that may suffer frequent disconnections, with the possibility of never having end-to-end connectivity between the source and destination over a given period of time. Therefore, the design of protocols for those networks becomes a unique challenge. Routing in DTNs is one of the key components and remains open for discussion. In this paper we treat the routing for anycast delivery that is useful in situations where a host, applications or users wish to locate a host which supports a particular service. However, if several servers support the service, any of these servers can be used. Then we implement a routing algorithm using genetic algorithm (GA), because the route and destination decision influence many parameters simultaneously. Our simulation results have shown that the routing using GA performs better than the shortest path algorithm.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"2002 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 11th International Conference on Computer and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHN.2008.4803128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19
Abstract
Delay/Disruption Tolerant Networking (DTN) architecture adopts the concept of intermittent networks that may suffer frequent disconnections, with the possibility of never having end-to-end connectivity between the source and destination over a given period of time. Therefore, the design of protocols for those networks becomes a unique challenge. Routing in DTNs is one of the key components and remains open for discussion. In this paper we treat the routing for anycast delivery that is useful in situations where a host, applications or users wish to locate a host which supports a particular service. However, if several servers support the service, any of these servers can be used. Then we implement a routing algorithm using genetic algorithm (GA), because the route and destination decision influence many parameters simultaneously. Our simulation results have shown that the routing using GA performs better than the shortest path algorithm.