The development of IPFS (InterPlanetary File System) and blockchain-based distributed storage projects has brought new possibilities to the field of storage. This paper proposes a blockchain-based cooperative game bilateral matching architecture as a novel approach for shared storage networks. In traditional competitive (non-cooperative) game models, the allocation of storage resources is centered around pricing, leading to a scenario where node providers often engage in price competition to obtain greater rewards, resulting in an imbalance in resource allocation for both buyers and sellers. In contrast, a distributed storage model based on cooperative game theory can better facilitate cooperation and resource sharing among node providers. This paper designs a storage resource allocation algorithm based on the stable marriage matching algorithm, demonstrating the stability of this algorithm as a matching solution. The paper also analyzes the differences between cooperative and non-cooperative game models in the market, and explores an equilibrium pricing mechanism guided by supply and demand. Furthermore, the paper introduces a trading mechanism for storage resources, including publication standards and matching schemes, ensuring efficient and trustworthy interaction between storage suppliers and demanders in a decentralized network centered around storage resources, thus enabling the circulation of the value of storage resources. A prototype of a blockchain-based shared storage trading system is implemented in this paper, utilizing bilateral matching for tradings. System evaluation and experimental testing are conducted, with results showing that the average utility value of the matching trading mechanism proposed in this paper outperforms the Double Auction-based matching model under any Poisson distribution (λ = 0.1, 0.2, 0.3, …, 0.9) conditions set in the experiments. Additionally, compared to the traditional approach of directly storing complete data content on the chain, the design proposed in this paper effectively reduces on-chain storage consumption by approximately 27.06%.

Software Defined Networking (SDN) simplifies network control and management by decoupling the control plane from the data plane. However, the actual packet behaviors, conforming to the rules in the data plane flow tables, may violate the original policies in the controller due to the inconsistency between the data plane and control plane. To address this problem, we propose 2MVeri, a framework for measuring the consistency between the Data and Control plane, defined as the consistency between the control plane policies and data plane rules. 2MVeri uses a modules, a Bloom filter and a two-dimensional vector as a tag which is inserted in the packet header and is updated in each switch that the packet traverses. By exploiting path information compressed in the tag, 2MVeri can verify the consistency between the data and control plane. Moreover, when verification fails, 2MVeri is able to localize the faulty switch. Experimental results show that in the k = 4 fat tree topology, the verification accuracy of 2MVeri is as high as 100%. In addition, when the actual path is inconsistent with the expected path, 2MVeri can locate the wrong switch with an accuracy of 99.8%.