×

System and method for bandwidth profile based allocation and management of a time-varying topology network

  • US 10,560,874 B2
  • Filed: 10/02/2017
  • Issued: 02/11/2020
  • Est. Priority Date: 09/30/2016
  • Status: Active Grant
First Claim
Patent Images

1. An apparatus for dynamic allocation of bandwidth to terminals in a mobile node network, comprising:

  • a processor and a memory coupled to the mobile node network, the memory configured to store instructions that, when executed by the processor, cause the processor to;

    store in the memory a record of a current state of the mobile node network, including a record of allocations of bandwidth to the terminals, current commitments of bandwidth at each node of a plurality of mobile nodes of the mobile node network, current capacity of each edge of each of the plurality of mobile nodes, and congestion points of the mobile node network;

    collect updated information from one or more of the mobile nodes regarding the current state of the network, at a reference time;

    obtain routing tables for the network, for a next reference time; and

    upon receipt, from a requesting terminal among the terminals, of a demand for increased bandwidth to;

    estimate, for each of the mobile nodes, based at least in part on the stored record identifying the current state of the network, whether the current commitments of bandwidth will be met if the increased bandwidth is allocated to the requesting terminal, andupon a result of the estimate meeting a criteria, transmit an allocation to the requesting terminal of an increased bandwidth corresponding to the demand, andwherein;

    the routing tables are configured as per-priority routing tables, for each of a plurality of priorities,the current commitments of bandwidth include per-priority commitments,the increased bandwidth is a per-priority increased bandwidth,the estimation, for each mobile node, whether the current commitments of bandwidth will be met includes executing inner loop sequence within an outer loop sequence, wherein;

    the outer loop is executed once for each priority, andan inner loop sequence is executed N times for each execution of the outer loop sequence, N being the number of mobile nodes.

View all claims
  • 5 Assignments
Timeline View
Assignment View
    ×
    ×