乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T15:33:18Z","timestamp":1720279998172},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer Communications"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1016\/j.comcom.2018.07.014","type":"journal-article","created":{"date-parts":[[2018,7,18]],"date-time":"2018-07-18T13:51:31Z","timestamp":1531921891000},"page":"46-59","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Modeling data backups as a batch-service queue with vacations and exhaustive policy"],"prefix":"10.1016","volume":"128","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-7401-1974","authenticated-orcid":false,"given":"Apoorv","family":"Saxena","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7666-2479","authenticated-orcid":false,"given":"Dieter","family":"Claeys","sequence":"additional","affiliation":[]},{"given":"Herwig","family":"Bruneel","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Joris","family":"Walraevens","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"C","key":"10.1016\/j.comcom.2018.07.014_bib0001","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.entcs.2015.10.025","article-title":"Operating policies for energy efficient dynamic server allocation","volume":"318","author":"Nguyen","year":"2015","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.comcom.2018.07.014_bib0002","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.comcom.2015.05.003","article-title":"Energy efficient virtual network embedding for green data centers using data center topology and future migration","volume":"69","author":"Guan","year":"2015","journal-title":"Comput. Commun."},{"key":"10.1016\/j.comcom.2018.07.014_bib0003","series-title":"Proceedings of the 2015 International Conference on Applied Science and Engineering Innovation","first-page":"659","article-title":"Research on the cloud storage security in big data era","volume":"12","author":"Chen","year":"2015"},{"key":"10.1016\/j.comcom.2018.07.014_bib0004","unstructured":"Amazon, Amazon web service s3, 2017, (https:\/\/aws.amazon.com\/s3\/)."},{"key":"10.1016\/j.comcom.2018.07.014_bib0005","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.future.2015.10.003","article-title":"A model to compare cloud and non-cloud storage of big data","volume":"57","author":"Chang","year":"2016","journal-title":"Future Gener. Comput. Syst. Int. J. Esci."},{"key":"10.1016\/j.comcom.2018.07.014_bib0006","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.comcom.2018.04.017","article-title":"Quantitative quality estimation of cloud-based streaming services","volume":"125","author":"Yu","year":"2018","journal-title":"Comput. Commun."},{"key":"10.1016\/j.comcom.2018.07.014_bib0007","series-title":"2014 Proceedings of the IEEE INFOCOM","first-page":"1644","article-title":"Distributed backup scheduling: modeling and optimization","author":"Van de Ven","year":"2014"},{"key":"10.1016\/j.comcom.2018.07.014_bib0008","series-title":"Proceedings of the Forty-Fourth Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2014, Atlanta, GA, USA","first-page":"660","article-title":"A Markov decision process approach for optimal data backup scheduling","author":"Xia","year":"2014"},{"issue":"1","key":"10.1016\/j.comcom.2018.07.014_bib0009","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01149327","article-title":"Queueing systems with vacations \u2014 a survey","volume":"1","author":"Doshi","year":"1986","journal-title":"Queueing Syst."},{"key":"10.1016\/j.comcom.2018.07.014_bib0010","series-title":"Vacation Queueing Models","author":"Naishuo","year":"2006"},{"issue":"11","key":"10.1016\/j.comcom.2018.07.014_bib0011","doi-asserted-by":"crossref","first-page":"2861","DOI":"10.1016\/j.camwa.2008.07.034","article-title":"On the batch arrival batch service queue with finite buffer under server\u2019s vacation: MX\/GY\/1\/N queue","volume":"56","author":"Sikdar","year":"2008","journal-title":"Comput. Math. Appl."},{"issue":"10","key":"10.1016\/j.comcom.2018.07.014_bib0012","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1016\/j.apm.2005.02.013","article-title":"Steady state analysis of a bulk queue with multiple vacations, setup times with n-policy and closedown times","volume":"29","author":"Arumuganathan","year":"2005","journal-title":"Appl. Math. Model."},{"issue":"4","key":"10.1016\/j.comcom.2018.07.014_bib0013","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1016\/j.cor.2003.09.007","article-title":"Analytic and numerical aspects of batch service queues with single vacation","volume":"32","author":"Sikdar","year":"2005","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.comcom.2018.07.014_bib0014","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0307-904X(92)90113-H","article-title":"On a batch service queue with single vacation","volume":"16","author":"Lee","year":"1992","journal-title":"Appl. Math. Model."},{"key":"10.1016\/j.comcom.2018.07.014_bib0015","series-title":"Discrete-Time models for communication systems including ATM","author":"Bruneel","year":"1992"},{"issue":"1","key":"10.1016\/j.comcom.2018.07.014_bib0016","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ress.2004.11.001","article-title":"Optimization for condition-based maintenance with semi-Markov decision process","volume":"90","author":"Chen","year":"2005","journal-title":"Reliab. Eng. Syst. Saf."},{"key":"10.1016\/j.comcom.2018.07.014_bib0017","unstructured":"Microsoft, Microsoft azure storage, 2017, (https:\/\/azure.microsoft.com\/)."},{"key":"10.1016\/j.comcom.2018.07.014_bib0018","series-title":"Proceedings of the International Conference on Numerical Analysis and Applied Mathematics","article-title":"A queueing-theoretic analysis of the threshold-based exhaustive data-backup scheduling policy","author":"Claeys","year":"2016"},{"key":"10.1016\/j.comcom.2018.07.014_bib0019","unstructured":"host-it, 2018, (http:\/\/www.host-it.ie\/online-backup\/)."},{"key":"10.1016\/j.comcom.2018.07.014_sbref0017","series-title":"Data processing","author":"Fry","year":"2013"},{"key":"10.1016\/j.comcom.2018.07.014_sbref0018","series-title":"Handbook of Big Data Technologies","author":"Zomaya","year":"2017"},{"key":"10.1016\/j.comcom.2018.07.014_bib0022","unstructured":"D. Boullery, A. Sch\u00f6rgendorfer, P. Van de Ven, B. Zhang, Balanced distributed backup scheduling, 2016. US Patent 9,244,777. URL https:\/\/www.google.com\/patents\/US9244777."},{"key":"10.1016\/j.comcom.2018.07.014_bib0023","series-title":"Proceedings of the IEEE Twenty-Fourth Annual Joint Conference of the IEEE Computer and Communications Societies.","first-page":"2235","article-title":"Network coding for large scale content distribution","volume":"4","author":"Gkantsidis","year":"2005"},{"key":"10.1016\/j.comcom.2018.07.014_bib0024","unstructured":"Druva, 2018, (https:\/\/www.druva.com\/blog\/understanding-rpo-and-rto\/)."},{"issue":"2","key":"10.1016\/j.comcom.2018.07.014_bib0025","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/opre.34.2.267","article-title":"The bulk service queue with a general control strategy: theoretical analysis and a new computational procedure","volume":"34","author":"Powell","year":"1986","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.comcom.2018.07.014_bib0026","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.orl.2005.05.012","article-title":"On the application of Rouche\u2019s theorem in queueing theory","volume":"34","author":"Adan","year":"2006","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.comcom.2018.07.014_bib0027","series-title":"Applied Discrete-Time Queues","author":"Alfa","year":"2015"},{"issue":"4","key":"10.1016\/j.comcom.2018.07.014_sbref0023","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1214\/aoms\/1177706108","article-title":"A proof of Wald\u2019s theorem on cumulative sums","volume":"30","author":"Johnson","year":"1959","journal-title":"Ann. Math. Stat."},{"issue":"2","key":"10.1016\/j.comcom.2018.07.014_bib0029","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/TIT.2011.2173713","article-title":"Delay bounds in communication networks with heavy-tailed and self-similar traffic","volume":"58","author":"Liebeherr","year":"2012","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366418302901?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366418302901?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,8,23]],"date-time":"2018-08-23T04:32:23Z","timestamp":1534998743000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366418302901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":29,"alternative-id":["S0140366418302901"],"URL":"https:\/\/doi.org\/10.1016\/j.comcom.2018.07.014","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[2018,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Modeling data backups as a batch-service queue with vacations and exhaustive policy","name":"articletitle","label":"Article Title"},{"value":"Computer Communications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comcom.2018.07.014","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}