
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
John Risson, Aaron Harwood, Tim Moors, "Topology Dissemination for Reliable OneHop Distributed Hash Tables," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 5, pp. 680694, May, 2009.  
BibTex  x  
@article{ 10.1109/TPDS.2008.145, author = {John Risson and Aaron Harwood and Tim Moors}, title = {Topology Dissemination for Reliable OneHop Distributed Hash Tables}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {20}, number = {5}, issn = {10459219}, year = {2009}, pages = {680694}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.145}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Topology Dissemination for Reliable OneHop Distributed Hash Tables IS  5 SN  10459219 SP680 EP694 EPD  680694 A1  John Risson, A1  Aaron Harwood, A1  Tim Moors, PY  2009 KW  Distributed hash tables KW  epidemics KW  gossip KW  antientropy KW  multicast KW  reliability KW  widearea networks KW  de Bruijn graph. VL  20 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] S. Rhea, B. Godfrey, B. Karp, J. Kubiatowicz, S. Ratnasamy, S. Shenker, I. Stoica, and H. Yu, “OpenDHT: A Public DHT Service and Its Uses,” Proc. ACM SIGCOMM '05, pp. 7384, Aug. 2005.
[2] J. Risson and T. Moors, “Survey of Research towards Robust PeertoPeer Networks: Search Methods,” Computer Networks, vol. 50, no. 17, pp. 34853521, 2006.
[3] A. Gupta, B. Liskov, and R. Rodrigues, “Efficient Routing for PeertoPeer Overlays,” Proc. First Symp. Networked Systems Design and Implementation (NSDI '04), pp. 113126, Mar. 2004.
[4] C. Tang, M. Buco, R. Chang, S. Dwarkadas, L. Luan, E. So, and C. Ward, “Low Traffic Overlay Networks with Large Routing Tables,” Proc. ACM Sigmetrics Int'l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS '05), pp. 1425, June 2005.
[5] G. DeCandia, D. Hastorum, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels, “Dynamo: Amazon's Highly Available KeyValue Store,” Proc. 21st ACM Symp. Operating Systems Principles (SOSP'07), pp. 205220, Oct. 2007.
[6] J. Li, J. Stribling, R. Morris, F. Kaashoek, and T. Gil, “A Performance versus Cost Framework for Evaluating DHT Design Tradeoffs under Churn,” Proc. IEEE INFOCOM '05, pp. 225236, Mar. 2005.
[7] J. Risson, A. Harwood, and T. Moors, “Stable HighCapacity OneHop Distributed Hash Tables,” Proc. IEEE Symp. Computers and Comm. (ISCC '06), pp. 687694, June 2006.
[8] T. Deegan, J. Crowcroft, and A. Warfield, “The Main Name System: An Exercise in Centralized Computing,” ACM SIGCOMM Computer Comm. Rev., vol. 35, no. 3, pp. 514, 2005.
[9] M. Afergan, J. Wein, and A. LaMeyer, “Experience with Some Principles for Building an InternetScale Reliable System,” Proc. Fifth IEEE Int'l Symp. Network Computing and Applications (NCA'06), keynote address, July 2006.
[10] E. Brewer, “Lessons from GiantScale Services,” IEEE Internet Computing, vol. 5, no. 4, pp. 4655, 2001.
[11] A.C. Huang and A. Fox, “Cheap Recovery: A Key to SelfManaging State,” ACM Trans. Storage, vol. 1, no. 1, pp. 3870, 2004.
[12] J. Risson, S. Qazi, T. Moors, and A. Harwood, “A Dependable Global Location Service Using Rendezvous on Hierarchic Distributed Hash Tables,” Proc. Fifth IEEE Int'l Conf. Networking (ICN'06), p. 7, Apr. 2006.
[13] P.V. Mockapetris, “Telephony's Next Act,” IEEE Spectrum, vol. 43, no. 4, pp. 2932, 2006.
[14] T. Koponen, M. Chawla, B. Chun, A. Ermolinskiy, K.Y. Kim, S. Shenker, and I. Stoica, “A DataOriented (and Beyond) Network Architecture,” Proc. ACM SIGCOMM '07, pp. 181192, Aug. 2007.
[15] A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry, “Epidemic Algorithms for Replicated Data Management,” Proc. Sixth ACM Symp. Principles of Distributed Computing (PODC '87), pp. 112, Aug. 1987.
[16] I. Gupta, A.M. Kermarrec, and A. Ganesh, “Efficient EpidemicStyle Protocols for Reliable and Scalable Multicast,” Proc. 21st IEEE Symp. Reliable Distributed Systems (SRDS '02), pp. 180189, Oct. 2002.
[17] S. Banerjee, S. Lee, B. Bhattacharjee, and A. Srinivasan, “Resilient Multicast Using Overlays,” ACM SIGMETRICS Performance Evaluation Rev., (republished in IEEE/ACM Trans. Networking, vol. 14, no. 2, pp. 237248, Apr. 2006), vol. 31, no. 1, pp. 102113, 2003.
[18] K. Birman, M. Hayden, O. Ozkasap, Z. Xiao, and M. Budiu, “Bimodal Multicast,” ACM Trans. Computer Systems, vol. 17, no. 2, pp. 4188, 1999.
[19] I. Gupta, A.M. Kermarrec, and A. Ganesh, “Efficient and Adaptive EpidemicStyle Protocols for Reliable and Scalable Multicast,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 7, pp. 593605, July 2006.
[20] A.M. Kermarrec, L. Massoulie, and A. Ganesh, “Probabilistic Reliable Dissemination in LargeScale Systems,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 3, pp. 248258, Mar. 2003.
[21] P. Eugster, R. Guerraoui, S.B. Handurukande, A.M. Kermarrec, and P. Kouznetsov, “Lightweight Probabilistic Broadcast,” Proc. Int'l Conf. Dependable Systems and Networks (DSN '01), pp. 443452, July 2001.
[22] L.O. Alima, A. Ghodsi, and S. Haridi, “A Framework for Structured PeertoPeer Overlay Networks,” Proc. IST/FET Int'l Workshop Global Computing (GC '05), vol. 3267, pp. 223250, 2005.
[23] B. Leong, B. Liskov, and E. Demaine, “Epichord: Parallelizing the Chord Lookup Algorithm with Reactive Routing State Management,” Proc. 12th IEEE Int'l Conf. Networks (ICON '04), pp. 270276, Nov. 2004.
[24] I. Gupta, K. Birman, P. Linga, A. Demers, and R. Van Renesse, “Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead,” Proc. Second Int'l Workshop PeertoPeer Systems (IPTPS '03), Feb. 2003.
[25] V. Ramasubramanian and E. Sirer, “Beehive: $O(1)$ Lookup Performance for PowerLaw Query Distributions in PeertoPeer Overlays,” Proc. First Symp. Networked Systems Design and Implementation (NSDI '04), pp. 99112, Mar. 2004.
[26] J. Li, J. Stribling, R. Morris, and F. Kaashoek, “BandwidthEfficient Management of DHT Routing Tables,” Proc. Second Symp. Networked Systems Design and Implementation (NSDI '05), May 2005.
[27] W. Litwin, M.A. Niemat, and D. Schneider, “${\rm LH}^{\ast}$ —Linear Hashing for Distributed Files,” Proc. ACM SIGMOD '93, pp.327336, May 1993.
[28] B. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and J. Kubiatowicz, “Tapestry: A Resilient GlobalScale Overlay for Service Deployment,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 4153, 2004.
[29] W. Litwin, R. Moussa, and T. Schwarz, “${\rm LH}^{\ast}{\rm RS}$ —A HighlyAvailable Scalable Distributed Data Structure,” ACM Trans. Database Systems, vol. 30, no. 3, pp. 769811, 2005.
[30] J. Hromkovic, R. Klasing, A. Pelc, P. Ruzicka, and W. Unger, Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election and FaultTolerance. SpringerVerlag, 2005.
[31] A. Pelc, “FaultTolerant Broadcasting and Gossiping in Communication Networks,” Networks, vol. 28, no. 3, pp. 143156, 1996.
[32] M.J. Lin, K. Marzullo, and S. Masini, “Gossip versus Deterministically Constrained Flooding on Small Networks,” Proc. 14th Int'l Conf. Distributed Computing (DISC '00), pp.253267, Oct. 2000.
[33] V. Hadzilacos and S. Toueg, “FaultTolerant Broadcasts and Related Problems,” Distributed Systems, S. Mullender, ed., second ed, pp. 97145, ACM Press/AddisonWesley, 1993.
[34] W. Vogels, R.V. Renesse, and K. Birman, “The Power of Epidemics: Robust Communication for LargeScale Distributed Systems,” ACM SIGCOMM Computer Comm. Rev., vol. 33, no. 1, pp. 131135, 2003.
[35] D. Kempe, J. Kleinberg, and A. Demers, “Spatial Gossip and Resource Location Protocols,” J. ACM, vol. 51, no. 6, pp. 943967, 2004.
[36] P. Eugster, R. Guerraoiu, S. Handurukande, P. Kouznetsov, and A.M. Kermarrec, “Lightweight Probabilistic Broadcast,” ACM Trans. Computer Systems, vol. 21, no. 4, pp. 341374, 2003.
[37] A. Ganesh, A.M. Kermarrec, and L. Massoulie, “PeertoPeer Membership Management for GossipBased Protocols,” IEEE Trans. Computers, vol. 52, no. 2, pp. 139149, Feb. 2003.
[38] A. Mislove and P. Druschel, “Providing Administrative Control and Autonomy in Structured PeertoPeer Overlays,” Proc. Third Int'l Workshop PeertoPeer Systems (IPTPS '04), June 2004.
[39] S. Saroiu, P. Gummadi, and S. Gribble, “A Measurement Study of PeertoPeer File Sharing Systems,” Proc. Multimedia Computing and Networking (MMCN '02), Jan. 2002.
[40] I. Stoica, R. Morris, D. LibenNowell, D. Karger, M. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: A Scalable PeertoPeer Lookup Protocol for Internet Applications,” IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 1732, 2003.
[41] S. Lam and H. Liu, “Failure Recovery for Structured P2P Networks: Protocol Design and Performance under Churn,” Computer Networks, vol. 50, no. 16, pp. 30833104, 2006.
[42] V. Ramasubramanian, R. Petersen, and E. Sirer, “Corona: A High Performance PublishSubscribe System for the World Wide Web,” Proc. Third Symp. Networked Systems Design and Implementation (NSDI '06), May 2006.
[43] A. Kubota, A. Yamada, and Y. Miyake, “L2VPN over Chord: Hosting Millions of Small Zeroconf Networks over DHT Nodes,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '06), pp.15, Nov./Dec. 2006.
[44] H. Balakrishnan, S. Shenker, and M. Walfish, “Peering PeertoPeer Providers,” Proc. Fourth Int'l Workshop PeertoPeer Systems (IPTPS '05), Feb. 2005.
[45] L. Zhou and R. van Renesse, “P6P: A PeertoPeer Approach to Internet Infrastructure,” Proc. Third Int'l Workshop PeertoPeer Systems (IPTPS '04), Feb. 2004.
[46] M. Walfish, H. Balakrishnan, and S. Shenker, “Untangling the Web from DNS,” Proc. First Symp. Networked Systems Design and Implementation (NSDI '04), pp. 225238, Mar. 2004.
[47] I. Stoica, D. Adkins, S. Zhuang, and S. Shenker, “Internet Indirection Infrastructure,” IEEE/ACM Trans. Networking, vol. 12, no. 2, pp. 205218, 2004.
[48] J. Stribling, E. Sit, F. Kaashoek, J. Li, and R. Morris, “Don't Give Up on Distributed File Systems,” Proc. Sixth Int'l Workshop PeertoPeer Systems (IPTPS '07), Feb. 2007.
[49] D. Geels, “Data Replication in Oceanstore,” UC Berkeley Master's Report, Technical Report UCB//CSD021217, 2002.
[50] R. Rodrigues, “Robust Services in Dynamic Systems,” Doctoral dissertation, Massachusetts Inst. Tech nology, 2005.
[51] T. Koponen, M. Chawla, B. Chun, A. Ermolinskiy, K.Y. Kim, S. Shenker, and I. Stoica, “A DataOriented (and Beyond) Network Architecture,” Proc. ACM SIGCOMM '07, Aug. 2007.
[52] A. Bharambe, S. Rao, V. Padmanabhan, S. Seshan, and H. Zhang, “The Impact of Heterogeneous Bandwidth Constraints on DHTBased Multicast Protocols,” Proc. Fourth Int'l Workshop PeertoPeer Systems (IPTPS '05), Feb. 2005.
[53] M. Dahlin, B.B.V. Chandra, L. Gao, and A. Nayate, “EndtoEnd WAN Service Availability,” IEEE/ACM Trans. Networking (TON), vol. 11, no. 2, pp. 300313, 2003.
[54] J. Risson, K. Robinson, and T. Moors, “Fault Tolerant Active Rings for Structured PeertoPeer Overlays,” Proc. 30th Ann. IEEE Conf. Local Computer Networks (LCN '05), pp. 1825, Nov. 2005.
[55] J. Gray and L. Lamport, “Consensus on Transaction Commit,” ACM Trans. Database Systems, vol. 31, no. 1, pp. 133160, 2006.
[56] N.D. de Bruijn, “A Combinatorial Problem,” Koninklijke Netherlands: Academe Van Wetenschappen, vol. 49, pp. 758764, 1946.
[57] M. Imase and M. Itoh, “Design to Minimize Diameter on BuildingBlock Network,” IEEE Trans. Computers, vol. 30, no. 6, pp. 439442, June 1981.
[58] D.K. Pradhan and S.M. Reddy, “A FaultTolerant Communication Architecture for Distributed Systems,” IEEE Trans. Computers, vol. 31, no. 9, pp. 863870, Sept. 1982.
[59] D. Loguinov, J. Casas, and X. Wang, “GraphTheoretic Analysis of Structured PeertoPeer Systems: Routing Distances and Fault Resilience,” IEEE/ACM Trans. Networking, vol. 13, no. 5, pp. 11071120, 2005.
[60] D. Karger and M. Ruhl, “Simple Efficient Load Balancing Algorithms for PeertoPeer Systems,” Proc. 16th ACM Symp. Parallel Algorithms and Architectures (SPAA '04), June 2004.
[61] D. Karger, E. Lehman, T. Leighton, R. Panigraphy, M. Levin, and D. Lewin, “Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web,” Proc. 29th ACM Symp. Theory of Computing (STOC '97), pp.654663, May 1997.
[62] K. Sivarajan and R. Ramaswami, “Lightwave Networks Based on de Bruijn Graphs,” IEEE/ACM Trans. Networking, vol. 2, no. 1, pp.7079, 1994.
[63] V. Paxson, “Measurements and Analysis of EndtoEnd Internet Dynamics,” Doctoral dissertation, Univ. of California, Berkeley, 1997.
[64] Y. Zhang, V. Paxson, and S. Shenker, “The Stationarity of Internet Path Properties: Routing, Loss and Throughput,” technical report, AT&T Center for Internet Research, Int'l Computer Science Inst. (ICSI), May 2000.
[65] D. Andersen, “Improving EndtoEnd Availability Using OverlayNetworks,” Doctoral dissertation, Massachusetts Inst. Tech nology, 2005.
[66] M. Freedman, K. Lakshminarayanan, S. Rhea, and I. Stoica, “NonTransitive Connectivity and DHTs,” Proc. Second USENIX Workshop Real, Large Distributed Systems (WORLDS '05), Dec. 2005.
[67] V. Pappas, D. Massey, A. Terzis, and L. Zhang, “A Comparative Study of the DNS Design with DHTBased Alternatives,” Proc. IEEE INFOCOM '06, pp. 2329, Apr. 2006.
[68] K.P. Gummadi, H. Madhyastha, S. Gribble, H. Levy, and D. Wetherall, “Improving the Reliability of Internet Paths with OneHop Source Routing,” Proc. Sixth Symp. Operating Systems Design and Implementation (OSDI '04), Dec. 2004.
[69] P. Maymounkov and D. Mazieres, “Kademlia: A PeertoPeer Information System Based on the XOR Metric,” Proc. First Int'l Workshop Peer to Peer Systems (IPTPS '02), Mar. 2002.
[70] D. Stutzbach and R. Rajaie, “Improving Lookup Performance overa WidelyDeployed DHT,” Proc. IEEE INFOCOM '06, pp.112, Apr. 2006.
[71] D. de Caen, “A Lower Bound on the Probability of a Union,” Discrete Math., vol. 169, nos. 13, pp. 217220, 1997.