Prosecution Insights
Last updated: April 17, 2026
Application No. 18/852,403

METHOD AND SYSTEM FOR CONSTRUCTING CLOSED PEER-TO-PEER NETWORK FOR DIGITAL SIGNAGE

Non-Final OA §103§112
Filed
Sep 27, 2024
Examiner
SURVILLO, OLEG
Art Unit
2457
Tech Center
2400 — Computer Networks
Assignee
unknown
OA Round
1 (Non-Final)
72%
Grant Probability
Favorable
1-2
OA Rounds
4y 0m
To Grant
99%
With Interview

Examiner Intelligence

Grants 72% — above average
72%
Career Allow Rate
405 granted / 561 resolved
+14.2% vs TC avg
Strong +28% interview lift
Without
With
+28.0%
Interview Lift
resolved cases with interview
Typical timeline
4y 0m
Avg Prosecution
25 currently pending
Career history
586
Total Applications
across all art units

Statute-Specific Performance

§101
10.5%
-29.5% vs TC avg
§103
46.2%
+6.2% vs TC avg
§102
16.0%
-24.0% vs TC avg
§112
22.5%
-17.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 561 resolved cases

Office Action

§103 §112
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Response to Preliminary Amendment Applicant’s preliminary amendment to the specification dated 09/27/2024 has been fully considered and is entered. Claim Rejections - 35 USC § 112 The following is a quotation of 35 U.S.C. 112(b): (b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention. Claims 1-15 are rejected under 35 U.S.C. 112(b) as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor regards as the invention. As to claim 1, the claim is directed to a method of constructing a closed P2P network, as recited in the preamble. The body of the claim includes several steps, the last step being “constructing, by the operating device, the first network with the plurality of terminals”. However, neither claim 1 nor any of the dependent claims explain how the first network is actually constructed, broadly covering all known and unknown ways of constructing the network, rendering the scope of the claim indefinite. In particular, it is unclear how the steps of issuing a unique ticket, transmitting the unique ticket to the plurality of terminals, and generating a terminal list is factored into the construction of the first network. It appears the claim is missing the linkage between generating and transmitting the terminal list to the plurality of terminals and constructing the first network, such as to show what “constructing” entails. As a separate issue, it is unclear how generating and transmitting the terminal list to the plurality of terminals is related to transmitting the unique ticket. It appears that transmitting the unique ticket and transmitting the terminal list are unrelated features that are not linked in a logical combination of elements rendering the scope of the claim indefinite. Dependent claims are rejected for the same reasons. As to claim 2, it is unclear whether the language “at least one second network including one or more terminals from at least one terminal among the plurality of terminals” suggests that the at least one terminal belonging to the second network is also part of the first network since the first network includes “the plurality of terminals”. In other words, it is unclear whether “at least one terminal” is included in both the first network and the second network, rendering it unclear what a “combination” entails. As to claims 6-8, it is unclear what “releasing a combination of the first network and the at least one second network” entails. In particular, it is unclear whether “releasing” requires any action on behalf of the operating device to effectuate the release, rendering the scope of the claim indefinite. Claims 9-15 contain similar limitations and are rejected for the same reasons as the corresponding dependent claims. Claim Rejections - 35 USC § 103 The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claims 1-15 are rejected under 35 U.S.C. 103 as being unpatentable over Datta et al. (US 2005/0086288 A1) in view of Yoon et al. (US 2014/0304419 A1). As to claim 1, Datta teaches a method of constructing a closed peer-to-peer network [establishing a P2P relay network that requires authentication] (par. [0064] Fig. 1), comprising: receiving, by an operating device [server 110] (Fig. 1), a construction request signal for constructing a first network, which is a closed peer-to-peer network [peer system submits a create grid request to establish a new peer-to-peer relay network that has restricted access] (par. [0064]), using a plurality of terminals including a first terminal [establishing peer] and at least one second terminal from the first terminal [one or more joining peer systems B-J in Fig. 1] (par. [0066]); generating, by the operating device, a terminal list including all of the plurality of terminals, and transmitting the terminal list to the plurality of terminals [generating a new table for the new grid and sending confirmation to the peer including access information and rules for the grid. The server also sends the list of available grids and the addresses of the peers that have already joined the selected grid to each joining peer] (par. [0064], [0068]); and constructing, by the operating device, the first network with the plurality of terminals [facilitating new connections for joining peers and closing connections for peers that are leaving the P2P network] (par. [0072]-[0073]). While Datta teaches the server facilitating joining the grid by forcing one or more connections, Datta fails to teach issuing, by the operating device, a unique ticket according to the construction request signal and transmitting, by the operating device, the unique ticket to the plurality of terminals. Yoon is directed to a method and a system for a peer-to-peer connection utilizing a relay server (Fig. 6). In particular, Yoon teaches issuing, by the operating device [relay server 108], a unique ticket according to the construction request signal [channel generation request message INVITE] (Fig. 6); and transmitting, by the operating device, the unique ticket to the plurality of terminals [transmitting the message INVITE to each second peer 104 with whom the first peer wants to form a P2P connection] (par. [0065]). It would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to modify the method and system of Datta by issuing, by the operating device, a unique ticket according to the construction request signal; and transmitting, by the operating device, the unique ticket to the plurality of terminals, in order to allow the joining peers of Datta to join the established P2P network when the peers are located in different private networks and the joining peer cannot reach the establishing peer directly (par. [0064] in Yoon). As to claim 2, Datta teaches the method further comprising, after the constructing of the first network, receiving, by the operating device, a combination request signal for a combination with at least one second network including one or more terminals from at least one terminal among the plurality of terminals [after establishing a main grid, creating, joining, and leaving additional smaller grids where the server can facilitate creation of sub-grids, identifying participants, and adding new peers to an existing grid. Also, detecting and joining islands] (par. [0124]-[0128], [0137], [0175], Figs. 25 and 26; par. [0159]). As to claim 3, Datta teaches the method further comprising, after the receiving of the combination request signal, combining, by the operating device, the first network with the at least one second network to construct an integrated network [adding peers or creating sub-networks withing the P2P relay network and managing connection limits, rules, and members. Also, detecting and joining islands] (par. [0125]-[0128], [0175], Figs. 25 and 26; par. [0159]). As to claim 4, Datta in view of Yoon teaches that the constructing of the integrated network includes: issuing, by the operating device, a union ticket to be transmitted to all of the terminals included in the first network and the at least one second network; and transmitting, by the operating device, the union ticket to all of the terminals [the procedure of message INVITE to join new peers] (par. [0065], Fig. 6 in Yoon). As to claim 5, Datta teaches the method further comprising, after the transmitting of the union ticket, generating, by the operating device, an integrated terminal list for all of the terminals included in the integrated network, and transmitting the integrated terminal list to all of the terminals [the server sends the addresses of the peers that have already joined the selected grid, where the peers update the list with the server] (par. [0068], [0095], [0158]). As to claim 6, Datta teaches the method further comprising, after the constructing of the integrated network, checking, by the operating device, whether a condition for releasing the combination of the first network with the at least one second network is satisfied [peer is disconnected voluntary or a failure in the connection is detected] (par. [0091]); and releasing, by the operating device, the combination of the first network with the at least one second network when the condition is satisfied [server causes a peer to close one more connections resulting in corresponding disconnections] (par. [0091]). As to claim 7, Datta teaches that the checking, by the operating device, of whether the condition for releasing the combination of the first network with the at least one second network is satisfied includes confirming, by the operating device, that the condition is satisfied when a time corresponding to time information included in the union ticket has elapsed [time limit, where the peer sends an update to the server confirming any closed connections and the server updates its records] (par. [0100]). As to claim 8, Datta teaches the method further comprising, after the constructing of the integrated network, releasing the combination of the first network with the at least one second network when the operating device receives a request for integration release from any terminal belonging to the integrated network [server detects formation of islands] (par. [0145]-[0147]). As to claim 9, Datta in view of Yoon teaches a system for constructing a closed peer-to-peer network (Fig. 1 in Datta), comprising: a plurality of terminals including a first terminal and at least one second terminal [peers 105] (Fig. 1 in Datta); and an operating device [server 110 in Datta] configured to perform the functionality as discussed above with respect to claim 1. As to claims 10-15, Datta in view of Yoon teaches all the elements, as discussed above with respect to corresponding method claims 2-8. Related Prior Art Gu et al. (US 2015/0074779 A1) is directed to peer enrollment and route updating method (abstract). In particular, Gu teaches an enrollment server that receives an enrollment request of a peer and sends the peer credential carrying the peer location information to the peer so that the peer joins a peer-to-peer network according to the peer credential (par. [0019], [0029], [0067]). Therefore, teachings of Gu are related to the subject matter of the pending claims. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to OLEG SURVILLO whose telephone number is (571)272-9691. The examiner can normally be reached 9:00am - 5:00pm. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Ario Etienne can be reached at 571-272-4001. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /OLEG SURVILLO/Primary Examiner, Art Unit 2457
Read full office action

Prosecution Timeline

Sep 27, 2024
Application Filed
Jan 20, 2026
Non-Final Rejection — §103, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12591647
Device Starting System and Method
2y 5m to grant Granted Mar 31, 2026
Patent 12582871
ACTIVITY TRACKING FOR MULTIPLE USERS ON A DEVICE
2y 5m to grant Granted Mar 24, 2026
Patent 12572648
COMPUTER-IMPLEMENTED AUTOMATIC SECURITY METHODS AND SYSTEMS
2y 5m to grant Granted Mar 10, 2026
Patent 12574427
AUDIO PLAYING METHOD, APPARATUS AND NON-TRANSITORY COMPUTER-READABLE STORAGE MEDIUM
2y 5m to grant Granted Mar 10, 2026
Patent 12574430
DISTRIBUTED EXTENDED REALITY (XR) COMPUTING OPTIMIZATION AT CLIENT DEVICE IN COMMUNICATION WITH EDGE NODE
2y 5m to grant Granted Mar 10, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
72%
Grant Probability
99%
With Interview (+28.0%)
4y 0m
Median Time to Grant
Low
PTA Risk
Based on 561 resolved cases by this examiner. Grant probability derived from career allow rate.

Sign in for Full Analysis

Enter your email to receive a magic link. No password needed.

Free tier: 3 strategy analyses per month