简要公告:基于虚拟几何坐标的多播树嵌入P2P覆盖网络的分散构造

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing Pub Date : 2010-07-25 DOI:10.1145/1835698.1835766

M. Andreica, Andrei Dragus, A. Sambotin, N. Tapus

{"title":"简要公告:基于虚拟几何坐标的多播树嵌入P2P覆盖网络的分散构造","authors":"M. Andreica, Andrei Dragus, A. Sambotin, N. Tapus","doi":"10.1145/1835698.1835766","DOIUrl":null,"url":null,"abstract":"In this paper we consider the problem of efficiently constructing in a fully distributed manner multicast trees which are embedded into P2P overlays using virtual geometric node coordinates. We consider two objectives: to minimize the number of messages required for constructing a multicast tree by using the geometric properties of the P2P overlay, and to construct stable multicast trees when the lifetime durations of the peers are known.","PeriodicalId":447863,"journal":{"name":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Brief announcement: decentralized construction of multicast trees embedded into P2P overlay networks based on virtual geometric coordinates\",\"authors\":\"M. Andreica, Andrei Dragus, A. Sambotin, N. Tapus\",\"doi\":\"10.1145/1835698.1835766\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the problem of efficiently constructing in a fully distributed manner multicast trees which are embedded into P2P overlays using virtual geometric node coordinates. We consider two objectives: to minimize the number of messages required for constructing a multicast tree by using the geometric properties of the P2P overlay, and to construct stable multicast trees when the lifetime durations of the peers are known.\",\"PeriodicalId\":447863,\"journal\":{\"name\":\"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1835698.1835766\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1835698.1835766","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

本文研究了利用虚拟几何节点坐标，以完全分布式的方式高效构造嵌入到P2P覆盖层中的组播树的问题。我们考虑了两个目标:利用P2P覆盖的几何特性来最小化构建组播树所需的消息数量，以及在对等体的生存时间已知的情况下构建稳定的组播树。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Brief announcement: decentralized construction of multicast trees embedded into P2P overlay networks based on virtual geometric coordinates

In this paper we consider the problem of efficiently constructing in a fully distributed manner multicast trees which are embedded into P2P overlays using virtual geometric node coordinates. We consider two objectives: to minimize the number of messages required for constructing a multicast tree by using the geometric properties of the P2P overlay, and to construct stable multicast trees when the lifetime durations of the peers are known.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

自引率

0.00%

发文量