Abstract: Presented is a device for processing packets of flows on a network link. The device includes a scheduling module for scheduling packets in a queue in accordance with a fair queuing with priority algorithm.

Abstract: A system comprises a plurality of wireless stations for exchanging data over a wireless network and a coordinator station such an access point. The coordinator station receives a request for a traffic specification from one of the wireless stations. The traffic request comprises a traffic parameter (202) representative of the traffic specification. The coordinator station runs an acceptance algorithm (226) to determine if the request can be met based on the parameter and a current traffic schedule based on other previously granted traffic requests (228). If the new request can be accommodated, a traffic scheduler thereafter generates a new traffic schedule (232, 234) using the Cyclic Executive Model (230).

Abstract: A server proxy (12), which is arranged between a distribution server (11) and a router (13a), adds quality information to a packet (19a) from the distribution server (11) to output a packet (19b). A plurality of reception terminal proxies (17a-17n), which are arranged immediately before respective reception terminals (18a-18n), remove the quality information from the packet (19b) distributed via a network (14) and routers (13b-13m), and distribute only necessary information to the respective reception terminals (18). Each reception terminal proxy (17) which includes a quality information acquisition unit (17A) acquires the quality information to transmit, from a quality information calculation/transmission unit (17B), the quality information (51) to an accumulation server (15). The accumulation server (15) saves, in a quality information database, packet quality information (52) for each reception terminal (18).

Abstract: A shared memory stores packets for a packet processor. The shared memory is arranged into banks that are word-interleaved. All banks may be accessed in parallel during each time-slot by different requesters. A staggered round-robin arbiter connects requesters to banks in a parallel fashion. Requestor inputs to the arbiter are staggered to allow access to different banks in a sequential order over successive time-slots. Multi-processor tribes have many processors that generate random requests to the shared memory. A slot scheduler arranges these random requests into a stream of sequential requests that are synchronized to the staggered round-robin arbiter. A packet interface requestor stores incoming packets from an external network into the shared memory. The packet's offset within pages of the shared memory is determined by the first available bank that the packet can be written to, eliminating delays in storing incoming packets and spreading storage of frequently-accessed fields.

Abstract: A method (200) and an apparatus (300) in a wireless portable communication device (102) for maintaining appropriate authentication credentials required for a common data application in a current service network are provided. A method (400) in a wireless communication network (106) for providing current authentication credentials required for the common data application accessible through the wireless communication network (106) is also provided. The wireless portable communication device (102) has default authentication credentials required for the common data application in a default service network (106), receives (204) a data session configuration file including authentication credentials based upon a predetermined condition, prioritizes (206) between the default authentication credentials and the received authentication credentials, and uses (208) the authentication credentials having higher priority for the common data application in the current service network (110).

Abstract: The present invention relates to a method in a radio communication system providing packet data services. A radio communication system providing packet data services and a packet data scheduler (PS) are also disclosed. In accordance with the method capacity is requested for a packet data bearer, whereafter capacity is allocated for the packet data bearer based on a first timing scheme. The allocated capacity may be modified based on a second timing scheme. The packet data scheduler (PS) comprises two timers (T1, T2) fore implementing the two different timing schemes.

Abstract: In general, in one aspect, the disclosure describes a switching device that includes a plurality of ingress ports to receive data from external sources and a plurality of egress ports to transmit data to external destinations. The switching device also includes a plurality of queues to store data waiting to be transmitted from a particular ingress port to a particular egress port. A request generator generates requests for permission to transmit data for the queues. A request indicates a cumulative amount of data contained in a respective queue. A switching matrix provides selective connectivity between the ingress ports and the egress ports. The switching device further includes a scheduler to receive the requests, generate grants based thereon, and configure the switching matrix. The scheduler incorporates a mechanism to periodically monitor its operating efficiency and perturb its internal state when its efficiency is below a certain desired level.

Abstract: In a communication system using multicasting, multicast packets are forwarded through a switch by destination ports after these ports receive the packets. A source node sends the multicast packet to a subset of nodes within the multicast group, which in turn, forward the multicast packet to other subsets of packets within the multicast group that have yet to receive the information. This is continued until all ports within the multicast group have received the information.

Abstract: A technique triggers packing of path computation requests (PCRs) for traffic engineering (TE) label switched paths (LSPs) that are sent from one or more label-switched routers (LSRs) to a path computation element (PCE) of a computer network. According to the novel technique, incoming PCRs are packed into sets in response to a certain event, and one or more TE-LSPs (paths) are computed for each PCR of a particular set based on the PCRs of that set. Specifically, the PCE detects an event in the network (“network event”) indicating that an increase in the number of incoming PCRs has occurred, or that an increase is likely to occur due to, e.g., a change in a network element. Once the network event has been detected, the PCE packs the incoming PCRs into configured-length sets, such as, e.g., for a specified time interval or a certain number of PCRs.

Abstract: Data traffic is scheduled by, in a first scheduler, selecting a source of traffic from a plurality of sources of traffic, each source being associated with a second scheduler, in a second scheduler associated with the selected source of traffic, selecting a type of traffic from a plurality of types of traffic within the source selected by the first scheduler, and transmitting data of the selected type and source. Scheduling data traffic apparatus and method using deficit and group ratio round robin budgeting.

Abstract: A call admission control technique allowing flexible and reliable call admissions at an ATM switch in the case of an ATM network including both QoS-specified and QoS-unspecified virtual connections is disclosed. In the case where a QoS (Quality of Service) specified connection request occurs, an estimated bandwidth is calculated which is to be assigned to an existing QoS-unspecified traffic on the link associated with the QoS-specified connection request. A call control processor of the ATM switch determines whether the QoS-specified connection request is accepted, depending on whether a requested bandwidth is smaller than an available bandwidth that is obtained by subtracting an assigned bandwidth and the estimated bandwidth from a full bandwidth of the link.

Abstract: A ‘smart’ sub-channel hopping control mechanism executes one or more sub-channel selection discriminators to enable the communications controller of a spectral reuse transceiver to delineate on which of a plurality sub-channels the spectral reuse transceiver may transmit, so as to substantially reduce the likelihood of triggering squelch circuits of silent radios of primary (licensed) channel users.

Abstract: A method for communicating a subset of data streams includes steps of monitoring a plurality of data streams communicated between a plurality of standard users, recognizing at least one primary data stream, and communicating the at least one primary stream to a primary user. In an exemplary embodiment of the invention, the data streams include real-time audio and video data being communicated between attendees of a virtual meeting.

Abstract: Load balanced transport of best efforts traffic together with delay-bounded traffic over a multilink bundle combines fragmentation and fragment distribution for best efforts packets with per-flow balancing for delay-bounded traffic. In the preferred embodiments, the best efforts packets receive Multilink Protocol treatment, including fragmentation and addition of sequence headers. Fragments of packets for one such communication go over the various links within the bundle, as appropriate for load balancing on the links. For each delay-bounded flow, such as for a VOIP service, the sending node hashes the packet header data and applies all packets for the flow to one of the links, assigned as a function of the hash value. Different flow headers produce different hash results; therefore the node sends different flows over the different links in a substantially balanced manner.

Abstract: A data logging method and system that utilizes a schedule of data transfer periods for transferring data from devices to a server. A communication of an actual data transfer size of stored data in a first device of the devices is obtained by the server from the first device. A corresponding future data transfer size of the stored data is estimated by the server, based on a historic data transfer size for data previously transferred from the first device to the server. The schedule is currently based on the historic data transfer size for the first device. The server updates the schedule if the server has determined that a difference exists between the actual data transfer size and the corresponding estimated future data transfer size. A transmission from the first device of the data actually stored in the first device is received by the server in accordance with the schedule.

Abstract: Presently disclosed is an apparatus and method for returning control of bandwidth allocation and packet scheduling to the routing engine in a network communications device containing an ATM interface. Virtual circuit (VC) flow control is augmented by the addition of a second flow control feedback signal from each virtual path (VP). VP flow control is used to suspend scheduling of all VCs on a given VP when traffic has accumulated on enough VCs to keep the VP busy. A new packet segmenter is employed to segment traffic while preserving the first in, first out (FIFO) order in which packet traffic was received. Embodiments of the invention may be implemented using a two-level (per-VC and per-VP) scheduling hierarchy or may use as many levels of flow control feedback-derived scheduling as may be necessitated by multilevel scheduling hierarchies.

Abstract: A shared mesh data network (SMDN) for path-based recovery at the packet level. In one implementation, a first link in the network is part of two or more different protection paths, where each protection path corresponds to a different primary path. A network manager determines how much protection bandwidth to reserve on the first link for the two or more protection paths in such a way that the protection bandwidth reserved on the first link is shared between the protection paths of the two or more primary paths. As such, the amount of protection bandwidth reserved on the first link can be less than the sum of the bandwidths of the two or more primary paths. The SMDN provides efficient sharing of protection capacity. Implementations of the SMDN are appropriate to multiprotocol label-switched (MPLS) optical networks.

Abstract: Disclosed herewith is a PON system and a bandwidth controlling method capable of controlling congestion with use of an upstream bandwidth in a PON section efficiently when congestion occurs in a gateway (GW) connected to an OLT. An OLT connected to a plurality of ONUs through a passive optical network (PON) and to a gateway (GW) through a communication line, when receiving a congestion occurrence notice indicating a congestion occurred output number from a GW, identifies the identifier of the ONU that is using a GW output line having the congestion output port number and shifts the bandwidth controlling of the PON section in a normal mode for allocating a bandwidth to each ONU normally to that in a bandwidth suppression mode for allocating a congestion time allowable bandwidth that is less than the current bandwidth to the ONU having the identified ONU identifier and a bandwidth to each of other ONUs according to its transmission queue length.

Abstract: The present packet scheduling algorithm gives cellular network operators greater flexibility in adjusting the way resources are allocated among interactive best-effort data users. The present packet scheduling algorithm is capable of allocating radio resource dynamically, not only based on channel conditions, but also to achieve different performance trade-offs among users with different link qualities. According to the algorithm, channel quality is determined for each user. Channel efficiency is calculated and the channel efficiency value is used as the primary factor in weighting the delivery of packets to (or from) a given user. In a packet schedule weighting equation, a value of exponent may be varied from negative to positive to give good (or bad) users better service. However, performance of users with bad channel qualities degrades the performance of good channel users in a disproportionate manner.

Abstract: A telecommunications system includes an MPLS network. The system includes a source node in communication with the network. The system includes a destination node in communication with the network and with the source node through a plurality of different paths. Each path of which has a residual bandwidth at a given time. The source node forming a connection with the destination node at the given time across the path of the different paths as a function of residual bandwidth. A method for selecting a preferred LSP path from a set of equal cost paths. A method for sending packets in a telecommunications network. A software program for a management station or a switch.

Abstract: Eligible entries are scheduled using an approximated finish delay identified for an entry based on an associated speed group. One implementation maintains schedule entries, each respectively associated with a start time and a speed group. Each speed group is associated with an approximated finish delay. An approximated earliest finishing entry from the eligible schedule entries is determined that has an earliest approximated finish time, with the approximated finish time of an entry being determined based on the entry's start time and the approximated finish delay of the associated speed group. The scheduled action corresponding to the approximated earliest finishing entry is then typically performed. The action performed may, for example, correspond to the forwarding of one or more packets, an amount of processing associated with a process or thread, or any activity associated with an item.

Abstract: A method and system for combining requests for data bandwidth by a data source for transmission of data over a wireless communication medium is provided. A central node receives one or more bandwidth requests from one or more data sources via wireless communication. A scheduler then combines one or more bandwidths requests from the same data source to create a single data burst bandwidth. The central node then grants the data burst bandwidth to the appropriate data source via wireless communication.

Abstract: The present invention relates to allocating the use of optical light-trails. Optical light-trails enable a plurality of nodes included in a light-trail to share the use of an optical wavelength to transmit traffic between the nodes included in the light-trail. A method for allocating the use of an optical light-trail includes calculating a bid at each of one or more nodes included in the light-trail. Each of the nodes calculates a bid with consideration for the criticality of the node's need to transmit particular traffic on the light-trail. The method also includes transmitting the calculated bids from one or more of the nodes to an arbiter node. The arbiter node determines the maximum received bid, determines whether to allocate the use of the light-trail to the node associated with the maximum bid, and then communicates one or more control messages to the nodes that transmitted the bids indicating to which node use of the light-trail is allocated.

Abstract: In general, the invention is directed to techniques of load balancing network traffic among paths on a point-to-multipoint overlay network. In load balancing the network traffic, the techniques take into consideration costs associated with paths through the overlay network and costs associated with paths beyond the egress points of the overlay network, even when such costs may be unequal.

Abstract: A method and apparatus for load balancing in a wireless network is provided. For example, this invention is directed to a technique for balancing bearer load across a bank of traffic processors associated with a high-availability radio network controller (RNC). Instantaneous measures (e.g. processor occupancy) are used as one parameter for such load balancing. Predictive measures are used as another parameter. The predictive measures indicate the degree to which a given processor can become busy in the next few intervals of time and is based on the unrealized potential as derived from the established data rate of bearer sessions. The overall technique described herein allows for an even distribution of highly bursty traffic, with an objective of preserving call quality during periods of increased network congestion.

Abstract: Embodiments of the present invention described and shown in the specification and drawings facilitate data packet transportation. One aspect of the invention multiplexes time-sensitive TDM (Time Division Multiplexed) and other synchronous data, and asynchronous data traffic, onto a communication channel in a manner that minimizes jitter in the delivery of the TDM data traffic while efficiently transporting asynchronous data traffic. Another aspect of the invention provides dynamic bandwidth sharing on a communication ring. The dynamic bandwidth sharing aspect of the present invention facilitates the efficient utilization of bandwidth of communication rings, particularly in those rings that cover large geographic areas.

Abstract: A method and system for combining requests for data bandwidth by a data source for transmission of data over a wireless communication medium is provided. A central node receives one or more bandwidths requests from one or more data sources via wireless communication. A scheduler then combines one or more bandwidths requests from the same data source to create a single data burst bandwidth. The central node then grants the data burst bandwidth to the appropriate data source via wireless communication.

Abstract: A method and integrated hardware system for dynamic bandwidth allocation in EPONs which—in sharp contrast to the prior art—provides superior upstream transmission characteristics including QoS considerations consistent with any Service Level Agreement that exists between a customer and a service provider. Advantageously, our inventive method and system for dynamic bandwidth allocation provides fair and efficient upstream bandwidth management in addition to enhanced traffic performance for customer traffic within the EPON. For a service provider, our invention permits the deployment of intelligent traffic management and QoS characteristics capable of supporting existing or novel voice, video, and data services over the EPON.

Abstract: A method in a data network where the data network includes multiple terminal points interconnected by one or more network intermediate devices includes transmitting an invitation message from a first terminal point where the invitation message is broadcast through the data network to the multiple terminal points; in response to the invitation message, sending a reservation response message from a second terminal point where the reservation response message is broadcast through the data network to the multiple terminal points; and receiving the reservation response message at a first network intermediate device. The method further includes in response to the reservation response message, storing in the first network intermediate device for one reservation cycle a static forwarding address entry including the source address of the reservation response message and an identification of the port of the first network intermediate device on which the reservation response message is received.

Abstract: The invention provides a method and system for relieving temporal overload conditions in a router when weighted queues are employed to forward packets to their next destination. Typically, a received packet is mapped to a weighted queue that is associated with the kind of data included in the packet. The invention employs a threshold value to determine when an overloading condition of a weighted queue is so severe that high priority packets are in danger of being dropped. As long as this condition occurs, the invention will remap higher priority packets from a weighted queue associated with the kind of data included in the packets to another weighted queue that is not as loaded and which normally would not be associated with kind of data included in the packets at risk of being dropped.

Abstract: A method for transmission of data packets through a network is provided. The data packets with a maximum allowable delay are aggregated in a node of the network according to an aggregation strategy with timeout to a burst, wherein on arrival and buffering of a first packet a timer is started and succeeding packets are buffered until a time is elapsed, the buffered packets are sent as a burst into the network and with the next arriving and buffered packet the timer respectively this cycle is started again, where the time is determined by the product of the maximum allowable delay for a packet multiplied with the value 2.

Abstract: The data packets with a maximum allowable delay and an average packet rate are aggregated in a node of the network of a burst and the burst is transmitted with a number of packets. The number of packets per burst is determined by the result of plus/minus twenty percent of the sum of the value one plus a product of the maximum allowable delay, the average packet rate and the value two.

Abstract: The present invention relates to a switching unit with a low-latency flow control. Queuing parameters of ingress queues, wherein the incoming traffic is backlogged, are measured to detect a short term traffic increase. An additional bandwidth is then negotiated to accommodate this unexpected additional amount of traffic, provided that the corresponding input and output termination modules still dispose of available bandwidth, and disregarding temporarily fairness. This additional bandwidth allows this unexpected additional amount of traffic to be drained from the ingress queue as soon as possible, without waiting for the next system bandwidth fair re-distribution, thereby improving the traffic latency through the switching unit.

Abstract: Some embodiments of the present invention may include a method to stream packets into a queue for an upstream transmission, send multiple requests for upstream bandwidth to transmit data from the queue and receiving multiple grants to transmit data, and transmit data from the queue to the upstream as grants are received. Another embodiment may provide a network comprising a cable modem termination system (CMTS), and a cable modem wherein the cable modem may transmit data to the CMTS with a streaming protocol that sends multiple requests for upstream bandwidth to transmit data and receives multiple grants to transmit data, and transmits data to the CMTS as grants are received.

Abstract: Systems and methods for scheduling data packets in a network processor are disclosed. Embodiments provide a network processor that comprises a best-effort scheduler with a minimal calendar structure for addressing schedule control blocks. In one embodiment, a three-entry calendar structure provides for weighted best effort scheduling. Each of a plurality different flows has an associated schedule control block. Schedule control blocks are stored as linked lists in a last-in-first-out buffer. Each calendar entry is associated with a different linked list by storing in the calendar entry the address of the first-out schedule control block in the linked list. Each schedule control block has a counter and is assigned a weight according to the bandwidth priority of the flow to which the corresponding packet belongs.

Abstract: A method of dynamic transmission resource allocation that operates in a wireless network. The wireless network includes a plurality of mobile terminals each managing a given number of different data flows of protocol data units that are classified according to a set of flow types, a radio resource management unit for allocating transmission resources on a per protocol data unit basis, a plurality of schedulers operating according to a specific set of rules, and a selector for sharing the transmission resource among the mobile terminals.

Abstract: An apparatus and method is disclosed for providing a Quality of Service (QoS) service schedule and bandwidth allocation message to a wireless station in a wireless network. The apparatus of the invention comprises a hybrid coordinator that is capable of (1) creating a Quality of Service (QoS) service schedule and a bandwidth allocation message for a wireless station and (2) sending the QoS service schedule and the bandwidth allocation message to the wireless station. The wireless station is capable of using the scheduling information to perform power management by entering a power save mode during times when the hybrid coordinator has not scheduled any transmission opportunities.

Abstract: A central control station carries out allocations of transmission rights according to a rule that a value obtained by subtracting (i) a value of a broken line (11) from (ii) a value of a straight line (10) is always limited according to a certain constant value (TXOP bound) smaller than C·T delay, where the broken line (11) indicates a sum of transmission granting time periods allocated from a certain time point t0 by “an actual transmission right allocation”, the straight line (10) indicates a sum of transmission right granted time periods allocated according to “a reference transmission right allocation obtained by the average data rate or the like of a communication station”, and C·T delay is an average sum of transmission right granted time periods allocated to the tolerable transmission delay time according to the reference transmission right allocation.

Abstract: An object of this invention is to allow a wireless terminal device to issue a request of connection using a distributed control method or central control method to a wireless control device in consideration of connection states of wireless terminal devices other than itself under management of the wireless control device. A wireless terminal device (101) acquires a beacon frame interval (602), maximum contention free period (CFP) duration (604), and CF-END average time (701) from beacon information (M800) announced from a wireless video processing device (102). The wireless terminal device determines an access control method based on a first conditional formula (702) and second conditional formula (703) using them (602, 604 and 701). The wireless terminal device transmits a TS addition request message (M906) which includes the determined access control method, type information, and bandwidth request to the wireless video processing device (102).

Abstract: A method and apparatus for logical identification priority have been disclosed.

Abstract: A method for transmitting data at a high rate in a wireless LAN is provided. A wireless access point requests reliable node information from a wireless terminal having a transfer rate equal to or less than a predetermined transfer rate if data to be transmitted to the terminal occurs. The terminal produces a frame containing information related to reliable nodes that can communicate with the terminal and information of greatest transfer rates between the reliable nodes and the terminal, and transmits the frame to the access point. The access point selects an optimal relay node from the reliable nodes, based on the greatest transfer rates between the reliable nodes and the access point and transfer rates between the reliable nodes and the terminal, and determines if a relay gain exists when using the optimal node. If the relay gain exists, the access point performs relay transmission to the terminal; otherwise, it performs direct transmission to it.

Abstract: A simple admission control mechanism for IP based networks is provided. The decision on whether a new flow is accepted is based on the link load information on the paths from the source to destination. The new flow is accepted when the link load is less than a threshold. When at least one of the links on all of the available paths is larger than the acceptable threshold, access is denied to the flow. More than one threshold level may be used. Under the multiple threshold scenario, the traffic may be divided into different classes. The admission control mechanism helps to ensure a network that is not heavily congested.

Abstract: Packet communication networks for transmission to wireless subscriber devices utilize both wireline and wireless packet routing components. The routing elements of these two different types often implement different packet scheduling algorithms, typically a form of Weighted Fair Queuing (WFQ) in the wireline portion of the network and Proportional Fairness (PF) queuing in the wireless domain. To improve resource allocation and thus end to end quality of service for time sensitive communications, such as integrated multimedia services, the present disclosure suggests adding the notion of slack time into either one or both of the packet scheduling algorithms. By modifying one or more of these algorithms, e.g. to reorder or shuffle packets based on slack times, global optimal resource allocations are possible, at least in certain cases.

Abstract: A method and apparatus for grooming traffic demands according to mileage based tariffs. An Integer Linear Program (ILP) that captures the traffic grooming problem is defined, and such a linear program can in principle be solved by conventional linear program application systems which are fully familiar to those of ordinary skill in the art. However, the time required to solve such an ILP is fairly large, even for the moderately sized networks we are interested in. That is, there are many possible routes to consider, and hence many integer variables in the ILP. Therefore, further in accordance with the principles of the present invention, the ILP is advantageously run on the Delaunay Triangulation of the network rather than on the completely connected network graph.

Abstract: One aspect of the specification is the use of a virtual entity to represent the bandwidth bottleneck point in a network. Areas of the network where bandwidth does not need to be managed can be modeled as zones. This model enables more flexibility as the virtual bottleneck point can represent a collection of components (e.g. routers), or a portion of a real component (e.g. a router could be represented by multiple virtual bottleneck points with different purposes.) This model can also allow a user to decide which points in their network should be managed, independent of the underlying data network infrastructure. These virtual entities can be placed between areas of the network, and configured with specific policies. Bandwidth usage across these virtual entities can be tracked and compared to the configured bandwidth limit available to the application at each bottleneck point. When the bandwidth available at the bottleneck point is fully utilized, additional calls can be blocked or rerouted.

Abstract: CMTS software keeps track of the number of call requests accepted during a given monitoring period, this number being referred to as Count. As each call request is received, Count is compared to the current value stored in an overload state MIB (which can change multiple times during a monitoring period based on the actual overload state as reported by fault management). If Count exceeds the MIB value, the call request is denied. After the monitoring period ends, the Count of call requests accepted is reset to zero and the count value begins incrementing at the start of the next monitoring period as calls are accepted.

Abstract: A storage system comprises an interface capable of interconnecting a network infrastructure via a plurality of communication links. The plurality of communication links has a diversity of data-carrying capacity and performance. The storage system further comprises a controller coupled to the interface that assigns the plurality of communication links into at least one link affinity group based on performance criteria and controls link selection based on link affinity group assignment.

Abstract: A bufferless crossbar switch system and technique for synchronization and error recovery between switch line cards is provided. A network switches data through the bufferless data crossbar switch and distributes a high-speed frequency and time signal on a separate channel. The separate channel allows clock recovery, eliminating the need to encode the data in a way that allows clock recovery. The separate channel also gives a global picture of time so that a system can be globally scheduled by notifying ingress and egress line card adapters when to perform specific actions, such as transmitting or receiving data or retransmitting data for error recovery.

Abstract: Systems and methods for scheduling data packets in a network processor are disclosed. Embodiments provide a network processor that comprises a best-effort scheduler with a minimal calendar structure for addressing schedule control blocks. In one embodiment, a four-entry calendar structure provides for rate-limited weighted best effort scheduling. Each of a plurality of different flows has associated schedule control blocks. Schedule control blocks are stored as linked lists in a last-in-first-out buffer. Each calendar entry is associated with a different linked list by storing in the calendar entry the address of the first-out schedule control block in the linked list. Each schedule control block has a counter and is assigned a rate limit according to the bandwidth priority of the flow to which the corresponding packet belongs.

Abstract: A system and method are provided for controlling the computing bandwidth and resources provided to external entities based on subscription levels associated with those external entities. Higher subscription levels provide greater resource allocation. Accounting is accomplished by tracking bandwidth allocated and used over given periods of time.