메뉴 건너뛰기




Volumn 23, Issue 4, 2012, Pages 668-675

Extrema propagation: Fast distributed estimation of sums and network sizes

Author keywords

Aggregation; distributed sums; network size estimation; probabilistic estimation; self configuration

Indexed keywords

AVERAGE SYSTEM; CENTRALIZED ALGORITHMS; DATA VALUES; DISTRIBUTED COMPUTATIONS; DISTRIBUTED ESTIMATION; DISTRIBUTED HASH TABLE; DISTRIBUTED SUMS; GLOBAL IDENTIFIERS; GLOBAL SYSTEMS; MESSAGE EXCHANGE; MESSAGE LOSS; MULTI PATH ROUTING; NETWORK SIZE; NETWORK SIZE ESTIMATION; PEER TO PEER; POSITIVE REAL; PROBABILISTIC ESTIMATION; PROBABILISTIC TECHNIQUE; SELF CONFIGURATION; SELF-ADAPTIVE; SINGLE POINT; THEORETICAL MINIMUM;

EID: 84858071468     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2011.209     Document Type: Article
Times cited : (47)

References (38)
  • 2
    • 33645666358 scopus 로고    scopus 로고
    • Gossip-based aggregation in large dynamic networks
    • M. Jelasity, A. Montresor, and Ö. Babaoglu, "Gossip-Based Aggregation in Large Dynamic Networks," ACM Trans. Computer System, vol. 23, no. 3, pp. 219-252, 2005.
    • (2005) ACM Trans. Computer System , vol.23 , Issue.3 , pp. 219-252
    • Jelasity, M.1    Montresor, A.2    Babaoglu, O.3
  • 5
    • 35248858413 scopus 로고    scopus 로고
    • Probabilistic Quorums for Dynamic Systems
    • Distributed Computing
    • I. Abraham and D. Malkhi, "Probabilistic Quorums for Dynamic Systems," Proc. 17th Int'l Symp. Distributed Computing, pp. 60-74, 2003. (Pubitemid 37273741)
    • (2003) Lecture Notes in Computer Science , Issue.2848 , pp. 60-74
    • Abraham, I.1    Malkhi, D.2
  • 7
    • 33645774407 scopus 로고    scopus 로고
    • Implementing aggregation and broadcast over distributed hash tables
    • J. Li, K.R. Sollins, and D.-Y. Lim, "Implementing Aggregation and Broadcast over Distributed Hash Tables," Computer Comm. Rev., vol. 35, no. 1, pp. 81-92, 2004.
    • (2004) Computer Comm. Rev. , vol.35 , Issue.1 , pp. 81-92
    • Li, J.1    Sollins, K.R.2    Lim, D.-Y.3
  • 17
    • 0242271286 scopus 로고    scopus 로고
    • Estimating network size from local information
    • K. Horowitz and D. Malkhi, "Estimating Network Size from Local Information," Information Processing Letters, vol. 88, no. 5, pp. 237-243, 2003.
    • (2003) Information Processing Letters , vol.88 , Issue.5 , pp. 237-243
    • Horowitz, K.1    Malkhi, D.2
  • 21
    • 35548975185 scopus 로고    scopus 로고
    • Peer counting and sampling in overlay networks based on random walks
    • DOI 10.1007/s00446-007-0027-z
    • A. Ganesh, A. Kermarrec, E.L. Merrer, and L. Massoulié, "Peer Counting and Sampling in Overlay Networks Based on Random Walks," Distributed Computing, vol. 20, no. 4, pp. 267-278, 2007. (Pubitemid 350005917)
    • (2007) Distributed Computing , vol.20 , Issue.4 , pp. 267-278
    • Ganesh, A.J.1    Kermarrec, A.-M.2    Le Merrer, E.3    Massoulie, L.4
  • 25
    • 34547770894 scopus 로고    scopus 로고
    • Active and passive techniques for group size estimation in large-scale and dynamic distributed systems
    • DOI 10.1016/j.jss.2007.01.014, PII S016412120700012X, Methodology of Security Engineering for Industrial Security Management Systems
    • D. Kostoulas, D. Psaltoulis, I. Gupta, K.P. Birman, and A.J. Demers, "Active and Passive Techniques for Group Size Estimation in Large-Scale and Dynamic Distributed Systems," J. Systems and Software, vol. 80, no. 10, pp. 1639-1658, Jan. 2007. (Pubitemid 47238423)
    • (2007) Journal of Systems and Software , vol.80 , Issue.10 , pp. 1639-1658
    • Kostoulas, D.1    Psaltoulis, D.2    Gupta, I.3    Birman, K.P.4    Demers, A.J.5
  • 28
    • 29844448642 scopus 로고    scopus 로고
    • Tributaries and deltas: Efficient and robust aggregation in sensor network streams
    • DOI 10.1145/1066157.1066191, SIGMOD 2005: Proceedings of the ACM SIGMOD International Conference on Management of Data
    • A. Manjhi, S. Nath, and P. Gibbons, "Tributaries and Deltas: Efficient and Robust Aggregation in Sensor Network Streams," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 287-298, 2005. (Pubitemid 43038935)
    • (2005) Proceedings of the ACM SIGMOD International Conference on Management of Data , pp. 287-298
    • Manjhi, A.1    Nath, S.2    Gibbons, P.B.3
  • 29
    • 0020828424 scopus 로고
    • Probabilistic counting algorithms for data base applications
    • P. Flajolet and G.N. Martin, "Probabilistic Counting Algorithms for Data Base Applications," J. Computer and System Sciences, vol. 31, no. 2, pp. 182-209, 1985.
    • (1985) J. Computer and System Sciences , vol.31 , Issue.2 , pp. 182-209
    • Flajolet, P.1    Martin, G.N.2
  • 33
    • 0031353179 scopus 로고    scopus 로고
    • Size-Estimation Framework with Applications to Transitive Closure and Reachability
    • E. Cohen, "Size-Estimation Framework with Applications to Transitive Closure and Reachability," J. Computer and System Sciences, vol. 55, no. 3, pp. 441-453, 1997. (Pubitemid 127432363)
    • (1997) Journal of Computer and System Sciences , vol.55 , Issue.3 , pp. 441-453
    • Cohen, E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.