Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876107
Changle Zhu, Julian Cheng, N. Al-Dhahir
A free-space optical system using subcarrier intensity modulated quadrature phase shift keying (QPSK) is investigated for Gamma-Gamma fading channels with receiver in-phase and quadrature (I/Q) imbalances. The I/Q imbalance caused by imperfection of analog components is unavoidable using any direct-conversion transceivers. In addition to the receiver I/Q imbalances, the performance of a subcarrier QPSK system is impaired by the fluctuation of irradiance over the Gamma-Gamma fading channels. By taking into consideration of both receiver I/Q imbalances and fading, we derive closed-form symbol error rate (SER) and bit-error rate (BER) expressions. It is discovered that the value of amplitude imbalance is irrelevant to the error rate performance of the QPSK system.
{"title":"Error rate analysis of subcarrier QPSK With receiver I/Q imbalances over Gamma-Gamma fading channels","authors":"Changle Zhu, Julian Cheng, N. Al-Dhahir","doi":"10.1109/ICCNC.2017.7876107","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876107","url":null,"abstract":"A free-space optical system using subcarrier intensity modulated quadrature phase shift keying (QPSK) is investigated for Gamma-Gamma fading channels with receiver in-phase and quadrature (I/Q) imbalances. The I/Q imbalance caused by imperfection of analog components is unavoidable using any direct-conversion transceivers. In addition to the receiver I/Q imbalances, the performance of a subcarrier QPSK system is impaired by the fluctuation of irradiance over the Gamma-Gamma fading channels. By taking into consideration of both receiver I/Q imbalances and fading, we derive closed-form symbol error rate (SER) and bit-error rate (BER) expressions. It is discovered that the value of amplitude imbalance is irrelevant to the error rate performance of the QPSK system.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132450423","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876226
A. Sabbah, O. Issa, B. Doray
Cognitive Radio (CR) technology offers a promising solution to the spectrum scarcity problem via Dynamic Spectrum Allocation (DSA). Due to the nature of Cognitive Radio Networks (CRNs), where two networks are active simultaneously, a significant amount of control messaging is required in order to coordinate channel access, schedule sensing, and establish release connections. Efficient Control Plane messaging can be achieved by the selection of an appropriate Control Channel (CC). This paper gives a comparative study of potential techniques for providing reliable channels dedicated to the coordination and information distribution in License-Exempt (LE) bands. This involves determining the potential and limitations of each technique.
{"title":"Performance study of dedicated in-band Control Channels for Cognitive Radio Networks","authors":"A. Sabbah, O. Issa, B. Doray","doi":"10.1109/ICCNC.2017.7876226","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876226","url":null,"abstract":"Cognitive Radio (CR) technology offers a promising solution to the spectrum scarcity problem via Dynamic Spectrum Allocation (DSA). Due to the nature of Cognitive Radio Networks (CRNs), where two networks are active simultaneously, a significant amount of control messaging is required in order to coordinate channel access, schedule sensing, and establish release connections. Efficient Control Plane messaging can be achieved by the selection of an appropriate Control Channel (CC). This paper gives a comparative study of potential techniques for providing reliable channels dedicated to the coordination and information distribution in License-Exempt (LE) bands. This involves determining the potential and limitations of each technique.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"607 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116074540","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876195
Yosuke Akishita, Y. Ohsita, M. Murata
The power consumption of networks has been increasing as the service over the Internet becomes popular, and has become a serious problem. Many methods to reduce the power consumption by shutting down unnecessary network devices following the environmental changes have been proposed. These methods consider only simple objectives such as the number of powered-on nodes and the maximum link utilization. However, multiple complex objectives such as delay and reliability should be also considered in the actual network. In this paper, we propose a network power saving method that handles multiple complex objectives, following the environmental changes. In this method, we store the candidate network configurations, and evolve them, following the environmental changes. Then, we select the network configuration from the candidate network configurations.We combine two approaches to evolve the network configurations. The first approach is based on Pareto optimal, and evolves the network configurations so as to be close to the Pareto optimal solutions, considering multiple objectives. Another approach is based on the diversity of the network configurations. By storing the diverse network configurations, we can handle the significant environmental changes. We evaluate our method by simulation, and demonstrate that our method reduces the power consumption without violating the constraints, following the traffic changes. In addition, we also demonstrate that our method can keep the connectivity in case of failures, and recover the performance and the small power consumption soon after the failure occurs.
{"title":"Network power saving based on Pareto optimal control with evolutionary approach","authors":"Yosuke Akishita, Y. Ohsita, M. Murata","doi":"10.1109/ICCNC.2017.7876195","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876195","url":null,"abstract":"The power consumption of networks has been increasing as the service over the Internet becomes popular, and has become a serious problem. Many methods to reduce the power consumption by shutting down unnecessary network devices following the environmental changes have been proposed. These methods consider only simple objectives such as the number of powered-on nodes and the maximum link utilization. However, multiple complex objectives such as delay and reliability should be also considered in the actual network. In this paper, we propose a network power saving method that handles multiple complex objectives, following the environmental changes. In this method, we store the candidate network configurations, and evolve them, following the environmental changes. Then, we select the network configuration from the candidate network configurations.We combine two approaches to evolve the network configurations. The first approach is based on Pareto optimal, and evolves the network configurations so as to be close to the Pareto optimal solutions, considering multiple objectives. Another approach is based on the diversity of the network configurations. By storing the diverse network configurations, we can handle the significant environmental changes. We evaluate our method by simulation, and demonstrate that our method reduces the power consumption without violating the constraints, following the traffic changes. In addition, we also demonstrate that our method can keep the connectivity in case of failures, and recover the performance and the small power consumption soon after the failure occurs.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125775741","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876113
S. Bhunia, S. Sengupta
With the advancement of unmanned aerial vehicles (UAV), 3D wireless mesh networks will play a crucial role in next generation mission critical wireless networks. Along with providing coverage over difficult terrain, it provides better spectral utilization through 3D spatial reuse. However, being a wireless network, 3D meshes are vulnerable to jamming/disruptive attacks. A jammer can disrupt the communication, as well as control of the network by intelligently causing interference to a set of nodes. This paper presents a distributed mechanism of avoiding jamming attacks by means of 3D spatial filtering where adaptive beam nulling is used to keep the jammer in null region in order to bypass jamming. Kalman filter based tracking mechanism is used to estimate the most likely trajectory of the jammer from noisy observation of the jammer's position. A beam null border is determined by calculating confidence region of jammer's current and next position estimates. An optimization goal is presented to calculate optimal beam null that minimizes the number of deactivated links while maximizing the higher value of confidence for keeping the jammer inside the null. The survivability of a 3D mesh network with a mobile jammer is studied through simulation that validates an 96.65% reduction in the number of jammed nodes.
{"title":"Distributed adaptive beam nulling to mitigate jamming in 3D UAV mesh networks","authors":"S. Bhunia, S. Sengupta","doi":"10.1109/ICCNC.2017.7876113","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876113","url":null,"abstract":"With the advancement of unmanned aerial vehicles (UAV), 3D wireless mesh networks will play a crucial role in next generation mission critical wireless networks. Along with providing coverage over difficult terrain, it provides better spectral utilization through 3D spatial reuse. However, being a wireless network, 3D meshes are vulnerable to jamming/disruptive attacks. A jammer can disrupt the communication, as well as control of the network by intelligently causing interference to a set of nodes. This paper presents a distributed mechanism of avoiding jamming attacks by means of 3D spatial filtering where adaptive beam nulling is used to keep the jammer in null region in order to bypass jamming. Kalman filter based tracking mechanism is used to estimate the most likely trajectory of the jammer from noisy observation of the jammer's position. A beam null border is determined by calculating confidence region of jammer's current and next position estimates. An optimization goal is presented to calculate optimal beam null that minimizes the number of deactivated links while maximizing the higher value of confidence for keeping the jammer inside the null. The survivability of a 3D mesh network with a mobile jammer is studied through simulation that validates an 96.65% reduction in the number of jammed nodes.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125548691","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876162
Juzi Zhao, V. Vokkarane
Extreme-scale science applications are highly innovative and constantly evolving. They are expected to generate data in the petabyte and exabyte ranges. This data needs to be transferred, processed, and analyzed at remote locations. A flexible data retrieval service is needed, where a user requesting data retrieval from a remote site can have a choice between replicated storage sites. Elastic Optical Networks are ideal backbone networks, since they can efficiently utilize the optical fiber's bandwidth in an elastic manner by partitioning the bandwidth into hundreds or even thousands of subcarriers. In this paper, multi-sourced data retrieval problem, called reverse manycast, is studied for static traffic in elastic optical networks, the objective is to minimize the total transmission completion time of all the requests. A novel ILP formulation and a low-complexity heuristic are proposed. Simulation results are presented to demonstrate that the proposed method can save up to 37% in completion time compared with a benchmark.
{"title":"Reverse manycast data retrieval in Elastic Optical Networks","authors":"Juzi Zhao, V. Vokkarane","doi":"10.1109/ICCNC.2017.7876162","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876162","url":null,"abstract":"Extreme-scale science applications are highly innovative and constantly evolving. They are expected to generate data in the petabyte and exabyte ranges. This data needs to be transferred, processed, and analyzed at remote locations. A flexible data retrieval service is needed, where a user requesting data retrieval from a remote site can have a choice between replicated storage sites. Elastic Optical Networks are ideal backbone networks, since they can efficiently utilize the optical fiber's bandwidth in an elastic manner by partitioning the bandwidth into hundreds or even thousands of subcarriers. In this paper, multi-sourced data retrieval problem, called reverse manycast, is studied for static traffic in elastic optical networks, the objective is to minimize the total transmission completion time of all the requests. A novel ILP formulation and a low-complexity heuristic are proposed. Simulation results are presented to demonstrate that the proposed method can save up to 37% in completion time compared with a benchmark.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127107937","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876098
G. Wang, Peng Xiao, Wenming Li
The use of directional antennas in wireless networks has received growing attention because of its high spatial reuse and high antenna gains. The Medium Access Control(MAC) protocol with directional antennas is nontrivial due to the limitations in wireless environment. The existing protocols commonly assume that the nodes can operate in both directional and omni-directional modes. In this paper, we propose a new MAC protocol for multi-beam directional antennas. In the protocol, each beam-sector has its own control channel, thus the communications among different beam-sectors are independent. It uses the directional network allocation vector(DNAV) to record the establishment processes. After sensing all the sectors of the multi-beam antenna, it uses the global assignment strategy to assign the directional communication channels. Extensive simulation results show that our protocol can significantly improve the throughput of an entire wireless network at the expense of the slightly increased RTS/DRTS requests in the establishment process.
{"title":"A novel MAC protocol for wireless network using multi-beam directional antennas","authors":"G. Wang, Peng Xiao, Wenming Li","doi":"10.1109/ICCNC.2017.7876098","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876098","url":null,"abstract":"The use of directional antennas in wireless networks has received growing attention because of its high spatial reuse and high antenna gains. The Medium Access Control(MAC) protocol with directional antennas is nontrivial due to the limitations in wireless environment. The existing protocols commonly assume that the nodes can operate in both directional and omni-directional modes. In this paper, we propose a new MAC protocol for multi-beam directional antennas. In the protocol, each beam-sector has its own control channel, thus the communications among different beam-sectors are independent. It uses the directional network allocation vector(DNAV) to record the establishment processes. After sensing all the sectors of the multi-beam antenna, it uses the global assignment strategy to assign the directional communication channels. Extensive simulation results show that our protocol can significantly improve the throughput of an entire wireless network at the expense of the slightly increased RTS/DRTS requests in the establishment process.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127689647","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876230
Nathaniel Gyory, M. Chuah
Internet of Things (IoT) refer to a group of smart devices connected over a common network which can improve the quality of our lives either via automation of various home chores e.g. switching on lights at certain pre-programmed hours or allowing remote control of home appliances. While IoT offers a promising future for automation, convenience and analytics, it currently faces many issues that prevent private industry or residential home owners from deploying them. Two major issues include security concerns and device incompatibilities among different IoT platforms. A recent research paper has exposed the insecurity of the SmartThings framework which allows over privileged access of third party apps to all capabilities of a SmartThings device. This combined with unsafe dynamic method invocation exposes home owners to dangerous manipulations of deployed IoT devices e.g. unlock a home. To overcome this vulnerability, users may choose an open source platform e.g. openHab. However, openHab suffers from limited device compatibility issue since it does not support most of the SmartThings devices. Thus, we propose our IoTOne solution which supports heterogeneous IoT devices and avoids both the security vulnerabilities and the limited device compatibilities issues. Our IoTOne solution also checks for security vulnerabilities before publishing IoTOne App.
{"title":"IoTOne: Integrated platform for heterogeneous IoT devices","authors":"Nathaniel Gyory, M. Chuah","doi":"10.1109/ICCNC.2017.7876230","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876230","url":null,"abstract":"Internet of Things (IoT) refer to a group of smart devices connected over a common network which can improve the quality of our lives either via automation of various home chores e.g. switching on lights at certain pre-programmed hours or allowing remote control of home appliances. While IoT offers a promising future for automation, convenience and analytics, it currently faces many issues that prevent private industry or residential home owners from deploying them. Two major issues include security concerns and device incompatibilities among different IoT platforms. A recent research paper has exposed the insecurity of the SmartThings framework which allows over privileged access of third party apps to all capabilities of a SmartThings device. This combined with unsafe dynamic method invocation exposes home owners to dangerous manipulations of deployed IoT devices e.g. unlock a home. To overcome this vulnerability, users may choose an open source platform e.g. openHab. However, openHab suffers from limited device compatibility issue since it does not support most of the SmartThings devices. Thus, we propose our IoTOne solution which supports heterogeneous IoT devices and avoids both the security vulnerabilities and the limited device compatibilities issues. Our IoTOne solution also checks for security vulnerabilities before publishing IoTOne App.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127827286","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876133
E. Oki, Ryoma Kaneko, N. Kitsuwan, T. Kurimoto, S. Urushidani
Cost-effective cloud storage services attract users with their convenience; there is a trade-off between the service availability and the usage cost. We develop two cloud provider selection models for cloud storage services to minimize the total cost of usage. The models select multiple cloud providers with considering unavailability to meet the user requirements. The first model, called a user-copy (UC) model, allows to select multiple cloud providers, where a user itself makes copies of its data for multiple providers. In addition to the user copy function of the UC model, the second model, which is called a user and cloud-provider copy (UCC) model, allows cloud providers to make copies of the data to deliver them to other cloud providers. The cloud service is available if at least one cloud provider is available. We formulate both models as integer linear programming (ILP) problems. Our performance evaluation observes that both models reduce the total cost of usage, compared to the single cloud provider selection. As the cost of bandwidth usage between a user and a cloud provider increases, the UCC model becomes more beneficial than the UC model. We implement the prototype for cloud storage services.
{"title":"Cloud provider selection models for cloud storage services to meet availability requirements","authors":"E. Oki, Ryoma Kaneko, N. Kitsuwan, T. Kurimoto, S. Urushidani","doi":"10.1109/ICCNC.2017.7876133","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876133","url":null,"abstract":"Cost-effective cloud storage services attract users with their convenience; there is a trade-off between the service availability and the usage cost. We develop two cloud provider selection models for cloud storage services to minimize the total cost of usage. The models select multiple cloud providers with considering unavailability to meet the user requirements. The first model, called a user-copy (UC) model, allows to select multiple cloud providers, where a user itself makes copies of its data for multiple providers. In addition to the user copy function of the UC model, the second model, which is called a user and cloud-provider copy (UCC) model, allows cloud providers to make copies of the data to deliver them to other cloud providers. The cloud service is available if at least one cloud provider is available. We formulate both models as integer linear programming (ILP) problems. Our performance evaluation observes that both models reduce the total cost of usage, compared to the single cloud provider selection. As the cost of bandwidth usage between a user and a cloud provider increases, the UCC model becomes more beneficial than the UC model. We implement the prototype for cloud storage services.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129880492","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876139
H. Fukudome, Kohei Akimoto, S. Kameda, N. Suematsu, T. Takagi, K. Tsubouchi
To deal with the explosion of wireless traffic, the authors are now considering a new system at 3.5 GHz band, which consists of small outdoor cells constructed by access points set up indoor. In order to utilize this system, measurement-based propagation modeling in multiple frequencies is necessary. In this paper, the authors propose the new modeling method for indoor-outdoor propagation when buildings are arranged side-by-side in parallel. Additionally, the authors derive a fitting parameter at 2.5GHz and 3.5 GHz in order to compare characteristics of the target frequency with those of a frequency in service. The result shows that indoor obstacles have notable effect to path loss exponent whereas little effect to a path loss offset, while a path loss offset has a dominant effect when it comes to a difference of a frequency. Moreover, the authors confirm our model can predict a shadow fading accurately compared with previous indoor-outdoor propagation model.
{"title":"Modeling indoor-outdoor propagation in wooden residential area at 2.5 GHz and 3.5 GHz bands","authors":"H. Fukudome, Kohei Akimoto, S. Kameda, N. Suematsu, T. Takagi, K. Tsubouchi","doi":"10.1109/ICCNC.2017.7876139","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876139","url":null,"abstract":"To deal with the explosion of wireless traffic, the authors are now considering a new system at 3.5 GHz band, which consists of small outdoor cells constructed by access points set up indoor. In order to utilize this system, measurement-based propagation modeling in multiple frequencies is necessary. In this paper, the authors propose the new modeling method for indoor-outdoor propagation when buildings are arranged side-by-side in parallel. Additionally, the authors derive a fitting parameter at 2.5GHz and 3.5 GHz in order to compare characteristics of the target frequency with those of a frequency in service. The result shows that indoor obstacles have notable effect to path loss exponent whereas little effect to a path loss offset, while a path loss offset has a dominant effect when it comes to a difference of a frequency. Moreover, the authors confirm our model can predict a shadow fading accurately compared with previous indoor-outdoor propagation model.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122716474","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876175
X. Ruan, Haiquan Chen
Nowadays big data analytics have been widely used in many domains, e.g., weather forecast, social network analysis, scientific computing, and bioinformatics. As indispensable part of big data analytics, MapReduce has become the de facto standard model of the distributed computing framework. With the growing complexity of software and hardware components, big data analytics systems face the challenge of performance bottleneck when handling the increasing size of computing workloads. In our study, we reveal that the existing Shuffle mechanism in the current Spark implementation is still the performance bottleneck due to the Shuffle I/O latency. We demonstrate that the Shuffle stage causes performance degradation among MapReduce jobs. By observing that the high-end Solid State Disks (SSDs) are capable of handling random writes well due to efficient flash translation layer algorithms and larger on-board I/O cache, we present a hybrid storage system-based solution that uses hard drive disks (HDDs) for large datasets storage and SSDs for improving Shuffle I/O performance to mitigate this performance degradation issue. Our extensive experiments using both real-world and synthetic workloads show that our hybrid storage system-based approach achieves performance improvement in the Shuffle stage compared with the original HDD-based Spark implementation.
{"title":"Improving Shuffle I/O performance for big data processing using hybrid storage","authors":"X. Ruan, Haiquan Chen","doi":"10.1109/ICCNC.2017.7876175","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876175","url":null,"abstract":"Nowadays big data analytics have been widely used in many domains, e.g., weather forecast, social network analysis, scientific computing, and bioinformatics. As indispensable part of big data analytics, MapReduce has become the de facto standard model of the distributed computing framework. With the growing complexity of software and hardware components, big data analytics systems face the challenge of performance bottleneck when handling the increasing size of computing workloads. In our study, we reveal that the existing Shuffle mechanism in the current Spark implementation is still the performance bottleneck due to the Shuffle I/O latency. We demonstrate that the Shuffle stage causes performance degradation among MapReduce jobs. By observing that the high-end Solid State Disks (SSDs) are capable of handling random writes well due to efficient flash translation layer algorithms and larger on-board I/O cache, we present a hybrid storage system-based solution that uses hard drive disks (HDDs) for large datasets storage and SSDs for improving Shuffle I/O performance to mitigate this performance degradation issue. Our extensive experiments using both real-world and synthetic workloads show that our hybrid storage system-based approach achieves performance improvement in the Shuffle stage compared with the original HDD-based Spark implementation.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117349117","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
扫码关注我们
求助内容：
应助结果提醒方式：