Pub Date : 2020-07-01DOI: 10.1109/infocomwkshps50562.2020.9162659
S. Misra, Kounteya Sarkar, N. Ahmed
In this paper, we propose a Blockchain-based solution for the recovery of an SDN controller back to a previously known state upon sudden failure. A lightweight minimal Blockchain ledger containing metadata details about each controller event is maintained by the switches. The set of all instructions given by the controller to the switches denotes the state of the controller at that instant. Whenever a new event occurs, the meta-information about it gets stored in the Blockchain which is updated in the switches after regular epochs. Upon sudden failure and subsequently coming back online again, the controller downloads all the tables and information from the respective switches. It checks and compares the metadata contained in the Blockchain with those data received from the switches. In addition to the existing security services provided by Blockchain, the proposed scheme can further solve the controller failure problem. The performance of the proposed solution is measured through simulation. The proposed scheme with the metadata-based solution saves about 75% of space and a controller can securely recover with a duration of 50 Sec.
{"title":"Blockchain-Based Controller Recovery in SDN","authors":"S. Misra, Kounteya Sarkar, N. Ahmed","doi":"10.1109/infocomwkshps50562.2020.9162659","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9162659","url":null,"abstract":"In this paper, we propose a Blockchain-based solution for the recovery of an SDN controller back to a previously known state upon sudden failure. A lightweight minimal Blockchain ledger containing metadata details about each controller event is maintained by the switches. The set of all instructions given by the controller to the switches denotes the state of the controller at that instant. Whenever a new event occurs, the meta-information about it gets stored in the Blockchain which is updated in the switches after regular epochs. Upon sudden failure and subsequently coming back online again, the controller downloads all the tables and information from the respective switches. It checks and compares the metadata contained in the Blockchain with those data received from the switches. In addition to the existing security services provided by Blockchain, the proposed scheme can further solve the controller failure problem. The performance of the proposed solution is measured through simulation. The proposed scheme with the metadata-based solution saves about 75% of space and a controller can securely recover with a duration of 50 Sec.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"17 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":"125953910","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.9163051
Xiao Wu, Han Qiu, Shuyi Zhang, G. Memmi, Keke Gai, Wei Cai
Nowadays, many novel blockchain-based architecture and frameworks are proposed to solve issues in computer science and financial service. Smart contracts with blockchain systems, especially consortium blockchain systems, can help to provide many reliable and efficient functions for existing systems like smart grid payments. The novel concept of smart contract as a service is proposed but the difficulty of developing smart contracts on various kinds of blockchain systems are also significantly increasing which brings the additional cost for both developers and infrastructure builders. In this paper, we present an updated cloud-based smart integrated smart contract development system, ChainIDE 2.0, for the ultra-efficient development of blockchain-based smart contracts on multiple kinds of blockchain systems. Not only we stay as the most popular cloud-based developing Integrated Development Environment (IDE) for the Libra blockchain, but also we introduce the consortium blockchain systems such as Ant Financial Open-Chain (Ant OC) and served as the first cloud-based IDE supporting the Ant Financial OpenChain test net. Today, we have served almost 1 million compiled smart contracts which makes us the most popular cloud-based blockchain development IDE in the world.
{"title":"ChainIDE 2.0: Facilitating Smart Contract Development for Consortium Blockchain","authors":"Xiao Wu, Han Qiu, Shuyi Zhang, G. Memmi, Keke Gai, Wei Cai","doi":"10.1109/infocomwkshps50562.2020.9163051","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9163051","url":null,"abstract":"Nowadays, many novel blockchain-based architecture and frameworks are proposed to solve issues in computer science and financial service. Smart contracts with blockchain systems, especially consortium blockchain systems, can help to provide many reliable and efficient functions for existing systems like smart grid payments. The novel concept of smart contract as a service is proposed but the difficulty of developing smart contracts on various kinds of blockchain systems are also significantly increasing which brings the additional cost for both developers and infrastructure builders. In this paper, we present an updated cloud-based smart integrated smart contract development system, ChainIDE 2.0, for the ultra-efficient development of blockchain-based smart contracts on multiple kinds of blockchain systems. Not only we stay as the most popular cloud-based developing Integrated Development Environment (IDE) for the Libra blockchain, but also we introduce the consortium blockchain systems such as Ant Financial Open-Chain (Ant OC) and served as the first cloud-based IDE supporting the Ant Financial OpenChain test net. Today, we have served almost 1 million compiled smart contracts which makes us the most popular cloud-based blockchain development IDE in the world.","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":"129857745","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.9162967
Jingjie Zong, Shuangzhi Li, Di Zhang, G. Han, X. Mu, A. Bashir, J. Rodrigues
In this paper, we concern the uplink of an industrial Internet of Things (IIoT) communication system, in which multiple single-antenna users timely upload data to a receiver having a large number of antennas over Rayleigh fading channels. To satisfy the stringent requirement of latency in the channel estimation phase of this system, we first use a phase-shift keying (PSK) modulation division scheme for each pair of users. Specifically, the absolutely additively uniquely decomposable constellation pair (AAUDCP) is allocated for two random users. With the same pilot sequence, it proves the modulated PSK symbols can be uniquely identified when the number of receiver antennas goes to infinity in a noise-free case. In a noise case, to improve the reliability of this system, we propose a smart user pairing algorithm with low complexity by maximizing the minimum signal to interference plus noise ratio at the receiver for all pairs of users. Finally, the computer simulations show that the proposed scheme can improve the system's error performance effectively.
{"title":"Smart User Pairing for Massive MIMO Enabled Industrial IoT Communications","authors":"Jingjie Zong, Shuangzhi Li, Di Zhang, G. Han, X. Mu, A. Bashir, J. Rodrigues","doi":"10.1109/infocomwkshps50562.2020.9162967","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9162967","url":null,"abstract":"In this paper, we concern the uplink of an industrial Internet of Things (IIoT) communication system, in which multiple single-antenna users timely upload data to a receiver having a large number of antennas over Rayleigh fading channels. To satisfy the stringent requirement of latency in the channel estimation phase of this system, we first use a phase-shift keying (PSK) modulation division scheme for each pair of users. Specifically, the absolutely additively uniquely decomposable constellation pair (AAUDCP) is allocated for two random users. With the same pilot sequence, it proves the modulated PSK symbols can be uniquely identified when the number of receiver antennas goes to infinity in a noise-free case. In a noise case, to improve the reliability of this system, we propose a smart user pairing algorithm with low complexity by maximizing the minimum signal to interference plus noise ratio at the receiver for all pairs of users. Finally, the computer simulations show that the proposed scheme can improve the system's error performance effectively.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"2 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":"129583883","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.9163053
Doga Can Atabay, E. Uysal, O. Kaya
We study Age of Information (AoI) in a random access channel where a number of devices try to send status updates over a common medium. Assuming a time-slotted scenario where multiple transmissions result in collision, we propose a threshold-based lazy version of Slotted ALOHA and derive the time average AoI achieved by this policy. We demonstrate that the average AoI performance of the lazy policy is significantly better than Slotted ALOHA, and close to the ideal round robin benchmark.
{"title":"Improving Age of Information in Random Access Channels","authors":"Doga Can Atabay, E. Uysal, O. Kaya","doi":"10.1109/INFOCOMWKSHPS50562.2020.9163053","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS50562.2020.9163053","url":null,"abstract":"We study Age of Information (AoI) in a random access channel where a number of devices try to send status updates over a common medium. Assuming a time-slotted scenario where multiple transmissions result in collision, we propose a threshold-based lazy version of Slotted ALOHA and derive the time average AoI achieved by this policy. We demonstrate that the average AoI performance of the lazy policy is significantly better than Slotted ALOHA, and close to the ideal round robin benchmark.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"45 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":"128231450","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.9162925
Kun Yang, Cong Shen, Tie Liu
There is a growing interest in applying deep reinforcement learning (DRL) methods to optimizing the operation of wireless networks. In this paper, we compare three state of the art DRL methods, Deep Deterministic Policy Gradient (DDPG), Neural Episodic Control (NEC), and Variance Based Control (VBC), for the application of wireless network optimization. We describe how the general network optimization problem is formulated as RL and give details of the three methods in the context of wireless networking. Extensive experiments using a real-world network operation dataset are carried out, and the performance in terms of improving rate and convergence speed for these popular DRL methods is compared. We note that while DDPG and VBC demonstrate good potential in automating wireless network optimization, NEC has a much improved convergence rate but suffers from the limited action space and does not perform competitively in its current form.
{"title":"Deep Reinforcement Learning based Wireless Network Optimization: A Comparative Study","authors":"Kun Yang, Cong Shen, Tie Liu","doi":"10.1109/infocomwkshps50562.2020.9162925","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9162925","url":null,"abstract":"There is a growing interest in applying deep reinforcement learning (DRL) methods to optimizing the operation of wireless networks. In this paper, we compare three state of the art DRL methods, Deep Deterministic Policy Gradient (DDPG), Neural Episodic Control (NEC), and Variance Based Control (VBC), for the application of wireless network optimization. We describe how the general network optimization problem is formulated as RL and give details of the three methods in the context of wireless networking. Extensive experiments using a real-world network operation dataset are carried out, and the performance in terms of improving rate and convergence speed for these popular DRL methods is compared. We note that while DDPG and VBC demonstrate good potential in automating wireless network optimization, NEC has a much improved convergence rate but suffers from the limited action space and does not perform competitively in its current form.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 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":"130600710","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.9162701
Chunsheng Lin, Juanjuan Huang, Sai Huang, Yuanyuan Yao, Xin Guo
The modulation format is a key parameter that influences the monitoring of the intercepted signals. Automatic modulation classification (AMC) is utilized to recognize the modulation format of the intercepted signals. However, most recent AMC methods neglect the complementarity accross different features. In this paper, we propose a novel feature fusion based AMC scheme using the convolutional neural network (FFCNN). Fused feature is generated by concatenating the two-dimensional spectrum correlation function (SCF) images and the graphic constellation (GC) images. Moreover, the FFCNN classifier is adopted to obtain more discriminative representations, leading to improved final modulation classification performance. Extensive simulations demonstrate that the proposed FFCNN scheme outperforms other recent methods.
{"title":"Features Fusion based Automatic Modulation Classification Using Convolutional Neural Network","authors":"Chunsheng Lin, Juanjuan Huang, Sai Huang, Yuanyuan Yao, Xin Guo","doi":"10.1109/infocomwkshps50562.2020.9162701","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9162701","url":null,"abstract":"The modulation format is a key parameter that influences the monitoring of the intercepted signals. Automatic modulation classification (AMC) is utilized to recognize the modulation format of the intercepted signals. However, most recent AMC methods neglect the complementarity accross different features. In this paper, we propose a novel feature fusion based AMC scheme using the convolutional neural network (FFCNN). Fused feature is generated by concatenating the two-dimensional spectrum correlation function (SCF) images and the graphic constellation (GC) images. Moreover, the FFCNN classifier is adopted to obtain more discriminative representations, leading to improved final modulation classification performance. Extensive simulations demonstrate that the proposed FFCNN scheme outperforms other recent methods.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"5 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":"115997966","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.9162922
Xu Wang, R. Berry
Vehicular networking offers the promise of greatly improving transportation safety but has stringent requirements on information age as well as information reachability, where the later refers to the range over which information is propagated. We consider an idealized model of a one-dimensional vehicular networks and show that there is a basic trade-off between these two metrics: a smaller age can be obtained by reducing the reachability of information. We apply this to two current technologies: Cellular V2X (C-V2X) and Dedicated Short Range Communication (DSRC) and derive an equation that characterizes the trade-off between these two metrics for both technologies. In the case of exponential path loss and negligible noise, this relationship becomes a fixed invariant ratio. Given this relationship, under high congestion, these two protocols tradeoff these metrics differently. C-V2X tends to achieve a smaller age while DSRC tends to maintain a larger reachability. The idealized model is also applied to analyze the steady state of rate control and power control mechanisms such as those in the SAE standard J2945/1. We show that the ratio of age and reachability is still governed by the same trade-off curve: rate control tries to maintain a large reachability, while power control helps improve the age.
{"title":"MAC Trade-offs Between Age and Reachability of Information in Vehicular Safety Applications","authors":"Xu Wang, R. Berry","doi":"10.1109/INFOCOMWKSHPS50562.2020.9162922","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS50562.2020.9162922","url":null,"abstract":"Vehicular networking offers the promise of greatly improving transportation safety but has stringent requirements on information age as well as information reachability, where the later refers to the range over which information is propagated. We consider an idealized model of a one-dimensional vehicular networks and show that there is a basic trade-off between these two metrics: a smaller age can be obtained by reducing the reachability of information. We apply this to two current technologies: Cellular V2X (C-V2X) and Dedicated Short Range Communication (DSRC) and derive an equation that characterizes the trade-off between these two metrics for both technologies. In the case of exponential path loss and negligible noise, this relationship becomes a fixed invariant ratio. Given this relationship, under high congestion, these two protocols tradeoff these metrics differently. C-V2X tends to achieve a smaller age while DSRC tends to maintain a larger reachability. The idealized model is also applied to analyze the steady state of rate control and power control mechanisms such as those in the SAE standard J2945/1. We show that the ratio of age and reachability is still governed by the same trade-off curve: rate control tries to maintain a large reachability, while power control helps improve the age.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"2 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":"127743529","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.9162912
Itamar Cohen, Gil Einziger, M. Goldstein, Yaniv Sa'ar, Gabriel Scalosub, Erez Waisbard
Efficient on-demand deployment of VMs is at the core of cloud infrastructure but the existing resource management approaches are too slow to fulfill this promise. Parallel resource management is a promising direction for boosting performance, but when applied naïvely, it significantly increases the communication overhead and the decline ratio of deployment attempts. We propose a new dynamic and randomized algorithm, APSR, for parallel assignment of VMs to hosts in a cloud environment. APSR is guaranteed to satisfy an SLA containing decline ratio constraints, and communication overheads constraints. Furthermore, via extensive simulations, we show that APSR obtains a higher throughput than other commonly employed policies (including those used in OpenStack) while achieving a reduction of up to 13x in decline ratio and a reduction of over 85% in communication overheads.
{"title":"Poster Abstract: Parallel VM Placement with Provable Guarantees","authors":"Itamar Cohen, Gil Einziger, M. Goldstein, Yaniv Sa'ar, Gabriel Scalosub, Erez Waisbard","doi":"10.1109/infocomwkshps50562.2020.9162912","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9162912","url":null,"abstract":"Efficient on-demand deployment of VMs is at the core of cloud infrastructure but the existing resource management approaches are too slow to fulfill this promise. Parallel resource management is a promising direction for boosting performance, but when applied naïvely, it significantly increases the communication overhead and the decline ratio of deployment attempts. We propose a new dynamic and randomized algorithm, APSR, for parallel assignment of VMs to hosts in a cloud environment. APSR is guaranteed to satisfy an SLA containing decline ratio constraints, and communication overheads constraints. Furthermore, via extensive simulations, we show that APSR obtains a higher throughput than other commonly employed policies (including those used in OpenStack) while achieving a reduction of up to 13x in decline ratio and a reduction of over 85% in communication overheads.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"77 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":"127555598","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.9163009
Zhenhui Situ, I. W. Ho, Yun Hou, Peiya Li
Cellular Vehicle-to-everything (V2X) becomes one of the most significant techniques in the 5G standard. It uses the PC5 sidelink interface to enable direct communications between the vehicle and everything, e.g., neighboring vehicles, the infrastructure, and pedestrians. To facilitate ultra-reliable low-latency communication (URLLC) in high dense vehicular networks, this paper studies the feasibility of non-orthogonal multiple access (NOMA) in C-V2X to improve the spectral efficiency. According to the orthogonal multiple access (OMA) based PHY layer as specified in the PC5 sidelink interface, we propose two NOMA receivers based on two techniques: successive interference cancellation (SIC) and joint decoding (JD). It is demonstrated that the two receivers can be easily implemented on current C-V2X communications with minor modifications. Simulation results show that the two NOMA approaches can reduce the block error rate (BLER) by up to 93.6% as compared with the conventional OMA approach. In general, JD receiver provides better BLER performance at the cost of higher computational complexity as compared to the SIC receiver.
{"title":"The Feasibility of NOMA in C-V2X","authors":"Zhenhui Situ, I. W. Ho, Yun Hou, Peiya Li","doi":"10.1109/infocomwkshps50562.2020.9163009","DOIUrl":"https://doi.org/10.1109/infocomwkshps50562.2020.9163009","url":null,"abstract":"Cellular Vehicle-to-everything (V2X) becomes one of the most significant techniques in the 5G standard. It uses the PC5 sidelink interface to enable direct communications between the vehicle and everything, e.g., neighboring vehicles, the infrastructure, and pedestrians. To facilitate ultra-reliable low-latency communication (URLLC) in high dense vehicular networks, this paper studies the feasibility of non-orthogonal multiple access (NOMA) in C-V2X to improve the spectral efficiency. According to the orthogonal multiple access (OMA) based PHY layer as specified in the PC5 sidelink interface, we propose two NOMA receivers based on two techniques: successive interference cancellation (SIC) and joint decoding (JD). It is demonstrated that the two receivers can be easily implemented on current C-V2X communications with minor modifications. Simulation results show that the two NOMA approaches can reduce the block error rate (BLER) by up to 93.6% as compared with the conventional OMA approach. In general, JD receiver provides better BLER performance at the cost of higher computational complexity as compared to the SIC receiver.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 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":"129059162","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.9162906
Hong Su, Bing Guo, Yan Shen, Tao Li, Chaoxia Qing, Zhen Zhang
Smart contract helps to broaden the application of blockchain to various fields. In many cases, the non-blockchain systems (NBS) are involved. However, when a smart contract directly interacts with NBS, there is a non-deterministic issue (or a state conflict issue). The reason is that different nodes may obtain different statuses of NBS when the state changes in NBS. If we can solve this issue, a smart contract can be used to interact with current systems without an additional adaptor or bridge required by the existing solutions. In this paper, we regard the states of NBS as a sequence of states instead of a single state and propose to solve the non-deterministic issue by state synchronization. Blockchain nodes synchronize the state of the non-blockchain server via the P2P protocol. The state synchronization has requirements for both blockchain and NBS. For blockchain, it should provide the mechanism to synchronize states obtained from NBS. For NBS, it should sign the query result with a timestamp; the signature prevents the cheat of the observer (the blockchain), and the timestamp ensures the order of a state in the state sequence. At last, we show our verification results with respect to our proposed model and method.
{"title":"A Solution for State Conflicts of Smart Contract in Interaction with Non-blockchain","authors":"Hong Su, Bing Guo, Yan Shen, Tao Li, Chaoxia Qing, Zhen Zhang","doi":"10.1109/INFOCOMWKSHPS50562.2020.9162906","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS50562.2020.9162906","url":null,"abstract":"Smart contract helps to broaden the application of blockchain to various fields. In many cases, the non-blockchain systems (NBS) are involved. However, when a smart contract directly interacts with NBS, there is a non-deterministic issue (or a state conflict issue). The reason is that different nodes may obtain different statuses of NBS when the state changes in NBS. If we can solve this issue, a smart contract can be used to interact with current systems without an additional adaptor or bridge required by the existing solutions. In this paper, we regard the states of NBS as a sequence of states instead of a single state and propose to solve the non-deterministic issue by state synchronization. Blockchain nodes synchronize the state of the non-blockchain server via the P2P protocol. The state synchronization has requirements for both blockchain and NBS. For blockchain, it should provide the mechanism to synchronize states obtained from NBS. For NBS, it should sign the query result with a timestamp; the signature prevents the cheat of the observer (the blockchain), and the timestamp ensures the order of a state in the state sequence. At last, we show our verification results with respect to our proposed model and method.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"93 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":"129060980","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
扫码关注我们
求助内容：
应助结果提醒方式：