{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T14:53:42Z","timestamp":1785336822901,"version":"3.55.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030925109","type":"print"},{"value":"9783030925116","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92511-6_1","type":"book-chapter","created":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T14:05:12Z","timestamp":1638885912000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A TTL-based Approach for\u00a0Content Placement in\u00a0Edge Networks"],"prefix":"10.1007","author":[{"given":"Nitish K.","family":"Panigrahy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Faheem","family":"Zafari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Don","family":"Towsley","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,12,8]]},"reference":[{"issue":"3","key":"1_CR1","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1109\/TNET.2013.2261542","volume":"22","author":"N Abedini","year":"2014","unstructured":"Abedini, N., Shakkottai, S.: Content caching and scheduling in wireless networks with elastic and inelastic traffic. IEEE\/ACM Trans. Netw. 22(3), 864\u2013874 (2014)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"1_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-11657-9","volume-title":"Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences","author":"F Baccelli","year":"2013","unstructured":"Baccelli, F., Br\u00e9maud, P.: Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences, vol. 26. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-662-11657-9"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.peva.2014.07.001","volume":"79","author":"DS Berger","year":"2014","unstructured":"Berger, D.S., Gland, P., Singla, S., Ciucu, F.: Exact analysis of TTL cache networks. Perf. Eval. 79, 2\u201323 (2014)","journal-title":"Perf. Eval."},{"key":"1_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"7","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1109\/JSAC.2002.801752","volume":"20","author":"H Che","year":"2002","unstructured":"Che, H., Tung, Y., Wang, Z.: Hierarchical web caching systems: modeling, design and experimental results. IEEE J. Sel. Areas Commun. 20(7), 1305\u20131314 (2002)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"1_CR6","unstructured":"Cisco, V.: Cisco Visual Networking Index: Forecast and Methodology 2014\u20132019 White Paper. Technical Report, Cisco (2015)"},{"key":"1_CR7","volume-title":"Operating Systems Theory","author":"EG Coffman","year":"1973","unstructured":"Coffman, E.G., Denning, P.J.: Operating Systems Theory, vol. 973. Prentice-Hall, Englewood Cliffs (1973)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Dehghan, M., Massoulie, L., Towsley, D., Menasche, D., Tay, Y.: A utility optimization approach to network cache design. In: Proceedings of IEEE INFOCOM (2016)","DOI":"10.1109\/INFOCOM.2016.7524445"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Dehghan, M., et al.: On the complexity of optimal routing and content caching in heterogeneous networks. In: Proceedings of IEEE INFOCOM, pp. 936\u2013944 (2015)","DOI":"10.1109\/INFOCOM.2015.7218465"},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/S0022-0000(77)80014-7","volume":"14","author":"R Fagin","year":"1977","unstructured":"Fagin, R.: Asymptotic miss ratios over independent references. J. Comput. Syst. Sci. 14(2), 222\u2013250 (1977)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR11","unstructured":"Feldman, M., Chuang, J.: Service differentiation in web caching and content distribution. In: Proceedings of CCN (2002)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Ferragut, A., Rodr\u00edguez, I., Paganini, F.: Optimizing TTL caches under heavy-tailed demands. In: Proceedings of ACM SIGMETRICS (2016)","DOI":"10.1145\/2896377.2901459"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.comnet.2014.03.006","volume":"65","author":"NC Fofack","year":"2014","unstructured":"Fofack, N.C., Nain, P., Neglia, G., Towsley, D.: Performance evaluation of hierarchical TTL-based cache networks. Comput. Netw. 65, 212\u2013231 (2014)","journal-title":"Comput. Netw."},{"issue":"3","key":"1_CR14","first-page":"12","volume":"1","author":"M Garetto","year":"2016","unstructured":"Garetto, M., Leonardi, E., Martina, V.: A unified approach to the performance analysis of caching systems. ACM TOMPECS 1(3), 12 (2016)","journal-title":"ACM TOMPECS"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Gast, N., Houdt, B.V.: Asymptotically exact TTL-approximations of the cache replacement algorithms LRU(m) and h-LRU. In: ITC, vol. 28 (2016)","DOI":"10.1109\/ITC-28.2016.128"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Ioannidis, S., Yeh, E.: Adaptive caching networks with optimality guarantees. In: Proceedings of ACM SIGMETRICS, pp. 113\u2013124 (2016)","DOI":"10.1145\/2964791.2901467"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Ioannidis, S., Yeh, E.: Jointly optimal routing and caching for arbitrary network topologies. In: Proceedings of ACM ICN, pp. 77\u201387 (2017)","DOI":"10.1145\/3125719.3125730"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Jiang, W., Ioannidis, S., Massouli\u00e9, L., Picconi, F.: Orchestrating massively distributed CDNs. In: Proceedings of ACM CoNEXT, pp. 133\u2013144 (2012)","DOI":"10.1145\/2413176.2413193"},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/BF01586095","volume":"32","author":"J Kyparisis","year":"1985","unstructured":"Kyparisis, J.: On uniqueness of Kuhn-Tucker multipliers in nonlinear programming. Math. Program. 32(2), 242\u2013246 (1985)","journal-title":"Math. Program."},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Li, J., et al.: DR-cache: distributed resilient caching with latency guarantees. In: Proceedings of IEEE INFOCOM (2018)","DOI":"10.1109\/INFOCOM.2018.8486316"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Panigrahy, N.K., Li, J., Towsley, D.: Hit rate vs. hit probability based cache utility maximization. In: Proceedings of ACM MAMA (2017)","DOI":"10.1145\/3152042.3152050"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Panigrahy, N.K., Li, J., Towsley, D.: Network cache design under stationary requests: exact analysis and poisson approximation. In: Proceedings of IEEE MASCOTS (2018)","DOI":"10.1109\/MASCOTS.2018.00033"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Ramadan, E., Narayanan, A., Zhang, Z.L., Li, R., Zhang, G.: Big cache abstraction for cache networks. In: Proceedings Of IEEE ICDCS (2017)","DOI":"10.1109\/ICDCS.2017.306"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez, I., Ferragut, A., Paganini, F.: Improving performance of multiple-level cache systems. In: SIGCOMM (2016)","DOI":"10.1145\/2940116.2940119"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Rosensweig, E.J., Kurose, J., Towsley, D.: Approximate models for general cache networks. In: Proceedings of IEEE INFOCOM (2010)","DOI":"10.1109\/INFCOM.2010.5461936"},{"key":"1_CR26","volume-title":"Communication Networks: an Optimization, Control, and Stochastic Networks Perspective","author":"R Srikant","year":"2013","unstructured":"Srikant, R., Ying, L.: Communication Networks: an Optimization, Control, and Stochastic Networks Perspective. Cambridge University Press, Cambridge (2013)"},{"issue":"9","key":"1_CR27","doi-asserted-by":"publisher","first-page":"4286","DOI":"10.1109\/TW.2013.072313.120739","volume":"12","author":"G Tychogiorgos","year":"2013","unstructured":"Tychogiorgos, G., Gkelias, A., Leung, K.K.: A non-convex distributed optimization framework and its application to wireless ad-hoc networks. IEEE Trans. Wirel. Commun 12(9), 4286\u20134296 (2013)","journal-title":"IEEE Trans. Wirel. Commun"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Vecer, J.: Dynamic scoring: probabilistic model selection based on utility maximization. In: SSRN (2018)","DOI":"10.2139\/ssrn.3276544"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Performance Evaluation Methodologies and Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92511-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T19:13:35Z","timestamp":1639163615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92511-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030925109","9783030925116"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92511-6_1","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"value":"1867-8211","type":"print"},{"value":"1867-822X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"8 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VALUETOOLS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EAI International Conference on Performance Evaluation Methodologies and Tools","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"valuetools2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}