{"title":"具有内存和带宽限制的小型无线设备的浏览器缓存管理","authors":"Cheng-Zen Yang, Kun-Ming Tien, M. Wueng","doi":"10.1109/PDCAT.2003.1236321","DOIUrl":null,"url":null,"abstract":"As wireless networks become popular, Web surfing on mobile devices will be a hot Internet service in the near future. Mobile devices have two major constrains in their network bandwidth and memory size constraints. We propose a novel browser cache management mechanism in which a SAVUT-based gain function effectively decides the preservation value of cached objects. In addition, a partial caching mechanism is incorporated to extensively utilize the limited browser cache. Two SAVUT-based algorithms are presented to show the practical instances. The comparative simulation results are also elaborated. Although the conducted experiments are preliminary, the results show that PR-SAVUT best performs in most cases.","PeriodicalId":145111,"journal":{"name":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Browser cache management for small wireless devices with memory and bandwidth constraints\",\"authors\":\"Cheng-Zen Yang, Kun-Ming Tien, M. Wueng\",\"doi\":\"10.1109/PDCAT.2003.1236321\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As wireless networks become popular, Web surfing on mobile devices will be a hot Internet service in the near future. Mobile devices have two major constrains in their network bandwidth and memory size constraints. We propose a novel browser cache management mechanism in which a SAVUT-based gain function effectively decides the preservation value of cached objects. In addition, a partial caching mechanism is incorporated to extensively utilize the limited browser cache. Two SAVUT-based algorithms are presented to show the practical instances. The comparative simulation results are also elaborated. Although the conducted experiments are preliminary, the results show that PR-SAVUT best performs in most cases.\",\"PeriodicalId\":145111,\"journal\":{\"name\":\"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PDCAT.2003.1236321\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2003.1236321","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Browser cache management for small wireless devices with memory and bandwidth constraints
As wireless networks become popular, Web surfing on mobile devices will be a hot Internet service in the near future. Mobile devices have two major constrains in their network bandwidth and memory size constraints. We propose a novel browser cache management mechanism in which a SAVUT-based gain function effectively decides the preservation value of cached objects. In addition, a partial caching mechanism is incorporated to extensively utilize the limited browser cache. Two SAVUT-based algorithms are presented to show the practical instances. The comparative simulation results are also elaborated. Although the conducted experiments are preliminary, the results show that PR-SAVUT best performs in most cases.