{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T03:40:11Z","timestamp":1746416411178,"version":"3.40.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,10,11]],"date-time":"2014-10-11T00:00:00Z","timestamp":1412985600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Grid Computing"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10723-014-9317-4","type":"journal-article","created":{"date-parts":[[2014,10,10]],"date-time":"2014-10-10T17:42:42Z","timestamp":1412962962000},"page":"215-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Stochastic Process Approach to Model Distributed Computing on Complex Networks"],"prefix":"10.1007","volume":"13","author":[{"given":"Francisco","family":"Prieto-Castrillo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Astillero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda","family":"Bot\u00f3n-Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,11]]},"reference":[{"issue":"5939","key":"9317_CR1","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1126\/science.1173299","volume":"325","author":"A Barab\u00e1si","year":"2009","unstructured":"Barab\u00e1si, A.: Scale-free networks: a decade and beyond. Science 325(5939), 412 (2009)","journal-title":"Science"},{"issue":"2","key":"9317_CR2","first-page":"183","volume":"1","author":"B Kahanwal","year":"2012","unstructured":"Kahanwal, B., Singh, T.P.: The Distributed Computing Paradigms: P2P, Grid, Cluster, Cloud, and Jungle. Int. J. Latest Res. Sci. Technol. 1(2), 183\u2013187 (2012)","journal-title":"Int. J. Latest Res. Sci. Technol."},{"issue":"3","key":"9317_CR3","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1177\/109434200101500302","volume":"15","author":"I Foster","year":"2001","unstructured":"Foster, I., Kesselman, C., Tuecke, S.: The anatomy of the grid: Enabling scalable virtual organizations. Int. J. High Perform. Comput. Appl. 15(3), 200 (2001)","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"9317_CR4","doi-asserted-by":"crossref","unstructured":"Buyya, R., Brogerg, J.: Cloud computing: principles and paradigms. Wiley series on parallel and distributed computing. Wiley-Blackwell (2011)","DOI":"10.1002\/9780470940105"},{"key":"9317_CR5","unstructured":"Karagiannis, T.: Filesharing in the internet: A characterization of p2p traffic in the backbone. Tech. rep., UC Riverside (2003)"},{"key":"9317_CR6","doi-asserted-by":"crossref","unstructured":"Muttoni, L., Casale, G., Granata, F., Zanero, S.: Optimal number of nodes for computation in grid environments. In: Proceedings of the 12th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP04), pp. 282\u2013289 (2004)","DOI":"10.1109\/EMPDP.2004.1271457"},{"key":"9317_CR7","doi-asserted-by":"crossref","unstructured":"Iamnitchi, A., Ripeanu, M., Foster, I.: Locating data in (small-world?) peer-to-peer scientific collaborations. In: IPTPS \u201901 Revised Papers from the First International Workshop on Peer-to-Peer Systems, pp. 232\u2013241. Springer-Verlag (2002)","DOI":"10.1007\/3-540-45748-8_22"},{"issue":"1","key":"9317_CR8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1140\/epjb\/e2005-00107-6","volume":"44","author":"L da Fontoura Costa","year":"2005","unstructured":"da Fontoura Costa, L., Travieso, G., Ruggiero, C.: Complex grid computing. Eur. Phys. J. B 44(1), 119\u2013128 (2005)","journal-title":"Eur. Phys. J. B"},{"key":"9317_CR9","doi-asserted-by":"crossref","unstructured":"Ilija\u0161i\u0107, L., Saitta, L.: Characterization of a computational grid as a complex system. In: GMAC \u201909 Proceedings of the 6th International Conference Industry Session on Grids Meets Autonomic Computing. ACM, pp. 9\u201318 (2009)","DOI":"10.1145\/1555301.1555303"},{"key":"9317_CR10","doi-asserted-by":"crossref","unstructured":"de Mello, R.F., Ishii, R.P., Yang, L.T.: A complex network-based approach for job scheduling in grid environments. In: High Performance Computing and Communications of Lecture Notes in Computer Science, vol. 4782, pp. 204\u2013215 (2007)","DOI":"10.1007\/978-3-540-75444-2_24"},{"issue":"4","key":"9317_CR11","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s10723-006-9034-8","volume":"4","author":"Y Derbal","year":"2006","unstructured":"Derbal, Y.: Entropic grid scheduling. J. Grid Comput. 4(4), 373\u2013394 (2006)","journal-title":"J. Grid Comput."},{"key":"9317_CR12","doi-asserted-by":"crossref","unstructured":"Batista, D., da Fonseca, N., Granelli, F., Kliazovich, D.: Self-adjusting grid networks. In: IEEE international conference on communications. IEEE, pp. 344\u2013349 (2007)","DOI":"10.1109\/ICC.2007.64"},{"key":"9317_CR13","doi-asserted-by":"crossref","unstructured":"Jones, B.: An overview of the egee project. In: T\u00fcrker, C., Agosti, M., Schek, H.-J. (eds.) Peer-to-Peer, Grid, and Service-orientation in Digital Library Architectures of Lecture Notes in Computer Science, vol. 3664, pp. 1\u20138. Springer, Berlin Heidelberg (2005)","DOI":"10.1007\/11549819_1"},{"key":"9317_CR14","doi-asserted-by":"crossref","unstructured":"McCreary, C.L., Khan, A.A., Thompson, J.J., McArdle, M.E.: A comparison of heuristics for scheduling dags on multiprocessors. In: Proceedings of 8th International Parallel Processing Symposium. IEEE, pp. 446\u2013451 (1994)","DOI":"10.1109\/IPPS.1994.288264"},{"key":"9317_CR15","unstructured":"Forti, A.: Dag scheduling for grid computing systems. Ph.D. Thesis. Udine University (2006)"},{"issue":"1","key":"9317_CR16","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1023\/A:1024000426962","volume":"1","author":"E Deelman","year":"2003","unstructured":"Deelman, E., Blythe, J., Gil, Y., Kesselman, C., Mehta, G., Vahi, K., Blackburn, K., Lazzarini, A., Arbree, A., Cavanaugh, R.: Mapping abstract complex workflows onto grid environments. J. Grid Comput. 1(1), 25\u201339 (2003)","journal-title":"J. Grid Comput."},{"issue":"2","key":"9317_CR17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s11227-009-0284-7","volume":"51","author":"H Cao","year":"2009","unstructured":"Cao, H., Jin, H., Wu, X., Wu, S., Shi, X.: DAGMap: Efficient and dependable scheduling of DAG workflow job in Grid. J. Supercomput. 51(2), 201\u2013223 (2009)","journal-title":"J. Supercomput."},{"key":"9317_CR18","unstructured":"European grid infrastructure project: ( http:\/\/www.egi.eu )"},{"key":"9317_CR19","doi-asserted-by":"crossref","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication on SIGCOMM \u201999. ACM, pp. 251\u2013262 (1999)","DOI":"10.1145\/316188.316229"},{"key":"9317_CR20","doi-asserted-by":"crossref","unstructured":"Chen, Q., Hyunseok, Q.C., Govindan, R., Jamin, S., Shenker, S.J., Willinger, W.: The origin of power laws in internet topologies revisited. In: Proceedings of 21th Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, vol. 2, pp. 608\u2013617 (2002)","DOI":"10.1109\/INFCOM.2002.1019306"},{"issue":"4","key":"9317_CR21","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/TNET.2003.815300","volume":"11","author":"G Siganos","year":"2003","unstructured":"Siganos, G., Faloutsos, M., Faloutsos, P., Faloutsos, C.: Power laws and the AS-level internet topology. IEEE\/ACM Trans. Networking 11(4), 514\u2013524 (2003)","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"1","key":"9317_CR22","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/280549.280555","volume":"28","author":"J-J Pansiot","year":"1998","unstructured":"Pansiot, J.-J., Grad, D.: On routes and multicast trees in the internet. ACM SIGCOMM Comput. Commun. Rev. 28(1), 41\u201350 (1998)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"issue":"6","key":"9317_CR23","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/j.comcom.2003.08.021","volume":"27","author":"L Amini","year":"2004","unstructured":"Amini, L., Shaikh, A., Schulzrinne, H.: Issues with inferring internet topological attributes. Comput. Commun. 27(6), 557\u2013567 (2004)","journal-title":"Comput. Commun."},{"issue":"5","key":"9317_CR24","first-page":"586","volume":"56","author":"W Willinger","year":"2009","unstructured":"Willinger, W., Alderson, D., Doyle, J.C.: Mathematics and the internet: A source of enormous confusion and great potential. Not. AMS 56(5), 586\u2013599 (2009)","journal-title":"Not. of the AMS"},{"issue":"4","key":"9317_CR25","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset, A., Shalizi, C.R., Newman, M.E.: Power-law distributions in empirical data. SIAM Rev. 51(4), 661\u2013703 (2009)","journal-title":"SIAM Rev."},{"key":"9317_CR26","unstructured":"Clauset, A.: http:\/\/tuvalu.santafe.edu\/~aaronc\/powerlaws\/"},{"key":"9317_CR27","volume-title":"Task scheduling in parallel and distributed systems","author":"HE Rewini","year":"1994","unstructured":"Rewini, H.E., Lewis, T.G., Ali, H.H.: Task scheduling in parallel and distributed systems. Prentice-Hall, Englewood Cliffs (1994)"},{"key":"9317_CR28","unstructured":"Peterson, L., Davie, B.: Computer networks: A systems approach. Morgan Kauffman (2007)"},{"key":"9317_CR29","unstructured":"Zhang, Y.: Grid-centric scheduling strategies for workflow applications. Ph.D. thesis, Rice University (2009)"},{"key":"9317_CR30","unstructured":"Fujii, K., Goto, S.: Correlation between hop count and packet transfer time. APAN\/IWS2000 (2000)"},{"key":"9317_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern graph theory","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern graph theory. Springer, Berlin Heidelberg New York (1998)"},{"key":"9317_CR32","unstructured":"Kendall, M.G.: The advanced theory of statistics, vol. 1. C. Griffin & Company Limited (1945)"},{"key":"9317_CR33","doi-asserted-by":"crossref","unstructured":"Arnold, B.C., Balakrishnan, N., Nagaraja, H.N.: A First Course in Order Statistics. Society for Industrial and Applied Mathematics (2008)","DOI":"10.1137\/1.9780898719062"},{"issue":"13-15","key":"9317_CR34","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1002\/cpe.710","volume":"14","author":"R Buyya","year":"2002","unstructured":"Buyya, R., Murshed, M.: Gridsim: A toolkit for the modeling and simulation of distributed resource management and scheduling for grid computing. Concurr. Comput. Pract. Experience 14(13-15), 1175\u20131220 (2002)","journal-title":"Concurr. Comput: Pract. Experience"},{"key":"9317_CR35","unstructured":"O\u2019Madadhain, J., Fisher, D., White, S., Boey, Y.: The JUNG (Java Universal Network\/Graph) Framework. Tech. rep., UCI-ICS (2003)"},{"issue":"4","key":"9317_CR36","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1006\/aama.2001.0720","volume":"26","author":"F Chung","year":"2001","unstructured":"Chung, F., Lu, L.: The Diameter of sparse random graphs. Adv. Appl. Math. 26(4), 257\u2013279 (2001)","journal-title":"Adv. Appl. Math."},{"issue":"5439","key":"9317_CR37","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A Barabasi","year":"1999","unstructured":"Barabasi, A., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509 (1999)","journal-title":"Science"},{"key":"9317_CR38","unstructured":"Bollob\u00e1s, B.: Graph theory and combinatorics. Ch. The evolution of sparse graphs. Cambridge Academic Press (1984)"},{"issue":"5","key":"9317_CR39","doi-asserted-by":"crossref","first-page":"056110","DOI":"10.1103\/PhysRevE.70.056110","volume":"70","author":"A Fronczak","year":"2004","unstructured":"Fronczak, A., Fronczak, P., Ho\u0142yst, J.A.: Average path length in random networks. Phys. Rev. E 70(5), 056110 (2004)","journal-title":"Phys. Rev. E"},{"issue":"6","key":"9317_CR40","doi-asserted-by":"crossref","first-page":"066101","DOI":"10.1103\/PhysRevE.76.066101","volume":"76","author":"VD Blondel","year":"2007","unstructured":"Blondel, V.D., Guillaume, J.-L., Hendrickx, J.M., Jungers, R.M.: Distance distribution in random graphs and application to network exploration. Phys. Rev. E 76(6), 066101 (2007)","journal-title":"Phys. Rev. E"}],"container-title":["Journal of Grid Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10723-014-9317-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10723-014-9317-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10723-014-9317-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T03:14:38Z","timestamp":1746414878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10723-014-9317-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,11]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["9317"],"URL":"https:\/\/doi.org\/10.1007\/s10723-014-9317-4","relation":{},"ISSN":["1570-7873","1572-9184"],"issn-type":[{"type":"print","value":"1570-7873"},{"type":"electronic","value":"1572-9184"}],"subject":[],"published":{"date-parts":[[2014,10,11]]}}}