{"title":"点对点叠加中虚拟几何节点坐标的分配策略","authors":"A. Sambotin, M. Andreica, E. Mocanu","doi":"10.1109/3PGCIC.2011.46","DOIUrl":null,"url":null,"abstract":"In this paper we propose new strategies for computing virtual geometric node coordinates in peer-to-peer overlays. The main goal is to obtain a decentralized network where each peer has a set of (multidimensional) coordinates and the distance between two peers is proportional to the round-trip time (RTT) between the peers. We consider methods based on the Euclidean distance and the Linfinity norm. We apply our techniques to a multicast tree P2P overlay that we developed.","PeriodicalId":251730,"journal":{"name":"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Strategies for Assigning Virtual Geometric Node Coordinates in Peer-to-Peer Overlays\",\"authors\":\"A. Sambotin, M. Andreica, E. Mocanu\",\"doi\":\"10.1109/3PGCIC.2011.46\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose new strategies for computing virtual geometric node coordinates in peer-to-peer overlays. The main goal is to obtain a decentralized network where each peer has a set of (multidimensional) coordinates and the distance between two peers is proportional to the round-trip time (RTT) between the peers. We consider methods based on the Euclidean distance and the Linfinity norm. We apply our techniques to a multicast tree P2P overlay that we developed.\",\"PeriodicalId\":251730,\"journal\":{\"name\":\"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/3PGCIC.2011.46\",\"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 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/3PGCIC.2011.46","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Strategies for Assigning Virtual Geometric Node Coordinates in Peer-to-Peer Overlays
In this paper we propose new strategies for computing virtual geometric node coordinates in peer-to-peer overlays. The main goal is to obtain a decentralized network where each peer has a set of (multidimensional) coordinates and the distance between two peers is proportional to the round-trip time (RTT) between the peers. We consider methods based on the Euclidean distance and the Linfinity norm. We apply our techniques to a multicast tree P2P overlay that we developed.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
