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 …

The method of the invention includes the step of transmitting a priority indicator containing
information indicating the priority of network traffic over a connection to a downstream node …

A packet scheduling method and apparatus is described for enqueuing incoming data
packets in sessions, and for storing the sessions in sequential order in service-groups. Each …

(57) ABSTRACT A method and apparatus are provided for scheduling a het erogeneous
communication flow. A heterogeneous flow is a flow comprising packets with varying classes …

Packets are scheduled for transmission over a communication link in a network, using a
Largest Weighted Delay First (LWDF) scheduling policy. A delay measure W i, i= 1, 2,... N, is …

A method and apparatus for implementing Quality of Service (QoS) policy in a data
communications network. An active flow content addressable memory (CAM) contains …

An apparatus for distributing processing loads in a service aware network is provided. The
apparatus contains a controller and a plurality of packet processors coupled to the controller …

A packet is classified into a class. A priority value is assigned to the packet wherein packets
in a flow are assigned priorities according to some probability distribution within some band …

A method and apparatus are provided for implementing automatic congestion avoidance for
differentiated service flows in a communications network. A bandwidth control signal …

A content addressable memory (CAM or L3 Table) contains flow information for each active
flow of packets passing through a given node of a data communications network. The CAM …