Abstract: A method is described that associates a first plurality of logical ports with a first bandwidth group and that associates a second plurality of ports with a second bandwidth group. The first bandwidth group is defined by a first bandwidth range whose lowest data rate is greater than a highest data rate of a second bandwidth range that defines the second bandwidth group. The method also involves servicing the first and second bandwidth groups so that: 1) each of the logical ports that are associated with the first bandwidth group are polled at a rate of X servicing trips of the first and second bandwidth groups; and, 2) each of the logical ports that are associated with the second bandwidth group are polled at a rate of Y servicing trips of the first and second bandwidth groups and where X is less than Y.

Abstract: A system and a method for allocating bandwidth to ports in a computer network are provided. The method includes generating a default global parameter template having a first set of control parameters that indicate a first desired allocation of bandwidth for queues associated with each port of a plurality of ports in the network. The method further includes generating a first global parameter template having a second set of control parameters that indicate a second desired allocation of bandwidth for queues associated with a first subset of the plurality of ports.

Abstract: A system and method for measuring data transmission activity through a port of a switch device interconnecting nodes of a storage area network, the port transmitting data as words of predetermined length, one data word indicating idle port activity. The method includes steps of: counting a number of transmitted words received from the port in a first counter device; and, for each word counted, comparing that word with a predetermined word indicating no (idle) port transmission activity. In response to the comparing, a number of matches are counted in a second counter device. In this manner, a ratio of a number of counted matches with a total amount of words counted indicates available bandwidth for transmitting additional data over that link. Preferably, this available bandwidth information is included in a link state record that the switch communicates to other switch devices interconnecting that link.

Abstract: Disclosed is a system, apparatus, and method for dynamically allocating bandwidth to applications in a network based on utility functions. At least one client device is present in the network and is capable of receiving data over the network. In one embodiment, a server capable of transceiving data over the network is coupled to the at least one client device through the network. The server identifies the at least one client device in the network and identifies applications being utilized in the network by the at least one client device. Utility functions are defined for each of the applications. A utility function may be used to specify the minimum amount of bandwidth required by the application to perform at a predetermined quality level. Particularly, bandwidth is dynamically allocated to different applications in the network based on the utility functions defined for each of the applications.

Abstract: An output port circuit is provided for a router apparatus which routes and transmits a received packet. Each flow is constituted by continuous packets and belongs to a bandwidth-guaranteed class or a best-effort class. A controller controls storage and reading of a packet into and from a storage unit. Upon allocating a basic volume that is a criterion of a memory size stored in the storage unit to each flow to which the packet to be transmitted belongs, the controller manages the basic volume of each flow of the packet belonging to the bandwidth-guaranteed class by individually allocating the basic volume by the memory size required by each flow, and manages the basic volume of each flow of the packets belonging to the best-effort class by collectively allocating the memory size obtained by subtracting a sum of respective basic volumes allocated to the bandwidth-guaranteed class from an entire memory size.

Abstract: An aspect of the invention relates to a method and apparatus for statistically multiplexing content from a plurality of encoders. In one example, a respective need data value from each of the encoders is received. A separate bandwidth allocation is designated for each of the encoders based on the respective need data value, wherein the separate bandwidth allocations do not collectively exceed an aggregate bandwidth threshold level. Afterwards, a burst identifier and the separate bandwidth allocations are transmitted to each of the encoders.

Abstract: The use of bandwidth constrained wireless links in mobile networks necessitates the use of bandwidth saving header compression schemes. In these schemes, a compressor and a decompressor collaborate to code bulky IP headers into streamlined compressed headers. The gain of establishing the compressed header state in a greedy manner, without the compressor waiting for the decompressor's acknowledgment is evaluated. The impact of header compression on the traffic pattern, and the consequences on the channel allocation or connection admission control are also evaluated. A decision method for channel allocation or for connection admission control are proposed that maximizes the bandwidth utilization of the channel while providing some performance guarantees in terms of delay.

Abstract: A communication system for a mobile platform satellite service (MPSS) system includes a receiver subsystem (RS) and a transmitter subsystem (TS). A satellite transponder is in communication with the RS and the TS of the mobile platform. A satellite service ground station includes a transmitter subsystem (TS) and a receiver subsystem (RS). A communication link is established between the MPSS system and the ground station, via the satellite transponder. The communications link includes fixed satellite service (FSS) data superimposed on MPSS data in the same frequency band to thereby maximize both satellite transponder utilization and interference budget usage.

Abstract: A method that utilizes virtual channels and a common pool of credits, controlled by a transmitter to maximize the throughput across an Inter-Switch Link in a Fibre Channel network. Each virtual channel is allocated a minimum number of credits and the remaining credits of the ISL are held in a common pool. When needs arise, the credits in the pool will be allocated or reallocated to make the best use dynamically by the transmitter.

Abstract: Provided is a method of packet transmission capable of efficiently utilizing ACL link resources in transmitting and receiving packets after an ACL link is established in Bluetooth. A Bluetooth device A determines the maximum rate for packet size to be transmitted to a Bluetooth device B established in the link based on the ratio between a token rate A requested by the device A and a token rate B requested by the device B. When the token rate A is greater than the token rate B, the maximum rate N is set from the candidates of current time slot numbers occupiable as an ACL packet. When the token rate A is smaller than the token rate B, a rate is selected from the candidates of current time slot numbers occupiable as the ACL packet based on rate U=N×token rate A/token rate B.

Abstract: The ATM transmitting apparatus for transmitting messages, such as frame relay packets, associated with a plurality of connections comprises ATM layer transmission equipment for receiving multiple messages, segmenting each received message into a plurality of smaller data units, such as 48 byte AAL SAR protocol data units, and multiplexing such data units into a single stream for transport over a physical interface. A scheduler receives messages from each of the connections and transfers the messages to the transmission equipment. The scheduler can dynamically set a transmission rate for any connection, and allocates each connection whose message is transferred to the transmission equipment a substantially maximal amount of bandwidth at any given time during the transmission of the message, to thereby minimize interleaving of data units from the various connections and reduce the average latency (per unit of message) in transmitting the messages across a network.

Abstract: Numerous embodiments of a method and/or apparatus for disruption sensitive network data management are disclosed. In one particular embodiment, a determination is made of the network resources available to a computing system for exchange of data complying with a particular data protocol. A determination is then made of the network resources utilized by a computing system for exchange of data comprising a particular protocol, these two resource values are compared, and the resource allocation is altered in accordance with the comparison.

Abstract: A network device is provided. The network device may include at least one set of buffers to buffer network traffic; a monitor to determine varying amounts of available buffer space associated with the buffers; and logic to assign reading rates to the respective buffers for scheduling output of the buffered traffic. The logic may be configured to increase an assigned reading rate associated with one of the buffers to at least one elevated reading rate based on a reduction of the available buffer space in the one buffer to a first amount and reset the at least one elevated reading rate to the assigned reading rate based on a subsequent increase in the available buffer space beyond that of the first amount.

Abstract: An efficient policer based weighted fairness bandwidth distribution system is disclosed. The system is based on a plurality of policers and a single queue. To achieve fairness, the rate for queuing packets is adaptively controlled. Specifically, first the queue occupancy is determined and it then is used for computing an attenuation (Attn) value. This value is multiplied by the excess information rate (EIR) of each policer to get a new EIR to be enforced.

Abstract: In a wireless local area network (WLAN), the present invention provides a system and method for identifying traffic suffering from bad link quality and dynamically adjusting channel access to restrict the effect of this bad link quality. The dynamic adjustment to channel access is accomplished by lowering or raising the limit on the number of packets that can be transmitted between an AP and the wireless station over the a link as determined by the link quality. The link quality is determined by tracking the number of successive packet transmission successes and errors.

Abstract: In a wide area network arrangement composed of some number of secure local networks and an Internet service provider (ISP) back-bone, LAN hosts are able to indirectly access network routers, through an ISP quality of service (QoS) module, to request that information transmitted during certain specified sessions be given priority treatment by the network.

Abstract: In accordance with one embodiment of the present invention, a map of transmission slots for a port of a network element includes a plurality of hierarchical sets of port transmission slots. The hierarchical sets include a plurality of parent sets. Each parent set has its port transmission slots divided between a plurality of child sets. The child sets include interleaved port transmission slots.

Abstract: Network channel access protocol is disclosed. More particularly, a distributed, locally determined, channel access protocol that adapts to load, avoids interference and controls access by a group of nodes to a set of shared channels is disclosed. Shared channel space is divided into a number of communication slots that are repeated at a predetermined interval. Permission to use a slot to communicate between any two nodes is dynamically adjusted by the channel access protocol, which locally: (i) estimates load to neighboring nodes; (ii) allocates or deallocates slot usage to adapt to load and avoid interference; and (iii) asserts and advertises slot usage within an interference area about itself.

Abstract: A data traffic shaping system, comprises a plurality of burst groups, each burst group having a burst group credit allocation mechanism configured to earn credit over time; a shaping engine configured to manage incoming entries of traffic and to assign each incoming entry of traffic to a selected queue of the burst group depending on the characteristics of the entry; a plurality of queues, respective queues belonging to respective burst groups; and a bandwidth allocation table including locations identifying a queue and an amount of bandwidth credit to allocate to that queue, the shaping engine being configured to traverse the locations, to determine the bandwidth earned by the queues, such credit only being made available to the queue if its assigned burst group has at least that much credit available at that instant in time, and to process an entry in that queue only if the queue has earned a predetermined minimum amount of credit, relative to the current entry on the queue in question.

Abstract: A method for allocating bandwidth in a communications environment is provided that includes receiving one or more data streams associated with one or more subscribers at a voice gateway. One or more algorithms included in the voice gateway are executed that are associated with traffic management of the data streams in order to generate a designated bandwidth value associated with one or more of the data streams. The designated bandwidth value is assigned to one or more of the data streams based on one or more of the algorithms that use an aggregation of one or more activity characteristics associated with a selected one or more of the subscribers.

Abstract: Capacity design of an optical network for demands of fast path restorable (FPR) connections forms a linear programming sizing problem for a optimal routing. A dual of the linear programming sizing problem is formed and solved with an approximation algorithm. Edge lengths are initialized based on i) the inverse of the edge's capacity and ii) a scalar constant. Then, the approximation algorithm proceeds in phases to route each commodity over the edges of a graph. During each phase, the demand's flow is sent from the source to destination via multiple iterations. During each iteration, the set of shortest disjoint paths from the source to the destination is determined, a portion of the flow is sent, and the lengths of the edges that carry the flow are updated. The value employed to scale the network is generated after the last phase from the maximum ratio of edge flow to edge capacity.

Abstract: To address the need for protecting the QoS of high priority flows in a communication network when network conditions vary, original queue weights (B) are modified by a bandwidth allocation adaptor. The modification of the original queue weights is based, in part, on channel conditions.

Abstract: A method and apparatus for sending packets from traffic flows to queues in a network element is provided. Each traffic flow has a packet size parameter indicating a sizing constraint for its packets. The method includes the step of grouping the traffic flows into groups utilizing the packet size parameter of each traffic flow. The method further includes the step of sending packets only from traffic flows of one group to at least one designated queue. Traffic flows of the one group are identified utilizing the packet size parameter of each traffic flow.

Abstract: In one embodiment of the invention, a method, system, and apparatus provide a substantially balanced distribution of multiple communication sessions across multiple processing timeslots. When a request to establish a communication session is received, a processing timeslot is allocated and associated with that communication session according to a load balancing scheme to distribute communication sessions across the processing timeslots. Subsequent information for a communication session is processed during the allocated timeslot for that communication session.

Abstract: A computer networking system, method and device for multiplexing HTTP requests and demultiplexing HTTP responses. The method may include receiving HTTP requests from a plurality of clients and routing those requests to a socket on a server system. The method may also include receiving HTTP responses from the server system and selectively routing those responses to the corresponding clients.

Abstract: A technique for implementing an admission control scheme for data flows is disclosed. In one embodiment, the technique is realized by determining a current error value in response to a queue size in a packet buffer; generating a packet drop probability based at least in part on the current error value; receiving a data packet having a data type; and determining whether to reject or accept the received data packet at a queue based at least in part on the packet drop probability and a predetermined flow rejection threshold. In addition, the technique may involve determining whether a randomly generated number is less than or equal to the packet drop probability and determining whether a count variable is greater than or equal to an inter-drop interval.

Abstract: A method and apparatus are disclosed for adjusting the bandwidth of a connection between at least two communication endpoints in a data network via a monitoring unit and a control unit. The connection in the data network is assigned at least one transmission channel for data transmission. The user data is, in this case, allocated to at least one communication connection; in particular a voice connection. The monitoring unit monitors the signaling connection for requests for at least one further communication connection; in particular, a voice connection. When a request occurs, it signals to the control unit to assign to the connection one or more additional free transmission channels for the at least one requested communication connection.

Abstract: Disclosed are, inter alia, methods, apparatus, data structures, computer-readable media, and mechanisms, for scheduling items in a system, such as, but not limited to a computer or communications system. For example, in one implementation, each of the items in a set of items has an associated deficit and mini-deficit. A next particular item is selected from the set of items currently having enough deficit to process the particular item. One or more entities associated with the particular item is processed a commensurate amount corresponding to the mini-deficit associated with the particular item. This processing is repeatedly performed until there are no more entities associated with the particular item or until the deficit associated with the particular item does not allow any further processing at the current time.

Abstract: A frequency manager automatically selects a clock frequency for each device or bus, or for a plurality of devices or buses, in a system, based on various factors and objectives. These factors and objectives can include optimizing performance of the devices without exceeding the system's power/thermal budget. The frequency manager can then control circuits that generate and provide clock signals having the selected frequency(ies) to these devices or buses. For example, in a system that is less than fully populated with devices, embodiments of the invention can select higher clock frequencies than a fully populated system would utilize. Some embodiments of the invention select higher clock frequencies for high-bandwidth devices than for low-bandwidth devices. Other embodiments use information about application programs that will be executed by systems, such as which devices these application programs will frequently access, to select higher clock frequencies for the frequently accessed devices.

Abstract: In a UMTS network, each packet data service user requires a dedicated channel (DCH) to transmit at high data rates. However, the number of DCHs available is small due to code and power limitations. Thus many users will have to be allocated the same DCH on a time sharing basis. Such sharing will not impact the quality of service for users whose applications are not delay sensitive and whose traffic generation pattern toggles between transmit and idle states. Such applications include web browsing, FTP sessions and E-mail. The present invention discloses four algorithms that can be used to dynamically allocate DCH channels to a contending user based on the user's need according to its traffic generation.

Abstract: The present invention is directed to a method and apparatus for scheduling a resource to meet quality of service guarantees. In one embodiment of three levels of priority, if a channel of a first priority level is within its bandwidth allocation, then a request is issued from that channel. If there are no requests in channels at the first priority level that are within the allocation, requests from channels at the second priority level that are within their bandwidth allocation are chosen. If there are no requests of this type, requests from channels at the third priority level or requests from channels at the first and second levels that are outside of their bandwidth allocation are issued. The system may be implemented using rate-based scheduling.

Abstract: In a packet scheduler, an arithmetic-operation controlling means designates output ports in a time-sharing manner and a parallel arithmetic operation means performs an arithmetic operation common with the queues of each designated output port to obtain packet output completion due times (evaluation factors) of the top packets of queues of each output port. Intra-port selecting means selects the evaluation factor of a packet that is to be preferentially output for each output port based on the result of the arithmetic operations. Then inter-port selecting means determines one to be most-preferentially output from the top packets selected based on the selected evaluation factors and the bandwidths for the output ports. Therefore, an apparatus for controlling packet output having such a packet scheduler can realize accurately control bandwidths of a plurality of queues, high-speed processing and the reduced size thereby being incorporated in hardware.

Abstract: An out-of-band signaling model media control (MC) terminal for an HPNA network includes a QoS management entity (QME) and an admission control entity (ACE) and provides end-to-end QoS by passing the QoS requirements from higher layer to the lower layers of the HPNA network. The QME receives an end-to-end QoS message characterizing a session for a user application. The ACE performs an admission control decision relating to the session based on the end-to-end QoS message characterizing the QoS stream. A resource control module, when part of the ACE, performs at least one admission control decision relating to the session based on a resource permission, and a policy control module, when part of the ACE, performs at least one admission control decision relating to the session based on a policy permission.

Abstract: In one embodiment, an apparatus for coordinating merging of packets for one or more virtual circuits (VGs). Each packet of a VC comprising a sequence of cells terminates with an end of packet (EOP) cell. The apparatus comprises one or more buffers, a buffer controller, and a merge processor. Each buffer is configured to receive cells of an associated VC and a threshold value based on traffic of the VC. When a number of cells of a packet in a buffer exceeds the corresponding dynamic threshold value, a corresponding flag of the buffer is set. The buffer controller is configured to drop all cells of the current packet in response to a set flag of a corresponding buffer. The merge processor services each buffer in accordance with a scheduling method to transfer one or more packets from each buffer to an output packet stream.

Abstract: A communication system includes a plurality of devices, such as cable modems, in communication with a station, such as a cable modem termination system, that provides efficient upstream bandwidth sharing.

Abstract: Systems and techniques for scheduling of data transmission to remote mobile units so as to provide at least an acceptably low level of delay. A scheduler computes an urgency value for each data stream serving a mobile unit and sets the urgency value equal to the highest urgency value of a data stream serving the mobile unit. The scheduler computes a scheduling priority for each mobile unit based on a computation that takes into account the urgency value of the mobile unit and schedules the highest priority mobile unit for service, selecting the highest priority data stream serving the mobile unit scheduled for transmission. The urgency value for a data stream depends on the sensitivity of the data stream to delay and the delay experienced by the data stream. Computation of the urgency value may take into account a delay limit associated with the data stream.

Abstract: Methods, apparatuses and systems facilitating the distribution of updated traffic identification functionality to bandwidth management devices. The present invention, in one embodiment, allows for automatic updates to the traffic identification functionality implemented by bandwidth management devices eliminating the cumbersome upgrade processes required by prior art methods and systems. The present invention, in one embodiment, also provides a system facilitating management of upgrades for multiple bandwidth management devices.

Abstract: A method and system is provided for establishing a secure intercarrier, interlayer communications path that can allocate bandwidth on demand. Using the present invention, one network carrier uses the resources of another carrier to communicate with an otherwise unreachable target component. As bandwidth capacity is reached, the intercarrier connection can be dynamically migrated to a lower network layer. Transmissions of the upper layer are mapped into the lower layer to satisfy the additional bandwidth requested by the connection.

Abstract: Techniques for efficient signaling to and from a plurality of mobile stations are disclosed. In one embodiment, a subset of mobile stations may be allocated a portion of the shared resource with one or more individual access grants, another subset may be allocated a portion of the shared resource with a single common grant, and yet another subset may be allowed to use a portion of the shared resource without any grant. In another embodiment, an acknowledge and continue command is used to extend all or a subset of the previous grants without the need for additional requests and grants, and their associated overhead. In one embodiment, a traffic to pilot ratio (T/P) is used to allocate a portion of the shared resource, allowing a mobile station flexibility in selecting its transmission format based on T/P.

Abstract: A frequency manager automatically selects a clock frequency for each device or bus, or for a plurality of devices or buses, in a system, based on various factors and objectives. These factors and objectives can include optimizing performance of the devices without exceeding the system's power/thermal budget. The frequency manager can then control circuits that generate and provide clock signals having the selected frequency(ies) to these devices or buses. For example, in a system that is less than fully populated with devices, embodiments of the invention can select higher clock frequencies than a fully populated system would utilize. Some embodiments of the invention select higher clock frequencies for high-bandwidth devices than for low-bandwidth devices. Other embodiments use information about application programs that will be executed by systems, such as which devices these application programs will frequently access, to select higher clock frequencies for the frequently accessed devices.

Abstract: A frequency manager automatically selects a clock frequency for each device or bus, or for a plurality of devices or buses, in a system, based on various factors and objectives. These factors and objectives can include optimizing performance of the devices without exceeding the system's power/thermal budget. The frequency manager can then control circuits that generate and provide clock signals having the selected frequency(ies) to these devices or buses. For example, in a system that is less than fully populated with devices, embodiments of the invention can select higher clock frequencies than a fully populated system would utilize. Some embodiments of the invention select higher clock frequencies for high-bandwidth devices than for low-bandwidth devices. Other embodiments use information about application programs that will be executed by systems, such as which devices these application programs will frequently access, to select higher clock frequencies for the frequently accessed devices.

Abstract: A path setting method and device to secure bandwidth for multiple paths to provide a service from a service provider to a subscriber. The path setting device determines whether a received message is a request message for a first path, the request message including requested bandwidth information for a plurality of paths set for the service required by the subscriber. The bandwidth is secured based on the requested bandwidth information set in the request message for the first path between the service provider and the subscriber in response to receiving the request message for the first path. The bandwidth may also be secured by determining whether a received message is a request message and determining whether a number of request messages received from the same subscriber reaches a number of paths set in the request message for the first path.

Abstract: Multiple bandwidth requestors (220), a bandwidth manager (420) and a forward link (410) from the bandwidth manager to the bandwidth requestors are used to allocate bandwidth in a return link beam (210). The uplink bandwidth allocation is preferably based on the information to be transmitted provided by the user Automatic Data Processing Equipment (ADPE) (300) and overall system data loading. The preferred method exercised by the bandwidth manager (420) allocates bandwidth on the return link (210) to individual user terminals in either a minimal rate required for the protocol being exercised (213), a committed information rate required for the services being requested, or a fair share rate (214) that allows maximum transfer of data from the user terminal (201) to the gateway (400).

Abstract: Dynamic adaptation of connection-oriented networks is introduced wherein, once congestion is encountered, dynamic adaptation steps may be performed. Four adaptation steps are proposed for reacting to various network congestion scenarios. It is further recommended that the steps are performed in a particular order such that the higher severity and longer sustentation of the network congestion the more strict step is performed to alleviate the network congestion. At a switch in the connection-oriented network, utilization of a trunk carried on a link connected to the switch is monitored and, if said utilization of said trunk exceeds a first threshold, a first degree of adaptation is initialized wherein use of the trunk by further connections is prevented. Subsequent degrees of adaptation are triggered when high utilization continues and surpasses higher thresholds. The subsequent degrees of adaptation involve rerouting connections that make use of the trunk.

Abstract: To optimize the performance of DSL modems in the same cable bundle, the size and position of the bandwidth used for transmission is intelligently selected when the bit rate necessary for making the transmission is less than the total available bandwidth. By intelligently selecting a minimum number of subcarriers for Digital Multi-tone (DMT) signal transmission, a reduction in line driver power consumption is effectuated. Additionally, by intelligently selecting the position of the used bandwidth within the total available bandwidth, near-end crosstalk (NEXT) noise within the cable bundle may be minimized.

Abstract: A control system is disclosed for controlling data flow over a data-packet-network according to specific destinations. The system has a network monitoring system for monitoring network performance parameters; a network access system for accessing specific nodes in the network; and a control software executable on the network access system for assigning and changing cost parameters at selected nodes in the network. A network administrator uses the network access system and control software to assign and implement cost values at the selected nodes, the values associated individually with a specific destination or destinations, the values establishing forwarding costs to be incurred at the selected nodes, and link costs to be incurred per data link between the nodes such that manipulation of such cost value assignments enables load balancing of data traveling through the network. In one embodiment the data-packet-network is internal to a router and nodes comprise internal router cards.

Abstract: A network device includes a group of queues, each having a weighted round robin mechanism. The priority queues on a port detect an overflow condition and transfer a flag to the weighted round robin device in response to detecting the overflow condition. The weighted round robin mechanism adjusts the weight associated with one or more of the priority queues in response to receiving the flag and transfers data from the queues based on the adjusted weights.

Abstract: A cell disposal avoidance system is provided that can avoid disposal of the cells resided in the QoS buffer when a traffic of a specific QoS class in an ATM switch increases. The ATM switch includes a storage cell number monitor, a software data section 813, and a software controller 812. The storage cell number monitor monitors congestion of plural QoS buffers in the buffer 3, 5. The software data section 813 stores a cell reading priority (WRR value) attached for each QoS buffer. The software controller 812 dynamically changes the WRR value when congestion of a QoS buffer is in a congestion state (at generation of cell disposal or buffer congestion alarm) and increases the WRR value of the QoS buffer in a cell disposal state. Cells are divided in a time division mode according to the weight of the WRR value and read in a round format from the QoS buffer. The ATM switch resets the WRR value to an initial value when the congestion of the QoS buffer ceases.

Abstract: A method for sharing internal excess bandwidth between output and input termination modules of a switching network including a switch core fabric (FC) via which a plurality of input termination modules (ITM1 to ITMn) communicate with a plurality of output termination modules (OTM1 to OTMm) through at least a point-to-point transmission channels considered as corresponding each to a virtual ingress-to-egress pipe (VIEP). Sharing of internal excess bandwidth is obtained by successive steps including a minimum bandwidth request calculation step, each request being transmitted to an output termination module for obtaining a minimum bandwidth grant in return. The minimum bandwidth request and grant related to an input termination module linked by an ingress-to-egress pipe to an output termination module are both calculated for a determined number K of relative administrative weights corresponding each to a different quality of service, with a different request and a corresponding grant for every weight.

Abstract: A scheduler, scheduling method, and computer program product are provided for implementing Quality-of-Service (QoS) scheduling of a plurality of flows with aging time stamps. Subsets of time stamp data stored in a time stamp aging memory array are sequentially accessed. Each time stamp data subset contains time stamp data for a subplurality of flows. Guaranteed aging processing steps are performed for each flow utilizing the time stamp data subsets to identify and mark invalid calendar next time values. When a new frame arrival for an empty flow is identified, flow queue control block (FQCB) time stamp data and the flow time stamp data in the time stamp aging memory array are accessed. Based on the calendar to which the new frame is directed or the target calendar for the new frame, the target calendar next time valid bit of the time stamp aging memory array data is checked.