CN107153987A - A kind of price competing method and system for avoiding the time difference - Google Patents
A kind of price competing method and system for avoiding the time difference Download PDFInfo
- Publication number
- CN107153987A CN107153987A CN201710333509.1A CN201710333509A CN107153987A CN 107153987 A CN107153987 A CN 107153987A CN 201710333509 A CN201710333509 A CN 201710333509A CN 107153987 A CN107153987 A CN 107153987A
- Authority
- CN
- China
- Prior art keywords
- time
- client
- service end
- competitive bidding
- sent
- 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
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/0601—Electronic shopping [e-shopping]
- G06Q30/0611—Request for offers or quotes
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/02—Details
- H04J3/06—Synchronising arrangements
- H04J3/0635—Clock or time synchronisation in a network
- H04J3/0638—Clock or time synchronisation among nodes; Internode synchronisation
- H04J3/0658—Clock or time synchronisation among packet nodes
- H04J3/0661—Clock or time synchronisation among packet nodes using timestamps
- H04J3/0667—Bidirectional timestamps, e.g. NTP or PTP for compensation of clock drift and for compensation of propagation delays
-
- 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/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0273—Determination of fees for advertising
- G06Q30/0275—Auctions
Abstract
The invention discloses a kind of price competing method and system for avoiding the time difference, to solve existing Ask-Bid System have the time difference and it is unfair the problem of.This method includes：S1, the competitive bidding instruction time sent by the client corresponding ntp server acquisition client；S2, the competitive bidding instruction time sent to service end；S3, the competitive bidding deadline for obtaining the corresponding ntp server of the service end.In the present invention, the time that client is sent using the nearest ntp server time as instruction, service end uses the nearest ntp server time as the foundation of deadline, effectively prevent the error problem that existing Ask-Bid System is present.
Description
Technical field
The present invention relates to software systems field of bidding, more particularly to a kind of price competing method and system for avoiding the time difference.
Background technology
In software systems of bidding, if necessary to set competitive bidding deadline, the client in response to mark side is to be answered the time
What mark side was arbitrarily changed, so General System is defined by server time.But cut-off Time of Day is used as using server time
Competitive bidding system, because of network delay that respectively should be between the side of marking and server, obvious network delay or competitive bidding end it is critical when
Between in the case of, it may appear that two kinds of non-fair states：
The first, because delay, client sees that the time that service end is sent is neighbouring deadline (not ending), but takes
The business device real time but have passed through deadline.
Second, client sends instruction of bidding, but because delay, instruction of the bidding service of having arrived before service deadline
Deadline has been have passed through when end.
Above-mentioned two situations may all cause optimal bid should the side of marking can not get the bid, contentious competitive bidding at least occurs
Instruction.
In a network environment, because of network delay, when the competitive bidding instruction that client is sent reaches server, there will necessarily be the time
Difference.Time difference can cause the instruction ignore of bidding of client in neighbouring competitive bidding deadline.
Publication No. CN103632282A patent provide a kind of advertisement real-time bidding system, it is characterised in that including with
Under several steps：User cookie acquisition；Gained cookie data is subjected to various computings, enables abstract user with specific
Feature show；Real time bid system sends the feature of user to the multidigit advertisement of website within 20 milliseconds of time
Business；The data that advertiser is transmitted using system participate in bidding for location advertising as reference within 30 milliseconds of time.The user
Cookie acquisition includes two methods, and one is that, by site owner, two be by the company with a large amount of cookie databases.
This method can cause the time of bidding and deadline time of occurrence difference and cause unfairness.
The content of the invention
The technical problem to be solved in the present invention purpose is to provide a kind of price competing method and system for avoiding the time difference, is used to
Solve existing Ask-Bid System have a time difference and it is unfair the problem of.
To achieve these goals, the technical solution adopted by the present invention is：
A kind of price competing method for avoiding the time difference, including step：
S1, the competitive bidding instruction time sent by the client corresponding ntp server acquisition client；
S2, the competitive bidding instruction time sent to service end；
S3, the competitive bidding deadline by the service end corresponding ntp server acquisition service end.
Further, in addition to step：
S4, by the service end judge whether the competitive bidding instruction time that the client is sent exceedes the service end
Competitive bidding deadline, if so, not receiving the competitive bidding instruction that the client is sent；Otherwise, the optimal bid information of competitive bidding is calculated extremely
Client.
Further, step S1 is specifically included：
Receive the acquisition time request that the client is sent；
Return to the time that ntp server is sent；
Time difference most short ntp server is connected with the client.
Further, step S3 is specifically included：
Receive the acquisition time request that the service end is sent；
Return to the time that ntp server is sent；
Time difference most short ntp server is connected with the service end.
Further, the corresponding ntp server of the client and the corresponding ntp server of the service end are to each request
The time error of node is respectively less than one second.
A kind of Ask-Bid System for avoiding the time difference, including：
First acquisition module, the competitive bidding for obtaining the client transmission by the corresponding ntp server of client refers to
Make the time；
Sending module, for the competitive bidding instruction time to be sent to service end；
Second acquisition module, the competitive bidding for obtaining the service end by the corresponding ntp server of the service end is cut
Only time.
Further, in addition to step：
Judge module, for judging whether the competitive bidding instruction time that the client is sent exceedes institute by the service end
The competitive bidding deadline of service end is stated, if so, not receiving the competitive bidding instruction that the client is sent；Otherwise, competitive bidding is calculated optimal
Bid information is to client.
Further, first acquisition module includes：
First receiving unit, for receiving the acquisition time request that the client is sent；
First returning unit, for returning to the time that ntp server is sent；
First connection unit, for time difference most short ntp server to be connected with the client.
Further, second acquisition module includes：
Second receiving unit, for receiving the acquisition time request that the service end is sent；
Second returning unit, for returning to the time that ntp server is sent；
Second connection unit, for time difference most short ntp server to be connected with the service end.
Further, in first acquisition module and the second acquisition module, the corresponding ntp server of client and described
The time error of service end corresponding ntp server to each requesting node is respectively less than one second.
It is of the invention compared with traditional technology, have the following advantages：
In the present invention, the time that client is sent using the nearest ntp server time as instruction, service end is using most
The near ntp server time, as the foundation of deadline, effectively prevent the error problem that existing Ask-Bid System is present.
Brief description of the drawings
Fig. 1 is a kind of price competing method flow chart for avoiding the time difference that embodiment one is provided；
Fig. 2 is a kind of price competing method flow chart for avoiding the time difference that embodiment two is provided；
Fig. 3 is a kind of price competing method flow chart for avoiding the time difference that embodiment three is provided；
Fig. 4 is a kind of price competing method flow chart for avoiding the time difference that example IV is provided；
Fig. 5 is a kind of Ask-Bid System structure chart for avoiding the time difference that embodiment one is provided；
Fig. 6 is a kind of Ask-Bid System structure chart for avoiding the time difference that embodiment two, three, four is provided.
Embodiment
The following is specific embodiment of the invention and with reference to accompanying drawing, technical scheme is further described,
But the present invention is not limited to these embodiments.
Embodiment one
A kind of price competing method for avoiding the time difference is present embodiments provided, as shown in figure 1, including step：
S11：The competitive bidding instruction time that client is sent is obtained by the corresponding ntp server of client；
S12：The competitive bidding instruction time is sent to service end；
S13：The competitive bidding deadline of service end is obtained by the corresponding ntp server of service end.
Bid under referring to organize in trade market, buyer or the seller, can by trade market stock trade at competitive price system
The information such as the underlying attributes such as brand, the specification of supply and demand commodity and drop-off location, time of delivery, quantity, reserve price externally issues offer,
By qualified analogue independently price markup or price reduction, according to the principle of " price priority ", at the appointed time with best bid
Or minimum selling price is struck a bargain and signs electronics purchase order by trade market, and the counterparty of physical delivery is carried out by contract engagement
Formula.
With the development of science and technology, more convenient and swift by way of network bid.
But under current network environment, it is inevitable when instruction that what client was sent bid reaches server because of network delay
The time difference is had, the time difference can cause bidding for client invalid, non-fair situation occurs in neighbouring competitive bidding deadline.
In software systems of bidding, if necessary to set competitive bidding deadline, currently existing scheme may all be led because of the time difference
Cause controversial instruction of bidding.The present invention can effectively judge controversial instruction of bidding, while making bidding process strictly be limited in
In stipulated time.
In the present invention, the time that client is sent using the nearest ntp server time as instruction, service end is using most
The near ntp server time, as the foundation of deadline, effectively prevent the above-mentioned two error that existing Ask-Bid System is present
Phenomenon.
Wherein, NTP refers to NTP, and it is the agreement of the time of each computer in synchronizing network.NTP
Purposes be that the clock of computer is synchronized to UTC Universal Time Coordinated UTC, its precision in LAN up to 0.1ms, in internet
Its upper most of local precision can reach 1-50ms.
In the present embodiment, step S11 is to obtain the competitive bidding instruction that client is sent by the corresponding ntp server of client
Time.
Wherein, the corresponding ntp server of client refers to client time delay most short ntp server nearby.
The ntp server being connected with client obtains the competitive bidding instruction time that client is sent.The time is sent out for client
The NTP times for the competitive bidding instruction sent.
In the present embodiment, step S12 is to send the competitive bidding instruction time to service end.
The corresponding ntp server of client was got after the NTP times of competitive bidding instruction, and the transmission competitive bidding of client is instructed
The NTP times send to service end.
Specifically, when client sends competitive bidding instruction, client elder generation's acquisition request NTP times, being used in client
Family click on send competitive bidding instruction button postpone 1 second after, ntp server by competitive bidding instruct the UNICOM NTP times, send together to
Service end.
Service end, which receives the competitive bidding instruction of client transmission and sends competitive bidding, instructs the corresponding NTP times.
In the present embodiment, step S13 is the competitive bidding that the service end is obtained by the corresponding ntp server of the service end
Deadline.
Wherein, the corresponding ntp server of service end refers to service end time delay most short ntp server nearby.
The ntp server being connected with service end obtains the competitive bidding deadline of service end.The time cuts for service end competitive bidding
The NTP times only.
The corresponding ntp server of service end gets the NTP times of competitive bidding cut-off.
Specifically, service end ceaselessly obtains the ntp server time near service end, and by corresponding ntp server
Time is used as traffic handling time.
In the present embodiment, the corresponding ntp server of client and the corresponding ntp server of service end to each requesting node
Error is respectively less than one second.
Specifically, in whole bidding process, client and service end are made using oneself nearest ntp server time
For traffic handling time.
The ntp server time to each requesting node time error in millisecond rank.In the concept of time, less than one
The time difference of second can be regarded as almost consistent.Time relative atom clock or UTC that so whether client or service end are obtained
Time error is almost the same.
The method that the present embodiment is provided effectively prevent the error phenomenon that existing Ask-Bid System is present.
The present embodiment additionally provides a kind of Ask-Bid System for avoiding the time difference, as shown in figure 5, including：
First acquisition module 51, for obtaining the competitive bidding instruction that client is sent by the corresponding ntp server of client
Time；
Sending module 52, for the competitive bidding instruction time to be sent to service end；
Second acquisition module 53, the competitive bidding deadline for obtaining service end by the corresponding ntp server of service end.
In the present embodiment, in the first acquisition module 51 and the second acquisition module 53, the corresponding ntp server of client and clothes
The time error of business end corresponding ntp server to each requesting node is respectively less than one second.
Specifically, client and service end use oneself nearest ntp server time as traffic handling time.
Because the ntp server time to each requesting node time error in millisecond rank.It is small in the concept of time
It can regard as in the time difference of one second almost consistent.Time relative atom clock that so whether client or service end are obtained or
UTC time error is almost the same.
In the present embodiment, the first acquisition module 51 is used to obtain client transmission by the corresponding ntp server of client
The competitive bidding instruction time.
Wherein, the corresponding ntp server of client refers to client time delay most short ntp server nearby.
The ntp server being connected with client obtains the competitive bidding instruction time that client is sent.The time is sent out for client
The NTP times for the competitive bidding instruction sent.
In the present embodiment, sending module 52 is used to send the competitive bidding instruction time to service end；
The corresponding ntp server of client was got after the NTP times of competitive bidding instruction, and the transmission competitive bidding of client is instructed
The NTP times send to service end.
Service end, which receives the competitive bidding instruction of client transmission and sends competitive bidding, instructs the corresponding NTP times.
In the present embodiment, the second acquisition module 53 is used to obtain the clothes by the corresponding ntp server of the service end
The competitive bidding deadline at business end.
Wherein, the corresponding ntp server of service end refers to service end time delay most short ntp server nearby.
The corresponding ntp server of service end gets the NTP times of competitive bidding cut-off.
Because the time difference between ntp server is almost consistent, therefore it effectively prevent the mistake that existing Ask-Bid System is present
Poor phenomenon.
Embodiment two
A kind of price competing method for avoiding the time difference is present embodiments provided, as shown in Fig. 2 including step：
S21：The competitive bidding instruction time that client is sent is obtained by the corresponding ntp server of client；
S22：The competitive bidding instruction time is sent to service end；
S23：The competitive bidding deadline of service end is obtained by the corresponding ntp server of service end.
S24：When judging whether the competitive bidding instruction time that client is sent exceedes the competitive bidding cut-off of service end by service end
Between, if so, not receiving the competitive bidding instruction of client transmission；Otherwise, the optimal bid information of competitive bidding is calculated to client.
The present embodiment is with the difference of embodiment one, in addition to step S24.
Service end obtains the NTP times for the competitive bidding instruction that client is sent, and service end is made with the ntp server connected
For the NTP times of competitive bidding deadline, i.e. competitive bidding cut-off.
Specifically, service end receive respectively should the side of marking competitive bidding instruction, first determine whether that competitive bidding instructs the subsidiary client NTP times
Whether competitive bidding deadline is exceeded.The competitive bidding deadline is defined by the neighbouring ntp server time that server is got.
If the NTP times of competitive bidding instruction exceed the NTP times that competitive bidding ends, competitive bidding instruction is not received.
If the NTP times of competitive bidding instruction, not less than the NTP times that competitive bidding ends, calculate optimal bid information to each visitor
Family end.
Wherein, optimal bid information includes：The price of optimal bid, the offerer's name or enterprise name of optimal bid,
Server was received most with the NTP times of the client of back up bid.
Select optimal bid in client of the competitive bidding instruction time not less than competitive bidding deadline should the side of marking.Avoid
Inequitable situation caused by the time difference.
Time relative atom clock or UTC that each ntp server time difference obtains in millisecond rank, i.e. client or service end
Time error is almost the same.This method effectively prevent the error phenomenon that existing price competing method is present.
The present embodiment additionally provides a kind of Ask-Bid System for avoiding the time difference, as shown in fig. 6, including：
First acquisition module 61, for obtaining the competitive bidding instruction that client is sent by the corresponding ntp server of client
Time；
Sending module 62, for the competitive bidding instruction time to be sent to service end；
Second acquisition module 63, the competitive bidding deadline for obtaining service end by the corresponding ntp server of service end；
Judge module 64, for judging whether the competitive bidding instruction time that client is sent exceedes service end by service end
Competitive bidding deadline, if so, not receiving the competitive bidding instruction of client transmission；Otherwise, the optimal bid information of competitive bidding is calculated to client
End.
It is with the difference of embodiment one, the present embodiment also includes judge module 64.
Specifically, service end receive respectively should the side of marking competitive bidding instruction, first determine whether that competitive bidding instructs the subsidiary client NTP times
Whether competitive bidding deadline is exceeded.The competitive bidding deadline is defined by the neighbouring ntp server time that server is got.
If the NTP times of competitive bidding instruction exceed the NTP times that competitive bidding ends, competitive bidding instruction is not received.
If the NTP times of competitive bidding instruction, not less than the NTP times that competitive bidding ends, calculate optimal bid information to each visitor
Family end.
Wherein, optimal bid information includes：The price of optimal bid, the offerer's name or enterprise name of optimal bid,
Server was received most with the NTP times of the client of back up bid.
The system effectively prevent the error phenomenon that existing price competing method is present.
Embodiment three
A kind of price competing method for avoiding the time difference is present embodiments provided, as shown in figure 3, including step：
S31：Receive the acquisition time request that client is sent；
S32：Return to the time that ntp server is sent；
S33：Time difference most short ntp server is connected with client；
S34：The competitive bidding instruction time that client is sent is obtained by the corresponding ntp server of client；
S35：The competitive bidding instruction time is sent to service end；
S36：The competitive bidding deadline of service end is obtained by the corresponding ntp server of service end；
S37：Whether the time for judging the competitive bidding instruction that client is sent by service end exceedes the competitive bidding cut-off of service end
Time, if so, not receiving the competitive bidding instruction of client transmission；Otherwise, the optimal bid information of competitive bidding is calculated to client.
The present embodiment is that step S11 or step S21 specifically include step S31 with embodiment one, two differences, step
Rapid S32, step S33 and step S34.
Specifically, before competitive bidding, after User logs in client, service end pushes neighbouring NTP according to client ip address
Server ip address list is to client.
Client is according to the IP address list of service end, and repeatedly sending the acquisition time simultaneously asks to each ntp server, so
The time sent afterwards according to the ntp server of return, the minimum ntp server of selection delay.
When client sends competitive bidding instruction, client elder generation's acquisition request NTP times, clicked in client user and send competing
After marking the button of instruction and postponing one second, client instructs competitive bidding together with the NTP times, together sends to server.
The minimum ntp server of client connection time of return difference, NTP time of the competitive bidding instruction time sent to connect
It is defined.
The present embodiment additionally provides a kind of Ask-Bid System for avoiding the time difference, as shown in fig. 6, including：
First acquisition module 61, for obtaining the competitive bidding instruction that client is sent by the corresponding ntp server of client
Time；
Sending module 62, for the competitive bidding instruction time to be sent to service end；
Second acquisition module 63, the competitive bidding deadline for obtaining service end by the corresponding ntp server of service end；
Judge module 64, for judging whether the competitive bidding instruction time that client is sent exceedes service end by service end
Competitive bidding deadline, if so, not receiving the competitive bidding instruction of client transmission；Otherwise, the optimal bid information of competitive bidding is calculated to client
End.
It is with embodiment one, two differences, in the present embodiment, the first acquisition module 61 includes：
First receiving unit, the acquisition time request for receiving client transmission；
First returning unit, for returning to the time that ntp server is sent；
First connection unit, for time difference most short ntp server to be connected with client.
Specifically, IP address list of the client according to service end, repeatedly the transmission acquisition time asks to each NTP to take simultaneously
Business device, the time then sent according to the ntp server of return, the minimum ntp server of selection delay.Send competitive bidding instruction
Afterwards, client instructs competitive bidding together with the NTP times, together sends to server.
Example IV
A kind of price competing method for avoiding the time difference is present embodiments provided, as shown in figure 4, including step：
S41：The competitive bidding instruction time that client is sent is obtained by the corresponding ntp server of client；
S42：The competitive bidding instruction time is sent to service end；
S43：The acquisition time request that the reception server is sent；
S44：Return to the time that ntp server is sent；
S45：Time difference most short ntp server is connected with service end；
S46：The competitive bidding deadline of service end is obtained by the corresponding ntp server of service end.
S47：When judging whether the competitive bidding instruction time that client is sent exceedes the competitive bidding cut-off of service end by service end
Between, if so, not receiving the competitive bidding instruction of client transmission；Otherwise, the optimal bid information of competitive bidding is calculated to client.
Be with the difference of embodiment one, two, three, step S13 specifically includes step S43, step S44, step S45 and
Step S46.
Specifically, service end does not stop to obtain the ntp server time near service end, during by the ntp server got
Between be used as traffic handling time.
Service end connection nearby postpones minimum ntp server, and the ntp server time of connection is ended as competitive bidding
NTP times, then the NTP times of the instruction of bidding sent with client compare.
Because the time difference of ntp server was less than one second, almost unanimously.It effectively prevent the mistake that existing price competing method is present
Poor problem.
The present embodiment additionally provides a kind of Ask-Bid System for avoiding the time difference, includes as shown in Figure 6：
First acquisition module 61, for obtaining the competitive bidding instruction that client is sent by the corresponding ntp server of client
Time；
Sending module 62, for the competitive bidding instruction time to be sent to service end；
Second acquisition module 63, the competitive bidding deadline for obtaining service end by the corresponding ntp server of service end；
Judge module 64, for judging whether the competitive bidding instruction time that client is sent exceedes service end by service end
Competitive bidding deadline, if so, not receiving the competitive bidding instruction of client transmission；Otherwise, the optimal bid information of competitive bidding is calculated to client
End.
It is with embodiment one, two differences, in the present embodiment, the second acquisition module 62 includes：
Second receiving unit, the acquisition time request for receiving service end transmission；
Second returning unit, for returning to the time that ntp server is sent；
3rd connection unit, for time difference most short ntp server to be connected with service end.
Specifically, service end ceaselessly obtains the time of the ntp server near service end, the NTP got is serviced
The device time is used as competitive bidding deadline.
In whole bidding process, client and service end use oneself nearest ntp server time as business
Processing time.Error is almost consistent between ntp server, therefore, and the system of the present embodiment effectively prevent existing Ask-Bid System
The error phenomenon of presence.
Specific embodiment described herein is only to spirit explanation for example of the invention.Technology neck belonging to of the invention
The technical staff in domain can be made various modifications or supplement to described specific embodiment or be replaced using similar mode
Generation, but without departing from the spiritual of the present invention or surmount scope defined in appended claims.
Claims (10)
1. a kind of price competing method for avoiding the time difference, it is characterised in that including step：
S1, the competitive bidding instruction time sent by the client corresponding ntp server acquisition client；
S2, the competitive bidding instruction time sent to service end；
S3, the competitive bidding deadline by the service end corresponding ntp server acquisition service end.
2. a kind of price competing method for avoiding the time difference according to claim 1, it is characterised in that also including step：
S4, judge by the service end whether competitive bidding instruction time that the client is sent exceedes the competitive bidding of the service end
Deadline, if so, not receiving the competitive bidding instruction that the client is sent；Otherwise, the optimal bid information of competitive bidding is calculated to client
End.
3. a kind of price competing method for avoiding the time difference according to claim 1, it is characterised in that step S1 is specifically included：
Receive the acquisition time request that the client is sent；
Return to the time that ntp server is sent；
Time difference most short ntp server is connected with the client.
4. a kind of price competing method for avoiding the time difference according to claim 1, it is characterised in that step S3 is specifically included：
Receive the acquisition time request that the service end is sent；
Return to the time that ntp server is sent；
Time difference most short ntp server is connected with the service end.
5. a kind of price competing method for avoiding the time difference according to claim 1, it is characterised in that the client is corresponding
The time error of ntp server and the service end corresponding ntp server to each requesting node is respectively less than one second.
6. a kind of Ask-Bid System for avoiding the time difference, it is characterised in that including：
First acquisition module, during for obtaining the competitive bidding instruction that the client is sent by the corresponding ntp server of client
Between；
Sending module, for the competitive bidding instruction time to be sent to service end；
Second acquisition module, when the competitive bidding for obtaining the service end by the corresponding ntp server of the service end ends
Between.
7. a kind of Ask-Bid System for avoiding the time difference according to claim 6, it is characterised in that also including step：
Judge module, for judging whether the competitive bidding instruction time that the client is sent exceedes the clothes by the service end
The competitive bidding deadline at business end, if so, not receiving the competitive bidding instruction that the client is sent；Otherwise, the optimal bid of competitive bidding is calculated
Information is to client.
8. a kind of Ask-Bid System for avoiding the time difference according to claim 6, it is characterised in that first acquisition module
Including：
First receiving unit, for receiving the acquisition time request that the client is sent；
First returning unit, for returning to the time that ntp server is sent；
First connection unit, for time difference most short ntp server to be connected with the client.
9. a kind of Ask-Bid System for avoiding the time difference according to claim 6, it is characterised in that second acquisition module
Including：
Second receiving unit, for receiving the acquisition time request that the service end is sent；
Second returning unit, for returning to the time that ntp server is sent；
Second connection unit, for time difference most short ntp server to be connected with the service end.
10. a kind of Ask-Bid System for avoiding the time difference according to claim 6, it is characterised in that described first obtains mould
In block and the second acquisition module, the corresponding ntp server of client and the corresponding ntp server of the service end are saved to each request
The time error of point is respectively less than one second.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710333509.1A CN107153987A (en) | 2017-05-12 | 2017-05-12 | A kind of price competing method and system for avoiding the time difference |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710333509.1A CN107153987A (en) | 2017-05-12 | 2017-05-12 | A kind of price competing method and system for avoiding the time difference |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107153987A true CN107153987A (en) | 2017-09-12 |
Family
ID=59794027
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710333509.1A Pending CN107153987A (en) | 2017-05-12 | 2017-05-12 | A kind of price competing method and system for avoiding the time difference |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107153987A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1279795A (en) * | 1997-11-26 | 2001-01-10 | 泰勒信托公司 | System and method for implementing an auction on computer network |
| CN1855915A (en) * | 2005-04-20 | 2006-11-01 | 华为技术有限公司 | Method for obtaining immediate system lime in worldwide interactive microwave access apparatus |
| CN102215224A (en) * | 2011-05-20 | 2011-10-12 | 深圳市金槌拍卖行有限公司 | Network countdown accurate-synchronization technology |
| CN106685755A (en) * | 2016-12-12 | 2017-05-17 | 上海斐讯数据通信技术有限公司 | Online bidding control method, online bidding control system and online bidding platform |
-
2017
- 2017-05-12 CN CN201710333509.1A patent/CN107153987A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1279795A (en) * | 1997-11-26 | 2001-01-10 | 泰勒信托公司 | System and method for implementing an auction on computer network |
| CN1855915A (en) * | 2005-04-20 | 2006-11-01 | 华为技术有限公司 | Method for obtaining immediate system lime in worldwide interactive microwave access apparatus |
| CN102215224A (en) * | 2011-05-20 | 2011-10-12 | 深圳市金槌拍卖行有限公司 | Network countdown accurate-synchronization technology |
| CN106685755A (en) * | 2016-12-12 | 2017-05-17 | 上海斐讯数据通信技术有限公司 | Online bidding control method, online bidding control system and online bidding platform |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101223544A (en) | Universal advertisement services architecture | |
| CN105210094A (en) | Indentifying users for advertising opportunities based on paired identifiers | |
| US20020087456A1 (en) | Method, apparatus, and system for synchronizing timing of an auction throug a computer network | |
| US20090299852A1 (en) | Contents distributing system, device for processing charge for advertisement information, contents distributing server, their program, and program recording medium | |
| US20090018907A1 (en) | Managing impression defaults | |
| JP2012503823A5 (en) | ||
| WO2008097811A3 (en) | Methods and systems for sharing season tickets with multiple owners and managing season tickets over a communication network | |
| US20120005024A1 (en) | Methods for selecting and displaying advertising links | |
| KR20090003049A (en) | Active call service system and method for providing real time product information | |
| CN107657427A (en) | One kind is based on the part-time post commending system of data acquisition | |
| US20140052515A1 (en) | Method and Apparatus for Anonymous Referred User Discount Process | |
| JP2014146274A5 (en) | ||
| JP2014146274A (en) | Advertisement distribution method, advertisement server, advertisement distribution system and program | |
| US10528986B2 (en) | Modifying bid price for online advertising auction based on user impression frequency | |
| US20020065761A1 (en) | Subscriber notification criteria for electronic auctions | |
| US8380608B2 (en) | System and method for creating a spot market | |
| US20140136317A1 (en) | Advertisement information providing device and advertisement information providing method | |
| CN107153987A (en) | A kind of price competing method and system for avoiding the time difference | |
| CN104598564A (en) | Method for pushing user demands in real-time knowledge transaction system | |
| CN108022115A (en) | Information processing method, device and equipment | |
| US20160379275A1 (en) | System and method for buying advertising inventory | |
| CN110796517A (en) | Online house purchasing platform | |
| US20060059006A1 (en) | System method and article of manufacture for internet based affiliate pooling | |
| JP2011237892A (en) | Advertisement device and advertisement system | |
| JP2007114954A (en) | Affiliate advertisement management system, affiliate advertisement management program and program storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 201616 Shanghai city Songjiang District Sixian Road No. 3666 Applicant after: Shanghai Feixun Data Communication Technology Co., Ltd. Address before: 201616 Shanghai city Songjiang District Songjiang District Road No. 3666 Applicant before: Shanghai Feixun Data Communication Technology Co., Ltd. |
|
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170912 |