Pub Date : 2020-07-01DOI: 10.1109/infocomwkshps50562.2020.9162885
Batyr Charyyev, M. H. Gunes
The Internet of Things (IoT) consists of sensors and actuators that facilitate many aspects of our daily life. Compared to typical computing devices such as laptops and smartphones, these devices have a very limited set of functionalities and states. Researchers have shown that it is possible to infer the device type from its network traffic. In this paper, we show that an external observer that sniffs the network traffic of an IoT device can further classify device events and hence infer user actions by employing machine learning classifiers. We evaluate and compare the performance of ten machine learning algorithms in classifying 128 device events from 39 different devices. We analyze the impact of the user interaction through LAN and WAN as well as controllers such as Alexa voice assistant on the correct classification of device actions. We also inspect whether the region from which the device is impacts the performance of classifiers as researchers have shown that differing privacy restrictions lead to different external communications.
{"title":"IoT Event Classification Based on Network Traffic","authors":"Batyr Charyyev, M. H. Gunes","doi":"10.1109/infocomwkshps50562.2020.9162885","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9162885","url":null,"abstract":"The Internet of Things (IoT) consists of sensors and actuators that facilitate many aspects of our daily life. Compared to typical computing devices such as laptops and smartphones, these devices have a very limited set of functionalities and states. Researchers have shown that it is possible to infer the device type from its network traffic. In this paper, we show that an external observer that sniffs the network traffic of an IoT device can further classify device events and hence infer user actions by employing machine learning classifiers. We evaluate and compare the performance of ten machine learning algorithms in classifying 128 device events from 39 different devices. We analyze the impact of the user interaction through LAN and WAN as well as controllers such as Alexa voice assistant on the correct classification of device actions. We also inspect whether the region from which the device is impacts the performance of classifiers as researchers have shown that differing privacy restrictions lead to different external communications.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"310 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122779415","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 : 2020-07-01DOI: 10.1109/infocomwkshps50562.2020.9162705
Lei Feng, Xiaoyu Que, Peng Yu, Wenjing Li, Xue-song Qiu
Intelligent reflecting surface (IRS) has been recognized as a cost-effective technology to enhance spectrum and energy efficiency in the next generation (5G) wireless communication networks, which is expected to support stable transmission for ultra reliable and low latency communications (URLLC). This paper focuses on the usage of IRS in uplink URLLC system and proposes a compressive sensing based IRS assisted multiple user detection method to deal with the sparsity and relativity characteristic of user signal in URLLC system. Simulation results demonstrate that our proposed algorithm achieves better performance than that of other MUD algorithms with similar computational complexity in terms of reliability and low latency.
{"title":"IRS Assisted Multiple User Detection for Uplink URLLC Non-Orthogonal Multiple Access","authors":"Lei Feng, Xiaoyu Que, Peng Yu, Wenjing Li, Xue-song Qiu","doi":"10.1109/infocomwkshps50562.2020.9162705","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9162705","url":null,"abstract":"Intelligent reflecting surface (IRS) has been recognized as a cost-effective technology to enhance spectrum and energy efficiency in the next generation (5G) wireless communication networks, which is expected to support stable transmission for ultra reliable and low latency communications (URLLC). This paper focuses on the usage of IRS in uplink URLLC system and proposes a compressive sensing based IRS assisted multiple user detection method to deal with the sparsity and relativity characteristic of user signal in URLLC system. Simulation results demonstrate that our proposed algorithm achieves better performance than that of other MUD algorithms with similar computational complexity in terms of reliability and low latency.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114242245","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 : 2020-07-01DOI: 10.1109/INFOCOMWKSHPS50562.2020.9162676
Sunil Jacob, Varun G. Menon, Shynu Gopalan Padinjappurathu, KS FathimaShemim, B. Mahapatra, Saira Joseph
The use of unmanned aerial vehicle (UAV) as a dynamic node in point to point communication of 5G and beyond 5G cellular networks is an emerging technology. It provides a reliable and efficient mode of wireless communication network in the sky. Existing architectures include single tier and multi-tier drone architecture. Major challenges in multi-tier architecture is in establishing an air traffic control system and in efficient resource sharing between the drones. To overcome the challenges associated with the multitier drone and cellular drone networks, a bidirectional multitier cognitive swarm drone network (BMCSDN) is proposed and investigated in terms of spectrum efficiency and allocation of optimized altitude and power for down link transmission. The proposed method uses the cognitive swarm drone (CSD) concept and provides enhancement of capacity and coverage with optimized transmission efficiency. The work also analyses the effect of interference when all CSDs transmit and receive with static and dynamic frequency allocations.
{"title":"Bidirectional Multi-tier Cognitive Swarm Drone 5G Network","authors":"Sunil Jacob, Varun G. Menon, Shynu Gopalan Padinjappurathu, KS FathimaShemim, B. Mahapatra, Saira Joseph","doi":"10.1109/INFOCOMWKSHPS50562.2020.9162676","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS50562.2020.9162676","url":null,"abstract":"The use of unmanned aerial vehicle (UAV) as a dynamic node in point to point communication of 5G and beyond 5G cellular networks is an emerging technology. It provides a reliable and efficient mode of wireless communication network in the sky. Existing architectures include single tier and multi-tier drone architecture. Major challenges in multi-tier architecture is in establishing an air traffic control system and in efficient resource sharing between the drones. To overcome the challenges associated with the multitier drone and cellular drone networks, a bidirectional multitier cognitive swarm drone network (BMCSDN) is proposed and investigated in terms of spectrum efficiency and allocation of optimized altitude and power for down link transmission. The proposed method uses the cognitive swarm drone (CSD) concept and provides enhancement of capacity and coverage with optimized transmission efficiency. The work also analyses the effect of interference when all CSDs transmit and receive with static and dynamic frequency allocations.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122203782","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 : 2020-07-01DOI: 10.1109/INFOCOMWKSHPS50562.2020.9163017
R. Bhat, R. Vaze, M. Motani
Freshness of information is an important requirement in many real-time applications. The age of information (AoI), a metric for measuring the freshness of information, is the time elapsed since the generation of the last successful update received by the destination. We consider $M$ sources (users) updating their statuses over a block-fading multiple access channel to a base station (BS). At the start of each fading block, the BS acquires perfect information about channel power gain realizations of all the users in the block. Using this information, a centralized scheduling policy at the BS in a block decides whether to idle or select a user to receive a packet from, in order to minimize a long-term weighted average AoI across all users subject to long-term average power constraint at each user. In this work, we propose a simple age-independent stationary randomized policy (AI-SRP), with which the minimum achievable weighted average AoI across the users is at most two times the AoI of the optimal policy.
{"title":"Age of Information Minimization in Fading Multiple Access Channels","authors":"R. Bhat, R. Vaze, M. Motani","doi":"10.1109/INFOCOMWKSHPS50562.2020.9163017","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS50562.2020.9163017","url":null,"abstract":"Freshness of information is an important requirement in many real-time applications. The age of information (AoI), a metric for measuring the freshness of information, is the time elapsed since the generation of the last successful update received by the destination. We consider $M$ sources (users) updating their statuses over a block-fading multiple access channel to a base station (BS). At the start of each fading block, the BS acquires perfect information about channel power gain realizations of all the users in the block. Using this information, a centralized scheduling policy at the BS in a block decides whether to idle or select a user to receive a packet from, in order to minimize a long-term weighted average AoI across all users subject to long-term average power constraint at each user. In this work, we propose a simple age-independent stationary randomized policy (AI-SRP), with which the minimum achievable weighted average AoI across the users is at most two times the AoI of the optimal policy.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122223383","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 : 2020-07-01DOI: 10.1109/infocomwkshps50562.2020.9162887
Yunpeng Cao, Haifeng Wang, Shuqing He
In big data computing application, there are jobs of multiple computing modes mainly based on MapReduce. Therefore, compute-intensive cluster needs to maintain multiple computing modes. The utilization of virtual computing resources is not high because of the change of computing load. In order to optimize the resource utilization of virtual cluster, a dynamic deployment model is designed with the support of lightweight Docker container technology. The deployment model can adjust the form of virtual cluster according to the change of the resource request of job, mainly changing the type and size of computing nodes in real time. Simulation experiments show that the dynamic deployment model can optimize the utilization of virtual resources, with CPU utilization increased by 5.2%, and the execution efficiency of computing jobs is optimized. The dynamic deployment model can be applied to cloud environment and large-scale computing clusters, not only to achieve peak-taggering computing of user jobs, but also to achieve the purpose of dynamic customization of job execution environment.
{"title":"Dynamic deployment model for large-scale compute-intensive clusters*","authors":"Yunpeng Cao, Haifeng Wang, Shuqing He","doi":"10.1109/infocomwkshps50562.2020.9162887","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9162887","url":null,"abstract":"In big data computing application, there are jobs of multiple computing modes mainly based on MapReduce. Therefore, compute-intensive cluster needs to maintain multiple computing modes. The utilization of virtual computing resources is not high because of the change of computing load. In order to optimize the resource utilization of virtual cluster, a dynamic deployment model is designed with the support of lightweight Docker container technology. The deployment model can adjust the form of virtual cluster according to the change of the resource request of job, mainly changing the type and size of computing nodes in real time. Simulation experiments show that the dynamic deployment model can optimize the utilization of virtual resources, with CPU utilization increased by 5.2%, and the execution efficiency of computing jobs is optimized. The dynamic deployment model can be applied to cloud environment and large-scale computing clusters, not only to achieve peak-taggering computing of user jobs, but also to achieve the purpose of dynamic customization of job execution environment.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128336976","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 : 2020-07-01DOI: 10.1109/infocomwkshps50562.2020.9162859
P. M., M. Hamdi, Vijayakumar Varadarajan, B. Rawal, M. Maode
As a very appealing computing standard, cloud computing makes it feasible for resource constrained clients to experience rate effective and flexible resources at ease. In the prevailing systems, the conventional cloud storage scheme is bound to operate its primitive functions in centralized mode. This reason possess problems like data availability, information protection and excessive operational charge. With the improvement of block chain generation, the decentralized scheme has entered the general public view. Compared to contemporary and cutting edge cloud storage, they are predicted to be more scalable, secured and comfortable. But, the use of end-to-end encryption in a decentralized scheme, limits the search functionality as the existing searchable encryption methods are designed only for the centralized device. Moreover, the existing decentralized cloud storage doesn't restrict any data user to get access to all of the files for any keyword search made purposefully through them. Thus, in this manner, user integrity of files and keyword searches are compromised throughout the network. Therefore, as a manner to solve these complications, we systematically join techniques of encryption and hashing to furnish reliable keyword search over encrypted files in decentralized storage. Consequently using the block chain system, the architecture remains incorruptible and protects all the confidential files and keywords in a fully controlled file access environment.
{"title":"Building an Authentic and Ethical Keyword Search by applying Decentralised (Blockchain) Verification","authors":"P. M., M. Hamdi, Vijayakumar Varadarajan, B. Rawal, M. Maode","doi":"10.1109/infocomwkshps50562.2020.9162859","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9162859","url":null,"abstract":"As a very appealing computing standard, cloud computing makes it feasible for resource constrained clients to experience rate effective and flexible resources at ease. In the prevailing systems, the conventional cloud storage scheme is bound to operate its primitive functions in centralized mode. This reason possess problems like data availability, information protection and excessive operational charge. With the improvement of block chain generation, the decentralized scheme has entered the general public view. Compared to contemporary and cutting edge cloud storage, they are predicted to be more scalable, secured and comfortable. But, the use of end-to-end encryption in a decentralized scheme, limits the search functionality as the existing searchable encryption methods are designed only for the centralized device. Moreover, the existing decentralized cloud storage doesn't restrict any data user to get access to all of the files for any keyword search made purposefully through them. Thus, in this manner, user integrity of files and keyword searches are compromised throughout the network. Therefore, as a manner to solve these complications, we systematically join techniques of encryption and hashing to furnish reliable keyword search over encrypted files in decentralized storage. Consequently using the block chain system, the architecture remains incorruptible and protects all the confidential files and keywords in a fully controlled file access environment.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123466255","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 : 2020-07-01DOI: 10.1109/infocomwkshps50562.2020.9162884
Pingping Tang, Yu-ning Dong, S. Mao
Currently, it is still a great challenge to achieve online classification of massive traffic flows under dynamic network environments. Therefore, based on granular computing, an artificial intelligence computing method, which is effective to process missing, incomplete, or noisy data, a novel classification model $mathrm{M}_{GrC}$ is proposed in this paper. In $mathrm{M}_{GrC}$, we first define granules for the traffic flow, then explore the correlation between granules, and finally establish the structure granules to differentiate flow types. $mathrm{M}_{GrC}$ explores the inherent relationship between packets, where the data is no longer isolated, but closely related to each other. So, it can identify the traffic more accurately when compared with the traditional classification methods, which assume the packets to be independent. The experiment results also demonstrate its superior robustness and adaptability in highly variable network environment.
{"title":"Online Traffic Classification Using Granules","authors":"Pingping Tang, Yu-ning Dong, S. Mao","doi":"10.1109/infocomwkshps50562.2020.9162884","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9162884","url":null,"abstract":"Currently, it is still a great challenge to achieve online classification of massive traffic flows under dynamic network environments. Therefore, based on granular computing, an artificial intelligence computing method, which is effective to process missing, incomplete, or noisy data, a novel classification model $mathrm{M}_{GrC}$ is proposed in this paper. In $mathrm{M}_{GrC}$, we first define granules for the traffic flow, then explore the correlation between granules, and finally establish the structure granules to differentiate flow types. $mathrm{M}_{GrC}$ explores the inherent relationship between packets, where the data is no longer isolated, but closely related to each other. So, it can identify the traffic more accurately when compared with the traditional classification methods, which assume the packets to be independent. The experiment results also demonstrate its superior robustness and adaptability in highly variable network environment.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123628211","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 : 2020-07-01DOI: 10.1109/INFOCOMWKSHPS50562.2020.9162903
Changshuo Hu, Dong Ma, Mahbub Hassan, Wen Hu
Switchable glass, which can electronically change its state between opaque and transparent, is finding applications in modern buildings as a replacement for traditional curtains or blinds to enable dynamic privacy control in physical spaces. In this work, we propose to exploit the electronic configurability of switchable glass to modulate natural light, which can be demodulated by a nearby receiver with the light-sensing capability to realise data communication over natural light. We call this natural light communication (NLC). A key advantage of NLC is that no energy is used to generate light, as it simply modulates the existing light in nature. The slow response rate of the switchable glass, however, limits the achievable data rates for NLC. We propose and optimise an ON-OFF modulation/demodulation technique for such slow-response switchable glass and implement it using off-the-shelf Polymer Dispersed Liquid Crystal (PDLC) glass. We demonstrate that the proposed NLC can achieve 33.33 bits per second communication with a bit error rate below 1% under a wide range of ambient luminance.
{"title":"NLC: Natural Light Communication using Switchable Glass","authors":"Changshuo Hu, Dong Ma, Mahbub Hassan, Wen Hu","doi":"10.1109/INFOCOMWKSHPS50562.2020.9162903","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS50562.2020.9162903","url":null,"abstract":"Switchable glass, which can electronically change its state between opaque and transparent, is finding applications in modern buildings as a replacement for traditional curtains or blinds to enable dynamic privacy control in physical spaces. In this work, we propose to exploit the electronic configurability of switchable glass to modulate natural light, which can be demodulated by a nearby receiver with the light-sensing capability to realise data communication over natural light. We call this natural light communication (NLC). A key advantage of NLC is that no energy is used to generate light, as it simply modulates the existing light in nature. The slow response rate of the switchable glass, however, limits the achievable data rates for NLC. We propose and optimise an ON-OFF modulation/demodulation technique for such slow-response switchable glass and implement it using off-the-shelf Polymer Dispersed Liquid Crystal (PDLC) glass. We demonstrate that the proposed NLC can achieve 33.33 bits per second communication with a bit error rate below 1% under a wide range of ambient luminance.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"455 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125790229","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 : 2020-07-01DOI: 10.1109/INFOCOMWKSHPS50562.2020.9162934
S. Peng, Jianwei Mao, Ruizhao Hu, Zhenbin Li
This Demo showcased the Application-aware IPv6 Networking (APN6) framework, which takes advantage of the programmable space in the IPv6/SRv6 (Segment Routing on the IPv6 data plane) encapsulations to convey application characteristics information into the network and make the network aware of applications in order to guarantee their Service Level Agreement (SLA). APN6 is able to resolve the drawbacks and challenges of the traditional application awareness mechanisms in the network. By utilizing the real-time network performance monitoring and measurement enabled by Intelligent Flow Information Telemetry (iFIT) and further enhancing it to make it application-aware, we showed that the VIP application's flow can be automatically adjusted away from the path with degrading performance to the one that has good quality. Furthermore, the flexible application-aware SFC stitching application-aware Value Added Service (VAS) together with the network nodes/routers is also demonstrated.
本演示展示了应用感知IPv6网络(APN6)框架，该框架利用IPv6/SRv6 (IPv6数据平面上的段路由)封装中的可编程空间，将应用特征信息传递到网络中，并使网络感知应用，以保证其服务水平协议(SLA)。APN6能够解决网络中传统应用感知机制的缺点和挑战。利用智能流量信息遥测(Intelligent Flow Information Telemetry, iFIT)实现的实时网络性能监测和测量，并进一步增强其应用感知能力，证明VIP应用的流量可以自动从性能下降的路径调整到具有良好质量的路径。此外，还展示了灵活的应用感知SFC，将应用感知增值服务(VAS)与网络节点/路由器结合在一起。
{"title":"Demo Abstract: APN6: Application-aware IPv6 Networking","authors":"S. Peng, Jianwei Mao, Ruizhao Hu, Zhenbin Li","doi":"10.1109/INFOCOMWKSHPS50562.2020.9162934","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS50562.2020.9162934","url":null,"abstract":"This Demo showcased the Application-aware IPv6 Networking (APN6) framework, which takes advantage of the programmable space in the IPv6/SRv6 (Segment Routing on the IPv6 data plane) encapsulations to convey application characteristics information into the network and make the network aware of applications in order to guarantee their Service Level Agreement (SLA). APN6 is able to resolve the drawbacks and challenges of the traditional application awareness mechanisms in the network. By utilizing the real-time network performance monitoring and measurement enabled by Intelligent Flow Information Telemetry (iFIT) and further enhancing it to make it application-aware, we showed that the VIP application's flow can be automatically adjusted away from the path with degrading performance to the one that has good quality. Furthermore, the flexible application-aware SFC stitching application-aware Value Added Service (VAS) together with the network nodes/routers is also demonstrated.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121724406","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 : 2020-07-01DOI: 10.1109/infocomwkshps50562.2020.9163062
Siyi Liao, Jun Wu, Jianhua Li, A. Bashir
Software Defined Networking (SDN) focus on the isolation of control plane and data plane, greatly enhancing the network's support for heterogeneity and flexibility. However, although the programmable network greatly improves the performance of all aspects of the network, flexible load balancing across controllers still challenges the current SDN architecture. Complex application scenarios lead to flexible and changeable communication requirements, making it difficult to guarantee the Quality of Service (QoS) for SDN users. To address this issue, this paper proposes a paradigm that uses blockchain to incentive safe load balancing for multiple controllers. We proposed a controller consortium blockchain for secure and efficient load balancing of multi-controllers, which includes a new cryptographic currency balance coin and a novel consensus mechanism Proof-of-Balance (PoB). In addition, we have designed a novel game theory-based incentive mechanism to incentive controllers with tight communication resources to offload tasks to idle controllers. The security analysis and performance simulation results indicate the superiority and effectiveness of the proposed scheme.
软件定义网络(SDN)注重控制平面和数据平面的隔离，极大地增强了网络对异构性和灵活性的支持。然而，尽管可编程网络极大地提高了网络各方面的性能，但跨控制器的灵活负载均衡仍然对当前的SDN架构提出了挑战。复杂的应用场景导致通信需求灵活多变，难以保证SDN用户的QoS (Quality of Service)。为了解决这个问题，本文提出了一个使用区块链来激励多个控制器的安全负载平衡的范例。我们提出了一种用于安全高效的多控制器负载平衡的控制器联盟区块链，其中包括一种新的加密货币平衡币和一种新的共识机制平衡证明(PoB)。此外，我们设计了一种新颖的基于博弈论的激励机制，以激励通信资源紧张的控制器将任务卸载给空闲控制器。安全性分析和性能仿真结果表明了该方案的优越性和有效性。
{"title":"Proof-of-Balance: Game-Theoretic Consensus for Controller Load Balancing of SDN","authors":"Siyi Liao, Jun Wu, Jianhua Li, A. Bashir","doi":"10.1109/infocomwkshps50562.2020.9163062","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9163062","url":null,"abstract":"Software Defined Networking (SDN) focus on the isolation of control plane and data plane, greatly enhancing the network's support for heterogeneity and flexibility. However, although the programmable network greatly improves the performance of all aspects of the network, flexible load balancing across controllers still challenges the current SDN architecture. Complex application scenarios lead to flexible and changeable communication requirements, making it difficult to guarantee the Quality of Service (QoS) for SDN users. To address this issue, this paper proposes a paradigm that uses blockchain to incentive safe load balancing for multiple controllers. We proposed a controller consortium blockchain for secure and efficient load balancing of multi-controllers, which includes a new cryptographic currency balance coin and a novel consensus mechanism Proof-of-Balance (PoB). In addition, we have designed a novel game theory-based incentive mechanism to incentive controllers with tight communication resources to offload tasks to idle controllers. The security analysis and performance simulation results indicate the superiority and effectiveness of the proposed scheme.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132307125","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
扫码关注我们
求助内容：
应助结果提醒方式：