Adrian E Eckberg

20030202528, Oct 30, 2003

Apr 30, 2002

10/136840

Adrian Eckberg - Holmdel NJ, US

H04L012/28

370/412000

Techniques are provided to allow a jitter buffer to automatically reach a quiescent number of packets in the jitter buffer, based on current network conditions. Generally, no explicit jitter buffer delay is assumed, and a current packet is repeat played if no new packets are available in the jitter buffer. If there are too many packets in the jitter buffer, a newly received packet is discarded. When a packet is replayed, the delay associated with a jitter buffer is effectively increased. This is not an explicit jitter buffer delay, but, instead, there is an implicit delay associated with the jitter buffer. When a packet is discarded, the delay associated with a jitter buffer is effectively decreased. Again, this is an implicit jitter buffer delay. By repeat playing packets and discarding packets when the jitter buffer is full, an appropriate level of packets may be determined and maintained in the jitter buffer.

47698101, Sep 6, 1988

Dec 31, 1986

6/948151

Adrian E. Eckberg - Holmdel NJ
Daniel T. Luan - East Brunswick NJ
David M. Lucantoni - Eatontown NJ
Tibor J. Schonfeld - Livingston NJ

American Telephone and Telegraph Company, AT&T Bell Laboratories - Murray Hill NJ

H04J 326

370 60

In a packet switching network, packet monitoring and marking algorithms are used for determining which data packets, received from a customer by an access node, are being transmitted at an excessive transmission rate and accordingly are marked. Additionally every packet from a special customer can be marked. Along in the network, marked packets are dropped where the network is congested along the path being traversed by the data packets.

47698110, Sep 6, 1988

Dec 31, 1986

6/948152

Adrian E. Eckberg - Holmdel NJ
Daniel T. Luan - East Brunswick NJ
David M. Lucantoni - Eatontown NJ
Tibor J. Schonfeld - Livingston NJ

American Telephone and Telegraph Company, AT&T Bell Laboratories - Murray Hill NJ

H04J 326

370 60

A method for controlling congestion in a packet switching network uses a packet dropping algorithm to determine when to drop a marked packet wherever the network is congested at any point along the path being traversed by the marked packet.

6189043, Feb 13, 2001

Jun 9, 1997

8/871106

Cagatay Buyukkoc - Holmdel NJ
Adrian Emmanuel Eckberg - Holmdel NJ
Pravin Kumar Johri - Aberdeen NJ
Danielle Liu - Holmdel NJ

AT&T Corp - New York NY

G06F 15173

709241

The distribution of replica caches of information is dynamically optimized among the regions of a network, based upon the changing usage patterns. Initially, a single server in a first region stores the primary copy of information. A router in the first region receives service request messages from the plurality of users throughout network, directed to the server storing the primary copy. To determine if it is justified to deploy a replica cache, the router transmits a monitor request message to other routers in other regions of the network, requesting them to monitor all service requests in their respective regions, being directed to the primary copy in the first server. The first router then computes an optimum assignment of a replica copy of the information, for storage in at least one newly assigned server in the network. The first router transmits a replication message to the newly assigned server, to enable it to store the replica copy of the information and provide service to user terminals in a newly assigned set of regions of the network. The first router also transmits an assignment message to the other routers in the network, to enable them to redirect traffic from their respective regions to either the newly assigned server or to the first server.