-
3
-
-
0001818392
-
Bimodal multicast
-
K.P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal Multicast. ACM Tr. Computer Systems, 17(2):41-88, 1999.
-
(1999)
ACM Tr. Computer Systems
, vol.17
, Issue.2
, pp. 41-88
-
-
Birman, K.P.1
Hayden, M.2
Ozkasap, O.3
Xiao, Z.4
Budiu, M.5
Minsky, Y.6
-
5
-
-
85030178366
-
Epidemic algorithms for replicated database maintenance
-
A. Demers, D. Greene, C. Hauser, W. Irish, and J. Larson. Epidemic algorithms for replicated database maintenance. In Proc. 6th Annual ACM Symp. Principles of Distributed Computing (PODC '87), pages 1-12, 1987.
-
(1987)
Proc. 6th Annual ACM Symp. Principles of Distributed Computing (PODC '87)
, pp. 1-12
-
-
Demers, A.1
Greene, D.2
Hauser, C.3
Irish, W.4
Larson, J.5
-
6
-
-
0035789210
-
Lightweight probabilistic broadcast
-
P. Eugster, R. Guerraoui, S. Handurukande, A.-M. Kermarrec, and P. Kouznetsov. Lightweight Probabilistic Broadcast. In Proc. 2001 Intnl. Conf. Dependable Systems and Networks (DSN '01), pages 443-452, 2001.
-
(2001)
Proc. 2001 Intnl. Conf. Dependable Systems and Networks (DSN '01)
, pp. 443-452
-
-
Eugster, P.1
Guerraoui, R.2
Handurukande, S.3
Kermarrec, A.-M.4
Kouznetsov, P.5
-
8
-
-
0031383381
-
A reliable multicast framework for light-weight sessions and application level framing
-
Dec.
-
S. Floyd, V. Jacobson, C. Liu, S. MCCanne, and L. Zhang. A reliable multicast framework for light-weight sessions and application level framing. IEEE/ACM Tr. Networking, 5(6):784-803, Dec. 1997.
-
(1997)
IEEE/ACM Tr. Networking
, vol.5
, Issue.6
, pp. 784-803
-
-
Floyd, S.1
Jacobson, V.2
Liu, C.3
McCanne, S.4
Zhang, L.5
-
9
-
-
27144467529
-
SCAMP: Peer-to-peer lightweight membership service for large-scale group communication
-
Proc. 3rd Intnl. Wshop Networked Group Communication (NGC '01), Springer
-
A.J. Ganesh, A.-M. Kermarrec, and L. Massoulie. SCAMP: peer-to-peer lightweight membership service for large-scale group communication. In Proc. 3rd Intnl. Wshop Networked Group Communication (NGC '01), pages 44-55. LNCS 2233, Springer, 2001.
-
(2001)
LNCS
, vol.2233
, pp. 44-55
-
-
Ganesh, A.J.1
Kermarrec, A.-M.2
Massoulie, L.3
-
10
-
-
4243274567
-
-
Technical Report, Microsoft Research, Cambridge, UK
-
I. Gupta, A.-M. Kermarrec, and A.J. Ganesh. Adaptive and efficient epidemic-style protocols for reliable and scalable multicast. Technical Report, Microsoft Research, Cambridge, UK, 2001.
-
(2001)
Adaptive and efficient epidemic-style protocols for reliable and scalable multicast
-
-
Gupta, I.1
Kermarrec, A.-M.2
Ganesh, A.J.3
-
12
-
-
0036575227
-
Fighting fire with fire: Using randomized gossip to combat stochastic scalability limits
-
May/June
-
I. Gupta, R. van Renesse, and K. Birman. Fighting fire with fire: using randomized gossip to combat stochastic scalability limits. Journ. Quality and Reliability Engg. Intnl., 18:165-184, May/June, 2002.
-
(2002)
Journ. Quality and Reliability Engg. Intnl.
, vol.18
, pp. 165-184
-
-
Gupta, I.1
Van Renesse, R.2
Birman, K.3
-
15
-
-
84881253506
-
Directional gossip: Gossip in a wide area network
-
Proc. European Dependable Computing Conference, Springer
-
M.-J. Lin and K. Marzullo. Directional Gossip: Gossip in a Wide Area Network. In Proc. European Dependable Computing Conference, pages 364-379. LNCS 1667, Springer, 1999.
-
(1999)
LNCS
, vol.1667
, pp. 364-379
-
-
Lin, M.-J.1
Marzullo, K.2
-
16
-
-
84958774651
-
Gossip versus deterministically constrained flooding on small networks
-
Proc. 14th Intnl Conf. Distributed Computing (DISC 2000), Springer
-
M.-J. Lin, K. Marzullo, and S. Masini. Gossip versus Deterministically Constrained Flooding on small networks. In Proc. 14th Intnl Conf. Distributed Computing (DISC 2000), pages 253-267. LNCS 1914, Springer, 2000.
-
(2000)
LNCS
, vol.1914
, pp. 253-267
-
-
Lin, M.-J.1
Marzullo, K.2
Masini, S.3
-
18
-
-
0031120448
-
Reliable multicast transport protocol (RMTP)
-
S. Paul, K. Sabnani, and S. Bhattacharya. Reliable Multicast Transport Protocol (RMTP). IEEE Journ. Selected Areas in Communications, 15(3):405-421, 1997.
-
(1997)
IEEE Journ. Selected Areas in Communications
, vol.15
, Issue.3
, pp. 405-421
-
-
Paul, S.1
Sabnani, K.2
Bhattacharya, S.3
-
19
-
-
0036343302
-
Topologically-aware overlay construction and server selection
-
New York, Jun.
-
S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologically-aware overlay construction and server selection. In Proc. 21st IEEE INFOCOM, New York, Jun. 2002.
-
(2002)
Proc. 21st IEEE INFOCOM
-
-
Ratnasamy, S.1
Handley, M.2
Karp, R.3
Shenker, S.4
-
20
-
-
0034782005
-
Chord: A scalable peer-to-peer lookup service for internet applications
-
I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. ACM SIGCOMM Conf., pages 149-160, 2001.
-
(2001)
Proc. ACM SIGCOMM Conf.
, pp. 149-160
-
-
Stoica, I.1
Morris, R.2
Karger, D.3
Kaashoek, F.4
Balakrishnan, H.5
-
23
-
-
0035013438
-
A randomized error recovery algorithm for reliable multicast
-
Z. Xiao and K. Birman. A randomized error recovery algorithm for reliable multicast. In Proc. 20th IEEE INFOCOM, volume 1, pages 239-248, 2001.
-
(2001)
Proc. 20th IEEE INFOCOM
, vol.1
, pp. 239-248
-
-
Xiao, Z.1
Birman, K.2
-
24
-
-
0029780013
-
How to model an internetwork
-
E. Zegura, K. Calvert, and S. Bhattacharjee. How to model an internetwork. In Proc. 15th IEEE INFOCOM, volume 2, pages 594-602, 1996.
-
(1996)
Proc. 15th IEEE INFOCOM
, vol.2
, pp. 594-602
-
-
Zegura, E.1
Calvert, K.2
Bhattacharjee, S.3
|