Abstract: A system for monitoring a workload for a data content delivery apparatus of a communications network. The delivery apparatus delivers content to mobile users via buffered RF link over a fixed bandwidth. A last router routes the content from the delivery apparatus to RF link buffer(s) for transmission to the users. A monitor determines, from the delivery apparatus, parameters describing the content and determines, from the router, bandwidth utilization via the buffer(s), and reports, to the delivery apparatus, bandwidth available for allocation to the content based on the parameters and the bandwidth utilization. The system tracks overall data transfer rates for the network and provides information that can be used to optimize available bandwidth.

Abstract: A system and method for minimizing blocking in optical networks utilizes algorithms developed to reduce non-revenue generating OEO conversions as a result of blocking based on routing and wavelength and/or subband assignment. Demands are prioritized on a basis of optical reach, and regenerators required for overcoming optical reach limitations are strategically placed to overcome blocking.

Abstract: A scheduler apparatus provides bandwidth guarantees to individual data packet flows as well as to aggregations of those flows (referred to as “bundles”) in a completely transparent manner, i.e., without using any additional scheduling structure. For each bundle, the scheduler determines the ratio between the bandwidth nominally allocated to the bundle and the sum of the individual bandwidth allocations of the flows that are currently backlogged in the bundle. The scheduler uses that ratio to modulate the timestamp increments that regulate the distribution of bandwidth to the individual flows. In this manner, the greater the ratio for that bundle, the more the bandwidth that each backlogged flow in the bundle receives.

Abstract: The invention relates to a communications system and a method for establishing a broadband connection, for example a multi-media connection between two or more users, by means of exchanges in a communications network, for example an ATM network. According to the invention, when the exchanges receive a request from a calling user to establish a broadband connection, said exchanges first establish a minimal connection between the users and once the minimal connection is in operation between the users, the requested broadband connection is established. The users of broadband network capacities, which have been reserved by the network at the request of the user, are billed during the call phase. Broadband connections of this type can receive a higher priority than the upgrade of minimal connections to complete connections. A voice connection comprising audio data constitutes for example a minimal connection. The broadband connection takes place for example between video telephones.

Abstract: Methods and apparatus are disclosed for scheduling items (e.g., packets, processes, etc.) in a system, such as, but not limited to a computer or communications system (e.g., router, switch, etc.) In one implementation, multiple sets of items requiring processing to be performed are maintained. A current set of the multiple sets of items is identified. Each of the items in the current set is processed. In one implementation, this processing includes identifying a particular item in the current set, adding a quantum to a deficit of the particular item, processing an entity corresponding to the particular item, decreasing the deficit of the particular item by a value, determining if the deficit allows the particular item to be further processed, and moving the particular item from the current set to another of the multiple sets of items after said determining if deficit allows the particular item to be further processed.

Abstract: A pipelined scheduler which allows easy implementation and control and further fair scheduling among input lines of a crossbar high speed switch fabric is discussed. By means of a round-robin communication scheme, a systematically ordered sequence of visits to time slots can be obtained regardless of whether the number of scheduler modules is even or odd by framing the time axis and using a priority matrix to reserve future time slots. Further, a Carry Over Round-robin Pipelined Scheduler (CORPS) achieves scalability to a large number of ports. Moreover, CORPS achieves one scheduling decision per line per slot, by scheduling packets in future slots. It is well suited to the support of Quality of Service traffic, since the choice of the queues to be scheduled is arbitrary. CORPS limits itself to resolve, in a fair way, the contention for output ports.

Abstract: Based on requested bandwidths received from all edge nodes and destination edge nodes, the total reservation of the bandwidths requested by respective edge nodes for each link is calculated, and the total value is subtracted from the maximum admissible bandwidth of the link to obtain the residual bandwidth, and it is decided whether a new requested bandwidth is less than the residual band of which link of the path to the destination edge node.

Abstract: There is provided a packet scheduler for managing output awaiting packets stored in a plural of queue blocks each having a weighting coefficient settled based on an output guaranteeing bandwidth, whereby an output order for the head packets is stored in respective queue blocks. The packet scheduler includes means for controlling selection of a queue having a packet to be sent at the highest priority, based on scheduled output time information obtained by calculation using management information of the output awaiting packets and the weighting coefficient of each queue, and means for correcting processing carried out in the controlling means based on the current time information. The arrangement enables to ensure assignment of vacant bandwidth in a fair manner while suppressing erroneous operation deriving from deviation of a scheduled packet output time from the real time caused by a calculation error or the like in WFQ calculation.

Abstract: Available bandwidth utilization during transfer of large files over a TCP/IP network is improved by load balancing data streams and dynamically controlling the number of data streams utilized. A determination is made of the optimum number of data streams for a particular data file transfer in the early stage of transmission. An initial number of data streams, which is one unless otherwise specified or determined, is used to transmit one or more file segments, each on a different data stream, immediately followed by a second initial number of data streams, which is at least two greater than the initial number of data streams, is used to transmit another portion of the large data file. During each transmission, individual and aggregate transmission bandwidths are determined. Responsive to a determination that the latest aggregate transmission bandwidth is significantly different from the previous aggregate transmission bandwidth, the number of data streams is modified.

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. Best effort data users with different radio link qualities may have different amounts of data delivered to them using the same amount of radio resource. In the context of link adaptation, this characteristic complicates the fairness issue in cellular environments and has a profound impact on the overall system performance. As a result, 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.

Abstract: The invention relates to an apparatus and a method for improving the load distribution in a signaling network having a large number of signaling nodes (A, B) and a large number of signaling channels (L0, L1, L2, L3), with overloading in the signaling network being reliably prevented by taking account of a respective individual bandwidth (EBB0 to EBB3).

Abstract: In a communication network that includes a plurality of nodes interconnected by links, a method for routing a data flow includes receiving a request to allocate one or more resources in the network so as to carry the data flow between first and second ones of the nodes over one of a plurality of paths therebetween, each such path including a respective sequence of the links. For the links included in each of the paths, respective levels of use of the requested resources due to communications in process over the network are determined. The path that is to carry the data flow is selected responsive to the determined levels of use of the requested resources on the links included in each of the paths.

Abstract: A communication system includes multiple network interfaces interconnected using synchronous transport resources, such as a SONET ring. These interfaces couple to various communications networks and provide access for these networks to the synchronous transport resources. In response to relatively simple commands, these interfaces may couple attached asynchronous networks to the synchronous transport resources. With appropriate messages communicated to two of these interfaces, this system provides for the provisioning of synchronous transport resources between two asynchronous networks to support network-to-network communications.

Abstract: A system and method for locally determining a fair allocated bandwidth for a network node configured to send and receive packets in an upstream direction and a downstream direction is disclosed. A local allocated bandwidth is allocated for locally generated network packets sent in the downstream direction. A minimum downstream available network bandwidth is determined from information received in the upstream direction. The local allocated bandwidth is adjusted based on the minimum downstream available network bandwidth and the local allocated bandwidth is used to govern whether a class of locally generated network packets are sent in the downstream direction.

Abstract: A method dynamically allocates and renegotiates bandwidth to traffic having a variable data rate in a network. A current data rate and current allocated bandwidth is measured. A future data rate for the traffic is predicted. A cost function is then minimized based on the current data rate, the current allocated bandwidth, and the future data rate to determine a future bandwidth to be allocated for the traffic so that a cost of the renegotiation is minimized over time.

Abstract: A scheduling system for IP routers is provided. A programmable scheduler for IP routers can support single stage and multistage scheduling. This allows flexible combinations of scheduling and widens dramatically the available QoS solutions to operators. With this kind of scheduling the router can be configured to support almost any known scheduling method or combination. Priority Queuing (PQ) and Deficit Round Robin (DRR) scheduling is scheduling is used according to one embodiment of the invention.

Abstract: In a method of fair queue servicing at a queuing point in a multi-service class packet switched network, incoming packets are received in buffers and outgoing packets are scheduled by a weighted fair queue scheduler. Real-time information of buffer usage along with the minimum bandwidth requirement is used to dynamically modify the weights of the weighted fair queue scheduler.

Abstract: An optical distribution network system includes an OLT; a plurality of ONUs; a first optical network and a second optical network, one of which connects the OLT with the plurality of ONUs; and a bandwidth controller. The bandwidth controller apportions the plurality of ONUs between the first optical network and the second optical network, assigns a predetermined transmission bandwidth to each of the plurality of ONUs, and accepts a bandwidth change of the transmission bandwidth. It solves a problem of a conventional optical distribution network system in that the maximum bandwidth available by DBA (dynamic bandwidth assignment) is equal to the total transmission bandwidth of working side minus the sum total of the minimum cell rates of the ONUs, and hence it cannot secure a large usable bandwidth for DBA, when congestion of bandwidth increase takes place among the plurality of ONUs.

Abstract: A service of reducing the number of tunnels in exchange for a specified service fee. A communication system, which generates tunnels in physical lines and multiplexes a plurality of sessions on the physical lines, comprises a monitor unit for monitoring the state of use of tunnels and sessions used by the user when the user using a plurality of tunnels is a customer who requires service of reserving sessions in a smaller number of tunnels in exchange for a specified service fee; a tunnel/session control unit performs control so as to gather the plurality of sessions of said user in a specified tunnel when the sessions currently used by the user can be reserved in a smaller number of tunnels; and a charging unit for charging a usage rate according to the number of tunnels or the number of physical lines used.

Abstract: An approach to queuing data at a network switching node includes assigning a queue value such as a priority value or a weight to each of a plurality of queues which temporarily store data packets to be forwarded toward a link on the network. A bandwidth value related to a maximum amount of data to be transferred on the link is defined. A data limit value is assigned to each of the queues to limit the amount of data that can be forwarded from each queue. The data limit value is derived from the bandwidth value for the link. By placing bandwidth-related limits on the queues, low-priority queues are prevented from being dominated by high-priority queues, that is, low-priority queues are not prevented from forwarding their data by the priority structure. Also, the bandwidth-related limits allow for control of traffic flow to prevent overloading lower-capacity links on the network.

Abstract: A method for allocating a bandwidth between a plurality of network terminals (NTx) coupled, via a common link (L), to a main network station (LT) in a communication network. A medium access controller (MC) forwards permits to the network terminals, each permit containing a terminal identifier and allowing a predetermined share of bandwidth. It comprises two sets of counters, each set including one counter (Gx or Fx) for each terminal. The bandwidth is split into a guarantee bandwidth that is shared by operating the first set of counters and an excess bandwidth that is shared by operating the second set of counters. The guaranteed bandwidth is allocated according to fixed weights, and the excess bandwidth is also allocated according to weights. The weights for the excess bandwidth are either fixed or varying according to the load status of the terminals.

Abstract: The network switch described herein provides a cell/packet switching architecture that switches between line interface cards across a meshed backplane. In one embodiment, the switching can be accomplished at, or near, line speed in a protocol independent manner. The protocol independent switching provides support for various applications including Asynchronous Transfer Mode (ATM) switching, Internet Protocol (IP) switching, Multiprotocol Label Switching (MPLS) switching, Ethernet switching and frame relay switching. The architecture allows the network switch to provision service on a per port basis. In one embodiment, the network switch provides a non-blocking topology with both input and output queuing and per flow queuing at both ingress and egress. Per flow flow-control can be provided between ingress and egress scheduling. Strict priority, round robin, weighted round robin and earliest deadline first scheduling can be provided.

Abstract: A method and system are disclosed for providing voice communication over a packetized network in which quality of service is guaranteed for voice communications. The method involves identifying reserved paths within the network, such as multi-protocol label switching paths. When a call is made, the identified reserved paths are evaluated to determine whether each contains sufficient bandwidth for the requested voice communication. The effective bandwidth for the call is estimated based on the codec used for the call, the service class parameter set from the caller's user profile, the time of day, and other parameters. A priority parameter is set for the requested voice communication, which may be based on the service class parameter, and is mapped to a specific Differentiated Service Code Point (DSCP) and 802.1p service class parameter. If the reserved path is determined to contain sufficient bandwidth, the requested voice communication is transmitted over the reserved path at the set priority.

Abstract: A method and system for combing requests for data bandwidth by a data provider for transmission of data over an asynchronous communication medium is provided. A headend receives one or more bandwidths requests from one or more cable modems via upstream communication. A scheduler then combines one or more bandwidths requests from the same cable modem to create a single data burst bandwidth. The headend then grants the data burst bandwidth to the appropriate cable modem via downstream communication.

Abstract: An ATM/TDM cross-connection in a digital loop carrier (DLC) network providing switching and bandwidth management facilities. TDM traffic is encapsulated in ATM cells and transported from network terminations to subscriber terminations in a digital loop via a plurality of digital loop carrier switching systems (DLCSSs). The DLCSSs are configured such that TDM traffic encapsulated in ATM cells may be transported from the network termination to the subscriber termination without having to perform TDM switching at the intermediate DLCSSs.

Abstract: A method, and corresponding apparatus, applies to individual base stations in a wireless communications systems, where each base station performs rate assignment to mobile stations optimally, but independently of the other base stations. Different base stations affect each other through other cell interference, and continuously modify their reversed link rate assignment based on the other-cell interference received and the requested rates from the mobile stations. The base stations converge to a stable condition with uncoordinated optimizations. The optimizing technique maximizes total through put in each cell (maximizing rates) while maintaining interference to other cells at a minimum level, and being subject to at least some of the following constraints: mobile station's maximum transmit power, mobile station's requested rate, discrete set of possible rates, maximum rise-over-thermal interference at the base station, and minimum required received error per bit normalized for noise.

Abstract: A method to utilize unscheduled bandwidth in a calendar-based VC scheduling scheme by caching a plurality of virtual connections for processing. A plurality of virtual connection addresses are stored in a cache memory. A virtual connection corresponding to one of these addresses is processed if one of the time periods for transmitting on the trunk is liable to be wasted because no cell is available through the normal calendaring algorithm. A VC cache is added to the VC scheduler in “parallel” with the calendar-based scheduler. When the calendar-based scheduler has a time period in which no VC is scheduled for transmission on the trunk, a VC address is obtained from the cache and that VC is processed. What makes this scheme work is the observation that the VCs that have been active will have more cells to transmit.

Abstract: A cell disposal avoidance system is provided that can avoid disposal of cells resided in the QoS buffer when a traffic of a specified 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 and system for sharing over-allocated bandwidth between different classes of service in a wireless network. Traffic is transmitted for a first service class in excess of bandwidth allocated to the first service class using unused bandwidth allocated to a second class. After transmitting traffic for the first service class in excess of bandwidth allocated to the first service class using unused bandwidth allocated to a second class, traffic for a third service class is transmitted in unused bandwidth remaining in the second service class.

Abstract: An apparatus and method for DBWRR (Delay Bound Weighted Round Robin) cell scheduling in an ATM (Asynchronous Transfer Mode) switch. More particularly, the present invention provides an apparatus and method for DBWRR cell scheduling in a high-speed ATM switch which can meet requirements for a cell transfer delay of real-time traffic in the ATM switch and minimize a processing overhead of the switch.

Abstract: A system and method for optimizing bandwidth efficiencies in the distribution of digital video, digital audio and data over a cable television system is provided. In accordance with the invention, different transmission channels or portions thereof can be dynamically customized to contain only those digital video, digital audio and data components of value at that time to the customers served by those channels. This customization requires a dynamic bandwidth management component which has the ability to monitor and react to changing customer usage patterns and to instruct a re-multiplexor to allocate bandwidth from digital services that require less bandwidth at a given time to services that require more bandwidth.

Abstract: A packet scheduling apparatus made it possible to always hold priority orders determined in advance for preferentially controlled priority queues while guaranteeing reserved bandwidths for bandwidth guaranteed queues. This packet scheduling apparatus is configured by a service time computing unit for computing service times for bandwidth guaranteed queues and priority queues having high priority orders based on input plurality of predetermined parameters, a service time comparing unit for comparing magnitudes of the computed service times with each other and selecting the packet to be output first, and a parameter generating unit for generating the parameters computed so as to achieve both a bandwidth guarantee and preferential control.

Abstract: In ATM networks, digital data in ATM cells are sent to a destination node over more than one transmission link in round robin fashion. This is called inverse multiplexing. At connection start-up, the source node informs the destination node of the specific round robin fashion of the transmission links so that the ATM cells are reassembled in a proper sequential order. Inverse multiplexing control cells are used to communicate between the source node and destination node for connectivity testing of transmission links. Cell stuffing is also provided in one embodiment to accommodate non-synchronized links among transmission links. In a particular embodiment, two consecutive control cells indicate a stuffing cell. A start-up procedure is described when not all the transmission links are usable.

Abstract: An adaptive weighted round robin scheduling apparatus and method schedules variable-length frame transmissions from a plurality of output queues having different transmission priorities by first allocating, for each queue, a number of bandwidth segments for a bandwidth cycle and a number of transmission opportunities for a round robin cycle, and then processing the queues consecutively in a round-robin fashion, beginning with a highest priority queue, until none of the queues has any bandwidth remaining. More specifically, during each iteration of a round robin cycle, a queue is permitted to transmit a frame if the queue has at least one remaining transmission opportunity, the queue has a frame ready for transmission, and the queue has at least one remaining bandwidth segment, and furthermore the number of transmission opportunities for the queue is decremented by at least one.

Abstract: An embodiment of the present invention comprises a wireless communication network topology having a wireless head end coupled to multiple Internet Service Providers, which are in turn coupled to the Internet. In addition, the topology features a radio transceiver in a tower coupled to the wireless head end via an Ethernet switch for sending and receiving data to and from customer premise equipment, which in turn is coupled to a host computer or a network of host computers. The wireless head end may perform traffic control and forwarding operations for data received from the Network Service Providers and the host computer(s). The wireless head end may also perform security measures to ensure that only messages from valid host computers are forwarded to the Network Service Providers. The customer premise equipment can assign a private IP address range to the computer(s) and perform network address translation.

Abstract: A method for scheduling data packets from a plurality of flows into a single flow. Data packets are broken into data segments and assigned a slack value based on how long the segment can wait until transmission begins. Every time a transmission opportunity passes, the slack value of the segment is decreased. The scheduler prioritizes the segments based on their slack value.

Abstract: A method and apparatus for implementing Quality of Service (QoS) policy in a data communications network. An active flow content addressable memory (CAM) contains entries of flow information for each active flow of packets passing through a given node of the data communications network. The CAM has associated with each entry a packet counter, a byte counter, a token bucket, and a contract value. Each flow is assigned one of a plurality of output queues and optionally at least one output threshold value. A token bucket algorithm is employed on each flow to determine whether packets from that flow exceed the contract value. Such packets may be dropped or optimally modified to reflect an alternate output queue and/or alternate threshold before being sent to the selected output queue for transmission from the node.

Abstract: A system and method for controlling admission of a communication in a network are disclosed. In the network, a virtual circuit having a predetermined bandwidth is provided. A request is received for a communication having a communication bandwidth, and a total utilized bandwidth of the virtual circuit is calculated, including the communication bandwidth. If the total utilized bandwidth is less than the predetermined bandwidth of the virtual circuit, then admission in the network is granted to the communication.

Abstract: An integrated network switch having multiple network switch ports for outputting data frames also includes a dequeuing system for selectively supplying a data frame for output according to a specified priority by an output switch port. The dequeuing system includes, for each network switch port, a plurality of priority queues configured for holding assigned data frames based on respective priorities assigned by switching logic. A weighted round robin scheduler supplies the assigned data frames held in the priority queues to the output switch port according to a prescribed weighted round robin scheduling. In addition, the dequeuing system uses token bucket filters for selectively passing the assigned data frames to the respective priority queues in a manner that ensures that a given data frame having a large size does not interfere with bandwidth reserved for high-priority packets requiring guaranteed quality of service.

Abstract: A communication system CS includes a plurality of communication stations and data communication is performed between any two communication stations, one is a transmitting station and the other is a receiving station. When any data for transmission is generated, the transmitting station transmits, to the receiving station, a reservation request packet for requesting bandwidth reservation. The receiving station reserves a bandwidth responding to the reservation request packet and then transmits a communication reservation packet to inform the transmitting station of the reserved bandwidth. The transmitting station creates a data packet and then transmits the created data packet through the informed bandwidth. The receiving station stores a valid period of the bandwidth reserved for the transmitting station, and voluntarily and repeatedly creates, for transmission, the communication reservation packet for the duration of the stored valid period.

Abstract: Management of the bandwidth capacity of tunnels through a network may be automated such that the network is adaptive to the stochastic nature of incoming traffic. An edge node in the network includes four main elements. Three of the elements, namely tunnel signaling, admission control and path selection, are derived from known technologies, generalized from their particular technologies and enhanced. With the addition of a fourth element, called capacity management, the four elements cooperate to accommodate the capacity needs of the traffic incoming to the network at the edge node. This accommodation is performed by estimating the traffic demand and dynamically adapting tunnels to the traffic demand.

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 process control method and system including partitioning transmit decisions and certain measurements into one logical entity (Data Plane) and partitioning algorithm computation to update transmit probabilities into a second logical entity (Control Plane), the two entities periodically communicating fresh measurements from Data Plane to Control Plane and adjusted transmit probabilities from Control Plane to Data Plane. The transmit probability may be used in transmit/discard decisions of packets or instructions exercised at every arrival of a packet or instruction. In an alternative embodiment, the transmit probability may be used in transmit/delay decisions of awaiting instructions or packets exercised at every service event.

Abstract: A method, apparatus, and computer program product for dynamic bandwidth allocation in a packet switched network having a ring architecture is disclosed. The method includes monitoring an occurrence of a contention of resources at a participating node and its neighboring nodes on the network. In response to a monitored occurrence of the contention of resources, bandwidth is dynamically allocated according to a fairness algorithm. Dynamically allocating bandwidth resolves contention of resources in a fair manner within given fairness constraints while enabling a prescribed maximum utilization of available bandwidth between the nodes. Lastly, the fairness algorithm generates fairness criteria in response to states that are local to the participating node and states obtained from the neighboring nodes.

Abstract: To determine when to service a cell queue in an ATM network, a cell scheduler can use an ideal service interval time. The ideal service interval time of each cell queue is the reciprocal of the bandwidth assigned to that cell queue. An interval based cell scheduler is then initialized by setting a time reference to zero and setting a next service time for each queue to the queue's ideal service interval. The cell scheduler then enters a repeating loop. During each iteration of the loop, the first nonempty cell queue having the smallest next service time value is selected. The selected queue is serviced and its next service time is updated by adding its ideal service interval. The time reference value is also updated. If all the queues are empty, then an idle time slot is allowed to pass. The cell queues may consists of queue groups. For example, several queues can be gathered into a queue group that assigned a single ideal service time.

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: A trunk line bandwidth reservation system is applied to an asynchronous transfer mode switching system which is coupled to a plurality of terminals.

Abstract: A technique for managing a customer's traffic in a network node, such as a service provider edge device, involves dedicating a group of queues in the network node to the customer, performing queue-specific rate shaping on the customer's traffic according to queue-specific bandwidth limitations, and performing group-specific rate shaping on the customer's traffic as a whole according to a group-specific bandwidth limitation. In an embodiment, the queues in the group are associated with different types of customer traffic in order to provide type-specific rate shaping. Further, the queues may be prioritized among each other such that unused excess bandwidth is distributed among the different traffic types in priority order.

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: A system includes interconnected computers and switching nodes. A source computer for the virtual circuits schedules message transmissions on a round-robin basis. Each switching node also forwards messages in a round-robin manner, and a destination computer schedules processing of received messages in a round-robin manner. In addition, messages are transmitted in cells to reduce delays in short messages if long messages are transmitted for one virtual circuit before transmission of a short message for another virtual circuit. For each virtual circuit, the destination computer and each switching node can generate a virtual circuit flow control message to temporarily limit transmissions if the resources being taken up by messages exceed predetermined thresholds. In addition, each switching node or computer can generate link flow control messages for transmission to neighboring devices to temporarily limit transmissions if the resources taken up by all virtual circuits exceeds predetermined thresholds.