Chuiwei Lu, Chao Gao, Honghua Wu, Zhao-hai Zhang, Junhua He
{"title":"基于非齐次方向de Bruijn图的容错路由优化策略","authors":"Chuiwei Lu, Chao Gao, Honghua Wu, Zhao-hai Zhang, Junhua He","doi":"10.1109/IWISA.2010.5473314","DOIUrl":null,"url":null,"abstract":"routing failure problem seriously declines the stability and working efficiency of P2P network. We find less routing failure are caused by malicious attacks, but most routing failure result from several reasons, such as high join/leave rate of nodes, inhomogeneous distribution of nodes, and performance deference among nodes. The paper proposed an improved de Bruijn graph, which own region aggregate and inhomogeneous characteristics, and well match the practical internet circumstance. We use the graph to descript the P2P network structure, which highly weaken the conditions that will lead to routing failure. Theoretic deduction implies that the strategy has many available merits, and can effectively deal with routing failure.","PeriodicalId":298764,"journal":{"name":"2010 2nd International Workshop on Intelligent Systems and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Optimal Strategy of Fault-Tolerant Routing Based on Inhomogeneous Directional de Bruijn Graph\",\"authors\":\"Chuiwei Lu, Chao Gao, Honghua Wu, Zhao-hai Zhang, Junhua He\",\"doi\":\"10.1109/IWISA.2010.5473314\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"routing failure problem seriously declines the stability and working efficiency of P2P network. We find less routing failure are caused by malicious attacks, but most routing failure result from several reasons, such as high join/leave rate of nodes, inhomogeneous distribution of nodes, and performance deference among nodes. The paper proposed an improved de Bruijn graph, which own region aggregate and inhomogeneous characteristics, and well match the practical internet circumstance. We use the graph to descript the P2P network structure, which highly weaken the conditions that will lead to routing failure. Theoretic deduction implies that the strategy has many available merits, and can effectively deal with routing failure.\",\"PeriodicalId\":298764,\"journal\":{\"name\":\"2010 2nd International Workshop on Intelligent Systems and Applications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 2nd International Workshop on Intelligent Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWISA.2010.5473314\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 2nd International Workshop on Intelligent Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWISA.2010.5473314","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Optimal Strategy of Fault-Tolerant Routing Based on Inhomogeneous Directional de Bruijn Graph
routing failure problem seriously declines the stability and working efficiency of P2P network. We find less routing failure are caused by malicious attacks, but most routing failure result from several reasons, such as high join/leave rate of nodes, inhomogeneous distribution of nodes, and performance deference among nodes. The paper proposed an improved de Bruijn graph, which own region aggregate and inhomogeneous characteristics, and well match the practical internet circumstance. We use the graph to descript the P2P network structure, which highly weaken the conditions that will lead to routing failure. Theoretic deduction implies that the strategy has many available merits, and can effectively deal with routing failure.