Pub Date : 2019-01-01DOI: 10.1109/CCNC.2019.8651737
Sajad Mehrizi, Anestis Tsakmalis, S. Chatzinotas, B. Ottersten
The efficiency of cache-placement algorithms in edge-caching networks depends on the accuracy of the content request’s statistical model and the estimation method based on the postulated model. This paper studies these two important issues. First, we introduce a new model for content requests in stationary environments. The common approach to model the requests is through the Poisson stochastic process. However, the Poisson stochastic process is not a very flexible model since it cannot capture the correlations between contents. To resolve this limitation, we instead introduce the Poisson Factor Analysis (PFA) model for this purpose. In PFA, the correlations are modeled through additional random variables embedded in a low dimensional latent space. The correlations provide rich information about the underlying statistical properties of content requests which can be used for advanced cache-placement algorithms. Secondly, to learn the model, we use Bayesian Learning, an efficient framework which does not overfit. This is crucial in edge-caching systems since only partial view of the entire request set is available at the local cache and the learning method should be able to estimate the content popularities without overfitting. In the simulation results, we compare the performance of our approach with the existing popularity estimation method.
{"title":"Content Popularity Estimation in Edge-Caching Networks from Bayesian Inference Perspective","authors":"Sajad Mehrizi, Anestis Tsakmalis, S. Chatzinotas, B. Ottersten","doi":"10.1109/CCNC.2019.8651737","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651737","url":null,"abstract":"The efficiency of cache-placement algorithms in edge-caching networks depends on the accuracy of the content request’s statistical model and the estimation method based on the postulated model. This paper studies these two important issues. First, we introduce a new model for content requests in stationary environments. The common approach to model the requests is through the Poisson stochastic process. However, the Poisson stochastic process is not a very flexible model since it cannot capture the correlations between contents. To resolve this limitation, we instead introduce the Poisson Factor Analysis (PFA) model for this purpose. In PFA, the correlations are modeled through additional random variables embedded in a low dimensional latent space. The correlations provide rich information about the underlying statistical properties of content requests which can be used for advanced cache-placement algorithms. Secondly, to learn the model, we use Bayesian Learning, an efficient framework which does not overfit. This is crucial in edge-caching systems since only partial view of the entire request set is available at the local cache and the learning method should be able to estimate the content popularities without overfitting. In the simulation results, we compare the performance of our approach with the existing popularity estimation method.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134525822","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651762
Y. Musaka, Yoshitaka Nakamura, H. Inamura, Xiaohong Jiang
In Japan, early warnings such as the earthquake early warning and the tsunami warning are broadcast to cellular phones by using the Earthquake and Tsunami Warning System (ETWS) [1]. The connectivity of a LTE device (UE: user equipment) depends on the LTE base station (evolved Node B: eNB which acts as a relay with the Internet. Therefore it is difficult to broadcast early warnings during large-scale disasters.
在日本，地震预警、海啸预警等早期预警通过地震海啸预警系统(earthquake and tsunami warning System, ETWS)向手机广播[1]。LTE设备(UE:用户设备)的连通性依赖于LTE基站(演变为节点B: eNB)，它充当与互联网的中继。因此，在大规模灾害中广播预警是困难的。
{"title":"Relay UE Selection Scheme in an Emergency Warning System Integrating Proximity Services","authors":"Y. Musaka, Yoshitaka Nakamura, H. Inamura, Xiaohong Jiang","doi":"10.1109/CCNC.2019.8651762","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651762","url":null,"abstract":"In Japan, early warnings such as the earthquake early warning and the tsunami warning are broadcast to cellular phones by using the Earthquake and Tsunami Warning System (ETWS) [1]. The connectivity of a LTE device (UE: user equipment) depends on the LTE base station (evolved Node B: eNB which acts as a relay with the Internet. Therefore it is difficult to broadcast early warnings during large-scale disasters.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133075472","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651670
Muhammad Ajmal Khan
In this paper, signal space diversity (SSD) is proposed to integrate into a dual-hop cooperative relay system to enhance its secrecy performance. A complete investigation on secrecy performance of the cooperative system with a decode- and-forward (DF) relay using SSD over Rayleigh fading channels is carried out in this paper. Due to SSD, both source and intermediate relay cooperate to transmit two different symbols to the destination, thus its mutual information and secrecy capacity is higher than the conventional dual-hop cooperative relay system. Therefore, secrecy analysis of SSD-based cooperative relay system is completely different than conventional dual-hop cooperative relay system. Moreover, secrecy outage probability of the SSD-based cooperative system is compared with the conventional dual-hop cooperative system and it is confirmed that SSD-based cooperative system outperforms the conventional cooperative system. In this paper, the closed-form expressions for the secrecy outage probability, and intercept probability of the SSD-based cooperative system are derived and validated through Monte Carlo simulations. Furthermore, the impact of imperfect channel estimation on the secrecy performance of the SSD-based cooperative relay system is investigated.
{"title":"Secrecy Enhancement of Dual-Hop Cooperative Relay System Using Signal Space Diversity","authors":"Muhammad Ajmal Khan","doi":"10.1109/CCNC.2019.8651670","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651670","url":null,"abstract":"In this paper, signal space diversity (SSD) is proposed to integrate into a dual-hop cooperative relay system to enhance its secrecy performance. A complete investigation on secrecy performance of the cooperative system with a decode- and-forward (DF) relay using SSD over Rayleigh fading channels is carried out in this paper. Due to SSD, both source and intermediate relay cooperate to transmit two different symbols to the destination, thus its mutual information and secrecy capacity is higher than the conventional dual-hop cooperative relay system. Therefore, secrecy analysis of SSD-based cooperative relay system is completely different than conventional dual-hop cooperative relay system. Moreover, secrecy outage probability of the SSD-based cooperative system is compared with the conventional dual-hop cooperative system and it is confirmed that SSD-based cooperative system outperforms the conventional cooperative system. In this paper, the closed-form expressions for the secrecy outage probability, and intercept probability of the SSD-based cooperative system are derived and validated through Monte Carlo simulations. Furthermore, the impact of imperfect channel estimation on the secrecy performance of the SSD-based cooperative relay system is investigated.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115618673","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651830
Saud Khan, K. S. Khan, S. Shin
This paper presents an integrating concept of de-noising convolutional neural networks (DnCNN) with quadrature amplitude modulation (QAM) for symbol denoising. DnCNN is used to estimate and denoise the Gaussian noise from the received constellation symbols of QAM with unknown noise level. Proposed system shows a significant gain in terms of peak signal-to-noise ratio, system throughput and bit-error rate; in comparison with conventional QAM systems. The basic concept, system level integration, and simulated performance gains are presented to elucidate the concept.
{"title":"Symbol Denoising in High Order M-QAM using Residual learning of Deep CNN","authors":"Saud Khan, K. S. Khan, S. Shin","doi":"10.1109/CCNC.2019.8651830","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651830","url":null,"abstract":"This paper presents an integrating concept of de-noising convolutional neural networks (DnCNN) with quadrature amplitude modulation (QAM) for symbol denoising. DnCNN is used to estimate and denoise the Gaussian noise from the received constellation symbols of QAM with unknown noise level. Proposed system shows a significant gain in terms of peak signal-to-noise ratio, system throughput and bit-error rate; in comparison with conventional QAM systems. The basic concept, system level integration, and simulated performance gains are presented to elucidate the concept.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115079729","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651756
Anh Huy Nguyen, Y. Tanigawa, H. Tode
With the rapid increase in IoT (Internet of Things) applications, more sensor devices, generating periodic data flows whose packets are transmitted at regular intervals, are being incorporated into WSNs (Wireless Sensor Networks). However, packet collision caused by the hidden node problem becomes serious particularly in large-scale multi-hop WSNs. Moreover, focusing on periodic data flows, continuous packet collisions among periodic data flows are caused once periodic packet transmission phases are synchronized. In this paper, we tackle the compounded negative effect of the hidden node problem and the continuous collision problem among periodic data flows. To realize this objective, we propose a new MAC layer mechanism. The proposed method predicts risky durations during which collision can be caused by hidden nodes by taking into account periodic characteristics of data packet generation. In the risky duration, each sensor node stops the transmission of packets in order to avoid collisions. To the best of our knowledge, this is the first paper that considers the compounded effect of hidden nodes and continuous collisions among periodic data flows. Other advantages of the proposed method include that any new control packets are not required and it can be implemented in widelydiffused IEEE 802.11 and IEEE 802.15.4 devices.
{"title":"Channel Access Control for Collisions Caused by Hidden Nodes and Phase Synchronization among Periodic Data Flows","authors":"Anh Huy Nguyen, Y. Tanigawa, H. Tode","doi":"10.1109/CCNC.2019.8651756","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651756","url":null,"abstract":"With the rapid increase in IoT (Internet of Things) applications, more sensor devices, generating periodic data flows whose packets are transmitted at regular intervals, are being incorporated into WSNs (Wireless Sensor Networks). However, packet collision caused by the hidden node problem becomes serious particularly in large-scale multi-hop WSNs. Moreover, focusing on periodic data flows, continuous packet collisions among periodic data flows are caused once periodic packet transmission phases are synchronized. In this paper, we tackle the compounded negative effect of the hidden node problem and the continuous collision problem among periodic data flows. To realize this objective, we propose a new MAC layer mechanism. The proposed method predicts risky durations during which collision can be caused by hidden nodes by taking into account periodic characteristics of data packet generation. In the risky duration, each sensor node stops the transmission of packets in order to avoid collisions. To the best of our knowledge, this is the first paper that considers the compounded effect of hidden nodes and continuous collisions among periodic data flows. Other advantages of the proposed method include that any new control packets are not required and it can be implemented in widelydiffused IEEE 802.11 and IEEE 802.15.4 devices.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115237144","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651809
T. Dinh, P. Ha
Beacon-enabled IEEE 802.15.4 standard has been widely applied for industrial applications because it can provide contention-free access by using guaranteed time slots (GTSs) in contention-free period (CFP) of a super frame. In IEEE 802.15.4 networks, sensors can also request GTSs for purpose of reliable communication. In existing GTS scheduling studies, however, a sensor wishing to use GTSs has to send a GTS request to a network coordinator. The sending of the GTS request by using carrier sense multiple access with collision avoidance (CSMA/CA) algorithm in fact creates more traffic in the networks. This results in more collisions and packets blocking probability. In addition, if the transmission of GTS request is failed, bandwidth utilization can be low because all GTSs are not allocated. This paper therefore proposes an advanced GTS scheduling (AGS) algorithm, applied in homogeneous networks, to solve those problems. The proposed algorithm eliminates the sending GTS request and allocates GTSs to sensors based on their time order of discovery and the observation of actual allocated GTS usage. Simulation results show that AGS algorithm improves the performance of IEEE 802.15.4 networks in term of bandwidth utilization, packet blocking probability and number of collision per transmission request. In some scenarios, packet blocking probability is reduced about 30 %.
{"title":"Advanced GTS Scheduling in IEEE 802.15.4 Networks for Industrial Application","authors":"T. Dinh, P. Ha","doi":"10.1109/CCNC.2019.8651809","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651809","url":null,"abstract":"Beacon-enabled IEEE 802.15.4 standard has been widely applied for industrial applications because it can provide contention-free access by using guaranteed time slots (GTSs) in contention-free period (CFP) of a super frame. In IEEE 802.15.4 networks, sensors can also request GTSs for purpose of reliable communication. In existing GTS scheduling studies, however, a sensor wishing to use GTSs has to send a GTS request to a network coordinator. The sending of the GTS request by using carrier sense multiple access with collision avoidance (CSMA/CA) algorithm in fact creates more traffic in the networks. This results in more collisions and packets blocking probability. In addition, if the transmission of GTS request is failed, bandwidth utilization can be low because all GTSs are not allocated. This paper therefore proposes an advanced GTS scheduling (AGS) algorithm, applied in homogeneous networks, to solve those problems. The proposed algorithm eliminates the sending GTS request and allocates GTSs to sensors based on their time order of discovery and the observation of actual allocated GTS usage. Simulation results show that AGS algorithm improves the performance of IEEE 802.15.4 networks in term of bandwidth utilization, packet blocking probability and number of collision per transmission request. In some scenarios, packet blocking probability is reduced about 30 %.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114577389","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651799
Somayeh Kianpisheh, R. Glitho
The fifth generation (5G) utilizes Network Functions Virtualization (NFV) and Software Defined Network (SDN) to provide applications. Among them, there are deadline constrained applications. When the traffic generated by applications traverses Virtual Network Functions (VNFs) chains, it may not be possible to meet the deadlines when the traffic is processed sequentially; even if very fast servers are provisioned to host the VNFs. We propose a parallel VNF processing approach for the traffic. This is done through pools of candidate servers that host VNFs which process the traffic. Considering the routing policy provided by the SDN routing application, the server selection problem with the aim of deadline satisfaction and cost minimization is modeled as a non-linear binary optimization problem. An iterative search algorithm is proposed to solve this problem. Simulations show enhancement in deadline satisfaction as well as cost reduction.
5G(第五代)技术通过NFV (Network Functions Virtualization)和SDN (Software Defined Network)提供应用。其中，有期限限制的申请。当应用程序产生的流量穿越虚拟网络功能链时，按顺序处理流量时可能无法满足截止日期;即使提供了非常快的服务器来托管VNFs。我们提出了一种并行的VNF处理方法。这是通过承载处理流量的VNFs的候选服务器池完成的。考虑到SDN路由应用程序提供的路由策略，将服务器选择问题建模为一个非线性的二元优化问题，以满足时间期限和成本最小为目标。为了解决这一问题，提出了一种迭代搜索算法。仿真结果表明，该方法提高了工期满意度，降低了成本。
{"title":"Cost-Efficient Server Provisioning for Deadline-Constrained VNFs Chains: A Parallel VNF Processing Approach","authors":"Somayeh Kianpisheh, R. Glitho","doi":"10.1109/CCNC.2019.8651799","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651799","url":null,"abstract":"The fifth generation (5G) utilizes Network Functions Virtualization (NFV) and Software Defined Network (SDN) to provide applications. Among them, there are deadline constrained applications. When the traffic generated by applications traverses Virtual Network Functions (VNFs) chains, it may not be possible to meet the deadlines when the traffic is processed sequentially; even if very fast servers are provisioned to host the VNFs. We propose a parallel VNF processing approach for the traffic. This is done through pools of candidate servers that host VNFs which process the traffic. Considering the routing policy provided by the SDN routing application, the server selection problem with the aim of deadline satisfaction and cost minimization is modeled as a non-linear binary optimization problem. An iterative search algorithm is proposed to solve this problem. Simulations show enhancement in deadline satisfaction as well as cost reduction.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115407703","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651865
Shuan He, Wei Wang, K. Sohraby
Improving Quality of Experience (QoE) of User Equipment (UE) in wireless multimedia services is a critical challenge. In this paper we study the joint design of high level dynamic video Quantization Parameter (QP) and the low level power control in QoE-driven downlink wireless multimedia services. Furthermore, we study QoE performance with new Non-Orthogonal Multiple Access (NOMA) schemes in the Base Station (BS) – UE multimedia downlink, and discuss the performance in comparison with conventional Orthogonal Multiple Access (OMA). We mathematically model UE’s QoE gain (also known as utility) by considering UE’s perceived data quality and the corresponding data cost. Then we show that there exists an optimal data consumption option for UE to achieve utility maximization based on different cost coefficients. In addition, the power allocation strategies and their associated constraints are investigated in both OMA and NOMA transmission schemes. Finally, through numerical simulations, we quantitatively analyze the impact of low level power allocation and high level QP control on UEs’ utility gain and the system throughput performance.
{"title":"Joint High Level QP and Low Level Power Control in NOMA/OMA Downlink Wireless Multimedia Communications","authors":"Shuan He, Wei Wang, K. Sohraby","doi":"10.1109/CCNC.2019.8651865","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651865","url":null,"abstract":"Improving Quality of Experience (QoE) of User Equipment (UE) in wireless multimedia services is a critical challenge. In this paper we study the joint design of high level dynamic video Quantization Parameter (QP) and the low level power control in QoE-driven downlink wireless multimedia services. Furthermore, we study QoE performance with new Non-Orthogonal Multiple Access (NOMA) schemes in the Base Station (BS) – UE multimedia downlink, and discuss the performance in comparison with conventional Orthogonal Multiple Access (OMA). We mathematically model UE’s QoE gain (also known as utility) by considering UE’s perceived data quality and the corresponding data cost. Then we show that there exists an optimal data consumption option for UE to achieve utility maximization based on different cost coefficients. In addition, the power allocation strategies and their associated constraints are investigated in both OMA and NOMA transmission schemes. Finally, through numerical simulations, we quantitatively analyze the impact of low level power allocation and high level QP control on UEs’ utility gain and the system throughput performance.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123544234","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651732
Alexander Kropp, Robert-Steve Schmoll, Giang T. Nguyen, F. Fitzek
This demonstrator, which is completely realized in software and hardware, shows the influence of latency in a very descriptive and interactive way with the example of a Mobile Edge Cloud or legacy cloud operated ball sorting machine. The demonstrator has every essential element that would be found in a real production machine or control loop. It consists of a sensor, a controller and several actuators. Through the Control and Monitoring Interface, the audience of the demo has a simple and self-explanatory way to interact with the demonstrator. In addition the advantages of Multi-access Edge Computing compared to legacy cloud computing and embedded computing are explained in the context of industry 4.0.
{"title":"Demonstration of a 5G Multi-access Edge Cloud Enabled Smart Sorting Machine for Industry 4.0","authors":"Alexander Kropp, Robert-Steve Schmoll, Giang T. Nguyen, F. Fitzek","doi":"10.1109/CCNC.2019.8651732","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651732","url":null,"abstract":"This demonstrator, which is completely realized in software and hardware, shows the influence of latency in a very descriptive and interactive way with the example of a Mobile Edge Cloud or legacy cloud operated ball sorting machine. The demonstrator has every essential element that would be found in a real production machine or control loop. It consists of a sensor, a controller and several actuators. Through the Control and Monitoring Interface, the audience of the demo has a simple and self-explanatory way to interact with the demonstrator. In addition the advantages of Multi-access Edge Computing compared to legacy cloud computing and embedded computing are explained in the context of industry 4.0.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123857705","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 : 2019-01-01DOI: 10.1109/CCNC.2019.8651699
Chhaya Bharti, M. Kanagarathinam, S. Srivastava, Milim Lee, JaeKwang Han, Wangkeun Oh
Exponential growth in the number of subscribers intrigued Mobile Network Operators(MNOs) to invest substantial efforts towards the faster transition to IPv6 address. The current solution deployed by leading MNOs uses Dual IP 464XLAT to achieve address translation. There has been significant research on the dual IP system. However, an important area of study which is not investigated in detail is the correlation of 464XLAT in the multi-core architecture. We investigate the effects of this architecture on bandwidth utilization of mobile Smartphones with emphasis on multi-core scheduling algorithm. In this paper, we propose a novel networking packet scheduling scheme called CAA - CLAT Aware Affinity Scheduler for Next Generation Mobile Networks. CAA classifies the packets according to the characteristics and efficiently schedules among the CPU cores at its best effort for improved throughput in Dual Stack Smartphones. We also propose CAA-LITE, a lightweight version where the affinity scheduling is static with minimal steps. To illustrate the effectiveness of our proposed method, we conducted simulations in our lab at Samsung R&D India Bangalore and live air experiments in Samsung Electronics, South Korea. Our live air experiments show that the CAA outperforms the legacy by improving the throughput of around 90% under various operational conditions consistently. Moreover, our power consumption test shows that the CAA improves the power by 22% compared to original approaches.
{"title":"CAA: CLAT Aware Affinity Scheduler for Next Generation Mobile Networks","authors":"Chhaya Bharti, M. Kanagarathinam, S. Srivastava, Milim Lee, JaeKwang Han, Wangkeun Oh","doi":"10.1109/CCNC.2019.8651699","DOIUrl":"https://doi.org/10.1109/CCNC.2019.8651699","url":null,"abstract":"Exponential growth in the number of subscribers intrigued Mobile Network Operators(MNOs) to invest substantial efforts towards the faster transition to IPv6 address. The current solution deployed by leading MNOs uses Dual IP 464XLAT to achieve address translation. There has been significant research on the dual IP system. However, an important area of study which is not investigated in detail is the correlation of 464XLAT in the multi-core architecture. We investigate the effects of this architecture on bandwidth utilization of mobile Smartphones with emphasis on multi-core scheduling algorithm. In this paper, we propose a novel networking packet scheduling scheme called CAA - CLAT Aware Affinity Scheduler for Next Generation Mobile Networks. CAA classifies the packets according to the characteristics and efficiently schedules among the CPU cores at its best effort for improved throughput in Dual Stack Smartphones. We also propose CAA-LITE, a lightweight version where the affinity scheduling is static with minimal steps. To illustrate the effectiveness of our proposed method, we conducted simulations in our lab at Samsung R&D India Bangalore and live air experiments in Samsung Electronics, South Korea. Our live air experiments show that the CAA outperforms the legacy by improving the throughput of around 90% under various operational conditions consistently. Moreover, our power consumption test shows that the CAA improves the power by 22% compared to original approaches.","PeriodicalId":285899,"journal":{"name":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125364413","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
扫码关注我们
求助内容：
应助结果提醒方式：