Abstract: A semiconductor integrated circuit chip comprises a class-based queue traffic shaper that enforces multiple service-level agreement policies on individual connection sessions by limiting the maximum data throughput for each connection. The class-based queue traffic shaper distinguishes amongst datapackets according to their respective source and/or destination IP-addresses. Each of the service-level agreement policies maintains a statistic that tracks how many datapackets are being buffered at any one instant. A test is made of each policy's statistic for each newly arriving datapacket. If the policy associated with the datapacket's destination indicates the agreed bandwidth limit has been reached, the datapacket is buffered and forwarded later when the bandwidth would not be exceeded.

Abstract: A heterogeneous-network switch comprises a number of different-type media access controllers (MAC's) each respectively for connection to otherwise incompatible computer networks. An incoming data bus is connected to collect datapackets from each of the different-type MAC's. An outgoing data bus is connected to distribute datapackets to each of the different-type MAC's. And, a traffic shaping cell (TSCELL) having an input connected to the incoming data bus and an output connected to the outgoing data bus, provides for traffic control of said datapackets according to a bandwidth capacity limit of a corresponding one of said otherwise incompatible computer networks to receive them. The switch is based on a class-based queue traffic shaper that enforces multiple service-level agreement policies on individual connection sessions by limiting the maximum data throughput for each connection.

Abstract: A network-node bandwidth-allocation credit method includes computing credits after each completed scan of a packet-tracking queue. Such queue varies tremendously in depth, according to how much network traffic is transitioning through the involved network nodes. A bandwidth traffic-shaping manager operates to control the maximum bandwidth permitted to pass through each network node, e.g., by buffering datapackets that would exceed some service policy limit if forwarded immediately on receipt. As each network node runs less that its policy maximum, it is given a number of credits that collect in a bank account. If a datapacket presents itself that involves passage through the network node, such bank account is checked to see if sufficient bandwidth-allocation credits exist to forward the datapacket immediately. If so, an appropriate deduction of credits is made and the datapacket is forwarded toward its destination.

Abstract: A multicast method generates a packet-tracking queue with individual entries representing datapackets for transfer through a hierarchical network. The actual datapacket and its real payload are stored as one item in a FIFO buffer. Any packet-tracking queue entry representing a multicast datapacket is expanded into several consecutive entries, one each for the individual subscribers enrolled to receive a broadcast. A first of such expanded entries is flagged as being first, and a last such expanded entry is flagged as being last. Each expanded entry may be subject to its own unique service-level policy, with the result that the datapackets can be released and cleared in any order. If the first or last are released, then the next are marked as first or last. When only one expanded entry is left, it will be flagged as being both first and last. When it is released, the entry in the packet-tracking queue is cleared as well as the actual datapacket and its real payload in the FIFO buffer.

Abstract: A method and a semiconductor intellectual property embodiment of the present invention comprise a class-based queue traffic shaper that enforces multiple service-level agreement policies on individual connection sessions by limiting the maximum data throughput for each connection. The class-based queue traffic shaper distinguishes amongst datapackets according to their respective source and/or destination IP-addresses. All limit checking is done in one clock cycle for the entire network hierarchy above a particular node, and previously independent and separate queues are combined into one super queue.

Abstract: A method comprises using a class-based queue traffic shaper that enforces multiple service-level agreement policies on individual connection sessions by limiting the maximum data throughput for each connection. The class-based queue traffic shaper distinguishes amongst datapackets according to their respective source and/or destination IP-addresses. Each of the service-level agreement policies maintains a statistic that tracks how many datapackets are being buffered at any one instant. A test is made of each policy's statistic for each newly arriving datapacket. If the policy associated with the datapacket's destination is currently buffering, or holding, any datapackets, then the newly arriving datapacket is sent to be buffered too. This allows the longest waiting datapacket for the particular destination to be released and cleared from the buffer first.

Abstract: A network comprises a local group of network workstations and clients that periodically need access to a wide area network like the Internet. A class-based queue traffic shaper is placed in between and enforces multiple service-level agreement policies on individual connection sessions by limiting the maximum data throughput for each connection. The class-based queue traffic shaper distinguishes amongst datapackets according to their respective source and/or destination IP-addresses. Which policy is appropriate to enforce is found by placing all IP-addresses with policies attached to them into an ordered list of three-byte segment numbers. The least significant byte of an IP-address is dropped to form a segment number. Classification then depends on finding the IP-address in a datapacket to the ordered list of segment numbers. If a match occurs, an index lookup table for the respective segment allows the least-significant fourth byte of the IP-address to point to the bandwidth policy to use.

Abstract: A network comprises a local group of network workstations and clients that periodically need access to a wide area network like the Internet. A class-based queue traffic shaper is placed in between and enforces multiple service-level agreement policies on individual connection sessions by limiting the maximum data throughput for each connection. The class-based queue traffic shaper distinguishes amongst datapackets according to their respective source and/or destination application types. Which policy is appropriate to enforce is found by listing all standard port numbers for an application in a single port group. Policies are attached according to port group. The field of over 64K possible port numbers is thus reduced to a short list of application groups, e.g., twelve or less. When a datapacket arrives that needs to be classified according to application, its port numbers are used to index a port group table This returns an application type and a concomitant service-level agreement policy.