Pub Date : 2010-12-06DOI: 10.1109/GLOCOMW.2010.5700148
S. Yameogo, J. Palicot, L. Cariou
This paper proposes a new channel estimation technique for mobile radio multipath channels in the context of SC-FDMA1 [1],[2],[3],[4] system. SC-FDMA is currently adopted for mobile radio uplink communications in 3G LTE2 because of its low PAPR3. In this system, 1/7 SC-FDMA time symbols are dedicated to perform the channel estimation. This is sufficient when the channel can be considered as constant over the 7 symbol periods. But it is clear that transmission channel can change rapidly over time, typically when the user (UE) moves with an important enough velocity, thus introducing Doppler effect and therefore Inter-Carrier Interference (ICI). Our proposition deals with this situation, and consists in filtering the channel noise and ICI perturbation through a new transformed domain. This approach is based on the variation rate of the channel's frequency response and the nature of the noise and ICI component in the Transformed domain. The performances obtained are very convincing since we have up to 3 dB gain compared to the simple interpolation solution encountered in the literature.
{"title":"Mobile radio channels' estimation for SC-FDMA systems by means of adequate noise and inter-carrier interference filtering in a transformed domain","authors":"S. Yameogo, J. Palicot, L. Cariou","doi":"10.1109/GLOCOMW.2010.5700148","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700148","url":null,"abstract":"This paper proposes a new channel estimation technique for mobile radio multipath channels in the context of SC-FDMA1 [1],[2],[3],[4] system. SC-FDMA is currently adopted for mobile radio uplink communications in 3G LTE2 because of its low PAPR3. In this system, 1/7 SC-FDMA time symbols are dedicated to perform the channel estimation. This is sufficient when the channel can be considered as constant over the 7 symbol periods. But it is clear that transmission channel can change rapidly over time, typically when the user (UE) moves with an important enough velocity, thus introducing Doppler effect and therefore Inter-Carrier Interference (ICI). Our proposition deals with this situation, and consists in filtering the channel noise and ICI perturbation through a new transformed domain. This approach is based on the variation rate of the channel's frequency response and the nature of the noise and ICI component in the Transformed domain. The performances obtained are very convincing since we have up to 3 dB gain compared to the simple interpolation solution encountered in the literature.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114543982","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700197
Hongmei Deng, Yi Yang, Guang-yao Jin, R. Xu, Weisong Shi
Wireless Sensor Networks (WSNs) have undergone tremendous technological advances over the last few years, and a broad range of ubiquitous computing applications have been enabled in the area of distributed sensing and control areas. To fully achieve the potentials of WSNs, designing a reliable and secure routing mechanism becomes critical. The intent of this work is to incorporate theories of trust from social networks into sensor networks, and develop a Trust-Aware dynamic Routing Framework (TARF) in order to provide a reliable and trustworthy routing solution in the dynamic WSN environment. It is noted that the proposed TARF does not eliminate the utilization of any conventional cryptographic approaches, and it works as a complementary component to provide an advanced security solution to the imperfect WSN of today.
{"title":"Building a Trust-Aware dynamic routing solution for Wireless Sensor Networks","authors":"Hongmei Deng, Yi Yang, Guang-yao Jin, R. Xu, Weisong Shi","doi":"10.1109/GLOCOMW.2010.5700197","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700197","url":null,"abstract":"Wireless Sensor Networks (WSNs) have undergone tremendous technological advances over the last few years, and a broad range of ubiquitous computing applications have been enabled in the area of distributed sensing and control areas. To fully achieve the potentials of WSNs, designing a reliable and secure routing mechanism becomes critical. The intent of this work is to incorporate theories of trust from social networks into sensor networks, and develop a Trust-Aware dynamic Routing Framework (TARF) in order to provide a reliable and trustworthy routing solution in the dynamic WSN environment. It is noted that the proposed TARF does not eliminate the utilization of any conventional cryptographic approaches, and it works as a complementary component to provide an advanced security solution to the imperfect WSN of today.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115460374","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700345
S. Fernanda, S. Alexandre, R. Geraldo
In this paper, we present a Branch-and-price algorithm for solving the Optimal Topology Design Problem of complex networks, based on a tightened deterministic formulation for the problem. The algorithm, which incorporates a delayed column generation approach within a Branch-and-bound framework, was proven to work well, being capable of finding optimal topologies within very low computational times, for networks with up to 60 nodes and different budget ranges. The algorithm allowed us to conclude that, by modifying the budget size values in our optimization model, different network features are found in optimal solutions. Accordingly, the budget size plays a similar role played by the probability of addition or rewiring arcs in randomized procedures for generating network topologies.
{"title":"On the design of complex networks through a Branch-and-price algorithm","authors":"S. Fernanda, S. Alexandre, R. Geraldo","doi":"10.1109/GLOCOMW.2010.5700345","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700345","url":null,"abstract":"In this paper, we present a Branch-and-price algorithm for solving the Optimal Topology Design Problem of complex networks, based on a tightened deterministic formulation for the problem. The algorithm, which incorporates a delayed column generation approach within a Branch-and-bound framework, was proven to work well, being capable of finding optimal topologies within very low computational times, for networks with up to 60 nodes and different budget ranges. The algorithm allowed us to conclude that, by modifying the budget size values in our optimization model, different network features are found in optimal solutions. Accordingly, the budget size plays a similar role played by the probability of addition or rewiring arcs in randomized procedures for generating network topologies.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123166202","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700112
Tomoharu Imai, K. Horio, Takashi Ohno, Kazuki Matsui
On a Thin Client system, the user manipulates the server system and sees remote desktop images which are transferred over a network. However, it is difficult to use Thin Client systems on a mobile network, because the network bandwidth is insufficient to transfer the remote display image with sufficient frequency. In this study, we implement and evaluate an improved remote desktop system for mobile users that can detect a high motion zone (on the desktop), and automatically encode the detected zone into a video stream. Also we propose the scene detection method, which can optimize reducing the network bandwidth consumption depending on the situation. As a result, we show reducing the bandwidth consumption for the user can use Thin Client system on a 3G(HSPA)-like network offered narrow bandwidth comfortably.
{"title":"An adaptive desktop transfer protocol for mobile Thin Client","authors":"Tomoharu Imai, K. Horio, Takashi Ohno, Kazuki Matsui","doi":"10.1109/GLOCOMW.2010.5700112","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700112","url":null,"abstract":"On a Thin Client system, the user manipulates the server system and sees remote desktop images which are transferred over a network. However, it is difficult to use Thin Client systems on a mobile network, because the network bandwidth is insufficient to transfer the remote display image with sufficient frequency. In this study, we implement and evaluate an improved remote desktop system for mobile users that can detect a high motion zone (on the desktop), and automatically encode the detected zone into a video stream. Also we propose the scene detection method, which can optimize reducing the network bandwidth consumption depending on the situation. As a result, we show reducing the bandwidth consumption for the user can use Thin Client system on a 3G(HSPA)-like network offered narrow bandwidth comfortably.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121024221","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700100
Tarik Borogovac, M. Rahaim, J. Carruthers
The trend toward solid state lighting with white LEDs has motivated much research for using these devices to provide wireless broadband data communications. Much work in this area has attempted to fit VLC into currently dominant indoor lighting modes, which broadcast the light in a wide field to achieve uniform coverage throughout a room. In this paper we explore spotlighting, which is appropriate lighting for many scenarios, as an alternative for implementing high datarate VLC. We find that spotlighting VLC has several benefits over uniform lighting implementations, including enabling higher datarate densities within a room and less channel distortion. We also introduce a hybrid scheme that combines spotlighting with uniform lighting to provide wide area data coverage as well as high-datarate “white hot spots” where needed.
{"title":"Spotlighting for visible light communications and illumination","authors":"Tarik Borogovac, M. Rahaim, J. Carruthers","doi":"10.1109/GLOCOMW.2010.5700100","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700100","url":null,"abstract":"The trend toward solid state lighting with white LEDs has motivated much research for using these devices to provide wireless broadband data communications. Much work in this area has attempted to fit VLC into currently dominant indoor lighting modes, which broadcast the light in a wide field to achieve uniform coverage throughout a room. In this paper we explore spotlighting, which is appropriate lighting for many scenarios, as an alternative for implementing high datarate VLC. We find that spotlighting VLC has several benefits over uniform lighting implementations, including enabling higher datarate densities within a room and less channel distortion. We also introduce a hybrid scheme that combines spotlighting with uniform lighting to provide wide area data coverage as well as high-datarate “white hot spots” where needed.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121106465","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700348
S. Busanelli, G. Ferrari, V. Giorgio
In this paper, we consider the problem of disseminating data in Infrastructure-to-Vehicular (I2V) networks. In particular, given a fixed Road Side Unit (RSU) we evaluate the maximum amount of data that can be reliably transferred from the RSU to the vehicles passing in its proximity through a recently proposed multihop probabilistic broadcasting protocol, namely Irresponsible Forwarding (IF). In particular, referring to highway-like Vehicular Ad-Hoc Networks (VANETs), we first characterize a mobile scenario in such a way to make a direct comparison with a static scenario meaningful, taking into account a physical characterization of the network (e.g., in terms of vehicle spatial density). Then, we carry out a comparative investigation considering mobile and static IEEE 802.11 networking scenarios. Our results show that from a single packet perspective, the vehicles' mobility does not affect the behavior of the IF protocol, at least in the considered highway scenarios. However, different conclusions are reached when an information flow (i.e., a series of consecutive packets) is considered. In this context, we determine the maximum amount of data that can be transferred from the RSU to the mobile vehicles passing through a certain region of interest around the RSU.
{"title":"On the effects of mobility for efficient broadcast data dissemination in I2V networks","authors":"S. Busanelli, G. Ferrari, V. Giorgio","doi":"10.1109/GLOCOMW.2010.5700348","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700348","url":null,"abstract":"In this paper, we consider the problem of disseminating data in Infrastructure-to-Vehicular (I2V) networks. In particular, given a fixed Road Side Unit (RSU) we evaluate the maximum amount of data that can be reliably transferred from the RSU to the vehicles passing in its proximity through a recently proposed multihop probabilistic broadcasting protocol, namely Irresponsible Forwarding (IF). In particular, referring to highway-like Vehicular Ad-Hoc Networks (VANETs), we first characterize a mobile scenario in such a way to make a direct comparison with a static scenario meaningful, taking into account a physical characterization of the network (e.g., in terms of vehicle spatial density). Then, we carry out a comparative investigation considering mobile and static IEEE 802.11 networking scenarios. Our results show that from a single packet perspective, the vehicles' mobility does not affect the behavior of the IF protocol, at least in the considered highway scenarios. However, different conclusions are reached when an information flow (i.e., a series of consecutive packets) is considered. In this context, we determine the maximum amount of data that can be transferred from the RSU to the mobile vehicles passing through a certain region of interest around the RSU.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127101137","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700447
K. Balachandran, Joseph H. Kang, Kemal Karakayali, K. Rege
There has been a lot of recent interest in the potential of inter-base station cooperation techniques to manage excessive out-of-cell interference in evolving cellular networks. In this paper, we propose and describe a signal processing approach based on a novel Network Interference Cancellation Engine (NICE), which opportunistically cancels dominant out-of-cell interference by exchanging decoded dominant interferer data among cooperating cells and reconstructing interfering signals. Simulation results with NICE processing in cellular networks show that substantial improvements in signal-to-interference-plus-noise ratio may be achieved over current non-cooperative multi-antenna receiver processing techniques while allowing backhaul overhead to be reduced by approximately between one and two orders of magnitude relative to joint processing techniques employing the exchange of complex-valued received signal samples.
{"title":"Uplink cooperation in wireless networks with NICE processing","authors":"K. Balachandran, Joseph H. Kang, Kemal Karakayali, K. Rege","doi":"10.1109/GLOCOMW.2010.5700447","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700447","url":null,"abstract":"There has been a lot of recent interest in the potential of inter-base station cooperation techniques to manage excessive out-of-cell interference in evolving cellular networks. In this paper, we propose and describe a signal processing approach based on a novel Network Interference Cancellation Engine (NICE), which opportunistically cancels dominant out-of-cell interference by exchanging decoded dominant interferer data among cooperating cells and reconstructing interfering signals. Simulation results with NICE processing in cellular networks show that substantial improvements in signal-to-interference-plus-noise ratio may be achieved over current non-cooperative multi-antenna receiver processing techniques while allowing backhaul overhead to be reduced by approximately between one and two orders of magnitude relative to joint processing techniques employing the exchange of complex-valued received signal samples.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127380661","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700354
Esam Sharafuddin, Nan Jiang, Yu Jin, Zhi-Li Zhang
The ever-increasing complexity and diversity of the Internet pose several challenges to network operators and administrators and, in general, Internet users. More specifically, because of the diversity in applications and usage patterns; the prevalence of dynamic IP addresses and applications that do not conform to standard configuration (e.g. VoIP to bypass firewalls), monitoring and securing networks and end hosts is no longer a trivial task. In this paper, we propose Host and netwOrk System Profiler and Internet Traffic AnaLysis (HOSPITAL): a tool for the summarization, characterization of traffic and the troubleshooting of potential suspicious activities. HOSPITAL provides the network operator as well as the user with knowledge about applications, communicating parties, services required/provided, etc, at different levels of granularity (e.g. individual hosts, /24 blocks, a large enterprise, etc), all presented concisely with an easy to use web interface. Moreover, HOSPITAL is a light-weight self-contained tool that incurs little overhead with configuration and customization capabilities for users and developers.
{"title":"HOSPITAL: Host and network system profiler and Internet traffic analyzer","authors":"Esam Sharafuddin, Nan Jiang, Yu Jin, Zhi-Li Zhang","doi":"10.1109/GLOCOMW.2010.5700354","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700354","url":null,"abstract":"The ever-increasing complexity and diversity of the Internet pose several challenges to network operators and administrators and, in general, Internet users. More specifically, because of the diversity in applications and usage patterns; the prevalence of dynamic IP addresses and applications that do not conform to standard configuration (e.g. VoIP to bypass firewalls), monitoring and securing networks and end hosts is no longer a trivial task. In this paper, we propose Host and netwOrk System Profiler and Internet Traffic AnaLysis (HOSPITAL): a tool for the summarization, characterization of traffic and the troubleshooting of potential suspicious activities. HOSPITAL provides the network operator as well as the user with knowledge about applications, communicating parties, services required/provided, etc, at different levels of granularity (e.g. individual hosts, /24 blocks, a large enterprise, etc), all presented concisely with an easy to use web interface. Moreover, HOSPITAL is a light-weight self-contained tool that incurs little overhead with configuration and customization capabilities for users and developers.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124879490","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700403
H. M. de Lima Carlos, M. Bennis, K. Ghaboosi, M. Latva-aho
The co-channel interference arising from the unplanned deployment and autonomous operation of self-organized femtocells is the most challenging obstacle to the viability of such architecture. Herein, we provide an analytical framework for assessing the uplink interference of indoor deployment scenario. The proposed model resorts to Gauss-Hermite quadrature to obtain an approximation to the total interference perceived by a tagged receiver, and stochastic geometry to model the distribution of nodes and their relative separation distances. Furthermore, the benefit of coordinating nearby femtocells so as to perform interference avoidance is also assessed. We observe that analytical results match well with simulation results. And yet, through coordination, it is possible to improve spatial reuse, reduce outage, and attain not only higher spectral efficiency, but also increased capacity.
{"title":"On interference analysis of self-organized femtocells in indoor deployment","authors":"H. M. de Lima Carlos, M. Bennis, K. Ghaboosi, M. Latva-aho","doi":"10.1109/GLOCOMW.2010.5700403","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700403","url":null,"abstract":"The co-channel interference arising from the unplanned deployment and autonomous operation of self-organized femtocells is the most challenging obstacle to the viability of such architecture. Herein, we provide an analytical framework for assessing the uplink interference of indoor deployment scenario. The proposed model resorts to Gauss-Hermite quadrature to obtain an approximation to the total interference perceived by a tagged receiver, and stochastic geometry to model the distribution of nodes and their relative separation distances. Furthermore, the benefit of coordinating nearby femtocells so as to perform interference avoidance is also assessed. We observe that analytical results match well with simulation results. And yet, through coordination, it is possible to improve spatial reuse, reduce outage, and attain not only higher spectral efficiency, but also increased capacity.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"9 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126639497","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 : 2010-12-01DOI: 10.1109/GLOCOMW.2010.5700261
R. Agarwal, M. Marrow
The log-structured filesystems typically used in current solid-state drive's (SSD) exhibit write amplification, whereby multiple NAND writes are required for each host write. Write amplification negatively affects the SSD endurance and write throughput. This performance loss depends on the drive over-provisioning and the garbage collection method. This paper presents a novel probabilistic model to analytically quantify the impact of over-provisioning on write amplification under a uniformly-distributed random workload and a greedy garbage collection policy. The analysis shows write amplification approximately independent of NAND block size and number of blocks in the SSD. The analysis is verified by full drive simulations.
{"title":"A closed-form expression for write amplification in NAND Flash","authors":"R. Agarwal, M. Marrow","doi":"10.1109/GLOCOMW.2010.5700261","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2010.5700261","url":null,"abstract":"The log-structured filesystems typically used in current solid-state drive's (SSD) exhibit write amplification, whereby multiple NAND writes are required for each host write. Write amplification negatively affects the SSD endurance and write throughput. This performance loss depends on the drive over-provisioning and the garbage collection method. This paper presents a novel probabilistic model to analytically quantify the impact of over-provisioning on write amplification under a uniformly-distributed random workload and a greedy garbage collection policy. The analysis shows write amplification approximately independent of NAND block size and number of blocks in the SSD. The analysis is verified by full drive simulations.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126656868","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
扫码关注我们
求助内容：
应助结果提醒方式：