{"title":"时延容忍网络中的路由和缓冲策略:综述与评价","authors":"Shou-Chih Lo, Min-Hua Chiang, Jhan-Hua Liou, Jhih-Siao Gao","doi":"10.1109/ICPPW.2011.19","DOIUrl":null,"url":null,"abstract":"Delay Tolerant Networks (DTNs) have attracted considerable attention in recent years. This kind of network works in communication environments subject to delays and disruptions. Traditional end-to-end routing fails in DTNs due to intermittent connections. A variety of routing strategies for DTNs have been proposed in the past. In this paper, we present a survey of these strategies and provide a classification. Moreover, we evaluate their use in social contact networks. Buffer management strategies are also needed to support routing operations. The technical issue is to design sorting policies that determine the transmission and drop order of messages in the buffer. We identify several sorting indexes and evaluate their performance.","PeriodicalId":173271,"journal":{"name":"2011 40th International Conference on Parallel Processing Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"36","resultStr":"{\"title\":\"Routing and Buffering Strategies in Delay-Tolerant Networks: Survey and Evaluation\",\"authors\":\"Shou-Chih Lo, Min-Hua Chiang, Jhan-Hua Liou, Jhih-Siao Gao\",\"doi\":\"10.1109/ICPPW.2011.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Delay Tolerant Networks (DTNs) have attracted considerable attention in recent years. This kind of network works in communication environments subject to delays and disruptions. Traditional end-to-end routing fails in DTNs due to intermittent connections. A variety of routing strategies for DTNs have been proposed in the past. In this paper, we present a survey of these strategies and provide a classification. Moreover, we evaluate their use in social contact networks. Buffer management strategies are also needed to support routing operations. The technical issue is to design sorting policies that determine the transmission and drop order of messages in the buffer. We identify several sorting indexes and evaluate their performance.\",\"PeriodicalId\":173271,\"journal\":{\"name\":\"2011 40th International Conference on Parallel Processing Workshops\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"36\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 40th International Conference on Parallel Processing Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPPW.2011.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 40th International Conference on Parallel Processing Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPPW.2011.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Routing and Buffering Strategies in Delay-Tolerant Networks: Survey and Evaluation
Delay Tolerant Networks (DTNs) have attracted considerable attention in recent years. This kind of network works in communication environments subject to delays and disruptions. Traditional end-to-end routing fails in DTNs due to intermittent connections. A variety of routing strategies for DTNs have been proposed in the past. In this paper, we present a survey of these strategies and provide a classification. Moreover, we evaluate their use in social contact networks. Buffer management strategies are also needed to support routing operations. The technical issue is to design sorting policies that determine the transmission and drop order of messages in the buffer. We identify several sorting indexes and evaluate their performance.