Pub Date : 2019-01-01DOI: 10.1109/ICOIN.2019.8718107
Zhipeng Cheng, Yuliang Tang, Haijie Wu
Task offloading is a cost-effective way to allow users to obtain better service by offloading the computation intensive tasks to the fog or cloud computing nodes.Many previous work have been done and many of them focus on where to offload the task and how to split the task for cooperative execution.However,few of them consider task offloading in 5G flexible radio access network(F-RAN) and split the task according to the flexible functional split between the central unit(CU) and distributed unit(DU).In this paper, we study the task offloading in 5G F-RAN and combine the task split with flexible functional split. We firstly formulate a multiuser offloading decision problem as a energy consumption minimization problem which results in a trade-off between energy consumption and delay tolerance.In view of the characteristics of 5G F-RAN, the fronthaul and backhaul network are taken into consideration when calculating the energy consumption and delay. We split the task according to the flexible functional split between CU and DU for cooperative execution when the task is offloaded.Numerical simulations show that our proposed model can reduce the energy consumption and execution delay.
{"title":"Joint Task Offloading and Flexible Functional Split in 5G Radio Access Network","authors":"Zhipeng Cheng, Yuliang Tang, Haijie Wu","doi":"10.1109/ICOIN.2019.8718107","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718107","url":null,"abstract":"Task offloading is a cost-effective way to allow users to obtain better service by offloading the computation intensive tasks to the fog or cloud computing nodes.Many previous work have been done and many of them focus on where to offload the task and how to split the task for cooperative execution.However,few of them consider task offloading in 5G flexible radio access network(F-RAN) and split the task according to the flexible functional split between the central unit(CU) and distributed unit(DU).In this paper, we study the task offloading in 5G F-RAN and combine the task split with flexible functional split. We firstly formulate a multiuser offloading decision problem as a energy consumption minimization problem which results in a trade-off between energy consumption and delay tolerance.In view of the characteristics of 5G F-RAN, the fronthaul and backhaul network are taken into consideration when calculating the energy consumption and delay. We split the task according to the flexible functional split between CU and DU for cooperative execution when the task is offloaded.Numerical simulations show that our proposed model can reduce the energy consumption and execution delay.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"1 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125727406","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/ICOIN.2019.8718121
Heekwang Kim, K. Chung
HTTP (HyperText Transfer Protocol) adaptive streaming has been receiving attention to provide video streaming services efficiently by adaptively adjusting the transmission rate. With the demand of high-quality video streaming, since mobile devices are now equipped with multiple wireless interfaces connected to different networks (3G/4G or WiFi), one possible solution to provide better QoE (Quality of Experience) is to use multipath protocols. In HTTP adaptive streaming system, the player generates an ON/OFF traffic pattern during the steady state. It degrades the bandwidth utilization and the user QoE. In this paper, we propose a collective segment request policy of HTTP adaptive streaming in multipath environments to improve the bandwidth utilization. In our scheme, the player requests a group of segments in periodical interval to reduce the OFF period. We also present the rate adaptation scheme to improve the average bitrate. Through simulation, we prove that our scheme significantly improves bandwidth utilization and increase average bitrate.
HTTP (HyperText Transfer Protocol，超文本传输协议)自适应流媒体技术通过自适应调整传输速率，高效地提供视频流媒体服务，已成为人们关注的焦点。随着高质量视频流的需求，由于移动设备现在配备了连接到不同网络(3G/4G或WiFi)的多个无线接口，提供更好的QoE(体验质量)的一个可能的解决方案是使用多路径协议。在HTTP自适应流系统中，播放器在稳定状态下产生一个ON/OFF流量模式。这会降低带宽利用率和用户qos。本文提出了一种多径环境下的HTTP自适应流的集合分段请求策略，以提高带宽利用率。在我们的方案中，玩家以周期性间隔请求一组片段以减少OFF周期。为了提高平均比特率，我们还提出了一种速率自适应方案。通过仿真，我们证明了该方案显著提高了带宽利用率和平均比特率。
{"title":"Collective Segment Request Policy of HTTP Adaptive Streaming in Multipath Environments","authors":"Heekwang Kim, K. Chung","doi":"10.1109/ICOIN.2019.8718121","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718121","url":null,"abstract":"HTTP (HyperText Transfer Protocol) adaptive streaming has been receiving attention to provide video streaming services efficiently by adaptively adjusting the transmission rate. With the demand of high-quality video streaming, since mobile devices are now equipped with multiple wireless interfaces connected to different networks (3G/4G or WiFi), one possible solution to provide better QoE (Quality of Experience) is to use multipath protocols. In HTTP adaptive streaming system, the player generates an ON/OFF traffic pattern during the steady state. It degrades the bandwidth utilization and the user QoE. In this paper, we propose a collective segment request policy of HTTP adaptive streaming in multipath environments to improve the bandwidth utilization. In our scheme, the player requests a group of segments in periodical interval to reduce the OFF period. We also present the rate adaptation scheme to improve the average bitrate. Through simulation, we prove that our scheme significantly improves bandwidth utilization and increase average bitrate.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134256287","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/ICOIN.2019.8718126
Yena Jeong, Dongyeop Hwang, Ki-Hyung Kim
In this paper, we propose a video surveillance system based on blockchain system. The proposed system consists of a blockchain network with trusted internal managers. The metadata of the video is recorded on the distributed ledger of the blockchain, thereby blocking the possibility of forgery of the data. The proposed architecture encrypts and stores the video, creates a license within the blockchain, and exports the video. Since the decryption key for the video is managed by the private DB of the blockchain, it is not leaked by the internal manager unauthorizedly. In addition, the internal administrator can manage and export videos safely by exporting the license generated in the blockchain to the DRM-applied video player.
{"title":"Blockchain-Based Management of Video Surveillance Systems","authors":"Yena Jeong, Dongyeop Hwang, Ki-Hyung Kim","doi":"10.1109/ICOIN.2019.8718126","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718126","url":null,"abstract":"In this paper, we propose a video surveillance system based on blockchain system. The proposed system consists of a blockchain network with trusted internal managers. The metadata of the video is recorded on the distributed ledger of the blockchain, thereby blocking the possibility of forgery of the data. The proposed architecture encrypts and stores the video, creates a license within the blockchain, and exports the video. Since the decryption key for the video is managed by the private DB of the blockchain, it is not leaked by the internal manager unauthorizedly. In addition, the internal administrator can manage and export videos safely by exporting the license generated in the blockchain to the DRM-applied video player.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132228177","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}
Recently, research on medium access control(MAC) protocol with sinks and mobile sensor nodes is done actively. In wireless sensor networks(WSNs), performance on energy efficiency is important because sensor nodes have limited energy resources and any kind of operation failure of sensors might disrupt the entire network. 3-dimensional group management MAC(3-D GM-MAC) is a MAC protocol designed for 3-dimensional wireless mobile sensor networks. In this paper, we have proposed an updated version of 3-D GM-MAC with some fixed sensor nodes. Also, we have shown that the proposed scheme improves the stability of WSN by sending and receiving guaranteed information to/from sensor nodes. With the computer simulation results, the proposed scheme achieves about 43.4% reduction in a group number resetting compared to that of the original 3-D GM-MAC, and increases the whole life time of the network about 10% more than the original one.
{"title":"3-D GM-MAC with Fixed Sensor Nodes for Stability Improvement","authors":"Yoonkyung Jang, Ahreum Shin, Myeongseung Han, Intae Ryoo","doi":"10.1109/ICOIN.2019.8717980","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8717980","url":null,"abstract":"Recently, research on medium access control(MAC) protocol with sinks and mobile sensor nodes is done actively. In wireless sensor networks(WSNs), performance on energy efficiency is important because sensor nodes have limited energy resources and any kind of operation failure of sensors might disrupt the entire network. 3-dimensional group management MAC(3-D GM-MAC) is a MAC protocol designed for 3-dimensional wireless mobile sensor networks. In this paper, we have proposed an updated version of 3-D GM-MAC with some fixed sensor nodes. Also, we have shown that the proposed scheme improves the stability of WSN by sending and receiving guaranteed information to/from sensor nodes. With the computer simulation results, the proposed scheme achieves about 43.4% reduction in a group number resetting compared to that of the original 3-D GM-MAC, and increases the whole life time of the network about 10% more than the original one.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126937323","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/ICOIN.2019.8717977
Phuylai Oeung, Fuke Shen
Machine learning (ML)-based traffic classification has been gaining increasing importance due to the declining port-based and payload-based approaches. However, the packet-level method is the most common measure used in the previous works, which requires additional hardware device to manage and monitor, increasing cost as well as extra works of the network personnel. In this paper, we propose a methodology to build an efficient classifier from NetFlow which is the widely applied monitoring solution among network operators in the form of flow-level. First, we analyze the per-application performance through the C4.5 decision tree with the features derived from the NetFlow records. The result shows that the accuracy obtained is as good as the packet-level method. We further propose the ensemble feature selection (FS) method to improve the classification accuracy and to reduce the computational complexity. Lastly, we present the clustering-based under-sampling combining with synthetic minority over-sampling technique (SMOTE) approach to solving the problem of the concept drift and the imbalanced dataset, and we extract insights and recommendation for practical application. With the combination of proposed methods, the experiment result reports high F-measure over two traces containing the wide range of applications with low computational complexity.
{"title":"Imbalanced Internet Traffic Classification Using Ensemble Framework","authors":"Phuylai Oeung, Fuke Shen","doi":"10.1109/ICOIN.2019.8717977","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8717977","url":null,"abstract":"Machine learning (ML)-based traffic classification has been gaining increasing importance due to the declining port-based and payload-based approaches. However, the packet-level method is the most common measure used in the previous works, which requires additional hardware device to manage and monitor, increasing cost as well as extra works of the network personnel. In this paper, we propose a methodology to build an efficient classifier from NetFlow which is the widely applied monitoring solution among network operators in the form of flow-level. First, we analyze the per-application performance through the C4.5 decision tree with the features derived from the NetFlow records. The result shows that the accuracy obtained is as good as the packet-level method. We further propose the ensemble feature selection (FS) method to improve the classification accuracy and to reduce the computational complexity. Lastly, we present the clustering-based under-sampling combining with synthetic minority over-sampling technique (SMOTE) approach to solving the problem of the concept drift and the imbalanced dataset, and we extract insights and recommendation for practical application. With the combination of proposed methods, the experiment result reports high F-measure over two traces containing the wide range of applications with low computational complexity.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116791848","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/ICOIN.2019.8718133
T. Wong, Gaik-Yee Chan, Fang-Fang Chua
Cloud Computing acts as a paradigm to support on-demand computing services, from applications to storage, manage and processing capabilities. One of the major challenges in delivering and accessing cloud applications is the management of Quality of Service (QoS) and cloud service providers are mandated to adhere to Service Level Agreement (SLA) in providing quality cloud services to the users. The agreement matching is important for both parties to ensure satisfaction and expectation level. This proposed work aims to resolve cloud QoS violation with the implementation of adaptive preventive and remedial mechanisms. Preventive measure such as horizontal scaling is used to optimize the performance of a running cloud service in order to prevent the cloud service to downgrade to QoS violation condition. Remedial action on the other hand, is to provide fault tolerance using replication for faulty cloud service to recover from failure incidents or already violation condition. Experimental results have demonstrated the feasibility and effectiveness of applying horizontal scaling in preventing and replication in rectifying cloud QoS violations based on response time and throughput.
{"title":"Adaptive Preventive and Remedial Measures in Resolving Cloud Quality of Service Violation","authors":"T. Wong, Gaik-Yee Chan, Fang-Fang Chua","doi":"10.1109/ICOIN.2019.8718133","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718133","url":null,"abstract":"Cloud Computing acts as a paradigm to support on-demand computing services, from applications to storage, manage and processing capabilities. One of the major challenges in delivering and accessing cloud applications is the management of Quality of Service (QoS) and cloud service providers are mandated to adhere to Service Level Agreement (SLA) in providing quality cloud services to the users. The agreement matching is important for both parties to ensure satisfaction and expectation level. This proposed work aims to resolve cloud QoS violation with the implementation of adaptive preventive and remedial mechanisms. Preventive measure such as horizontal scaling is used to optimize the performance of a running cloud service in order to prevent the cloud service to downgrade to QoS violation condition. Remedial action on the other hand, is to provide fault tolerance using replication for faulty cloud service to recover from failure incidents or already violation condition. Experimental results have demonstrated the feasibility and effectiveness of applying horizontal scaling in preventing and replication in rectifying cloud QoS violations based on response time and throughput.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127109876","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/icoin.2017.7899592
{"title":"Conference Room Map","authors":"","doi":"10.1109/icoin.2017.7899592","DOIUrl":"https://doi.org/10.1109/icoin.2017.7899592","url":null,"abstract":"","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127761011","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/ICOIN.2019.8718153
Ali Gohar, A. Raza, Sanghwan Lee
To cope up with increasing video traffic demands over the Internet, Dynamic Adaptive streaming over HTTP (DASH) is gradually being adopted. It provides a convenient approach to stream multimedia in an adaptive and dynamic way to heterogeneous end devices. But it has its disadvantages which include storage of multimedia content, congestion in the delivery network or access link due to sudden increase in the requests, end-to-end delay, inefficient network bandwidth utilization etc. These unfavorable circumstances limit the number of user requests and efficient utilization of network bandwidth. Therefore, in this paper we propose Dynamic Multi Path Finder (DMPF) algorithm. DMPF uses multi-path TCP (MPTCP) to transmit different Scalable Video Coding (SVC) layers, over Moving Picture Experts Group (MPEG) DASH standard in software defined network (SDN). DMPF accommodates maximum multimedia requests by DASH Clients while utilizing the network bandwidth efficiently by dynamically adapting to the varying connection characteristics. In order to test the efficiency of the DMPF, we compare its performance with Baseline Algorithm. We describe our implementation on a real network topology and show that in a simulated environment our proposed algorithm outperforms the Baseline Algorithm in accommodating requests while utilizing the network bandwidth efficiently.
为了应对互联网日益增长的视频流量需求，动态自适应流媒体技术(Dynamic Adaptive streaming over HTTP, DASH)正逐渐被采用。它提供了一种方便的方法，以自适应和动态的方式将多媒体流传输到异构的终端设备。但它也有其缺点，如多媒体内容的存储、传输网络或接入链路因请求突然增加而出现拥塞、端到端延迟、网络带宽利用率低等。这些不利的情况限制了用户请求的数量和对网络带宽的有效利用。因此，本文提出了动态多路径查找器(DMPF)算法。DMPF使用多路径TCP (MPTCP)在软件定义网络(SDN)中的移动图像专家组(MPEG) DASH标准上传输不同的可扩展视频编码(SVC)层。DMPF通过动态适应不同的连接特性，有效地利用网络带宽，同时最大限度地满足DASH客户端的多媒体请求。为了测试DMPF算法的效率，我们将其与基线算法进行了性能比较。我们描述了我们在真实网络拓扑上的实现，并表明在模拟环境中，我们提出的算法在有效利用网络带宽的同时，在容纳请求方面优于基线算法。
{"title":"Dynamic Adaptive Streaming Over HTTP Using Scalable Video Coding with Multipath TCP in SDN","authors":"Ali Gohar, A. Raza, Sanghwan Lee","doi":"10.1109/ICOIN.2019.8718153","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718153","url":null,"abstract":"To cope up with increasing video traffic demands over the Internet, Dynamic Adaptive streaming over HTTP (DASH) is gradually being adopted. It provides a convenient approach to stream multimedia in an adaptive and dynamic way to heterogeneous end devices. But it has its disadvantages which include storage of multimedia content, congestion in the delivery network or access link due to sudden increase in the requests, end-to-end delay, inefficient network bandwidth utilization etc. These unfavorable circumstances limit the number of user requests and efficient utilization of network bandwidth. Therefore, in this paper we propose Dynamic Multi Path Finder (DMPF) algorithm. DMPF uses multi-path TCP (MPTCP) to transmit different Scalable Video Coding (SVC) layers, over Moving Picture Experts Group (MPEG) DASH standard in software defined network (SDN). DMPF accommodates maximum multimedia requests by DASH Clients while utilizing the network bandwidth efficiently by dynamically adapting to the varying connection characteristics. In order to test the efficiency of the DMPF, we compare its performance with Baseline Algorithm. We describe our implementation on a real network topology and show that in a simulated environment our proposed algorithm outperforms the Baseline Algorithm in accommodating requests while utilizing the network bandwidth efficiently.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132346129","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}
Network coding has been shown to be an efficient approach for enhancing video streaming quality. With intersession network coding, intermediate nodes will mix the media packets from different sources. However, packets from different flows may have different transmission rate and this will cause lack of coding opportunity for a period of time. So the relay nodes have to make a decision whether to forward packets directly or wait for the next opportunity to encode. In this paper, a prioritized network coding scheme is proposed to address the problem of mismatched coding opportunities in multiple streams. The base-layer packets of the streaming are received by the destination node with a high probability and the number of sent packets are reduced while taking full advantage of the limited network bandwidth. The experimental results show that the proposed scheme enhances the video quality compared to existing opportunistic coding schemes.
{"title":"Video-Aware Multipath Network Coding over Multi-Hop Wireless Networks","authors":"Huali Cui, Qindong Sun, Beibei Zhang, Xingjun Zhang, Weiguo Wu","doi":"10.1109/ICOIN.2019.8718114","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718114","url":null,"abstract":"Network coding has been shown to be an efficient approach for enhancing video streaming quality. With intersession network coding, intermediate nodes will mix the media packets from different sources. However, packets from different flows may have different transmission rate and this will cause lack of coding opportunity for a period of time. So the relay nodes have to make a decision whether to forward packets directly or wait for the next opportunity to encode. In this paper, a prioritized network coding scheme is proposed to address the problem of mismatched coding opportunities in multiple streams. The base-layer packets of the streaming are received by the destination node with a high probability and the number of sent packets are reduced while taking full advantage of the limited network bandwidth. The experimental results show that the proposed scheme enhances the video quality compared to existing opportunistic coding schemes.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132346838","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/ICOIN.2019.8718155
K. Fukui, K. Tsubouchi, Shigeru Iwashina
In vehicle-to-vehicle communications with the assistance of network (V2N2V), it is important to reduce the end-to-end delay between vehicles. However, the current 5G system as well as existing studies do not satisfy this in some mobility scenarios. To address this issue, we propose three methods that enhance an anchorless routing that follows the concept of Locator/ID Separation Protocol (LISP). In these methods, the control plane node proactively injects mapping information of the vehicle's ID and its locator to suitable user-plane nodes. We show that the proposed methods can reduce the delay by up to 81% than the current 5G System on evaluations using mobility scenarios.
{"title":"A Comparative Study on Anchorless Routing in 5G System","authors":"K. Fukui, K. Tsubouchi, Shigeru Iwashina","doi":"10.1109/ICOIN.2019.8718155","DOIUrl":"https://doi.org/10.1109/ICOIN.2019.8718155","url":null,"abstract":"In vehicle-to-vehicle communications with the assistance of network (V2N2V), it is important to reduce the end-to-end delay between vehicles. However, the current 5G system as well as existing studies do not satisfy this in some mobility scenarios. To address this issue, we propose three methods that enhance an anchorless routing that follows the concept of Locator/ID Separation Protocol (LISP). In these methods, the control plane node proactively injects mapping information of the vehicle's ID and its locator to suitable user-plane nodes. We show that the proposed methods can reduce the delay by up to 81% than the current 5G System on evaluations using mobility scenarios.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130626709","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
扫码关注我们
求助内容：
应助结果提醒方式：