Blockchain-based multi-tenant distributed leasing method for satellite network resources

A blockchain-based multi-tenant distributed leasing method for satellite network resources, the method comprising:

• S1:
• constructing a multi-tenant business ecosystem for satellite network resource leasing, wherein satellite network operators and tenants obtain identity proofs, in the form of public key certificates, from trusted third parties;
• wherein a member service provider (MSP) is a trusted institution in Fabric;
• wherein a plurality of participants digitally sign a settle-in contract, implemented as a smart contract, which specifies rights and obligations of partners and sanctions that are applied in case of infringement;
• where in a plurality of resource demanders have the right to issue their resource demands, and satellite network resource providers have the right to issue a list of resources they can provide, both of which have right to issue proposal via a respective competition leader;
• wherein if the demands matching between two parties is successfully established, the partners are obliged to perform services as required by an agreed service level agreement (SLA);
• wherein a series of smart contracts are chaincodes that are deployed within the Fabric network;
• wherein before deploying the chaincodes to a channel, members of the channel agree on a chaincode definition for establishing chaincode governance;
• when a required number of organizations is satisfied, the chaincode definition is submitted to the channel and then the chaincodes are available;
• wherein an N-out-of-N endorsement policy is applied in the ecosystem, in which all nodes are required to provide endorsement;
• S2:
• constructing a blockchain-based leasing mechanism for satellite network resources, wherein the step S2 further comprises:
• S21:
• constructing a dual leasing mechanism for satellite network resources, wherein the step S21 further comprises:
• S211:
• defining key factors of the satellite network resource provider and the resource demander for virtual network function resources, including a resource type and a performance index;
• S212:
• grouping according to resource IDs and ranking bids and prices of all participants in each group;
• S213:
• for each group, determining a point C which represents a maximum feasible number of transaction under constraints of the number of transactions and performance indexes, while satisfying a Walrasian equilibrium and resource demander's requirements for key resource factors;
• S214:
• determining trader payment value β using prices of the strongest non- trading seller and the strongest non-trading buyer to obtain a trading price;
• S215:
• when identifying a plurality of list of buyers and sellers with successful trades, the competition leader matches resource allocation according to the buyer's reputation value;
• S22:
• constructing a blockchain-based resource leasing mechanism, wherein the step S22 further comprises:
• S221:
• based on reputation value, selecting the competition leader from the participants with greater reputation value compared with the average reputation value;
• S222:
• wherein the competition leader initiates a transaction proposal containing a table of bids and a table of reputation values for lessors and renters, resource IDs, the number of available/demanded resources proposed by each participant and their corresponding performance indexes, and numbers of transactions running the dual leasing mechanism for satellite network resources within the participants;
• S223:
• wherein the transaction proposal is broadcasted to each blockchain member's peer which is a fundamental component of any Fabric network;
• the peerstores a blockchain ledgerand validates the transaction before committing it to the blockchain ledger;
• S224:
• wherein transactions are sent to an Order node for sorting, where consensus is reached, and a block is subsequently generated and committed to the blockchain ledger;
• S23:
• obtaining a reputation value of participant by first calculating a reputation score of the participant, then combining transaction fees to ensure that the participant is honest, and finally applying a sliding window to ensure that the selected competition leader is an honest participant who contributes consistently;
• wherein the reputation score ri of participant i in step S23 is calculated by the formula:
• r
• i
• =
• ∑
• k
• =
• 1
• l
• S
• ⁡
• (
• k
• )
• *
• Z
• ⁡
• (
• k
• )
• ;
• wherein I is the number of transactions generated after the previous block, Z (k) is the value of transaction k, and S (k) is the scaling factor.