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 .
This is responsive to Application 18/830,912 filed 08/11/2024 in which claims 1-20 are presented for examination.
Allowable Subject Matter
Claims 4-8 and 13-17 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims.
Claim Rejections - 35 USC § 102
The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action:
A person shall be entitled to a patent unless –
(a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention.
Claims 1-3, 10-12, 19 and 20 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Mohan et al (US 2020/0153701 A1).
Regarding claim 1, Mohan teaches a method implemented by a first computer device, wherein the method comprises:
determining first sending queue lengths of N links, wherein N is a positive integer greater than or equal to 2, sending, to a second computer device and over the N links, first data (Mohan: Fig. 2; [0038], sending probe packets of various sizes or each WAN link or a plurality of WAN links);
determining, based on the first data, historical statistical information (Mohan: Fig. 2; [0038], keeping up-to-date records/historical of the metrics for the various WAN links);
determining, based on the historical statistical information and the first sending queue lengths, N first predicted values to respectively predict first link qualities of the N links (Mohan: Fig. 2; [0035], [0038]-[0039] predicting metrics for WAN links based on packet sizes and the probing);
determining, from the N links and based on the N first predicted values, a first target link; and sending, to the second computer device and over the first target link, second data that is a part of a target data stream (Mohan: Fig. 2; [0038], selecting the best WAN link).
Regarding claim 10, Mohan teaches a first computer device, comprising: a memory configured to store instructions; and a processor coupled to the memory and configured to execute the instructions to:
determine first sending queue lengths of N links, wherein N is a positive integer greater than or equal to 2, send, to a second computer device and over the N links, first data (Mohan: Fig. 2; [0038], sending probe packets of various sizes or each WAN link or a plurality of WAN links);
determine, based on the first data, historical statistical information (Mohan: Fig. 2; [0038], keeping up-to-date records/historical of the metrics for the various WAN links);
determine, based on the historical statistical information and the first sending queue lengths, N first predicted values to respectively predict first link qualities of the N links (Mohan: Fig. 2; [0035], [0038]-[0039] predicting metrics for WAN links based on packet sizes and the probing);
determine, from the N links and based on the N first predicted values, a first target link; and send, to the second computer device and over the first target link, second data that is a part of a target data stream (Mohan: Fig. 2; [0038], selecting the best WAN link).
Regarding claim 19, Mohan teaches a computer program product comprising instructions that are stored on a non-transitory computer-readable storage medium and that, when executed by a processor, cause a first computer device to:
determine first sending queue lengths of N links, wherein N is a positive integer greater than or equal to 2, send, to a second computer device and over the N links, first data (Mohan: Fig. 2; [0038], sending probe packets of various sizes or each WAN link or a plurality of WAN links);
determine, based on the first data, historical statistical information (Mohan: Fig. 2; [0038], keeping up-to-date records/historical of the metrics for the various WAN links);
determine, based on the historical statistical information and the first sending queue lengths, N first predicted values to respectively predict first link qualities of the N links (Mohan: Fig. 2; [0035], [0038]-[0039] predicting metrics for WAN links based on packet sizes and the probing);
determine, from the N links and based on the N first predicted values, a first target link; and send, to the second computer device and over the first target link, second data that is a part of a target data stream (Mohan: Fig. 2; [0038], selecting the best WAN link).
Regarding claims 2, 11 and 20, Mohan teaches wherein the historical statistical information comprises at least one of: a first mapping relationship between a second sending queue length and a second link quality; or a first throughput at which the first computer device sends third data over the N links (Mohan: Fig. 2; [0038]-[0039], mapping between probe packets size and WAN links metric).
Regarding claims 3 and 12, Mohan teaches wherein determining the first target link comprises determining, based on the N first predicted values, a link with a best link quality in the N links as the first target link (Mohan: Fig. 2; [0038], selecting the best WAN link).
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 9 and 18 are rejected under 35 U.S.C. 103 as being unpatentable over Mohan et al (US 2020/0153701 A1) in view of Kim et al (US 2024/0422613 A1).
Regarding claims 9 and 18, Mohan does not explicitly disclose wherein the N links comprise at least two of a 2.4 gigahertz (GHz) frequency band wireless link, a 5 GHz frequency band wireless link, a 5 GHz low-frequency wireless link, a 5 GHz high-frequency wireless link, a wired link, an optical fiber, or a power line communication (PLC) link.
Kim teaches wherein the N links comprise at least two of a 2.4 gigahertz (GHz) frequency band wireless link, a 5 GHz frequency band wireless link, a 5 GHz low-frequency wireless link, a 5 GHz high-frequency wireless link, a wired link, an optical fiber, or a power line communication (PLC) link (Kim: Fig. 9; [0166]-[0169]).
It would have been obvious to a person having an ordinary skill in the art before the effective filling date of the claimed invention to modify the system of Mohan wherein the N links comprise at least two of a 2.4 gigahertz (GHz) frequency band wireless link, a 5 GHz frequency band wireless link, a 5 GHz low-frequency wireless link, a 5 GHz high-frequency wireless link, a wired link, an optical fiber, or a power line communication (PLC) link as disclosed by to provide a system for multilink communication (Kim: Abstract).
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to KODZOVI ACOLATSE whose telephone number is (571)270-1999. The examiner can normally be reached Monday to Friday 10 am to 6pm.
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, Avellino Joseph can be reached at (571) 272-3905. 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.
/KODZOVI ACOLATSE/Primary Examiner, Art Unit 2478
