Nortel Networks Corporation

Mci Communications Corporation

Jonathan Weston-Dawkes

Guang Wan

Sridhar S Nathan

Jennifer Shu-Chen Huang

A method, apparatus, and system for reducing congestion of real time data traffic on a multimedia communications network having a traffic control mechanism. Information regarding congestion of the multimedia communications network is first extracted from data traffic in the multimedia communications network. This extraction is performed by a network of monitors. Congestion is regulated by a central server, which receives network information from the monitors and utilizes the network information to analyze congestion status and communicate instructions to the multimedia communications network to reduce congestion.

Method and apparatus for the control of multimedia services in networks

A method and system for reducing congestion of real time data traffic on a multimedia communications network having a traffic control mechanism. The method comprises of first extracting from data traffic in the multimedia communications network information regarding congestion of the multimedia communications network. This extraction is performed by a network of monitors. Secondly, congestion is regulated by a central server which receives network information from the monitors and utilizes the network information to analyze congestion status and communicate instructions to the multimedia communications network to reduce congestion.

Monitor for the control of multimedia services in networks

A method and system for use within at least one network. The method and system achieve their objects via computing equipment engineered to do the following: define of one or more subnetworks within the at least one network; define of one or more alternate data paths utilizing different criteria than that utilized by the network protocols controlling the one or more subnetworks; and designate that certain user data travel on the one or more alternate data paths.

Method and system for enhancing communications efficiency in data communications networks

A method of assigning capacity and routing flow in a bi-directional line switched SONET ring based upon ring topology and demand data defines for each pair of links of the ring a two-edge cut. Each two-edge cut divides the ring into two sets of nodes. For each two-edge cut, the capacity assignment method calculates a demand equal to the sum of all demands between nodes on opposite sides of the two-edge cut. The capacity assignment method then determines the maximum demand and sets the capacity of each link equal to one-half the maximum demand plus one-half of one demand unit. The flow routing method of the present invention calculates a cut difference for each two-edge cut. A critical cut is a two-edge cut having a cut difference equal to or less than one. If there is a critical cut with demands greater than zero on the same side of the critical cut, the method performs a first processing routine. If there is no critical cut with demands greater than zero on the same side of the critical cut, the method performs a second processing routine. The flow routing method performs the first or second processing routine until the occurrence of a terminating condition.

Growing community of inventors

Plano, TX, United States of America

Jonathan Weston-Dawkes