BR112016028871B1 - APPARATUS AND METHOD FOR AN ADAPTIVE PERIODIC BANDWIDTH ALLOCATION APPROACH IN A SHARED BANDWIDTH COMMUNICATIONS SYSTEM - Google Patents

Abstract

APPARATUS AND METHOD FOR AN ADAPTIVE PERIODIC BANDWIDTH ALLOCATION APPROACH IN A SHARED BANDWIDTH COMMUNICATIONS SYSTEM An approach is provided for allocating bandwidth on a per terminal usage and per route group basis. inside, which optimizes bandwidth utilization. An aggregate average bandwidth utilization of a plurality of remote terminals over a wireless communications channel is determined. A maximum rate is determined for bandwidth allocations to each of the remote terminals for respective data transmissions over the channel. A usage metric is determined that reflects bandwidth usage by one of the remote terminals for data transmissions over the channel. An updated rate for bandwidth allocations for an endpoint is determined based on the utilization metric for the endpoint, a target bandwidth utilization and tolerance range for an endpoint, and the maximum rate for data allocations for each from remote terminals. The updated rate for bandwidth allocations for an endpoint is applied to (...).

Description

FUNDAMENTALS

[001] Global broadband satellite capabilities are increasing exponentially, and such capacity increases present unique challenges in associated Earth system and network designs. The objective of system designers, system operators and service providers is to support and provide efficient, robust, reliable and flexible services in a shared bandwidth network environment using high capacity satellite systems. For example, in a network with multiple remote nodes (e.g., remote terminals) using shared bandwidth to attempt to send data to the network, quality of service (QoS) is required on each network link in each direction. Furthermore, an appropriate bandwidth allocation mechanism is necessary to achieve QoS requirements for interactive traffic and to optimize channel utilization (e.g., to increase bandwidth availability while decreasing bandwidth waste). ). In the satellite network, for example, supporting delay-sensitive data traffic through the backlink or inbound route (the link from the remote terminal back to the gateway) presents significant challenges in managing network resources. Such challenges are due to several factors, including difficulty in balancing latency performance and channel efficiency (e.g., efficient bandwidth utilization). Delay- or latency-sensitive traffic of variable input rates (for example, regular or secure internet browsing - such as Hypertext Transfer Protocol (HTTP) and Secure HTTP (HTTPS)) is typically classified as an interactive class, which can be transmitted using bandwidth allocations based on periodic and high-priority backlog requests. Data traffic through terrestrial backhaul is also latency sensitive and bandwidth demanding.

[002] Furthermore, certain conditions may be present in such a system, such as: (1) the incidence of interactive applications that are more sensitive to latency (e.g., voice over Internet Protocol (VoIP) and internet browsing, which reflect a class of applications that require bursts of small bandwidth allocations when actively transmitting data, (2) interactive applications generally require minimal or no delay in transmitting data, thus requiring bandwidth to be effectively available instantaneously, (3 ) the inability for interactive applications to rely on allocated bandwidth in response to explicit bandwidth requests as packets arrive for transmission, (4) the difficulty in identifying bandwidth demands of interactive applications in advance, due the inherent randomness of user operations in such interactive applications; and (5) the inability to provide continuous dedicated bandwidth allocation to remote nodes.

[003] In the presence of such conditions, it becomes a challenge to satisfy the bandwidth requirement criteria for latency-sensitive applications. For example, such criteria may include utilization of request-based bandwidth allocation algorithms or approaches for allocating bandwidth while satisfying delay requirements for interactive traffic, the provision of continuous dedicated bandwidth to some predefined rate that satisfies such delay requirements (e.g., such would be inefficient in terms of channel utilization), and address dynamic changes in application bandwidth demands, and continue to make bandwidth allocations in a way that minimizes transmission delay and increases channel utilization. Furthermore, such criteria become even more demanding in a shared bandwidth access network with long round-trip propagation delay (e.g., a satellite network). For example, in a satellite network, supporting delay-sensitive data traffic in the link return direction (inward route) presents greater challenges in managing network resources, based, for example, on greater performance balancing difficulties. of latency and channel utilization (for example, a difficult balancing act presents when trying to allocate bandwidth that predicts the arrival of delay-sensitive traffic without significant underutilization of network resources).

[004] Current bandwidth-on-demand (BOD) systems or algorithms allocate bandwidth on an as-needed basis in an attempt to achieve optimal bandwidth or channel utilization efficiency, but thereby sacrificing efficiency in meeting requirements of latency-sensitive applications, or allocate a predetermined rate of bandwidth in an attempt to achieve efficiency in meeting the requirements of latency-sensitive applications, but thereby sacrificing channel utilization efficiency or optimal bandwidth. Other current methods apply a hybrid approach of these two previous methods, but do not achieve an efficient and satisfactory predictive balance (e.g., with a simple algorithm to provide additional predictive bandwidth to improve latency, while freeing up unnecessary bandwidth to improve efficiency). channel and bandwidth utilization). Furthermore, some current methods can apply a predictive periodic bandwidth approach, but cannot meet all criteria of bandwidth requirements for latency-sensitive applications (e.g., cannot optimize latency and bandwidth utilization both on the individual link of a terminal and in large systems). For example, in order to serve latency-sensitive traffic on the return channel (route in) in current systems by anticipating the arrival of delay-sensitive traffic to active endpoints, a gateway (GW) assigns a constant periodic bandwidth to such terminals above their respective demands. While this may serve to reduce traffic latency, however, it wastes bandwidth (e.g. when a terminal is receiving active periodic bandwidth but does not have a respective level of data (or any data) to send Furthermore, such an approach may also limit short-term throughput when a terminal experiences a sudden burst of delay-sensitive traffic that exceeds the constant periodic allocation.

[005] An example of the application of a periodic bandwidth allocation is with respect to HTTPS applications. HTTPS traffic requires a certain amount of periodic bandwidth to maintain reasonable latency. For example, in some cases, HTTPS traffic may require periodic bandwidth of 20kbps to 32kbps, assisted by backlog-based bandwidth allocations, to provide reasonably satisfactory latency performance. More specifically, on an inbound route with QPSK 4/5 rate modulation, 9 intervals of periodic bandwidth allocation every 2 frames would provide approximately 19.2 kbps, and 15 intervals every 2 frames would provide approximately 32kbps. Consequently, ideally, HTTPS traffic requirements of particular applications should be able to be satisfied by providing such a constant periodic rate. In reality, however, it is difficult to identify the particular applications/endpoints running HTTPS since the data packets are multiplexed at the link layer. Typically, therefore, current approaches allocate periodic bandwidth to all active endpoints so as not to degrade the performance of those endpoints executing secure HTTP transactions. Periodic bandwidth is then released when the network observes no activity from the endpoint for a pre-configured amount of time. As the number of subscribers grows, however, so does the number of active endpoints, which would force a reduction in periodic bandwidth allocations to the active endpoints and thus result in a degradation of HTTPS performance on those endpoints actually running applications. HTTPS. For example, if the periodic bandwidth allocation is reduced to 6 slots every 4 frames or 3 slots every 2 frames (at QPSK 4/5 rate) only a rate of 6.4 kbps is provided, which would be unsatisfactory. for endpoints running HTTPS applications. Additionally, for endpoints that do not run HTTPS applications, the full allocated periodic bandwidth is not used, resulting in inefficient low utilization of inbound route bandwidth. Other applications of periodic bandwidth allocation include internet browsing, interactive gaming, interactive streaming, and adaptive constant bitrate (CBR) services.

[006] What is needed, therefore, is a system and a method for resolving the challenges that provide an adequate bandwidth allocation mechanism in a shared bandwidth network environment, that satisfy QoS requirements for interactive traffic , while optimizing channel/bandwidth utilization.

SOME EXAMPLE MODALITIES

[007] The present invention advantageously addresses the foregoing requirements and needs, as well as others, by providing a bandwidth allocation approach (e.g., for a shared bandwidth network environment, such as a bandwidth satellite system). bandwidth) based on both per-endpoint utilization and route-in or per-route-in group considerations, which satisfy QoS requirements for interactive traffic while optimizing channel/bandwidth utilization.

[008] According to exemplary embodiments of the present invention, a method for bandwidth allocation approaches is provided. An aggregate average bandwidth utilization of a plurality of remote terminals over a channel of a wireless data communications system is determined. A maximum rate is determined for bandwidth allocations to each of the remote terminals for their respective data transmissions over the channel. A utilization metric is determined that reflects bandwidth usage by one of the remote terminals for its data transmissions over the channel. An updated rate for bandwidth allocations to a remote endpoint is determined based on the usage metric determined for the endpoint, a target bandwidth utilization and tolerance range for the endpoint, and the maximum rate determined for the endpoints. data allocations for each of the remote terminals. The updated rate for bandwidth allocations is applied to the remote endpoint for one or more subsequent bandwidth allocations to a remote endpoint.

[009] According to other example embodiments of the method, the method operates within one of two frequency ranges for bandwidth allocations to each of the remote terminals for respective data transmissions over the channel, and wherein a first Range A of the Rate Ranges serves as a lower range, and a second Range B of the Rate Ranges serves as an upper range. When the method is operating within Range A, (1) determining the updated rate for bandwidth allocations to a remote terminal comprises determining an updated allocation rate index based on the utilization metric determined for the terminal, the target bandwidth utilization and respective tolerance interval for the endpoint, and the maximum rate determined for data allocations to each of the remote endpoints, and (2) applying the updated rate to one or more subsequent bandwidth allocations for a remote terminal comprises obtaining the updated rate from a predetermined rate table based on the updated allocation rate index. When the method is operating within Range B, (1) determining the updated rate for bandwidth allocations to a remote terminal comprises determining a relative rate variation based on the utilization metric determined for the terminal, the bandwidth utilization target bandwidth and respective tolerance interval for the endpoint, and the maximum rate determined for data allocations to each of the remote endpoints, and (2) applying the updated rate to one or more subsequent bandwidth allocations to an endpoint remote comprises applying the rate step change to a current rate for bandwidth allocations to a remote terminal.

[0010] According to other example embodiments of the method, it is determined whether a transition point for a transition between Range A and Range B has been reached. When it is determined that the transition point has not been reached, the determination (1 ) of the updated rate for bandwidth allocations to a remote terminal, and applying (2) the updated rate to one or more subsequent bandwidth allocations to a remote terminal is carried out as specified in claim 2 based on the interval within which the method is operating. When it is determined that the transition point has been reached: (a) where the method is operating within Interval A, method operation is switched from Interval A to Interval B and the determination (1) of the updated rate for the allocations of bandwidth to a remote terminal, and applying (2) the updated rate to one or more subsequent bandwidth allocations to a remote terminal are performed as specified in claim 2 based on operation within Slot B; And (b) when the method is operating within Range B, operation of the method is switched from Range B to Range A, and the determination (1) of the updated rate for bandwidth allocations to a remote terminal and the Application (2) of the updated rate to one or more subsequent bandwidth allocations to a remote terminal are performed as specified in claim 2 based on operation within Slot A.

[0011] Still other aspects, features and advantages of the present invention are readily apparent from the detailed description that follows, simply illustrating a number of particular embodiments and implementations, including the best mode contemplated for carrying out the present invention. The present invention is also capable of other and different embodiments, and its various details may be modified in several obvious respects, all without departing from the spirit and scope of the present invention. Accordingly, the drawing and description should be considered as illustrative in nature, and not as restrictive.

BRIEF DESCRIPTION OF THE DRAWINGS

[0012] The present invention is illustrated by way of example, and not by way of limitation, in the figures of the attached drawings and in which similar reference numbers refer to similar elements and in which:

[0013] Figures 1A, 1B and 1C illustrate communications systems capable of employing approaches, according to exemplary embodiments of the present invention;

[0014] Figure 2 illustrates a flowchart representing an inner loop algorithm for periodically adapting rates for bandwidth allocations (on a per terminal basis), in accordance with exemplary embodiments of the present invention;

[0015] Figure 3 illustrates a flowchart depicting an outer loop algorithm for periodically adapting rates for bandwidth allocations (on a per-route-in or Route-Group-in basis), in accordance with exemplary embodiments. of the present invention; It is

[0016] Figure 4 illustrates a computer system in which example embodiments in accordance with the present invention can be implemented.

DETAILED DESCRIPTION

[0017] A bandwidth allocation approach (e.g., for a shared-bandwidth network environment, such as a shared-bandwidth satellite system), based on both per-terminal utilization and per-route considerations inward or inward route group, which satisfy QoS requirements for interactive traffic, while optimizing channel/bandwidth utilization, is described. In the description that follows, for purposes of explanation, numerous specific details are presented in order to provide a complete understanding of the invention. It is clear, however, that the invention can be practiced without these specific details or with an equivalent arrangement. In other cases, well-known structures and devices are shown in block diagram form so as to avoid unnecessarily obscuring the invention.

[0018] As will be appreciated, a module or component (as referred to herein) may be composed of software component(s), which is stored in a memory or other computer-readable storage medium and executed by one or more processors or CPUs of the respective devices. However, as will also be appreciated, a module may alternatively be comprised of hardware component(s) or firmware component(s), or a combination of hardware, firmware and/or software components. Furthermore, with respect to the various exemplary embodiments described herein, while certain of the functions are described as being performed by certain components or modules (or combinations thereof), such descriptions are provided as examples and are therefore not intended to be limiting. Accordingly, any of these functions can be viewed as being performed by other components or modules (or combinations thereof), without departing from the spirit and general scope of the present invention. Furthermore, the methods, processes, and approaches described herein may be implemented by processors utilizing processing circuits that may comprise one or more microprocessors, application-specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), or other devices. operable to be configured or programmed to implement the systems and/or methods described herein. For implementation in such devices that are operable to execute software instructions, the flowcharts and methods described herein may be implemented in processor instructions stored in a computer-readable medium, such as executable software stored in a computer memory store.

[0019] Furthermore, terminology referring to computer or computer-readable media as used herein refers to any media that participates in providing instructions to the processor of a computer or processor module or component for execution. Such a medium can take many forms, including but not limited to non-volatile non-transient media and volatile media. Non-volatile media include, for example, optical disk media, magnetic disk media, or electrical disk media (e.g., solid state disk or SDD). Volatile media include dynamic memory such as random access memory or RAM. Common forms of computer-readable media include, for example, floppy or floppy disk, hard disk, magnetic tape, any other magnetic medium, CD-ROM, CDRW, DVD, any other optical medium, random access memory (RAM), memory programmable read-only (PROM), erasable PROM, flash EPROM, any other memory chip or cartridge, or any other medium from which a computer can read data.

[0020] Figures 1A to 1C illustrate communications systems capable of employing a bandwidth allocation approach (e.g., for a shared bandwidth network environment, such as a shared bandwidth satellite system) which satisfies QoS requirements for interactive traffic, while optimizing channel/bandwidth utilization, according to various modalities. Referring to Figure 1A, a broadband communications system 110 includes one or more transmitters 112 (of which one is shown) that generate signal waveforms for transmission to one or more receivers 116 (of which one is shown). The signal waveforms are transmitted over a communications channel 114, which (for example) may comprise a channel of a terrestrial wireless or satellite communications system. In this discrete communications system 110, the transmitter 112 has a signal source that produces a discrete set of data signals, wherein each of the data signals is transmitted via a corresponding signal waveform. The discrete set of data signals may first be encoded (e.g., via a forward error correction code) to combat noise and other issues associated with channel 114. Once encoded, the encoded signals may then be modulated over a carrier for transmission over channel 114. The signal waveforms are attenuated, or otherwise altered, by communications channel 114.

[0021] Figure 1B illustrates an example of a satellite communications system 130 capable of supporting communications between terminals with varying capabilities, according to exemplary embodiments. The satellite communications system 130 includes a satellite 132 that supports communications between multiple satellite terminals (STs) 134a-134n, a number of gateways (GWs) 138a-138n, and a network operations center (NOC) 142. The STs , GWs and NOC transmit and receive signals through antennas 136a-136n, 146a-146n and 156, respectively. According to different embodiments, the NOC 142 may reside in a separate location accessible via a separate satellite channel or may reside within a GW location. The NOC 142 performs the management plane functions of the system 130, while the GWs 138a-138n perform the data plane functions of the system 130. For example, the NOC 142 performs functions such as network management and configuration, software downloads, (e.g., for STs 134a-134n), state monitoring, statistical functions (e.g., collection, aggregation, and reporting), security functions (e.g., key generation, management, and distribution), logging and authentication ST, and GW diversity management. The NOC 142 communicates with each GW via the satellite 132 or via a secure private communications network 152 (e.g., an IPsec tunnel over a dedicated link or a virtual private network (VPN) or IPsec tunnel over a public network, such as the Internet). It should be noted that, according to one example embodiment, the traffic classification approaches of embodiments of the present invention address traffic classification of data flowing through an aggregation point or node. Additionally, each GW and the NOC has connectivity to one or more public communications networks, such as the Internet or a PSTN.

[0022] According to another exemplary embodiment, each of the GWs 138a-138n includes one or more IP gateways (IPGWs) - whereby data plane functions are divided between a GW and the respective IPGWs. For example, GW 138a includes IPGWs 148a(1)-148a(n) and GW 138n includes IPGWs 148n(1)-148n(n). A GW can perform functions such as route coding and modulation out of the link layer and physical layer (e.g. DVB-S2 adaptive coding and modulation), route handling into the link layer and physical layer (e.g. IPOS), route-in bandwidth allocation and load balancing, route-out prioritization, internet acceleration and HTTP compression, flow control, encryption, redundancy switches, and traffic restriction policy enforcement. Thus, an inward route manager or inward route group manager (IGM) (not shown) can be located at each of the gateways. The IGM can be configured to control bandwidth allocations to remote endpoints (e.g., on a route-in or route-in group basis) and to correspondingly control and manage bandwidth allocation approaches. provided in accordance with exemplary embodiments of the present invention. Furthermore, as would be appreciated, in certain embodiments, the IGM may be implemented in a distributed form, with a master controller in the NOC 142, whereby the NOC may be configured to administer system-wide controls for such bandwidth allocation approaches. band, whereby route-in based controls would be administered for specific routes-in/route-in groups by the IGM on the respective gateway that controls such routes-in/route-in groups. Various other architectures can also be provided to satisfy the respective objectives and design requirements of different systems.

[0023] The IPGW can perform functions such as data compression, TCP performance improvements (e.g., TCP performance improvement proxies such as TCP spoofing), quality of service functions (e.g. example, classification, prioritization, differentiation, random early detection, TCP/UDP flow control), bandwidth usage policing, dynamic load balancing, and routing. Additionally, a GW and respective IPGW may be co-located with the NOC 142. The STs 134a-134n provide connectivity to one or more hosts 144a-144n and/or routers 154a-154n, respectively. The satellite communications system 130 may function as a bent tube system, where the satellite essentially operates as a repeater or bent tube. Alternatively, system 130 may employ a switching or processing satellite supporting mesh communications (point-to-point communications directly between, for example, the two STs 134a and 134n).

[0024] In a bent-tube system of an example embodiment, satellite 132 functions as a repeater or bent-tube and communications to and from STs 134a-134n are transmitted via satellite 132 to and from respective IPGWs associated with Private STs. Furthermore, in a spot beam system, any spot beam acts as a bent tube for the geographic region covered by the beam. For example, each spot beam functions as a bent-tube communications channel to and from STs and/or IPGW(s) within the geographic region covered by the beam. Consequently, signal transmissions to the satellite are either from an ST and destined for an associated gateway, or from a gateway and destined for an associated ST. According to one embodiment, multiple GWs/IPGWs are distributed across the geographic region covered by all spot beams of satellite 132, where, in a beam in which a GW (and respective IPGWs) is located, only the one GW (and no ST) occupies this beam. Additionally, each IPGW can serve as an aggregation node for a multitude of remote nodes or STs. The total number of GWs/IPGWs, and the geographic distribution of the GWs/IPGWs, depends on a number of factors, such as the total dedicated satellite capacity for data traffic, geographic traffic loading of the system (e.g., based on densities population and geographic distribution of STs), locations of available terrestrial data centers (e.g. terrestrial data trunks for access to public and private dedicated networks).

[0025] More specifically, with reference to Figure 1C, for example, for data communication from ST 134a to a public communications network 158 (e.g., the Internet), ST 134a is associated with an IPGW (e.g., example, IPGW 148a(1) - selected from a set of IPGWs available for the ST 134a, such as IPGWs 148a(1)-148a(5) - where the set of IPGWs is a suitable subset of IPGWs 148a(1)-148a (n) located in GW 138a). The data is first transmitted, via satellite 132, from the ST 134a to the associated IPGW 148a (1). The IPGW 148a (1) determines the destination to be the Internet 158. The IPGW then repackages the data (e.g., as a TCP/IP communication) and forwards the data communication, over the terrestrial link 164, to the Internet 158. Additionally, in a corporate network, for example, a corporation can deploy several remote STs in remote offices. More specifically, ST 134n, located at a remote corporate location, may wish to communicate securely with corporate headquarters 162. Accordingly, for data communication from ST 134n to corporate headquarters 162, data is first transmitted, via the satellite 132, from ST 134n to an IPGW associated with ST 134n (e.g., IPGW 148a (5)). The IPGW 148a(5) determines the destination to be the corporate headquarters 162. The IPGW then repackages the data (e.g., as an IPsec communication) and forwards the IPsec data communication over the secure terrestrial links 166 (through the private network 152), to the corporate headquarters 162. In the corporate network scenario, another example involves a corporate communication from the corporate headquarters to a number of remote locations (e.g., a multicast communication to STs 134a-134n) - where STs 134a-134n are correspondingly associated with the two IPGWs 148a (1) and 148a (5) (e.g., grouped between the two IPGWs based on load balancing and IPGW capabilities). In this scenario, a gateway or router, within the corporate headquarters local network 162, transmits data communication, via secure terrestrial links 166 (via private network 152), to the IPGWs 148a (1) and 148a (5). The IPGWs determine that the communication is intended for remote STs 134a-134n, and package the data as a multicast communication directed to the community of STs 134a-134n. The IPGWs then transmit the data communication via satellite 132 for decoding by the community of STs 134a-134n. Consequently, the satellite of such a system acts as a folded tube or repeater, transmitting communications between the ST 134a-134n and the respective associated IPGWs 148a-148n.

[0026] According to exemplary embodiments, an approach is provided for adaptively allocating return channel (route in) bandwidth to remote terminals based on their respective utilization levels. By way of example, the Inward Route Group Manager (IGM) can adaptively adjust the bandwidth allocated to an endpoint based on its bandwidth utilization. As an additional example, by defining a target usage for each terminal, the IGM monitors the calculated bandwidth usage, allocating more slots when usage is high and fewer slots when usage is low. In this way, both channel efficiency and latency performance are significantly improved. Although in practice it may be sufficient to provide satisfactory latency performance for HTTPS using relatively low route-in throughput allocations, other interactive applications would require a higher route-in throughput. Embodiments of the present invention therefore provide approaches that support both low and high periodic inward rate adaptations. By way of example, an appropriate indexed bandwidth allocation set is predefined, such as through a periodic bandwidth allocation table (PBA table), covering very light traffic and sufficiently satisfactory latency performance of HTTPS on the route inside. Additionally, a relative pitch-based rate control mechanism is provided to satisfy the need for higher inbound route bandwidth rate requirements. Additionally, a rate adaptation method can be included to improve HTTPS and interactive latency and bandwidth utilization (channel efficiency) while maintaining the overall use of periodic allocation at the system level.

[0027] Such approaches thus overcome the previous disadvantages by adaptively adapting the amount of bandwidth allocated periodically to a terminal based on its usage. For example, more bandwidth is allocated to some endpoints relative to others by basing predictions of future needs on their observations of past bandwidth usage. Furthermore, bandwidth resource utilization is optimized, for example, by dynamically limiting the available bandwidth for such adaptive periodic allocations, ensuring bandwidth availability for other applications, such as delay-insensitive applications. Accordingly, exemplary embodiments of the present invention provide significant improvements in bandwidth allocation approaches or algorithms by providing remote terminals with bandwidth beyond their current demand, as a dynamic function of (a) respective utilization by a terminal of this predictive bandwidth, and (b) the general state of available bandwidth resources on the network. Furthermore, example embodiments optimize system performance in terms of latency and channel/bandwidth utilization efficiency, as well as implementing fairness between endpoints with heterogeneous traffic classes.

[0028] According to exemplary embodiments of the present invention, an approach for periodic rate adaptation for bandwidth allocation comprises an interior traffic control circuit and an exterior traffic control circuit. According to the inner circuit, bandwidth is allocated to a remote terminal based on usage/utilization. Therefore, the inner circuit addresses bandwidth allocation/utilization on a per-terminal basis. According to the outer circuit, the total bandwidth for the respective periodic allocations is controlled for all active terminals of (for example, all active terminals of a group of an inward route). Thus, the outer circuit addresses bandwidth allocation/utilization in the aggregate of all terminals. Additionally, the outer loop can be applied on either a per-route-in basis or a per-route-ingroup level basis. I. Inner Loop Rate Control

[0029] Figure 2 illustrates a flow chart describing an inner loop algorithm for periodically adapting bandwidth allocation rates (on a per terminal basis), in accordance with exemplary embodiments of the present invention. In accordance with these exemplary embodiments, in accordance with the inner loop, the IGM monitors the range utilization of a given terminal by determining an average volume or range utilization of this terminal over a given period of time. Then, based on a comparison of the determined average utilization against a predefined target utilization, the IGM adaptively adjusts the bandwidth allocated to the endpoint based on actual endpoint usage. In other words, if a terminal's bandwidth utilization is less than a target percentage of a threshold, then the bandwidth allocated to the terminal may be decreased, and if a terminal's bandwidth utilization is above of a target percentage or threshold then the bandwidth allocated to that terminal can be increased. In this regard, additional bandwidth that will not be used by a terminal will not be allocated to that terminal, and the terminal will not be throttled to the point that the quality service that can be obtained by the terminal is below a desired level. . By way of example, utilization determination can be performed on a periodic basis in order to dynamically adapt bandwidth allocation and bandwidth utilization based on the changing needs of each endpoint. Therefore, in accordance with the inner circuit, bandwidth utilization is maximized on a per-terminal basis. By way of further example, the bandwidth allocation for a specific terminal, as necessary, may be increased or reduced on a step-by-step basis so as not to unnecessarily increase the bandwidth allocation for a terminal beyond of a point through which the terminal will achieve target utilization, or so as not to unnecessarily decrease bandwidth allocation for a terminal beyond a point at which the quality of service that can be obtained by the terminal is below a level wanted.

[0030] According to an example embodiment, the inner loop rate control considers adaptive bandwidth allocation for an individual terminal based on two phases. A first phase for a low rate interval, in the form of M intervals every N frames (hereinafter referred to as "Interval A"), and a second phase for a high rate interval, in the form of M intervals per each frame (hereinafter referred to as "Interval B"). By way of example, when a relatively large number of remote terminals are active or in service, the network could operate in Slot A (bandwidth reduction per terminal to ensure there is sufficient capacity to meet the needs of each terminal), while whereas, when the number of active terminals is relatively less, the network can run in Interval B, (a larger allocation can be available for each terminal, because there are fewer terminals to serve). A. Ranges A and B

[0031] According to this embodiment, a Periodic Bandwidth Allocation table is first defined or predetermined for Interval A. By way of example, Table 1 reflects such a predetermined Periodic Bandwidth Allocation Table. According to the table, the range rate for Range A table is separated into a series of rate steps across the entire range, and each rate step is assigned a respective bandwidth allocation index (shown first in the table). Each rate index is associated with a rate specified as a number of intervals assigned to a terminal over a respective number of frames within a given period, where the period reflects the time interval between adjustment of the rate assigned to a terminal . The index is merely used to represent and associated with the predefined allocation rate for the respective terminal, where the allocation rate is in the format of M intervals every N frames, denoted as "M/N". The next four columns of the table reflect example information bitrates achieved based on the respective allocation rate and applied modulation and coding scheme ("modcod"), which are provided as examples for demonstration purposes only. By way of example, when configured in the system, the predetermined rates in the table would take into account the applicable modcod schemes, so that the rates accommodate the current information rate of the respective terminal. Furthermore, both the rate index number and the "M/N" value of each entry are provided as examples, and in practice are subject to a desired setting. Table 1. Route-in Periodic Bandwidth Allocation Table (Range A)

[0032] According to other embodiments, in cases where a terminal requires a more constant rate or range allocation (e.g., for time-sensitive information or applications that require a constant bit rate, such as voice over IP), An amount of system bandwidth may be reserved for such high-priority or constant bitrate requirements.

[0033] Furthermore, with reference to Table 1, the largest index is 12, corresponding to 8 intervals each frame. Therefore, above this rate, an integer number of intervals in a single frame can be assigned, instead of multiple non-overlapping frames of Interval A. According to this embodiment, therefore, Interval B can be defined as the rates above the index maximum in Range A, whereby a relatively predetermined step size would be defined for further adjustment of rates beyond those in Range A. In other words, relative step size (e.g., 5%) would be applied to incrementally adjust the rate of bandwidth allocation (on a per endpoint basis), for each update period. A rate adjustment would thus be accomplished by increasing or decreasing the current rate by the relative step size, which would result in a new rate in the form of an integer number of steps per frame. B. Terminal Bandwidth Utilization

[0034] According to this embodiment, two approaches are provided for determining the respective bandwidth utilization of a terminal. A first approach bases utilization determination on terminal usage of ranges periodically allocated in each frame (Range Utilization), while a second approach bases utilization determination on terminal volume usage (e.g., in bytes) (Range Utilization). Volume). Interval usage targets periodic usage. As bandwidth allocations and burst size increase, however, the slot utilization approach decreases the accuracy of how all allocated slots are counted even though not all are utilized for high-priority delay-sensitive traffic. In such cases, volume utilization provides more accurate usage estimation.

(1) Range Usage

[0035] According to the slot utilization approach, slot utilization is defined as a ratio of the number of slots used by a terminal during a configured period (e.g., measured in frames) and the number of slots assigned to the terminal during this period. For example, the IGM may determine the utilization of assigned slots by examining the slot usage of the respective burst transmitted by the terminal. While an assigned burst carries data (of any traffic type), the corresponding slots within this burst are all considered to be used. The configured period is referred to as the Average Period. The averaging period, for example, must cover at least one satellite propagation round-trip time (RTT) (e.g., which, for a geosynchronous system, may be approximately 600 to 700 ms), and must be set to a maximum such that the IGM can dynamically adjust the allocation rate to accommodate changes in terminal utilization. For example, a typical default value for the average period might be 40 frames.

[0036] By way of example, where t represents time (e.g., specified as a frame point) and TAvg denotes the averaging period (e.g., specified as a number of frames), the use of average interval in time t (n(t)) can be determined as follows (S201 of Figure 2): In equations (1) and (2) above, Ak is the number of slots allocated to frame k (by Periodic Allocation), and Uk is the number of slots in frame k being used.

[0037] For example, periodically allocated slots may be placed together with other allocations (e.g., on a backlog basis) - where a terminal is exhibiting a high backlog. , additional bandwidth may be assigned to that endpoint to alleviate such backlogs). When the expected burst arrives at the IGM, the number of intervals used in the transport data may be greater. For consistency, set Uk = Ak if the burst has the desired data type (e.g. Interactive), otherwise Uk = 0 if the burst does not have that data type. One way to determine whether the burst has the desired type is to look at the number of bytes for a given priority type. For example, if the number of bytes for priority 1 is non-zero, then Uk = Ak for frame k; Otherwise, Uk = 0. Note from the above equations, n(t) is obtained based on a sliding window TAvg. The initial value is set to zero.

(2) Volume Usage

[0038] According to the volume utilization approach, a burst received at the IGM contains the data volume (in bytes) for each data traffic priority level, which can serve as the basis for deriving a volume utilization measurement . Consequently, since the used volume indicated by burst represents all slots allocated in this table by periodic allocation, backlog-based allocation, and other allocations, a count of all relevant slots can be used in calculating volume utilization.

[0039] By way of example, where t represents time (e.g., specified as a frame point) and TAvg represents the averaging period (e.g., specified as a number of frames), the time-averaged volume utilization ( n(t)) It can be determined as follows (S211 of figure 2):

[0040] In equations (3) and (4) above, Valloc,k is the bandwidth allocated in frame k for the desired traffic type (where, for example, latency-sensitive traffic can be classified as Interactive) in bytes (converted from ranges based on code rate), and Vrecv,k is the received volume in bytes (including overhead) for this type of traffic in the burst in frame k. Furthermore, in addition to periodic bandwidth allocations, Valloc,k may include other allocations, such as backlog-based allocations and other bandwidth allocations. Furthermore, Vrecv,k can also consider overhead, e.g.

C. Rate Adaptation

[0041] According to the present embodiment, rate adaptation for the terminal refers to the process by which the IGM adaptively allocates bandwidth to a terminal based on terminal bandwidth utilization, whereby the allocations can be modified on a periodic basis to address changes in terminal bandwidth utilization over time. As discussed above, the adaptive bandwidth allocation approach of the present embodiment applies bandwidth allocation based on two rate ranges for bandwidth allocation - (1) Range A (a range of relatively lower rates) , which is based on a table of applicable rate steps for bandwidth allocation within the total rate range (see, for example, Table 1), and displays smaller, predefined step sizes; and (2) Interval B (a range of relatively higher rates, above the highest rate of Interval A), which is based on a configurable and potentially larger step size. (1) Inner Circuit in Interval A

[0042] In accordance with this embodiment, an algorithm is provided for adaptive periodic rates for bandwidth allocation, relative to rates within Lower Range A, on a per terminal basis (the Inner Circuit Rate Adaptation for Range A). A) as follows. In this algorithm, ntar reflects the target utilization for a terminal, and θ reflects a respective tolerance range. The current index number from the bandwidth allocation rate table is denoted as i, where 1 < i < Imax and Imax < max (itemset), where Imax is the index of the maximum periodic rate for an endpoint (where this maximum periodic rate, at a given time, may be a lower rate than the maximum rate in the allocation rate table - this may be due to the fact that the outer circuit has restricted the maximum rate allowed for any terminal within the group route inward (e.g., based on total bandwidth availability). In Table 1, the maximum (itemset) = 12. The maximum and minimum index of the itemset is denoted as Iupper and Ilower. Thus , in Table 1, Iupper = 12 and Ilower = 1. Basically, Iupper represents the size of the table and is the upper limit of Imax. A configurable update period is defined, which is denoted as Tupdate. For example, the default value for Tupdate can be set to 12 frames. The rate adaptation algorithm can be expressed as follows (S203 of Figure 2), where n(t) represents the interval or volume utilization (determined as given above for terminal k at time or frame point t) and Ik(t) represents the new index (to be applied to terminal k until expiration of the next update period). When t is a multiple of Tupdate (when t is at a point where the period of Tupdate has passed), that is, Mod(t, T update) = 0,

[0043] In other words, for each equation (6), when the current utilization is higher than the target utilization plus upper tolerance (the terminal is using more bandwidth than the target allocation/tolerance), the rate for allocations to the terminal should be increased to bring it within the target usage range plus tolerance (S209 / S219 of Figure 2). In this case, the index is increased within the table by one step, but not higher than the maximum allowed index. Similarly, for equation (7), when the current utilization is less than the target utilization minus the lower tolerance (the terminal is using less bandwidth than the target allocation/tolerance), the rate for allocations to the terminal should be decreased to bring it within the range of target use minus tolerance (S209 / S219 of Figure 2). In this case, the index is decreased by one step, but not less than index 1. According to equation (8), when the current utilization is within the target range plus/minus the upper tolerance/lower tolerance, the rate for allocations for the terminal must remain unchanged (S209/S219 of Figure 2).

[0044] By way of example, the default value for targeted usage can be set to ntar = 90% (0.90), and the default values for the upper and lower tolerance range can be set to θupper = θlower = 5 % (0.05) (Note that θlower and θupper may have different values). The initial rate of Ik(t) can be set to 20kbps (in Table 1, for t = 1, Ik(1) = 9). By way of further example, Imax can be set smaller than max(itemset) so that when a large number of terminals appear, the maximum route-in rate becomes smaller, accommodating more users. The determination of Imax is discussed below, for example, with respect to the outer circuit bandwidth allocation adaptation process. (2) Inner Circuit in Interval B

[0045] In accordance with this embodiment, an algorithm is provided for adaptive periodic rates for bandwidth allocation, relative to rates within Upper Range B, on a per terminal basis (the Inner Circuit Adaptation for Range B). as follows. In Interval B, by applying a relative step size, the rate can be adjusted by increasing or decreasing the relative step size, obtaining a new rate, in the format of an integer number of intervals per frame. The rate adaptation algorithm can be expressed as follows (S213 of Figure 2). For this algorithm: Nslot,upper and Nslot,lower (in slots per frame) are defined as the configurable upper and lower bounds for the rate of allocations within Slot B, and Nslot,max is the maximum number of slots per frame that can be assigned to a terminal, where Nslot,lower < Nslot,max < Nslot,upper. By way of example, Nslot,max can be determined at runtime by the outer loop process (discussed below). Furthermore, Δinner denotes the relative step size of the inner circuit, Nslot(k) denotes the adapted number of slots per frame to be set in update period k, and Tupdate again reflects the configurable update period. When t is a multiple of Tupdate (when t is at a point where the period of Tupdate has passed), i.e.

[0046] In other words, for each equation (9), when the current utilization is greater than the target utilization plus upper tolerance (the terminal is using more bandwidth than the target allocation/tolerance), the rate of allocations to the terminal must be increased to bring it within the target usage range plus tolerance. In this case, the rate of slots allocated per frame is increased by the relative step size, but not greater than the maximum slots allowed per frame. Similarly, for equation (10), when the current utilization is less than the target utilization minus the lower tolerance (the terminal is using less bandwidth than the target allocation/tolerance), the rate of allocations for the terminal should be reduced to place it within the range of target use minus tolerance. In this case, the rate of slots allocated per frame is decreased by the relative step size, but not less than the minimum slots allowed per frame. According to equation (11), when the current utilization is within the target range plus/minus the upper tolerance/lower tolerance, the rate for allocations to the terminal should remain unchanged.

[0047] By way of example, the lower Nslot value is set to the maximum rate in the adaptation table (Table 1) so that the transition between table-based and step-based adaptations is perfectly smooth. If necessary, target utilization, tolerance interval and step size can be defined on a terminal basis, which can be determined by service and terminal types. As will be appreciated, in general, if the target utilization is low and the upward step size is large, then delay performance may be better.

[0048] By way of further example, for a consumer-grade endpoint (as opposed to a business-grade endpoint) running HTTP or HTTPS, traffic is delayed and jitter-tolerant, so target usage can be defined further. high. For a business-grade terminal running delay-sensitive traffic, such as terrestrial backhaul for VOIPs or interactive video streaming, the target utilization and step size must be appropriately defined to meet the target delay and jitter. The relationship between latency, utilization and step size can be explored further by considering traffic characteristics and circuit delays. Additionally, for enterprise terminals subject to a group limit (e.g., a group of terminals with a plurality of terminals that subscribe to a maximum rate), the maximum rate allowed per terminal may be controlled such that the throughput of the entire group of terminals is limited. We can add a scaling factor to meet this requirement.

[0049] According to other embodiments, because the usage parameters, tolerance range, and step size are configurable, three sets of the same parameters can be defined to accommodate different needs, given as delay-sensitive, delay-insensitive, and types general. An endpoint can be assigned a set at runtime subject to the endpoint type and QoS requirements. Furthermore, to support converged services (including consumer and enterprise), the above rate control algorithm can be like this: ntar, θupper , θlower can indicate the upper and lower utilization and tolerances, and Δinner,up and Δinner,down denote the relative upward and downward step sizes of the inner circuit. A set of three-tuple parameters (ntar, Δinner,up, Δinner,down) are configured, which can fit delay-sensitive, non-delay-sensitive, and general terminal QoS requirements. The three sets of parameters can be pre-configured based on evaluation of latency and throughput performance. Furthermore, Nslot(k) is the number of slots per frame in update period k, and F(t) is the scaling factor applicable to each terminal at time t. When time t (in frames) is a multiple of Tupdate, that is, Mod(t, Tupdate) = 0 and Nslot,lower < Nslot (k) — Nslot ,max (k)

[0050] By way of example, the lower Nslot value is set to the maximum rate in the adaptation table (Table 1) so that the transition between table-based and step-based adaptations is perfectly smooth. By way of further example, F can be time-varying or configurable - where, if F is configurable, then the default value can be F = 1. (3) Transition between Intervals A and B

[0051] To ensure smooth transition between Ranges A and B, the lowest rate in Range A must be adjusted in the same way as the highest rate in Range B, i.e., Nslot,lower = Rate (Iupper), where Rate (Iupper) in Table 1 must be an integer. When Nslot,lower in Interval B or Iupper in Interval A is reached (S205 / S207 / S215 / S217 of Figure 2): (1) if the direction is up, then Adaptation Scheme B is used; (2) if the direction is down, then Adaptation Scheme A is used; (3) Otherwise, the assigned rate is unchanged. According to other embodiments, either Range A or B may be deactivated. For example, to disable Adaptation Range B, Nslot,upper = Nslot,lower = Rate (Iupper) can be set in the configuration, and to disable Adaptation Range A, all items in Table 1 can be set to Nslot ,bottom. Consequently, by configuring the items in Table 1, and Nslot,lower and Nslot,upper, the inward route rate can be adjusted adaptively over a wide range. II. Outer Circuit Rate Control

[0052] Figure 3 illustrates a flowchart depicting an outer loop algorithm for periodically adapting rates for bandwidth allocations (on a per-route-in or Route-Group-in basis), in accordance with exemplary embodiments. of the present invention. In accordance with these example embodiments, in accordance with the outer circuit rate control mechanism, a maximum rate applicable to all terminals in an inward route or inward Route Group is determined for Periodic Allocation. IGM maintains overall periodic bandwidth usage against the total available route-in resources based on a predefined target. According to exemplary embodiments, the following approach to outer circuit adaptive rate control for bandwidth allocation is applicable on either a per route inward basis or a per Route Group inward basis.

[0053] By way of example, when the network is congested, the bandwidth allocated to periodic allocation should be limited such that some large volume bursts can be transmitted at a faster speed through on-demand allocation. This can also be achieved through a control mechanism that attempts to meet a target that is predefined for the periodic allocation usage portion. The periodic usage portion is defined as the ratio of total intervals in a period assigned to periodic and the total available intervals (in route total) in that period. If the overall portion of the periodic allocation is greater than the predefined target, the upper limit of the adaptive rate is reduced until the lower limit is reached; Otherwise, it is increased until the upper limit is reached. If the usage portion is within the target tolerance range, the upper limit remains intact.

[0054] In accordance with this embodiment, an algorithm for adaptive bandwidth allocation is provided, with respect to rates on a per-route-in or Route-in-Group basis (the Outer Circuit Rate Adaptation) as follows. According to this algorithm, Uperiodic(t) denotes the usage or utilized portion of the periodic allocation over all available bandwidth (route-in intervals per frame over the route-in or Route-in Group), excluding assignments to CBR(VOIP) at time t (specified in frames). Additionally, TPAVG denotes the averaging period (in frames) for the usage portion of the periodic allocation, and TPAVG(t) denotes the average usage during the TPAVG averaging period, calculated at time t (frames). For example, the default value for TPAVG can also be set to 40 frames. In this context, the average usage/usage at time t, UPAVG(t), is determined as follows (S301 of Figure 3):

[0055] Accordingly, Outer Circuit rate control mechanism is provided to achieve this target. According to this embodiment, again adaptation is applied over ranges A and B. In this regard, for Range A, an upper rate limit for application is determined as the maximum rate that can be applied on a per terminal basis. according to the allocation rate table for Range A (for example, Table 1), as represented by the table index. Additionally, for Slot B, an upper rate limit is determined for application as the maximum rate (in number of slots per frame) that can be assigned to a particular terminal, according to a Slot B allocation. Outer circuit is to adjust the upper rate limit, either in Slot A or Slot B, based on the global range usage in the Inward Route or Inward Route group. A. Outer circuit in Interval A

[0056] For the Interval A outer loop algorithm of the present embodiment, Utar denotes the periodic allocation target for the route-in or Route-in group, and δlower and δupper respectively reflect the lower and upper tolerances for the allocation/ target use. Furthermore, as discussed above, UPAVG(t) reflects the average utilization/usage at time t. Furthermore, Imax (again) denotes the maximum periodic rate index (e.g. which is limited by the maximum rate in the index table, i.e. Imax < maximum item in the index table)). Imax is updated based on general periodic usage. Additionally, as with the terminal inner loop process, Tp_update denotes the update period for the rate limit for periodic allocation. Similarly, the default value might be Tp update = 12 frames. In this context, the Slot A outer loop algorithm is provided as follows (S303 of Figure 3). When time t (in frames) is a multiple of Tp_update, i.e. Mod(t, Tp_update) = 0,

[0057] In other words, for each equation (17), when the current allocation is greater than the target allocation plus upper tolerance (the current allocation is greater than the target allocation/tolerance), the maximum rate for allocations per terminal must be reduced to bring the total allocation within the range of the target allocation plus tolerance (S309 / S317 of Figure 3). In this case, the maximum rate for allocations per endpoint (reflected by the table index) is decreased one step from the previous maximum, but not lower than the minimum table index. Similarly, for equation (18), when the current allocation is less than the target allocation minus the lower tolerance (the current allocation is less than the target allocation/tolerance), the maximum rate for allocations per terminal should be increased to bring the total allocation within the target allocation range minus tolerance (S309/S317 of Figure 3). In this case, the maximum rate for allocations per endpoint (reflected by the table index) is increased one step from the previous maximum, but not higher than the maximum table index. According to equation (11), when the current allocation is within the target range plus/minus the upper tolerance/lower tolerance, the maximum rate for allocations per endpoint should remain unchanged (S309/S317 of Figure 3).

[0058] By way of example, the Imax(t) index remains intact during the interval between two update times. The default value for targeted utilization is configurable and can be set, for example, as Utar= 55% (0.55). By way of further example, the default values for the upper and lower tolerance can be defined, for example, as δlower = δupper = 5% (0.05). (note that they may have different values). Furthermore, the initial value of Imax can be set to be equal to Iupper. B. Outer circuit in Interval B

[0059] For the Slot B outer loop algorithm of the present embodiment, Nslot,upper and Nslot,lower reflect configurable upper and lower rate limits. Additionally, Δouter reflects a configurable relative step size. In this context, the Slot B outer loop algorithm is provided as follows (S311 of Figure 3). Furthermore, again, UPAVG(t) reflects the average utilization/usage at time t. When time t (in frames) is a multiple of Tp_update, i.e. Mod(t, Tp_update = 0, (t is in period k),

[0060] Furthermore, for the Interval B outer loop control algorithm, the control parameters may be the same as for the Interval A algorithm. C. Transition between Intervals A and B

[0061] As with the Inner Circuit control algorithm of the present embodiment, to ensure a smooth transition between the A and B ranges of the outer circuit, Nslot,lower must be set equal to the Rate (Iupper). When Nslot,lower in Interval B or Iupper in Interval A is reached (S305 / S313 of figure 3): (1) if the direction is up, then the outer loop algorithm for Interval B (S307 / S315) is used. from figure 3); (2) if the direction is down, then the outer loop algorithm for Interval A (S307 / S315 in figure 3) is used; (3) otherwise, the maximum required rate remains unchanged (S307 / S315 of Figure 3). Additionally, similar to inner loop control, to disable the outer loop for Range B, Nslot,lower = Nslot,upper = Rate (Iupper) can be set in the configuration, and to disable the outer loop for Range A, All items in Table 1 can be configured as Nslot,lower. Consequently, the same parameter settings to disable the inner circuit would work in the same way for the outer circuit.

[0062] Figure 4 illustrates a computer system in which example embodiments in accordance with the present invention can be implemented. The computer system 400 includes a bus 401 or other communication mechanism for communicating information, and a processor 403 coupled to the bus 401 for processing information. Computer system 400 also includes main memory 405, such as a random access memory (RAM) or other dynamic storage device, coupled to bus 401 to store information and instructions to be executed by processor 403. Main memory 405 also may be used to store temporary variables or other intermediate information during execution of instructions to be executed by processor 403. Computer system 400 further includes a read-only memory (ROM) 407 or other static storage device coupled to bus 401 to store static information and instructions to the processor 403. A storage device 409, such as a magnetic disk or optical disk, is additionally coupled to the bus 401 to store information and instructions.

[0063] Computer system 400 is coupled via bus 401 to a display 411, such as a cathode ray tube (CRT), liquid crystal display, active matrix display, or plasma display, to display information to a user. computer. An input device 413, such as a keyboard including alphanumeric keys and other keys, is coupled to bus 401 to communicate information and command selections to processor 403. Another type of user input device is cursor control 415, such as a mouse, trackball, or cursor direction keys to communicate direction information and command selections to processor 403 and to control cursor movement on display 411.

[0064] In accordance with one embodiment of the invention, dynamic and flexible architectures and methods for associating remote nodes with respective aggregation nodes, in accordance with exemplary embodiments, are provided by computer system 400 in response to processor 403 executing a array of instructions contained in main memory 405. These instructions may be read into main memory 405 from another computer-readable medium, such as storage device 409. Execution of the array of instructions contained in main memory 405 causes the processor to 403 perform the process steps described here. One or more processors in a multiprocessing arrangement may also be employed to execute instructions contained in main memory 405. In alternative embodiments, wired circuits are used instead of or in combination with software instructions to implement the embodiment of the present invention. Accordingly, embodiments of the present invention are not limited to any specific combination of hardware and software circuits.

[0065] Computer system 400 also includes a communication interface 417 coupled to bus 401. Communication interface 417 provides two-way data communication coupling to a network link 419 connected to a local area network 421. For example , the communications interface 417 may be a digital subscriber line (DSL) card or modem, an integrated services digital network (ISDN) card, a cable modem, or a telephone modem for providing a data communications connection to a corresponding type of telephone line. As another example, communications interface 417 may be a local area network (LAN) card (e.g., for Ethernet™ or an Asynchronous Transfer Mode (ATM) network) to provide a data communications connection to a LAN compatible. Wireless links can also be implemented. In any such implementation, communications interface 417 sends and receives electrical, electromagnetic, or optical signals that carry digital data streams representing various types of information. Furthermore, the communication interface 417, for example, includes peripheral interface devices such as a USB (Universal Serial Bus) interface, a PCMCIA (Personal Computer Memory Card International Association) interface, etc.

[0066] Network link 419 typically provides data communication over one or more networks to other data devices. For example, network link 419 provides a connection through local network 421 to a host computer 423 that has connectivity to a network 425 (e.g., a wide area network (WAN) or the global packet data communications network now commonly referred to as the "Internet") or to data equipment operated by the service provider. The 421 local area network and 425 network use either electrical, electromagnetic or optical signals to transmit information and instructions. The signals across the various networks and the signals on the network link 419 and through the communication interface 417, which communicate digital data with the computer system 400, are exemplary forms of carrier waves that carry the information and instructions.

[0067] Computer system 400 sends messages and receives data, including program code, over the network(s), network link 419, and communications interface 417. In the Internet example, a server (not shown) may transmit requested code belonging to an application program for implementing an embodiment of the present invention over network 425, local network 421, and communication interface 417. Processor 403 executes the transmitted code while being received and/or stores the code in the transmitting device. storage 239, or other non-volatile storage for later execution. In this way, the computer system 400 obtains the application code in the form of a carrier wave.

[0068] The term "computer-readable medium" as used herein refers to any medium that participates in providing instructions to processor 403 for execution. Such a medium can take many forms, including but not limited to non-volatile media and volatile media. Non-volatile media include, for example, optical or magnetic disks, such as storage device 409. Volatile media may include dynamic memory, such as main memory 405. Common forms of computer-readable media include, for example, a floppy disk, a hard disk, a magnetic tape, any other magnetic medium, CD-ROM, CDRW, DVD, any other optical medium, RAM, PROM and EPROM, FLASH EPROM, any other memory chip or cartridge, or any other medium from which a computer can read.

[0069] Various forms of computer-readable media may be involved in providing instructions to a processor for execution. For example, instructions for carrying out at least part of the present invention may initially be carried on a magnetic disk of a remote computer. In this scenario, the remote computer loads the instructions into main memory and sends the instructions over a telephone line using a modem. A modem in a local computer system receives data on the telephone line and uses an infrared transmitter to convert the data into an infrared signal and transmit the infrared signal to a portable computing device, such as a personal digital assistant (PDA). ) and a laptop. An infrared detector in the portable computing device receives the information and instructions transmitted by the infrared signal and places the data on a bus. The bus transports data to main memory, from which a processor retrieves and executes instructions. Instructions received by main memory may optionally be stored in the storage device, either before or after execution by the processor.

[0070] Although exemplary embodiments of the present invention may provide various implementations (e.g., including hardware, firmware and/or software components), and, unless otherwise indicated, all functions are performed by a CPU or a processor executing computer-executable program code stored in a non-transitory memory or computer-readable storage medium, the various components may be implemented in different configurations of hardware, firmware, software, and/or a combination thereof. Unless otherwise described herein, the various components shown in line or block form in the figures are individually well known and their construction and internal functioning are not critical either to the manufacture or use of the present invention or to a description of the better way anyway.

[0071] In the previous description, various embodiments were described with reference to the attached drawings. It will, however, be evident that various modifications may be made thereto, and additional embodiments may be applied, without departing from the broader scope of the invention as set forth in the claims that follow. The specification and drawings should therefore be considered in an illustrative rather than a restrictive sense.

Claims (16)

1. A method comprising: determining an average periodic bandwidth utilization of a plurality of remote terminals for transmitting data over a channel of a wireless data communications system, wherein the average bandwidth utilization periodic bandwidth is determined based on a first averaging period, and the periodic bandwidth is a portion of the total channel bandwidth allocated for periodic bandwidth allocations to each terminal of the plurality of remote terminals for transmitting data from the respective terminal on the channel; determining a maximum level for the periodic bandwidth allocations for each terminal of the plurality of remote terminals based on the determined average periodic bandwidth utilization of the plurality of remote terminals and a target level for the periodic bandwidth; determining a utilization metric that reflects a level of periodic bandwidth utilization by a terminal of the plurality of remote terminals based on a second averaging period, wherein the second averaging period may be equal to the first averaging period; determine an updated level for the periodic bandwidth allocations for the one endpoint based on the utilization metric determined for the one endpoint and a target level for the periodic bandwidth utilization by the one endpoint, wherein the updated level for the one endpoint periodic bandwidth allocations to the one terminal is determined so as not to exceed the maximum level determined for periodic bandwidth allocations to each terminal of the plurality of remote terminals; and assigning the updated level to the terminal's periodic bandwidth allocations for one or more subsequent data transmissions of the terminal over the channel. 2. Method, according to claim 1, characterized by the fact that: if the utilization metric reflects that the level of periodic bandwidth used by a terminal is greater than the target level for the use of periodic bandwidth by the one terminal, the updated level for the periodic bandwidth allocations for the one terminal is increased; and if the utilization metric reflects that the level of periodic bandwidth used by an endpoint is less than the target level for periodic bandwidth utilization by an endpoint, the updated level for periodic bandwidth allocations to the one terminal is reduced. 3. Method according to claim 2, characterized by the fact that if the utilization metric reflects that the level of periodic bandwidth used by a terminal is greater than the target level for periodic bandwidth utilization by the a terminal, the increase in the updated level for the periodic bandwidth allocations to one terminal is carried out on a step-by-step basis up to the maximum level for the periodic bandwidth allocations to each of the plurality of remote terminals. 4. Method according to claim 2, characterized by the fact that if the utilization metric reflects that the level of periodic bandwidth used by a terminal is lower than the target level for periodic bandwidth utilization by the one terminal, the reduction in the updated level for the periodic bandwidth allocations for the one terminal is performed on a step-by-step basis. 5. Method, according to claim 1, characterized by the fact that determining the utilization metric of a terminal comprises monitoring the interval utilization of the a terminal and determining an average interval utilization and a volume utilization over the second averaging period. 6. The method of claim 1, wherein the target level for periodic bandwidth reflects a predetermined portion of the total channel bandwidth allocated to the periodic bandwidth allocations for the plurality of terminals. remote. 7. Method according to claim 6, characterized by the fact that: if the average periodic bandwidth utilization of the plurality of remote terminals over the first averaging period is greater than the target level for periodic bandwidth, the maximum level for periodic bandwidth allocations to each of the plurality of remote terminals is reduced; and if the average periodic bandwidth utilization of the plurality of remote terminals over the first averaging period is less than the target level for periodic bandwidth, the maximum level for periodic bandwidth allocations for each of the plurality of remote terminals is increased. 8. Method according to claim 6, characterized by the fact that the target level for periodic bandwidth is subject to a tolerance interval defined by a lower tolerance and an upper tolerance, and wherein: if the average utilization of the periodic bandwidth of the plurality of remote terminals over the first averaging period is greater than the target level for periodic bandwidth plus the upper tolerance, the maximum level for periodic bandwidth allocations to each of the plurality of terminals remote is reduced; and if the average periodic bandwidth utilization of the plurality of remote terminals over the first averaging period is less than the target level for periodic bandwidth minus the lower tolerance, the maximum level for periodic bandwidth allocations for each of the plurality of remote terminals is increased; and if the average periodic bandwidth utilization of the plurality of remote terminals over the first averaging period is within a range from the target level for periodic bandwidth minus the lower tolerance to the target level for bandwidth periodic plus upper tolerance, the maximum level for periodic bandwidth allocations to each of the plurality of remote terminals is maintained. 9. Apparatus, characterized in that it comprises: a receiver configured to receive data transmissions from a plurality of remote terminals through an uplink route-inward channel group of a wireless data communication system ; and a processor configured to determine an average periodic bandwidth utilization of the plurality of remote terminals, wherein the average periodic bandwidth utilization is determined over a first averaging period, and the periodic bandwidth is a part of the bandwidth total bandwidth of the channel allocated to the periodic bandwidth allocations to each of the plurality of remote terminals for transmitting data from the respective terminal over the channel; and wherein the processor is further configured to determine a maximum level for periodic bandwidth allocations to each of the plurality of remote terminals based on the determined average periodic bandwidth utilization of the plurality of remote terminals and a target level for periodic bandwidth, wherein the processor is further configured to determine a utilization metric that reflects a level of periodic bandwidth utilization by one terminal of the plurality of remote terminals based on a second averaging period, where the second averaging period may be equal to the first averaging period, wherein the processor is further configured to determine an updated level for periodic bandwidth allocations for the one endpoint based on the utilization metric determined for the one endpoint and a level target for periodic bandwidth utilization by the one terminal, wherein the updated level for the periodic bandwidth allocations for the one terminal is determined so as not to exceed the maximum level determined for the periodic bandwidth allocations for each one of the plurality of remote terminals, and wherein the apparatus is configured to apply the updated level for periodic bandwidth allocations to the one terminal for one or more subsequent data transmissions from the one terminal over the channel. 10. Apparatus according to claim 9, characterized by the fact that; If the utilization metric reflects that the level of periodic bandwidth used by an endpoint is greater than the target level for periodic bandwidth usage by an endpoint, the processor is configured to increase the updated level for bandwidth allocations. from periodic band to the one terminal; and if the utilization metric reflects that the level of periodic bandwidth used by a terminal is less than the target level for periodic bandwidth utilization by a terminal, the processor is configured to reduce the updated level for the terminal allocations. periodic bandwidth for the one terminal. 11. Apparatus according to claim 10, characterized by the fact that if the utilization metric reflects that the level of periodic bandwidth used by a terminal is greater than the target level for periodic bandwidth utilization by the one terminal, the increase in the updated level for the periodic bandwidth allocations for the one terminal is carried out on a step-by-step basis up to the maximum level for the periodic bandwidth allocations for each of the plurality of remote terminals. 12. Method according to claim 10, characterized by the fact that if the utilization metric reflects that the level of periodic bandwidth used by a terminal is lower than the target level for periodic bandwidth utilization by the one terminal, the reduction in the updated level for the periodic bandwidth allocations for the one terminal is performed on a step-by-step basis. 13. The apparatus of claim 9, wherein determining the usage metric of a terminal comprises monitoring the range utilization of the terminal and determining one of an average range utilization and a volume utilization over the second averaging period. 14. The apparatus of claim 9, wherein the target level for periodic bandwidth reflects a predetermined portion of the total channel bandwidth allocated to the periodic bandwidth allocations for the plurality of terminals. remote. 15. The apparatus of claim 14, wherein: if the average periodic bandwidth utilization of the plurality of remote terminals over the first averaging period is greater than the target level for periodic bandwidth, the processor is configured to reduce the maximum level for periodic bandwidth allocations to each of the plurality of remote terminals; and if the average periodic bandwidth utilization of the plurality of remote terminals over the first averaging period is less than the target level for periodic bandwidth, the processor is configured to increase the maximum level for bandwidth allocations. periodically for each of the plurality of remote terminals. 16. Apparatus according to claim 14, characterized by the fact that the target level for periodic bandwidth is subject to a tolerance interval defined by a lower tolerance and an upper tolerance, and wherein: if the average utilization of the periodic bandwidth of the plurality of remote terminals over the first averaging period is greater than the target level for the periodic bandwidth plus the upper tolerance, the processor is configured to reduce the maximum level for the periodic bandwidth allocations for each of the plurality of remote terminals; If the average periodic bandwidth utilization of the plurality of remote terminals over the first averaging period is less than the target level for periodic bandwidth minus the lower tolerance, the processor is configured to increase the maximum level for the periodic bandwidth allocations. periodic bandwidth for each of the plurality of remote terminals; and if the average periodic bandwidth utilization of the plurality of remote terminals over the first averaging period is within a range from the target level for periodic bandwidth minus the lower tolerance to the target level for bandwidth periodic plus upper tolerance, the processor is configured to maintain the maximum level for periodic bandwidth allocations to each of the plurality of remote terminals.