IP Library › Granted Patent US 12,483,964
Granted Patent B2
US 12,483,964 · App. 18/093,686 · Granted Nov 25, 2025

Multipath communication and control

Inventors: Robert Jaksa (Irving, TX); Ana Lucia Pinheiro (Allen, TX)
Assignee: Comcast Cable Communications, LLC
H04W40/12
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,483,964
App. No.
18/093,686
Granted
Nov 25, 2025
Kind
B2
Abstract

Disclosed are improvements in communication methods and techniques where more than one communication path is available. The methods include determining a first throughput of the first path. The first throughput may be based on a first path of a connection, a mode selection, and analysis of a first packet configured to determine a parameter of the first path. The methods may include determining a second throughput, and the methods may further include sending a third packet comprising data of an application. The third packet may be based on the first throughput and the second throughput.

Claims (61)

1 . A method comprising:

determining a first throughput based on monitoring a first packet over a first path of a connection, the first packet configured to determine a parameter of the first path, wherein the first path comprises a mode selection and an identifier of the connection;

determining a second throughput based on monitoring a second packet over a second path of the connection, the second packet configured to determine a parameter of the second path, wherein the second path comprises the mode selection and the identifier of the connection; and

sending a third packet comprising data of an application, wherein the third packet is based on the first throughput and the second throughput.

2 . The method of claim 1 , wherein the determination of the first throughput is further according to steps comprising:

sending the first packet; and

receiving, based on a timestamp of receipt of the first packet, an indication of bits received according to the first path.

3 . The method of claim 1 , wherein the first throughput is further determined based on the first path having an accumulation of bits according to a duration satisfying a threshold.

4 . The method of claim 3 , wherein the accumulation of bits according to the duration satisfying the threshold indicates the first path is idle.

5 . The method of claim 1 , wherein the parameter of the first path is a first duration of a round trip according to the first path and the parameter of the second path is a second duration of a round trip according to the second path.

6 . The method of claim 1 , wherein the parameter of the first path is a first ratio of packets lost according to the first path and the parameter of the second path is a second ratio of packets lost according to the second path.

7 . The method of claim 1 further comprising:

initiating an identifier indicative of a transaction.

8 . The method of claim 7 , wherein the identifier indicative of the transaction is an Extended Procedure Transaction Identity (EPTI).

9 . The method of claim 7 , wherein the first throughput is determined based on the identifier indicative of the transaction and the second throughput is determined based on the identifier indicative of the transaction.

10 . The method of claim 1 , wherein a magnitude of the first throughput is greater than a magnitude of the second throughput and the sending the third packet is according to the first path.

11 . The method of claim 1 , wherein the sending the third packet is further based on the parameter of the first path and the parameter of the second path.

12 . The method of claim 11 , wherein the parameter of the first path satisfies a threshold.

13 . The method of claim 1 , further comprising: sending a policy containing a rule, wherein the sending the third packet is further based on the rule and the rule is indicative of the first throughput and the second throughput.

14 . The method of claim 1 , further comprising: receiving a policy containing a rule, wherein the sending the third packet is further based on the rule and the rule is indicative of the first throughput and the second throughput.

15 . The method of claim 1 , further comprising selecting, based on the first throughput and the second throughput, the first path or the second path.

16 . The method of claim 1 , further comprising: sending, based on a preference for the first path, a fourth packet according to the first path, wherein the fourth packet is sent before the third packet.

17 . The method of claim 16 , wherein the first path comprises a wireless access point and the preference is based on the first path comprising the wireless access point.

18 . A method comprising:

determining a first throughput based on monitoring a first packet over a first path of a connection, the first packet configured to determine a parameter of the first path, wherein the first path comprises an identifier of the connection;

determining a second throughput based on monitoring a second packet over a second path of the connection, the second packet configured to determine a parameter of the second path, wherein the second path comprises a mode selection and the identifier of the connection;

selecting the first path or the second path, wherein the first path or the second path is selected based on the first throughput and the second throughput; and

sending a third packet comprising data of an application, wherein the third packet is based on the first throughput and the second throughput.

19 . The method of claim 18 , wherein the determination of the first throughput is further according to steps comprising:

sending the first packet; and

receiving, based on a timestamp of receipt of the first packet, an indication of bits received according to the first path.

20 . The method of claim 18 , wherein the first throughput is further determined based on the first path having an accumulation of bits according to a duration satisfying a threshold.

21 . The method of claim 20 , wherein the accumulation of bits according to the duration satisfying the threshold indicates the first path is idle.

22 . The method of claim 18 , wherein the parameter of the first path is a first duration of a round trip according to the first path and the parameter of the second path is a second duration of a round trip according to the second path.

23 . The method of claim 18 , wherein the parameter of the first path is a first ratio of packets lost according to the first path and the parameter of the second path is a second ratio of packets lost according to the second path.

24 . The method of claim 18 further comprising:

initiating an identifier indicative of a transaction.

25 . The method of claim 24 , wherein the identifier indicative of the transaction is an Extended Procedure Transaction Identity (EPTI).

26 . The method of claim 24 , wherein the first throughput is determined based on the identifier indicative of the transaction and the second throughput is determined based on the identifier indicative of the transaction.

27 . The method of claim 18 , wherein a magnitude of the first throughput is greater than a magnitude of the second throughput and the sending the third packet is according to the first path.

28 . The method of claim 18 , wherein the sending the third packet is further based on the parameter of the first path and the parameter of the second path.

29 . The method of claim 28 , wherein the parameter of the first path satisfies a threshold.

30 . The method of claim 18 , further comprising: sending a policy containing a rule, wherein the sending the third packet is further based on the rule and the rule is indicative of the first throughput and the second throughput.

31 . The method of claim 18 , further comprising: sending, based on a preference for the first path, a fourth packet according to the first path, wherein the fourth packet is sent before the third packet.

32 . The method of claim 31 , wherein the first path comprises a wireless access point and the preference is based on the first path comprising the wireless access point.

33 . A method comprising:

receiving a policy comprising a rule;

sending a first data packet comprising data of an application, wherein the first data packet is sent based on the rule;

determining a first throughput based on monitoring a first packet over a first path of a connection, the first packet configured to determine a parameter of the first path, wherein the first path comprises a mode selection and an identifier of the connection;

determining a second throughput based on monitoring a second packet over a second path of the connection, the second packet configured to determine a parameter of the second path, wherein the second path comprises the mode selection and the identifier of the connection; and

sending a third packet comprising data of the application, wherein the third packet is based on the first throughput and the second throughput.

34 . The method of claim 33 , wherein the rule is indicative of the second throughput according to the second path.

35 . The method of claim 33 , further comprising: sending, based on a preference for the first path, a fourth packet according to the first path, wherein the fourth packet is sent before the third packet.

36 . The method of claim 35 , wherein the first path comprises a wireless access point and the preference is based on the first path comprising the wireless access point.

37 . The method of claim 33 , wherein the determination of the first throughput is further according to steps comprising:

sending the first packet; and

receiving, based on a timestamp of receipt of the first packet, an indication of bits received according to the first path.

38 . The method of claim 33 , wherein the first throughput is further determined based on the first path having an accumulation of bits according to a duration satisfying a threshold.

39 . The method of claim 38 , wherein the accumulation of bits according to the duration satisfying the threshold indicates the first path is idle.

40 . The method of claim 33 , wherein the parameter of the first path is a first duration of a round trip according to the first path and the parameter of the second path is a second duration of a round trip according to the second path.

41 . The method of claim 33 , wherein the parameter of the first path is a first ratio of packets lost according to the first path and the parameter of the second path is a second ratio of packets lost according to the second path.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 11, 2023
From: JAKSA, ROBERT; PINHEIRO, ANA LUCIA
To: COMCAST CABLE COMMUNICATIONS, LLC
Reel/Frame 064214/0065 →
Continuity (1)
Related Publication 20240236807A1 · Jul 11, 2024
References Cited (75)
US 8098818B2 · Grilli et al. · 2012 [cited by applicant]
US 10135746B2 · Ho et al. · 2018 [cited by applicant]
US 10516990B2 · Wane · 2019 [cited by applicant]
US 11356897B2 · Salkintzis · 2022 [cited by examiner]
US 11432357B2 · Wang · 2022 [cited by applicant]
US 11503025B2 · Westerling · 2022 [cited by applicant]
US 11528218B2 · Kolar · 2022 [cited by examiner]
US 11540184B1 · Marupaduga · 2022 [cited by examiner]
US 11564132B2 · Suh et al. · 2023 [cited by applicant]
US 11689966B2 · Sahin et al. · 2023 [cited by applicant]
US 11736224B2 · Wang et al. · 2023 [cited by applicant]
US 11758460B1 · Myron et al. · 2023 [cited by applicant]
US 12199851B2 · Tian · 2025 [cited by examiner]
US 20030171112A1 · Lupper et al. · 2003 [cited by applicant]
US 20060153135A1 · Ascolese et al. · 2006 [cited by applicant]
US 20110128918A1 · Zhai · 2011 [cited by examiner]
US 20120093150A1 · Kini · 2012 [cited by applicant]
US 20120287781A1 · Maria · 2012 [cited by applicant]
US 20120320989A1 · Ameres · 2012 [cited by examiner]
US 20130065557A1 · Zhang et al. · 2013 [cited by applicant]
US 20130122906A1 · Klatt · 2013 [cited by applicant]
US 20130166507A1 · Staczek · 2013 [cited by applicant]
US 20140141763A1 · Suh et al. · 2014 [cited by applicant]
US 20150138962A1 · Tipton et al. · 2015 [cited by applicant]
US 20150296415A1 · Ling et al. · 2015 [cited by applicant]
US 20150312383A1 · Roeland et al. · 2015 [cited by applicant]
US 20180206081A1 · Kim et al. · 2018 [cited by applicant]
US 20180278545A1 · Andreoli-Fang · 2018 [cited by applicant]
US 20180279203A1 · da Silva et al. · 2018 [cited by applicant]
US 20190007826A1 · Wane · 2019 [cited by applicant]
US 20190010702A1 · Lloyd · 2019 [cited by applicant]
US 20190058798A1 · Lentz et al. · 2019 [cited by applicant]
US 20190098488A1 · Syed et al. · 2019 [cited by applicant]
US 20190246334A1 · Wang et al. · 2019 [cited by applicant]
US 20190261261A1 · Ishii · 2019 [cited by applicant]
US 20190306068A1 · Kiss et al. · 2019 [cited by applicant]
US 20190357119A1 · Hong et al. · 2019 [cited by applicant]
US 20200084835A1 · Wang et al. · 2020 [cited by applicant]
US 20200236149A1 · Mufti et al. · 2020 [cited by applicant]
US 20200314629A1 · Kreishan · 2020 [cited by applicant]
US 20200367306A1 · Wang · 2020 [cited by applicant]
US 20200413466A1 · Yu · 2020 [cited by applicant]
US 20210195408A1 · Yang et al. · 2021 [cited by applicant]
US 20210234729A1 · Cloonan et al. · 2021 [cited by applicant]
US 20210274339A1 · Sevindik et al. · 2021 [cited by applicant]
US 20220053406A1 · Lee · 2022 [cited by examiner]
US 20220086742A1 · Arrobo Vidal et al. · 2022 [cited by applicant]
US 20220110177A1 · Choksi et al. · 2022 [cited by applicant]
US 20220167221A1 · Lee · 2022 [cited by applicant]
US 20220232366A1 · Seo · 2022 [cited by applicant]
US 20220345887A1 · Karampatsis et al. · 2022 [cited by applicant]
US 20220417841A1 · Chak et al. · 2022 [cited by applicant]
US 20230012793A1 · Chak et al. · 2023 [cited by applicant]
US 20230095401A1 · Sivanesan et al. · 2023 [cited by applicant]
US 20230216852A1 · Salkintzis · 2023 [cited by applicant]
US 20230217230A1 · Sood et al. · 2023 [cited by applicant]
US 20230230069A1 · Voorhees et al. · 2023 [cited by applicant]
US 20230232198A1 · Salkintzis · 2023 [cited by applicant]
US 20230269556A1 · Li et al. · 2023 [cited by applicant]
US 20230284126A1 · Nayak et al. · 2023 [cited by applicant]
US 20230319685A1 · Talebi Fard et al. · 2023 [cited by applicant]
US 20230328593A1 · Qiao et al. · 2023 [cited by applicant]
CN 106664558B · 2020 [cited by applicant]
JP 2019153151 · 2019 [cited by applicant]
WO 2013166507A1 · 2013 [cited by applicant]
WO 2018206081A1 · 2018 [cited by applicant]
WO 2019010702A1 · 2019 [cited by applicant]
WO 2019095191A1 · 2019 [cited by applicant]
3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; 5G System; Access Traffic Steering, Switching and Splitting (ATSSS); Stage 3, 2021, Release 17. [cited by applicant]
Bonaventure et al., “O-RTT TCP Convert Protocol; rfc8803.txt,” 0-RTT TCP Convert Protocol; RFC8803.txt, Internet Engineering Task Force, IETF; 2020, https://tools.ietf.org/html/rfc8803. [cited by applicant]
ETSI TS 123 501 V15.2.0 Release 15, 3GPP TS 23.501, “Systems Architecture for the 5G System,” 2018. [cited by applicant]
ETSI TS 123 502 V15.2.0 Release 15, 3GPP TS 23.502, “Procedures for the 5G System,” 2018. [cited by applicant]
Ford, A. et al. “TCP Extensions for Multipath Operation with Multiple Addresses,” Internet Engineering Task Force (IETF), 2013. [cited by applicant]
“5G; Security Architecture and Procedures for 5G System (3GPP TS 33.501 version 16.8.0 Release 16),” ETSI Technical Specification, European Telecommunications Standards Institute (ETSI), vol. 3GPP SA, No. V16.8.0, Sep. … [cited by applicant]
W. Dong et al., “IDEAL: Incentivized Dynamic Cellular Offloading via Auctions,” in IEEE/ACM Transactions on Networking, vol. 22, No. 4, pp. 1271-1284, Aug. 2014, doi: 10.1109/TNET.2013.2273766.Website: <https://ieeexplo… [cited by applicant]