DR. ARTHUR L. BERGER, DDS
Dentist at State Route 35, Tinton Falls, NJ

6504821, Jan 7, 2003

Jun 4, 1997

08/868857

Arthur W. Berger - Fair Haven NJ

ATT Corp. - New York NY

H04L 100

3702361, 37039541

When a network element receives a request for an increase in bandwidth via a resource management (RM) cell, the network element determines the rate that it can support. If the rate that the network element can support is less than the requested rate, rather than simply rejecting the requested rate, the network element overwrites the rate encoded in the appropriate field in the arriving RM cell with a lower rate than requested. If the network element can support the requested rate, the rate encoded in the RM cell is left unchanged and the RM cell is transmitted to the network along the connection.

6266322, Jul 24, 2001

Jun 5, 1998

9/092422

Arthur W. Berger - Fair Haven NJ
Yaakov Kogan - Fair Haven NJ

AT&T Corp. - New York NY

G01R 3108

370229

A method for dimensioning link bandwidth for elastic-data traffic for a link in a communications network, in which a number of connections N having elastic-data traffic flowing over a bottlenecked link in a communications network is determined. A transfer rate ?f for each connection is determined for the condition that the communications network is not a constraining resource for the connection. A per-connection bandwidth objective b is determined for elastic-data traffic flowing over the link. Lastly, a link bandwidth B for the link is dimensioned for the elastic-data traffic flowing over the link based on either a mean performance criterion or a tail performance criterion using the determined number of connections N, the determined transfer rate for each connection and the determined per-connection bandwidth objective b.

6160818, Dec 12, 2000

Jul 17, 1997

8/895641

Arthur W. Berger - Fair Haven NJ
Ward Whitt - Basking Ridge NJ

AT &T Corp - New York NY

H04J 316, G01R 3108

370468

A method is provided for admitting new requests for service in a shared resource having a capacity. The new request has service priority levels associated therewith. In one embodiment of the invention, for example, the shared resource may be a packet communications network and the service request may be a request to admit a new connection. The method proceeds as follows. First, for each service priority level on said shared resource, a total effective bandwidth is generated which is represented by a sum of individual effective bandwidths of previously admitted requests for service. Subsequent to receiving a new request for service having a specified priority of service level, a plurality of effective bandwidths are accessed for the new request. The plurality of effective bandwidths are respectively associated with the specified service priority level and service priority levels therebelow. The new request is admitted if, for the specified service priority level and for each service priority level therebelow, the sum of (i) said total effective bandwidth for a given service priority level and (ii) for said new request, the effective bandwidth at the given service priority is less than the capacity.

2001001, Aug 9, 2001

Aug 4, 1997

08/905560

ARTHUR W. BERGER - FAIR HAVEN NJ, US

H04L012/56

370/230000, 370/389000

Acknowledgment of acceptance of a request for bandwidth for a block transfer connection is delayed at the public network side of a boundary between a public network and a private destination network. As a result, each network element within the private destination network can either reject or reduce the requested rate encoded in a resource management (RM) cell to a level that the network element can grant. An acknowledgment RM cell is only then issued from the private destination network, which indicates either acceptance, rejection, or acceptance at a lower rate. When the source of the connection receives the acknowledgment RM cell from the private destination network, it begins to transmit at a rate that the private destination network and destination end system can support.

5274644, Dec 28, 1993

Nov 5, 1991

7/788075

Arthur W. Berger - Fair Haven NJ
Rodolfo A. Milito - Piscataway NJ
Ward Whitt - Basking Ridge NJ

AT&T Bell Laboratories - Murray Hill NJ

H04J 316

370 951

A fair and efficient admission scheme enables sharing of a common resource among N traffic classes, such that each class is guaranteed (on a suitable long-term basis) a contracted minimum use of the resource, and each class can go beyond the contract when extra resource capacity becomes temporarily available. The scheme operates in an open loop mode, and thus does not require information describing the current status of the resource. For the purposes of description, one form of the invention is best described in terms of "tokens" and "token banks" with finite sizes. Our scheme uses one token bank per class (bank `i`, i= 1,. . . ,N), plus one spare bank. Class `i` is preassigned a rate, rate(i), i=1,. . . ,N, that represents the "guaranteed throughput" or contracted admission rate for class `i`. Tokens are sent to bank `i` at rate(i).