{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T04:44:29Z","timestamp":1761108269895},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,5,5]],"date-time":"2016-05-05T00:00:00Z","timestamp":1462406400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cloud Comp"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1186\/s13677-016-0056-x","type":"journal-article","created":{"date-parts":[[2016,4,26]],"date-time":"2016-04-26T21:23:45Z","timestamp":1461705825000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Fast methods for designing circulant network topology with high connectivity and survivability"],"prefix":"10.1186","volume":"5","author":[{"given":"Rui","family":"Lu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,5]]},"reference":[{"issue":"4","key":"56_CR1","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/COMST.2004.5342296","volume":"6","author":"JR D\u00e9gila","year":"2004","unstructured":"D\u00e9gila JR, Sanso B (2004) A survey of topologies and performance measures for large-scale networks[J]. Commun Surv Tutorials, IEEE 6(4):18\u201331","journal-title":"Commun Surv Tutorials, IEEE"},{"key":"56_CR2","unstructured":"Kotsis G (1992) Interconnection topologies and routing for parallel processing systems[M]. ACPC-Austrian Center for Parallel Computation"},{"key":"56_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0927-0507(89)01002-9","volume":"1","author":"GL Nemhauser","year":"1989","unstructured":"Nemhauser GL, Kan AR, Todd M (1989) Handbooks in operations research and management science[J]. Optimization 1:1\u201378","journal-title":"Optimization"},{"issue":"1","key":"56_CR4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1002\/jgt.3190100103","volume":"10","author":"EA Doorn Van","year":"1986","unstructured":"Van Doorn EA (1986) Connectivity of circulant digraphs[J]. J Graph Theory 10(1):9\u201314","journal-title":"J Graph Theory"},{"issue":"4","key":"56_CR5","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jgt.3190080406","volume":"8","author":"F Boesch","year":"1984","unstructured":"Boesch F, Tindell R (1984) Circulants and their connectivities[J]. J Graph Theory 8(4):487\u2013499","journal-title":"J Graph Theory"},{"issue":"12","key":"56_CR6","doi-asserted-by":"crossref","first-page":"1286","DOI":"10.1109\/TCS.1985.1085667","volume":"32","author":"FT Boesch","year":"1985","unstructured":"Boesch FT, Wang JF (1985) Reliable circulant networks with minimum transmission delay[J]. Circuits Syst, IEEE Trans 32(12):1286\u20131291","journal-title":"Circuits Syst, IEEE Trans"},{"issue":"2","key":"56_CR7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/(SICI)1097-0037(199803)31:2<61::AID-NET1>3.0.CO;2-H","volume":"31","author":"Q Li","year":"1998","unstructured":"Li Q, Li Q (1998) Reliability analysis of circulant graphs[J]. Networks 31(2):61\u201365","journal-title":"Networks"},{"issue":"4","key":"56_CR8","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1002\/net.20397","volume":"57","author":"LD Penso","year":"2011","unstructured":"Penso LD, Rautenbach D, Szwarcfiter JL (2011) Connectivity and diameter in distance graphs[J]. Networks 57(4):310\u2013315","journal-title":"Networks"},{"issue":"1","key":"56_CR9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/COMST.1999.5340507","volume":"2","author":"S Banerjee","year":"1999","unstructured":"Banerjee S, Jain V, Shah S (1999) Regular multihop logical topologies for lightwave networks[J]. Commun Surv, IEEE 2(1):2\u201318","journal-title":"Commun Surv, IEEE"},{"issue":"3","key":"56_CR10","first-page":"786","volume":"1996","author":"E Mohan Reddy","year":"1996","unstructured":"Mohan Reddy E, Reddy E (1996) A dynamically reconfigurable WDM LAN based on reconfigurable circulant graph[C]\/\/Military Communications Conference, 1996. MILCOM\u201996, Conference Proceedings, IEEE. IEEE 1996(3):786\u2013790","journal-title":"IEEE"},{"issue":"4","key":"56_CR11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1109\/TC.1981.1675777","volume":"100","author":"BW Arden","year":"1981","unstructured":"Arden BW, Lee H (1981) Analysis of chordal ring network[J]. Comp, IEEE Trans 100(4):291\u2013295","journal-title":"Comp, IEEE Trans"},{"issue":"4","key":"56_CR12","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s00493-013-2820-6","volume":"33","author":"J Marklof","year":"2013","unstructured":"Marklof J, Str\u00f6mbergsson A (2013) Diameters of random circulant graphs[J]. Combinatorica 33(4):429\u2013466","journal-title":"Combinatorica"},{"key":"56_CR13","first-page":"257","volume-title":"Analysis of chordal rings[J]. Mathematical Techniques and Problems in Telecommunications","author":"S Bujnowski","year":"2003","unstructured":"Bujnowski S, Dubalski B, Zab\u0142udowski A (2003) Analysis of chordal rings[J]. Mathematical Techniques and Problems in Telecommunications. Centro International de Matematica, Tomar, pp 257\u2013279"},{"key":"56_CR14","unstructured":"Morillo P, Comellas F, Fiol M A. The optimization of chordal ring networks[J]. Commun Technol 1987: 295-299"},{"key":"56_CR15","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1109\/TC.1979.1675402","volume":"7","author":"S Toueg","year":"1979","unstructured":"Toueg S, Steiglitz K (1979) The design of small-diameter networks by local search[J]. IEEE Trans Comput 7:537\u2013542","journal-title":"IEEE Trans Comput"},{"key":"56_CR16","unstructured":"Park J H, Chwa K Y. Recursive circulant: A new topology for multicomputer networks[C]\/\/Parallel Architectures, Algorithms and Networks, 1994.(ISPAN), International Symposium on. IEEE, 1994: 73-80"},{"key":"56_CR17","first-page":"23","volume-title":"On strongly hamiltonian abelian group graphs[M]\/\/Combinatorial mathematics VIII","author":"CC Chen","year":"1981","unstructured":"Chen CC, Quimpo NF (1981) On strongly hamiltonian abelian group graphs[M]\/\/Combinatorial mathematics VIII. Springer, Berlin Heidelberg, pp 23\u201334"},{"issue":"3","key":"56_CR18","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1111\/j.1467-9469.2008.00638.x","volume":"36","author":"M Lupparelli","year":"2009","unstructured":"Lupparelli M, Marchetti GM, Bergsma WP (2009) Parameterizations and Fitting of Bi\u2010directed Graph Models to Categorical Data[J]. Scand J Stat 36(3):559\u2013576","journal-title":"Scand J Stat"},{"issue":"393","key":"56_CR19","first-page":"217","volume":"2","author":"A \u00c1d\u00e1m","year":"1967","unstructured":"\u00c1d\u00e1m A (1967) Research problem 2-10[J]. J Combin Theory 2(393):217","journal-title":"J Combin Theory"},{"issue":"2","key":"56_CR20","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0012-365X(79)90011-6","volume":"25","author":"B Alspach","year":"1979","unstructured":"Alspach B, Parsons TD (1979) Isomorphism of circulant graphs and digraphs[J]. Discret Math 25(2):97\u2013108","journal-title":"Discret Math"},{"issue":"1","key":"56_CR21","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0012-365X(97)81804-3","volume":"176","author":"M Muzychuk","year":"1997","unstructured":"Muzychuk M (1997) On \u00c1d\u00e1m\u2019s conjecture for circulant graphs[J]. Discret Math 176(1):285\u2013298","journal-title":"Discret Math"},{"issue":"1","key":"56_CR22","first-page":"309","volume":"182","author":"MY Xu","year":"1998","unstructured":"Xu MY (1998) Automorphism groups and isomorphisms of Cayley digraphs[J]. Discret Math 182(1):309\u2013319","journal-title":"Discret Math"},{"issue":"24","key":"56_CR23","doi-asserted-by":"crossref","first-page":"6047","DOI":"10.1016\/j.disc.2007.11.024","volume":"308","author":"E Dobson","year":"2008","unstructured":"Dobson E (2008) On isomorphisms of circulant digraphs of bounded degree[J]. Discret Math 308(24):6047\u20136055","journal-title":"Discret Math"},{"issue":"1","key":"56_CR24","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","volume":"24","author":"JC Bermond","year":"1995","unstructured":"Bermond JC, Comellas F, Hsu DF (1995) Distributed loop computer-networks: a survey[J]. J Parallel Distrib Comput 24(1):2\u201310","journal-title":"J Parallel Distrib Comput"},{"key":"56_CR25","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1109\/TC.1987.1676963","volume":"6","author":"MA Fiol","year":"1987","unstructured":"Fiol MA, Yebra JLA, Alegre I et al (1987) Discrete optimization problem in local networks and data alignment[J]. IEEE Trans Comput 6:702\u2013713","journal-title":"IEEE Trans Comput"}],"container-title":["Journal of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-016-0056-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13677-016-0056-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-016-0056-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T12:08:45Z","timestamp":1553602125000},"score":1,"resource":{"primary":{"URL":"http:\/\/journalofcloudcomputing.springeropen.com\/articles\/10.1186\/s13677-016-0056-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,5]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["56"],"URL":"https:\/\/doi.org\/10.1186\/s13677-016-0056-x","relation":{},"ISSN":["2192-113X"],"issn-type":[{"value":"2192-113X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,5]]},"article-number":"5"}}