Show simple item record

dc.contributor.authorVarshney, Lav R.en_US
dc.contributor.authorKusuma, Juliusen_US
dc.contributor.authorGoyal, Vivek K.en_US
dc.date.accessioned2020-02-03T14:21:08Z
dc.date.available2020-02-03T14:21:08Z
dc.date.issued2016-12-01
dc.identifierhttp://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000391694500005&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=6e74115fe3da270499c3d65c9b17d654
dc.identifier.citationLav R Varshney, Julius Kusuma, Vivek K Goyal. 2016. "Malleable Coding for Updatable Cloud Caching." IEEE TRANSACTIONS ON COMMUNICATIONS, Volume 64, Issue 12, pp. 4946 - 4955 (10). https://doi.org/10.1109/TCOMM.2016.2613971
dc.identifier.issn0090-6778
dc.identifier.issn1558-0857
dc.identifier.urihttps://hdl.handle.net/2144/39228
dc.description.abstractIn software-as-a-service applications provisioned through cloud computing, locally cached data are often modified with updates from new versions. In some cases, with each edit, one may want to preserve both the original and new versions. In this paper, we focus on cases in which only the latest version must be preserved. Furthermore, it is desirable for the data to not only be compressed but to also be easily modified during updates, since representing information and modifying the representation both incur cost. We examine whether it is possible to have both compression efficiency and ease of alteration, in order to promote codeword reuse. In other words, we study the feasibility of a malleable and efficient coding scheme. The tradeoff between compression efficiency and malleability cost-the difficulty of synchronizing compressed versions-is measured as the length of a reused prefix portion. The region of achievable rates and malleability is found. Drawing from prior work on common information problems, we show that efficient data compression may not be the best engineering design principle when storing software-as-a-service data. In the general case, goals of efficiency and malleability are fundamentally in conflict.en_US
dc.description.sponsorshipThis work was supported in part by an NSF Graduate Research Fellowship (LRV), Grant CCR-0325774, and Grant CCF-0729069. This work was presented at the 2011 IEEE International Symposium on Information Theory [1] and the 2014 IEEE International Conference on Cloud Engineering [2]. The associate editor coordinating the review of this paper and approving it for publication was R. Thobaben. (CCR-0325774 - NSF Graduate Research Fellowship; CCF-0729069 - NSF Graduate Research Fellowship)en_US
dc.format.extentp. 4946 - 4955en_US
dc.languageEnglish
dc.language.isoen_US
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INCen_US
dc.relation.ispartofIEEE TRANSACTIONS ON COMMUNICATIONS
dc.subjectScience & technologyen_US
dc.subjectTelecommunicationsen_US
dc.subjectEngineeringen_US
dc.subjectCachingen_US
dc.subjectCloud computingen_US
dc.subjectCommon informationen_US
dc.subjectConcurrency controlen_US
dc.subjectData compressionen_US
dc.subjectMultiterminal source codingen_US
dc.subjectSide informationen_US
dc.subjectElectrical and electronic engineeringen_US
dc.subjectCommunications technologiesen_US
dc.titleMalleable coding for updatable cloud cachingen_US
dc.typeArticleen_US
dc.description.versionAccepted manuscripten_US
dc.identifier.doi10.1109/TCOMM.2016.2613971
pubs.elements-sourceweb-of-scienceen_US
pubs.notesEmbargo: Not knownen_US
pubs.organisational-groupBoston Universityen_US
pubs.organisational-groupBoston University, College of Engineeringen_US
pubs.organisational-groupBoston University, College of Engineering, Department of Electrical & Computer Engineeringen_US
pubs.publication-statusPublisheden_US
dc.identifier.mycv123370


This item appears in the following Collection(s)

Show simple item record