Araneola: A scalable reliable multicast system for dynamic environments
This paper presents Araneola (Araneola means “little spider” in Latin.), a scalable reliable application-level multicast system for highly dynamic wide-area environments. Araneola supports multi-point to multi-point reliable communication in a fully distributed manner, while incurring constant load...
Saved in:
| Published in: | Journal of parallel and distributed computing Vol. 68; no. 12; pp. 1539 - 1560 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Amsterdam
Elsevier Inc
01.12.2008
Elsevier |
| Subjects: | |
| ISSN: | 0743-7315, 1096-0848 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | This paper presents Araneola (Araneola means “little spider” in Latin.), a scalable reliable application-level multicast system for highly dynamic wide-area environments. Araneola supports multi-point to multi-point reliable communication in a fully distributed manner, while incurring constant load (in terms of message and space complexity) on each node. For a tunable parameter
k
≥
3
, Araneola constructs and dynamically maintains a basic overlay structure in which each node’s degree is either
k
or
k
+
1
, and roughly 90% of the nodes have degree
k
. Empirical evaluation shows that Araneola’s basic overlay achieves three important mathematical properties of
k
-regular random graphs (i.e., random graphs in which each node has exactly
k
neighbors) with
N
nodes: (i) its diameter grows logarithmically with
N
; (ii) it is generally
k
-connected; and (iii) it remains highly connected following random removal of linear-size subsets of edges or nodes. The overlay is constructed and maintained at a low cost: each join, leave, or failure is handled locally, and entails the sending of only about
3
k
messages in total, independent of
N
. Moreover, this cost decreases as the churn rate increases.
The low degree of Araneola’s basic overlay structure allows for allocating plenty of additional bandwidth for specific application needs. In this paper, we give an example for such a need — communicating with nearby nodes; we enhance the basic overlay with additional links chosen according to geographic proximity and available bandwidth. We show that this approach, i.e., a combination of random and nearby links, reduces the number of physical hops messages traverse without hurting the overlay’s robustness, as compared with completely random Araneola overlays (in which all the links are random) with the same average node degree.
Given Araneola’s overlay, we sketch out several message dissemination techniques that can be implemented on top of this overlay. We present a full implementation and evaluation of a gossip-based multicast scheme, with up to 10,000 nodes. We show that compared with a (non-overlay-based) gossip-based multicast protocol, gossiping over Araneola achieves substantial improvements in load, reliability, and latency. |
|---|---|
| AbstractList | This paper presents Araneola (Araneola means ''little spider'' in Latin.), a scalable reliable application-level multicast system for highly dynamic wide-area environments. Araneola supports multi-point to multi-point reliable communication in a fully distributed manner, while incurring constant load (in terms of message and space complexity) on each node. For a tunable parameter k > =3, Araneola constructs and dynamically maintains a basic overlay structure in which each node's degree is either k or k+1, and roughly 90% of the nodes have degree k. Empirical evaluation shows that Araneola's basic overlay achieves three important mathematical properties of k-regular random graphs (i.e., random graphs in which each node has exactly k neighbors) with N nodes: (i) its diameter grows logarithmically with N; (ii) it is generally k-connected; and (iii) it remains highly connected following random removal of linear-size subsets of edges or nodes. The overlay is constructed and maintained at a low cost: each join, leave, or failure is handled locally, and entails the sending of only about 3k messages in total, independent of N. Moreover, this cost decreases as the churn rate increases. The low degree of Araneola's basic overlay structure allows for allocating plenty of additional bandwidth for specific application needs. In this paper, we give an example for such a need - communicating with nearby nodes; we enhance the basic overlay with additional links chosen according to geographic proximity and available bandwidth. We show that this approach, i.e., a combination of random and nearby links, reduces the number of physical hops messages traverse without hurting the overlay's robustness, as compared with completely random Araneola overlays (in which all the links are random) with the same average node degree. Given Araneola's overlay, we sketch out several message dissemination techniques that can be implemented on top of this overlay. We present a full implementation and evaluation of a gossip-based multicast scheme, with up to 10,000 nodes. We show that compared with a (non-overlay-based) gossip-based multicast protocol, gossiping over Araneola achieves substantial improvements in load, reliability, and latency. applications This paper presents Araneola (Araneola means “little spider” in Latin.), a scalable reliable application-level multicast system for highly dynamic wide-area environments. Araneola supports multi-point to multi-point reliable communication in a fully distributed manner, while incurring constant load (in terms of message and space complexity) on each node. For a tunable parameter k ≥ 3 , Araneola constructs and dynamically maintains a basic overlay structure in which each node’s degree is either k or k + 1 , and roughly 90% of the nodes have degree k . Empirical evaluation shows that Araneola’s basic overlay achieves three important mathematical properties of k -regular random graphs (i.e., random graphs in which each node has exactly k neighbors) with N nodes: (i) its diameter grows logarithmically with N ; (ii) it is generally k -connected; and (iii) it remains highly connected following random removal of linear-size subsets of edges or nodes. The overlay is constructed and maintained at a low cost: each join, leave, or failure is handled locally, and entails the sending of only about 3 k messages in total, independent of N . Moreover, this cost decreases as the churn rate increases. The low degree of Araneola’s basic overlay structure allows for allocating plenty of additional bandwidth for specific application needs. In this paper, we give an example for such a need — communicating with nearby nodes; we enhance the basic overlay with additional links chosen according to geographic proximity and available bandwidth. We show that this approach, i.e., a combination of random and nearby links, reduces the number of physical hops messages traverse without hurting the overlay’s robustness, as compared with completely random Araneola overlays (in which all the links are random) with the same average node degree. Given Araneola’s overlay, we sketch out several message dissemination techniques that can be implemented on top of this overlay. We present a full implementation and evaluation of a gossip-based multicast scheme, with up to 10,000 nodes. We show that compared with a (non-overlay-based) gossip-based multicast protocol, gossiping over Araneola achieves substantial improvements in load, reliability, and latency. |
| Author | Melamed, Roie Keidar, Idit |
| Author_xml | – sequence: 1 givenname: Roie surname: Melamed fullname: Melamed, Roie email: roiem@il.ibm.com organization: IBM Haifa Research Laboratory, Mount Carmel, Haifa 31905, Israel – sequence: 2 givenname: Idit surname: Keidar fullname: Keidar, Idit email: idish@ee.technion.ac.il organization: Department of Electrical Engineering, Technion - Israel Institute of Technology, Technion City, Haifa, 32000, Israel |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20938918$$DView record in Pascal Francis |
| BookMark | eNp9kEFv2yAYhlGVSku7_oGdfNludsFgwNMuUdS1lSr1sp4Rhg-JCOMUSKT8-9lNtcMOOcHheT7pfW7QKk4REPpGcEMw4fe7Zre3pmkxlg0WDSbkCq0J7nmNJZMrtMaC0VpQ0n1BNznv8Ex0Qq7R4ybpCFPQP6tNlY0OeghQJQj-4zMeQvFG51LlUy4wVm5KlT1FPXpTQTz6NMURYslf0bXTIcPd53uL3n4__Nk-1S-vj8_bzUttKCelbgXWhA2tE6zvTNe3mBLHraCWDZ1jXHPrukGyHjQhDpxzgyWu7azhVNOO01v043x3n6b3A-SiRp8NhLCsOGRFGReUSjaD3z9Bvcxy80zjs9onP-p0Ui3uqeyJnLn2zJk05ZzA_UMIVktbtVNLW7W0VVioudwsyf8k44sufoolaR8uq7_OKsyVjh6SysZDNGB9AlOUnfwl_S8845dD |
| CitedBy_id | crossref_primary_10_1137_090769752 crossref_primary_10_1016_j_jpdc_2013_01_018 crossref_primary_10_1145_2543581_2543583 crossref_primary_10_1007_s00446_015_0258_3 crossref_primary_10_1109_TDSC_2021_3080281 crossref_primary_10_1145_2019591_2019596 crossref_primary_10_1109_TSE_2013_50 |
| Cites_doi | 10.1145/571855.571857 10.1109/RELDIS.2003.1238054 10.1007/3-540-45546-9_2 10.1017/S0963548399003867 10.1016/S0195-6698(80)80030-8 10.1109/RELDIS.2002.1180187 10.1145/863997.864000 10.1145/1141277.1141433 10.17487/rfc3170 10.1145/633042.633045 10.1016/S0304-3975(00)00015-3 10.1016/0097-3165(78)90059-6 10.1145/163298.163303 10.1007/978-3-540-45172-3_24 10.1109/TPDS.2003.1189583 10.1145/312203.312207 10.1145/633030.633033 10.1073/pnas.48.7.1142 10.1145/945472.945474 10.1007/b11823 10.1145/380749.380767 10.1109/JSAC.2002.803066 10.1145/41840.41841 10.1145/774763.774772 10.1007/BF01275669 10.1109/JSAC.2002.803069 10.1145/945472.945473 10.1145/844128.844152 10.1016/0196-6774(90)90029-E 10.1145/502034.502050 10.1145/378344.378347 10.1109/DSN.2001.941428 10.1145/945506.945507 10.1145/781040.781041 10.1145/335305.335325 10.1007/3-540-40026-5_17 10.1145/347059.347397 10.1145/380752.380796 10.1145/383059.383064 10.1007/3-540-45518-3_18 10.1145/863997.863999 |
| ContentType | Journal Article |
| Copyright | 2008 Elsevier Inc. 2009 INIST-CNRS |
| Copyright_xml | – notice: 2008 Elsevier Inc. – notice: 2009 INIST-CNRS |
| DBID | AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.jpdc.2008.07.011 |
| DatabaseName | CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science Applied Sciences |
| EISSN | 1096-0848 |
| EndPage | 1560 |
| ExternalDocumentID | 20938918 10_1016_j_jpdc_2008_07_011 S0743731508001329 |
| GroupedDBID | --K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADHUB ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- ~G0 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c361t-270a14b2f7495c592031f6d73d4b5f46a6df5b849ea11fefffbd1f25dc63a3563 |
| ISICitedReferencesCount | 10 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000261532200002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0743-7315 |
| IngestDate | Sun Sep 28 09:21:55 EDT 2025 Mon Jul 21 09:17:49 EDT 2025 Tue Nov 18 22:31:00 EST 2025 Sat Nov 29 07:13:44 EST 2025 Fri Feb 23 02:27:56 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 12 |
| Keywords | Measurement Network proximity Application-level multicast Unstructured overlay networks Scalability Dynamic wide-area environments Design Algorithms k -regular random graphs Gossip Peer-to-peer Fault-tolerance Performance Reliability Load balancing C.2.4 [Computer-Communication Networks] Distributed Systems— Distributed applications Backbone Peer to peer Dynamical system Delay k-regular random graphs Multicast Fault tolerance Space complexity Graph connectivity Bandwidth Robustness Overlay Probabilistic approach Distributed system Random graph Gossiping(all to all) Virtual network Regular graph |
| Language | English |
| License | CC BY 4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c361t-270a14b2f7495c592031f6d73d4b5f46a6df5b849ea11fefffbd1f25dc63a3563 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 34673384 |
| PQPubID | 23500 |
| PageCount | 22 |
| ParticipantIDs | proquest_miscellaneous_34673384 pascalfrancis_primary_20938918 crossref_primary_10_1016_j_jpdc_2008_07_011 crossref_citationtrail_10_1016_j_jpdc_2008_07_011 elsevier_sciencedirect_doi_10_1016_j_jpdc_2008_07_011 |
| PublicationCentury | 2000 |
| PublicationDate | 2008-12-01 |
| PublicationDateYYYYMMDD | 2008-12-01 |
| PublicationDate_xml | – month: 12 year: 2008 text: 2008-12-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | Journal of parallel and distributed computing |
| PublicationYear | 2008 |
| Publisher | Elsevier Inc Elsevier |
| Publisher_xml | – name: Elsevier Inc – name: Elsevier |
| References | S. Floyd, M. Handley, J. Padhye, J. Widmer, Equation-based congestion control for unicast applications, in: SIGCOMM 2000, Stockholm, Sweden, August 2000, pp. 43–56 Steger, Wormald (b62) 1999; 8 S. Banerjee, B. Bhattacharjee, C. Kommareddy, Scalable application layer multicast, in: ACM Sigcomm, 2002 Law, Siu (b46) 2003 locality aware networks for dhts, in: ACM-SIAM Symposium on Discrete Algorithms (SODA04), 2004 (in press) R. Bhagwan, S. Savagen, G. Voelker, Understanding availability, in: 2nd Intl. Workshop on Peer-to-Peer Systems, IPTPS, 2003 Y.h. Chu, S.G. Rao, S. Seshan, H. Zhang, Enabling conferencing applications on the internet using an overlay multicast architecture, in: ACM SIGCOMM, August 2001 Friedman (b26) 1991; 11 Harary (b30) 1962; 48 ICFA-SCIC Monitoring WG. January 2003 Report of the ICFA-SCIC Monitoring Working Group J. Gemmell, J. Leibeherr, D. Bassett, In search of an api for scalable reliable multicast, in: TR MSR-TR-97-17, June 1997 Birman, Hayden, Ozkasap, Xiao, Budiu, Minsky (b9) 1999; 17 Stoica, Morris, Liben-Nowell, Karger, Kaashoek, Dabek, Balakrishnan (b64) 2003; 11 S. Zhuang, B. Zhao, A. Joseph, R. Katz, J. Kubiatowicz, Bayeux: An architecture for scalable and fault tolerant wide-area data dissemination, in: 11th International Workshop Network and Operating System Support for Digital Audio and Video, NOSSDAV, June 2001 Instiute for simulation and training, Standard for distributed interactive simulation — Application protocols. TR IST-CR-94-50, University of Central Florida, Orlando, 1994 P.T. Eugster, R. Guerraoui, S.B. Handurukande, A.M. Kermarrec, P. Kouznetsov, Lightweight probabilistic broadcast, in: The International Conference on Dependable Systems and Networks, DSN, 2001. Full version to appear in ACM Trans. Comput. Syst Jacobson, McCanne (b35) 1994 S. Banerjee, S. Lee, B. Bhattacharjee, A. Srinivasan, Resilient multicast using overlays, in: Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, 2003 K. Shen, Structure management for scalable overlay service construction, in: The First USENIX/ACM Symposium on Networked Systems Design and Implementation, NSDI’04, San Francisco CA, March 2004 A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, Shenker, Stuygis, D. Swinehart, D. Terry, Epidemic algorithms for replicated database maintenance, in: 6th ACM Symposium on Principles of Distributed Computing, PODC, 1987, pp. 1–12 M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, A. Singh, Splitstream: High-bandwidth multicast in a cooperative environment, in: ACM SIGOPS Symposium on Operating Systems Principles, SOSP, October 2003 J. Jannotti, D.K. Gifford, K.L. Johnson, M.F. Kaashoek, H.W. O Jr., Overcast: Reliable multicasting with an overlay network, in: Symp. Operating Systems Design and Implementation, OSDI, 2000 L. Peterson, T. Anderson, D. Culler, T. Roscoe, A blueprint for introducing disruptive technology into the internet, in: Proceedings of ACM HotNets-I, October 2002 Carzaniga, Rosenblum, Wolf (b11) 2001; 19 I. Stoica, D. Adkins, S. Zhuang, S. Shenker, S. Surana, Internet indirection infrastructure, in: SIGCOMM, August 2002, pp. 19–23 Castro, Druschel, Kermarrec, Rowstron (b13) 2002 B. White, J. Lepreau, L. Stoller, R. Ricci, S. Guruprasad, M. Newbold, M. Hibler, C. Barb, A. Joglekar, An integrated experimental environment for distributed systems and networks, in: Symp. Operating Systems Design and Implementation, OSDI, Boston, MA, December 2002, pp. 255–270 Birman (b8) 1993; 36 Eugster, Guerraoui, Handurukande, Kouznetsov, Kermarrec (b23) 2003; 21 Kermarrec, Massouli, Ganesh (b42) 2003; 14 M.J. Lin, K. Marzullo, S. Masini, Gossip versus deterministically constrained flooding on small networks, in: 14th International Symposium on DIStributed Computing, DISC, 2000, pp. 253–267 D. Malkhi, M. Naor, D. Ratajczak, Viceroy: A scalable and dynamic emulation of the butterfly, in: ACM Symposium on Principles of Distributed Computing, PODC, July 2002 Jelasity, Guerraoui, Kermarrec, van Steen (b37) 2004; vol. 3231 Goerdt (b28) 2001; 259 Castro, Jones, Kermarrec, Rowstron, Theimer, Wang, Wolman (b14) April 2003 Paxson (b53) September 1997 F. Kaashoek, D. Karger, Koorde: A simple degree-optimal hash table, in: 2nd Intl. Workshop on Peer-to-Peer Systems, IPTPS, 2003 L. Massoulie, A.-M. Kermarrec, A.J. Ganesh, Network awareness and failure resilience in self-organising overlay networks, in: 22nd IEEE International Symposium on Reliable Distributed Systems, SRDS, October 2003, pp. 47–55 Microsoft Combat Flight Simulator 3. D. Helder, S. Jamin, End-host multicast communication using switchtrees protocols, 2002 D. Kempe, J. Kleinberg, A. Demers, Spatial gossip and resource location protocols, in: 33rd ACM Symp. on Theory of Computing, STOC, 2001 B. Cohen, Incentives build robustness in BitTorrent, in: 1st Workshop on the Economics of Peer-to-Peer Systems, 2003 B. Quinn, K. Almeroth, IP multicast applications: Challenges and solutions. RFC 3170, September 2001. Network Working Group Saroiu, Gummadi, Gribble (b59) January 2002 Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, S. Shenker, Making gnutella-like p2p systems scalable, in: ACM SIGCOMM, August 2003 D.S.E. Multicast routing in a datagram internetwork, Ph.D. Thesis, Stanford University, December 1991 D. Pendarakis, S. Shi, D. Verma, M. Waldvogel, ALMI: An application level multicast infrastructure, in: Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems, USITS, 2001, pp. 49–60 D. Kostic, A. Rodriguez, J. Albrecht, A. Vahdat, Bullet: High bandwidth data dissemination using an overlay mesh, in: ACM SIGOPS Symposium on Operating Systems Principles, SOSP, October 2003 M. Hofmann, T. Braun, G. Carle, Multicast communication in large scale networks, in: Proceedings of Third IEEE Workshop on High Performance Communication Subsystems, HPCS, Mystic, Connecticut, Aug. 1995 Chawathe (b15) 2002 D. Loguinov, A. Kumar, V. Rai, S. Ganesh, Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience, in: Proceedings of the ACM SIGCOMM’03 Conference, 2003 I. Gupta, A.-M. Kermarrec, A.J. Ganesh, Efficient epidemic-style protocols for reliable and scalable multicast, in: 21st IEEE International Symposium on Reliable Distributed Systems, SRDS, October 2002, pp. 180–189 R. Karp, C. Schindelhauer, S. Shenker, B. Vöcking, Randomized rumor spreading, in: IEEE Symposium on Foundations of Computer Science, 2000 S. Ratnasamy, M. Handley, R. Karp, S. Shenker, Application-level multicast using content-addressable networks, in: 3rd International Workshop on Networked Group Communication, NGC, November 2001 Bollobas (b10) 1980; 1 Wormald (b66) 1999; 276 Bender, Canfield (b6) 1978; 24 Y.h. Chu, S.G. Rao, S. Seshan, H. Zhang, A case for end system multicast, in: Networking Support for Multicast, IEEE Journal on Selected Areas in Communication (JSAC), 20(8) (2002) (special issue) McKay, Wormald (b51) 1990; 11 P. Francis, Yoid: Extending the internet multicast architecture. I. Keidar, R. Melamed, Evaluating unstructured peertopeer lookup overlays, in: ACM Symp. on Applied Computing, SAC’06, Dependable and Adaptive Distributed Systems, DADS Track, April 2006, pp. 675–679 Zhao, Huang, Stribling, Rhea, Joseph, Kubiatowicz (b67) 2003 Almeroth, Ammar (b2) August 1996 A.C. Snoeren, K. Conley, D.K. Gifford, Mesh based content routing using XML, in: 18th ACM Symposium on Operating Systems Principles, SOSP ’01, 2001, pp. 160–173 J. Kleinberg, The small-world phenomenon: An algorithmic perspective, in: 32nd ACM Symp. on Theory of Computing, STOC, 2000, pp. 163–170 Badishi, Keidar, Sasson (b3) 2006; 3:1 Kim, Vu (b43) 2003 I. Abraham, D. Malkhi, O. Dobzinski, Land: Stretch Rowstron, Druschel (b58) 2001; 2218 10.1016/j.jpdc.2008.07.011_b60 Birman (10.1016/j.jpdc.2008.07.011_b8) 1993; 36 Rowstron (10.1016/j.jpdc.2008.07.011_b58) 2001; 2218 10.1016/j.jpdc.2008.07.011_b61 10.1016/j.jpdc.2008.07.011_b20 10.1016/j.jpdc.2008.07.011_b63 10.1016/j.jpdc.2008.07.011_b22 10.1016/j.jpdc.2008.07.011_b21 10.1016/j.jpdc.2008.07.011_b65 10.1016/j.jpdc.2008.07.011_b24 Goerdt (10.1016/j.jpdc.2008.07.011_b28) 2001; 259 10.1016/j.jpdc.2008.07.011_b68 10.1016/j.jpdc.2008.07.011_b25 Steger (10.1016/j.jpdc.2008.07.011_b62) 1999; 8 10.1016/j.jpdc.2008.07.011_b27 10.1016/j.jpdc.2008.07.011_b29 10.1016/j.jpdc.2008.07.011_b1 Badishi (10.1016/j.jpdc.2008.07.011_b3) 2006; 3:1 10.1016/j.jpdc.2008.07.011_b4 10.1016/j.jpdc.2008.07.011_b5 Friedman (10.1016/j.jpdc.2008.07.011_b26) 1991; 11 Jacobson (10.1016/j.jpdc.2008.07.011_b35) 1994 10.1016/j.jpdc.2008.07.011_b7 Jelasity (10.1016/j.jpdc.2008.07.011_b37) 2004; vol. 3231 10.1016/j.jpdc.2008.07.011_b50 Kim (10.1016/j.jpdc.2008.07.011_b43) 2003 10.1016/j.jpdc.2008.07.011_b52 Birman (10.1016/j.jpdc.2008.07.011_b9) 1999; 17 10.1016/j.jpdc.2008.07.011_b55 Bender (10.1016/j.jpdc.2008.07.011_b6) 1978; 24 10.1016/j.jpdc.2008.07.011_b54 10.1016/j.jpdc.2008.07.011_b57 10.1016/j.jpdc.2008.07.011_b12 10.1016/j.jpdc.2008.07.011_b56 10.1016/j.jpdc.2008.07.011_b17 10.1016/j.jpdc.2008.07.011_b16 Eugster (10.1016/j.jpdc.2008.07.011_b23) 2003; 21 10.1016/j.jpdc.2008.07.011_b19 10.1016/j.jpdc.2008.07.011_b18 Kermarrec (10.1016/j.jpdc.2008.07.011_b42) 2003; 14 Zhao (10.1016/j.jpdc.2008.07.011_b67) 2003 10.1016/j.jpdc.2008.07.011_b40 Almeroth (10.1016/j.jpdc.2008.07.011_b2) 1996 10.1016/j.jpdc.2008.07.011_b41 10.1016/j.jpdc.2008.07.011_b44 Castro (10.1016/j.jpdc.2008.07.011_b13) 2002 Stoica (10.1016/j.jpdc.2008.07.011_b64) 2003; 11 10.1016/j.jpdc.2008.07.011_b45 10.1016/j.jpdc.2008.07.011_b48 10.1016/j.jpdc.2008.07.011_b47 Paxson (10.1016/j.jpdc.2008.07.011_b53) 1997 10.1016/j.jpdc.2008.07.011_b49 Wormald (10.1016/j.jpdc.2008.07.011_b66) 1999; 276 Bollobas (10.1016/j.jpdc.2008.07.011_b10) 1980; 1 Castro (10.1016/j.jpdc.2008.07.011_b14) 2003 Harary (10.1016/j.jpdc.2008.07.011_b30) 1962; 48 Saroiu (10.1016/j.jpdc.2008.07.011_b59) 2002 10.1016/j.jpdc.2008.07.011_b31 McKay (10.1016/j.jpdc.2008.07.011_b51) 1990; 11 10.1016/j.jpdc.2008.07.011_b33 10.1016/j.jpdc.2008.07.011_b32 10.1016/j.jpdc.2008.07.011_b34 Carzaniga (10.1016/j.jpdc.2008.07.011_b11) 2001; 19 10.1016/j.jpdc.2008.07.011_b36 10.1016/j.jpdc.2008.07.011_b39 10.1016/j.jpdc.2008.07.011_b38 Chawathe (10.1016/j.jpdc.2008.07.011_b15) 2002 Law (10.1016/j.jpdc.2008.07.011_b46) 2003 |
| References_xml | – volume: 2218 start-page: 329 year: 2001 end-page: 350 ident: b58 article-title: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems publication-title: Lecture Notes in Computer Science – volume: 48 start-page: 1142 year: 1962 end-page: 1146 ident: b30 article-title: The maximum connectivity of a graph publication-title: The National Academy of Science – reference: B. White, J. Lepreau, L. Stoller, R. Ricci, S. Guruprasad, M. Newbold, M. Hibler, C. Barb, A. Joglekar, An integrated experimental environment for distributed systems and networks, in: Symp. Operating Systems Design and Implementation, OSDI, Boston, MA, December 2002, pp. 255–270 – volume: 3:1 year: 2006 ident: b3 article-title: Exposing and eliminating vulnerabilities to denial of service attacks in secure gossip-based multicast publication-title: IEEE Transactions on Dependable and Secure Computing (TDSC) – reference: Y.h. Chu, S.G. Rao, S. Seshan, H. Zhang, Enabling conferencing applications on the internet using an overlay multicast architecture, in: ACM SIGCOMM, August 2001 – reference: ICFA-SCIC Monitoring WG. January 2003 Report of the ICFA-SCIC Monitoring Working Group, – reference: D. Malkhi, M. Naor, D. Ratajczak, Viceroy: A scalable and dynamic emulation of the butterfly, in: ACM Symposium on Principles of Distributed Computing, PODC, July 2002 – reference: K. Shen, Structure management for scalable overlay service construction, in: The First USENIX/ACM Symposium on Networked Systems Design and Implementation, NSDI’04, San Francisco CA, March 2004 – year: August 1996 ident: b2 article-title: Collecting and modeling the join/leave behavior of multicast group members in the mbone publication-title: High Performance Distributed Computing (HPDC) – reference: D.S.E. Multicast routing in a datagram internetwork, Ph.D. Thesis, Stanford University, December 1991 – volume: 11 year: 2003 ident: b64 article-title: Chord: A scalable peer-to-peer lookup service for internet applications publication-title: IEEE Transactions on Networking – reference: S. Zhuang, B. Zhao, A. Joseph, R. Katz, J. Kubiatowicz, Bayeux: An architecture for scalable and fault tolerant wide-area data dissemination, in: 11th International Workshop Network and Operating System Support for Digital Audio and Video, NOSSDAV, June 2001 – year: September 1997 ident: b53 article-title: End-to-end Internet packet dynamics publication-title: ACM SIGCOMM – reference: A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, Shenker, Stuygis, D. Swinehart, D. Terry, Epidemic algorithms for replicated database maintenance, in: 6th ACM Symposium on Principles of Distributed Computing, PODC, 1987, pp. 1–12 – volume: vol. 3231 start-page: 79 year: 2004 end-page: 98 ident: b37 article-title: The peer sampling service: Experimental evaluation of unstructured gossip-based implementations publication-title: ACM/IFIP/USENIX 5th International Middleware Conference (Middleware 2004) – year: 2003 ident: b46 article-title: Distributed construction of random expander networks publication-title: IEEE Infocom – volume: 1 start-page: 311 year: 1980 end-page: 316 ident: b10 article-title: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs publication-title: European Journal of Combinatories – reference: Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, S. Shenker, Making gnutella-like p2p systems scalable, in: ACM SIGCOMM, August 2003 – reference: B. Cohen, Incentives build robustness in BitTorrent, in: 1st Workshop on the Economics of Peer-to-Peer Systems, 2003 – reference: B. Quinn, K. Almeroth, IP multicast applications: Challenges and solutions. RFC 3170, September 2001. Network Working Group – reference: I. Keidar, R. Melamed, Evaluating unstructured peertopeer lookup overlays, in: ACM Symp. on Applied Computing, SAC’06, Dependable and Adaptive Distributed Systems, DADS Track, April 2006, pp. 675–679 – reference: ) locality aware networks for dhts, in: ACM-SIAM Symposium on Discrete Algorithms (SODA04), 2004 (in press) – reference: S. Banerjee, B. Bhattacharjee, C. Kommareddy, Scalable application layer multicast, in: ACM Sigcomm, 2002 – volume: 11 start-page: 52 year: 1990 end-page: 67 ident: b51 article-title: Uniform generation of random regular graphs of moderate degree publication-title: Journal of Algorithms – reference: I. Stoica, D. Adkins, S. Zhuang, S. Shenker, S. Surana, Internet indirection infrastructure, in: SIGCOMM, August 2002, pp. 19–23 – reference: A.C. Snoeren, K. Conley, D.K. Gifford, Mesh based content routing using XML, in: 18th ACM Symposium on Operating Systems Principles, SOSP ’01, 2001, pp. 160–173 – reference: L. Peterson, T. Anderson, D. Culler, T. Roscoe, A blueprint for introducing disruptive technology into the internet, in: Proceedings of ACM HotNets-I, October 2002 – reference: S. Banerjee, S. Lee, B. Bhattacharjee, A. Srinivasan, Resilient multicast using overlays, in: Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, 2003 – reference: M.J. Lin, K. Marzullo, S. Masini, Gossip versus deterministically constrained flooding on small networks, in: 14th International Symposium on DIStributed Computing, DISC, 2000, pp. 253–267 – reference: Y.h. Chu, S.G. Rao, S. Seshan, H. Zhang, A case for end system multicast, in: Networking Support for Multicast, IEEE Journal on Selected Areas in Communication (JSAC), 20(8) (2002) (special issue) – reference: D. Pendarakis, S. Shi, D. Verma, M. Waldvogel, ALMI: An application level multicast infrastructure, in: Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems, USITS, 2001, pp. 49–60 – year: January 2002 ident: b59 article-title: A measurement study of peer-to-peer file sharing systems publication-title: Multimedia Computing and Networking – volume: 11 start-page: 331 year: 1991 end-page: 362 ident: b26 article-title: On the second eigenvalue and random walks in random d-regular graphs publication-title: Combinatorica – reference: J. Jannotti, D.K. Gifford, K.L. Johnson, M.F. Kaashoek, H.W. O Jr., Overcast: Reliable multicasting with an overlay network, in: Symp. Operating Systems Design and Implementation, OSDI, 2000 – reference: D. Kostic, A. Rodriguez, J. Albrecht, A. Vahdat, Bullet: High bandwidth data dissemination using an overlay mesh, in: ACM SIGOPS Symposium on Operating Systems Principles, SOSP, October 2003 – reference: D. Loguinov, A. Kumar, V. Rai, S. Ganesh, Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience, in: Proceedings of the ACM SIGCOMM’03 Conference, 2003 – reference: L. Massoulie, A.-M. Kermarrec, A.J. Ganesh, Network awareness and failure resilience in self-organising overlay networks, in: 22nd IEEE International Symposium on Reliable Distributed Systems, SRDS, October 2003, pp. 47–55 – reference: I. Abraham, D. Malkhi, O. Dobzinski, Land: Stretch ( – reference: D. Kempe, J. Kleinberg, A. Demers, Spatial gossip and resource location protocols, in: 33rd ACM Symp. on Theory of Computing, STOC, 2001 – start-page: 213 year: 2003 end-page: 222 ident: b43 article-title: Generating random regular graphs publication-title: Proceedings of the thirty-fifth ACM Symposium on Theory of Computing – year: 1994 ident: b35 article-title: Using the LBL Network Whiteboard – reference: M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, A. Singh, Splitstream: High-bandwidth multicast in a cooperative environment, in: ACM SIGOPS Symposium on Operating Systems Principles, SOSP, October 2003 – volume: 14 start-page: 248 year: 2003 end-page: 258 ident: b42 article-title: Probabilistic reliable dissemination in large-scale systems publication-title: IEEE Transactions on Parallel and Distributed Systems – year: 2002 ident: b15 article-title: Scattercast: An adaptable broadcast distribution framework publication-title: ACM Multimedia Systems Journal on Multimedia Distribution – reference: Instiute for simulation and training, Standard for distributed interactive simulation — Application protocols. TR IST-CR-94-50, University of Central Florida, Orlando, 1994 – reference: R. Karp, C. Schindelhauer, S. Shenker, B. Vöcking, Randomized rumor spreading, in: IEEE Symposium on Foundations of Computer Science, 2000 – year: 2002 ident: b13 article-title: SCRIBE: A large-scale and decentralized application-level multicast infrastructure publication-title: IEEE Journal on Selected Areas in Communications (JSAC) – reference: P. Francis, Yoid: Extending the internet multicast architecture. – volume: 24 start-page: 296 year: 1978 end-page: 307 ident: b6 article-title: The asymptotic number of labeled graphs with given degree sequences publication-title: Journal of Combinatorial Theory, Series A – volume: 259 start-page: 307 year: 2001 end-page: 321 ident: b28 article-title: The giant component threshold for random regular graphs with edge faults publication-title: Theoretical Computer Science – reference: F. Kaashoek, D. Karger, Koorde: A simple degree-optimal hash table, in: 2nd Intl. Workshop on Peer-to-Peer Systems, IPTPS, 2003 – reference: I. Gupta, A.-M. Kermarrec, A.J. Ganesh, Efficient epidemic-style protocols for reliable and scalable multicast, in: 21st IEEE International Symposium on Reliable Distributed Systems, SRDS, October 2002, pp. 180–189 – reference: Microsoft Combat Flight Simulator 3. – volume: 8 start-page: 377 year: 1999 end-page: 396 ident: b62 article-title: Generating random regular graphs quickly publication-title: Combinatorics, Probablity and Computing – volume: 36 start-page: 36 year: 1993 end-page: 53 ident: b8 article-title: The process group approach to reliable distributed computing publication-title: Communications of the ACM – volume: 17 start-page: 41 year: 1999 end-page: 88 ident: b9 article-title: Bimodal multicast publication-title: ACM Transactions on Computer Systems – reference: J. Gemmell, J. Leibeherr, D. Bassett, In search of an api for scalable reliable multicast, in: TR MSR-TR-97-17, June 1997 – reference: S. Ratnasamy, M. Handley, R. Karp, S. Shenker, Application-level multicast using content-addressable networks, in: 3rd International Workshop on Networked Group Communication, NGC, November 2001 – reference: M. Hofmann, T. Braun, G. Carle, Multicast communication in large scale networks, in: Proceedings of Third IEEE Workshop on High Performance Communication Subsystems, HPCS, Mystic, Connecticut, Aug. 1995 – volume: 19 start-page: 332 year: 2001 end-page: 383 ident: b11 article-title: Design and evaluation of a wide-area event notification service publication-title: ACM Transactions on Computer Systems – volume: 21 start-page: 341 year: 2003 end-page: 374 ident: b23 article-title: Lightweight probabilistic broadcast publication-title: ACM Transactions on Computer Systems – reference: S. Floyd, M. Handley, J. Padhye, J. Widmer, Equation-based congestion control for unicast applications, in: SIGCOMM 2000, Stockholm, Sweden, August 2000, pp. 43–56 – year: 2003 ident: b67 article-title: Tapestry: A global-scale overlay for rapid service deployment publication-title: Service Overlay Networks – reference: J. Kleinberg, The small-world phenomenon: An algorithmic perspective, in: 32nd ACM Symp. on Theory of Computing, STOC, 2000, pp. 163–170 – volume: 276 start-page: 239 year: 1999 end-page: 298 ident: b66 article-title: Models of random regular graphs publication-title: Surveys in Combinatorics – reference: P.T. Eugster, R. Guerraoui, S.B. Handurukande, A.M. Kermarrec, P. Kouznetsov, Lightweight probabilistic broadcast, in: The International Conference on Dependable Systems and Networks, DSN, 2001. Full version to appear in ACM Trans. Comput. Syst – reference: D. Helder, S. Jamin, End-host multicast communication using switchtrees protocols, 2002 – reference: R. Bhagwan, S. Savagen, G. Voelker, Understanding availability, in: 2nd Intl. Workshop on Peer-to-Peer Systems, IPTPS, 2003 – year: April 2003 ident: b14 article-title: An evalution of scalable application-level multicast built using peer-to-peer overlays publication-title: IEEE INFOCOM – ident: 10.1016/j.jpdc.2008.07.011_b49 doi: 10.1145/571855.571857 – year: 2003 ident: 10.1016/j.jpdc.2008.07.011_b14 article-title: An evalution of scalable application-level multicast built using peer-to-peer overlays – ident: 10.1016/j.jpdc.2008.07.011_b34 – ident: 10.1016/j.jpdc.2008.07.011_b50 doi: 10.1109/RELDIS.2003.1238054 – ident: 10.1016/j.jpdc.2008.07.011_b57 doi: 10.1007/3-540-45546-9_2 – volume: 8 start-page: 377 year: 1999 ident: 10.1016/j.jpdc.2008.07.011_b62 article-title: Generating random regular graphs quickly publication-title: Combinatorics, Probablity and Computing doi: 10.1017/S0963548399003867 – volume: 1 start-page: 311 issue: 4 year: 1980 ident: 10.1016/j.jpdc.2008.07.011_b10 article-title: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs publication-title: European Journal of Combinatories doi: 10.1016/S0195-6698(80)80030-8 – ident: 10.1016/j.jpdc.2008.07.011_b21 – ident: 10.1016/j.jpdc.2008.07.011_b29 doi: 10.1109/RELDIS.2002.1180187 – ident: 10.1016/j.jpdc.2008.07.011_b16 doi: 10.1145/863997.864000 – ident: 10.1016/j.jpdc.2008.07.011_b40 doi: 10.1145/1141277.1141433 – ident: 10.1016/j.jpdc.2008.07.011_b1 – ident: 10.1016/j.jpdc.2008.07.011_b56 doi: 10.17487/rfc3170 – ident: 10.1016/j.jpdc.2008.07.011_b4 doi: 10.1145/633042.633045 – year: 2003 ident: 10.1016/j.jpdc.2008.07.011_b67 article-title: Tapestry: A global-scale overlay for rapid service deployment publication-title: IEEE Journal on Selected Areas in Communications – year: 2002 ident: 10.1016/j.jpdc.2008.07.011_b59 article-title: A measurement study of peer-to-peer file sharing systems – ident: 10.1016/j.jpdc.2008.07.011_b54 – volume: 259 start-page: 307 issue: 1–2 year: 2001 ident: 10.1016/j.jpdc.2008.07.011_b28 article-title: The giant component threshold for random regular graphs with edge faults publication-title: Theoretical Computer Science doi: 10.1016/S0304-3975(00)00015-3 – volume: 24 start-page: 296 issue: 3 year: 1978 ident: 10.1016/j.jpdc.2008.07.011_b6 article-title: The asymptotic number of labeled graphs with given degree sequences publication-title: Journal of Combinatorial Theory, Series A doi: 10.1016/0097-3165(78)90059-6 – volume: 36 start-page: 36 issue: 12 year: 1993 ident: 10.1016/j.jpdc.2008.07.011_b8 article-title: The process group approach to reliable distributed computing publication-title: Communications of the ACM doi: 10.1145/163298.163303 – ident: 10.1016/j.jpdc.2008.07.011_b7 doi: 10.1007/978-3-540-45172-3_24 – ident: 10.1016/j.jpdc.2008.07.011_b31 – ident: 10.1016/j.jpdc.2008.07.011_b27 – volume: 14 start-page: 248 issue: 3 year: 2003 ident: 10.1016/j.jpdc.2008.07.011_b42 article-title: Probabilistic reliable dissemination in large-scale systems publication-title: IEEE Transactions on Parallel and Distributed Systems doi: 10.1109/TPDS.2003.1189583 – volume: 17 start-page: 41 issue: 2 year: 1999 ident: 10.1016/j.jpdc.2008.07.011_b9 article-title: Bimodal multicast publication-title: ACM Transactions on Computer Systems doi: 10.1145/312203.312207 – ident: 10.1016/j.jpdc.2008.07.011_b63 doi: 10.1145/633030.633033 – volume: 48 start-page: 1142 year: 1962 ident: 10.1016/j.jpdc.2008.07.011_b30 article-title: The maximum connectivity of a graph publication-title: The National Academy of Science doi: 10.1073/pnas.48.7.1142 – year: 1997 ident: 10.1016/j.jpdc.2008.07.011_b53 article-title: End-to-end Internet packet dynamics – ident: 10.1016/j.jpdc.2008.07.011_b12 doi: 10.1145/945472.945474 – ident: 10.1016/j.jpdc.2008.07.011_b38 doi: 10.1007/b11823 – volume: 19 start-page: 332 issue: 3 year: 2001 ident: 10.1016/j.jpdc.2008.07.011_b11 article-title: Design and evaluation of a wide-area event notification service publication-title: ACM Transactions on Computer Systems doi: 10.1145/380749.380767 – ident: 10.1016/j.jpdc.2008.07.011_b18 doi: 10.1109/JSAC.2002.803066 – ident: 10.1016/j.jpdc.2008.07.011_b20 doi: 10.1145/41840.41841 – ident: 10.1016/j.jpdc.2008.07.011_b55 doi: 10.1145/774763.774772 – volume: 11 start-page: 331 year: 1991 ident: 10.1016/j.jpdc.2008.07.011_b26 article-title: On the second eigenvalue and random walks in random d-regular graphs publication-title: Combinatorica doi: 10.1007/BF01275669 – year: 2002 ident: 10.1016/j.jpdc.2008.07.011_b13 article-title: SCRIBE: A large-scale and decentralized application-level multicast infrastructure publication-title: IEEE Journal on Selected Areas in Communications (JSAC) doi: 10.1109/JSAC.2002.803069 – year: 2002 ident: 10.1016/j.jpdc.2008.07.011_b15 article-title: Scattercast: An adaptable broadcast distribution framework publication-title: ACM Multimedia Systems Journal on Multimedia Distribution – ident: 10.1016/j.jpdc.2008.07.011_b32 – ident: 10.1016/j.jpdc.2008.07.011_b45 doi: 10.1145/945472.945473 – year: 2003 ident: 10.1016/j.jpdc.2008.07.011_b46 article-title: Distributed construction of random expander networks – ident: 10.1016/j.jpdc.2008.07.011_b65 doi: 10.1145/844128.844152 – year: 1996 ident: 10.1016/j.jpdc.2008.07.011_b2 article-title: Collecting and modeling the join/leave behavior of multicast group members in the mbone – volume: 11 start-page: 52 year: 1990 ident: 10.1016/j.jpdc.2008.07.011_b51 article-title: Uniform generation of random regular graphs of moderate degree publication-title: Journal of Algorithms doi: 10.1016/0196-6774(90)90029-E – ident: 10.1016/j.jpdc.2008.07.011_b61 doi: 10.1145/502034.502050 – ident: 10.1016/j.jpdc.2008.07.011_b68 doi: 10.1145/378344.378347 – start-page: 213 year: 2003 ident: 10.1016/j.jpdc.2008.07.011_b43 article-title: Generating random regular graphs – volume: 11 issue: February year: 2003 ident: 10.1016/j.jpdc.2008.07.011_b64 article-title: Chord: A scalable peer-to-peer lookup service for internet applications publication-title: IEEE Transactions on Networking – ident: 10.1016/j.jpdc.2008.07.011_b39 – ident: 10.1016/j.jpdc.2008.07.011_b52 – ident: 10.1016/j.jpdc.2008.07.011_b22 doi: 10.1109/DSN.2001.941428 – volume: 21 start-page: 341 issue: 4 year: 2003 ident: 10.1016/j.jpdc.2008.07.011_b23 article-title: Lightweight probabilistic broadcast publication-title: ACM Transactions on Computer Systems doi: 10.1145/945506.945507 – volume: vol. 3231 start-page: 79 year: 2004 ident: 10.1016/j.jpdc.2008.07.011_b37 article-title: The peer sampling service: Experimental evaluation of unstructured gossip-based implementations – ident: 10.1016/j.jpdc.2008.07.011_b60 – ident: 10.1016/j.jpdc.2008.07.011_b33 – ident: 10.1016/j.jpdc.2008.07.011_b5 doi: 10.1145/781040.781041 – ident: 10.1016/j.jpdc.2008.07.011_b25 – ident: 10.1016/j.jpdc.2008.07.011_b44 doi: 10.1145/335305.335325 – volume: 3:1 year: 2006 ident: 10.1016/j.jpdc.2008.07.011_b3 article-title: Exposing and eliminating vulnerabilities to denial of service attacks in secure gossip-based multicast publication-title: IEEE Transactions on Dependable and Secure Computing (TDSC) – ident: 10.1016/j.jpdc.2008.07.011_b19 – ident: 10.1016/j.jpdc.2008.07.011_b47 doi: 10.1007/3-540-40026-5_17 – ident: 10.1016/j.jpdc.2008.07.011_b24 doi: 10.1145/347059.347397 – year: 1994 ident: 10.1016/j.jpdc.2008.07.011_b35 – ident: 10.1016/j.jpdc.2008.07.011_b41 doi: 10.1145/380752.380796 – ident: 10.1016/j.jpdc.2008.07.011_b17 doi: 10.1145/383059.383064 – volume: 2218 start-page: 329 year: 2001 ident: 10.1016/j.jpdc.2008.07.011_b58 article-title: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems publication-title: Lecture Notes in Computer Science doi: 10.1007/3-540-45518-3_18 – volume: 276 start-page: 239 year: 1999 ident: 10.1016/j.jpdc.2008.07.011_b66 article-title: Models of random regular graphs publication-title: Surveys in Combinatorics – ident: 10.1016/j.jpdc.2008.07.011_b36 – ident: 10.1016/j.jpdc.2008.07.011_b48 doi: 10.1145/863997.863999 |
| SSID | ssj0011578 |
| Score | 1.9096235 |
| Snippet | This paper presents Araneola (Araneola means “little spider” in Latin.), a scalable reliable application-level multicast system for highly dynamic wide-area... This paper presents Araneola (Araneola means ''little spider'' in Latin.), a scalable reliable application-level multicast system for highly dynamic wide-area... |
| SourceID | proquest pascalfrancis crossref elsevier |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 1539 |
| SubjectTerms | [formula omitted]-regular random graphs Algorithms Application-level multicast Applied sciences C.2.4 [Computer-Communication Networks] Distributed Systems— Distributed applications Computer science; control theory; systems Computer systems and distributed systems. User interface Computer systems performance. Reliability Design Dynamic wide-area environments Exact sciences and technology Fault-tolerance Gossip Load balancing Measurement Network proximity Peer-to-peer Reliability Scalability Software Unstructured overlay networks |
| Title | Araneola: A scalable reliable multicast system for dynamic environments |
| URI | https://dx.doi.org/10.1016/j.jpdc.2008.07.011 https://www.proquest.com/docview/34673384 |
| Volume | 68 |
| WOSCitedRecordID | wos000261532200002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nb9QwELWg5YCE-K5YPooP3KpUTezYMbeIBnWhVBwK2lvk2LG0q1VYbbKoP59xbIfsQgscuESRtUkUv7cz43jeDEJvqIwTZQiNsqpiEbUaXUm5irhSigqTEdlXYvp6zi8ustlMfPZpY23fToA3TXZ1JVb_FWoYA7CtdPYf4B5uCgNwDqDDEWCH418Bn4P3qWHBeuRE5y2A0Muj1vVy3p_0OYRKtp0v49xnGmrXmX5L-HZN4GqrhS-XtasxoG3hXdszq-7lcatNF3yhRbE4zz8Vpy6Dez5Q6GMxPc37BIypnndb3x2ynRyOIIgZ2Stb7ZQTp84MxpVlYxIlI1MJplaM3K5VdP_WpLuvC4vjxUorn_vKj0-8hd6qn73j14Zsw-RE2N3Y7DbaT3gqwHzv59Ni9mHYbYpT57HDC3hxlcsD3H3udQHMvZW0iBrXD-UX197HK5cP0X2PF84dQR6hW3XzGD3wiw7sTXoLQ6GvRxh7gs4ChfBbnONAIBwIhAcCYUcgDATCnkB4TKCn6Mv74vLdWeQ7bkSKsLiz4kQZ0yoxHNbNKhUJmHzDNCeaVqmhTDJt0iqjopZxbGpjTKVjk6RaMSJJysgB2mu-NfUzhCGUlYxXqTBUUlbZDi9c6rQWYAIIRE0TFIdpLJUvR2-7oizLkHe4KO3U-z6pvISpn6Cj4ZqVK8Zy46_TgE7pw0kXJpZArRuvO9yCcnhU4NEEvQ7YlmCM7Q6bRWXTlgTCDkIy-vxPt3iB7v78T71Ee916U79Cd9T3bt6uDz0_fwA2J6k_ |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Araneola+%3A+A+scalable+reliable+multicast+system+for+dynamic+environments&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=MELAMED%2C+Roie&rft.au=KEIDAR%2C+Idit&rft.date=2008-12-01&rft.pub=Elsevier&rft.issn=0743-7315&rft.volume=68&rft.issue=12&rft.spage=1539&rft.epage=1560&rft_id=info:doi/10.1016%2Fj.jpdc.2008.07.011&rft.externalDBID=n%2Fa&rft.externalDocID=20938918 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon |