The Research Foundation of Suny

Other

Yizhi Xiong

Chunming Qiao

Dahai Xu

Vishal Anand

Xiaojun Cao

An efficient trap avoidance and shared protection method in a survivable network with shared risk link groups. The invention includes a fast and efficient heuristic algorithm for avoiding traps, an algorithm, which may also be applied effectively to shared SRLG protection. Compared to other existing algorithms, the algorithm embodied in the present invention runs much faster, and yet falls into few traps, and achieves a much higher bandwidth efficiency. This technology can be applied to MPLS, ATM, SONET, WDM, and other high-speed survivable network designs.

Efficient trap avoidance and shared protection method in survivable networks with shared risk link groups and a survivable network

This invention broadly comprises a novel segment protection scheme (survivability framework) for a network, which we refer to as PROMISE (Protection using MultIple SEgments). It combines the best of existing link and path protection schemes (e.g., bandwidth efficiency and fast recovery). The PROMISE approach divides an active path or AP (along which a survivable connection is established) into several, possibly overlapping active segments or ASs, and then protects each AS with a detour called backup segment or BS (instead of protecting the AP as a whole as in path protection schemes). This facilitates the bandwidth sharing not only among the BSs for different APs, but also among those for the same AP. In addition, recovery time can be shortened due to the limited length of each AS and BS. This technology can be applied to MPLS, ATM, SONET, WDM and other high-speed link layers under the evolving G-MPLS framework.

Segment protection scheme for a network

A method for managing static data traffic of at least one light path in an optical network, comprising the steps of achieving load balanced path routing for the at least one light path, assigning wavelengths to demands of the at least one light path, and, switching the at least one light path according to its assigned wavelength. A method for managing dynamic data traffic of at least one light path in an optical network, comprising the steps of routing the K-shortest path, which has the largest interference length (L), and, assigning waveband with a First-Fit network topology based on band/port number restriction and minimum weight.

Growing community of inventors

San Mateo, CA, United States of America

Yizhi Xiong