Pub Date : 2014-12-01DOI: 10.1109/PADSW.2014.7097848
Wei Sun, Jiadi Yu, Tong Liu
In this paper we study a social welfare maximization problem for spectrum sharing in cognitive radio networks. To fully use the spectrum resource, the spectrum owned by the licensed primary user (PU) can be leased to secondary users (SUs) for transmitting data. We first formulate the social welfare of a cognitive radio network, considering the cost for the primary user sharing spectrum and the utility gained for secondary users transmitting data. The social welfare maximization is a convex optimization, which can be solved by standard methods in a centralized manner. However, the utility function of each secondary user always contains the private information, which leads to the centralized methods disabled. To overcome this challenge, we propose an iterative distributed algorithm based on a pricing-based decomposition framework. It is theoretically proved that our proposed algorithm converges to the optimal solution. Numerical simulation results are presented to show that our proposed algorithm achieves optimal social welfare and fast convergence speed.
本文研究了认知无线电网络中频谱共享的社会福利最大化问题。为了充分利用频谱资源，可以将已获得license的primary user (primary user)拥有的频谱租给secondary user (secondary user)，用于传输数据。考虑到主用户共享频谱的成本和次用户传输数据的效用，我们首先制定了认知无线电网络的社会福利。社会福利最大化是一个凸优化问题，可以用标准方法集中求解。然而，由于每个二级用户的效用函数总是包含私有信息，导致集中方法无法使用。为了克服这一挑战，我们提出了一种基于定价分解框架的迭代分布式算法。从理论上证明了该算法收敛于最优解。数值仿真结果表明，该算法具有较好的社会福利和较快的收敛速度。
{"title":"A distributed spectrum sharing algorithm in cognitive radio networks","authors":"Wei Sun, Jiadi Yu, Tong Liu","doi":"10.1109/PADSW.2014.7097848","DOIUrl":"https://doi.org/10.1109/PADSW.2014.7097848","url":null,"abstract":"In this paper we study a social welfare maximization problem for spectrum sharing in cognitive radio networks. To fully use the spectrum resource, the spectrum owned by the licensed primary user (PU) can be leased to secondary users (SUs) for transmitting data. We first formulate the social welfare of a cognitive radio network, considering the cost for the primary user sharing spectrum and the utility gained for secondary users transmitting data. The social welfare maximization is a convex optimization, which can be solved by standard methods in a centralized manner. However, the utility function of each secondary user always contains the private information, which leads to the centralized methods disabled. To overcome this challenge, we propose an iterative distributed algorithm based on a pricing-based decomposition framework. It is theoretically proved that our proposed algorithm converges to the optimal solution. Numerical simulation results are presented to show that our proposed algorithm achieves optimal social welfare and fast convergence speed.","PeriodicalId":421740,"journal":{"name":"2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)","volume":"73 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":"125877541","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/PADSW.2014.7097829
Toshio Endo, Akira Nukada, S. Matsuoka
Modern supercomputer performance is principally limited by power. TSUBAME-KFC is a state-of-the-art prototype for our next-generation TSUBAME3.0 supercomputer and towards future exascale. In collaboration with Green Revolution Cooling and others, TSUBAME-KFC submerges compute nodes configured with extremely high processor/component density, into non-toxic, low viscosity oil with high 260 Celsius flash point, and cooled using ambient / evaporative cooling tower. This minimizes cooling power while all semiconductor components kept at low temperature to lower leakage current. Numerous off-line in addition to on-line power and temperature sensors are facilitated throughout and constantly monitored to immediately observe the effect of voltage/frequency control. As a result, TSUBAME-KFC achieved world No.1 on the Green500 in Nov. 2013 and Jun. 2014, by over 20% c.f. the nearest competitors.
{"title":"TSUBAME-KFC: A modern liquid submersion cooling prototype towards exascale becoming the greenest supercomputer in the world","authors":"Toshio Endo, Akira Nukada, S. Matsuoka","doi":"10.1109/PADSW.2014.7097829","DOIUrl":"https://doi.org/10.1109/PADSW.2014.7097829","url":null,"abstract":"Modern supercomputer performance is principally limited by power. TSUBAME-KFC is a state-of-the-art prototype for our next-generation TSUBAME3.0 supercomputer and towards future exascale. In collaboration with Green Revolution Cooling and others, TSUBAME-KFC submerges compute nodes configured with extremely high processor/component density, into non-toxic, low viscosity oil with high 260 Celsius flash point, and cooled using ambient / evaporative cooling tower. This minimizes cooling power while all semiconductor components kept at low temperature to lower leakage current. Numerous off-line in addition to on-line power and temperature sensors are facilitated throughout and constantly monitored to immediately observe the effect of voltage/frequency control. As a result, TSUBAME-KFC achieved world No.1 on the Green500 in Nov. 2013 and Jun. 2014, by over 20% c.f. the nearest competitors.","PeriodicalId":421740,"journal":{"name":"2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)","volume":"60 4 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":"129581158","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/PADSW.2014.7097857
Huey-Ing Liu, Wen He, Winston K.G. Seah
Ambient energy from solar, vibration, heat and wind provide alternative energy sources to power sensors and extend the lifetime of wireless sensor networks which have traditionally been powered by batteries. This paper aims to enhance the performance of energy harvesting powered wireless sensor networks in three aspects: relaying, scheduling, and medium access control. To better adapt to the characteristics of energy harvesting, an asynchronous receiver-initiated duty-cycling approach is preferred in energy harvesting powered wireless sensor networks. This reduces the duty cycle of senders, and regulates the active and sleep intervals according to the energy levels of sensors. When nodes run out of power and need time to recharge, network holes or voids develop, forcing data packets to be routed via other paths, like detours. The proposed relaying strategy aims to prevent holes by balancing the load across the network according to nodes' energy harvesting characteristics. This is a natural consequence of the asynchronous duty cycling by scheduling transmission based on the receiver's availability. The simulation results show that our scheme outperforms in terms of sender duty cycle, end-to-end delay and delivery ratio, especially in challenged conditions where other protocols fail.
{"title":"LEB-MAC: Load and energy balancing MAC protocol for energy harvesting powered wireless sensor networks","authors":"Huey-Ing Liu, Wen He, Winston K.G. Seah","doi":"10.1109/PADSW.2014.7097857","DOIUrl":"https://doi.org/10.1109/PADSW.2014.7097857","url":null,"abstract":"Ambient energy from solar, vibration, heat and wind provide alternative energy sources to power sensors and extend the lifetime of wireless sensor networks which have traditionally been powered by batteries. This paper aims to enhance the performance of energy harvesting powered wireless sensor networks in three aspects: relaying, scheduling, and medium access control. To better adapt to the characteristics of energy harvesting, an asynchronous receiver-initiated duty-cycling approach is preferred in energy harvesting powered wireless sensor networks. This reduces the duty cycle of senders, and regulates the active and sleep intervals according to the energy levels of sensors. When nodes run out of power and need time to recharge, network holes or voids develop, forcing data packets to be routed via other paths, like detours. The proposed relaying strategy aims to prevent holes by balancing the load across the network according to nodes' energy harvesting characteristics. This is a natural consequence of the asynchronous duty cycling by scheduling transmission based on the receiver's availability. The simulation results show that our scheme outperforms in terms of sender duty cycle, end-to-end delay and delivery ratio, especially in challenged conditions where other protocols fail.","PeriodicalId":421740,"journal":{"name":"2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)","volume":"15 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":"125615791","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/PADSW.2014.7097907
Sang Cheol Han, Youn-Hee Han, Huijun Kim
Wearable smart devices industry is booming up and being highlighted by the market recently as an alternative of post smart phone industry. Wearable smart devices have an intrinsic nature that their visual style should be very important like fashion as well as the sophisticated function is. They also have unique characteristics of industrial ecosystem different from the ecosystem of the smart phone industry. In this paper, we insist that there are a huge number of vertical markets for wearable smart device product and services. We also suggests that the small and medium companies should be more aggressive to advance such vertical markets with the application products and services with components as well as solutions.
{"title":"Characteristics and perspectives of wearable smart devices and industrial ecosystem","authors":"Sang Cheol Han, Youn-Hee Han, Huijun Kim","doi":"10.1109/PADSW.2014.7097907","DOIUrl":"https://doi.org/10.1109/PADSW.2014.7097907","url":null,"abstract":"Wearable smart devices industry is booming up and being highlighted by the market recently as an alternative of post smart phone industry. Wearable smart devices have an intrinsic nature that their visual style should be very important like fashion as well as the sophisticated function is. They also have unique characteristics of industrial ecosystem different from the ecosystem of the smart phone industry. In this paper, we insist that there are a huge number of vertical markets for wearable smart device product and services. We also suggests that the small and medium companies should be more aggressive to advance such vertical markets with the application products and services with components as well as solutions.","PeriodicalId":421740,"journal":{"name":"2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)","volume":"112 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":"117286260","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/PADSW.2014.7097906
Jia-Jiun Yang, Jehn-Ruey Jiang, Yung-Liang Lai
This paper studies a Disk Covering Tour Problem (DCTP) for reducing the energy consumption of a mobile robot's movement to provide services for sensor nodes in a wireless sensor network (WSN). Given a set of locations of sensor nodes and a starting location of mobile robot, the DCTP is to find a minimum cost tour of a sequence of tour stops for the mobile robot to serve sensor nodes by keeping every sensor node within a specified distance of a tour stop. We propose an algorithm, called Decreasing k-means (Dk-means), to find an approximate solution to the DCTP. The idea is to select a minimum number of disks or circles of a fixed radius to cover all sensor nodes, and then to find a minimum cost tour passing all disk centers. The simulation results show the proposed algorithm outperforms the related CSP (Covering Salesman Problem) algorithm and the QiF algorithm.
{"title":"A Decreasing k-means algorithm for the Disk Covering Tour Problem in wireless sensor networks","authors":"Jia-Jiun Yang, Jehn-Ruey Jiang, Yung-Liang Lai","doi":"10.1109/PADSW.2014.7097906","DOIUrl":"https://doi.org/10.1109/PADSW.2014.7097906","url":null,"abstract":"This paper studies a Disk Covering Tour Problem (DCTP) for reducing the energy consumption of a mobile robot's movement to provide services for sensor nodes in a wireless sensor network (WSN). Given a set of locations of sensor nodes and a starting location of mobile robot, the DCTP is to find a minimum cost tour of a sequence of tour stops for the mobile robot to serve sensor nodes by keeping every sensor node within a specified distance of a tour stop. We propose an algorithm, called Decreasing k-means (Dk-means), to find an approximate solution to the DCTP. The idea is to select a minimum number of disks or circles of a fixed radius to cover all sensor nodes, and then to find a minimum cost tour passing all disk centers. The simulation results show the proposed algorithm outperforms the related CSP (Covering Salesman Problem) algorithm and the QiF algorithm.","PeriodicalId":421740,"journal":{"name":"2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)","volume":"3 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":"134488898","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/PADSW.2014.7097867
Umesh Chandra Satish, Praveenkumar Kondikoppa, Seung-Jong Park, Manish Patil, R. Shah
Genome indexing is the basis for many bioinformatics applications. Read mapping(sequence alignment) is one such application where the goal is to align millions of short reads against reference genome. Several tools are available for read mapping which rely on different indexing techniques to expedite the alignment process. However, many of these contemporary alignment programs are sequential, memory intensive and cannot be easily scaled for larger genomes. Suffix tree is one of the most widely used data structures for indexing strings (genomes). Building a scalable suffix-tree based tool is particularly challenging due to the difficulties involved in parallel construction of the suffix tree. Several suffix tree construction techniques have been proposed till date with focus on space-time tradeoff. Most of these existing works address the construction issue for uniprocessor and cannot be easily extended to utilize modern multi-processor systems. In this paper we investigate and propose a MapReduce based parallel construction of suffix tree. We demonstrate the performance of the algorithm over commodity cluster using up to 32 nodes each having 8GB of primary memory.
{"title":"MapReduce based parallel suffix tree construction for human genome","authors":"Umesh Chandra Satish, Praveenkumar Kondikoppa, Seung-Jong Park, Manish Patil, R. Shah","doi":"10.1109/PADSW.2014.7097867","DOIUrl":"https://doi.org/10.1109/PADSW.2014.7097867","url":null,"abstract":"Genome indexing is the basis for many bioinformatics applications. Read mapping(sequence alignment) is one such application where the goal is to align millions of short reads against reference genome. Several tools are available for read mapping which rely on different indexing techniques to expedite the alignment process. However, many of these contemporary alignment programs are sequential, memory intensive and cannot be easily scaled for larger genomes. Suffix tree is one of the most widely used data structures for indexing strings (genomes). Building a scalable suffix-tree based tool is particularly challenging due to the difficulties involved in parallel construction of the suffix tree. Several suffix tree construction techniques have been proposed till date with focus on space-time tradeoff. Most of these existing works address the construction issue for uniprocessor and cannot be easily extended to utilize modern multi-processor systems. In this paper we investigate and propose a MapReduce based parallel construction of suffix tree. We demonstrate the performance of the algorithm over commodity cluster using up to 32 nodes each having 8GB of primary memory.","PeriodicalId":421740,"journal":{"name":"2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)","volume":"79 2 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":"132724583","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/PADSW.2014.7097845
Bo Wang, Xinghui Zhao, David Chiu
Limited battery power has long been a challenge for mobile applications. As a result, the work in power monitoring and management has attracted great interests. In this paper, we propose a model to estimate power consumption of mobile applications at run-time, based on application-specific per-action power profiling. In addition, we have developed on-line optimization techniques which help maximize users' experience while conserving power. Our power model is lightweight and flexible, in that it can be used by any mobile applications as a plugin, and it can support user-defined optimization mechanisms. This approach has been evaluated using a case study, a mobile application for field studies, and the experimental results show that our model accurately captures power consumption of the application, and the model can be used to optimize the power consumption based on users' needs.
{"title":"Lightweight online power monitoring and control for mobile applications","authors":"Bo Wang, Xinghui Zhao, David Chiu","doi":"10.1109/PADSW.2014.7097845","DOIUrl":"https://doi.org/10.1109/PADSW.2014.7097845","url":null,"abstract":"Limited battery power has long been a challenge for mobile applications. As a result, the work in power monitoring and management has attracted great interests. In this paper, we propose a model to estimate power consumption of mobile applications at run-time, based on application-specific per-action power profiling. In addition, we have developed on-line optimization techniques which help maximize users' experience while conserving power. Our power model is lightweight and flexible, in that it can be used by any mobile applications as a plugin, and it can support user-defined optimization mechanisms. This approach has been evaluated using a case study, a mobile application for field studies, and the experimental results show that our model accurately captures power consumption of the application, and the model can be used to optimize the power consumption based on users' needs.","PeriodicalId":421740,"journal":{"name":"2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)","volume":"72 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":"130342523","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/PADSW.2014.7097826
Xuedi Chen, Kenli Li, Chubo Liu, Kuan-Ching Li
The energy aware scheduling problem has been a critical issue in high-performance clusters owing to their high operation cost, environmental impact, and low reliability. An existing technique to reduce energy consumption of applications is dynamic voltage/frequency scaling (DVFS). In this paper, we develop an energy aware scheduling algorithm called EASLA for precedence-constrained applications in the context of Service Level Agreement (SLA) on DVFS-enabled cluster systems. Due to the dependencies among tasks and makespan extension, there may be some slacks under used. The main idea of the EASLA algorithm is to distribute each slack to a set of tasks and scale frequencies down to try to minimize energy consumption. Specifically, it first finds the maximum set of independent tasks for each task, and then iteratively allocates each slack to the maximum independent set whose total energy reduction is the maximal. Randomly generated graphs and two real-world applications are tested in our experiments. The experimental results show that our scheduling algorithm can save up to 22.68% and 12.01% energy consumption compared with GreedyDVS and EvenlyDVS algorithms, respectively.
{"title":"SLA-based energy aware scheduling of precedence-constrained applications on DVFS-enabled clusters","authors":"Xuedi Chen, Kenli Li, Chubo Liu, Kuan-Ching Li","doi":"10.1109/PADSW.2014.7097826","DOIUrl":"https://doi.org/10.1109/PADSW.2014.7097826","url":null,"abstract":"The energy aware scheduling problem has been a critical issue in high-performance clusters owing to their high operation cost, environmental impact, and low reliability. An existing technique to reduce energy consumption of applications is dynamic voltage/frequency scaling (DVFS). In this paper, we develop an energy aware scheduling algorithm called EASLA for precedence-constrained applications in the context of Service Level Agreement (SLA) on DVFS-enabled cluster systems. Due to the dependencies among tasks and makespan extension, there may be some slacks under used. The main idea of the EASLA algorithm is to distribute each slack to a set of tasks and scale frequencies down to try to minimize energy consumption. Specifically, it first finds the maximum set of independent tasks for each task, and then iteratively allocates each slack to the maximum independent set whose total energy reduction is the maximal. Randomly generated graphs and two real-world applications are tested in our experiments. The experimental results show that our scheduling algorithm can save up to 22.68% and 12.01% energy consumption compared with GreedyDVS and EvenlyDVS algorithms, respectively.","PeriodicalId":421740,"journal":{"name":"2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)","volume":"25 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":"125126723","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/PADSW.2014.7097919
Mohammed Sourouri, T. Gillberg, S. Baden, Xing Cai
In the context of multiple GPUs that share the same PCIe bus, we propose a new communication scheme that leads to a more effective overlap of communication and computation. Multiple CUDA streams and OpenMP threads are adopted so that data can simultaneously be sent and received. A representative 3D stencil example is used to demonstrate the effectiveness of our scheme. We compare the performance of our new scheme with an MPI-based state-of-the-art scheme. Results show that our approach outperforms the state-of-the-art scheme, being up to 1.85× faster. However, our performance results also indicate that the current underlying PCIe bus architecture needs improvements to handle the future scenario of many GPUs per node.
{"title":"Effective multi-GPU communication using multiple CUDA streams and threads","authors":"Mohammed Sourouri, T. Gillberg, S. Baden, Xing Cai","doi":"10.1109/PADSW.2014.7097919","DOIUrl":"https://doi.org/10.1109/PADSW.2014.7097919","url":null,"abstract":"In the context of multiple GPUs that share the same PCIe bus, we propose a new communication scheme that leads to a more effective overlap of communication and computation. Multiple CUDA streams and OpenMP threads are adopted so that data can simultaneously be sent and received. A representative 3D stencil example is used to demonstrate the effectiveness of our scheme. We compare the performance of our new scheme with an MPI-based state-of-the-art scheme. Results show that our approach outperforms the state-of-the-art scheme, being up to 1.85× faster. However, our performance results also indicate that the current underlying PCIe bus architecture needs improvements to handle the future scenario of many GPUs per node.","PeriodicalId":421740,"journal":{"name":"2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)","volume":"4 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":"126884123","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/PADSW.2014.7097873
Karine Pires, Sébastien Monnet, Pierre Sens
Live streaming has become very popular. Many systems, such as justin.tv, have emerged. They aim to collect user live-streams and serve them to the viewers using broadcasting servers. However, the huge variation in the total number of viewers and the great heterogeneity among streams popularity generally implies over-provisioning, leading to an important resource waste. In this paper, we show that there is a trade-off between the number of servers involved to broadcast the streams and the bandwidth usage among the servers. We also stress the importance to predict streams popularity in order to efficiently place them on the servers. We propose POPS: a live streaming service using popularity predictions to map live-streams on the servers.
{"title":"POPS: A popularity-aware live streaming service","authors":"Karine Pires, Sébastien Monnet, Pierre Sens","doi":"10.1109/PADSW.2014.7097873","DOIUrl":"https://doi.org/10.1109/PADSW.2014.7097873","url":null,"abstract":"Live streaming has become very popular. Many systems, such as justin.tv, have emerged. They aim to collect user live-streams and serve them to the viewers using broadcasting servers. However, the huge variation in the total number of viewers and the great heterogeneity among streams popularity generally implies over-provisioning, leading to an important resource waste. In this paper, we show that there is a trade-off between the number of servers involved to broadcast the streams and the bandwidth usage among the servers. We also stress the importance to predict streams popularity in order to efficiently place them on the servers. We propose POPS: a live streaming service using popularity predictions to map live-streams on the servers.","PeriodicalId":421740,"journal":{"name":"2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS)","volume":"28 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":"116726964","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
扫码关注我们
求助内容：
应助结果提醒方式：