Pub Date : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9334018
Md. Faisal Ahmed, Md. Osman Ali, Md. Habibur Rahman, Y. Jang
A dramatic increase in internet-of-things-based remote health monitoring systems can be observed in recent times. The majority of them use a technology based on radio frequency (RF), whose adverse effects on human health are continuously addressed in the literature. We have designed a system using a pulse oximeter sensor to monitor the health conditions of the patient and transmit data through the LED and received using a camera. The camera captures the image and extracts the data from the receiver in the Python environment. The data is modulated using a color shift keying technique, and based on the different colors the data is retrieved from the receiver.
{"title":"Real-time health monitoring system design based on optical camera communication","authors":"Md. Faisal Ahmed, Md. Osman Ali, Md. Habibur Rahman, Y. Jang","doi":"10.1109/ICOIN50884.2021.9334018","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9334018","url":null,"abstract":"A dramatic increase in internet-of-things-based remote health monitoring systems can be observed in recent times. The majority of them use a technology based on radio frequency (RF), whose adverse effects on human health are continuously addressed in the literature. We have designed a system using a pulse oximeter sensor to monitor the health conditions of the patient and transmit data through the LED and received using a camera. The camera captures the image and extracts the data from the receiver in the Python environment. The data is modulated using a color shift keying technique, and based on the different colors the data is retrieved from the receiver.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"284 1","pages":"870-873"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72726210","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333994
A. Stefanov
The paper considers the route distortion for underwater acoustic mobile networks consisting of autonomous underwater vehicles (AUV’s). The AUV’s transmit the information along a multihop route through the network. The simple stop and wait automatic repeat request (ARQ) protocol is implemented on a hop-by-hop basis. The mobility model is direction persistent. Each AUV-to-AUV channel experiences frequency dependent path loss, Ricean fading and interference. Numerical examples are presented to demonstrate the impact of ARQ on the average route distortion.
{"title":"Impact of ARQ on the Distortion Performance of Underwater Acoustic Mobile Networks","authors":"A. Stefanov","doi":"10.1109/ICOIN50884.2021.9333994","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333994","url":null,"abstract":"The paper considers the route distortion for underwater acoustic mobile networks consisting of autonomous underwater vehicles (AUV’s). The AUV’s transmit the information along a multihop route through the network. The simple stop and wait automatic repeat request (ARQ) protocol is implemented on a hop-by-hop basis. The mobility model is direction persistent. Each AUV-to-AUV channel experiences frequency dependent path loss, Ricean fading and interference. Numerical examples are presented to demonstrate the impact of ARQ on the average route distortion.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"102 1","pages":"429-431"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76688670","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333879
K. Hwang, Sang-Chul Kim
In this paper, we studied a model that can distinguish several different human behaviors. We trained data [1] using the Convolutional Neural Network algorithm. The suggested model showed 94.597% accuracy in distinguishing seven different human activities.
{"title":"A Study of CNN-Based Human Behavior Recognition with Channel State Information","authors":"K. Hwang, Sang-Chul Kim","doi":"10.1109/ICOIN50884.2021.9333879","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333879","url":null,"abstract":"In this paper, we studied a model that can distinguish several different human behaviors. We trained data [1] using the Convolutional Neural Network algorithm. The suggested model showed 94.597% accuracy in distinguishing seven different human activities.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"300 1","pages":"749-751"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79694952","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333962
Kazuya Anazawa, Toru Mano, Takeru Inoue, Atsushi Taniguchi, K. Mizuno
Transport networks are being used to exchange traffic among communication sites. Current transport networks are mostly static, because existing traffic patterns do not fluctuate wildly. However, given that demand fluctuations are likely to become significant due to the emerging diversity of network services, current static networks will have great difficulty in accommodating all future demands. In this paper, we propose a network architecture that can accommodate more demands by employing fiber cross-connects (FXCs) connected with dark fibers; FXCs, e.g., robotic patch panels and micro-electromechanical system, are optical switches that perform circuit-switching on a per-fiber basis. Because the FXCs can satisfy demand changes by reconfiguring the physical network topology, it can accommodate greater demand variations than traditional fixed networks; this is confirmed by numerical simulations. The reconfigurable network is particularly effective when the network has many nodes with significant demand fluctuations; it accommodates up to 2.5 times more demand than the fixed equivalent.
{"title":"Reconfigurable Transport Networks to Accommodate Much More Traffic Demand","authors":"Kazuya Anazawa, Toru Mano, Takeru Inoue, Atsushi Taniguchi, K. Mizuno","doi":"10.1109/ICOIN50884.2021.9333962","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333962","url":null,"abstract":"Transport networks are being used to exchange traffic among communication sites. Current transport networks are mostly static, because existing traffic patterns do not fluctuate wildly. However, given that demand fluctuations are likely to become significant due to the emerging diversity of network services, current static networks will have great difficulty in accommodating all future demands. In this paper, we propose a network architecture that can accommodate more demands by employing fiber cross-connects (FXCs) connected with dark fibers; FXCs, e.g., robotic patch panels and micro-electromechanical system, are optical switches that perform circuit-switching on a per-fiber basis. Because the FXCs can satisfy demand changes by reconfiguring the physical network topology, it can accommodate greater demand variations than traditional fixed networks; this is confirmed by numerical simulations. The reconfigurable network is particularly effective when the network has many nodes with significant demand fluctuations; it accommodates up to 2.5 times more demand than the fixed equivalent.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"155 1","pages":"361-366"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79812571","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9334019
Anh-Tien Tran, D. Lakew, The-Vi Nguyen, Van-Dat Tuong, Thanh Phung Truong, Nhu-Ngoc Dao, Sungrae Cho
The rise of fifth-generation (5G) communication systems allows the super high-quality services to be implemented in real-life; however, it requires a massive amount of mobile data traffic to be simultaneously transmitted and processed. Fortunately, a significant percentage of mobile data traffic is indeed reusable and should be cached properly in somewhere, and then be delivered back to users’ equipment (UEs) in the future requests. To proactively utilize this nature of content distribution, the caching techniques have attracted significant attention from the research community by alleviating unnecessary duplicated data transmission of popular content in mobile edge caching enabled networks. As a result, numerous scientific approaches under different perspectives have been published and hence should be categorized through specific criteria. In this study, we systematically and extensively survey the most recent caching techniques that were published. For each caching policy, we critically analyze its target in detail by performance metrics, including hit ratio, latency, and storage efficiency. Besides, we display the current trend by sorting them into common technical classes such as machine learning, deep learning, game theory, optimization techniques, etc. To visualize and predict the application of caching algorithms, in reality, we summarize their typical use cases.
{"title":"Hit Ratio and Latency Optimization for Caching Systems: A Survey","authors":"Anh-Tien Tran, D. Lakew, The-Vi Nguyen, Van-Dat Tuong, Thanh Phung Truong, Nhu-Ngoc Dao, Sungrae Cho","doi":"10.1109/ICOIN50884.2021.9334019","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9334019","url":null,"abstract":"The rise of fifth-generation (5G) communication systems allows the super high-quality services to be implemented in real-life; however, it requires a massive amount of mobile data traffic to be simultaneously transmitted and processed. Fortunately, a significant percentage of mobile data traffic is indeed reusable and should be cached properly in somewhere, and then be delivered back to users’ equipment (UEs) in the future requests. To proactively utilize this nature of content distribution, the caching techniques have attracted significant attention from the research community by alleviating unnecessary duplicated data transmission of popular content in mobile edge caching enabled networks. As a result, numerous scientific approaches under different perspectives have been published and hence should be categorized through specific criteria. In this study, we systematically and extensively survey the most recent caching techniques that were published. For each caching policy, we critically analyze its target in detail by performance metrics, including hit ratio, latency, and storage efficiency. Besides, we display the current trend by sorting them into common technical classes such as machine learning, deep learning, game theory, optimization techniques, etc. To visualize and predict the application of caching algorithms, in reality, we summarize their typical use cases.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"38 1","pages":"577-581"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89034279","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333954
Minok Kim, Joonwoo Kim, Sangheon Pack
In vehicle platooning applications, vehicles keep track of the real-time states of other vehicles through beacons for the platoon’s stability and safety. However, under harsh wireless channel conditions, high packet loss incurs delays in updating other vehicles’ states and it makes vehicles not be able to react to dynamic situations in time. In this paper, we propose an adaptive beacon transmission scheme (A-BTS), which monitors packet loss events and controls the beacon transmission timing for reducing increased inter-reception time (IRT) of beacons caused by packet losses. Evaluation results demonstrate that A-BTS can reduce maximum IRT by 10.4% compared with the fixed beacon interval scheme.
{"title":"Adaptive Beacon Transmission for Reducing Inter-Reception Time in Vehicle Platooning","authors":"Minok Kim, Joonwoo Kim, Sangheon Pack","doi":"10.1109/ICOIN50884.2021.9333954","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333954","url":null,"abstract":"In vehicle platooning applications, vehicles keep track of the real-time states of other vehicles through beacons for the platoon’s stability and safety. However, under harsh wireless channel conditions, high packet loss incurs delays in updating other vehicles’ states and it makes vehicles not be able to react to dynamic situations in time. In this paper, we propose an adaptive beacon transmission scheme (A-BTS), which monitors packet loss events and controls the beacon transmission timing for reducing increased inter-reception time (IRT) of beacons caused by packet losses. Evaluation results demonstrate that A-BTS can reduce maximum IRT by 10.4% compared with the fixed beacon interval scheme.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"26 1","pages":"69-71"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89557898","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333944
Haneul Ko, Jaewook Lee, Sangheon Pack
In the network slicing environment, if insufficient resource is allocated to a resource-hungry slice (e.g., ultrareliable low latency communication (URLLC)), its quality of service (QoS) can be significantly degraded. In this paper, we propose a priority-based dynamic resource allocation scheme (PDRAS) where the resource management agent maintains some information such as priorities and demand profiles of slices. Based on these information, the agent dynamically allocates resources to slices. To maximize QoS of slices while maintaining the total amount of allocated resources below a certain level, a constrained Markov decision process (CMDP) problem is formulated and the optimal allocation policy is achieved by linear programming (LP). Extensive evaluation results are given to demonstrate the effectiveness of PDRAS with the optimal policy compared to that of other schemes in terms of QoS and the efficiency of the resource usage.
{"title":"Priority-Based Dynamic Resource Allocation Scheme in Network Slicing","authors":"Haneul Ko, Jaewook Lee, Sangheon Pack","doi":"10.1109/ICOIN50884.2021.9333944","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333944","url":null,"abstract":"In the network slicing environment, if insufficient resource is allocated to a resource-hungry slice (e.g., ultrareliable low latency communication (URLLC)), its quality of service (QoS) can be significantly degraded. In this paper, we propose a priority-based dynamic resource allocation scheme (PDRAS) where the resource management agent maintains some information such as priorities and demand profiles of slices. Based on these information, the agent dynamically allocates resources to slices. To maximize QoS of slices while maintaining the total amount of allocated resources below a certain level, a constrained Markov decision process (CMDP) problem is formulated and the optimal allocation policy is achieved by linear programming (LP). Extensive evaluation results are given to demonstrate the effectiveness of PDRAS with the optimal policy compared to that of other schemes in terms of QoS and the efficiency of the resource usage.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"3 1","pages":"62-64"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87602346","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333877
Tobias Mueller
On the Internet, trust is difficult to obtain. With the rise of the possibility of obtaining gratis x509 certificates in an automated fashion, the use of TLS for establishing secure connections has significantly increased. However, other use cases, such as end-to-end encrypted messaging, do not yet have an easy method of managing trust in the public keys. This is particularly true for personal communication where two people want to securely exchange messages. While centralised solutions, such as Signal, exist, decentralised and federated protocols lack a way of conveniently and securely exchanging personal certificates.This paper presents a protocol and an implementation for certifying OpenPGP certificates. By offering multiple means of data transport protocols, it achieves robust and resilient certificate exchange between an attestee, the party whose key certificate is to be certified, and an attestor, the party who will express trust in the certificate once seen. The data can be transferred either via the Internet or via proximity-based technologies, i.e. Bluetooth or link-local networking. The former presents a challenge when the parties interested in exchanging certificates are not physically close, because an attacker may tamper with the connection. Our evaluation shows that a passive attacker learns nothing except the publicly visible metadata, e.g. the timings of the transfer while an active attacker can either have success with a very low probability or be detected by the user.
{"title":"Let’s Attest! Multi-modal Certificate Exchange for the Web of Trust","authors":"Tobias Mueller","doi":"10.1109/ICOIN50884.2021.9333877","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333877","url":null,"abstract":"On the Internet, trust is difficult to obtain. With the rise of the possibility of obtaining gratis x509 certificates in an automated fashion, the use of TLS for establishing secure connections has significantly increased. However, other use cases, such as end-to-end encrypted messaging, do not yet have an easy method of managing trust in the public keys. This is particularly true for personal communication where two people want to securely exchange messages. While centralised solutions, such as Signal, exist, decentralised and federated protocols lack a way of conveniently and securely exchanging personal certificates.This paper presents a protocol and an implementation for certifying OpenPGP certificates. By offering multiple means of data transport protocols, it achieves robust and resilient certificate exchange between an attestee, the party whose key certificate is to be certified, and an attestor, the party who will express trust in the certificate once seen. The data can be transferred either via the Internet or via proximity-based technologies, i.e. Bluetooth or link-local networking. The former presents a challenge when the parties interested in exchanging certificates are not physically close, because an attacker may tamper with the connection. Our evaluation shows that a passive attacker learns nothing except the publicly visible metadata, e.g. the timings of the transfer while an active attacker can either have success with a very low probability or be detected by the user.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"20 1","pages":"758-763"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87669339","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333989
Adityan Gurunarayanan, Ankit Agrawal, Ashutosh Bhatia, D. Vishwakarma
The Onion Router (TOR) networks provide anonymity, in terms of identity and location, to the Internet users by encrypting traffic multiple times along the path and routing it via an overlay network of servers. Although TOR was initially developed as a medium to maintain users’ privacy, cyber criminals and hackers take advantage of this anonymity, and as a result, many illegal activities are carried out using TOR networks. With the ever-changing landscape of Internet services, traditional traffic analysis methods are not efficient for analyzing encrypted traffic and there is a need for alternative methods for analyzing TOR traffic. In this paper, we develop a machine learning model to identify whether a given network traffic is TOR or nonTOR. We use the ISCX2016 TOR-nonTOR dataset to train our model and perform random oversampling and random undersampling to remove data imbalance. Furthermore, to improve the efficiency of our classifiers, we use k-fold cross-validation and Grid Search algorithms for hyperparameter tuning. Results show that we achieve more than 90% accuracy with random sampling and hyperparameter tuning methods.
{"title":"Improving the performance of Machine Learning Algorithms for TOR detection","authors":"Adityan Gurunarayanan, Ankit Agrawal, Ashutosh Bhatia, D. Vishwakarma","doi":"10.1109/ICOIN50884.2021.9333989","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333989","url":null,"abstract":"The Onion Router (TOR) networks provide anonymity, in terms of identity and location, to the Internet users by encrypting traffic multiple times along the path and routing it via an overlay network of servers. Although TOR was initially developed as a medium to maintain users’ privacy, cyber criminals and hackers take advantage of this anonymity, and as a result, many illegal activities are carried out using TOR networks. With the ever-changing landscape of Internet services, traditional traffic analysis methods are not efficient for analyzing encrypted traffic and there is a need for alternative methods for analyzing TOR traffic. In this paper, we develop a machine learning model to identify whether a given network traffic is TOR or nonTOR. We use the ISCX2016 TOR-nonTOR dataset to train our model and perform random oversampling and random undersampling to remove data imbalance. Furthermore, to improve the efficiency of our classifiers, we use k-fold cross-validation and Grid Search algorithms for hyperparameter tuning. Results show that we achieve more than 90% accuracy with random sampling and hyperparameter tuning methods.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"15 1","pages":"439-444"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87771704","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 : 2021-01-13DOI: 10.1109/ICOIN50884.2021.9333864
Kurdman Abdulrahman Rasol Rasol, J. Domingo-Pascual
In network architectures based on Software Defined Networking (SDN) the control plane (control logic) is separated from the network data plane (forwarding plane) while traditional network routers combine both. Software Defined networks facilitates a centralized networking system where a logical controller manages the global view of the network. In this paper, we first propose a new metric on the controller placement problem (CPP) that simultaneously considers the communication latency and communication reliability both between switches and controllers and between controllers. Reliability is considered for single-link failure. We model the problem of determining the optimal controller placement to provide low latencies in the control plane traffic. The objective of this study is to minimize the average accumulated latency by jointly taking into account the latency between controller to switches and inter-controller while optimizing their placement for achieving an optimal balance simultaneously. The optimization problem is formulated as a mixed-integer linear programming (MILP) model under the constraints of latency and reliability. We evaluated the performance of our proposed metric by using the Internet2 OS3E network topology. Different from previous work, we focus on the control traffic exchanged among controllers to synchronize their shared data structure. Results demonstrate that the proposed method is promising.
{"title":"Joint Latency and Reliability-Aware Controller Placement","authors":"Kurdman Abdulrahman Rasol Rasol, J. Domingo-Pascual","doi":"10.1109/ICOIN50884.2021.9333864","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333864","url":null,"abstract":"In network architectures based on Software Defined Networking (SDN) the control plane (control logic) is separated from the network data plane (forwarding plane) while traditional network routers combine both. Software Defined networks facilitates a centralized networking system where a logical controller manages the global view of the network. In this paper, we first propose a new metric on the controller placement problem (CPP) that simultaneously considers the communication latency and communication reliability both between switches and controllers and between controllers. Reliability is considered for single-link failure. We model the problem of determining the optimal controller placement to provide low latencies in the control plane traffic. The objective of this study is to minimize the average accumulated latency by jointly taking into account the latency between controller to switches and inter-controller while optimizing their placement for achieving an optimal balance simultaneously. The optimization problem is formulated as a mixed-integer linear programming (MILP) model under the constraints of latency and reliability. We evaluated the performance of our proposed metric by using the Internet2 OS3E network topology. Different from previous work, we focus on the control traffic exchanged among controllers to synchronize their shared data structure. Results demonstrate that the proposed method is promising.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"73 2 1","pages":"197-202"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83622105","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
扫码关注我们
求助内容：
应助结果提醒方式：