Poster Sessions

 

 

Poster Session 1: Tuesday, September 22, 2020, 13:30 ~ 15:30,  (Online: Track 1)    
Chair: Haneul Ko (Korea Univ., Korea)
PS1-1 Event-Triggered Media Stream Bandwidth Adjustment in IoT-Based Home Networks      

Abstract

   As the coming maturity of Internet of Things, many home-networked devices with various sensors are deployed in residential environments. It is important to accommodate many devices that compete for bandwidth allocation to transmit data inwards and outwards through a certain home network domain. This paper proposes a novel mechanism which can adjust media stream qualities and transmission bandwidth allocations to different devices. This mechanism is agile against dynamic changes of data workload and finite network resources between inside and outside of a home network. Practical demonstration exhibits that the effects are able to maintain differentiated media transfer services in IoT-based home networks.

Chao-Yu Hsu*, Chih-Lin Hu*, Kun-Sheng Huang*, Yung-Hui Chen**, Jiun-Long Huang***

(*National Central Univ., Taiwan; **LungHwa Univ. of Science and Technology, Taiwan; ***National Chiao Tung Univ., Taiwan )

PS1-2 Joint Analysis of Port and Protocol via Endpoint Measurement: An Empirical Study     

Abstract

   As network services continuously evolving, accurately classifying traffic is important for network operators to optimize QoS and customize policy. Network service uses non-standard ports and protocol obfuscation causing damage to the accurate port-based and payload-based traffic classification. However, Deep Packet Inspection (DPI) technique, which combines the payload-based method and port-based method, is still adopted by practitioners from the academic and industrial community. In this paper, we investigate the DPI classification result on a large network to estimate the impact of two factors. We qualify the popularity of non-standard port among different protocols. By endpoint filtering, we discover a large proportion of non-standard ports are opened temporally. We show there still is strong association between P2P protocols and camouflaged protocol. In particular, using both host and label association between endpoints, we find camouflaged protocols exhibit an abnormal port span that is different with the original protocol and are similar to the port span of P2P protocols.

Chengshang Hou, Gaopeng Gou, Gang Xiong, Zhen Li

(*Institute of Information Engineering, Chinese Academy of Sciences, China; **Schools of Cyber Security, Univ. of Chinese Academy of Sciences, China )

PS1-3 Utilization of the Blockchain Network in the Public Community Health Center Medicine Supply Chain     

Abstract

   Distribution of medicine in the public health community centers has been regulated and monitored in an official distribution channel. However, counterfeit medications still circulate in the community. Circulation of counterfeit medicines is caused by factors from businesses, consumers, and medicine distribution supervision. The use of blockchain technology in supply-chain has shown new breakthroughs to overcome these problems since it ensures immutability, transparency, and decentralization of data. In this paper, we proposed a new blockchain-based Medicine Supply Chain Management (MSCM) system. The proposed system has been applied to medicine distribution channels between public community health centers in Indonesia. To evaluate the proposed system, we used JMeter as a benchmarking tool to measure the system performance in terms of transactions per second, latency, and the utilization of resources.

Hartanto Kumiawan, Jung Yeon Kim, Hong Taek Ju (Keimyung Univ., Korea (South) )

PS1-4 Improving Performance of Collaborative Source-Side DDoS Attack Detection     

Abstract

   Recently, as the threat of Distributed Denial-ofService attacks exploiting IoT devices has spread, source-side Denial-of-Service attack detection methods are being studied in order to quickly detect attacks and find their locations. Moreover, to mitigate the limitation of local view of source-side detection, a collaborative attack detection technique is required to share detection results on each source-side network. In this paper, a new collaborative source-side DDoS attack detection method is proposed for detecting DDoS attacks on multiple networks more correctly, by considering the detecting performance on different time zone. The results of individual attack detection on each network are weighted based on detection rate and false positive rate corresponding to the time zone of each network. By gathering the weighted detection results, the proposed method determines whether a DDoS attack happens. Through extensive evaluation with real network traffic data, it is confirmed that the proposed method reduces false positive rate by 35% while maintaining high detection rate.

Sungwoong Yeom, Kyungbaek Kim (Chonnam National Univ., South Korea )

PS1-5 TCP-PPCC: Online-Learning Proximal Policy for Congestion Control      

Abstract

   Effective network congestion control strategies are the key to secure the normal operation of complex and changeable networks. The fundamental assumptions of many existing TCP congestion control variants dominated by hand-crafted heuristic algorithms are no longer valid. We propose an algorithm called TCP-Proximal Policy Congestion Control (TCP-PPCC), which is based on deep reinforcement learning algorithm Proximal Policy Optimization (PPO). TCP-PPCC updates the policy offline from the features of the preceding network state and feedback from the current network environment and adjusts the congestion window online with the updated policy. The senders with TCP-PPCC can learn about the changes in network bandwidth more accurately and adjust the congestion window in time. We demonstrate the performance of TCP-PPCC by comparing it with the traditional congestion control algorithm NewReno in four network scenarios with the ns-3 simulator. The results show that in scenario 2, TCPPPCC takes 58.75% improvement in average delay and 27.80% improvement in throughput compared with NewReno.

Jing Li, Yuyao Guan, Pengpeng Ding, Shiwei Wang (Shanghai Univ. of Electric Power, China )

PS1-6 Task Scheduling System Based on Consensus Algorithm in P2P Network     

Abstract

   Centralized networks can perform task scheduling readily because they can easily collect system information and manage tasks. However, due to the existence of the central nodes, centralized networks have low fault tolerance. On the contrary, peer-to-peer(P2P) networks have higher fault tolerance, but they do not have global information without central nodes. Therefore, how to schedule tasks in a P2P network has become a problem and a challenge. This paper proposes a consensus algorithm to maintain task information in the P2P network and implements a scheduling system to solve this problem. At the same time, it combines the ease of container deployment and migration to improve the efficiency of task scheduling. Besides, the heartbeat mechanism between nodes achieves fault tolerance for nodes. The system can be used in network environments without central nodes, such as mobile Ad hoc networks.

Chenhang Jiao, Yun Wang, Jinbin Tu (Southeast Univ., China )

PS1-7 FingerTalk: Real-time Fingertip Trajectories Tracking Service Based on IoTtalk     

Abstract

   Internet of Things (IoT) integrates with finger tracking and 3D signature verification can provide the user authentication service for these IoT applications which require user identification and authorization, such as the home automation and security system. This work develops two modules. The FingerTalk module provides the fingertip trajectories tracking service based on a Leap Motion camera and IoTtalk. The AirSig module provides 3D signature verification service to recognize whether a signature is signed form the authenticated user. The AirSig module requires only two user signature samples to train the neural network model which significantly reduces the process time for signature collection. The validation results from 10 people show the average accuracy is up to 93.6% on 3D signature verification.

Yun-Wei Lin, Lin-Hang Kao, Chun-Ting Yeh (National Chiao Tung Univ., Taiwan )

PS1-8 Co-Channel Interference Cancellation in OFDMA System     

Abstract

   This paper proposes a co-channel interference (CCI) reduction scheme for cell edge users in OFDM systems using same frequency. The proposed scheme includes a joint channel-estimation method with interpolated sliding window (JCE-ISW) and a joint detection with QRM-MLD based on the maximum interference selection cancellation (QRM-MLDMISC). The proposed method, which is a pilot-based channel estimation method, utilizes an interpolated sliding window method to reduce the influence of CCI on channel estimation. The proposed detection scheme is a joint detection with QRMMLD-MISC. The simulation results show the performance improvement of the proposed method compared with that of conventional methods.

Kwanwoong Ryu*, Joon-Young Jung*, Han-Jae Im** (*ETRI, South Korea; **Huton Co.Ltd, South Korea )

PS1-9 A Study on Performance Improvement of Hyperledger Fabric Through Batched Chaincode     

Abstract

   This paper is to improve the performance of Hyperledger Fabric that is one of the private blockchain opensource projects. The decentralization of data management, which has recently become important, is realized as a blockchain. Blockchain is a technology used in various fields such as data verification, storage, and banking, but performance is one of the important problems and is always mentioned. This is because a transaction must be agreed quickly and recorded in the ledger so that it can be used smoothly in systems that generate tens of thousands of transactions per second, such as banking and card use. Hyperledger fabric sends transactions generated by clients to peer nodes on the network. The transactions are hashed with the previous block in the distributed ledger. Peer nodes collect transactions received from multiple clients and execute chain code for verification, which is then sent to the orderer node and made into blocks. The block created at this time compares hash values to several peer nodes to verify the integrity of the data after verifying the block. Orderer node collects the transactions and is ordering them into the block. In this paper, we proposed to improve the performance of the hyperledger fabric by reducing network latency and the number of transfers by batch processing the process of sending and receiving chain code messages in the process of delivering transactions generated by clients for verification. The results of the performance are expressed in transactions per second(TPS), with the experiment showing that send rate(TPS) nearly doubling to 2302→4244, and throughput(TPS) increasing by about 1.5 times to 1677→2244. As a result of the experiment, send rate and throughput increased by a large margin, the batch processing of chain code messages can perform much higher performance.

JungWon Lee, Park Sejin (Keimyung Univ., South Korea )

PS1-10 IPv6 DoS Attacks Detection Using Machine Learning Enhanced IDS in SDN/NFV Environment     

Abstract

   The rapid growth of IPv6 traffic makes security issues become more important. This paper proposes an IPv6 network security system that integrates signature-based Intrusion Detection Systems (IDS) and machine learning classification technologies to improve the accuracy of IPv6 denial-of-service (DoS) attacks detection. In addition, this paper has also enhanced IPv6 network security defense capabilities through softwaredefined networking (SDN) and network function virtualization (NFV) technologies. The experimental results prove that the detection and defense mechanisms proposed in this paper can effectively strengthen IPv6 network security.

Chia-Wei Tseng, Li-Fan Wu, Shih-Chun Hsu, Sheng -Wang Yu (Chunghwa Telecom Co., LTD., Taiwan )

PS1-11 Comparison of Distance Measurement in Time Series Clustering for Predicting Bitcoin Prices     

Abstract

   Since the development of Bitcoin, the first blockchain-based cryptocurrency, many cryptocurrencies have formed and have traded in markets. The integrity and anonymity of cryptocurrency was enough to raise its value and its price gained worldwide attention. Therefore, many studies are being carried out to predict the price of cryptocurrency for make a profit. We cluster time series through K-Medoids algorithm and train and evaluate each cluster with predictive models. We also examine the predictive performance in Bitcoin price according to the various distance measurement of clustering.

Ui-Jun Baek, Mugon Shin, Min-Seong Lee, Boseon Kim, Jee Tae Park, Myung-Sup Kim (Korea Univ., South Korea )

PS1-12 Dynamic Network Provisioning with AI-enabled Path Planning     

Abstract

   As the number of mobile devices increases and the concept of 5G networks becomes popular, various network infrastructures and services emerge. Also, more users request user-specific network services within limited network resources. Under this complex situation, in order to provide a guaranteed QoS level to users, it requires to consider various factors which affect the performance of network service, and dynamic network provisioning is required. In this paper, we propose a dynamic network provisioning system with AI-enabled path planning, which uses the side channel information such as disaster events, maintenance events, and distribution of users. In this system, we design a user request handler that understands user-specific QoS and spatio-temporal requirements in order to maximize the utilization of a given network resource. Also, this system utilizes side-channel information to optimizing the network provisioning in a realtime manner.

Hong-Nam Quach, Chulwoong Choi, Kyungbaek Kim (Chonnam National Univ., Korea (South) )

 

 

 

 

Poster Session 2: Tuesday, September 22, 2020, 13:30 ~ 15:30,  (Online: Track 2)    
Chair: Ryo Yamamoto (UEC, Japan)
PS2-1 Design and Implementation of Comprehensive Test Automation Method for API Adapter in C-Plane and U-Plane      

Abstract

   The Business-to-Business-to-X (B2B2X) model has increased the importance of orchestrators that build and operate services that consists of various wholesale services. To develop RESTful API-based services, service providers need to catch up on the specifications of new wholesale services and specification changes of existing services quickly and inexpensively. Therefore, it is important to develop software called an API adapter that absorbs API differences from various services quickly and inexpensively. In this paper, we propose a method for comprehensively automating testing of not only C-Plane signals such as service provisioning/change/abolishment but also U-Plane signals such as communication between user devices and servers. We implemented our proposal using open source software and found that it improved test efficiency in an actual software development project.

Sho Kanemaru, Tomoki Ikegaya, Kensuke Takahashi, Tsuyoshi Toyoshima (NTT Corporation, Japan )

PS2-2 Q-learning Based Service Function Chaining Using VNF Resource-aware Reward Model     

Abstract

   With the advent of the 5G network era, it is required to flexibly build and manage networks to meet rapidly changing service requirements. Software-defined networking (SDN) and network function virtualization (NFV) are key technologies that enable flexible network management by transforming networks into software-based networks. Besides, NFV has the advantage of virtualizing network functions, operating those on commercial (COTS) servers, and managing the network functions dynamically. However, the numerous virtual networks and resources created by NFV can cause problems complicating network management. To solve the problems, research on managing complex NFV environments using artificial intelligence (AI) has recently attracted attention. In particular, service function chaining (SFC) is one of the essential NFV technologies, and it is required to create an efficient SFC path in dynamic networks. In this paper, we propose a method of finding optimal SFC path considering the resource utilization of virtual network function (VNF) and VNF placement by using Q-learning, one of the reinforcement learning (RL) algorithms.

Doyoung Lee, Jae-Hyung Yoo, James W. Hong (POSTECH, Korea (South) )

PS2-3 Topology Discovery for Telecommunications-carrier Networks Using Equipment Alarms     

Abstract

   As for the service assurance operation of telecommunications carriers, accurate information about a network topology which indicates the connection relationships between pieces of network equipment is necessary. However, the network of a telecommunications carrier has several hundreds of thousands of equipment, and its topology is frequently supplemented and modified due to daily construction work and troubleshooting. It is a therefore a problem when incorrect topology information is mixed into the overall topology information. In this paper, we propose a method that can discover the topology between equipment by using alarm information issued by those equipment during construction work or when a failure occurs. The proposed method was evaluated using alarm information generated under in certain commercial configurations (sections containing specific routers), and it was confirmed that the current topology could be discovered with 100% accuracy, even though only 1.7% of the total topology was evaluated in one day.

Atsushi Takada, Naoki Hayashi, Mizuto Nakamura, Naoyuki Tanji, Toshihiko Seki, Kyoko Yamagoe (NTT Corporation, Japan )

PS2-4 Examining Bitcoin Mempools Resemblance Using Jaccard Similarity Index     

Abstract

   In Bitcoin, memory pool is a space of unconfirmed transactions. when a node receives newly generated transactions, the node verifies it and appends it into the local mempool. The transactions are stored in the mempool until they get included in a newly mined block. Since each node has a different capacity for storing unconfirmed transactions; thus, each node has different transactions stored in mempool. In this paper, we examine the mempool similarity using the Jaccard Index among four Bitcoin full nodes.

Dae-Yong Kim, Meryam Essaid, Hong Taek Ju (Keimyung Univ., Korea (South) )

PS2-5 Hierarchical Identifier (HID)-based 5G Architecture with Backup Slice     

Abstract

   To support network slicing and service function chaining (SFC) at a time, we propose a novel hierarchical identifier (HID)-based 5G architecture. For this, we first introduce HID which consists of network slice selection assistance information (NSSAI) and service path ID (SPI). Based on HID, a user can attach a specific network slice and flows generated by the user can be processed by a set of service functions (SFs) in a sequence. Meanwhile, when the incoming flow to a specific slice unexpectedly increases, the slice cannot handle incoming flow due to its limited capacity, which degrades users’ quality of service (QoS). To alleviate this issue and efficiently utilize network resources, we introduce a concept of the backup slice shared by different services. Evaluation results demonstrate that the proposed architecture can achieve better performance in terms of the average system blocking probability and utilization in dynamic environments.

Haneul Ko, Jaewook Lee, Hongrok Choi, Sangheon Pack (Korea Univ., South Korea )

PS2-6 Dynamic Reverse Proxy Chain Generation for Networks in Data Centers     

Abstract

   Reverse proxy, as one of the important components required by the data center to provide application services, has functions of access control, load balancing, connecting to different types of networks, etc. In the future, as the application services requiring reverse proxy further increase, network types become more and more diverse and complex, and the network hierarchy becomes higher and higher, reverse proxy will change from a single layer to multiple layers to form a reverse proxy chain. The construction of the reverse proxy chain will become one of the bottlenecks of data center networking operation and maintenance
  In this paper, we propose a method of automatically constructing reverse proxy chains to avoid the problem of manual static configuration of the reverse proxy chain which is timeconsuming, laborious, and difficult to maintain. In our softwaredefined networking experiment, we simulated a full-binary-treelike topology of 1534 nodes. We recorded the time to generate and remove proxy chains of various lengths. The average time to generate all reverse proxy chains in the topology consisting of 1534 nodes with 100ms delay is around 5100ms, much smaller than manual configuration, which usually needs several hours.

Yang Bai, Guixin Guo, Yong Wang, Kangyou Zhong, Jiang Li, Yunfei Du

(*Sun Yat-sen Univ., China; **National Supercomputing Center Guangzhou, China )

PS2-7 VM Allocation in Data Center Subject to CPU Percentile Constraints     

Abstract

   At existing cloud computing environment, virtual machine allocation mechanisms have been actively applied to resources management for processing dynamic workload in largescale data center. In this paper, we address the problem of how many virtual machines should be allocated to a server, so that a given percentile of the execution time of a job is bounded by a predefined value. We first consider the case of “dedicated CPU”, whereby we calculate the CPU allocated to a single VM. Subsequently, we extend the analysis to the case where the CPU is shared equally by different groups of VMs. In this case, we calculate how many VMs need to be allocated in each group.

Yue Han*, Harry Perros**, Mingwu Yao***

(*National Univ. of Defense Technology, China; **North Carolina State Univ., USA; ***Xidian Univ., China )

PS2-8 Effect of Packet Loss and Delay on V2X Data Fusion     

Abstract

   Sensing data fusion is one of the most important technologies in autonomous driving. Its performance depends on advance communication technology. Cellular-Vehicle to Everything (C-V2X) initially defined as LTE V2X in 3GPP Release 14 is a solution for vehicle communication that includes Vehicleto-Infrastructure (V2I), Vehicle-to-person (V2P), and Vehicle-toVehicle (V2V). Although 4G LTE and 5G provides high-speed transmission, packet loss and delay are still inevitable. Packet loss and delay affect the safety of autonomous driving, especially for the judgment of emergency. In this paper, we compare the accuracy of data fusion under different rate of packet loss and broadcast frequency on the simulated platform CALAR. And we propose a skill to improve accuracy. Experiments show that the proposed skill significantly alleviates the effect of communication packet loss and delay on the accuracy of V2X data fusion.

Tsu-Kuang Lee*, Jen-Jee Chen*, Yu-Chee Tseng*, Cheng-Kuan Lin**

(*National Chiao Tung Univ., Taiwan; **Fuzhou Univ., China )

PS2-9 End-to-end Service Assurance in 5G Crosshaul Networks     

Abstract

   More and more telecom operators around the world began to build and to deploy fifth-generation (5G) mobile networks. With the advent of 5G service scenarios, it brings new challenges and increases the complexity of management. To deliver good quality of experience of these 5G applications for customers, service assurance is important. In this paper, we propose an end-to-end service assurance solution for 5G crosshaul networks. The 5G crosshaul network architecture consists of fronthaul, midhaul, and backhaul networks. Our solution deployed in 5G trial network in Chunghwa Telecom in Taiwan. The solution focus on slicing service assurance and synchronization monitoring. Besides, our solution adjusts most of network management in the operation support system (OSS) to apply to 5G crosshaul network. Our goal is to provide stable 5G transport network and to assure quality of experience for customers.

Che-Chun Teng, Chen Mei-Chun, Min-Han Hung, Hong-Jie Chen

(Chunghwa Telecom Co., LTD., Taiwan )

PS2-10 Design and Performance Evaluation of Hexagonal Topology Networks with Novel Routing Algorithms        

Abstract

   The heuristic shortest path routing algorithms and performance evaluation are proposed to find the most suitable optical path between the two nodes of the optical switch in hexagonal topology network. The advantages of hexagonal optical switching network are easy to expand and have flexible fault tolerant. If we want to expand hexagonal topology network, we can increase the number of levels. A 7-level hexagonal topology network with 294 nodes has been designed and its routing algorithm has also been designed. Finally, we evaluated the performance of 4-level hexagonal topology network with different algorithms such as SPRA-AI (Shortest Path Routing Algorithm with Artificial Intelligence using decision tree), SPRASPT (Shortest Path Routing Algorithm with Spanning Tree), and SPRA-PDP (Shortest Path Routing Algorithm with Pure Distance Prediction). The simulated traffic mode is also captured from the actual core network to obtain the authenticity of the simulation results.

Yuh Jiuh Cheng, Bor-Tauo Chen, Wen-Lin Cheng

(Chunghwa Telecom Co., LTD., Taiwan )

PS2-11 Switched Digital Video Using Convergence Transmission of Broadcasting and Communication on Cable TV Network

Abstract

   The cable TV network is considered as an optimal network for convergence of broadcasting and communication because it is possible to provide two-way services. Recently, the cable broadcasting network is in shortage of available frequency resources due to high quality broadcasting services, increased demand for VoD, and increased bandwidth of high-speed Internet services. This paper presents a new method for switched digital video (SDV) technology to obtain additional transmission resources in cable broadcasting networks. In the proposed SDV method, communication and broadcasting service share the same frequency band, it is possible to improve the frequency usage efficiency by providing switching of broadcasting channels without complex system construction.

Joon-Young Jung (ETRI, South Korea )

PS2-12 Towards Blockchain-based Stainless Steel Tracking        

Abstract

   Supply chain is an entire network of producing and delivering a specific product to a final consumer. Stainless steel is a specific product being delivered on a supply chain. It is not easy to manage and monitor the entire supply chain because a supply chain has high complexity, including various organizations and activities. Due to this difficulty, several issues occur in the process of supplying stainless steel, such as forgery and alteration. Blockchain is a decentralized and distributed ledger technology that specializes in transparency and immutability. Many companies try to introduce this blockchain technology into supply chain management to conveniently monitor their supply chain. Accordingly, the blockchain technology can make steel companies be able to investigate and protect high-quality products from counterfeited low quality products. This paper proposes a design of a blockchain-based stainless steel tracking system to thoroughly track the entire process involved in supplies from stainless steel mills to the final customers. This proposed design is based on the hyperledger fabric which is one of the most popular private blockchain platforms.

KyungChan Ko*, Changhoon Kang*, Youngbok Park**, Jongsoo Woo*, James W. Hong* (POSTECH, South Korea )

 

 

 

 

Poster Session 3 : Tuesday, September 22, 2020, 16:00 ~ 18:00,  (Online: Track 1)    
Chair: Li-Hsing Yen (National Chiao Tung Univ., Taiwan)
PS3-1 Docker Environment Based Apache Storm and Spark Benchmark Test     

Abstract

   With the development of various technologies such as high-speed Internet and SNS dissemination, there have been many fields that require processing of big data generated in real time. Accordingly, real-time streaming data processing technology has been developed, and representative platforms include Apache Storm, Apache Spark, and Hadoop. These processing technologies provide scalability to configure distributed systems using multiple servers because they vary in performance, such as throughput and processing speed, depending on the server environment, but the more the number of servers, the more difficult it is to manage. To solve this problem, a problem can be solved by using a docker, a kind of virtualization system that provides ease of expansion. However, there is a place to maintain a native environment without using Docker due to the problem that performance may be reduced, which is a disadvantage of all virtualization systems. In this paper, we build Apache Storm and Apache Spark, which are real-time data processing systems in Docker and Native environments and conduct performance measurements through experiments processing JSON-format data to verify how much performance decreases in Docker environments.

Jiwon Bang, Mi-Jung Choi (Kangwon National Univ., South Korea )

PS3-2 Load Balancing Algorithm with Programmable Switch     

Abstract

   Data center network traffic fluctuates over time while applications in the data center require high throughput and low latency. To satisfy these requirements, many load balancing algorithms have been proposed. But existing load balancing algorithms show difficulties in processing short flows and have limited scalability. This paper proposes a load balancing algorithm using probe packets. Probe packet collects detailed network information such as link utilization, hop latency at packet units periodically. The algorithm uses link utilization, hop latency, and queue occupancy to calculate the degree of congestion. The algorithm uses the network status information for load balancing by designating best hops for each hop. Metrics that measure congestion was collected and tested through probe packets in the virtual programmable network environment, and the result shows 24.18% higher performance compared with ECMP.

Jiyoon Lim, Sukhyun Nam, Jae-Hyoung Yoo, James W. Hong (POSTECH, South Korea )

PS3-3 Oversampling Techniques for Detecting Bitcoin Illegal Transaction     

Abstract

   Bitcoin users are guaranteed to be anonymous, increasing the number of cryptocurrency trading related to crimes and fraudulent activities. While most studies about detecting illegal transactions try to distinguish trading patterns and classify them from legitimate ones, classification performance is poor since the class distributions of transaction data are highly imbalanced. In general, the Synthetic Minority Over-sampling TEchnique (SMOTE) is used to deal with classimbalanced data, but SMOTE has a problem that it does not fully represent the diversity of the data. In this paper, we introduce another oversampling technique using Generative Adversarial Networks (GAN) to generate artificial training data for classification model. In order to verify similarity between artificial data and the actual one, oversampled dataset is evaluated with a classification model using XGBoost algorithm. We show classification performance is improved on average with synthetic data generated by both SMOTE and well-designed GAN model.

Jungsu Han, Jongsoo Woo, James W. Hong (POSTECH, Korea (South) )

PS3-4 An Autonomous Mobile Robot System Based on Serverless Computing and Edge Computing     

Abstract

   Strengthen by Artificial Intelligence (AI) and complexly integrated sensors, an autonomous mobile robot (AMR) is extensively applied in coping with various human resources tasks in indoor office environments. However, implementing an AMR system from scratch needs a strong Electric Engineer background due to the complexity of robot-controlling. Besides, Communication between robot-server, sensor, and client-service also increases the difficulty and time-cost in AMR developing. In this paper, the AMR system we proposed aims to be implemented by people without a EE background, and we will achieve this by employing Robot Operating System. Besides, the AMR system should work independently but still capable of responding to human requests. We will demonstrate a serverless could structure that includes the client-side service and integrate the edgecomputing, which in charge of the immediacy-demanding job.

Tri Thong Tran*, Yu-Chen Zhang**, Wei-Tung Liao**, Yu-Jen Lin**, Ming-Chia Li**, Huai-Sheng Huang**

(*National Taiwan Univ., Taiwan; **Fu Jen Catholic Univ., Taiwan, )

PS3-5 An Integrated Monitoring System for 5G Crosshaul Network     

Abstract

   This research provides a method for integrated centralized monitoring under the 5G Crosshaul architecture. Our method establishes a process to provide integrated monitoring technology and intelligent obstacle location for endto-end circuits across multiple domains. The monitor page shows the operating status of the 5G Crosshaul service composed of Multi-Technology, which are a base station, Mobile Fronthaul (MFH), Mobile Backhaul (MBH) and core network. The process proposed by this method includes the following technologies, encapsulating and formalizing cross-domain services and service analysis mechanisms. For the service, it integrates the service status and abnormal events of network equipment and circuits through regularized data to integrate data from different domains. The service-impacted level based on the importance of resources and provide a reference to the basis of the handling of obstacles. In addition, provide a notification mechanism to proactively notify relevant personnel, and show root cause analysis result. Through the above methods, providing Root cause of obstacles and abnormal impact range of services, reduce the time for removing obstacles and improve service quality.

Ting-Che Chuang, Yueh-Hsien Lin, Chien-Wen Yang, Min Liu, Yong-Zen Haung (Chunghwa Telecom Co., LTD., Taiwan )

PS3-6 Estimating Wallets and Bitcoins Owned by Satoshi Using Hash-rate and Transactions Analysis     

Abstract

   Bitcoin is designed to allow its users to send and receive payments under a pseudonym. In Bitcoin, A pseudonym is an address from/to which a user sends/receives coins. Owing to users anonymity, one-half of the transactions in Bitcoin are associated with illegal trading or money laundering. Hence, it is necessary to develop an approach that estimates the number of coins owned by Bitcoin users and identifies transactions which deal with illegal activities. Considering that every address involved in the Bitcoin transaction is stored permanently in the ledger. If an address is ever mapped to a user identity, every transaction wrote by that user will be linked. In this study, we proposed a new method to identify the number of coins owned by users, in particular, we estimate the number of bitcoins held by the Bitcoin creator Satoshi Nakamoto, by analyzing the mining hash rate, mining reward and transactions data.

Hye-Yeong Shin, Meryam Essaid, Hong Taek Ju (Keimyung Univ., Korea (South) )

PS3-7 A Measurement Study on Evaluating Container Network Performance for Edge Computing     

Abstract

   With the development of cloud technology, people are focusing on lightweight container technology. Container networking is a core technology in providing high-level cloud services, and there are various implementation models such as Container Network Model (CNM) and Container Network Interface (CNI). Among them, CNI is a de-facto standard adopted by various container platforms. There are many plugins that implement the CNI networking model, and the implementation method differs, showing a great difference in a view of performance. MEC (Multi-Access Edge Computing) is a technology that provides services by locating the server closest to the user who wants to use mobile communication services. In this paper, the performance was measured by applying various CNI network plugins to the CoV architecture. Through this measurement, we analyzed the factors of network performance degradation. The result of the analysis is expected to be used as a good reference in constructing the CoV architecture for low latency in the future.

Junghan Yoon*, Jian Li**, Sangho Shin** (*KAIST, South Korea; **SK Telecom, South Korea )

PS3-8 Reliability Evaluation and Optimization Method in Power Communication Network Based on Environmental Factors and Controlled Hybrid Stochastic Petri Net     

Abstract

   The reliability of the power communication network is important to the stable operation of the power grid. Existing studies on the reliability evaluation of power communication networks rarely consider the factors of environmental changes. In fact, changes in the working environment of power service routing will affect the normal operation of the network. This paper studies the reliability evaluation method of power communication network based on environmental factors. The normal cloud model method is used to model the multiple environmental factors in the power communication network, and a controlled hybrid stochastic petri network is used to model and analyze the power transmission system with backup route. In simulation experiments, we compare our algorithm with the contrast algorithm that not considering the impact of environmental factors. The results show that our algorithm can well reflect the impact of changes in environmental factors on the reliability of the system, and more in line with the actual reliability changes of the power service transmission system.

Huilin Liu*/**, Yucheng Ma***, Xushan Chen***, Meng Zhou***, Shiyou Chen*** 

(*CASIC General Department of Network & Information, China; **CASIC Network & Information Development; ***Beijing Univ. of Posts and Telecommunications, China )

PS3-9 Mobile Agents' Dynamic Small-World Network Based on Attention Mechanism     

Abstract

   To solve the issues of high communication cost and slow information transmission in the applications of agents’ collaboration, in the paper, we propose an approach to the construction of dynamic small-world network based on attention mechanism. Small-world model is applied to handle information exchange among agents. During the movement to destination, agent obtains individual historical optimal position through self-attention mechanism, and obtains local optimal position of k-neighbor through local attention mechanism, enabling search for the next optimal position. The experimental results verify effectiveness of our method, as well as stability and invulnerability which can adapt to dynamic changes.

Rong Xie (Wuhan Univ., China )

PS3-10 Design and Simulation of Self-Organizing Network Routing Algorithm Based on Q-learning     

Abstract

   With the continuous advancement of computer network communication technology, traditional wired and wireless networks are limited by cables and base stations, and are not applicable in some application scenarios. Therefore, mobile wireless communication methods have attracted more and more attention. Due to its dynamic topology and selforganizing without center, the self-organizing network can form a mobile temporary multi-hop mobile communication network through multiple wireless communication devices, which can well meet the above requirements. At present, research on selforganizing networks mainly focuses on routing protocols. The main types are based on network topology information and location information. This paper designs a routing algorithm based on link reliability. The algorithm fully considers the selforganizing network link information, and models the node's sending and receiving work as a Markov decision process, and uses Q-learning to demodulate. This article used NS2 for network simulation and analysis and comparison of performance indicators with traditional routing algorithms.

Yuejia Dou*, Huilin Liu**/***, Liangkang Wei*, Shiyou Chen*

(*Beijing Univ. of Posts and Telecommunications, China **CASIC General Department of Network & Information, China; ***CASIC Network & Information Development Corporation Limited, China )

PS3-11 Design and Implementation of IEEE 802.11Ah (HaLow) Dongle for IoT Wireless Networking      

Abstract

   In this paper, we present an IEEE 802.11ah (HaLow) dongle that provides sub-1GHz wireless channel and USB (universal serial bus) interface for power supply and wired data link for easy Internet of Things (IoT) wireless networking. The HaLow dongle is implemented using CC1352P1 sub-1GHz smart RF chipset that provides 50Kbps ~ 4Mbps in 10m ~ 1Km range. The major advantages of the HaLow dongle include i) easy installation using USB interface, ii) energy efficient wireless networking with flexible channel selection and Tx rate/power adjustments, and iii) user-friendly API (application programming interface) for raw-socket-based application developments. The functional architecture of IEEE 802.11ah (HaLow) dongle is explained in detail and the performance is analyzed in practical environments.

Min-Cheol Kim, Young-Tak Kim (Yeungnam Univ., South Korea )

PS3-12 Automatic Mobile App Speed Measurement with Robot     

Abstract

   Mobile app performance measurement is important to improve user experience by optimizing mobile apps. For this purpose, many mobile app testing methodologies. However, most of mobile app testing software depend on operating systems and binary execution files. In this work, we present a robotbased automatic mobile app speed measurement method. Our tool automates speed testing of mobile apps on either Android or Apple iOS. In particular, we employ a robot arm to simulate human behavior to generate user input events such as touch and swipe. For UI automation with a robot arm, we have devised UI automation by random or clickable component detection methods. We have adopted a web speed index to the mobile app to reflect user experience of performance. From experiments with our robot arm and automation software of generating user events and computing speed index, we have classified fast or slow mobile apps under the speed index metric.

SooHyun Kim, Hyunsu Mun, Youngseok Lee (Chungnam National Univ., Korea (South) )

PS3-13 A Framework for a Multisensory IoT System Based on Service-oriented Architecture     

Abstract

   Multisensory IoT system contains multiple types of sensors, actuators, and computation devices. In this kind of system, providing different viewpoints of observations by heterogenous sensors such as RGB camera and wearable sensors can improve the performance of intelligent systems. The issues of building this system are that we have many components running on different platforms and implementing with different programming languages. It causes the complexity of architecture design, interoperability of components, and portability and also limits the system scalability. Therefore, we propose a reference design which is based on service-oriented architecture for alleviating these issues. We also present a case study of system prototyping which is constructed by adopting an RGB camera and smart insoles to create an identity recognition system.

Sevendi Eldrige Rifki Poluan, Yan-Ann Chen (Yuan Ze Univ., Taiwan )

 

 

 

 

Poster Session 4: Tuesday, September 22, 2020, 16:00 ~ 18:00,  (Online: Track 2)    
Chair: Yeunwoong Kyung (Hanshin Univ., Korea)
PS4-1 Mobility Performance Enhancement in Small Cells Cluster of 5G Network: A Handover Overhead Reduction Approach

Abstract

   To achieve high availability of traffic and maximum coverage in the 5G network, clusters of small cells approach to maximize the system capacity. In this approach, the Core Network (CN) encounters a large number of signals due to the frequent hand-off between small cells in the event of an increase in the speed of user movement and users within certain limits of small cells. The present 5G system executes all handoff signals in the traditional complex hierarchical sequence which leads the system toward the bad performance due to redundant signaling. NO Stack architecture has emerged as a promising methodology for radio access network (RAN) in the context of reducing the redundant signaling during X2-based handover by using control logic centrally and flat protocols. This paper proposes a system that is based on NO Stack architecture for reducing handoff requests in CN by assigning the dedicated mobility controller to each cluster of small cells for locally managing the mobility. The dedicated cluster controller specially designs to manage and control the cluster of small cells as well as maintain the forwarding information of user equipment locally. In this proposed system, the dedicated controller resides at the nearest edge cloud, therefore a distributed edge cloud network is developed for high computing infrastructure and low latency access for the X2-based handover request.

Adeel Rafiq, Muhammad Afaq, Wang-Cheol Song (Jeju National Univ., Korea (South) )

PS4-2 Experimental Comparison of Machine Learning Models in Malware Packing Detection     

Abstract

   Recently, malware is widely distributed by combining recent technologies such as packing, encoding and obfuscation to bypass anti-virus software. These kinds of technologies allow malware to survive longer, infect various computers and devices for longer periods of time, create a number of mutated malware, and make experts spend longer to analyze malware. Packers disrupt the reverse engineering process, making it difficult for security researchers to analyze new or unknown malware. Thus, we need to analyze as many malware as possible by first detecting the packed malware and analyzing not-packed malware, and then unpack the packed malware. Previously, the packing detection methods were based on mainly signature and entropy detection. However, these methods have increased the undetected rate with the appearance of custom packers. Due to these problems, there have been many research efforts on machine learning-based malware packing detection and classification. In this paper, we present an extensive experimental comparison of these machine learning-based algorithms. In particular, we extract a total of 13 important features and considers eight machine learning algorithms to detect the packing of malware. Experimental results show that we can also detect well malware packed by custom packers which did not studied in previous studies.

Jong-Wouk Kim, Juhong Namgung, Yang-Sae Moon, Mi-Jung Choi (Kangwon National Univ., South Korea )

PS4-3 Video Communication Optimization Using Distributed Edge Computing    

Abstract

   We proposes a backbone network resource optimization algorithm for video communications that use edge computing. In the current video communication architecture, the key component of video communication, called the multi-point control unit (MCU), is deployed in the central cloud server, and its bandwidth consumption in the backbone network becomes enormous as the video resolution and the frequency of use increase. By implementing edge computing, the MCU can be deployed at the entrance node of the backbone network. This allows (i) a local loopback of video traffic at an edge, and (ii) traffic compression (e.g., thumbnailing) between edge nodes. Though these characteristics can reduce the resource consumption of the backbone network, the edge deployment and routing (EDR) problem, classified as NP-hard, should be solved to sufficiently reduce the bandwidth. To solve the NP-hard EDR problem within a feasible period, we propose a divide and merge algorithm based on the linear programming approach. With our algorithm, bandwidth consumption using edge computing is reduced by approximately 30% compared with the current video communication architecture in the world-wide network.

Kouichi Genda*, Mitsuru Abe**, Shohei Kamamura***

(*Nihon Univ., Japan; **NTT Communications Corporation, Japan; ***NTT Corporation, Japan )

PS4-4 G-PFC: A Packet-Priority Aware PFC Scheme for the Datacenter     

Abstract

   Modern datacenter applications demand ultra-low latency and high throughput to meet customer requirements. To achieve good performance, the RoCEv2 (RDMA over Converged Ethernet) protocol, which is based on lossless ethernet, is widely used in large-scale data centers. PFC (Priority-based Flow Control) is a switch-level flow control scheme to support lossless ethernet. However, the typical PFC has a lack of support for the various types of applications that require different QoS for throughput and latency. In this paper, we present G-PFC, a packet-based priority aware flow control scheme to provide low queuing delay and less pause duration for the high priority traffic (packets) that compare to low priority traffic (packets). G-PFC also prevents HoL (Head of Line) blocking problems for the high priority traffics when the congestion is caused by low priority traffics. We ran NS-3 simulations to compare G-PFC and PFC, and the simulation result shows that G-PFC outperforms the PFC in terms of FCT (Flow Completion Time).

Zhenguo Cui, Steven Rim (Korea Univ., South Korea )

PS4-5 Cross-Silo Horizontal Federated Learning for Flow-based Time-related-Features Oriented Traffic Classification     

Abstract

   Traffic classification (TC) has a principal function in autonomous network management. Recently, deep learning and machine learning-based TC have become popular than the traditional port-based and protocol-based TC due to practices such as port disguise and payload encryption. The flow-based TC is reliable as it relies on time-related statistical features. Federated learning is a distributed machine learning technique to train improvised deep/machine learning models with less privacy distress. The organizations or enterprises having similar business models may take participation in building a federated model for their network traffic characterization. In this study, we build a cross-silo horizontal federated model for TC using flow-based time-related features. The federated model shows comparable performance to the centralized model.

Umer Majeed, Latif Ullah Khan, Choong Seon Hong (Kyung Hee Univ., Korea (South) )

PS4-6 Service Chaining Offloading Decision in the EdgeAI: A Deep Reinforcement Learning Approach     

Abstract

   Many mission critical devices are increasing with upcoming 5G network to fulfill a low latency for a real time network service on smart factory, autonomous vehicle, etc. Distributed cloud computing system also has a key role to execute the various mobile devices, because, an edge computing is the nearest from the mobile devices to provide low latency and computation energy consumption. In this paper, we consider the autonomous vehicles with video live streaming services. Especially, the vehicles require a low transmission delay as within 10 ms. To reduce a latency with low energy consumption, we propose a service chaining offloading decision with a deep reinforcement learning. We split tasks of the vehicle per service function blocks which have their own role. So it can do partial offloading and user association in a On-Device Edge of the vehicle and in the SBS at the same time . We can get results that service chaining offloading decision gives more optimal energy consumption with low-latency to autonomous vehicle users.

Min Kyung Lee, Choong Seon Hong (Kyung Hee Univ., South Korea )

PS4-7 Intelligent Management System: Deep Convolutional Neural Networks for Automatic Attribute Recognition in IP Surveillance Networks     

Abstract

   In recent years, IP surveillance networks are expected to enable various practical applications, such as finding suspects, monitoring pedestrians, and securing societies (e.g., securing a city, a company and a data center). With these applications, IP surveillance network is regarded as one of the potential technologies toward developing smart cities. To support the concept of IP surveillance networks, automatic attribute recognition systems have emerged as a promising intelligent management system. To automatically recognize attributes of pedestrians (e.g., gender and clothing), we apply deep convolutional neural networks (CNNs), and the main contributions of this paper are threefold: (1) we proposed a practical system architecture for intelligent management of surveillance networks; (2) we implemented different deep CNNs, and an ensemble-learning method that leverages these multiple deep-learning models; (3) we evaluated the models using the real data of IP surveillance networks.

Chien-Chi Kao, Yung-Chang Lai, Jung Pei, Chih-Wei Chang, Fei-Hua Kuo, Jin-Yuan Shun (Chunghwa Telecom, Taiwan )

PS4-8 Evaluating NFV-enabled Network Slicing for 5G Core     

Abstract

   Network slicing enables a single physical network be sliced into multiple virtual networks. Each is customized and optimized according to specific 5G services and business goals. It can accommodate QoS heterogeneity of different 5G vertical services with isolation. In this research, we realize 5G mobile core network slicing based on the NFV (Network Functions Virtualisation) MANO (MANagement and Orchestration) architecture. Our prototype leverages open sources from both OpenStack Tacker and NCTU free5GC to creates 5G core network slicing based on its Network Service Descriptor (NSD). We evaluate and compare the performance between the multiple network slicing system and the one-slice-fits-all single slicing system using three eMBB (enhanced Mobile BroadBand) services of different QoS levels. Our test results show that the former can achieve better throughput and response time than the latter with the tradeoff of increasing its CPU consumption.

Chia-Wei Liao*, Fuchun Joseph Lin*, Yoichi Sato** (*National Chiao Tung Univ., Taiwan; **Okinawa Open Laboratory, Japan )

PS4-9 Federated Learning for Cellular Networks: Joint User Association and Resource Allocation     

Abstract

   Recent years have shown a remarkable interest in federated learning from researchers to make several Internet of Things applications smart. Although, federated learning offers users’ privacy preservation, it has communication resources optimization challenge. In this paper, we consider federated learning for cellular networks. We formulate an optimization problem to jointly minimizes latency and effect of loss in federated learning model accuracy due to channel uncertainties. We decompose the main optimization problem into two sub-problems: resource allocation and device association sub-problems, due to the NPhard nature of the main optimization problem. To solve these sub-problems, we propose an iterative approach which further uses efficient heuristic algorithms for resource blocks allocation and device association. Finally, we provide numerical results for the validation of our proposed scheme.

Latif Ullah Khan, Umer Majeed, Choong Seon Hong (Kyung Hee Univ., Korea (South) )

PS4-10 Double-Lead Content Search Scheme for Producer Mobility in Named Data Networking     

Abstract

   In Named Data Networking (NDN), the processing of the packet is based on the data rather than the communication endpoint. It’s very suitable for the core demand of content sharing on the internet today. However, there are still some problems to be dealt with, including mobility support of the producer. By analyzing existing solutions, we put forward a solution finding MCS (Mobile Content Source) passively by HR(Home Repository) and leading interest packets to find MCS actively in the local scope at the same time to speed up to search MCS and to support NDN producer mobility. Triangle routing problem in single HR and low efficiency problem can be based on this solution. Experimental results show that our scheme does better in reducing delay with low handoff cost than other typical solutions.

Huilin Liu*/**, Xushan Chen***, Guoxin Xia***, Guo Hui***

(*CASIC General Department of Network & Information, China; **CASIC Network & Information Development; ***Beijing Univ. of Posts and Telecommunications, China )

PS4-11 Joint Deployment and Task Computation of UAVs in UAV-assisted Edge Computing Network     

Abstract

   Unmanned Ariel Vehicle(UAV) has been widely used in the edge computing network. Owing to its line-of-sight communication ability and mobility, it has offered task offloading service and some task computation for mobile devices(MDs). Nowadays, as high-intensity calculation application develops rapidly, maximizing the size of offloaded tasks is necessary for meeting the users’ experience in applications. In this context, our paper takes research on how to deploy UAVs at the most proper place to offer task offloading with TDMA protocol. Specifically, we will optimize the task offloading number in the MDs-UAV system by combining the location of UAVs, the task computation capacity of UAV, and the MDs-UAV associations in a certain time. We prove that the joint UAV deployment and task computation problem is NP-hard, and use a greedy algorithm to optimize the result. Compared with randomly selected method, our simulation shows that the greedy algorithm performs greatly and the deployment of UAVs are sensible. We believe that this idea will improve the system tasks processing rate and Quality of Experience(QoE) of mobile users.

Yuqing Chen, Zhaohui Zheng (Soochow Univ., China )

PS4-12 Prequalification of VDSL2 Copper Customers for G.fast Services with Artificial Intelligence Technology     

Abstract

   In recent years, due to customers have higher requirements for 4K/8K video and high-speed internet, telecom operators have begun to deploy FTTH network , but found that it is generally difficult to deploy fiber to the home, so G.fast technology has been favored by most telecom operators around the world and have begun to actively deploy. For the most widely deploy VDSL2 line with maximum rate that can only provide 100M internet service, a intelligent and accurate G.fast 300M high speed service prequalification technology, is a major research topic for telecom operators to promote 300M high-speed internet service. This paper proposes to use AI machine learning to estimate the G.fast line rate by using VDSL2 line attenuation to meet the real-site provision needs of telecommunications operators.

Pang-Chen Liu, Shun-Kai Yang, Lung-Chin Huang, Huai-En Tseng, Fei-Hua Kuo, Tai-Chueh Shih (Chunghwa Telecom Co., LTD., Taiwan )

PS4-13 A Beam-Based eICIC algorithm     

Abstract

   To improve throughput, 5G networks adopts beamforming technique and have high small-cell-density deployment. In Time Division Duplex (TDD) based 5G networks, Almost Blank Subframes (ABS) scheme and Cell Range Expansion (CRE) scheme are adopted to reduce inter-cell interference and to achieve inter-cell load balancing, respectively. However, existing ABS allocation and CRE are cell-based, i.e., requires that all beams inside a cell adopting the same ABS allocation. Due to the multiple overlapping of small cells, such cell-based ABS/CRE may much reduce the throughput. In this paper, we proposed a beam-based ABS allocation and beam-based CRE. To further reduce the interference, in this paper, small cell center UEs and small cell edge UEs (those UEs connects to small cell due to CRE technique) have distinct downlink schedules. According to our simulation results, our scheme have low computation cost since the computation cost of beam-based is much lower than cell-based.

Guey-Yun Chang (National Central Univ., Taiwan )

 

 

 

 

 

 

 

 

CLOSE