{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:42Z","timestamp":1750307622975,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"1-2","license":[{"start":{"date-parts":[[2008,7,25]],"date-time":"2008-07-25T00:00:00Z","timestamp":1216944000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2008,7,25]]},"abstract":"<jats:p>Lately P2P application routing got interest and finding better routing and increasing performance and security is real challenge these days. Mostly research use overlay routing even using interconnection network design dynamically. Goal is to route a message to a destination whose IP address is not known which eliminates the need for large routing tables. Nevertheless, the overlay network could become wasteful because outgoing traffic may take a route longer than necessary. In this abstract, we propose a new design for P2P features. These new design is to combine physical and logical networks to reduce traffic and improving performance and security. This new design provides node organization for faster searching. Work used simulation program to show these new design better performance than existing design. Algorithm of new routing is defined mathematical algebraic model to show every case. Our next step is to actually improving localizing design with new overlay network design.<\/jats:p>","DOI":"10.1145\/1394042.1394082","type":"journal-article","created":{"date-parts":[[2008,7,29]],"date-time":"2008-07-29T13:22:19Z","timestamp":1217337739000},"page":"70-71","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["New algebraic design for better P2P Features (abstract only)"],"prefix":"10.1145","volume":"42","author":[{"given":"Osman","family":"Guzide","sequence":"first","affiliation":[{"name":"Shepherd University"}]},{"given":"Kenneth","family":"May","sequence":"additional","affiliation":[{"name":"Shepherd University"}]},{"given":"James","family":"Getz","sequence":"additional","affiliation":[{"name":"Shepherd University"}]},{"given":"Adam","family":"Edgeson","sequence":"additional","affiliation":[{"name":"Shepherd University"}]}],"member":"320","published-online":{"date-parts":[[2008,7,25]]},"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1394042.1394082","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:52Z","timestamp":1750250752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1394042.1394082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,25]]},"references-count":0,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2008,7,25]]}},"alternative-id":["10.1145\/1394042.1394082"],"URL":"https:\/\/doi.org\/10.1145\/1394042.1394082","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2008,7,25]]},"assertion":[{"value":"2008-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}