Application launch time is an important performance metric to user experience in desktop environment. The launch time mostly depends on the performance of secondary storage. There is a cost-performance trade-off in using hard disk drive (HDD) or solid-state drive (SSD). Thus, application launch times can be reduced by utilizing SSDs as caches for slow HDDs. We propose a new SSD caching scheme which migrates data blocks from HDDs to SSDs. Since our scheme operates entirely in the file system level and does not require an extra layer for mapping SSD-cached data, which is essential in most other schemes, our scheme does not incur mapping overheads that cause significant burdens on main memory, CPU, and SSD cache itself. Experimental results demonstrate our scheme yields 56% of performance gain in application launch.
{"title":"File-system-level flash caching for improving application launch time on logical hybrid disks","authors":"Chang-Hycok Han, Junhee Ryu, Dongeun Lee, Jaemyoun Lee, Kyungtae Kang, Heonshik Shin","doi":"10.1109/PCCC.2014.7017019","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017019","url":null,"abstract":"Application launch time is an important performance metric to user experience in desktop environment. The launch time mostly depends on the performance of secondary storage. There is a cost-performance trade-off in using hard disk drive (HDD) or solid-state drive (SSD). Thus, application launch times can be reduced by utilizing SSDs as caches for slow HDDs. We propose a new SSD caching scheme which migrates data blocks from HDDs to SSDs. Since our scheme operates entirely in the file system level and does not require an extra layer for mapping SSD-cached data, which is essential in most other schemes, our scheme does not incur mapping overheads that cause significant burdens on main memory, CPU, and SSD cache itself. Experimental results demonstrate our scheme yields 56% of performance gain in application launch.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131133593","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017037
Haijun Geng, Xingang Shi, Xia Yin, Zhiliang Wang, Han Zhang, Jiangyuan Yao
The Internet is playing an increasingly crucial role in both personal and business activities. Handling link failures is an important task in designing routing protocols. To enhance the network availability without incurring significant extra overhead, we propose a novel link protection algorithm, Hybrid Link Protection Scheme (HLP) to achieve failure resilient routing.
互联网在个人和商业活动中发挥着越来越重要的作用。链路故障处理是路由协议设计中的一项重要任务。为了在不增加额外开销的情况下提高网络的可用性，我们提出了一种新的链路保护算法——混合链路保护方案(Hybrid link protection Scheme, HLP)来实现故障弹性路由。
{"title":"A hybrid link protection scheme for link-state routing networks","authors":"Haijun Geng, Xingang Shi, Xia Yin, Zhiliang Wang, Han Zhang, Jiangyuan Yao","doi":"10.1109/PCCC.2014.7017037","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017037","url":null,"abstract":"The Internet is playing an increasingly crucial role in both personal and business activities. Handling link failures is an important task in designing routing protocols. To enhance the network availability without incurring significant extra overhead, we propose a novel link protection algorithm, Hybrid Link Protection Scheme (HLP) to achieve failure resilient routing.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133905687","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017026
Yanwei Wu, Yun Wang
The area of the state of Oregon has 98,381 square miles, which is the 9th largest in United States. Its population ranks 27th in United States, and most of its population residents in the Willamette valley, a narrow area north to Portland and south to eugene and home to eight of ten most populous cities in Oregon. This implies that most of Oregon are rural areas. It is necessary to design and deploy a portable intelligent system to monitor the danger and protect drivers' safety. In this paper, we will introduce the design of our portable intelligent flooding monitor system. We deploy sensors to roadside and/or vehicles. The flood alert will be sent to central control office or vehicles accessing the network.
{"title":"A portable flood detection system using heterogeneous sensor networks","authors":"Yanwei Wu, Yun Wang","doi":"10.1109/PCCC.2014.7017026","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017026","url":null,"abstract":"The area of the state of Oregon has 98,381 square miles, which is the 9th largest in United States. Its population ranks 27th in United States, and most of its population residents in the Willamette valley, a narrow area north to Portland and south to eugene and home to eight of ten most populous cities in Oregon. This implies that most of Oregon are rural areas. It is necessary to design and deploy a portable intelligent system to monitor the danger and protect drivers' safety. In this paper, we will introduce the design of our portable intelligent flooding monitor system. We deploy sensors to roadside and/or vehicles. The flood alert will be sent to central control office or vehicles accessing the network.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115477220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017071
Lijuan Cao, M. Grabchak
Mobility models are crucial for the simulation and evaluation of protocols for multihop wireless networks. However, most commonly used mobility models do not reflect the way humans actually move. This significantly affects the reliability of simulation results. In this paper we introduce a new mobility model called the Smoothly Truncated Levy Walk (STLW), which is more realistic than most standard models that appear in the literature. Its main innovations are as follows. First, to take into account dependencies in the direction of motion, it models changes in the direction instead of the standard approach, which directly models the direction and ignores these dependencies. Second, it uses realistic models for pause times, flight lengths, and changes in direction. In particular, it uses tempered stable distributions to model pause times and flight lengths and the beta distribution to model changes in direction. We justify the use of these distributions from both a theoretical and an empirical perspective. In particular, we perform a trace-based validation on several real-world traces from various scenarios. Validation results show that this model is very flexible and can be used to model human movements in a variety of situations.
{"title":"Smoothly truncated levy walks: Toward a realistic mobility model","authors":"Lijuan Cao, M. Grabchak","doi":"10.1109/PCCC.2014.7017071","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017071","url":null,"abstract":"Mobility models are crucial for the simulation and evaluation of protocols for multihop wireless networks. However, most commonly used mobility models do not reflect the way humans actually move. This significantly affects the reliability of simulation results. In this paper we introduce a new mobility model called the Smoothly Truncated Levy Walk (STLW), which is more realistic than most standard models that appear in the literature. Its main innovations are as follows. First, to take into account dependencies in the direction of motion, it models changes in the direction instead of the standard approach, which directly models the direction and ignores these dependencies. Second, it uses realistic models for pause times, flight lengths, and changes in direction. In particular, it uses tempered stable distributions to model pause times and flight lengths and the beta distribution to model changes in direction. We justify the use of these distributions from both a theoretical and an empirical perspective. In particular, we perform a trace-based validation on several real-world traces from various scenarios. Validation results show that this model is very flexible and can be used to model human movements in a variety of situations.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122559903","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017107
Xinlei Wang, Hao Fu, Chao Xu, P. Mohapatra
With the proliferation of sensor-embedded mobile computing devices, mobile sensing is becoming a popular paradigm to collect information from participating mobile users. Unlike the well-calibrated and well-tested sensor networks, mobile sensing relies on participants with unknown reliability. Data collected from mobile users may be untrustworthy. There are various solutions proposed in the literature for assessing the trustworthiness of the sensing data that describe an individual event or observation. In addition to single-event based trust models, we propose the concept of Provenance Logic, to reason about the logical relations between multiple events by jointly recognizing and linking events from successive sensing observations. We propose an approach that combines logical reasoning and statistical learning techniques. To the best of our knowledge, our work is the first attempt for trust evaluation based on the logical relation among multiple events in the mobile sensing context. We motivate and illustrate our approach with a use case of traffic monitoring mobile sensing. Performance validation has shown that improved trust assessment can be achieved efficiently and effectively on top of single-event based analysis.
{"title":"Provenance logic: Enabling multi-event based trust in mobile sensing","authors":"Xinlei Wang, Hao Fu, Chao Xu, P. Mohapatra","doi":"10.1109/PCCC.2014.7017107","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017107","url":null,"abstract":"With the proliferation of sensor-embedded mobile computing devices, mobile sensing is becoming a popular paradigm to collect information from participating mobile users. Unlike the well-calibrated and well-tested sensor networks, mobile sensing relies on participants with unknown reliability. Data collected from mobile users may be untrustworthy. There are various solutions proposed in the literature for assessing the trustworthiness of the sensing data that describe an individual event or observation. In addition to single-event based trust models, we propose the concept of Provenance Logic, to reason about the logical relations between multiple events by jointly recognizing and linking events from successive sensing observations. We propose an approach that combines logical reasoning and statistical learning techniques. To the best of our knowledge, our work is the first attempt for trust evaluation based on the logical relation among multiple events in the mobile sensing context. We motivate and illustrate our approach with a use case of traffic monitoring mobile sensing. Performance validation has shown that improved trust assessment can be achieved efficiently and effectively on top of single-event based analysis.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122083579","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017102
Meng Shen, Lixin Gao, Ke Xu, Liehuang Zhu
In public cloud networks, applications of different tenants compete for the shared network bandwidth and thus might suffer from unpredictable performance. It is desirable for cloud providers to offer tenants with bandwidth guarantees. However, it is challenging to precisely abstract tenant bandwidth requirements for their intra- and inter-tenant communications and to achieve work conservation simultaneously. In this paper, we first propose a dual-hose model, a novel tenant requirement abstraction that decouples bandwidth guarantees for a tenant's inter-tenant communications from those for its intra-tenant communications. We then develop a new VM placement algorithm to optimize operational goals of cloud providers, while providing tenants with minimum bandwidth guarantees captured by the dual-hose model. Finally, we design a dynamic bandwidth allocation strategy to achieve work conservation. Through extensive simulation results, we show that our solution provides bandwidth guarantees for tenant requests while improving the overall request throughput by 5.3%.
{"title":"Achieving bandwidth guarantees in multi-tenant cloud networks using a dual-hose model","authors":"Meng Shen, Lixin Gao, Ke Xu, Liehuang Zhu","doi":"10.1109/PCCC.2014.7017102","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017102","url":null,"abstract":"In public cloud networks, applications of different tenants compete for the shared network bandwidth and thus might suffer from unpredictable performance. It is desirable for cloud providers to offer tenants with bandwidth guarantees. However, it is challenging to precisely abstract tenant bandwidth requirements for their intra- and inter-tenant communications and to achieve work conservation simultaneously. In this paper, we first propose a dual-hose model, a novel tenant requirement abstraction that decouples bandwidth guarantees for a tenant's inter-tenant communications from those for its intra-tenant communications. We then develop a new VM placement algorithm to optimize operational goals of cloud providers, while providing tenants with minimum bandwidth guarantees captured by the dual-hose model. Finally, we design a dynamic bandwidth allocation strategy to achieve work conservation. Through extensive simulation results, we show that our solution provides bandwidth guarantees for tenant requests while improving the overall request throughput by 5.3%.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123273169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017112
Hengky Susanto, Bhanu Kaushik, Benyuan Liu, Byung-Guk Kim
Cellular Network Providers (CNP) provide users with wireless data access to meet the growing ubiquitous demand for the Internet. As users subscribe to a fixed data plan for a monthly flat fee, some users may exhaust their data allowance before the end of the billing cycle, while others underutilize their monthly quota. To take advantage of such underutilization, Khausik et. al. propose a mechanism for ad hoc bandwidth redistribution that allows subscribers to sell their unused bandwidth to users needing Internet access in exchange for some financial compensation as and when opportunities arise. There exists a popular belief that allowing such on-demand ad hoc service is not beneficial to CNP. This paper seeks to address and counter this opinion by proposing a pricing scheme and a revenue sharing mechanism that makes the provision of ad hoc connection advantageous to CNP. Our revenue sharing mechanism provides economic incentives to CNP. The simulation results show that our revenue sharing model ensures that CNP receives the majority portion of the revenue gained, regardless of the amount. Secondly, our pricing model ensures traffic from ad hoc users has minimal impact on the connection quality of current subscribers. In this model, we use Shapley value as the basis for deriving the revenue sharing.
{"title":"Pricing and revenue sharing mechanism for secondary redistribution of data service for mobile devices","authors":"Hengky Susanto, Bhanu Kaushik, Benyuan Liu, Byung-Guk Kim","doi":"10.1109/PCCC.2014.7017112","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017112","url":null,"abstract":"Cellular Network Providers (CNP) provide users with wireless data access to meet the growing ubiquitous demand for the Internet. As users subscribe to a fixed data plan for a monthly flat fee, some users may exhaust their data allowance before the end of the billing cycle, while others underutilize their monthly quota. To take advantage of such underutilization, Khausik et. al. propose a mechanism for ad hoc bandwidth redistribution that allows subscribers to sell their unused bandwidth to users needing Internet access in exchange for some financial compensation as and when opportunities arise. There exists a popular belief that allowing such on-demand ad hoc service is not beneficial to CNP. This paper seeks to address and counter this opinion by proposing a pricing scheme and a revenue sharing mechanism that makes the provision of ad hoc connection advantageous to CNP. Our revenue sharing mechanism provides economic incentives to CNP. The simulation results show that our revenue sharing model ensures that CNP receives the majority portion of the revenue gained, regardless of the amount. Secondly, our pricing model ensures traffic from ad hoc users has minimal impact on the connection quality of current subscribers. In this model, we use Shapley value as the basis for deriving the revenue sharing.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131737890","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017039
Abdullah Al Hasib, N. Nikitin, L. Natvig
The advent of innovative power generation and storage systems introduces new opportunities of cost minimization for the demand response (DR) algorithms in smart grid (SG) technology. Conventional DR algorithms consider unidirectional flow of energy from power grid to the residential building. In this paper, we study an extended model of a smart residential building with hybrid energy system (e.g. connected with traditional electric grid and renewable energy sources) and bidirectional energy trading facility. This model not only allows a user to reduce the energy cost by storing the energy for the future usage, but also permits the user to earn revenue by selling surplus energy to the grid. Furthermore, we discuss an appliance-scheduling algorithm for the extended DR model.
{"title":"Load scheduling in smart buildings with bidirectional energy trading","authors":"Abdullah Al Hasib, N. Nikitin, L. Natvig","doi":"10.1109/PCCC.2014.7017039","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017039","url":null,"abstract":"The advent of innovative power generation and storage systems introduces new opportunities of cost minimization for the demand response (DR) algorithms in smart grid (SG) technology. Conventional DR algorithms consider unidirectional flow of energy from power grid to the residential building. In this paper, we study an extended model of a smart residential building with hybrid energy system (e.g. connected with traditional electric grid and renewable energy sources) and bidirectional energy trading facility. This model not only allows a user to reduce the energy cost by storing the energy for the future usage, but also permits the user to earn revenue by selling surplus energy to the grid. Furthermore, we discuss an appliance-scheduling algorithm for the extended DR model.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127518578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017067
Cheng Bo, Lan Zhang, Taeho Jung, Junze Han, Xiangyang Li, Yang Wang
With the increased popularity of smartphones, various security threats and privacy leakages targeting them are discovered and investigated. In this work, we present SilentSense, a framework to authenticate users silently and transparently by exploiting dynamics mined from the user touch behavior biometrics and the micro-movement of the device caused by user's screen-touch actions. We build a “touch-based biometrics” model of the owner by extracting some principle features, and then verify whether the current user is the owner or guest/attacker. When using the smartphone, some unique operating dynamics of the user is detected and learnt by collecting the sensor data and touch events silently. When users are mobile, the micro-movement of mobile devices caused by touch is suppressed by that due to the large scale user-movement which will render the touch-based biometrics ineffective. To address this, we integrate a movement-based biometrics for each user with previous touch-based biometrics. We conduct extensive evaluations of our approaches on the Android smartphone, we show that the user identification accuracy is over 99%.
{"title":"Continuous user identification via touch and movement behavioral biometrics","authors":"Cheng Bo, Lan Zhang, Taeho Jung, Junze Han, Xiangyang Li, Yang Wang","doi":"10.1109/PCCC.2014.7017067","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017067","url":null,"abstract":"With the increased popularity of smartphones, various security threats and privacy leakages targeting them are discovered and investigated. In this work, we present SilentSense, a framework to authenticate users silently and transparently by exploiting dynamics mined from the user touch behavior biometrics and the micro-movement of the device caused by user's screen-touch actions. We build a “touch-based biometrics” model of the owner by extracting some principle features, and then verify whether the current user is the owner or guest/attacker. When using the smartphone, some unique operating dynamics of the user is detected and learnt by collecting the sensor data and touch events silently. When users are mobile, the micro-movement of mobile devices caused by touch is suppressed by that due to the large scale user-movement which will render the touch-based biometrics ineffective. To address this, we integrate a movement-based biometrics for each user with previous touch-based biometrics. We conduct extensive evaluations of our approaches on the Android smartphone, we show that the user identification accuracy is over 99%.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"92 16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128853513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-07-31DOI: 10.1109/PCCC.2014.7017072
Junze Han, Xiangyang Li, Taeho Jung, Junmin Zhao, Z. Zhao
For mobile devices, communication via cellular networks consumes more energy than via WiFi networks, and suffers an expensive limited data plan. On the other hand, as the coverage and the density of WiFI networks are smaller than those of the cellular networks, users cannot purely rely on WiFi to access the Internet. In this work we present a behavior-aware and preference-based approach to prefetch news webpages for the user to visit in the near future, by exploiting the WiFi network connections to reduce the energy and monetary cost. We first design an efficient preference learning algorithm to keep track of the user's changing interests, and then by predicting the appearance and durations of the WiFi network connections, our prefetch approach optimizes when to prefetch to maximize the user experience while lowing the prefetch cost. Our prefetch approach also exploits the idle period of WiFi connections to reduce the tail-energy consumption. We implement our approach in iPhone and our extensive evaluations show that our system achieves about 60% hit ratio, saves about 50% cellular data usage, and reduces the energy cost by 7%.
{"title":"Network agile preference-based prefetching for mobile devices","authors":"Junze Han, Xiangyang Li, Taeho Jung, Junmin Zhao, Z. Zhao","doi":"10.1109/PCCC.2014.7017072","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017072","url":null,"abstract":"For mobile devices, communication via cellular networks consumes more energy than via WiFi networks, and suffers an expensive limited data plan. On the other hand, as the coverage and the density of WiFI networks are smaller than those of the cellular networks, users cannot purely rely on WiFi to access the Internet. In this work we present a behavior-aware and preference-based approach to prefetch news webpages for the user to visit in the near future, by exploiting the WiFi network connections to reduce the energy and monetary cost. We first design an efficient preference learning algorithm to keep track of the user's changing interests, and then by predicting the appearance and durations of the WiFi network connections, our prefetch approach optimizes when to prefetch to maximize the user experience while lowing the prefetch cost. Our prefetch approach also exploits the idle period of WiFi connections to reduce the tail-energy consumption. We implement our approach in iPhone and our extensive evaluations show that our system achieves about 60% hit ratio, saves about 50% cellular data usage, and reduces the energy cost by 7%.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"75 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133140299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：