{"title":"Distributed message routing in unstructured P2P network overlays","authors":"M. Ciglarič, M. Pancur, M. Trampus, T. Vidmar","doi":"10.1109/EURCON.2003.1248152","DOIUrl":null,"url":null,"abstract":"The paper presents an alternative message routing approach in unstructured peer-to-peer overlay networks. Unstructured peer-to-peer systems are loosely coupled, highly autonomous systems without hierarchy. Usually, flooding-based routing mechanisms are used for sending messages through the application layer overlay. Due to the limited scalability and high network load experiences, the paper suggests an improvement to reduce the traffic and overall performance: a peer remembers recently forwarded answers, so that he may route the next query messages with the same contents only to the relevant neighbor, not to all of them. Preliminary network simulations have shown promising results.","PeriodicalId":337983,"journal":{"name":"The IEEE Region 8 EUROCON 2003. Computer as a Tool.","volume":"279 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The IEEE Region 8 EUROCON 2003. Computer as a Tool.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURCON.2003.1248152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The paper presents an alternative message routing approach in unstructured peer-to-peer overlay networks. Unstructured peer-to-peer systems are loosely coupled, highly autonomous systems without hierarchy. Usually, flooding-based routing mechanisms are used for sending messages through the application layer overlay. Due to the limited scalability and high network load experiences, the paper suggests an improvement to reduce the traffic and overall performance: a peer remembers recently forwarded answers, so that he may route the next query messages with the same contents only to the relevant neighbor, not to all of them. Preliminary network simulations have shown promising results.