CN111523987A

CN111523987A - Quick exchange method of bidding data and bidding method

Info

Publication number: CN111523987A
Application number: CN202010314823.7A
Authority: CN
Inventors: 韩旭文; 罗亚琪; 刘婷婷
Original assignee: Jiangxi Electromechanical Equipment Tendering Co ltd
Current assignee: Jiangxi Electromechanical Equipment Tendering Co ltd
Priority date: 2020-04-21
Filing date: 2020-04-21
Publication date: 2020-08-11
Anticipated expiration: 2040-04-21
Also published as: CN111523987B

Abstract

The invention discloses a quick exchange method of bidding data. Wherein the first device generates a plurality of bidder tags of fixed length and transmits the tags to the second device. And after receiving the bidder label, the second device modifies the bidder label x _0 and sends the modified bidder label to the third device. And after receiving the bidder label, the third device modifies the bidder label x _1 and feeds the modified bidder label back to the first device. The first device modifies bidder tag x _ 2. The data exchange efficiency can be remarkably improved by transferring the label of the bidder instead of the bidding document between the devices. The bidder tag comprises a service time field, and can record key time points for bidding. The invention also discloses a bidding method.

Description

Quick exchange method of bidding data and bidding method

Technical Field

The invention belongs to data transmission and processing technology, and particularly relates to a quick exchange method of bidding data. The invention also relates to a bidding method.

Background

CN109871387A discloses a bidding service data interaction method and system. When the operation of modifying and deleting the bidding service data is completed, sending a data change prompt to a responsible person associated with the corresponding bidding service data; when the bidding service data is modified or deleted, a data change prompt is sent to a responsible person associated with the corresponding bidding service data, and the corresponding responsible person is timely reminded to pay attention to the data change. In view of the time limit of the bidding service, the online bidding service has strict requirements on the data exchange efficiency. The data interaction method of the prior art is easy to cause data redundancy.

CN104063793A discloses a method for performing secure transactions between different servers using identity codes. The first service server stores multiple groups of user data and multiple groups of corresponding user codes, the second service server stores multiple groups of second user data, and the code mechanism server stores corresponding codes corresponding to the first service server. When the transaction is carried out later, the identity codes respectively represent the users carrying out the transaction, so that the problem that personal data of the users leak in the transaction process can be avoided.

US20100122082a1 discloses an authentication system for a user. The user registers the real identity of the user with a user identity management mechanism, and the user is issued with a unique permanent identity and a password, wherein the password is a hash function code with different forms. Each form of hash function code is generated by a hash function. The identity code and the hash function of the case constitute an identity verification system, which can be referred to in the present application.

Disclosure of Invention

The invention provides a quick exchange method of tendering and bidding data, which can improve the data exchange efficiency by replacing image data with bidder labels, and the tenderer labels are defined by independent ports and can supervise tendering and bidding periods.

A method for rapidly exchanging bidding data is characterized in that,

the first device generates a plurality of bidder tags of fixed length and transmits the tags to the second device, wherein the bidder tags are

And, furthermore,

is defined as a null data segment that is,

after the second device receives the bidder label, the second device modifies the bidder label

And transmitting the modified bidder tag to a third device, wherein,

is a random number, and is a random number,

after the third equipment receives the bidder label, the third equipment modifies the bidder label

And feeding back the modified bidder tag to the first device, wherein,

is an identification field of the fourth device,

first device modifying bidder tags

Wherein, in the step (A),

，

a hash function defined for the first device,

the first device sends the bidder label to the second device, and the second device sends the bidding data to the fourth device according to the bidder label and modifies the bidder label

Wherein, in the step (A),

to prequalify the transmission time of the document, the modified bidder tag is transmitted to a third device,

the third device receives the bidding data and modifies the bidder's label

Wherein, in the step (A),

to pre-review the time of receipt of the application file, the modified bidder tag is transmitted to the first device,

first device matching corresponding identity field

Thereafter, the corresponding bidder label is modified

Wherein, in the step (A),

wherein

A hash function defined for the first device,

Wherein, in the step (A),

transmitting the modified bidder tag to the second bidder for the transmission time of the bidding documentThree devices are adopted, namely, a device,

the third device receives the bidding data and modifies the bidder's label

Wherein, in the step (A),

the modified bidder tag is transmitted to the first device for the time of receipt of the bid file,

the supervising end matches the corresponding identity field

Thereafter, the corresponding bidder label is modified

Wherein, in the step (A),

wherein

A hash function defined for the first device.

In the present invention, when

When the system state is "winning bid".

In the present invention, when

And, the system state is "bid".

In the present invention, when

And is

The system state is "pre-audit".

In the present invention, in the case of the present invention,

is an integer expressed by year, month and day.

In the present invention, the first device, the second device, the third device, and the fourth device are all computers.

A bidding method is characterized in that the quick exchange method of the bidding data is adopted.

According to the quick exchange method of the bidding data, the bidder labels are transmitted among the devices instead of the bidding documents, so that the data exchange efficiency can be obviously improved. The bidder tag comprises a service time field, and can record key time points for bidding. The core field of the bidder tag is defined by the supervision side in an encrypted manner, and if the data is modified in the transmission process, the supervision side can find the modified data through data matching.

Drawings

FIG. 1 is a schematic diagram of a fast data exchange method of the present invention;

FIG. 2 is a schematic diagram of FIG. 1;

FIG. 3 is a block diagram of a bidding method of the present invention;

FIG. 4 is a schematic illustration of the multi-bidding task parallelism of the present invention;

fig. 5 is a network connection diagram of the physical server of fig. 4.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention.

Referring to fig. 1, the method for rapidly exchanging bidding data according to the present invention comprises at least three data exchange periods. The three exchange periods mainly realize data updating and data exchange of the bidder tags. The data exchange is mainly completed among the first device, the second device, the third device and the fourth device, the first deviceThe device is a supervisor end, the second device is a supervisor end, the third device is a bidding server, and the fourth device is a user end. The bidder tag is a code of a predetermined length, and for a portion where no modification is input, a corresponding portion of the code string may be a null data segment. For example, in the present embodiment, the bidder tag is represented as a code including nine data segments

. In the present application, it is preferred that,

defined as a null data segment. In the present application, the bidder tags are defined by the supervision section, but the agent side and the server can modify the tag data section. The monitoring end, the bidding server and the agent end check whether the previous data segment exists before the bidder label is modified, and if the previous data segment is empty, the next data segment is forbidden to be modified.

Referring to fig. 2, the first data exchange period is data exchange before pre-review, and it can be checked whether the system connection is smooth. The supervision terminal generates a plurality of bidder tags with fixed lengths and sends the tags to the bidding server. After receiving the bidder label, the bidding server modifies the bidder label

And sending the modified bidder label to the agent.The random number is, for example, an integer within 10b bytes, and the generation method of the random number is determined by the bidding server. After the agent end receives the bidder label, the agent end modifies the bidder label

And feeds back the modified bidder label to the supervising end.

An identification field for the user terminal, the labelThe literacy field should include both the user identity and the bid item. For example, the user identification field 010052 may indicate the user terminal 010, bid items 052. After the bidding begins, the monitoring end modifies the label of the bidder

。

，

A hash function defined for the policing peer. Generally, the number of the bidder tags generated by the supervision terminal is large, but the agent terminal only modifies the tags according to the number of the users participating in bidding, the modified tags participate in next operation, and the null tags are deleted or not processed.

The supervision end of the application finishes the definition of partial data segments through a Hash algorithm (Hash algorithm). Storing a predetermined plurality of hash functions or hash tables at the policing terminal, based on the input values

Generating hash values

. According to the irreversibility of the hash function, cannot

And

deducing a hash function

. Likewise, modify any

Then, the hash value cannot be determined

. Based on this, the supervision section can verify the bidder label returned by the agent end

To determine

Whether or not modified. It is anticipated that the Hash algorithm may have a wide range of domains and a limited range of values, and thus of the present application

The long data segment can be obtained shorter

And (4) data segments.

And after the monitoring section confirms that the bidding process is started, performing a second data exchange period for the bidding process. The monitoring end sends the bidder tags to the server, and the server sends qualification prequalification files to the user end according to the bidder tags. In this embodiment, the server detects the bidder's label when

And is

And sending the prequalification file to the user side. The server adding the transmission time of prequalification file as the bidder's label

And sending the modified bidder label to the agent terminal. For example, the sending time of the prequalification file is 2019, 10 months and 1 day,

. The agent end receives the pre-examination application file submitted by the user end, and adds the receiving time as the label of the bidder

The modified bidder tag is transmitted to the supervising end. For example, the receiving time of the pre-review application file is 12 months and 1 day 2019,

. The supervising end matches the corresponding identity field

Thereafter, the corresponding bidder label is modified

。

Wherein

A hash function defined for the policing peer. Algorithm definition of hash function is as

The method is as follows.

And after the beginning of the bidding work is confirmed by the supervision section, a third data exchange period is carried out. The monitoring end sends the bidder tags to the server, and the server sends the bidding documents to the user end according to the bidder tags. In this embodiment, the server detects the bidder's label when

And is

And then sending the bidding document to the user side. The server adds the transmission time of the bidding document as the bidder tag

And the changed label of the bidder is sent to the agent terminal. For example the transmission time of the bid document is 1 month and 3 days 2020,

. The agent end receives the bid document of the user end and adds the receiving time as the label of the bidder

The modified bidder tag is transmitted to the supervising end. For example, the bid document is received at 1 month 25 days 2020,

. The supervising end matches the corresponding identity field

Thereafter, the corresponding bidder label is modified

。

Wherein

The method is as follows.

The invention also discloses a bidding method, which mainly comprises a registration stage, a bidding application stage, a qualification prequalification stage and a bidding stage. Referring to fig. 3, since the user side, the agent side, the monitoring side and the bid server are independent hardware devices, the file receiving, file distribution and process monitoring are completed by independent devices, thereby avoiding possible fraud caused by a single device managing the bid service. The bidding server is a wide area network server, can effectively utilize the bandwidth of the wide area network, improves the file distribution speed and is convenient for sending out text and timing. In the registration stage, a virtual bidding server is set up, and the user side is connected with the agent side and the bidding server. The plurality of user hosts submit to the agent end to register as identified user ends, and the user ends have the authority of submitting data to the agent end. And setting a virtual bidding server according to the bidding requirement, wherein the bidding server has the authority of sending data to the registered user side, and storing qualification pre-examination data and bidding data in the bidding server.

In the application phase, a specific user terminal applies a certain bid item to the agent terminal, and the application phase is ended by the user terminal receiving the qualification prequalification document. After the bidding work is started, the user side submits the bidding application data containing the user identification to the agent side. The typical bid application data is electronic data and contains electronic bidder information. And the agent end stores the bid application data and audits the bid application data according to the preset requirement. And after the verification is successful, the agent end sends the bidder label containing the user identifier to the monitoring end. And the monitoring end sends the bidder tags to the bidding server, the bidding server sends qualification pre-examination data to the corresponding user side, and meanwhile, the updated bidder tags are fed back to the agent side.

In the pre-review stage, a specific user terminal submits a pre-review application document to the agent terminal, and the stage is ended by the user terminal receiving a bid document. The user side submits pre-review application data containing user identification to the agent side, the capacity of the pre-review application data is large, and the pre-review application data generally comprises a plurality of document scanning pieces, such as business licenses, identification certificates and the like, but does not contain an applicant information table of txt or word files. And the agent end stores the pre-review application data and sends the updated bidder label to the supervisor end. And the supervision terminal defines the next field of the label of the bidder and then sends the next field to the bidding server. And the bidding server sends bidding data to the corresponding user side and feeds the updated bidder label back to the agent side.

In the bidding phase, the user end submits the bidding document to the agent end, and the period ends when one of the user ends receives the winning bid notification document. And submitting the bidding data containing the user identification to the agent terminal by the user terminal, wherein the attribute of the bidding data is similar to that of the pre-review application file. And the agent end stores the bidding data and sends the updated bidder label to the supervisor end. And the supervision terminal stores the bidder label after defining the next field of the bidder label. And the agent end sends the bidding application data, the pre-review application data and the bidding data to the bid evaluation end. The bid evaluation terminal may be regarded as a hardware device, such as a computer, corresponding to the bid evaluation stage. After receiving the pre-review files and the bid files of all the bidders at the bid evaluation terminal, the bid evaluation committee develops bid evaluation according to a predetermined bid evaluation standard. And inputting the bid evaluation result into a bid evaluation terminal. The bid evaluation criteria are determined by each bidding item and will not be described in detail herein. The bid evaluation end submits the user identification of the winning bid user end, such as the user end code or the bidder label containing the user end code, to the supervision end. The monitoring end checks the bidder label corresponding to the user identification, the checking method checks some fields of the bidder label generated by the agent end and the bidding server, and if the fields do not accord with the checking rule, the data transmission process is considered to be modified, and the successful bidding is not approved. If the verification passes, the verification is regarded as successful winning approval. After approval, the supervision terminal sends the bidder label to the bidding server, and the bidding server generates a bid-closing notice according to the bidder label and then sends the bid-closing notice to the user terminal. Generally, the bid-winning server may set a generation rule of the bid-winning notice, such as a preset electronic bid-winning notice signature, a blank bid-winning notice, a timestamp function module, and the like, and generate a corresponding bid-winning notice after inputting the information of the bid-winning person. After the bid inviting and bidding server sends out the bid inviting and bidding notice, the bid inviting and bidding server is cancelled. On one hand, the bidding server is a remote virtual server, and after the work is finished, the cancellation server can release the memory space to reserve space for other bidding. On the other hand, the bidding server contains records of partial fields for generating the labels of the bidders, and the timely cancellation server can reduce the probability of data stealing.

Referring to fig. 1 and 2, the present invention mainly comprises a plurality of clients, an agent, a manager, and a physical server. The plurality of user terminals are used for uploading or downloading bidding data, and each user terminal has a corresponding user identifier. The agent end is used for managing a plurality of user ends and storing data uploaded by the user ends. And the supervision terminal is used for supervising the bidding state. The physical server is used for receiving the instruction of the monitoring end and sending data to the agent end and the predetermined user end.

The user side can be regarded as a computer, a mobile phone and other devices of the user of the bidder. And after predetermined software or APP is installed on the bidder equipment, applying for registration to the agent side, wherein the bidder equipment after registration forms the user side. It is contemplated that the proxy side uniquely identifies any registered user side. The data uploaded by the user side comprises the user identification. The agent is a physical device of the tenderer that may be the same or similar in hardware settings to the bidder device. The supervisor end is the physical equipment of the supervisor party, and the physical server is the remote server of the other party. The supervision terminal comprises a capacity distribution unit, an instruction distribution unit, an encryption database and a task database. The capacity allocation unit and the instruction distribution unit may be separate hardware facilities or implemented by a program that the CPU calls the memory. The encryption database and the task database are independent storage units. The encryption database is used for storing discrete functions, and the task database is used for storing the bidder labels. The instruction distribution unit is used for updating the bidder tags of the task database according to the discrete function of the encrypted database. The physical server comprises a resource distributor and a plurality of virtual bidding servers, wherein the resource distributor is at least used for managing the CPU capacity, the memory capacity and the network bandwidth of each bidding server. And the bidding server is used for storing the corresponding bidding document and the qualification prequalification document. And the bidding server sends data to the user side according to the received bidder label and sends the modified bidder label to the agent side.

The capacity allocation unit issues a CPU capacity and memory capacity allocation application to the monitor according to the entry of the bidder tag of the task database. In the present invention, the bid item may be plural. Meanwhile, for any bidding item, the number of the bidder tags corresponds to the number of bidders. For example, there are five concurrent tendered items, four of which have a bidder number of 3 and another of which have a bidder number of 8. The number of bidder tags may be 20. The status of the bidder tags may not be the same. E.g., bidder tags of

，

The tag status is identified. When in use

And is

When the tag status is "prequalified". When in use

And is

When the tag status is "bid". When in use

When the label is in the "winning bid" state.

The entries of the bidder tags contain the number of bidder tags and the tagging stage of the bidder tags. The states of the bidder tags comprise pre-examination, bidding and winning. Pre-review requires 1mb of processing capacity, bid requires 2mb of processing capacity, and bid winning requires 1mb of processing capacity. For 10 tags in the pre-review stage for a bidding item, the CPU capacity and memory capacity required by the capacity allocation unit is, for example, 10 mb. For 15 tags in the bidding phase of a bid for a bid item, the CPU capacity and memory capacity required by the capacity allocation unit is, for example, 30 mb. Note that the capacity allocation unit applies for the monitor to allocate capacity every time the bidder's tag of the task database is updated.

And the monitoring end sends the updated bidder label to the bidding server, and the bidding server performs data transmission according to the label state. Network clearing and sufficient bandwidth is particularly important since the enrollment task requires saving data (tender files, prequalification files) transmission time. Before the corresponding data is transmitted, the bidding server applies for network bandwidth to the resource distributor, and the resource distributor verifies the networks of the bidding server and the user side and distributes corresponding network bandwidth.