Ashvin Lakshmikantha

US Patent:

8274896, Sep 25, 2012

Filed:

Oct 16, 2008

Appl. No.:

12/253038

Inventors:

Ashvin Lakshmikantha - San Jose CA, US
Mohan Kalkunte - Saratoga CA, US
Bruce Kwan - Sunnyvale CA, US

Assignee:

Broadcom Corporation - Irvine CA

International Classification:

G06F 11/00

US Classification:

3702351, 370428

Abstract:

An apparatus comprising a virtual queue configured to virtually receive virtual data units as the data units are actually received by a real queue. In various embodiments, the virtual queue may include a token counter decrementor configured to, as an entering data unit virtually enters the virtual queue, attempt to allocate the entering data unit to either the committed burst or the excess burst and decrement either the committed token counter (CTC) or the excess token counter (ETC) respectively. In one embodiment, a token counter incrementer configured to, as a data unit virtually exits the virtual queue, increment one of the token counters. In some embodiments, the virtual queue may include a congestion indicator configured to categorize the entering data unit. In various embodiments, the virtual queue may be configured to provide congestion feedback information based, at least in part, upon the state of the CTC & ETC.

US Patent:

20080219285, Sep 11, 2008

Filed:

Mar 8, 2007

Appl. No.:

11/683861

Inventors:

Peter Key - Cambridge, GB
Ayalvadi Ganesh - Cambridge, GB
Ashvin Lakshmikantha - Urbana IL, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

H04L 12/413

US Classification:

370445

Abstract:

There is a need to improve design of communications protocols in which two or more channels are provided and, optionally, in which collision avoidance is not available. An improved protocol is provided in which communications nodes pick a channel on which to transmit and collisions may occur where two nodes attempt to transmit on the same channel. The node currently occupying a channel is arranged to have a specified probability of holding onto that channel as compared to a newcomer. Other methods are described whereby a node is able to occupy more than one channel at the same time and whereby nodes each occupy approximately the same number of channels.