Pub Date : 2014-12-01DOI: 10.1109/PCCC.2014.7017044
Y. Huangfu, Wei Zhang
In this paper, we propose a Performance Enhancement Guaranteed Cache (PEG-C) to ensure performance benefit in the worst case while achieving as good average-case performance as a regular hardware-controlled cache. Our experiments indicate that with a small number of preloaded data and a simple hardware extension, the PEG-C can guarantee performance enhancement in the worst case while achieving the same average-case performance as a regular cache.
{"title":"Worst-case performance guaranteed data cache","authors":"Y. Huangfu, Wei Zhang","doi":"10.1109/PCCC.2014.7017044","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017044","url":null,"abstract":"In this paper, we propose a Performance Enhancement Guaranteed Cache (PEG-C) to ensure performance benefit in the worst case while achieving as good average-case performance as a regular hardware-controlled cache. Our experiments indicate that with a small number of preloaded data and a simple hardware extension, the PEG-C can guarantee performance enhancement in the worst case while achieving the same average-case performance as a regular cache.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"897 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":"117059131","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.7017045
Reshmi Mitra, B. Joshi, R. Adams
The primary purpose of the current paper is to design a fast and accurate performance model framework for exploring various thread-to-core mapping strategies (MS) and estimating steady state cycles per instruction (CPI). It is directed towards efficiently exploring these performance metrics for large parallel applications for shared memory multicores. This work establishes a hybrid Markov Chain Model (MCM) and Model Tree (MT) based system-level performance prediction model framework. The model is validated with an Electromagnetics application for 12 different mapping strategies. The average performance prediction error is 0.168% with standard deviation of 3.866%. The total run time of model is of the order of minutes, whereas the actual application execution time is in terms of several days.
{"title":"Thread mapping using system-level throughput prediction model for shared memory multicores","authors":"Reshmi Mitra, B. Joshi, R. Adams","doi":"10.1109/PCCC.2014.7017045","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017045","url":null,"abstract":"The primary purpose of the current paper is to design a fast and accurate performance model framework for exploring various thread-to-core mapping strategies (MS) and estimating steady state cycles per instruction (CPI). It is directed towards efficiently exploring these performance metrics for large parallel applications for shared memory multicores. This work establishes a hybrid Markov Chain Model (MCM) and Model Tree (MT) based system-level performance prediction model framework. The model is validated with an Electromagnetics application for 12 different mapping strategies. The average performance prediction error is 0.168% with standard deviation of 3.866%. The total run time of model is of the order of minutes, whereas the actual application execution time is in terms of several days.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"24 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":"115263298","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.7017084
Z. Zhao, Fucheng Zhang, Shaoping Guo, Xiangyang Li, Junze Han
Legacy 802.11b/g protocols have been successfully applied in wireless long-distance (WiLD) networks to provide low-cost network connectivity for rural areas and developing countries, by designing TDMA MAC protocols. In contrast, we investigate the performance, and enhancement of using 802.11n for WiLD networks still using CSMA/CA. Our extensive experiments from our testbed show that, although 802.11n with CSMA/CA can provide network connectivity in WiLD environment, it suffers from poor performance. We thus propose RainbowRate, an efficient rate adaptation mechanism specified for WiLD links. RainbowRate leverages unique features found in WiLD links. We implement RainbowRate in off-the-shelf platforms and evaluate various aspects of our design using a testbed consisting of 6 mesh routers and 7 long-distance links, with the longest link length 20 km. Our experiment results show that RainbowRate out-performs state-of-the-art RA algorithms (MiRA, Ath9k and Minstrel) significantly in terms of throughput.
{"title":"RainbowRate: MIMO rate adaptation in 802.11n WiLD links","authors":"Z. Zhao, Fucheng Zhang, Shaoping Guo, Xiangyang Li, Junze Han","doi":"10.1109/PCCC.2014.7017084","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017084","url":null,"abstract":"Legacy 802.11b/g protocols have been successfully applied in wireless long-distance (WiLD) networks to provide low-cost network connectivity for rural areas and developing countries, by designing TDMA MAC protocols. In contrast, we investigate the performance, and enhancement of using 802.11n for WiLD networks still using CSMA/CA. Our extensive experiments from our testbed show that, although 802.11n with CSMA/CA can provide network connectivity in WiLD environment, it suffers from poor performance. We thus propose RainbowRate, an efficient rate adaptation mechanism specified for WiLD links. RainbowRate leverages unique features found in WiLD links. We implement RainbowRate in off-the-shelf platforms and evaluate various aspects of our design using a testbed consisting of 6 mesh routers and 7 long-distance links, with the longest link length 20 km. Our experiment results show that RainbowRate out-performs state-of-the-art RA algorithms (MiRA, Ath9k and Minstrel) significantly in terms of throughput.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"7 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":"114226713","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.7017030
Xinchang Zhang, Weidong Gu, Lu Wang, Xiaomin Zhu, Meng Sun
Most application layer multicast (ALM) protocols build the delivery tree by the distributed way, which is necessary for large-scale group applications because of its good scalability. However, it is difficult for the distributed way to obtain high performance. To address the above problem, we study a VM-assisted ALM tree optimization solution (called ALMTO). The proposed solution uses cloud virtual machines (VMs) to collect the structure information on the ALM tree, and uses a centralized way to effectively reduce average latency of the ALM tree built by the distribute way.
{"title":"A centralized latency optimization solution for tree-based application layer multicast","authors":"Xinchang Zhang, Weidong Gu, Lu Wang, Xiaomin Zhu, Meng Sun","doi":"10.1109/PCCC.2014.7017030","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017030","url":null,"abstract":"Most application layer multicast (ALM) protocols build the delivery tree by the distributed way, which is necessary for large-scale group applications because of its good scalability. However, it is difficult for the distributed way to obtain high performance. To address the above problem, we study a VM-assisted ALM tree optimization solution (called ALMTO). The proposed solution uses cloud virtual machines (VMs) to collect the structure information on the ALM tree, and uses a centralized way to effectively reduce average latency of the ALM tree built by the distribute way.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"69 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":"126989130","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.7017025
K. Warasup, M. Hamamura
The multiple-input multiple-output (MIMO) technique has been introduced to use in wireless networks to achieve the higher bit rate. Although the bit rate is increased, the throughput in wireless networks using MIMO technique is not increased by the same ratio. A number of new media access control (MAC) protocols have been proposed to increase the throughput in the MIMO wireless networks, but more overheads are added into the transmission process. This study proposes a new MAC protocol called the extended contention period (ECP) protocol which increases the throughput in the wireless networks and reduces the overheads in the transmission process. We also develop a simulation model to evaluate the performance of the ECP protocol and compare with the carrier sense multiple access with collision avoidance (CSMA/CA) protocol.
{"title":"An extended contention period protocol for MIMO wireless networks","authors":"K. Warasup, M. Hamamura","doi":"10.1109/PCCC.2014.7017025","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017025","url":null,"abstract":"The multiple-input multiple-output (MIMO) technique has been introduced to use in wireless networks to achieve the higher bit rate. Although the bit rate is increased, the throughput in wireless networks using MIMO technique is not increased by the same ratio. A number of new media access control (MAC) protocols have been proposed to increase the throughput in the MIMO wireless networks, but more overheads are added into the transmission process. This study proposes a new MAC protocol called the extended contention period (ECP) protocol which increases the throughput in the wireless networks and reduces the overheads in the transmission process. We also develop a simulation model to evaluate the performance of the ECP protocol and compare with the carrier sense multiple access with collision avoidance (CSMA/CA) protocol.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"64 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":"127071676","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.7017075
Waleed Alkohlani, Jeanine E. Cook, J. Cook
Although simulation is an indispensable tool in computer architecture research and development, there is a pressing need for new modeling techniques to improve simulation speeds while maintaining accuracy and robustness. It is no longer practical to use only cycle-accurate processor simulation (the dominant simulation method) for design space and performance studies due to its extremely slow speed. To address this and other problems of cycle-accurate simulation, we propose a fast and accurate statistical modeling methodology based on Monte Carlo methods to model the performance of modern out-of-order processors. Using these statistical models, simulation and performance prediction can be achieved in seconds regardless of the modeled application's size. This paper presents the proposed methodology and its first application to model a modern out-of-order execution processor. We present a statistical model for the Opteron (Magny-Cours) processor and validate it against real hardware. Using SPEC CPU2006 and Mantevo benchmarks, the model can predict performance in terms of cycles-per-instruction within 4.79% of actual on average. We also present a novel method for generating CPI stacks which are CPI representations that quantify the contribution of individual performance components to the total CPI. To further validate these CPI stacks, we use a detailed processor simulator, build a statistical model of the simulator architecture, validate the model against the simulator, and then proceed to validate the CPI stacks predicted by our statistical model. The average CPI prediction error is 5.6%, and the average difference between the predicted and measured CPI components is 1.3% with a maximum difference of 5.4%.
{"title":"Accurate statistical performance modeling and validation of out-of-order processors using Monte Carlo methods","authors":"Waleed Alkohlani, Jeanine E. Cook, J. Cook","doi":"10.1109/PCCC.2014.7017075","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017075","url":null,"abstract":"Although simulation is an indispensable tool in computer architecture research and development, there is a pressing need for new modeling techniques to improve simulation speeds while maintaining accuracy and robustness. It is no longer practical to use only cycle-accurate processor simulation (the dominant simulation method) for design space and performance studies due to its extremely slow speed. To address this and other problems of cycle-accurate simulation, we propose a fast and accurate statistical modeling methodology based on Monte Carlo methods to model the performance of modern out-of-order processors. Using these statistical models, simulation and performance prediction can be achieved in seconds regardless of the modeled application's size. This paper presents the proposed methodology and its first application to model a modern out-of-order execution processor. We present a statistical model for the Opteron (Magny-Cours) processor and validate it against real hardware. Using SPEC CPU2006 and Mantevo benchmarks, the model can predict performance in terms of cycles-per-instruction within 4.79% of actual on average. We also present a novel method for generating CPI stacks which are CPI representations that quantify the contribution of individual performance components to the total CPI. To further validate these CPI stacks, we use a detailed processor simulator, build a statistical model of the simulator architecture, validate the model against the simulator, and then proceed to validate the CPI stacks predicted by our statistical model. The average CPI prediction error is 5.6%, and the average difference between the predicted and measured CPI components is 1.3% with a maximum difference of 5.4%.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"5 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":"127503489","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.7017051
Wei Liu, Ao Hong, Liang Ou, Wenchao Ding, Ge Zhang
The prediction of traffic matrices (TM) is critical for many IP network management tasks. With the recent development of high-speed traffic measurement technologies, complete TM could be collected from operational IP networks. In this paper, we report our efforts in predicting the TM measured from a real IP backbone network in China. The new problem here is how to deal with the rich but noisy TM data and predict various traffics, ranging from the original-destination (OD) flow traffic, the node traffic to the total network traffic. After examining the traffic characteristics, we choose the node traffic as the principal data for prediction, and propose three prediction and correction methods: Independent Node Prediction (INP), Total Matrix Prediction with Key Element Correction (TMP-KEC) and Principle Component Prediction with Fluctuation Component Correction (PCP-FCC). TMP-KEC and PCP-FCC are designed with different purposes, i.e., for smaller prediction errors of the total network and the OD flows, respectively. The results show that, INP performs worst; TMP-KEC efficiently reduces the prediction errors of the large matrix elements; while, PCP-FCC achieves smaller average prediction errors for the elements as well as the complete matrix.
{"title":"Prediction and correction of traffic matrix in an IP backbone network","authors":"Wei Liu, Ao Hong, Liang Ou, Wenchao Ding, Ge Zhang","doi":"10.1109/PCCC.2014.7017051","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017051","url":null,"abstract":"The prediction of traffic matrices (TM) is critical for many IP network management tasks. With the recent development of high-speed traffic measurement technologies, complete TM could be collected from operational IP networks. In this paper, we report our efforts in predicting the TM measured from a real IP backbone network in China. The new problem here is how to deal with the rich but noisy TM data and predict various traffics, ranging from the original-destination (OD) flow traffic, the node traffic to the total network traffic. After examining the traffic characteristics, we choose the node traffic as the principal data for prediction, and propose three prediction and correction methods: Independent Node Prediction (INP), Total Matrix Prediction with Key Element Correction (TMP-KEC) and Principle Component Prediction with Fluctuation Component Correction (PCP-FCC). TMP-KEC and PCP-FCC are designed with different purposes, i.e., for smaller prediction errors of the total network and the OD flows, respectively. The results show that, INP performs worst; TMP-KEC efficiently reduces the prediction errors of the large matrix elements; while, PCP-FCC achieves smaller average prediction errors for the elements as well as the complete matrix.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"264 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":"124895278","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.7017111
Suk kyu Lee, Hyunsoon Kim, Woonghee Lee, Hwantae Kim, Jongtack Jung, Hwangnam Kim
User's multimedia interaction is facing a paradigm shift from 2D to 3D videos. Nonetheless, it is still difficult to watch 3D videos with a mobile device. With current technological barrier in wireless networking, it is hardly imagined that the timely transmission for a 3D video streaming could be feasible with the mobile device. In this paper, we propose ReMA, a novel 3D video distribution system based on a lightweight compression, a linkadaptive transmission scheme, and a network-side assistance for processing capability. ReMA consists of a 3D data transmitter, a receiver, and an infrastructure for generating and distributing 3D videos. We implemented the proposed system in a real testbed and conducted a thorough empirical evaluation study. Based on the empirical results, the proposed system presents a great promise in streaming 3D video in real-time to the mobile device.
{"title":"ReMA: Real-time 3D video streaming system for mobile devices","authors":"Suk kyu Lee, Hyunsoon Kim, Woonghee Lee, Hwantae Kim, Jongtack Jung, Hwangnam Kim","doi":"10.1109/PCCC.2014.7017111","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017111","url":null,"abstract":"User's multimedia interaction is facing a paradigm shift from 2D to 3D videos. Nonetheless, it is still difficult to watch 3D videos with a mobile device. With current technological barrier in wireless networking, it is hardly imagined that the timely transmission for a 3D video streaming could be feasible with the mobile device. In this paper, we propose ReMA, a novel 3D video distribution system based on a lightweight compression, a linkadaptive transmission scheme, and a network-side assistance for processing capability. ReMA consists of a 3D data transmitter, a receiver, and an infrastructure for generating and distributing 3D videos. We implemented the proposed system in a real testbed and conducted a thorough empirical evaluation study. Based on the empirical results, the proposed system presents a great promise in streaming 3D video in real-time to the mobile device.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"17 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":"131672863","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.7017070
Fatima Furqan, D. Hoang, I. Collings
With high data rate and mobility support wireless networks are becoming an integral part of the ubiquitous broadband access. Appropriate dimensioning of the wireless access networks is essential to satisfy users' Quality of Service (QoS) requirements. Once the network is dimensioned, dynamic variations in traffic or population distribution can affect the capability of the network to deliver the agreed QoS of connections. Consequently, re-dimension the network may be necessary. Current researches do not discuss the effects of QoS schemes on the capacity of the network. In this paper, we investigate the impact of QoS schemes on the capacity of the network. The objective is to determine the capability of the network to deal with the variations in the demography of the covered area and the user's traffic profile with the proposed QoS schemes including Congestion Control (CC) and Radio Admission Control (RAC). Different scenarios are presented to evaluate the effects of QoS schemes on the capacity of the network. This investigation will assist network operators to determine the point after which the network needs to be re-dimensioned.
{"title":"Effects of quality of service schemes on the capacity and dimensioning of LTE networks","authors":"Fatima Furqan, D. Hoang, I. Collings","doi":"10.1109/pccc.2014.7017070","DOIUrl":"https://doi.org/10.1109/pccc.2014.7017070","url":null,"abstract":"With high data rate and mobility support wireless networks are becoming an integral part of the ubiquitous broadband access. Appropriate dimensioning of the wireless access networks is essential to satisfy users' Quality of Service (QoS) requirements. Once the network is dimensioned, dynamic variations in traffic or population distribution can affect the capability of the network to deliver the agreed QoS of connections. Consequently, re-dimension the network may be necessary. Current researches do not discuss the effects of QoS schemes on the capacity of the network. In this paper, we investigate the impact of QoS schemes on the capacity of the network. The objective is to determine the capability of the network to deal with the variations in the demography of the covered area and the user's traffic profile with the proposed QoS schemes including Congestion Control (CC) and Radio Admission Control (RAC). Different scenarios are presented to evaluate the effects of QoS schemes on the capacity of the network. This investigation will assist network operators to determine the point after which the network needs to be re-dimensioned.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"2246 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":"130210678","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.7017050
Ali Tekeoglu, A. Tosun
Chromecast is a small, system-on-chip device, that plugs into the HDMI port of a larger screen and turns it into a smart screen. It is designed for multimedia streaming in a home-network environment. By setting up Chromecast, you can stream videos onto a larger screen and control it from a mobile device such as a smart-phone, tablet or a laptop. We examined the network packets exchanged between the smaller remote control device and the Chromecast attached larger screen. While Chromecast encrypts most of the content, remote control device sends control packets to the remote servers in the clear-text, which makes it vulnerable to reply-attacks or session-hijacking attacks. Besides, data transmission pattern leak personal information outside of the home-network, raising privacy concerns. Network protocols used by Chromecast are investigated and known vulnerabilities are listed. A method to detect the existence of Chromecast behind a home-router is proposed.
{"title":"Blackbox security evaluation of chromecast network communications","authors":"Ali Tekeoglu, A. Tosun","doi":"10.1109/PCCC.2014.7017050","DOIUrl":"https://doi.org/10.1109/PCCC.2014.7017050","url":null,"abstract":"Chromecast is a small, system-on-chip device, that plugs into the HDMI port of a larger screen and turns it into a smart screen. It is designed for multimedia streaming in a home-network environment. By setting up Chromecast, you can stream videos onto a larger screen and control it from a mobile device such as a smart-phone, tablet or a laptop. We examined the network packets exchanged between the smaller remote control device and the Chromecast attached larger screen. While Chromecast encrypts most of the content, remote control device sends control packets to the remote servers in the clear-text, which makes it vulnerable to reply-attacks or session-hijacking attacks. Besides, data transmission pattern leak personal information outside of the home-network, raising privacy concerns. Network protocols used by Chromecast are investigated and known vulnerabilities are listed. A method to detect the existence of Chromecast behind a home-router is proposed.","PeriodicalId":105442,"journal":{"name":"2014 IEEE 33rd International Performance Computing and Communications Conference (IPCCC)","volume":"8 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":"130682711","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
扫码关注我们
求助内容：
应助结果提醒方式：