{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T00:50:20Z","timestamp":1675212620601},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2003,8,25]]},"DOI":"10.1145\/863955.863999","type":"proceedings-article","created":{"date-parts":[[2004,4,19]],"date-time":"2004-04-19T17:18:43Z","timestamp":1082395123000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":100,"title":["Graph-theoretic analysis of structured peer-to-peer systems"],"prefix":"10.1145","author":[{"given":"Dmitri","family":"Loguinov","sequence":"first","affiliation":[{"name":"Texas A&M University, College Station, TX"}]},{"given":"Anuj","family":"Kumar","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX"}]},{"given":"Vivek","family":"Rai","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX"}]},{"given":"Sai","family":"Ganesh","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX"}]}],"member":"320","published-online":{"date-parts":[[2003,8,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571862"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"e_1_3_2_1_3_1","first-page":"281","article-title":"Scale-free Characteristics of Random Networks: The Topology of the World Wide Web","author":"Barabasi A.-L.","year":"2000","unstructured":"A.-L. Barabasi , R. Albert , and H. Jeong , \" Scale-free Characteristics of Random Networks: The Topology of the World Wide Web ,\" Physica A 281 , 2000 .]] A.-L. Barabasi, R. Albert, and H. Jeong, \"Scale-free Characteristics of Random Networks: The Topology of the World Wide Web,\" Physica A 281, 2000.]]","journal-title":"Physica A"},{"key":"e_1_3_2_1_4_1","volume-title":"On Distinguishing between Internet Power Law Topology Generators,\" IEEE INFOCOM","author":"Bu T.","year":"2002","unstructured":"T. Bu and D. Towsley , \" On Distinguishing between Internet Power Law Topology Generators,\" IEEE INFOCOM , 2002 .]] T. Bu and D. Towsley, \"On Distinguishing between Internet Power Law Topology Generators,\" IEEE INFOCOM, 2002.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.386051"},{"issue":"3","key":"e_1_3_2_1_6_1","article-title":"On the Impossibility of Directed Moore Graphs","volume":"29","author":"Bridges W. G.","year":"1980","unstructured":"W. G. Bridges and S. Toueg , \" On the Impossibility of Directed Moore Graphs ,\" Journal of Combinatorial Theory, series B29 , no. 3 , 1980 .]] W. G. Bridges and S. Toueg, \"On the Impossibility of Directed Moore Graphs,\" Journal of Combinatorial Theory, series B29, no. 3, 1980.]]","journal-title":"Journal of Combinatorial Theory, series"},{"key":"e_1_3_2_1_7_1","unstructured":"F. Chung \"Diameters of Communication Networks \" Mathematics of Information Processing 1984.]] F. Chung \"Diameters of Communication Networks \" Mathematics of Information Processing 1984.]]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(02)00436-3"},{"key":"e_1_3_2_1_10_1","volume-title":"A Better Upper Bound on the Bisection Width of de Bruijn Networks,\" Symposium on Theoretical Aspects of Computer Science (STACS)","author":"Feldmann R.","year":"1997","unstructured":"R. Feldmann , B. Monien , P. Mysliwietz , and S. Tschoke , \" A Better Upper Bound on the Bisection Width of de Bruijn Networks,\" Symposium on Theoretical Aspects of Computer Science (STACS) , 1997 .]] R. Feldmann, B. Monien, P. Mysliwietz, and S. Tschoke, \"A Better Upper Bound on the Bisection Width of de Bruijn Networks,\" Symposium on Theoretical Aspects of Computer Science (STACS), 1997.]]"},{"key":"e_1_3_2_1_11_1","volume-title":"Censorship Resistant Peer-to-Peer Content Addressable Networks,\" Symposium on Discrete Algorithms","author":"Fiat A.","year":"2002","unstructured":"A. Fiat and J. Saia , \" Censorship Resistant Peer-to-Peer Content Addressable Networks,\" Symposium on Discrete Algorithms , 2002 .]] A. Fiat and J. Saia, \"Censorship Resistant Peer-to-Peer Content Addressable Networks,\" Symposium on Discrete Algorithms, 2002.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872056"},{"key":"e_1_3_2_1_13_1","volume-title":"March","author":"Freedman M. J.","year":"2002","unstructured":"M. J. Freedman and R. Vingralek , \" Efficient Peer-To-Peer Lookup Based on a Distributed Trie,\" IPTPS , March 2002 .]] M. J. Freedman and R. Vingralek, \"Efficient Peer-To-Peer Lookup Based on a Distributed Trie,\" IPTPS, March 2002.]]"},{"key":"e_1_3_2_1_14_1","volume-title":"March","author":"Ganesan P.","year":"2003","unstructured":"P. Ganesan , Q. Sun , and H. Garcia-Molina , \" YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology,\" IEEE INFOCOM , March 2003 .]] P. Ganesan, Q. Sun, and H. Garcia-Molina, \"YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology,\" IEEE INFOCOM, March 2003.]]"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863998"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564877"},{"key":"e_1_3_2_1_18_1","volume-title":"Shufflenet: An Application of Generalized Perfect Shuffles to Multihop Lightwave Networks,\" IEEE INFOCOM","author":"Hluchyj M. G.","year":"1988","unstructured":"M. G. Hluchyj and M. J. Karol , \" Shufflenet: An Application of Generalized Perfect Shuffles to Multihop Lightwave Networks,\" IEEE INFOCOM , 1988 .]] M. G. Hluchyj and M. J. Karol, \"Shufflenet: An Application of Generalized Perfect Shuffles to Multihop Lightwave Networks,\" IEEE INFOCOM, 1988.]]"},{"key":"e_1_3_2_1_19_1","article-title":"Design to Minimize Diameter on Building-Block Network","volume":"30","author":"Imase M.","year":"1981","unstructured":"M. Imase and M. Itoh , \" Design to Minimize Diameter on Building-Block Network ,\" IEEE Trans. on Computers , vol. 30 , 1981 .]] M. Imase and M. Itoh, \"Design to Minimize Diameter on Building-Block Network,\" IEEE Trans. on Computers, vol. 30, 1981.]]","journal-title":"IEEE Trans. on Computers"},{"key":"e_1_3_2_1_20_1","volume-title":"February","author":"Kaashoek F.","year":"2003","unstructured":"F. Kaashoek and D. R. Karger , \" Koorde: A Simple Degree-optimal Hash Table,\" IPTPS , February 2003 .]] F. Kaashoek and D. R. Karger, \"Koorde: A Simple Degree-optimal Hash Table,\" IPTPS, February 2003.]]"},{"key":"e_1_3_2_1_21_1","unstructured":"C. Law and K.-Y. Siu \"Distributed Construction of Random Expander Graphs \" IEEE INFOCOM 2003.]] C. Law and K.-Y. Siu \"Distributed Construction of Random Expander Graphs \" IEEE INFOCOM 2003.]]"},{"key":"e_1_3_2_1_22_1","volume-title":"Trees, Hypercubes,\" Academic Press Morgan Kaufmann","author":"Leighton F. T.","year":"1991","unstructured":"F. T. Leighton , \"Introduction to Parallel Algorithms and Architectures : Arrays , Trees, Hypercubes,\" Academic Press Morgan Kaufmann , 1991 .]] F. T. Leighton, \"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes,\" Academic Press Morgan Kaufmann, 1991.]]"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571863"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571857"},{"key":"e_1_3_2_1_26_1","volume-title":"Symphony: Distributed Hashing in a Small World,\" USITS","author":"Manku G. S.","year":"2003","unstructured":"G. S. Manku , M. Bawa , and P. Raghavan , \" Symphony: Distributed Hashing in a Small World,\" USITS , 2003 .]] G. S. Manku, M. Bawa, and P. Raghavan, \"Symphony: Distributed Hashing in a Small World,\" USITS, 2003.]]"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777421"},{"key":"e_1_3_2_1_28_1","volume-title":"Sci.","author":"Pandurangan G.","year":"2001","unstructured":"G. Pandurangan , P. Raghavan , and E. Upfal , \" Building Low-Diameter P2P Networks,\" IEEE Symposium on Foundations in Comp . Sci. , 2001 .]] G. Pandurangan, P. Raghavan, and E. Upfal, \"Building Low-Diameter P2P Networks,\" IEEE Symposium on Foundations in Comp. Sci., 2001.]]"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/258492.258523"},{"key":"e_1_3_2_1_30_1","volume-title":"Balls into Bins -- A Simple and Tight Analysis,\" RANDOM","author":"Raab M.","year":"1998","unstructured":"M. Raab and A. Steger , \" Balls into Bins -- A Simple and Tight Analysis,\" RANDOM , 1998 .]] M. Raab and A. Steger, \"Balls into Bins -- A Simple and Tight Analysis,\" RANDOM, 1998.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_3_2_1_32_1","volume-title":"Some Open Questions,\" IPTPS","author":"Ratnasamy S.","year":"2002","unstructured":"S. Ratnasamy , S. Shenker , I. Stoica , \"Routing Algorithms for DHTs : Some Open Questions,\" IPTPS , 2002 .]] S. Ratnasamy, S. Shenker, I. Stoica, \"Routing Algorithms for DHTs: Some Open Questions,\" IPTPS, 2002.]]"},{"key":"e_1_3_2_1_33_1","volume-title":"Control and Computers","author":"Reddy S. M.","year":"1982","unstructured":"S. M. Reddy , J.G. Kuhl , S.H. Hosseini , and H. Lee , \" On Digraph with Minimum Diameter and Maximum Connectivity,\" Proceedings of Allerton Conf. on Communications , Control and Computers , 1982 .]] S. M. Reddy, J.G. Kuhl, S.H. Hosseini, and H. Lee, \"On Digraph with Minimum Diameter and Maximum Connectivity,\" Proceedings of Allerton Conf. on Communications, Control and Computers, 1982.]]"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00031-6"},{"key":"e_1_3_2_1_35_1","volume-title":"Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems,\" IFIP\/ACM International Conference on Distributed Systems Platforms","author":"Rowstron A.","year":"2001","unstructured":"A. Rowstron and P. Druschel , \" Pastry: Scalable , Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems,\" IFIP\/ACM International Conference on Distributed Systems Platforms , November 2001 .]] A. Rowstron and P. Druschel, \"Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems,\" IFIP\/ACM International Conference on Distributed Systems Platforms, November 2001.]]"},{"key":"e_1_3_2_1_36_1","volume-title":"March","author":"Saia J.","year":"2002","unstructured":"J. Saia , A. Fiat , S. Gribble , A.R. Karlin , and S. Saroiu , \" Dynamically Fault-Tolerant Content Addressable Networks,\" IPTPS , March 2002 .]] J. Saia, A. Fiat, S. Gribble, A.R. Karlin, and S. Saroiu, \"Dynamically Fault-Tolerant Content Addressable Networks,\" IPTPS, March 2002.]]"},{"key":"e_1_3_2_1_37_1","volume-title":"HyperCuP -- Hypercubes, Ontologies and Efficient Search on P2P Networks,\" Workshop on Agents and P2P Computing","author":"Schlosser M.","year":"2002","unstructured":"M. Schlosser , M. Sintek , S. Decker , and W. Nejdl , \" HyperCuP -- Hypercubes, Ontologies and Efficient Search on P2P Networks,\" Workshop on Agents and P2P Computing , 2002 .]] M. Schlosser, M. Sintek, S. Decker, and W. Nejdl, \"HyperCuP -- Hypercubes, Ontologies and Efficient Search on P2P Networks,\" Workshop on Agents and P2P Computing, 2002.]]"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.282610"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.93750"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_3_2_1_41_1","volume-title":"ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming,\" IEEE INFOCOM","author":"Tran D. A.","year":"2003","unstructured":"D. A. Tran , K. A. Hua , and T. T. Do , \" ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming,\" IEEE INFOCOM , 2003 .]] D. A. Tran, K. A. Hua, and T. T. Do, \"ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming,\" IEEE INFOCOM, 2003.]]"},{"key":"e_1_3_2_1_42_1","article-title":"On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks","author":"Xu J.","year":"2003","unstructured":"J. Xu , A. Kumar , and X. Yu , \" On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks ,\" To Appear in IEEE JSAC , Nov. 2003 .]] J. Xu, A. Kumar, and X. Yu, \"On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks,\" To Appear in IEEE JSAC, Nov. 2003.]]","journal-title":"To Appear in IEEE JSAC"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/378344.378347"}],"event":{"name":"SIGCOMM03: Applications, Technologies, Architectures, and Protocols for Computer Communications","location":"Karlsruhe Germany","acronym":"SIGCOMM03","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/863955.863999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T20:25:33Z","timestamp":1673295933000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/863955.863999"}},"subtitle":["routing distances and fault resilience"],"short-title":[],"issued":{"date-parts":[[2003,8,25]]},"references-count":41,"alternative-id":["10.1145\/863955.863999","10.1145\/863955"],"URL":"http:\/\/dx.doi.org\/10.1145\/863955.863999","relation":{},"published":{"date-parts":[[2003,8,25]]},"assertion":[{"value":"2003-08-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}