Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876228
Justin Y. Shi, T. Evans, Kimberly A. Kosman, Yasin Celik
This paper reports an organized suite of experiments comparing a parallel matrix program in performance and reliability using a single-sided statistic multiplexed computing framework against MPI based on end-to-end computing framework.
{"title":"A study of single-sided HPC communication paradigm using Chameleon bare-metal cluster","authors":"Justin Y. Shi, T. Evans, Kimberly A. Kosman, Yasin Celik","doi":"10.1109/ICCNC.2017.7876228","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876228","url":null,"abstract":"This paper reports an organized suite of experiments comparing a parallel matrix program in performance and reliability using a single-sided statistic multiplexed computing framework against MPI based on end-to-end computing framework.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"28 4 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":"123295952","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.7876116
Mohamed A. Abd-Elmagid, T. Elbatt, Karim G. Seddik
This paper studies the problem of cooperative communications in cognitive radio networks where the secondary user is equipped with finite length relaying queue as well as finite length battery queue. The major hurdle towards fully characterizing the stable throughput region stems from the sheer complexity associated with solving the two-dimensional Markov Chain (MC) model for both finite queues. Motivated by this, we relax the problem and focus on two energy constrained systems, namely, finite battery queue with infinite relay queue and finite relay queue with infinite battery queue. We characterize the stable throughput regions for the two proposed simpler systems. For each proposed system, we investigate the maximum service rate of the cognitive node subject to stability conditions. Despite the complexity of the formulated optimization problems attributed to their non-convexity, we exploit the problems' structure to transform them into linear programs. Thus, we manage to solve them efficiently using standard known linear programming solvers. Our numerical results reveal interesting insights about the role of finite data queues as well as energy limitations on the network performance, compared to baselines with unlimited energy sources and infinite data queues.
{"title":"On the role of finite queues in cooperative cognitive radio networks with energy harvesting","authors":"Mohamed A. Abd-Elmagid, T. Elbatt, Karim G. Seddik","doi":"10.1109/ICCNC.2017.7876116","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876116","url":null,"abstract":"This paper studies the problem of cooperative communications in cognitive radio networks where the secondary user is equipped with finite length relaying queue as well as finite length battery queue. The major hurdle towards fully characterizing the stable throughput region stems from the sheer complexity associated with solving the two-dimensional Markov Chain (MC) model for both finite queues. Motivated by this, we relax the problem and focus on two energy constrained systems, namely, finite battery queue with infinite relay queue and finite relay queue with infinite battery queue. We characterize the stable throughput regions for the two proposed simpler systems. For each proposed system, we investigate the maximum service rate of the cognitive node subject to stability conditions. Despite the complexity of the formulated optimization problems attributed to their non-convexity, we exploit the problems' structure to transform them into linear programs. Thus, we manage to solve them efficiently using standard known linear programming solvers. Our numerical results reveal interesting insights about the role of finite data queues as well as energy limitations on the network performance, compared to baselines with unlimited energy sources and infinite data queues.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"10 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":"126325877","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.7876264
M. Usman, M. A. Usman, S. Shin
This paper proposes two channel assignment models to manage channel blocking of the primary users (PUs) and the secondary users (SUs) in cognitive radio (CR) networks. The proposed models provide priority based channel assignment strategies for the PUs and SUs. In order to manage the blocking of PUs and SUs, channel blocking analysis for both models is performed using the Markov chain process. Further, channel availability prediction for the SUs, based on the blocking probability results, is also provided. The prediction is done by performing risk analysis using the @Risk software. To validate the channel blocking analysis, simulations are performed at the end of the paper. The results are provided in two parts, i.e., the blocking probability analysis for PUs and SUs, and the risk analysis part using the @Risk software.
{"title":"Channel blocking analysis and availability prediction in cognitive radio networks","authors":"M. Usman, M. A. Usman, S. Shin","doi":"10.1109/ICCNC.2017.7876264","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876264","url":null,"abstract":"This paper proposes two channel assignment models to manage channel blocking of the primary users (PUs) and the secondary users (SUs) in cognitive radio (CR) networks. The proposed models provide priority based channel assignment strategies for the PUs and SUs. In order to manage the blocking of PUs and SUs, channel blocking analysis for both models is performed using the Markov chain process. Further, channel availability prediction for the SUs, based on the blocking probability results, is also provided. The prediction is done by performing risk analysis using the @Risk software. To validate the channel blocking analysis, simulations are performed at the end of the paper. The results are provided in two parts, i.e., the blocking probability analysis for PUs and SUs, and the risk analysis part using the @Risk software.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 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":"129487909","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.7876182
Chunpu Wang, Chen Feng, Julian Cheng
In a cloud environment, a scheduler assigns arriving tasks to one of many servers, with the goal of minimizing response times. There are two conventional approaches to cloud scheduling. The first is called the Join-the-Shortest-Queue (JSQ) algorithm, which directs an arriving task to the least loaded server. Despite its excellent delay performance, JSQ is throughput-limited, and thus doesn't scale well with the number of servers. The second is called the Power-of-d-choices (Pod) algorithm, which selects d servers at random and routes a task to the least loaded server of the d servers. Despite its scalability, Pod suffers from long tail response times. In this paper, a hybrid scheduling strategy is proposed, and it consists of a Pod scheduler and a throughput-limited helper. Hybrid scheduling takes the best of both worlds, enjoying scalability and low tail response times. In particular, hybrid scheduling has bounded maximum queue size in the large-system regime, which is in sharp contrast to the Pod scheduling whose maximum queue size is unbounded.
在云环境中，调度器将到达的任务分配给众多服务器中的一个，其目标是最小化响应时间。有两种传统的云调度方法。第一种称为最短队列连接(join - The - short - queue, JSQ)算法，它将到达的任务定向到负载最少的服务器。尽管具有出色的延迟性能，但JSQ的吞吐量有限，因此不能很好地随服务器数量进行扩展。第二种算法称为Power-of-d-choices (Pod)算法，它随机选择d个服务器，并将任务路由到d个服务器中负载最少的服务器。尽管具有可扩展性，但Pod的响应时间长。本文提出了一种混合调度策略，该策略由Pod调度程序和吞吐量有限的助手组成。混合调度充分利用了两者的优点，享有可伸缩性和低尾响应时间。特别是在大系统环境下，混合调度的最大队列大小是有界的，这与Pod调度的最大队列大小是无界的形成了鲜明对比。
{"title":"Randomized load balancing with a helper","authors":"Chunpu Wang, Chen Feng, Julian Cheng","doi":"10.1109/ICCNC.2017.7876182","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876182","url":null,"abstract":"In a cloud environment, a scheduler assigns arriving tasks to one of many servers, with the goal of minimizing response times. There are two conventional approaches to cloud scheduling. The first is called the Join-the-Shortest-Queue (JSQ) algorithm, which directs an arriving task to the least loaded server. Despite its excellent delay performance, JSQ is throughput-limited, and thus doesn't scale well with the number of servers. The second is called the Power-of-d-choices (Pod) algorithm, which selects d servers at random and routes a task to the least loaded server of the d servers. Despite its scalability, Pod suffers from long tail response times. In this paper, a hybrid scheduling strategy is proposed, and it consists of a Pod scheduler and a throughput-limited helper. Hybrid scheduling takes the best of both worlds, enjoying scalability and low tail response times. In particular, hybrid scheduling has bounded maximum queue size in the large-system regime, which is in sharp contrast to the Pod scheduling whose maximum queue size is unbounded.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"76 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":"129682922","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.7876191
Shuai Zhao, Zhu Li, D. Medhi, PoLin Lai, Shan Liu
Video streaming over HTTP is becoming the de facto dominating paradigm for today's video applications. HTTP as an over-the-top (OTT) protocol has been leveraged for quality video traversal over the Internet. High user-received quality-of-experience (QoE) is driven not only by the new technology, but also by a wide range of user demands. Given the limitation of a traditional TCP/IP network for supporting video transmission, the typical on-off transfer pattern is inevitable. Dynamic adaptive streaming over HTTP (DASH) establishes a simple architecture and enables new video applications to fully utilize the exiting physical network infrastructure. By deploying robust adaptive algorithms at the client side, DASH can provide a smooth streaming experience. We propose a dynamic adaptive algorithm in order to keep a high QoE for the average user's experience. We formulated our QoE optimization in a set of key factors. The results obtained by our empirical network traces show that our approach not only achieves a high average QoE but it also works stably under different network conditions.
基于HTTP的视频流正在成为当今视频应用程序事实上的主导范例。HTTP作为一种over- top (OTT)协议已被用于在Internet上进行高质量的视频传输。高用户体验质量(QoE)不仅受到新技术的驱动，还受到广泛的用户需求的驱动。考虑到传统TCP/IP网络支持视频传输的局限性，典型的开-关传输模式是不可避免的。动态自适应HTTP流(DASH)建立了一个简单的架构，使新的视频应用程序能够充分利用现有的物理网络基础设施。通过在客户端部署健壮的自适应算法，DASH可以提供流畅的流体验。我们提出了一种动态自适应算法，以保持平均用户体验的高QoE。我们将QoE优化定义为一组关键因素。我们的经验网络轨迹的结果表明，我们的方法不仅实现了较高的平均QoE，而且在不同的网络条件下都能稳定地工作。
{"title":"Study of user QoE improvement for dynamic adaptive streaming over HTTP (MPEG-DASH)","authors":"Shuai Zhao, Zhu Li, D. Medhi, PoLin Lai, Shan Liu","doi":"10.1109/ICCNC.2017.7876191","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876191","url":null,"abstract":"Video streaming over HTTP is becoming the de facto dominating paradigm for today's video applications. HTTP as an over-the-top (OTT) protocol has been leveraged for quality video traversal over the Internet. High user-received quality-of-experience (QoE) is driven not only by the new technology, but also by a wide range of user demands. Given the limitation of a traditional TCP/IP network for supporting video transmission, the typical on-off transfer pattern is inevitable. Dynamic adaptive streaming over HTTP (DASH) establishes a simple architecture and enables new video applications to fully utilize the exiting physical network infrastructure. By deploying robust adaptive algorithms at the client side, DASH can provide a smooth streaming experience. We propose a dynamic adaptive algorithm in order to keep a high QoE for the average user's experience. We formulated our QoE optimization in a set of key factors. The results obtained by our empirical network traces show that our approach not only achieves a high average QoE but it also works stably under different network conditions.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"22 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":"114630740","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}
Encryption will play a more important role as more computation and storage are outsourced. Achieving good balance between strong security and application functionality preservation becomes a cutting-edge research problem. SE algorithms are well studied, which delegate search capabilities to the cloud provider without decrypting the documents. But this approach imposes extra constraints on cloud API and loses search query expressiveness. This paper proposes a CASB based framework for encrypted search and data sharing, which builds the search index locally and only points the identifiers of ciphertext into cloud, promisingly expresses full set search functionalities while using keys that the user can control. Experimental results are taken to quantitatively analyze the performance overhead and throughput of the broker.
{"title":"A Cloud Access Security Broker based approach for encrypted data search and sharing","authors":"Chuanyi Liu, Guofeng Wang, Peiyi Han, Hezhong Pan, Binxing Fang","doi":"10.1109/ICCNC.2017.7876165","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876165","url":null,"abstract":"Encryption will play a more important role as more computation and storage are outsourced. Achieving good balance between strong security and application functionality preservation becomes a cutting-edge research problem. SE algorithms are well studied, which delegate search capabilities to the cloud provider without decrypting the documents. But this approach imposes extra constraints on cloud API and loses search query expressiveness. This paper proposes a CASB based framework for encrypted search and data sharing, which builds the search index locally and only points the identifiers of ciphertext into cloud, promisingly expresses full set search functionalities while using keys that the user can control. Experimental results are taken to quantitatively analyze the performance overhead and throughput of the broker.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"17 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":"133908292","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.7876255
Erdal Akin, T. Korkmaz
Large scale cloud applications may require users to get multiple resources (e.g., VMs, storage) from different sites and simultaneously connect each pair of resources by a path that can satisfy certain Quality-of-Service (QoS) requirements. Finding such paths with the bandwidth constraint is known as the unsplittiable flow problem, which is shown to be NP-hard. Accordingly, various approximations as well as heuristic algorithms are proposed to maximize the amount of routed flows. However, the existing solutions suffer from either low performance in maximizing the amount of routed flows or excessive computation time. In this paper, we propose a new efficient heuristic for a special case, where multiple flows are sent between two cloud sites. Our heuristic algorithm first determines level cuts, set of links that are at same distance from source to destination, whose removal disconnects the source and destination. It then uses randomized best fit algorithm for assigning the flows to the links in the possible bottleneck cuts, which are the level cuts whose total available bandwidth is less then (1+γ) times the total requested bandwidth. It finally tries to forward flows between the level cuts using bandwidth constrained shortest path algorithm per flow. We demonstrate the efficiency of our heuristic using simulation.
{"title":"Routing algorithm for multiple unsplittable flows between two cloud sites with QoS guarantees","authors":"Erdal Akin, T. Korkmaz","doi":"10.1109/ICCNC.2017.7876255","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876255","url":null,"abstract":"Large scale cloud applications may require users to get multiple resources (e.g., VMs, storage) from different sites and simultaneously connect each pair of resources by a path that can satisfy certain Quality-of-Service (QoS) requirements. Finding such paths with the bandwidth constraint is known as the unsplittiable flow problem, which is shown to be NP-hard. Accordingly, various approximations as well as heuristic algorithms are proposed to maximize the amount of routed flows. However, the existing solutions suffer from either low performance in maximizing the amount of routed flows or excessive computation time. In this paper, we propose a new efficient heuristic for a special case, where multiple flows are sent between two cloud sites. Our heuristic algorithm first determines level cuts, set of links that are at same distance from source to destination, whose removal disconnects the source and destination. It then uses randomized best fit algorithm for assigning the flows to the links in the possible bottleneck cuts, which are the level cuts whose total available bandwidth is less then (1+γ) times the total requested bandwidth. It finally tries to forward flows between the level cuts using bandwidth constrained shortest path algorithm per flow. We demonstrate the efficiency of our heuristic using simulation.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"22 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":"130180633","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.7876236
Zachary King, Shucheng Yu
The Controller Area Network (CAN) is a broadcast communications network invented by Robert Bosch GmbH in 1986. CAN is the standard communication network found in automobiles, industry equipment, and many space applications. To be used in these environments, CAN is designed for efficiency and reliability, rather than security.
{"title":"Investigating and securing communications in the Controller Area Network (CAN)","authors":"Zachary King, Shucheng Yu","doi":"10.1109/ICCNC.2017.7876236","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876236","url":null,"abstract":"The Controller Area Network (CAN) is a broadcast communications network invented by Robert Bosch GmbH in 1986. CAN is the standard communication network found in automobiles, industry equipment, and many space applications. To be used in these environments, CAN is designed for efficiency and reliability, rather than security.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"72 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":"130225351","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.7876141
Gayathri Kongara, J. Armstrong
Compared to conventional cyclic prefix orthogonal frequency division multiplexing (CP-OFDM), polynomial cancellation coded (PCC-OFDM) systems have been shown to demonstrate robustness against carrier frequency offset (CFO), multipath delay and Doppler spreads. In this paper, we describe the hardware implementation of PCC-OFDM system on an FPGA based software defined radio platform to examine the error performance on a real wireless channel using National Instruments's universal software radio peripheral (NI-USRP) hardware. In our implementation, we examine the impact of real wireless channel in conjunction with impairments such as multipath distortion, CFO and noise on the received signals. A simple receive signal processing algorithm for carrier synchronization and equalization is used for both CP-OFDM and PCC-OFDM systems. For the cases considered, PCC-OFDM outperforms conventional CP-OFDM under the influence of multipath, CFO and noise.
{"title":"Performance evaluation of PCC OFDM on a software defined radio platform","authors":"Gayathri Kongara, J. Armstrong","doi":"10.1109/ICCNC.2017.7876141","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876141","url":null,"abstract":"Compared to conventional cyclic prefix orthogonal frequency division multiplexing (CP-OFDM), polynomial cancellation coded (PCC-OFDM) systems have been shown to demonstrate robustness against carrier frequency offset (CFO), multipath delay and Doppler spreads. In this paper, we describe the hardware implementation of PCC-OFDM system on an FPGA based software defined radio platform to examine the error performance on a real wireless channel using National Instruments's universal software radio peripheral (NI-USRP) hardware. In our implementation, we examine the impact of real wireless channel in conjunction with impairments such as multipath distortion, CFO and noise on the received signals. A simple receive signal processing algorithm for carrier synchronization and equalization is used for both CP-OFDM and PCC-OFDM systems. For the cases considered, PCC-OFDM outperforms conventional CP-OFDM under the influence of multipath, CFO and noise.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"76 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":"114137382","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.7876093
Donghyeok Ho, Gi Seok Park, Hwangjun Song
In this work, we propose an auction-based resource negotiation for flexible video traffic offloading over heterogeneous wireless networks. The goal of the proposed system is to alleviate long term evolution (LTE) traffic congestion by offloading video traffic through WiFi network in a flexible scale while providing stable video streaming services to users with the minimum monetary cost. The fountain code is adopted to achieve flexibility of offloading traffic and robustness over error-prone wireless networks. Moreover, the progressive second price auction mechanism is employed to allocate limited LTE resources to multiple users in order to maximize social welfare while converging to the ε-Nash equilibrium. For performance verification, we implement the system using network simulator 3.
{"title":"Auction-based resource negotiation for flexible video traffic offloading over wireless networks","authors":"Donghyeok Ho, Gi Seok Park, Hwangjun Song","doi":"10.1109/ICCNC.2017.7876093","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876093","url":null,"abstract":"In this work, we propose an auction-based resource negotiation for flexible video traffic offloading over heterogeneous wireless networks. The goal of the proposed system is to alleviate long term evolution (LTE) traffic congestion by offloading video traffic through WiFi network in a flexible scale while providing stable video streaming services to users with the minimum monetary cost. The fountain code is adopted to achieve flexibility of offloading traffic and robustness over error-prone wireless networks. Moreover, the progressive second price auction mechanism is employed to allocate limited LTE resources to multiple users in order to maximize social welfare while converging to the ε-Nash equilibrium. For performance verification, we implement the system using network simulator 3.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"21 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":"133695557","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
扫码关注我们
求助内容：
应助结果提醒方式：