{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:59:16Z","timestamp":1725461956317},"publisher-location":"Berlin\/Heidelberg","reference-count":26,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540283463"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-28347-1_5","type":"book-chapter","created":{"date-parts":[[2006,3,25]],"date-time":"2006-03-25T03:24:40Z","timestamp":1143257080000},"page":"89-105","source":"Crossref","is-referenced-by-count":1,"title":["Cayley DHTs \u2014 A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs"],"prefix":"10.1007","author":[{"given":"Changtao","family":"Qu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Nejdl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Kriesell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"K. Aberer, A. Datta, and M. Hauswirth. P-Grid: Dynamics of self-organization in structured P2P systems, chapter 21, \u201cPeer-to-Peer-Systems and Applications\u201d. Springer LNCS, In Press, 2004."},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"S. B. Akers","year":"1989","unstructured":"Sheldon B. Akers and Balakrishnan Krishnamurthy. A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput., 38(4):555\u2013566, 1989.","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"5_CR3","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1109\/12.166612","volume":"41","author":"B. Alspach","year":"1992","unstructured":"Brian Alspach. Cayley graphs with optimal fault tolerance. IEEE Trans. Comput., 41(10):1337\u20131339, 1992.","journal-title":"IEEE Trans. Comput."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"P. Berthom\u00e9, A. Ferreira, and S. Perennes. Optimal information dissemination in star and pancake networks. IEEE Tran. on Parallel and Distrubuted Systems, 7(12), 1996.","DOI":"10.1109\/71.553290"},{"issue":"4","key":"5_CR5","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jgt.3190080406","volume":"8","author":"F. Boesch","year":"1984","unstructured":"F. Boesch and R. Tindell. Circulants and their connectivities. J. Graph Theory, 8(4):487\u2013499, 1984.","journal-title":"J. Graph Theory"},{"key":"5_CR6","first-page":"53","volume-title":"Graphs and applications (Boulder, Colo., 1982)","author":"F. Boesch","year":"1985","unstructured":"F. Boesch and R. Tindell. Connectivity and symmetry in graphs. In Graphs and applications (Boulder, Colo., 1982), Wiley-Intersci. Publ., pages 53\u201367. Wiley, New York, 1985."},{"key":"5_CR7","unstructured":"M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron. Exploiting network proximity in distributed hash tables. In International Workshop on Future Directions in Distributed Computing (FuDiCo), Bertinoro, Italy, June 2002."},{"issue":"1\u20133","key":"5_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(95)00072-5","volume":"156","author":"S. J. Curran","year":"1996","unstructured":"Stephen J. Curran and Joseph A. Gallian. Hamiltonian cycles and paths in Cayley graphs and digraphs\u2014a survey. Discrete Math., 156(1\u20133):1\u201318, 1996.","journal-title":"Discrete Math."},{"key":"5_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1995-5","volume-title":"A VLSI Architecture for Concurrent Data Structures","author":"W. J. Dally","year":"1987","unstructured":"W. J. Dally. A VLSI Architecture for Concurrent Data Structures. Hingham, MA: Kluwer, 1987."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"M. Datar. Butterflies and peer-to-peer networks. In 10th Annual European Symposium, Lecture Notes in Computer Science, Rome, Italy, September 2002. Springer.","DOI":"10.1007\/3-540-45749-6_30"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica. The impact of dht routing geometry on resilience and proximity. In ACM Annual Conference of the Special Interest Group on Data Communication (SIGCOMM), Karlsruhe, Germany, August 2003.","DOI":"10.1145\/863955.863998"},{"key":"5_CR12","first-page":"167","volume":"497","author":"M. C. Heydemann","year":"1997","unstructured":"M. C. Heydemann and B. Ducourthial. Cayley graphs and interconnection networks. Graph Symmetry, Algebraic Methods and Applications,\u201cNATO ASI C\u201d, 497:167\u2013226, 1997.","journal-title":"Graph Symmetry, Algebraic Methods and Applications,\u201cNATO ASI C\u201d"},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01220924","volume":"21","author":"W. Mader","year":"1970","unstructured":"W. Mader. \u00dcber den Zusammenhang symmetrischer Graphen. Arch. Math. (Basel), 21:331\u2013336, 1970.","journal-title":"Arch. Math. (Basel)"},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF01222585","volume":"22","author":"W. Mader","year":"1971","unstructured":"W. Mader. Eine Eigenschaft der Atome endlicher Graphen. Arch. Math. (Basel), 22:333\u2013336, 1971.","journal-title":"Arch. Math. (Basel)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey, California, USA, July 2002.","DOI":"10.1145\/571825.571857"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"G. S. Manku. Routing networks for distributed hash tables. In 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), Boston, USA, July 2003.","DOI":"10.1145\/872035.872054"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"W. Nejdl, M. Wolpers, W. Siberski, C. Schmitz, M. Schlosser, I. Brunkhorst, and A. L\u00f6ser. Super-peer-based routing and clustering strategies for rdf-based peer-to-peer networks. In 12th Intl. World Wide Web Conference, Budapest, Hungary, May 2003.","DOI":"10.1145\/775152.775229"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"S. R. Oehring, F. Sarkar, S. K. Das, and D. H. Hohndel. Cayley graph connected cycles: A new class of fixed-degree interconnection networks. In 28th Annual Hawaii International Conference on System Sciences, Hawaii, USA, May 1995.","DOI":"10.1109\/HICSS.1995.375509"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Annual Conference of the ACM Special Interest Group on Data Communications (ACM SIGCOMM 2001), San Diego, CA, USA, August 2001.","DOI":"10.1145\/383059.383072"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In IFIP\/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, November 2001.","DOI":"10.1007\/3-540-45518-3_18"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/BF01304186","volume":"68","author":"G. Sabidussi","year":"1964","unstructured":"Gert Sabidussi. Vertex-transitive graphs. Monatsh. Math., 68:426\u2013438, 1964.","journal-title":"Monatsh. Math."},{"key":"5_CR22","unstructured":"M. Schlosser, M. Sintek, S. Decker, and W. Nejdl. Hypercup-hypercubes, ontologies and efficient search on p2p networks. In International Workshop on Agents and Peer-to-Peer Computing, Bologna, Italy, July 2002."},{"key":"5_CR23","unstructured":"H. Shen, C. Xu, and G. Chen. Cycloid: A constant-degree and lookup-efficient p2p overlay network. In International Parallel and Distributed Processing Symposium (IPDPS2004), Santa Fe, New Mexico, April 2004."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Annual Conference of the ACM Special Interest Group on Data Communications (ACM SIGCOMM 2001), San Diego, CA, USA, August 2001.","DOI":"10.1145\/383059.383071"},{"key":"5_CR25","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0021-9800(70)80005-9","volume":"8","author":"M. E. Watkins","year":"1970","unstructured":"Mark E. Watkins. Connectivity of transitive graphs. J. Combinatorial Theory, 8:23\u201329, 1970.","journal-title":"J. Combinatorial Theory"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22(1), 2004.","DOI":"10.1109\/JSAC.2003.818784"}],"container-title":["Semantic Web and Peer-to-Peer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-28347-1_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:51:05Z","timestamp":1619560265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-28347-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540283463"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-28347-1_5","relation":{},"subject":[]}}