Ayman S Fawaz, 64785 Cragmont Ave, Berkeley, CA 94708

6647413, Nov 11, 2003

May 28, 1999

09/321974

Jean Walrand - Berkeley CA
Brian Anthony Fuller - Oakland CA
Ayman Said Fawaz - Berkeley CA
Fadi Abourjeily - El Cerrito CA
Matthew Kenneth Siler - Berkeley CA

Extreme Networks - Santa Clara CA

G06F 1300

709224, 709249, 709250

In a packet-switched network, a distributed performance measurement system is disclosed. In each node, a node monitor maintains information for each virtual channel passing through the node, including a list of the arrival times of the packets queued for the virtual channel. In addition, each node determines node performance characteristics, which may include throughput, effective rate, delay, loss rate, and occupancy. The network further includes a network monitor, which periodically collects the node performance characteristics from each node and determines performance characteristics for each virtual channel in the network, end-to-end. The network performance characteristics may include throughput, effective rate, delay, loss rate, and occupancy. The results are useful for network operators and users to optimize the network and/or their use of the network.

6654374, Nov 25, 2003

Nov 10, 1998

09/189347

Ayman Fawaz - Berkeley CA
Jean Walrand - Berkeley CA

Extreme Networks - Santa Clara CA

H04L 1256

370394, 37039541, 370412

A packet-switched communication network in accordance with the invention provides a guaranteed minimum bandwidth between pairs of Packet Switches by defining Service Level Agreements (SLAs). An SLA is defined by at least a source identifier, a destination identifier, and a minimum data rate although other information can also be used. Upon arrival at certain networked nodes, packets are classified according to an SLA by reading the source and destination addresses in the packet. Once classified, the packets are placed in a queue and scheduled for transmission. A scheduler ensures that packets are transmitted at the minimum defined data rate for the SLA. The scheduler may use a statistical multiplexing method, such as deficit round robin, or deficit golden ratio, which is part of the present invention. The deficit golden ratio method assures a minimum rate to packets for a particular SLA, but minimizes jitter and delay. Further, the present invention implements congestion control that does not require nodes to be entirely turned off in congested conditions.

6711125, Mar 23, 2004

Aug 2, 1999

09/365607

Jean Walrand - Berkeley CA
Rajarshi Gupta - Berkeley CA
Ayman Fawaz - Berkeley CA

Extreme Networks - Santa Clara CA

G08C 1500

370223

A system and method in accordance with the invention provides efficient allocation of network resources to network virtual connections while providing reliable and guaranteed quality of service. Such a system is generally used in a network that includes a plurality of nodes and a plurality of links interconnecting the nodes. In accordance with an embodiment of the invention, for each connection in the network established between a pair of nodes, a normal path n between the nodes having a rate N is established and an alternate, or backup, path b having a rate B is established. Information is only transmitted on the backup path in the event of a failure on the normal path. The system further maintains information for each link as to the resources, such as bandwidth, utilized by the connections. The system then utilizes the maintained information to determine whether new connections can be accommodated and still meet quality of service guarantees. An embodiment of the invention can also be adapted for use in a network that has two attachments to an external network (such as the Internet) and still use resources efficiently.

6714517, Mar 30, 2004

Nov 10, 1998

09/189206

Ayman Fawaz - Berkeley CA
Jean Walrand - Berkeley CA

Extreme Networks - Santa Clara CA

H04L 1256

370236, 370468

A packet-switched communication network in accordance with the invention provides a guaranteed minimum bandwidth between pairs of Packet Switches by defining Service Level Agreements (SLAs). An SLA is defined by at least a source identifier, a destination identifier, and a minimum data rate although other information can also be used. Upon arrival at certain networked nodes, packets are classified according to an SLA by reading the source and destination addresses in the packet. Once classified, the packets are placed in a queue and scheduled for transmission. A scheduler ensures that packets are transmitted at the minimum defined data rate for the SLA. The scheduler may use a statistical multiplexing method, such as deficit round robin, or deficit golden ratio, which is part of the present invention. The deficit golden ratio method assures a minimum rate to packets for a particular SLA, but minimizes jitter and delay. Further, the present invention implements congestion control that does not require nodes to be entirely turned off in congested conditions.

6970424, Nov 29, 2005

Nov 10, 1998

09/189819

Ayman Fawaz - Berkeley CA, US
Jean Walrand - Berkeley CA, US

Extreme Networks - Santa Clara CA

H04L001/16

370232, 37039521

A packet-switched communication network in accordance with the invention provides a guaranteed minimum bandwidth between pairs of Packet Switches by defining Service Level Agreements (SLAs). An SLA is defined by at least a source identifier, a destination identifier, and a minimum data rate although other information can also be used. Upon arrival at certain networked nodes, packets are classified according to an SLA by reading the source and destination addresses in the packet. Once classified, the packets are placed in a queue and scheduled for transmission. A scheduler ensures that packets are transmitted at the minimum defined data rate for the SLA. The scheduler may use a statistical multiplexing method, such as deficit round robin, or deficit golden ratio, which is part of the present invention. The deficit golden ratio method assures a minimum rate to packets for a particular SLA, but minimizes jitter and delay. Further, the present invention implements congestion control that does not require nodes to be entirely turned off in congested conditions.

7046665, May 16, 2006

Oct 26, 1999

09/427215

Jean Walrand - Berkeley CA, US
Ayman Fawaz - Berkeley CA, US
Rajarshi Gupta - Berkeley CA, US

Extreme Networks, Inc. - Santa Clara CA

H04L 12/56
H04J 14/00
H04J 3/16

370392, 3703954, 3703955, 370469, 398 48, 398 68

In accordance with the invention, a system and method for providing QoS to packets formatted in accordance with one protocol (e. g. , IP or Ethernet) carried over networks that are originally designed to be used with another protocol (e. g. , ATM, WDM, or TDM). In one embodiment of the invention, such a switch is modified in order to allow the switch to become “IP-aware. ” Such a modified switch can identify IP packets, determine if any packets should be dropped, classify the packets with a queue, and schedule the packets of each queue in a manner that provides quality of service to the packets in the queue. Moreover, some embodiments of a modified switch further include a monitor to keep statistics on the packets in the modified switch, a protection mechanism that monitors fault information for at least part of the network, and a provisioning mechanism that determines normal and backup paths for each connection.

7826910, Nov 2, 2010

Feb 18, 2008

12/032897

Kun Ji - Berkeley CA, US
Ayman Fawaz - Berkeley CA, US

Siemens Aktiengesellschaft - München

G05B 21/02
G05B 15/02
G05B 11/01
H04H 20/71
G04F 1/00

700 73, 700 9, 700 14, 700 20, 700 55, 455 301, 702177, 702178, 702188

A method and system may operate to receive a first data from a sensor of a controlled device via a wireless network at a first time, transmit the first data to a controller system, receive a second data from the sensor of the controlled device via the wireless network at a second time, transmit the second data to the controller system, determine that a third data has not been received prior to a predetermined time period, or that the third data has been received prior to the predetermined time period and the third data is outside of a determined range of values, calculate a fourth data based on the first data and the second data, and transmit the fourth data to the controller system at a third time.

7969878, Jun 28, 2011

Sep 11, 2006

11/519309

Ayman Fawaz - Berkeley CA, US
Teresa Tung - Berkeley CA, US
Raghuveer Chereddy - Fremont CA, US

Siemens Enterprise Communications GmbH & Co. KG - Munich

H04L 12/26

3702301, 370323, 370254, 370328

A shared wireless channel may serve real-time traffic and non-real-time traffic. Depending on channel conditions, the real-time traffic may experience variable levels of quality. The present invention contemplates systems and methods for guaranteeing bounded access time for real-time applications in a shared wireless network in the presence of non-real-time traffic. The systems and methods provide mechanisms to adapt to changing characteristics of wireless channels and to maximize throughput of non-real-time traffic while preserving the quality of real-time applications. The systems and methods may be extended generally to provide adaptive control over the delivery of multiple classes of traffic to protect the quality of critical applications over a shared transmission medium, including IEEE 802. 11 networks, IEEE 802. 16 networks, and DOCSIS networks.