{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:39:04Z","timestamp":1770817144419,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,5,27]],"date-time":"2021-05-27T00:00:00Z","timestamp":1622073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,5,27]],"date-time":"2021-05-27T00:00:00Z","timestamp":1622073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11432-020-2996-2","type":"journal-article","created":{"date-parts":[[2021,5,31]],"date-time":"2021-05-31T01:02:20Z","timestamp":1622422940000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Efficient distributed algorithms for holistic aggregation functions on random regular graphs"],"prefix":"10.1007","volume":"65","author":[{"given":"Lin","family":"Jia","sequence":"first","affiliation":[]},{"given":"Qiang-Sheng","family":"Hua","sequence":"additional","affiliation":[]},{"given":"Haoqiang","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Qiuping","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Hai","family":"Jin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,27]]},"reference":[{"key":"2996_CR1","doi-asserted-by":"crossref","unstructured":"Kuhn F, Locher T, Wattenhofer R. Tight bounds for distributed selection. In: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 2007","DOI":"10.1145\/1248377.1248401"},{"key":"2996_CR2","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1109\/TC.2010.50","volume":"60","author":"X Y Li","year":"2011","unstructured":"Li X Y, Wang Y J, Wang Y. Complexity of data collection, aggregation, and selection for wireless sensor networks. IEEE Trans Comput, 2011, 60: 386\u2013399","journal-title":"IEEE Trans Comput"},{"key":"2996_CR3","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.adhoc.2011.12.004","volume":"12","author":"H Li","year":"2014","unstructured":"Li H, Wu C, Hua Q S, et al. Latency-minimizing data aggregation in wireless sensor networks under physical interference model. Ad Hoc Netw, 2014, 12: 52\u201368","journal-title":"Ad Hoc Netw"},{"key":"2996_CR4","unstructured":"Bawa M, Garcia-Molina H, Gionis A, et al. Estimating Aggregates on a Peer-to-peer Network. Technical Report, 2003"},{"key":"2996_CR5","doi-asserted-by":"publisher","first-page":"032103","DOI":"10.1007\/s11432-018-9451-y","volume":"62","author":"Z T Guan","year":"2019","unstructured":"Guan Z T, Zhang Y, Zhu L H, et al. EFFECT: an efficient flexible privacy-preserving data aggregation scheme with authentication in smart grid. Sci China Inf Sci, 2019, 62: 032103","journal-title":"Sci China Inf Sci"},{"key":"2996_CR6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality Sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg D. Distributed Computing: A Locality Sensitive Approach. Philadelphia: Society for Industrial and Applied Mathematics, 2000"},{"key":"2996_CR7","series-title":"Dissertation for Ph.D. Degree","volume-title":"Foundations of aggregation and synchronization in distributed systems","author":"T Locher","year":"2009","unstructured":"Locher T. Foundations of aggregation and synchronization in distributed systems. Dissertation for Ph.D. Degree. Zurich: ETH Zurich, 2009"},{"key":"2996_CR8","doi-asserted-by":"crossref","unstructured":"Kuhn F, Locher T, Schmid S. Distributed computation of the mode. In: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing, 2008","DOI":"10.1145\/1400751.1400756"},{"key":"2996_CR9","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721335.010","volume-title":"Models of random regular graphs","author":"N C Wormald","year":"1999","unstructured":"Wormald N C. Models of random regular graphs. In: London Mathematical Society Lecture Note Series. Cambridge: Cambridge University Press, 1999"},{"key":"2996_CR10","unstructured":"Singla A, Hong C, Popa L, et al. Jellyfish: networking data centers randomly. In: Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation, 2012"},{"key":"2996_CR11","unstructured":"Singla A, Godfrey P B, Kolla A. High throughput data center topology design. In: Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation, 2014"},{"key":"2996_CR12","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/TC.1985.6312192","volume":"C-34","author":"C E Leiserson","year":"1985","unstructured":"Leiserson C E. Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans Comput, 1985, C-34: 892\u2013901","journal-title":"IEEE Trans Comput"},{"key":"2996_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0898-1221(88)90213-1","volume":"15","author":"F Harary","year":"1988","unstructured":"Harary F, Hayes J P, Wu H J. A survey of the theory of hypercube graphs. Comput Math Appl, 1988, 15: 277\u2013289","journal-title":"Comput Math Appl"},{"key":"2996_CR14","doi-asserted-by":"crossref","unstructured":"Jyothi S A, Singla A, Godfrey B, et al. Measuring and understanding throughput of network topologies. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, 2016. 1\u201312","DOI":"10.1109\/SC.2016.64"},{"key":"2996_CR15","doi-asserted-by":"crossref","unstructured":"Singla A. Fat-free topologies. In: Proceedings of the 15th ACM Workshop on Hot Topics in Networks, 2016. 64\u201370","DOI":"10.1145\/3005745.3005747"},{"key":"2996_CR16","doi-asserted-by":"crossref","unstructured":"Kassing S, Valadarsky A, Shahaf G, et al. Beyond fat-trees without antennae, mirrors, and disco-balls. In: Proceedings of the Conference of the ACM Special Interest Group on Data Communication, 2017. 281\u2013294","DOI":"10.1145\/3098822.3098836"},{"key":"2996_CR17","doi-asserted-by":"crossref","unstructured":"Valadarsky A, Dinitz M, Schapira M. Xpander: unveiling the secrets of high-performance datacenters. In: Proceedings of the 14th ACM Workshop on Hot Topics in Networks, Philadelphia, 2015","DOI":"10.1145\/2834050.2834059"},{"key":"2996_CR18","doi-asserted-by":"crossref","unstructured":"Valadarsky A, Shahaf G, Dinitz M, et al. Xpander: towards optimal-performance datacenters. In: Proceedings of the 12th International on Conference on Emerging Networking Experiments and Technologies, Irvine, 2016","DOI":"10.1145\/2999572.2999580"},{"key":"2996_CR19","doi-asserted-by":"crossref","unstructured":"Broder A Z, Shamir E. On the second eigenvalue of random regular graphs (preliminary version). In: Proceedings of the 28th Annual Symposium on Foundations of Computer Science, Los Angeles, 1987","DOI":"10.1109\/SFCS.1987.45"},{"key":"2996_CR20","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","volume":"52","author":"S P Boyd","year":"2006","unstructured":"Boyd S P, Ghosh A, Prabhakar B, et al. Randomized gossip algorithms. IEEE Trans Inform Theor, 2006, 52: 2508\u20132530","journal-title":"IEEE Trans Inform Theor"},{"key":"2996_CR21","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01215349","volume":"2","author":"F T Leighton","year":"1994","unstructured":"Leighton F T, Maggs B M, Rao S. Packet routing and job-shop scheduling in O(congestion + dilation) steps. Combinatorica, 1994, 2: 167\u2013186","journal-title":"Combinatorica"},{"key":"2996_CR22","series-title":"Dissertation for Master\u2019s Degree","volume-title":"Shortest Paths Routing on Arbitrary Networks","author":"B Vocking","year":"1994","unstructured":"Vocking B. Shortest Paths Routing on Arbitrary Networks. Dissertation for Master\u2019s Degree. Paderborn: Universit\u00e4t Paderborn, 1994"},{"key":"2996_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(91)90157-D","volume":"39","author":"I Newman","year":"1991","unstructured":"Newman I. Private vs. common random bits in communication complexity. Inf Process Lett, 1991, 39: 67\u201371","journal-title":"Inf Process Lett"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-2996-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-020-2996-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-020-2996-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T20:23:21Z","timestamp":1685910201000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-020-2996-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,27]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["2996"],"URL":"https:\/\/doi.org\/10.1007\/s11432-020-2996-2","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,27]]},"assertion":[{"value":"13 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"152101"}}