CN117408790A - Method and device for providing resources, storage medium and electronic equipment - Google Patents

Method and device for providing resources, storage medium and electronic equipment Download PDF

Info

Publication number
CN117408790A
CN117408790A CN202210787355.4A CN202210787355A CN117408790A CN 117408790 A CN117408790 A CN 117408790A CN 202210787355 A CN202210787355 A CN 202210787355A CN 117408790 A CN117408790 A CN 117408790A
Authority
CN
China
Prior art keywords
attribute value
current
node
value
resource
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210787355.4A
Other languages
Chinese (zh)
Inventor
刘小欧
陈晓益
毕奇
梁伟
李静雯
张政
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Telecom Corp Ltd
Original Assignee
China Telecom Corp Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Telecom Corp Ltd filed Critical China Telecom Corp Ltd
Priority to CN202210787355.4A priority Critical patent/CN117408790A/en
Publication of CN117408790A publication Critical patent/CN117408790A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/08—Auctions
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/04—Payment circuits
    • G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
    • G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Landscapes

  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Engineering & Computer Science (AREA)
  • General Business, Economics & Management (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Technology Law (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The disclosure provides a method, a device, electronic equipment and a storage medium for resource provision, and relates to the technical field of communication. The method comprises the following steps: receiving a resource demand request sent by a resource demand node; determining a resource providing node corresponding to the resource demand request; conducting double-sided Netherlands auctions between the resource demand nodes and the resource providing nodes according to the auction agent intelligent contracts so as to determine corresponding trading price attribute values; and carrying out integral clearing according to the transaction price attribute value, and enabling the resource providing node to provide resources for the resource demand node. The method can ensure the high efficiency, rationality and balance of matching and pricing between the resource demand node and the resource providing node based on the auction agent intelligent contract, can generate actual point change through point clearing, and can stimulate each node to actively participate in near-domain communication to share network resources through the actual point change, thereby promoting autonomous evolution and self-driven construction operation of the near-domain network and improving the frequency spectrum utilization rate and the communication capacity.

Description

Method and device for providing resources, storage medium and electronic equipment
Technical Field
The present disclosure relates to the field of communications technologies, and in particular, to a method and apparatus for providing resources, a storage medium, and an electronic device.
Background
With the development and popularization of communication technology and various intelligent terminals, the 5G/6G wireless communication mass access is greatly increased in the demand for communication capacity. Based on this, a near field network (P-ran) technique is proposed that can be used to boost the cellular frequency reuse rate. Among them, the near-field network (P-ran) technology is a technology that allows a terminal to directly communicate with a terminal by sharing cell network resources without infrastructure.
In the related art, in a near field communication scenario, the efficiency of matching shared network resources by a terminal is low.
It should be noted that the information disclosed in the above background section is only for enhancing understanding of the background of the present disclosure and thus may include information that does not constitute prior art known to those of ordinary skill in the art.
Disclosure of Invention
The disclosure aims to provide a method, a device, electronic equipment and a storage medium for providing resources, so as to ensure the efficiency, rationality and balance of matching and pricing between a resource demand node and a resource providing node, and encourage each node to actively participate in near-field communication for network resource sharing.
Other features and advantages of the present disclosure will be apparent from the following detailed description, or may be learned in part by the practice of the disclosure.
According to one aspect of the present disclosure, there is provided a method for resource provisioning, the method being applied to an operator node, comprising: receiving a resource demand request sent by a resource demand node; determining a resource providing node corresponding to the resource demand request; conducting double-sided Netherlands auctions between the resource demand nodes and the resource providing nodes according to the auction agent intelligent contracts so as to determine corresponding trading price attribute values; and carrying out integral clearing according to the transaction price attribute value, and enabling the resource providing node to provide resources for the resource demand node.
In one embodiment of the present disclosure, the resource demand request includes a target resource required by the resource demand node; and determining a resource providing node corresponding to the resource demand request, comprising: determining a near field communication range containing resource demand nodes; querying in a near field communication range to determine a relay node capable of providing a target resource; the relay node is determined as a resource providing node.
In one embodiment of the present disclosure, conducting a double-sided netherlands auction between a resource demand node and a resource providing node according to an auction agent intelligence complex to determine a corresponding price attribute value for a deal, comprising: acquiring a price condition in an auction agent intelligent contract; according to the auction agency intelligent contract, taking a resource demand node as a buyer of the bilateral netherlands auction and a resource providing node as a seller of the bilateral netherlands auction, and receiving the buyer bidding attribute value sent by the buyer and the seller bidding attribute value sent by the seller in turn until the buyer bidding attribute value and the seller bidding attribute value meet the price application condition; wherein the bid attribute value of the buyer decreases with the number of turns and the bid attribute value of the seller increases with the number of turns; the target bid attribute value and the target seller bid attribute value are obtained when the bid condition is satisfied to determine a bid attribute value based on the target bid attribute value and the target seller bid attribute value.
In one embodiment of the present disclosure, the method for resource provisioning further comprises: creating a buyer clock value for the buyer and a seller clock value for the seller; the method for receiving the bid attribute value sent by the buyer and the bid attribute value sent by the seller in turn until the bid attribute value and the bid attribute value meet the price requirement comprises the following steps: alternately taking the buyer and the seller as current bidders, and receiving the current bid attribute value sent by the current bidders; after each round of receiving the current bid attribute value sent by the current bidder, performing clock updating according to the current bid attribute value to obtain a current updated clock value of the current bidder; and after obtaining the current updated clock value of the current bidder, if the current updated clock value and the current clock value of the other party of the current bidder do not meet the price requirement, broadcasting the current updated clock value to the other party of the current bidder so that the other party of the current bidder can serve as the current bidder of the next round to send the current bid attribute value of the next round until the current updated clock value and the current clock value of the other party of the current bidder meet the price requirement; if the current bidding party is a buyer, the current bidding attribute value sent by the current bidding party comprises the current buyer bidding attribute value sent by the resource demand node, the current updated clock value of the current bidding party is a buyer clock value, and the current clock value of the other party of the current bidding party is a seller clock value; if the current bidder is a seller, the current bid attribute value transmitted by the current bidder includes a current seller bid attribute value transmitted by the resource providing node, the current updated clock value of the current bidder is a seller clock value, and the current clock value of the other party of the current bidder is a buyer clock value.
In one embodiment of the present disclosure, clock updating based on the current bid attribute value to obtain a current updated clock value for the current bidder includes: acquiring bid detection conditions in the auction agent intelligent contract; judging whether the current bid attribute value meets the bid detection condition or not; if yes, the current bid attribute value is used as a current updated clock value; if the current bid attribute value does not meet the preset step value, the current bid attribute value is adjusted based on the preset step value, and the adjusted current bid attribute value is used as a current updated clock value.
In one embodiment of the present disclosure, adjusting the current bid attribute value based on a preset step value includes: reducing the current bid attribute value of the buyer based on a preset step value; or, increasing the current seller bid attribute value based on a preset step value.
In one embodiment of the present disclosure, obtaining the target buyer bid attribute value and the target seller bid attribute value when the bid condition is satisfied to determine a transaction price attribute value from the target buyer bid attribute value and the target seller bid attribute value comprises: taking the buyer clock value when the price condition is met as a target buyer bidding attribute value, and taking the seller clock value when the price condition is met as a target seller bidding attribute value; acquiring a buyer weight value and a seller weight value in an auction agent intelligent contract; and calculating according to the target bid attribute value, the target seller bid attribute value, the buyer weight value and the seller weight value to obtain the transaction price attribute value.
In one embodiment of the present disclosure, the resource demand node, the resource providing node, and the operator node are all nodes on the blockchain; wherein, carry out the integral clearance according to the price attribute value of the interchange, include: acquiring a target bid attribute value and a target bid attribute value of a seller; calculating a to-be-paid integral value of the resource demand node and a first to-be-obtained integral value of the resource providing node according to the achievement price attribute value, the target buyer bid attribute value and the target seller bid attribute value, and a second to-be-obtained integral value of the operator node; the method comprises the steps of reducing the integral value of the resource demand node on the blockchain according to the integral value to be paid, increasing the integral value of the resource providing node on the blockchain according to the first integral value to be obtained, and increasing the integral value of the operator node on the blockchain according to the second integral value to be obtained.
According to yet another aspect of the present disclosure, there is provided an apparatus for resource provisioning, the apparatus being applied to an operator node, comprising: the receiving module is used for receiving the resource demand request sent by the resource demand node; a determining module, configured to determine a resource providing node corresponding to the resource demand request; the auction module is used for conducting bilateral Netherlands auctions between the resource demand nodes and the resource providing nodes according to the auction agent intelligent contract so as to determine corresponding trading price attribute values; and the clearing module is used for carrying out integral clearing according to the exchange price attribute value and enabling the resource providing node to provide resources for the resource demand node.
According to yet another aspect of the present disclosure, there is provided a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the above-described method for resource provisioning.
According to still another aspect of the present disclosure, there is provided an electronic apparatus including: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform the above-described method for resource provisioning via execution of the executable instructions.
The method for providing resources provided by the embodiment of the disclosure can be used as an auction proxy by an operator node, after receiving a resource demand request sent by a resource demand node, a resource providing node capable of providing resources for the resource demand node is firstly determined for the resource demand node, then reasonable matching and pricing are carried out for the resource demand node and the resource providing node through an auction proxy intelligent contract running bilateral netherlands auction, a transaction price attribute value approved by both parties is obtained, and then point clearing is carried out according to the transaction price attribute value and the resource providing node is enabled to provide resources for the resource demand node. According to the method, on one hand, the high efficiency, rationality and balance of matching and pricing between the resource demand node and the resource providing node can be ensured according to the auction agency intelligent contract of the bilateral Netherlands auction, on the other hand, the actual integral change can be generated through integral clearing, and each node is stimulated to actively participate in near-domain communication to share network resources through the actual integral change, so that autonomous evolution and self-driven construction operation of a near-domain network are promoted, and the spectrum utilization rate and the communication capacity are greatly improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description, serve to explain the principles of the disclosure. It will be apparent to those of ordinary skill in the art that the drawings in the following description are merely examples of the disclosure and that other drawings may be derived from them without undue effort.
FIG. 1 illustrates a network architecture schematic to which the method for resource provisioning of embodiments of the present disclosure may be applied;
FIG. 2 illustrates a flow chart of a method for resource provisioning of one embodiment of the present disclosure;
FIG. 3 illustrates a flow chart of conducting a double-sided Netherlands auction to determine a price attribute value for a deal in a method for resource provisioning according to one embodiment of the present disclosure;
FIG. 4 illustrates a flow chart of a two-party alternate bidding during a double-sided Netherlands auction in a method for resource provisioning according to an embodiment of the present disclosure;
FIG. 5 illustrates an architecture diagram of a method for resource provisioning in which one embodiment of the present disclosure may be implemented;
FIG. 6 illustrates a block diagram of an apparatus for resource provisioning of one embodiment of the present disclosure; and
FIG. 7 illustrates a block diagram of a computer device for resource provisioning in an embodiment of the present disclosure.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments may be embodied in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus a repetitive description thereof will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in software or in one or more hardware modules or integrated circuits or in different networks and/or processor devices and/or microcontroller devices.
Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include one or more such feature. In the description of the present disclosure, the meaning of "a plurality" is at least two, such as two, three, etc., unless explicitly specified otherwise.
In view of the technical problems in the related art described above, embodiments of the present disclosure provide a method for resource provisioning, for at least solving one or all of the technical problems described above.
Fig. 1 shows a network architecture schematic to which the method for resource provisioning of the embodiments of the present disclosure may be applied.
As shown in fig. 1, the system architecture may include an operator node 101, a resource demand node 102, a resource providing node 103, and a near-domain communication scope 104 (also referred to as a near-domain network scope, a near-domain communication ecological area).
With the popularization of various intelligent terminals, the requirement of 5G/6G wireless communication mass access and communication capacity is also increasing, and based on this, the near-field network (P-ran) proposed by 3GPP is a technology that allows communication between terminal devices directly through sharing cell network resources without infrastructure. The method can improve the frequency spectrum efficiency of the communication system, reduce the battery consumption and the like. In connection with fig. 1, the operator node 101, the resource requirement node 102, and the resource providing node 103 may be in the same near-domain communication range 104, and the resource requirement node 102 may be served by a base station or the resource providing node 103 in the near-domain communication range 104 by a near-domain network.
In an exemplary embodiment, the operator node 101, the resource requirement node 102, and the resource providing node 103 may be nodes on a blockchain, and in an application scenario in which the resource requirement node 102 is served by the resource providing node 103 in the near-domain communication range 104 by providing near-domain network services, the operator node 101 in the near-domain communication range 104 may be opened and dominant as an auction proxy, in which the operator node 101 may execute an auction flow therein by running an auction proxy smart contract deployed on the blockchain.
In an exemplary embodiment, communications may be made between the carrier node 101, the resource demand node 102, and the resource providing node 103 over a network, which may include various connection types, such as wired, wireless communication links, or fiber optic cables, etc., for the medium used to provide the communication links between the carrier node 101, the resource demand node 102, and the resource providing node 103.
In an exemplary embodiment, the operator node 101, the resource requirement node 102 and the resource providing node 103 may be computer devices, for example, the operator node 101 may be a computer node device or a server at an edge of a base station, the resource requirement node 102 may be a user terminal device, and the resource providing node 103 may be a server or a user terminal device with a relay function. The computer device may include, but is not limited to, a smart phone, a desktop computer, a tablet computer, a notebook computer, a smart speaker, a digital assistant, an AR (Augmented Reality ) device, a VR (Virtual Reality) device, a smart wearable device, or other type of electronic device, or the client 103 may be a personal computer, such as a laptop portable computer, a desktop computer, and so on. Alternatively, the operating system running on the electronic device may include, but is not limited to, an android system, an IOS system, a linux system, a windows system, and the like.
In an exemplary embodiment, the procedure by which the operator node 101 implements the method for resource provisioning may be: the operator node 101 receives a resource demand request sent by a resource demand node; the operator node 101 determines a resource providing node corresponding to the resource demand request; the operator node 101 performs a double-sided netherlands auction between the resource demand node and the resource providing node according to the auction agent intelligence contract to determine a corresponding trading price attribute value; the operator node 101 performs the point clearance according to the price attribute value of the deal, and causes the resource providing node to provide the resource for the resource requiring node.
In addition, it should be noted that fig. 1 is only one application environment of the method for providing resources provided by the present disclosure. The number of operator nodes, resource demand nodes and resource providing nodes in fig. 1 is merely illustrative and any number of operator nodes, resource demand nodes, resource providing nodes may be provided according to actual needs.
In order for those of ordinary skill in the art to better understand the technical solutions of the present disclosure, the steps of the method for resource provisioning in the exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings and embodiments.
FIG. 2 illustrates a flow chart of a method for resource provisioning according to one embodiment of the present disclosure. The method provided by the embodiments of the present disclosure may be performed by an operator node as shown in fig. 1, but the present disclosure is not limited thereto.
As shown in fig. 2, a method for resource provisioning provided by an embodiment of the present disclosure may include the following steps.
Step S201, a resource demand request sent by a resource demand node is received.
In this step, the resource demand node is a node having a resource usage demand, which may be a user terminal device. The resource demand request may be a request message issued to the operator node in case the resource demand node has a resource usage demand. In some implementations, the resources required by the resource requiring node may include computing resources, communication resources, data transmission resources, and the like.
In step S203, a resource providing node corresponding to the resource demand request is determined.
In this step, the resource providing node may be a node that provides resources to other nodes, which may be user terminal devices or server devices. In some implementations, the resources available to the resource providing node may include computing resources, communication resources, data transmission resources, and the like. The resource providing node corresponding to the resource demand request can be understood as a node currently capable of providing its required resources to the resource demand node.
In some embodiments, the resource demand request may include a target resource required by the resource demand node; on this basis, step S203 may include: determining a near field communication range containing resource demand nodes; querying in a near field communication range to determine a relay node capable of providing a target resource; the relay node is determined as a resource providing node.
Among them, a near-field network (P-ran) is a technology proposed by 3GPP that allows communication between terminal devices directly through shared cell network resources without infrastructure. The above-mentioned near-field communication range may be understood as a range corresponding to a near-field network, and a relay node in the range that may provide a target resource may be understood as a terminal device that may provide a relay function for the target resource. User terminals in the same near field communication range participate in near field communication, and can be regarded as network resource sharing between terminals, so that the frequency spectrum efficiency of a communication system can be improved, and the battery consumption can be reduced.
In this embodiment, after receiving a resource demand request carrying a required target resource sent by a resource demand node, an operator node may determine a near-domain communication range including the resource demand node, then search for a relay node capable of providing the target resource in the near-domain communication range, and then determine a resource providing node in the relay node to be used for providing the target resource for the resource demand node. In some practical applications, all the determined relay nodes can be used as resource providing nodes according to practical requirements, and part of the determined relay nodes can also be selected as the resource providing nodes, namely, the number of the determined resource providing nodes can be one or more; when there are a plurality of target resource providing nodes, one target resource providing node can be selected for providing the target resource for the resource requiring node.
In step S205, a double-sided netherlands auction is conducted between the resource demand node and the resource providing node according to the auction agent intelligent closing to determine the corresponding price attribute value of the deal.
In this step, bilateral netherlands auction (DDA) is an effective way for solving the problem of bilateral market transaction matching and pricing, and is applied to the method for providing resources proposed in this application, so that reasonable matching and pricing can be performed for the resource demand node and the resource providing node, and the value of the price attribute of the transaction approved by both parties is obtained, thereby ensuring the effect of rationality and balance of matching and pricing. Wherein the auction service agent intelligence contract may be pre-deployed on the blockchain and may be used to oversee execution of steps of the bilateral netherlands auction.
In some practical applications, the resource demand node, the resource providing node and the operator node may form a blockchain consensus network, and the mobile phone user may apply for and register on the blockchain to become the resource providing node (also referred to as a service node), so as to directly share network resources for other mobile phone terminals, provide a near-domain network service, and obtain an integral. Meanwhile, the mobile phone user can also be used as a resource demand node (also called a user node) to acquire network resources shared by other resource providing nodes and pay points. The resource demand node in the near-domain communication range can be used for providing near-domain service demands (namely resource demand requests) in each round of resource provision, then the operator node is used as an auction agent, the near-domain service call market is opened by running an auction agent intelligent contract deployed on a blockchain, and bilateral Netherlands auctions are carried out between the resource demand node and the resource provision node so as to determine corresponding trading price attribute values.
Through the steps, the operator node can reasonably match and price the resource demand node and the resource providing node by running the pre-deployed auction agency intelligent contract, so that the automatic and efficient running of the bilateral Netherlands auction process can be ensured by codes, and the rationality and the balance of the auction are ensured.
And S207, performing integral clearing according to the transaction price attribute value, and enabling the resource providing node to provide resources for the resource demand node.
After the value of the cost attribute of the resource demand node and the resource providing node is determined through the double-sided netherlands auction, the transaction negotiation between the two parties can be considered to be completed, so that in the step, on one hand, the point clearance can be performed according to the value of the cost attribute of the transaction, and on the other hand, the resource providing node can start to provide resources for the resource demand node.
In some practical applications, for performing the point clearing, for example, the resource demand node may pay the point, so that the resource providing node obtains the benefit point; in still other practical applications, the bid attribute value of the resource demand node may be a value between the bid attribute value of the resource demand node and the bid attribute value of the resource providing node, that is, at the end of the transaction negotiation, there may be a gap between the bid attribute value of the resource demand node and the bid attribute value of the resource providing node, and then the gap may be regarded as a premium generated in the transaction and obtained as a partition by the operator node. Therefore, through the step, the point clearing can be carried out so that the price attribute value of the deal is embodied on the actual point change of the two parties (the resource demand node and the resource providing node), and the actual point change stimulates each node to actively participate in near-domain communication to share network resources, thereby promoting the autonomous evolution and self-driven construction operation of the near-domain network and greatly improving the frequency spectrum utilization rate and the communication capacity.
According to the method for providing the resources, the operator node can serve as an auction proxy, after receiving the resource demand request sent by the resource demand node, the resource demand node is firstly determined to be provided with the resource providing node capable of providing the resources for the resource demand node, then reasonable matching and pricing are carried out on the resource demand node and the resource providing node through the auction proxy intelligent contract running bilateral Netherlands auction, the approved trading price attribute values of the two parties are obtained, and then the integral clearing is carried out according to the trading price attribute values, so that the resource providing node provides the resources for the resource demand node. According to the method, on one hand, the high efficiency, rationality and balance of matching and pricing between the resource demand node and the resource providing node can be ensured according to the auction agency intelligent contract of the bilateral Netherlands auction, on the other hand, the actual integral change can be generated through integral clearing, and each node is stimulated to actively participate in near-domain communication to share network resources through the actual integral change, so that autonomous evolution and self-driven construction operation of a near-domain network are promoted, and the spectrum utilization rate and the communication capacity are greatly improved.
Fig. 3 illustrates a flow chart of conducting a double-sided netherlands auction to determine a price attribute value for a transaction in a method for resource provisioning in accordance with one embodiment of the present disclosure. As shown in fig. 3, the above step S205 may include the following steps.
Step S301, acquiring a price condition in the auction agent intelligent contract.
A price condition may be set in the pre-deployed auction agent intelligence contract, and the price condition may be regarded as a condition indicating the end of the auction. For example, the bid attribute value of the buyer and/or the seller in the auction may be satisfied, or may be a preset round number threshold value reached by the bids of the two parties in the auction, or may be a preset duration for the auction, which may be specifically set according to the actual situation or the actual requirement.
Step S303, according to the auction agency intelligent contract, using the resource demand node as the buyer of the double-sided Netherlands auction and the resource providing node as the seller of the double-sided Netherlands auction, receiving the buyer bidding attribute value sent by the buyer and the seller bidding attribute value sent by the seller in turn until the buyer bidding attribute value and the seller bidding attribute value meet the price requirement; wherein the bid attribute value decreases with the number of turns and the bid attribute value increases with the number of turns.
In this step, the resource demand node and the resource providing node may bid in turn, that is, both parties may bid asynchronously, the operator node serves as the auction agent to maintain the progress of the auction, and finally, when the bid attribute value of the buyer and the bid attribute value of the seller satisfy the price-bearing condition, the operator node determines the end of the auction according to the auction agent intelligent contract. In some implementations, the bid attribute values may be sent first by the buyer.
In addition, in some practical applications, after receiving the bid attribute value for the first time and receiving the bid attribute value for the first time, the operator node may determine whether the bid attribute value for the first time is greater than the bid attribute value for the first time, if so, the auction is continuously performed, and if not, it means that there is no willingness to trade between the two parties, and the transaction may be terminated.
In step S305, the target buyer bid attribute value and the target seller bid attribute value when the price requirement is satisfied are acquired to determine a transaction price attribute value based on the target buyer bid attribute value and the target seller bid attribute value.
When the auction is determined to be over, the operator node may calculate a final cost attribute value, and may also broadcast the cost attribute value to both parties, so that the credit clearing is performed simultaneously in a subsequent step, and fairness and simultaneity of the transaction are ensured.
In some practical applications, the resource providing nodes serving as the sellers may be one or more, and when the plurality of resource providing nodes are in a plurality, a competition relationship exists in the plurality of resource providing nodes, and a target resource providing node needs to be selected to provide resources for the resource demand node in a subsequent step. Specifically, the operator node may receive the seller node bid attribute values sent by the plurality of resource providing nodes in the same round (i.e., the round) of receiving the seller bid attribute values, and may record an array of the plurality of seller node bid attribute values as the seller bid attribute values in the round; further, the end of the auction transaction may be determined when a first seller node bid attribute value satisfying the bid condition occurs, and the resource providing node corresponding to the first seller node bid attribute value satisfying the bid condition is used as a target resource providing node, and resources are provided to the resource requiring node in a subsequent step.
Similarly, in some practical applications, the number of the resource demand nodes serving as the buyers may be one or more, when the number of the resource demand nodes is plural, the number of the resource providing nodes is plural, one target resource demand node needs to be selected from the plurality of the resource demand nodes, and one target resource providing node needs to be selected from the plurality of the resource providing nodes, and in the subsequent steps, the target resource providing node is made to provide the resource for the target resource demand node. Next, for example, the operator node may also receive the bid attribute values of the buyer node sent by the plurality of resource demand nodes in the same round (i.e. the number of times of the round) of receiving the bid attribute values of the buyer node, and may record an array formed by the plurality of bid attribute values of the buyer node as the bid attribute values of the buyer node in the round; further, the end of the auction transaction may be determined when a first pair of the buyer node bid attribute value and the seller node bid attribute value satisfying the corresponding price condition occurs, and the resource demand node corresponding to the buyer node bid attribute value is taken as the target resource demand node, and the resource providing node corresponding to the seller node bid attribute value is taken as the target resource providing node, among the first pair of the buyer node bid attribute value and the seller node bid attribute value satisfying the corresponding price condition, and the target resource providing node is made to provide resources for the target resource demand node in a subsequent step.
In some embodiments, the "determining the bid-to-offer attribute value from the target buyer-bid attribute value and the target seller-bid attribute value" in step S305 may include: acquiring a buyer weight value and a seller weight value in an auction agent intelligent contract; and calculating according to the target bid attribute value, the target seller bid attribute value, the buyer weight value and the seller weight value to obtain the transaction price attribute value.
Wherein, the buyer weight value and the seller weight value may be preset, and the sum of the buyer weight value and the seller weight value may be 1. With the present embodiment, when the final target bid attribute value and the target bid attribute value are inconsistent, the bid attribute value can be located between the target bid attribute value and the target bid attribute value, so as to obtain the bid attribute value approved by both parties.
In some embodiments, the method for resource provisioning further comprises: a buyer clock value is created for the buyer and a seller clock value is created for the seller.
The buyer clock field and the seller clock field can be created based on the auction agent intelligent contract, wherein the buyer clock value is the value corresponding to the buyer clock field, and the seller clock value is the value corresponding to the seller clock field; the buyer clock value may be used to record the bid attribute value of the buyer at the current time and the seller clock value may be used to record the bid attribute value of the seller at the current time, i.e., the clock value (including the buyer clock value and the seller clock value) always records the latest bid attribute value.
On this basis, fig. 4 shows a flow chart of the alternate bidding of two parties during a double-sided netherlands auction in a method for resource provisioning according to one embodiment of the present disclosure. As shown in fig. 4, the above-described "receiving the buyer-transmitted buyer-bid attribute value and the seller-transmitted seller-bid attribute value in turn" in step S303 until the buyer-bid attribute value and the seller-bid attribute value satisfy the price requirement "may include the following steps.
In step S401, the buyer and the seller are alternately used as current bidders, and the current bid attribute value sent by the current bidder is received.
Step S403, after each round of receiving the current bid attribute value sent by the current bidder, performing clock update according to the current bid attribute value to obtain the current updated clock value of the current bidder.
Step S405, after obtaining the current updated clock value of the current bidder, if the current updated clock value and the current clock value of the other party of the current bidder do not satisfy the bid condition, broadcasting the current updated clock value to the other party of the current bidder, so that the other party of the current bidder acts as the current bidder of the next round to send the current bid attribute value of the next round until the current updated clock value and the current clock value of the other party of the current bidder satisfy the bid condition.
If the current bidding party is a buyer, the current bidding attribute value sent by the current bidding party comprises the current buyer bidding attribute value sent by the resource demand node, the current updated clock value of the current bidding party is a buyer clock value, and the current clock value of the other party of the current bidding party is a seller clock value; if the current bidder is a seller, the current bid attribute value transmitted by the current bidder includes a current seller bid attribute value transmitted by the resource providing node, the current updated clock value of the current bidder is a seller clock value, and the current clock value of the other party of the current bidder is a buyer clock value.
The embodiment shown in fig. 4 is described below taking the current bidder as the buyer:
the operator node receives the current bid attribute value sent by the resource demand node, performs clock updating according to the current bid attribute value to obtain a buyer clock value, if the buyer clock value and the seller clock value do not meet the price requirement, broadcasts the buyer clock value to the seller, so that the seller sends the current seller bid attribute value in the next round, and after the operator node receives the current bid attribute value, judges whether the buyer clock value and the seller clock value in the next round meet the price requirement or not, and accordingly reciprocates until the buyer clock value and the seller clock value meet the price requirement.
In some practical applications, the operator node may also broadcast the current updated clock value to all nodes participating in the present transaction each time the current bid attribute value is received, which is not limited by the present disclosure.
In this embodiment, the operator node may act as an auction proxy to execute the auction process by running an auction proxy intelligence contract. The auction agent in the process may maintain both the buyer and seller's netherlands clocks (i.e., the buyer clock field and its buyer clock value, the seller clock field and its seller clock value, as described above). Wherein the buyer clock value may display the buyer's bid attribute value, beginning with the highest bid, decreasing over time. The seller clock value may display the seller's bid attribute values, beginning at the lowest price and rising over time. Furthermore, in some practical applications, the valence conditions may be: the value obtained by subtracting the seller clock value from the buyer clock value is less than or equal to a preset crossover threshold.
In some embodiments, when a bid-to-bid attribute value needs to be calculated from the target bid-to-bid attribute value and the target bid-to-bid attribute value, the buyer clock value at which the bid condition is satisfied may be the target bid-to-bid attribute value and the seller clock value at which the bid condition is satisfied may be the target seller bid attribute value.
In some embodiments, clock updating based on the current bid attribute value to obtain a current updated clock value for the current bidder includes: acquiring bid detection conditions in the auction agent intelligent contract; judging whether the current bid attribute value meets the bid detection condition or not; if yes, the current bid attribute value is used as a current updated clock value; if the current bid attribute value does not meet the preset step value, the current bid attribute value is adjusted based on the preset step value, and the adjusted current bid attribute value is used as a current updated clock value.
The bid detection condition and the preset step size value may be set in the auction proxy intelligent contract in advance, and the bid detection condition may be used to determine whether the bid attribute value is reasonable, for example, for a round of bidding for a buyer, if the buyer refuses to send the bid attribute value or the sent bid attribute value differs too low compared with the last bid, the operator node may determine that the current bid attribute value does not meet the bid detection condition based on the bid detection condition, and may further adjust the current bid attribute value based on the preset step size value, and use the adjusted current bid attribute value as the current updated clock value.
In some embodiments, adjusting the current bid attribute value based on the preset step value includes: reducing the current bid attribute value of the buyer based on a preset step value; or, increasing the current seller bid attribute value based on a preset step value.
In some embodiments, the resource demand node, the resource providing node, and the operator node are all nodes on a blockchain; wherein, carry out the integral clearance according to the price attribute value of the interchange, include: acquiring a target bid attribute value and a target bid attribute value of a seller; calculating a to-be-paid integral value of the resource demand node and a first to-be-obtained integral value of the resource providing node according to the achievement price attribute value, the target buyer bid attribute value and the target seller bid attribute value, and a second to-be-obtained integral value of the operator node; the method comprises the steps of reducing the integral value of the resource demand node on the blockchain according to the integral value to be paid, increasing the integral value of the resource providing node on the blockchain according to the first integral value to be obtained, and increasing the integral value of the operator node on the blockchain according to the second integral value to be obtained.
In some implementations, at the end of the auction transaction, there may be a gap between the bid attribute value of the resource demand node and the offer price attribute value, and between the offer price attribute value and the bid attribute value of the resource providing node, which may then be regarded as the overflow price generated in the transaction as the second to-be-obtained point value of the operator node.
According to the embodiment, the operator node can conduct point clearing according to the auction agency intelligent contract, the transaction is executed, the resource demand node pays points (to-be-paid points) and the resource providing node obtains profit points (first to-be-obtained points), and the overflow price generated in the transaction can be divided into (second to-be-obtained points) as incentive to pay the operator node to pay the cost of the broadcast information.
FIG. 5 illustrates a schematic architecture of a method for resource provisioning, as illustrated in FIG. 5, in which one embodiment of the present disclosure may be implemented, the architecture comprising: operator node 501, resource demand node 502, resource supply node 503, auction agent intelligence contract 504, buyer clock 505, and seller clock 506. Wherein the operator node 501 may run an auction agent intelligence contract 504 to perform an auction process; in the auction process, the operator node 501 may maintain a buyer clock 505 for the resource demand node 502 and a seller clock 506 for the resource providing node 503, broadcast a corresponding clock to the resource demand node 502 or the resource providing node 503 and accept the bid attribute value of the resource demand node 502 or the resource providing node 503, and determine when the transaction ends based on the auction agent intelligent contract 504; the operator node 501 may calculate points that the resource demand node 502 should pay, points that the resource providing node 503 should obtain, and points that the operator node 501 should obtain at the end of the determination transaction, and cause the resource providing node 503 to provide the resource to the resource demand node 502.
It is noted that the above-described figures are only schematic illustrations of processes involved in a method according to an exemplary embodiment of the invention, and are not intended to be limiting. It will be readily appreciated that the processes shown in the above figures do not indicate or limit the temporal order of these processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, for example, among a plurality of modules.
Fig. 6 shows a block diagram of an apparatus 600 for resource provisioning, applied to an operator node, according to one embodiment of the present disclosure; as shown in fig. 6, the apparatus for resource provision includes:
a receiving module 601, configured to receive a resource demand request sent by a resource demand node; a determining module 602, configured to determine a resource providing node corresponding to the resource demand request; an auction module 603 for conducting a double-sided netherlands auction between the resource demand node and the resource providing node according to the auction agent intelligence contract to determine a corresponding trading price attribute value; and the clearing module 604 is configured to perform integral clearing according to the price attribute value of the deal, and make the resource providing node provide the resource for the resource demand node.
The device for providing the resources can be used as an auction agency by an operator node, after receiving a resource demand request sent by a resource demand node, the operator node firstly determines a resource providing node capable of providing the resource for the resource demand node, then reasonably matches and pricing the resource demand node and the resource providing node through an auction agency intelligent contract running bilateral Netherlands auction to obtain a meeting price attribute value approved by both parties, and then carries out integral clearing according to the meeting price attribute value and enables the resource providing node to provide the resource for the resource demand node. According to the method, on one hand, the high efficiency, rationality and balance of matching and pricing between the resource demand node and the resource providing node can be ensured according to the auction agency intelligent contract of the bilateral Netherlands auction, on the other hand, the actual integral change can be generated through integral clearing, and each node is stimulated to actively participate in near-domain communication to share network resources through the actual integral change, so that autonomous evolution and self-driven construction operation of a near-domain network are promoted, and the spectrum utilization rate and the communication capacity are greatly improved.
In some embodiments, the resource demand request includes a target resource required by the resource demand node; and, the determining module 602 determines a resource providing node corresponding to the resource demand request, comprising: determining a near field communication range containing resource demand nodes; querying in a near field communication range to determine a relay node capable of providing a target resource; the relay node is determined as a resource providing node.
In some embodiments, the auction module 603 performs a double-sided netherlands auction between the resource demand node and the resource providing node according to the auction agent intelligence contract to determine a corresponding value of the price attribute of the deal, including: acquiring a price condition in an auction agent intelligent contract; according to the auction agency intelligent contract, taking a resource demand node as a buyer of the bilateral netherlands auction and a resource providing node as a seller of the bilateral netherlands auction, and receiving the buyer bidding attribute value sent by the buyer and the seller bidding attribute value sent by the seller in turn until the buyer bidding attribute value and the seller bidding attribute value meet the price application condition; wherein the bid attribute value of the buyer decreases with the number of turns and the bid attribute value of the seller increases with the number of turns; the target bid attribute value and the target seller bid attribute value are obtained when the bid condition is satisfied to determine a bid attribute value based on the target bid attribute value and the target seller bid attribute value.
In some embodiments, the auction module 603 is also for: creating a buyer clock value for the buyer and a seller clock value for the seller; wherein the auction module 603 receives the buyer bid attribute value sent by the buyer and the seller bid attribute value sent by the seller in turn until the buyer bid attribute value and the seller bid attribute value satisfy the bid condition, comprising: alternately taking the buyer and the seller as current bidders, and receiving the current bid attribute value sent by the current bidders; after each round of receiving the current bid attribute value sent by the current bidder, performing clock updating according to the current bid attribute value to obtain a current updated clock value of the current bidder; and after obtaining the current updated clock value of the current bidder, if the current updated clock value and the current clock value of the other party of the current bidder do not meet the price requirement, broadcasting the current updated clock value to the other party of the current bidder so that the other party of the current bidder can serve as the current bidder of the next round to send the current bid attribute value of the next round until the current updated clock value and the current clock value of the other party of the current bidder meet the price requirement; if the current bidding party is a buyer, the current bidding attribute value sent by the current bidding party comprises the current buyer bidding attribute value sent by the resource demand node, the current updated clock value of the current bidding party is a buyer clock value, and the current clock value of the other party of the current bidding party is a seller clock value; if the current bidder is a seller, the current bid attribute value transmitted by the current bidder includes a current seller bid attribute value transmitted by the resource providing node, the current updated clock value of the current bidder is a seller clock value, and the current clock value of the other party of the current bidder is a buyer clock value.
In some embodiments, the auction module 603 performs a clock update based on the current bid attribute value to obtain a current updated clock value for the current bidder, including: acquiring bid detection conditions in the auction agent intelligent contract; judging whether the current bid attribute value meets the bid detection condition or not; if yes, the current bid attribute value is used as a current updated clock value; if the current bid attribute value does not meet the preset step value, the current bid attribute value is adjusted based on the preset step value, and the adjusted current bid attribute value is used as a current updated clock value.
In some embodiments, the auction module 603 adjusts the current bid attribute value based on a preset step value, including: reducing the current bid attribute value of the buyer based on a preset step value; or, increasing the current seller bid attribute value based on a preset step value.
In some embodiments, the auction module 603 obtains the target buyer bid attribute value and the target seller bid attribute value when the bid condition is met to determine a bid price attribute value based on the target buyer bid attribute value and the target seller bid attribute value, including: taking the buyer clock value when the price condition is met as a target buyer bidding attribute value, and taking the seller clock value when the price condition is met as a target seller bidding attribute value; acquiring a buyer weight value and a seller weight value in an auction agent intelligent contract; and calculating according to the target bid attribute value, the target seller bid attribute value, the buyer weight value and the seller weight value to obtain the transaction price attribute value.
In some embodiments, the resource demand node, the resource providing node, and the operator node are all nodes on a blockchain; wherein the clearing module 604 performs an integral clearing according to the price attribute value of the deal, including: acquiring a target bid attribute value and a target bid attribute value of a seller; calculating a to-be-paid integral value of the resource demand node and a first to-be-obtained integral value of the resource providing node according to the achievement price attribute value, the target buyer bid attribute value and the target seller bid attribute value, and a second to-be-obtained integral value of the operator node; the method comprises the steps of reducing the integral value of the resource demand node on the blockchain according to the integral value to be paid, increasing the integral value of the resource providing node on the blockchain according to the first integral value to be obtained, and increasing the integral value of the operator node on the blockchain according to the second integral value to be obtained.
Other contents of the embodiment of fig. 6 may refer to the above-mentioned other embodiments, and will not be described herein.
Those skilled in the art will appreciate that the various aspects of the invention may be implemented as a system, method, or program product. Accordingly, aspects of the invention may be embodied in the following forms, namely: an entirely hardware embodiment, an entirely software embodiment (including firmware, micro-code, etc.) or an embodiment combining hardware and software aspects may be referred to herein as a "circuit," module "or" system.
FIG. 7 illustrates a block diagram of a computer device for resource provisioning in an embodiment of the present disclosure. It should be noted that the illustrated electronic device is only an example, and should not impose any limitation on the functions and application scope of the embodiments of the present invention.
An electronic device 700 according to this embodiment of the invention is described below with reference to fig. 7. The electronic device 700 shown in fig. 7 is merely an example, and should not be construed as limiting the functionality and scope of use of embodiments of the present invention.
As shown in fig. 7, the electronic device 700 is embodied in the form of a general purpose computing device. Components of electronic device 700 may include, but are not limited to: the at least one processing unit 710, the at least one memory unit 720, and a bus 730 connecting the different system components, including the memory unit 720 and the processing unit 710.
Wherein the storage unit stores program code that is executable by the processing unit 710 such that the processing unit 710 performs steps according to various exemplary embodiments of the present invention described in the above-mentioned "exemplary methods" section of the present specification. For example, the processing unit 710 may perform the method as shown in fig. 2.
The memory unit 720 may include readable media in the form of volatile memory units, such as Random Access Memory (RAM) 7201 and/or cache memory 7202, and may further include Read Only Memory (ROM) 7203.
The storage unit 720 may also include a program/utility 7204 having a set (at least one) of program modules 7205, such program modules 7205 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment.
Bus 730 may be a bus representing one or more of several types of bus structures including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
The electronic device 700 may also communicate with one or more external devices 800 (e.g., keyboard, pointing device, bluetooth device, etc.), one or more devices that enable a user to interact with the electronic device 700, and/or any device (e.g., router, modem, etc.) that enables the electronic device 700 to communicate with one or more other computing devices. Such communication may occur through an input/output (I/O) interface 750. Also, electronic device 700 may communicate with one or more networks such as a Local Area Network (LAN), a Wide Area Network (WAN) and/or a public network, such as the Internet, through network adapter 760. As shown, network adapter 760 communicates with other modules of electronic device 700 over bus 730. It should be appreciated that although not shown, other hardware and/or software modules may be used in connection with electronic device 700, including, but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, data backup storage systems, and the like.
In an exemplary embodiment of the present disclosure, a computer-readable storage medium having stored thereon a program product capable of implementing the method described above in the present specification is also provided. In some possible embodiments, the various aspects of the invention may also be implemented in the form of a program product comprising program code for causing a terminal device to carry out the steps according to the various exemplary embodiments of the invention as described in the "exemplary methods" section of this specification, when said program product is run on the terminal device.
A program product for implementing the above-described method according to an embodiment of the present invention may employ a portable compact disc read-only memory (CD-ROM) and include program code, and may be run on a terminal device such as a personal computer. However, the program product of the present invention is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The computer readable signal medium may include a data signal propagated in baseband or as part of a carrier wave with readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of remote computing devices, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., connected via the Internet using an Internet service provider).
It should be noted that although in the above detailed description several modules or units of a device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit in accordance with embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into a plurality of modules or units to be embodied.
Furthermore, although the steps of the methods in the present disclosure are depicted in a particular order in the drawings, this does not require or imply that the steps must be performed in that particular order or that all illustrated steps be performed in order to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step to perform, and/or one step decomposed into multiple steps to perform, etc.
From the above description of embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or may be implemented in software in combination with the necessary hardware. Thus, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disk, a mobile hard disk, etc.) or on a network, including several instructions to cause a computing device (may be a personal computer, a server, a mobile terminal, or a network device, etc.) to perform the method according to the embodiments of the present disclosure.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any adaptations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

Claims (11)

1. A method for resource provisioning, applied to an operator node, comprising:
receiving a resource demand request sent by a resource demand node;
determining a resource providing node corresponding to the resource demand request;
conducting bilateral netherlands auctions between the resource demand node and the resource providing node according to an auction agent intelligent contract to determine corresponding trading price attribute values;
and carrying out integral clearing according to the transaction price attribute value, and enabling the resource providing node to provide resources for the resource demand node.
2. The method of claim 1, wherein the resource demand request includes a target resource required by the resource demand node; and determining a resource providing node corresponding to the resource demand request, comprising:
Determining a near field communication range containing the resource demand node;
querying in the near field communication range to determine a relay node capable of providing the target resource;
and determining the relay node as the resource providing node.
3. The method of any of claims 1-2, wherein conducting a double-sided netherlands auction between the resource demand node and the resource providing node according to an auction agent intelligence contract to determine a corresponding achievement price attribute value comprises:
acquiring a price condition in an auction agent intelligent contract;
according to an auction agent intelligent contract, taking the resource demand node as a buyer of the bilateral netherlands auction and the resource providing node as a seller of the bilateral netherlands auction, and receiving the buyer bidding attribute value sent by the buyer and the seller bidding attribute value sent by the seller in turn until the buyer bidding attribute value and the seller bidding attribute value meet the price-bearing condition; wherein the buyer bid attribute value decreases with the number of turns and the seller bid attribute value increases with the number of turns;
and acquiring a target buyer bid attribute value and a target seller bid attribute value when the price requirement is met, so as to determine the transaction price attribute value according to the target buyer bid attribute value and the target seller bid attribute value.
4. A method according to claim 3, further comprising: creating a buyer clock value for the buyer and a seller clock value for the seller;
and receiving the bid attribute value sent by the buyer and the bid attribute value sent by the seller in turn until the bid attribute value and the bid attribute value meet the price-bearing condition, wherein the method comprises the following steps:
alternately taking the buyer and the seller as current bidders, and receiving current bid attribute values sent by the current bidders;
after each round of receiving a current bid attribute value sent by the current bidder, performing clock updating according to the current bid attribute value to obtain a current updated clock value of the current bidder;
and after obtaining the current updated clock value of the current bidder, if the current updated clock value and the current clock value of the other party of the current bidder do not meet the cost condition, broadcasting the current updated clock value to the other party of the current bidder, so that the other party of the current bidder is used as the current bidder of the next round to send the current bid attribute value of the next round until the current updated clock value and the current clock value of the other party of the current bidder meet the cost condition;
If the current bidding party is a buyer, the current bidding attribute value sent by the current bidding party comprises the current buyer bidding attribute value sent by the resource demand node, the current updated clock value of the current bidding party is the buyer clock value, and the current clock value of the other party of the current bidding party is the seller clock value; if the current bidder is a seller, the current bid attribute value sent by the current bidder includes a current seller bid attribute value sent by the resource providing node, a current updated clock value of the current bidder is the seller clock value, and a current clock value of another party of the current bidder is the buyer clock value.
5. The method of claim 4, wherein clock updating based on the current bid attribute value to obtain a current updated clock value for the current bidder comprises:
acquiring bid detection conditions in the auction agent intelligent contract;
judging whether the current bid attribute value meets the bid detection condition;
if yes, the current bid attribute value is used as the current updated clock value;
and if the current bid attribute value does not meet the current bid attribute value, adjusting the current bid attribute value based on a preset step value, and taking the adjusted current bid attribute value as the current updated clock value.
6. The method of claim 5, wherein adjusting the current bid attribute value based on a preset step value comprises:
reducing the current bid attribute value based on the preset step value; or,
and increasing the current seller bidding attribute value based on the preset step value.
7. The method of claim 4, wherein obtaining a target bid attribute value and a target bid attribute value for satisfying the bid condition to determine the offer price attribute value from the target bid attribute value and the target bid attribute value comprises:
taking the buyer clock value when the price condition is met as the target buyer bidding attribute value and the seller clock value when the price condition is met as the target seller bidding attribute value;
acquiring a buyer weight value and a seller weight value in the auction agent intelligent contract;
and calculating according to the target buyer bidding attribute value, the target seller bidding attribute value, the buyer weight value and the seller weight value to obtain the transaction price attribute value.
8. A method according to claim 3, wherein the resource demand node, the resource providing node and the operator node are nodes on a blockchain;
Wherein, according to the price attribute value of the deal, the integral clearing is carried out, which comprises the following steps:
acquiring the target buyer bid attribute value and the target seller bid attribute value;
calculating a to-be-paid integral value of the resource demand node, a first to-be-obtained integral value of the resource providing node and a second to-be-obtained integral value of the operator node according to the transaction price attribute value, the target buyer bid attribute value and the target seller bid attribute value;
the method further comprises reducing an integral of the resource demand node on the blockchain according to the to-be-paid integral, increasing an integral of the resource providing node on the blockchain according to the first to-be-obtained integral, and increasing an integral of the operation Shang Jiedian on the blockchain according to the second to-be-obtained integral.
9. An apparatus for resource provisioning, applied to an operator node, comprising:
the receiving module is used for receiving the resource demand request sent by the resource demand node;
a determining module, configured to determine a resource providing node corresponding to the resource demand request;
the auction module is used for conducting double-sided Netherlands auctions between the resource demand nodes and the resource providing nodes according to the auction agency intelligent contract so as to determine corresponding trading price attribute values;
And the clearing module is used for carrying out integral clearing according to the transaction price attribute value and enabling the resource providing node to provide resources for the resource demand node.
10. A computer readable storage medium having stored thereon a computer program which when executed by a processor implements a method for resource provisioning according to any of claims 1 to 8.
11. An electronic device, comprising:
one or more processors;
storage means for storing one or more programs which when executed by the one or more processors cause the one or more processors to implement the method for resource provisioning of any of claims 1 to 8.
CN202210787355.4A 2022-07-04 2022-07-04 Method and device for providing resources, storage medium and electronic equipment Pending CN117408790A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210787355.4A CN117408790A (en) 2022-07-04 2022-07-04 Method and device for providing resources, storage medium and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210787355.4A CN117408790A (en) 2022-07-04 2022-07-04 Method and device for providing resources, storage medium and electronic equipment

Publications (1)

Publication Number Publication Date
CN117408790A true CN117408790A (en) 2024-01-16

Family

ID=89496663

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210787355.4A Pending CN117408790A (en) 2022-07-04 2022-07-04 Method and device for providing resources, storage medium and electronic equipment

Country Status (1)

Country Link
CN (1) CN117408790A (en)

Similar Documents

Publication Publication Date Title
CN111010434B (en) Optimized task unloading method based on network delay and resource management
WO2020088075A1 (en) Method and apparatus for determining payment channel
CN109600849B (en) Parallel resource allocation method based on mobile edge computing system
US20190150036A1 (en) Distributed ledger system for management of exchanges of wireless services between wireless service providers
US20170109815A1 (en) On demand auctions of cloud resources (bundles) in hybrid cloud environments
CN109714797B (en) Mobile edge network resource allocation method based on auction theory
CN105721565A (en) Game based cloud computation resource allocation method and system
CN111210255B (en) Advertisement pushing method and device and electronic equipment
US20140330647A1 (en) Application and service selection for optimized promotion
CN111131356B (en) Method and apparatus for generating information
CN111857888B (en) Transaction processing method and device
CN111680997A (en) Distributed transaction payment method, system and storage medium
CN109978632A (en) Behavioral data processing method, device, equipment and the medium of terminal applies
CN112686528A (en) Method, apparatus, server and medium for allocating customer service resources
CN112381453A (en) Information processing method, information processing apparatus, electronic device, and medium
CN115509754A (en) Business data processing method and device, electronic equipment and storage medium
CN111881329A (en) Account balance management method and system
US20140237482A1 (en) Computational resource management
CN117408790A (en) Method and device for providing resources, storage medium and electronic equipment
CN111815368A (en) Advertisement pushing method, device, terminal and storage medium
CN111091402A (en) Value data adjusting method and device, electronic equipment and readable medium
CN117670456A (en) Method and device for resource interaction, storage medium and electronic equipment
CN116743348B (en) Method, device, system, equipment and medium for processing decentralised frequency spectrum resources
CN111242576A (en) Method and device for processing request
CN111179026A (en) Advertisement bidding method and system and electronic equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination