Jim L Mangin

6470016, Oct 22, 2002

Feb 9, 1999

09/248155

Mohan Kalkunte - Sunnyvale CA
Jim Mangin - San Ramon CA

Nortel Networks Limited - St. Laurent

H04L 1228

37039541, 37039542, 370412, 370465

An adaptive weighted round robin scheduling apparatus and method schedules variable-length frame transmissions from a plurality of output queue having different transmission priorities by first allocating, for each queue, a number of bandwidth segments for a bandwidth cycle and a number of transmission opportunities for a round robin cycle, and then processing the queues consecutively in a round-robin fashion, beginning with a highest priority queue, until none of the queues has any bandwidth remaining. More specifically, during each iteration of a round robin cycle, a queue is permitted to transmit a frame if the queue has at least one remaining transmission opportunity, the queue has a frame ready for transmission, and the queue has at least one remaining bandwidth segment, and furthermore the number of transmission opportunities for the queue is decremented by at least one. Upon transmitting a frame, the number of bandwidth segments for the queue is decreased by the number of bandwidth segments in the frame. If a queue has no frame ready for transmission, then the queue may be either penalized, in which case the number of bandwidth segments for the queue is reduced, or forced to forfeit its bandwidth segments, in which case any remaining bandwidth segments are reallocated to other queues and the number of bandwidth segments and the number of transmission opportunities for the queue are set to zero.

6671279, Dec 30, 2003

Feb 24, 1999

09/257075

Jim Mangin - San Ramon CA
Mohan Kalkunte - Sunnyvale CA
Derek Pitcher - Los Altos CA

Nortel Networks Limited - St. Laurent

H04L 1228

3703955, 370401

A technique for establishing a shortcut Virtual Channel Connection (VCC) in a Multi-Protocol Over ATM (MPOA) system detects a packet flow, and then determines whether to establish the shortcut VCC based upon an expected MPOA server response time. Specifically, an expected MPOA server response time is determined based upon an MPOA server response time history. The expected MPOA server response time is then compared to a predetermined MPOA server response time threshold to determine whether the expected MPOA server response time is within the predetermined MPOA server response time threshold. The shortcut VCC is established if the expected MPOA server response time is within the predetermined MPOA server response time threshold. Upon establishing the shortcut VCC, the MPOA server response time history is updated to reflect an actual MPOA server response time incurred when establishing the shortcut VCC.

6891835, May 10, 2005

Oct 22, 2002

10/278034

Mohan Kalkunte - Sunnyvale CA, US
Jim Mangin - San Ramon CA, US

Nortel Networks Limited - St. Laurent

H04L012/28

37039541, 37039542, 370412

An adaptive weighted round robin scheduling apparatus and method schedules variable-length frame transmissions from a plurality of output queues having different transmission priorities by first allocating, for each queue, a number of bandwidth segments for a bandwidth cycle and a number of transmission opportunities for a round robin cycle, and then processing the queues consecutively in a round-robin fashion, beginning with a highest priority queue, until none of the queues has any bandwidth remaining. More specifically, during each iteration of a round robin cycle, a queue is permitted to transmit a frame if the queue has at least one remaining transmission opportunity, the queue has a frame ready for transmission, and the queue has at least one remaining bandwidth segment, and furthermore the number of transmission opportunities for the queue is decremented by at least one. Upon transmitting a frame, the number of bandwidth segments for the queue is decreased by the number of bandwidth segments in the frame. If a queue has no frame ready for transmission, then the queue may be either penalized, in which case the number of bandwidth segments for the queue is reduced, or forced to forfeit its bandwidth segments, in which case any remaining bandwidth segments are reallocated to other queues and the number of bandwidth segments and the number of transmission opportunities for the queue are set to zero.

7233986, Jun 19, 2007

Sep 20, 2002

10/251504

Hsinlun Jair - Fremont CA, US
Jim Mangin - San Ramon CA, US

Redback Networks Inc. - San Jose CA

G06F 15/173

709223, 709212, 709226

A method and apparatus for accessing management information base data is described. A method in a network element comprises collecting a first set of management information base (MIB) data in a framer's memory, maintaining a second set of MIB data that is periodically updated with the first set of MIB data, wherein the second set of MIB data is maintained separately from the first set of MIB data; and, in response to a request for the MIB data, transmitting the second set of MIB data.

59058706, May 18, 1999

Sep 11, 1996

8/709889

Jim Mangin - San Ramon CA
Shashank Merchant - Sunnyvale CA
Mohan Kalkunte - Sunnyvale CA

Advanced Micro Devices, Inc - Sunnyvale CA

G06F3/00;13/00

39520064

Flow control signals in half-duplex and full-duplex networks are initiated and maintained based on the detected number of data bytes stored in a receive buffer from payload data of received data packets. If the number of stored data bytes exceeds a predetermined threshold, the network interface initiates flow control. Alternatively, the decision to initiate flow control may be based upon the rate at which the receive buffer is emptied compared to the number of stored data bytes in the receive buffer, or the rate the data bytes are stored into the receive buffer. The duration of the flow control is calculated as a wait time interval selected in response to the number of stored data bytes. The wait time may be selectively set as an integer multiple of slot times, or as a time interval based on the number of stored data bytes relative to the removal rate. Hence, the precise control and the initiation of the flow control for a specific wait time prevents loss of transmitted data while maintaining network throughput.

59827785, Nov 9, 1999

Aug 30, 1996

8/706317

Jim Mangin - San Ramon CA
Jayant Kadambi - Milpitas CA
Mohan Kalkunte - Sunnyvale CA

Advanced Micro Devices, Inc. - Sunnyvale CA

H04L 12413

370445

Delay times are modified in full-duplex Ethernet network devices by calculating in each network station a delay interval based on a size of a transmitted data packet and a desired transmission rate. The network station waits the calculated delay time before transmitting another data packet, ensuring that the overall output transmission rate of the network station corresponds to the assigned desired transmission rate. The desired transmission rate is received as a media access control (MAC) control frame from a network management entity, such as a switched hub. Hence, each station operates at the desired transmission rate, minimizing the occurrence of congestion and eliminating the necessity of PAUSE frames.

58549005, Dec 29, 1998

May 31, 1996

8/656491

Mohan Kalkunte - Sunnyvale CA
Jim Mangin - San Ramon CA

Advanced Micro Devices, Inc. - Sunnyvale CA

H04L 12413

39520068

Delay times are modified in Ethernet network devices by adding a slot time to the minimum interpacket gap (IPG) interval between uninterrupted consecutive transmissions by a network station. If a network station transmits a data packet and has another data packet to send, modified delay time prevents the station from contending for access of the media, enabling other stations having data to transmit to attempt access on the media. If a collision occurs during the transmission of a second successive data packet, the network station uses a modified collision arbitration and automatically sets the collision delay interval to zero for the first access attempt. If another collision occurs during the access attempt, the collision interval is calculated according to the truncated binary exponential backoff algorithm.

57843759, Jul 21, 1998

Jun 12, 1996

8/662333

Mohan Kalkunte - Sunnyvale CA
Jayant Kadambi - Milpitas CA
Jim Mangin - San Ramon CA
Gopal Krishna - San Jose CA

Advanced Micro Devices, Inc. - Sunnyvale CA

H04L 12413

370448

Delay times are modified in Ethernet network devices by adding an integer multiple of a delay interval to the minimum interpacket gap (IPG) interval, and decrementing the integer in each network station in response to detected activity on the media. Each station has a unique integer value from the range of zero to the number of stations (N) minus one. The unique integer value ensures that each station has a different delay interval in accessing the media after sensing deassertion of the receive carrier. The station having a zero integer value will have its integer counter reset to (N-1) after a station transmits a data packet on the network, and the stations having nonzero integer values decrement their respective integer counters. Each network station also includes a deferral timer that counts the maximum delay interval of (N-1) delay intervals plus the minimum IPG value, and thus establishes a bounded access latency for a half-duplex shared network.