Full metadata record

DC Field Value Language
dc.contributor.author Kim, Mingun ko
dc.contributor.author Cho, Hewon ko
dc.contributor.author Lee, Jemin ko
dc.contributor.author Hong, Seung-Eun ko
dc.date.accessioned 2021-01-29T07:28:18Z -
dc.date.available 2021-01-29T07:28:18Z -
dc.date.created 2021-01-14 -
dc.date.issued 2020-10-21 -
dc.identifier.citation 11th International Conference on Information and Communication Technology Convergence, ICTC 2020, pp.1039 - 1041 -
dc.identifier.isbn 9781728167589 -
dc.identifier.issn 2162-1233 -
dc.identifier.uri http://hdl.handle.net/20.500.11750/12890 -
dc.description.abstract In this paper, we consider a edge computing (EC)- enabled heterogeneous network. By using tools from stochastic geometry and queuing theory, we derive the service probability. Then, we formulate the service probability maximization problem with respect to (w.r.t.) the service caching decision. By using successive convex approximation (SCA), we obtain a stationary point of the non-convex problem. Finally, by using numerical results, we show the proposed solution achieves a higher service probability than the baseline schemes. © 2020 IEEE. -
dc.language English -
dc.publisher IEEE Computer Society -
dc.title Service Caching for Edge Computing-Enabled Heterogeneous Networks -
dc.type Conference -
dc.identifier.doi 10.1109/ICTC49870.2020.9289544 -
dc.identifier.scopusid 2-s2.0-85098970089 -
dc.type.local Article(Overseas) -
dc.type.rims CONF -
dc.description.journalClass 1 -
dc.contributor.localauthor Lee, Jemin -
dc.contributor.nonIdAuthor Hong, Seung-Eun -
dc.identifier.citationStartPage 1039 -
dc.identifier.citationEndPage 1041 -
dc.identifier.citationTitle 11th International Conference on Information and Communication Technology Convergence, ICTC 2020 -
dc.identifier.conferencecountry KO -
dc.identifier.conferencelocation 제주 -

qrcode mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.