US11044208B2 - System and method for maximizing throughput using prioritized efficient bandwidth sharing - Google Patents
System and method for maximizing throughput using prioritized efficient bandwidth sharing Download PDFInfo
- Publication number
- US11044208B2 US11044208B2 US15/823,476 US201715823476A US11044208B2 US 11044208 B2 US11044208 B2 US 11044208B2 US 201715823476 A US201715823476 A US 201715823476A US 11044208 B2 US11044208 B2 US 11044208B2
- Authority
- US
- United States
- Prior art keywords
- network resource
- bandwidth
- priority
- allocation
- priority user
- 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.)
- Active, expires
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/805—QOS or priority aware
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/18578—Satellite systems for providing broadband data service to individual earth stations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/5003—Managing SLA; Interaction between SLA and QoS
- H04L41/5019—Ensuring fulfilment of SLA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/16—Threshold monitoring
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/29—Flow control; Congestion control using a combination of thresholds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/76—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/78—Architectures of resource allocation
- H04L47/783—Distributed allocation of resources, e.g. bandwidth brokers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
- H04L47/808—User-type aware
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/821—Prioritising resource allocation or reservation requests
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/828—Allocation of resources per group of connections, e.g. per group of users
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
- H04L43/0882—Utilisation of link capacity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
Definitions
- Outroutes in communication networks can carry traffic from both low priority type users and high priority type users, for example, users who have subscribed to a service for a guarantee of bandwidth and a quality of service (QoS).
- QoS quality of service
- Techniques are applied to ensure the bandwidth and QoS to the high priority user, while allocating remaining bandwidth to low priority users. Such techniques, however, can result in significant idle bandwidth, unusable to either the high priority users or the low priority users. For example, if each high priority user is given dedicated bandwidth, intervals can occur when one or among the plurality do not use that bandwidth. A result can be unusable pieces of fractional capacity not readily usable through current techniques. This can result in inefficient network utilization and lower per user or per user group throughput.
- FIG. 1 illustrates a block schematic of one implementation of a system for dynamic sharing and efficient maximizing of utilization of network resource capacity, to first priority traffic and second priority traffic, according to one or more aspects.
- FIG. 2 illustrates a logic flow of example operations in one process within methods, according to one or more aspects, providing dynamic sharing and efficient maximizing in utilization of network resource capacity, to first priority traffic and second priority traffic.
- FIG. 3 illustrates portions of various bandwidth allocations applied in processes and methods for dynamic sharing and efficient maximizing of utilization of network resource capacity, to first priority traffic and second priority traffic, according to one or more aspects.
- FIG. 4 illustrates a block schematic of one implementation of a system for dynamic distribution of first priority traffic across multiple network resources, for efficient sharing and maximizing utilization of capacity on each of the multiple network resources to first priority traffic and second priority traffic, according to one or more aspects.
- FIG. 5 illustrates a logic flow of example operations in one process within methods, according to one or more aspects, for dynamic distribution of first priority traffic across multiple network resources, for efficient sharing and maximizing utilization of capacity on each of the multiple network resources, to first priority traffic and second priority traffic, according to one or more aspects.
- FIG. 6 illustrates an example satellite system in which aspects of this disclosure may be implemented.
- FIG. 7 illustrates a functional block diagram of an example computer system upon which aspects of this disclosure may be implemented.
- FIG. 1 illustrates a functional block schematic of an implementation of a system 100 for dynamic sharing and efficient maximizing of utilization of network resource bandwidth, according to one or more aspects.
- “utilization” means a ratio of the sum total actual throughput, both non real time and real time, on the network resource, from all users both high or “first priority,” and low or “second priority” to the estimated total bandwidth capacity of the network resource.
- NRSC network resource gateway
- GW gateway
- GW network resource gateway
- second priority is not limited to zero priority or no bandwidth guarantees.
- second priority users may be provided certain types of bandwidth and QoS specifications.
- First priority users can possess user-specific subscription plans that can specify, for example, particular guaranteed bandwidths, maximum or peak bandwidths, and specific values or ranges of values for various quality of service (QoS) parameters.
- QoS quality of service
- specific priority parameters e.g., guaranteed reserved bandwidth, maximum or peak bandwidth, and QoS, can differ among different “first priority” users, in accordance with their respective user-specific subscriptions.
- the illustrated system 100 is implemented as a satellite network system, and a forward uplink, labelled “NRSC,” is an initial segment, extending to a repeater or relay 108 , through which SE and NP data destined for terminals in the service region may pass.
- NRSC forward uplink
- the uplink in series with the downlink DNK can function as an outroute.
- a satellite network outroute is one example of a network resource for which bandwidth capacity can be allocated through systems and methods according to various aspects of this disclosure.
- the outroute example of a network resource though, is not intended as any limitation on implementations or practices according to the disclosed aspects.
- the NRSC GW 102 can include a NRSC bandwidth (BW) allocation controller 110 , which can be configured to receive or determine various NRSC conditions and metrics.
- BW NRSC bandwidth
- the reception or determination of one or more of the various NRSC conditions and metrics can be periodic, for example, according to a network resource clock (not explicitly visible in FIG. 1 ).
- the NRSC metrics can include, for example, a NRSC delay level and a NRSC utilization level.
- the NRSC BW allocation controller 110 can be further configured to determine an NRSC state, periodically or aperiodically, based at least in part on the obtained NRSC delay level (DL) and determined NRSC utilization level (UL).
- the NRSC BW controller 110 may be implemented in, or as added functionality of a code rate organizer (CRO).
- the determined NRSC state can include various congestion states, for example, a non-congested state, a fully congested state, and at least one intermediate congestion state.
- the fully congested state can be established, in one implementation, by the NRSC DL relative to a given delay threshold. In such an implementation, the fully congested state will be referred to as a “delay-congested” state.
- Other congestion conditions can be defined according to the NRSC DL and delay threshold in combination with the NRSC UL relative to one or more given utilization thresholds.
- CEs the allocated bandwidths
- CC(t) CC(t
- values can be application-specific.
- Example factors that may be considered determining a specific t, or range oft can include statistics of bandwidth demand changes, various subscription-specified QoS levels, and system and user tolerance to intermittent degradation, e.g., when demand change rate exceeds the bandwidth partitioning update period, i.e., the period of t (as well as the multiple-period updating process).
- FIG. 2 illustrates a logic flow 200 of example operations in one process within methods, according to one or more aspects, for dynamic sharing and efficient maximizing of utilization of network resource bandwidth, to first priority traffic and second priority traffic. Examples according to FIG. 2 operations will be described in reference to FIG. 1 . Description of operations in the flow 200 will refer to real-time as “RT” and non-real-time as “NRT.” The flow 200 assumes that prior to the start 202 , the NRSC bandwidth allocation controller 110 is provided with values for the following bandwidths, for each of the K SEs.
- the flow 200 also assumes the NRSC bandwidth allocation controller 110 periodically determines, or is provided with, the following NRSC condition metrics:
- the NRSC BW allocation controller 110 can be configured with, or provided a minimum BW allocation for NP, and will be referred to as “CC_min.”
- CC_min a minimum BW allocation for NP
- it can be configured with a default value of zero
- FIG. 3 graphically represents a hypothetical example of AE, CR, CMax, CNRT and a “residual capacity.”
- the example operations in the flow 200 will assume that, prior to t at 202 , the NRSC BW allocation controller 110 has been configured with, or has run-time access to a delay threshold, and to a first and a second utilization threshold.
- the delay threshold will be referred to as “DTH”
- the first and second utilization threshold will be referred to as “UT1” and “UT2,” respectively.
- UT1 is assumed as the smaller among UT1 and UT2.
- the NRSC BW allocation controller 110 can be configured to detect, based on UT1 and UT2 in combination with DTH, two intermediate congestion states of the NRSC, in addition to the non-congested state and delay congested state.
- the least congested of the two which will be referred to as the “intermediate congestion state,” is the recent utilization level being concurrently higher than UT1 (the smaller of the two) lower than UT2, concurrent with the delay level being less than DTH.
- the higher of the two intermediate congestion states is the utilization level being greater than UT2, concurrent with the delay level being less than DTH. This can be referred to as the “higher congestion state.”
- a run-time instance of the flow 200 can start at 202 , at an arbitrary t, then proceed to 204 to obtain the NRSC's DL and UL.
- “obtain,” in the context of “obtain the NRSC's DL and UL,” encompasses NRSC DL and NRSC UL having been previously supplied to the NRSC BW allocation controller 110 .
- the flow 200 can proceed from 204 to 206 , where operations can be applied to determine the NRSC congestion state, based at least in part on the obtained DL and UL.
- NRSC BW allocation controller 110 is configured to apply two utilization thresholds, e.g., UT1 and UT2. Therefore, operations at 206 will detect the NRSC state as the non-congested state, intermediate congestion state, high congestion state, or delay congested state, according to the following:
- the flow 200 proceeds to logic decision 208 which routes the flow 200 to one of a plurality of different CE_k(t) update processes, each corresponding to a different NRSC congestion state determined at 206 .
- Each of the different CE_k(t) update processes is configured to adjust allocation of bandwidth in a manner that, at the present congestion state determined at 206 , maximizes utilization and efficiency in sharing NRSC bandwidth, among and between priority and non-priority users.
- FIG. 2 illustrates the flow 200 assuming a configuration as described above, namely, a breakdown into four congestion states, and a corresponding four congestion state-specific CE and CC update processes.
- the determination at 206 of the NRSC congestion state, and the application of the appropriate updating of CE_k(t), can be performed by the NRSC BW allocation controller 110 .
- FIG. 2 illustrates as its configured set of NRSC bandwidth allocation update processes, a set four processes, each corresponding to one of the four congestion states in the example above. More specifically, the set can include a non-congested NRSC BW allocation update process 210 , an intermediate congestion NRSC BW allocation update process 212 , a high congestion NRSC bandwidth allocation update process 214 , and a delay congested NRSC state update process 216 .
- operations in the NRSC non-congested state update process 210 can include updating to CE_k(t+1) by increasing CE_k(t), by an amount based at least in part on CE_k(t), in relation to the SE_k's reserve bandwidth, CR_k.
- ⁇ _UP1 the larger the ⁇ _UP1 value the greater the single update adjustment increment of the CE_k(t) values.
- the specific value of ⁇ _UP1 can be application-specific, but as can be seen from the Equation (1) representation, factors can include NRSC update period, t.
- operations in the NRSC intermediate-congested state update process 212 can include updating to CE_k(t+1) by increasing CE_k(t), by an amount based at least in part on CE_k(t), in relation to the SE_k's reserve bandwidth, CR_k. This differs from the non-congested state CE_(t) update process 210 , which uses a constant increment, ⁇ _UP1.
- operations applied at 212 for determining ⁇ _CE_k can be according to the following Equations (3)-(5), or equivalents thereof.
- Equations (3)-(5) are a breakdown for purposes of segmenting the description, and are not intended as any limitation as to a specific sequencing of operations in a processor implementation. It will also be understood that operations at 212 can be configured such that specific values, for each of the variables and parameters appearing in Equations (3)-(5), may not be stored, or generated, in an isolated form.
- operations at 214 can include updating to CE_k(t+1) by a decrease of CE_k(t), the decrease being based at least in part on the CE_k(t) and CR_k.
- the variable “Step_Down” can be based, at least in part, on a ratio of the arithmetic difference between the NRSC DL and the delay threshold DTH, i.e., the amount that DL exceeds DTH, to a flow control period TF.
- Step_Down it can be seen that its values do not require re-calculation for each K SE_k value.
- logic block 216 can be a pass through and, since CC(t) is updated based on the CE(t) update, the flow 200 can return to 204 , where NRSC BW allocation controller 110 can obtain DL and UL values, whereupon the above-described flow 200 process can repeat.
- general operations according to the flow 200 will include determining the NRSC congestion state at 206 and then, via 208 , proceeding to the CE_k(t) update process of one among 210 , 212 , 214 , or 216 .
- the NRSC BW allocation controller 110 can be configured to update CC(t) based at least in part, on the updating of the CEs.
- E [ ATTL ( t )] ⁇ E ⁇ ATTL ( t )+(1 ⁇ E ) E [ ATTL ( t ⁇ 1] Eqn. (11)
- the FIG. 1 system 100 shows a single NRSC GW 108 , having a respective NRSC BW allocation controller 110 .
- One alternative system, and method performed thereon, can provide dynamic distribution of priority traffic across multiple NRSCs (e.g., multiple outroutes), for efficient sharing by first priority and second priority traffic, and providing a maximizing of utilization of bandwidth on each of the multiple NRSCs.
- FIG. 4 illustrates a block schematic of one implementation of a system 400 for providing dynamic distribution of traffic from multiple priority sources, across multiple NRSCs and, on each NRSC, providing a sharing and maximizing of utilization of bandwidth, to first priority and second priority traffic, according to one or more aspects.
- BW bandwidth
- the NRSC BW allocation controllers 406 can be generally configured, for example, according to the above-described NRSC BW allocation controller 110 .
- the K first priority users SE and the second priority user NP can interface to a WAN 408 , for example, the Internet, to which the N NRSC GWs 404 can connect through a WAN gateway 410 .
- the BW manager 402 can be configured to identify, for each SE having access to any one or more of the NRSC GWs 404 , a listing of all NRSC GWs 404 it has access to. For purposes of description, the list will be referred to as the SE's “enabled NRSC list.” As will be described in greater detail later, the BW manager 402 can be configured to use, for each SE sending priority traffic, the enabled NRSC list for purposes of optimally distributing that traffic across its enabled NRSCs.
- Each of the N NRSC BW allocation controllers 406 can also be provided a delay threshold and at least one utilization threshold.
- One example can be the above described delay threshold DTH and the above-described first and second utilization thresholds UT1 and UT2. It will be assumed, for purposes of describing example operations, that all of the N NRSC BW allocation controllers 406 - n use the same delay threshold(s) and utilization threshold(s). Accordingly, DTH, UT1 and UT2 are not assigned the index “n.” This is not a limitation, as implementations can provide different thresholds to different N NRSC BW allocation controllers 406 .
- Each of the N NRSC BW allocation controllers 406 can be configured to obtain an NRSC delay level (DL_n) and an NRSC utilization level (UL_n) of its corresponding NRSC-n and, based thereon, determine a congestion state of that n th NRSC.
- DL_n NRSC delay level
- UL_n NRSC utilization level
- One example determination can be among the four congestion states described in reference to FIGS. 1 and 2 .
- each of the N NRSC BW allocation controllers 406 can be configured to update CE_n,k(t) to CE_n,k(t+1) and update its CC_n(t) to CC_n(t+1), in accordance with the FIG. 2 flow 200 .
- the BW manager 402 by identifying the K SEs, and providing CR_n,k, CEmax,n,k and CEmin to each of the N NRSC BW allocation controllers 406 , enables N NRSC BW allocation controllers 406 to operate independently, dynamically partitioning their respective NRSCs, without requiring knowledge of the other N ⁇ 1 NRSC BW allocation controllers 406 .
- Such operations can include conditionally updating, at time increments t, CE_n,k(t) for each of its K priority users, to CE_n,k(t+1). These operations can, as described in reference to FIG. 2 , be based at least in part on CE_n,k(t) and CR_n,k.
- Each of the NRSC BW allocation controllers 406 upon completing that update, can update its corresponding CC_n(t) to CC_n(t+1), based at least in part on a summation of CE_n,k(t+1), for k from 1 to K, as described above.
- the BW manager 402 can be configured to periodically update its enablement rule.
- the BW manager 402 can be further configured to update CR_n,k, CEmax_n,k and CEmin_n,k to each of the N NRSC BW allocation controllers 406 .
- the period can be referred to as “the NRSC distribution update period.”
- the NRSC distribution update period can be significantly longer than the NRSC partition update period, t.
- One illustrative, non-limiting, example of “significantly longer” can include, but is not limited to, the NRSC distribution update period being approximately 10 times to approximately 30 times the NRSC partitioning period.
- system 400 can be configured to provide, in combination with other disclosed features and aspects, a real-time (RT) traffic adjusted reserve BW and maximum BW.
- CR_n,k reserved bandwidth for first priority users on each NRSC
- the BW manager 402 can be configured to provide such accommodation by processes that include a particular decreasing of a first priority user's NRT reserved bandwidth (CR_n,k), if that user's RT traffic exceeds a threshold of its total traffic.
- One example configuration can include, among other operations, determination of its “instant real-time portion” or “instant RT portion.”
- Implementation of determining the instant RT portion can include configuring the BW manager 402 to periodically obtain, at increments of t, for each SE, a measured overall real-time traffic, VR_n,k(t), on each of the N NRSCs.
- the instant RT portion can then be determined as a ratio of VR_n,k(t) to the priority's user's non-adjusted reserve bandwidth, CR_n,k.
- Operations can, for example, be according to Equation (12):
- the instant RT portion can be larger than integer 1 when the RT traffic exceeds CR_n,k.
- the BW manager 402 can be configured to utilize the instant RT portion, for each of the N NRSCs, to determine which of the SEs enabled for that NRSC is putting on the NRSC a level of RT traffic such that its instant RT portion is greater than 1 or, more generally, is greater than TN, which can be less than 1, equal to 1, or greater than 1.
- TN can be a configuration parameter.
- the BW manager 402 can be configured to adjust each of such SE's reserved bandwidth on that NRSC.
- CEmin_k is a minimum BW that can be reserved for SE(k), and g_k is a coefficient that can allow selective treating of RT traffic.
- CEmin_k can provide, for NRT traffic from SE on any of N NRSCs, a minimum BW on that NRSC, in instances where RT traffic consists of a significant amount of the SE's reserved bandwidth, CR_n,k, on that NRSC.
- a default value of g(k) can be set at integer 1, to indicate that RT traffic can be counted when reserving BW if the RT portion is larger than a threshold.
- the threshold will be referred to as “GT.”
- GT the threshold
- g can be set to zero, to indicate that RT traffic will not be counted when reserving BW if the RT portion is larger than GT.
- the value of GT can be application-specific, and can be readily determined, for the application, by a person of ordinary skill upon reading this disclosure.
- both the threshold test, ⁇ RT_n,k(t) ⁇ TN, and each of Equations (13) and (14) can use an averaged ⁇ RT_n,k(t), EMA[ ⁇ RT_n,k(t)].
- the averaging interval “t” in operations such as Equation (15) is not necessarily the same as the period or interval applied by the NRSC BW allocation controllers 406 .
- Example ranges of the averaging interval can include 100 milliseconds (ms), multiples of 100 ms, and ranges extending above, between and beyond these examples.
- Values, and ranges of values, for ⁇ RT can be application specific. Examples values and ranges can include 0.01, but can also include ranges below and above that example.
- FIG. 5 illustrates a logic flow 500 of example operations in one process within methods according to one or more aspects. Assuming a start-up instance, flow 500 can begin at an arbitrary start 502 and proceed to 504 where the BW manager 402 can perform an initialization.
- the initialization operations can include initializing its enablement rules, which can designate, or define, for each of the N NRSC BW allocation controllers 406 , which of the first priority users SE are enabled to access that controller 406 .
- One example of such initializing can form the enablement rule according to an eligibility matrix, such as the following Equation (16), or an equivalent thereof:
- the initialization operations at 504 can also include initializing the reserved bandwidths, maximum bandwidths, and minimum bandwidths, for each NRSC, for each of the K SEs that are designated or enabled for that NRSC.
- FIG. 5 illustrates the operations at 504 also setting initial values for CE,n,k, and CC(n). These initializing operations may be done locally at the NRSCs, by their respective BW allocation controllers, and therefore omitted at the NRSC BW manager.
- the flow 500 can proceed from 504 to 506 , where the BW manager 402 (or another system 400 resource) can provide, to each n th of the N NRSC BW allocation controllers 406 , the reserve bandwidth (CR_n,k), maximum bandwidth (CEmax_n,k), and minimum bandwidth (CEmin_n,k), if any, for each of the first priority users SE enabled to access that controller 406 .
- Operations at 506 can include, for example, loading the first NRSC BW allocation controller 406 - 1 with CR_1,k, CEmax_1,k, CEmin_1,k, by K iterations, then loading a second NRSC BW allocation controller (not visible in FIG.
- the N independent NRSC bandwidth allocation operations can begin, for example, at a corresponding one of the N NRSC BW allocation controllers 406 .
- each can be in accordance with the FIG. 2 flow 200 .
- the flow 500 can receive certain information regarding the state of the N NRSC, for example by the BW manager 402 performing an active query of the N NRSC BW allocation controllers 406 , or by receiving periodic reports from the controllers 406 .
- the information can include VR_n,k(t), CNRT_n, H_n,k(t), and H_N,K(T).
- features provided by operation of the flow 500 can include, but are not limited to:
- the BW manager 402 can drive multi-NRSC bandwidth sharing for each SE, using NRSC bandwidth allocation processes independently run by each of the NRSC BW allocation controllers 406 .
- Additional features can include:
- the updating period for these values can be multiples of the flow control interval, t, that is applied by the NRSC BW allocation controllers 406 .
- the values H_n,k, h_n,k, CNRT_n, and UL_n can be averaged. The averaging operations can be performed at the NRSC BW allocation controllers 406 .
- each OTR partitioning controller 406 send all averaged values, or all non-averaged values, as opposed to a mixing of the two.
- the BW manager 402 can generate the updated CR_n,k and CEmax_n,k values by operations according to Equations (21)-(25), or equivalents thereof.
- V ⁇ _ ⁇ k ⁇ 0 ULA ⁇ _ ⁇ k - UT ⁇ ⁇ 1 UT ⁇ ⁇ 2 - UT ⁇ ⁇ 1 1 ⁇ ULA ⁇ _ ⁇ k ⁇ UT ⁇ ⁇ 1 UT ⁇ ⁇ 1 ⁇ ULA ⁇ _ ⁇ k ⁇ UT ⁇ ⁇ 2 ULA ⁇ _ ⁇ k > UT ⁇ ⁇ 2 Eqn .
- CR_n , k max ⁇ ⁇ CE ⁇ min_ ⁇ k , min [ W ⁇ _ ⁇ nk ⁇ CR ⁇ _ ⁇ k , ⁇ _upper ⁇ CNRT ⁇ _ ⁇ n ) ] , Eqn . ⁇ ( 24 )
- first priority users SE can be a group of users, for example, multiple Virtual Network Operators (VNOs), aggregated as an SE to be allocated NRSC bandwidth in accordance with the features and aspects of the present disclosure.
- VNOs Virtual Network Operators
- NRSC bandwidth assigned to such an SE can then, through subscriptions or other arrangements that presently disclosed systems and methods need have no knowledge, be dynamically shared by and allocated among the multiple VNOs aggregated as an SE.
- one or more multi-tiered systems and methods can be implemented, that can provide a group of VNOs with allocation of NRSC bandwidth, e.g., by operations according to the flow 200 or the flow 500 , in combination with dynamic sharing and allocation of that NRSC bandwidth amongst the multiple VNOs or other sub-groups, by operations independent from the flows 200 and 500 , but furthering the utilization of those flows, as well as the systems and methods applied in the second tier allocation.
- One example of such a combination of systems and methods can be implemented as a multi-tiered system or method, including a system or method according to the present disclosure, which can efficiently allocate NRSC bandwidth to an aggregate of VNOs or other sub-groups, and feeding that allocated bandwidth to a system or method such as, for example, those disclosed by U.S. Pat. App. Pub. No. 2016/0072574, filed Sep. 8, 2014, (the '574 publication) the entirety of which is hereby incorporated by reference. Such methods and systems can then, in tandem with the present disclosure, divide and allocate the aggregated NRSC bandwidth among its constituent VNOs, according to their respective bandwidth guarantees.
- Multi-tiered systems and methods include aggregation of demands of multiple subgroups, e.g., multiple VNOs, into a single first priority user, with dynamic, efficient allocation of NRSC bandwidth to that aggregate first priority user, e.g., according to the FIG. 2 flow 200 or FIG. 5 flow 500 , coupled with feeding that bandwidth to systems and processes according to the '574 publication, for independent second-tier allocation among the multiple subgroups (e.g., VNOs), based on their respective bandwidth commitments (peak and guarantees), as well as their respective demands.
- multiple subgroups e.g., multiple VNOs
- systems and methods according to the present disclosure can be adapted and implemented to provide bandwidth commitment to first priority users not only within the same resource, e.g., network resources as illustrated in FIG. 1 , but also across multiple distinct resources, for example, but not limited to, multiple beams, multiple gateways, and multiple satellite networks.
- One or more examples of such systems and methods can include allocation of bandwidth of one or more NRSCs, among SEs, in accordance with systems and processes as described above, e.g., in reference to FIGS. 1-5 , in combination with another, longer cycle time operation, e.g., by another central bandwidth manager logic (not explicitly visible in FIGS. 1-5 ).
- such longer cycle time operations can be in accordance with systems and methods disclosed in U.S.
- exemplary longer cycle time operations can include operations such as described in the '490 application, e.g., in reference to the '490 FIG. 4 process block 420 .
- such operations can include receiving (e.g., by operations such as described in reference to the '490 FIG. 4 block 422 ), average demands on each NRSC in which the first priority user operates, (e.g., sent by the present disclosure's FIG. 1 NRSC BW allocation controllers 110 , or by two or more of the present disclosure's FIG. 4 bandwidth managers 402 ).
- the longer loop central bandwidth manager logic can then, in an aspect, aggregate the overall allocations for each first priority user against a larger configured guaranteed and maximum bandwidth for that first priority user.
- the longer loop central bandwidth manager logic can determine, based on that aggregation and comparison to the larger configured and guaranteed and maximum bandwidth for that first priority user, an adjustment (up/down) to the guarantee and to the maximum bandwidth for that first priority user, in each NRSC in which that first priority user operates.
- such adjustments can be a function of, or can be based on, for example, of demand per NRSC, allocations per NRSC, utilization per NRSC, and commitments to that first priority user, and other first priority users in each NRSC.
- the longer loop central bandwidth manager logic can then feed the adjusted guarantee and maximum bandwidth for that first priority user back to each NRSC, for the NRSC to utilize, instead of a hard-coded set that may be run in operations as described herein, for example, in reference to the present disclosure's FIGS. 2 and 5 .
- NRSC bandwidth allocation and sharing aspects can include a central aggregating bandwidth manager logic increasing or decreasing the amount of bandwidth that a first priority user can be allocated in a given NRSC, in order to additionally ensure that a larger, aggregate bandwidth guarantee for that first priority user can be adequately met over time.
- this combination of NRSC bandwidth allocation and sharing, and a longer loop adjustment of each first priority user's allocation within multiple distinct NRSCs can be further combined with a multi-tiered implementation as described above.
- FIG. 6 illustrates an example of a satellite network 600 in which various aspects of the present disclosure may be implemented.
- the satellite network 600 can include an SGW 602 , remote terminals 604 a - 604 f , two satellites 606 a and 606 b , IPGWs 608 a - 608 n , and RF terminals 610 a and 610 b.
- SGW 602 may be connected to remote terminals, such as the example VSATs 604 a - 604 f via satellites 606 a and 606 b .
- Forward uplinks 612 a and 616 a may carry data between SGW 602 and satellites 606 a and 606 b , respectively.
- Each of one or more of the VSATs 604 a - 604 f can be associated with a respective network user who has been assigned (e.g., via subscription) a first priority access for sending dataReturn downlinks 614 a and 618 a can provide for transmitting data from satellites 606 a and 606 b , respectively, to SGW 602 .
- Forward uplinks 612 a , 616 a and forward downlinks 612 b , 616 b may form an outroute, and the outroute can be an example NRSC having its current capacity shared and allocated among first priority user an NRSC), and return uplinks 614 b , 618 b and return downlinks 614 a , 618 a may form an inroute.
- SGW 602 may be part of satellite earth stations with connectivity to ground telecommunications infrastructure.
- RF terminals 610 a and 610 b may be the physical equipment responsible for sending and receiving signals to and from satellites 606 a and 606 b , respectively, and may provide air interfaces for SGW 602 .
- Satellites 606 a and 606 b may be any suitable communications satellites. Signals through satellites 606 a and/or 606 b in the forward direction may, for example, be according to the DVB-S2x standard. Signals passing through satellites 606 a and/or 606 b in the return direction may be based, for example, on the IPoS standard. Other suitable signal types may also be used in either direction.
- the bandwidth of RF terminals 610 a and 610 b can be shared amongst IPGWs 608 a - 608 n .
- RT and NRT traffic flows may be classified into different priorities, and may be processed and multiplexed before being forwarded to priority queues at SGW 602 .
- Data from an internet intended for remote terminals 604 a - 604 f (e.g., VSATs) may be in the form of IP packets, including TCP packets and UDP packets, or any other suitable IP packets. This data may enter SGW 602 from any one of IPGWs 608 a - 608 n .
- the received IP packets may be processed and multiplexed by SGW 602 along with IP packets from the other ones of IPGWs 608 a - 608 n .
- the IP packets may then be transmitted to satellites 606 a and/or 606 b , and satellites 606 a and/or 606 b may then transmit the IP packets to the VSATs.
- IP packets may enter the network via the VSATs, be processed by the VSATs, and transmitted to satellites 606 a and/or 606 b . Satellites 606 a and/or 606 b may then send these inroute IP packets to SGW 602 . It should be noted that because the spectrum can be segmented for one beam, a particular satellite beam can carry one or multiple NRSCs
- a bandwidth manager 620 can be included to manage or coordinate bandwidth allocation on the shared network.
- Bandwidth manager 620 may be implemented, for example, as a centralized bandwidth manager configured to allocate available bandwidth among the various terminals.
- the bandwidth manager 620 can also be configured in accordance with the BW manager 402 described above.
- the bandwidth manager 620 can also provide control messages, including the FIG. 5 block 506 updated CR_n,k and CEmax_n,k values, to the NRSCs.
- FIG. 7 is a block diagram illustrating a computer system 700 upon which aspects of this disclosure may be implemented, such as, but not limited to, particular logic blocks described in reference to FIG. 1 . It will be understood that logic blocks illustrated in FIG. 7 represent functions, and do not necessarily correspond to particular hardware on a one-to-one basis.
- the computer system 700 can include a data processor 702 , an instruction memory 704 , and a general-purpose memory 706 , coupled by a bus 708 .
- the instruction memory 704 can include a tangible medium retrievably storing computer-readable instructions, that when executed by the data processor 702 cause the processor to perform operations, such as described in reference to FIGS. 1, 3, 4, and 5 .
- the computer system 700 can also include a communications interface 710 , configured to interface with a local network 712 for accessing a local server 714 , and to communicate through an Internet service provider (ISP) 716 to the Internet 718 , and access a remote server 720 .
- the computer system 700 can also include a display 722 and a user interface 724 , such as a touchscreen or keypad.
- machine-readable medium refers to any medium that participates in providing data that causes a machine to operation in a specific fashion.
- machine-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, or any other magnetic medium, a CD-ROM, any other optical medium, punchcards, papertape, any other physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave as described hereinafter, or any other medium from which a computer can read.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
-
- CR_k—a reserved BW for SE_k
- CEmax_k—a maximum BW for SE_k, where CR_K≤CMX_k; and
- CEmin_k—a minimum BW for SE_k.
-
- AE_k(t)—actual throughput for SE_k at time t;
- CNRT—most recent estimated total NRT bandwidth of the NRSC;
- DL—most recent measured or estimated delay for the NRSC; and
- UL—most recent measured or estimated utilization level for the NRSC.
-
- delay congested state—NRSC DL exceeding DTH,
- high congestion state—NRSC DL less than DTH, concurrent with NRSC UL greater than UT2, the higher of the two utilization thresholds,
- intermediate congestion state—NRSC DL less than DTH, concurrent with NRSC UL being concurrently greater than UT1 and less than UT2, and
- non-congested state—NRSC DL less than DTH, concurrent with NRSC UL less than UT1
CE_k(t+1)=min{CEmax_k,max[C_k,CE_k(t)*(1+Δ_UP1)]}, Eqn. (1)
-
- wherein Δ_UP1 is configuration parameter.
CE_k(t+1)=min{CEmax_k,max[CR_k,CE_k(t)+Δ_CE_k)]}, Eqn. (2)
-
- where Δ_UP2 is a configuration parameter.
CE_k(t+1)=min{CEmax_k,max[CR_k,CE_k(t)·(1−Step_Down)]} Eqn. (6)
Delay_Diff=(DL−DTH)/TF Eqn. (7)
Step_Down=min(Δ_Down,Delay_Diff), where Eqn. (8)
-
- The variable Δ_Down is a configuration parameter.
CC(t+1)=max{CC_min,CNRT−ρC*Σ k=1 K[min[AE_k(t),CE_k(t)]]}, Eqn. (9)
-
- where,
- CC_min is a given minimum value of CC,
- CNRT is an estimated non real-time capacity of the NRSC, and
- ρC is a given scaling factor.
- where,
CC(t+1)=max[CC_min,CNRT−E[AE_total],CNRT−Σk=1 K CE_k(t+1)], Eqn. (10)
-
- where,
- E[AE_total] is a running average based on ATTL(t) and ATTL(t−1).
- where,
E[ATTL(t)]=αE ·ATTL(t)+(1−αE)E[ATTL(t−1] Eqn. (11)
-
- αE is a configuration parameter.
-
- through all traffic and NRSC conditions, each SE_k reserved BW, CR_k, can be guaranteed;
- during intervals that the NRSC is in its uncongested state, for each SE_k
- if the NRSC utilization is low, CE_k can be increased by the NRSC
BW allocation controller 110, as demanded, up to the SE_k maximum BW, CEmax_k, and - if the NRSC utilization is high, the NRSC
BW allocation controller 110 can assign BW to SE_k to meet its actual throughput;
- if the NRSC utilization is low, CE_k can be increased by the NRSC
- if the NRSC is close to congestion (i.e., the above described “high congestion” state) with high overall demand from both SEs and the NP, the NRSC
BW allocation controller 110 can reduce all SEs' assigned BW, allowing the NP extra BW to meet the NP demand; and - during intervals where the NRSC is congested, NP may compete with the SEs, up to NP having all BW of the NRSC beyond the SEs' reserved BW.
-
- where ηRT_n,k(t) is the instant RT portion, on NRSC-n, from SE_k.
Rev[CEmax_n,k(t)]=max{CEmin_k,[CEmax_n,k(t)−g_k·VR_n,k(t)]} Eqn. (13)
Rev[CR_n,k(t)]=max{CEmin_k,[CR_n,k(t)−g(k)·VR_n,k(t)]} Eqn. (14)
EMA[ηRT_n,k(t)]=αRT·ηRT_n,k(t)+(1−αRT)EMA[ηRT_n,k(t−1)] Eqn. (15)
-
- where, αRT is a configuration parameter.
-
- During intervals where an NRSC-n utilization is low, CR_n,k, CEmax_n,k for SE_n,k, k=1 to K, can be in proportion to the total plan rate, total plan rate, H_n,k, of SE_n,k.
- During intervals where an NRSC-n utilization is relatively high, CR_n,k, and CEmax_n,k for SE_n,k, k=1 to K, can be in proportion to the SE's total active plan rate, h_n,k.
-
- CEmin_n,k can be consistent across all NRSCs, while the proportion may be unnecessary.
- During intervals where few SEs are actively transmitting, default reserved bandwidth can be used for all NRSCs.
EMA[(H_n,k)(t+1)=α1·H_n,k(t+1)+(1−α1)EMA(H_n,k)(t) Eqn. (17)
EMA[(h_n,k)(t+1)=α1·h_n,k(t+1)+(1−α1)EMA(h_n,k)(t) Eqn. (18)
-
- where α1 is the smoothing factor.
EMA[(CNRT_n)(t+1)=α2·CNRT_n(t+1)+(1−α2)EMA(CNRT_n)(t) Eqn. (19)
EMA[(UL_n)(t+1)=α2·UL_n(t+1)+(1−α2)EMA(UL_n)(t) Eqn. (20)
-
- where α2 is the smoothing factor.
-
- where β_upper is the upper limit of the portion of an NRSC's capacity
- being used for an SE user.
CEmax_n,k=max{CEmin_k,min[W_nk·CEmax_k,β_upper·CNRT_n)] Eqn. (25)
Claims (13)
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US15/823,476 US11044208B2 (en) | 2017-11-27 | 2017-11-27 | System and method for maximizing throughput using prioritized efficient bandwidth sharing |
EP18830027.1A EP3718272B1 (en) | 2017-11-27 | 2018-11-26 | System and method for maximizing throughput using prioritized efficient bandwidth sharing |
PCT/US2018/062497 WO2019104286A1 (en) | 2017-11-27 | 2018-11-26 | System and method for maximizing throughput using prioritized efficient bandwidth sharing |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US15/823,476 US11044208B2 (en) | 2017-11-27 | 2017-11-27 | System and method for maximizing throughput using prioritized efficient bandwidth sharing |
Publications (2)
Publication Number | Publication Date |
---|---|
US20190166067A1 US20190166067A1 (en) | 2019-05-30 |
US11044208B2 true US11044208B2 (en) | 2021-06-22 |
Family
ID=64949379
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/823,476 Active 2038-03-01 US11044208B2 (en) | 2017-11-27 | 2017-11-27 | System and method for maximizing throughput using prioritized efficient bandwidth sharing |
Country Status (3)
Country | Link |
---|---|
US (1) | US11044208B2 (en) |
EP (1) | EP3718272B1 (en) |
WO (1) | WO2019104286A1 (en) |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP7206920B2 (en) * | 2019-01-08 | 2023-01-18 | 富士フイルムビジネスイノベーション株式会社 | Information processing device and program |
US11089606B1 (en) | 2020-05-07 | 2021-08-10 | Vmware, Inc. | Methods for dynamically optimizing a flying ad-hoc network |
US11627097B2 (en) * | 2021-02-26 | 2023-04-11 | Netapp, Inc. | Centralized quality of service management |
CN113766653B (en) * | 2021-10-13 | 2023-11-28 | 北京慧清科技有限公司 | TDMA time slot allocation method facing service demand |
CN114257515B (en) * | 2021-12-21 | 2024-04-05 | 中电信数智科技有限公司 | Bandwidth secondary scheduling method and device |
CN114520791B (en) * | 2022-01-28 | 2024-05-10 | 江苏大学 | Industrial control network flow scheduling method based on differentiated QoS requirements |
US20230336498A1 (en) * | 2022-04-19 | 2023-10-19 | Mediatek Inc. | Data bandwidth management method and device |
Citations (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040015602A1 (en) * | 2002-07-19 | 2004-01-22 | Roving Planet, Inc. | Network bandwidth allocation and access method and apparatus |
US20040218604A1 (en) * | 2001-05-26 | 2004-11-04 | Porter John David | Method and apparatus for communications bandwidth allocation |
US20050071471A1 (en) * | 2003-09-30 | 2005-03-31 | International Business Machines Corporation | Automatic bandwidth control for file servers with a variable priority client base |
US7061861B1 (en) * | 2000-07-06 | 2006-06-13 | Broadband Royalty Corporation | Method and system for weighted fair flow control in an asynchronous metro packet transport ring network |
US20080130495A1 (en) * | 2006-12-05 | 2008-06-05 | Latitude Broadband, Inc. | Methods And Systems For Dynamic Bandwidth Management For Quality Of Service In IP Core And Access Networks |
US20100002579A1 (en) | 2008-07-02 | 2010-01-07 | Qualcomm Incorporated | Methods and systems for priority-based service requests, grants for service admission and network congestion control |
US20100322074A1 (en) * | 2008-03-03 | 2010-12-23 | Oki Electric Industry Co. Ltd. | Dynamic bandwidth allocation method and dynamic bandwidth allocation device |
US20110096665A1 (en) * | 2009-10-22 | 2011-04-28 | Motorola, Inc. | Methods and apparatus for controlling congestion in a communication network |
EP2376558A1 (en) | 2008-12-19 | 2011-10-19 | SABIC Innovative Plastics IP B.V. | Moisture resistant polyimide compositions |
US20120140624A1 (en) * | 2010-12-06 | 2012-06-07 | Genband Inc. | Systems and methods for dynamic congestion management in communications networks |
US20120230195A1 (en) * | 2006-01-31 | 2012-09-13 | Roundbox, Inc. | Reliable event broadcaster with multiplexing and bandwidth control functions |
US20130159494A1 (en) * | 2011-12-15 | 2013-06-20 | Cisco Technology, Inc. | Method for streamlining dynamic bandwidth allocation in service control appliances based on heuristic techniques |
US20130223222A1 (en) * | 2012-02-28 | 2013-08-29 | Cellco Partnership D/B/A Verizon Wireless | Dynamically provisioning subscribers to manage network traffic |
US20150049606A1 (en) | 2013-08-19 | 2015-02-19 | Verizon Patent And Licensing Inc. | Tier-based admission control for user equipment |
US20150288617A1 (en) * | 2014-04-07 | 2015-10-08 | Ericsson Television Inc. | Merging multicast abr and unicast abr with progressive download abr in a customer premises device within the same video delivery pipe |
US20170126583A1 (en) * | 2015-11-03 | 2017-05-04 | Le Holdings (Beijing) Co., Ltd. | Method and electronic device for bandwidth allocation based on online media services |
US20170347236A1 (en) * | 2009-07-08 | 2017-11-30 | Dejero Labs Inc. | System and method for providing data services on vehicles |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
ES2391017B1 (en) * | 2010-04-07 | 2013-10-09 | Vodafone España, S.A.U | PROCEDURE AND DEVICE TO REDUCE TRAFFIC CONGESTION IN RADIO NETWORK CONTROLLERS |
US10700772B2 (en) | 2014-09-08 | 2020-06-30 | Hughes Network Systems, Llc | Dynamic bandwidth management with spectrum efficiency for logically grouped terminals in a broadband satellite network |
-
2017
- 2017-11-27 US US15/823,476 patent/US11044208B2/en active Active
-
2018
- 2018-11-26 EP EP18830027.1A patent/EP3718272B1/en active Active
- 2018-11-26 WO PCT/US2018/062497 patent/WO2019104286A1/en unknown
Patent Citations (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7061861B1 (en) * | 2000-07-06 | 2006-06-13 | Broadband Royalty Corporation | Method and system for weighted fair flow control in an asynchronous metro packet transport ring network |
US20040218604A1 (en) * | 2001-05-26 | 2004-11-04 | Porter John David | Method and apparatus for communications bandwidth allocation |
US20040015602A1 (en) * | 2002-07-19 | 2004-01-22 | Roving Planet, Inc. | Network bandwidth allocation and access method and apparatus |
US20050071471A1 (en) * | 2003-09-30 | 2005-03-31 | International Business Machines Corporation | Automatic bandwidth control for file servers with a variable priority client base |
US20120230195A1 (en) * | 2006-01-31 | 2012-09-13 | Roundbox, Inc. | Reliable event broadcaster with multiplexing and bandwidth control functions |
US20080130495A1 (en) * | 2006-12-05 | 2008-06-05 | Latitude Broadband, Inc. | Methods And Systems For Dynamic Bandwidth Management For Quality Of Service In IP Core And Access Networks |
US20100322074A1 (en) * | 2008-03-03 | 2010-12-23 | Oki Electric Industry Co. Ltd. | Dynamic bandwidth allocation method and dynamic bandwidth allocation device |
US20100002579A1 (en) | 2008-07-02 | 2010-01-07 | Qualcomm Incorporated | Methods and systems for priority-based service requests, grants for service admission and network congestion control |
EP2376558A1 (en) | 2008-12-19 | 2011-10-19 | SABIC Innovative Plastics IP B.V. | Moisture resistant polyimide compositions |
US20170347236A1 (en) * | 2009-07-08 | 2017-11-30 | Dejero Labs Inc. | System and method for providing data services on vehicles |
US20110096665A1 (en) * | 2009-10-22 | 2011-04-28 | Motorola, Inc. | Methods and apparatus for controlling congestion in a communication network |
US20120140624A1 (en) * | 2010-12-06 | 2012-06-07 | Genband Inc. | Systems and methods for dynamic congestion management in communications networks |
US20130159494A1 (en) * | 2011-12-15 | 2013-06-20 | Cisco Technology, Inc. | Method for streamlining dynamic bandwidth allocation in service control appliances based on heuristic techniques |
US20130223222A1 (en) * | 2012-02-28 | 2013-08-29 | Cellco Partnership D/B/A Verizon Wireless | Dynamically provisioning subscribers to manage network traffic |
US20150049606A1 (en) | 2013-08-19 | 2015-02-19 | Verizon Patent And Licensing Inc. | Tier-based admission control for user equipment |
US20150288617A1 (en) * | 2014-04-07 | 2015-10-08 | Ericsson Television Inc. | Merging multicast abr and unicast abr with progressive download abr in a customer premises device within the same video delivery pipe |
US20170126583A1 (en) * | 2015-11-03 | 2017-05-04 | Le Holdings (Beijing) Co., Ltd. | Method and electronic device for bandwidth allocation based on online media services |
Non-Patent Citations (1)
Title |
---|
International Search Report and Written Opinion dated Feb. 13, 2019 by the International Searching Authority (European Patent Office) in PCT Application PCT/US2018/062497. |
Also Published As
Publication number | Publication date |
---|---|
EP3718272A1 (en) | 2020-10-07 |
US20190166067A1 (en) | 2019-05-30 |
WO2019104286A1 (en) | 2019-05-31 |
EP3718272B1 (en) | 2022-07-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US11044208B2 (en) | System and method for maximizing throughput using prioritized efficient bandwidth sharing | |
US11664888B2 (en) | Dynamic bandwidth management with spectrum efficiency for logically grouped terminals in a broadband satellite network | |
US11489559B2 (en) | Scheduling multi-user MIMO transmissions in fixed wireless access systems | |
RU2761596C2 (en) | Handover based on predicted network conditions | |
US10700771B2 (en) | Bandwidth management across logical groupings of access points in a shared access broadband network | |
US9722935B2 (en) | System and method for transmission management in software defined networks | |
EP3130191B1 (en) | Apparatus and method for an adaptive periodic bandwidth allocation approach in a shared bandwidth communications system | |
US8976690B2 (en) | Femto-relay systems and methods of managing same | |
EP2428090B1 (en) | Load estimation to meet a defined quality of service | |
US10200250B2 (en) | Distribution of a virtual network operator subscription in a satellite spot-beam network | |
US8730923B2 (en) | Method for controlling resource allocation in a wireless communication system | |
Atawia et al. | Robust resource allocation for predictive video streaming under channel uncertainty | |
Dimitrov et al. | Radio resource management techniques for high throughput satellite communication systems | |
Xiao et al. | Dynamic spectrum scheduling for carrier aggregation: A game theoretic approach | |
Ewaisha et al. | Power control and scheduling under hard deadline constraints for on-off fading channels | |
US11722432B1 (en) | Methods for managing multi-channel network traffic | |
Park et al. | Fair semi-distributed resource allocation scheme over relay-enhanced OFDMA networks | |
Budihal et al. | Framework for intercell interference avoidance in MIMO OFDMA system | |
Yang et al. | A dynamic strategy for packet scheduling and bandwidth allocation based on channel quality in IEEE 802.16 e OFDMA system | |
García-Morales et al. | Latency-Based 5G RAN slicing descriptor to support deterministic industry 4.0 applications | |
Mizuno et al. | Investigation on optimum frequency bandwidth allocation method among service channels for system throughput maximization | |
Ewaisha et al. | Dynamic scheduling for delay guarantees for heterogeneous cognitive radio users | |
Külzer et al. | Predictive resource allocation for automotive applications using Interference Calculus | |
Videv et al. | Energy efficient resource allocation in wireless systems with control channel overhead | |
Sun et al. | Low-complexity dynamic resource slicing for mixed traffics in virtualized radio access network |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
FEPP | Fee payment procedure |
Free format text: ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: BIG.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
AS | Assignment |
Owner name: WELLS FARGO BANK, NATIONAL ASSOCIATION - AS COLLAT Free format text: SECURITY INTEREST;ASSIGNOR:HUGHES NETWORK SYSTEMS, LLC;REEL/FRAME:044966/0156 Effective date: 20180215 Owner name: WELLS FARGO BANK, NATIONAL ASSOCIATION - AS COLLATERAL AGENT, NEW YORK Free format text: SECURITY INTEREST;ASSIGNOR:HUGHES NETWORK SYSTEMS, LLC;REEL/FRAME:044966/0156 Effective date: 20180215 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |
|
AS | Assignment |
Owner name: HUGHES NETWORK SYSTEMS, LLC, MARYLAND Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:XU, JUN;TORRES, ROBERT JAMES;BORDER, JOHN LEONARD;SIGNING DATES FROM 20171129 TO 20180328;REEL/FRAME:045650/0453 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |
|
AS | Assignment |
Owner name: U.S. BANK NATIONAL ASSOCIATION, MINNESOTA Free format text: ASSIGNMENT OF PATENT SECURITY AGREEMENTS;ASSIGNOR:WELLS FARGO BANK, NATIONAL ASSOCIATION;REEL/FRAME:050600/0314 Effective date: 20191001 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: FINAL REJECTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: ADVISORY ACTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |
|
AS | Assignment |
Owner name: U.S. BANK NATIONAL ASSOCIATION, MINNESOTA Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE REMOVE APPLICATION NUMBER 15649418 PREVIOUSLY RECORDED ON REEL 050600 FRAME 0314. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT OF PATENT SECURITY AGREEMENTS;ASSIGNOR:WELLS FARGO, NATIONAL BANK ASSOCIATION;REEL/FRAME:053703/0367 Effective date: 20191001 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: FINAL REJECTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE AFTER FINAL ACTION FORWARDED TO EXAMINER |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT RECEIVED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT VERIFIED |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |