AT&T Labs Research — Leading Invention, Driving Innovation

An arrangement where a policy manager automatically generates configuration file updates for the routers in the network, as necessary, sends those updates to the appropriate routers, and causes the routers to install the configuration file updates in real-time. The automatic generation of configuration file updates is carried out in response to information that is delivered to the policy manager from a traffic measurement and flow analysis system that replaces the prior art analyzer system. The information that is generated by the traffic measurement and flow analysis system is sensitive to thresholds that the policy manager installs in the traffic measurement and flow analysis system.

The present invention provides a method, computer-readable medium and device for dynamically managing allocation of bandwidth in a packet network using a Dynamic Setting Scheme (DSS) for Class Based Queuing (CBQ). The method includes the steps of maintaining a minimized reserved portion of bandwidth to minimize delay jitter and maximizing a shared portion of bandwidth to maximize overall bandwidth utilization. Allocation of bandwidth may be based on a sharing tree hierarchical scheme that provides for temporary borrowing of bandwidth by real-time applications from bandwidth of non-real-time applications and blocks borrowing of bandwidth by non-real-time applications from bandwidth of real-time applications. DSS typically provides for using measurable parameters, such as queue length and number of borrowing attempts per a predetermined length of time/observation window, as control triggers for implementing adjustment of bandwidth allocation. In one embodiment, the steps include measuring a predetermined parameter at predetermined observation window times and dynamically adjusting allocated bandwidth for parent classes of real-time traffic by adjusting an average of the predetermined parameter to have a value within a predetermined stable region.

The invention provides methods and systems for providing priority processing to critical data as the data is transmitted across a network. A plurality of Internet protocol (IP) packets, each of which contains data and priority information, are received at a first router. The data contained in the IP packets is then encapsulated into frame relay frames containing the priority information. The frame relay frames are transmitted from the first router to a frame relay network in a manner determined by the priority information included in the frame relay frames. The frame relay frames are then transmitted across a frame relay network to a second router in a manner determined by the priority information included in the frame relay frames

The present invention provides a method, computer-readable medium and device for dynamically managing allocation of bandwidth in a packet network using a Dynamic Setting Scheme (DSS) for Class Based Queuing (CBQ). The method includes the steps of maintaining a minimized reserved portion of bandwidth to minimize delay jitter and maximizing a shared portion of bandwidth to maximize overall bandwidth utilization. Allocation of bandwidth may be based on a sharing tree hierarchical scheme that provides for temporary borrowing of bandwidth by real-time applications from bandwidth of non-real-time applications and blocks borrowing of bandwidth by non-real-time applications from bandwidth of real-time applications. DSS typically provides for using measurable parameters, such as queue length and number of borrowing attempts per a predetermined length of time/observation window, as control triggers for implementing adjustment of bandwidth allocation. In one embodiment, the steps include measuring a predetermined parameter at predetermined observation window times and dynamically adjusting allocated bandwidth for parent classes of real-time traffic by adjusting an average of the predetermined parameter to have a value within a predetermined stable region.

In a node that receives cells for many connections, a method discards entire packets when the node's buffer is full. The selected connection is one that includes at least one cell that corresponds to the beginning of a packet. In another embodiment, the connection is chosen by first making an initial selection, determining whether that selection can stand, and if not, by making an alternate selection. When an alternate selection is made, a credit factor associated with the initial selection is decremented, while the credit factor of the alternate selection is incremented. The initial selection can be carried out by considering the overall traffic load at the node, the individual traffic loads that comprise the overall traffic load of the node, and the QoS that is desired for the various connections that are active in the node.

Calls may be distributed and load balancing maintained for a distributed automatic call distributor (ACD) system by simulating a central FIFO queue at the central routing point of the system. The simulated FIFO queue either requires that the number of calls in queue and the oldest call waiting time of calls at each automatic call distributor be periodically provided to the central routing point or event-based data be provided on each call answered in the system or not routed by the central routing point. Deviations from FIFO order of service recorded at the simulated FIFO queue may signal the need for requiring a call at another automatic call distributor. With additional information on agents available, the call removal rate may be estimated. Also, delay estimates may be updated based on comparing actual and estimated delays over time. The routing point may be updated with traffic data through, for example, a known telemarketing operations performance management system (TOPMS) or directly from the automatic call distributors via the toll telecommunications network.