Timothy W ChowBoston, MA

7133410, Nov 7, 2006

Apr 5, 2001

09/826748

Timothy Y. Chow - Quincy MA, US
Philip J. Lin - Newton MA, US
James D. Mills - Wilmington MA, US

Tellabs Operations, Inc. - Naperville IL

H04L 12/50

370404, 370381, 370406

A method and system for designing a bi-connected ring-based network is provided, which designs from scratch or converts an existing network to a dual-homed ring-based network. The network covers the locations capable of being bi-connected with one or more cycles/rings. The traffic demand is then routed via the cycles, in such a way so as to minimize the amount of network traffic management equipment required.

7289428, Oct 30, 2007

Aug 13, 2001

09/929210

Timothy Y. Chow - Quincy MA, US
Philip J. Lin - Newton MA, US
James D. Mills - Wilmington MA, US

Tellabs Operations, Inc. - Naperville IL

G01R 31/08

370216, 370406

A communication system () comprises a first network () including a source () arranged to transmit data and a second network () including a destination () arranged to receive the data. Interruptions in communication between the source and destination are reduced by providing a first primary node () and a first secondary node () in the first network (), and a second primary node () and a second secondary node () in the second network (). First and second sets of primary routes ( and ) and secondary routes ( and ) are provided within the first and second networks to facilitate delivery of data to various nodes.

7308198, Dec 11, 2007

May 16, 2002

10/150816

Fabian A. Chudak - Cambridge MA, US
Anthony M. Ffrench - South Boston MA, US
Timothy Y. Chow - Quincy MA, US

Tellabs Operations, Inc. - Naperville IL

H04J 10/20

398 58, 398 59, 398 60

A telecommunications mesh network includes a plurality of nodes each interconnected by an edge. A traffic demand is received having a working path with a link of edges interconnecting a source node with a destination node. The telecommunications mesh network has one or more pre-cross-connected trails associated therewith that are subdivided into one or more subtrails. Subtrails that do not meet pre-determined conditions are discarded. A logical graph representation of the telecommunications mesh network is created from subtrails that have not been discarded. Unused, shortcut, and rival edges are inserted into the logical graph. A shortest admissible protection path from the source node to the destination node is identified from the logical graph.

7668184, Feb 23, 2010

Oct 2, 2006

11/537721

Timothy Y. Chow - Quincy MA, US
Philip J. Lin - Newton MA, US
James D. Mills - Wilmington MA, US

Tellabs Operations, Inc. - Naperville IL

H04L 12/28

370404, 370258

A method and system for designing a bi-connected ring-based network is provided, which designs from scratch or converts an existing network to a dual-homed ring-based network. The network covers the locations capable of being bi-connected with one or more cycles/rings. The traffic demand is then routed via the cycles, in such a way so as to minimize the amount of network traffic management equipment required.

2002019, Dec 19, 2002

May 15, 2002

10/146212

Philip Lin - Newton MA, US
Timothy Chow - Quincy MA, US
James Mills - Wilmington MA, US

G06F015/173

709/226000

The present invention relates, by way of illustration, to a telecommunications network that includes a collection of geographically dispersed network elements, called nodes, connected by communication links (e.g., fiber, wireless links). The topology of the network may be an arbitrary mesh. This information may be represented by a graph. For each pair of nodes in the network, a pair of node-disjoint paths between the nodes of minimum total length is computed. One path of each pair is designated to be the working path and the other is designated to be a protection path. Each time there is a traffic demand to be routed on the network from one node A to another node B, the required amount of bandwidth to support the demand is allocated on the working path between A and B. Bandwidth is also allocated along the protection path. To determine how much protection bandwidth is needed on a particular link L, each failure scenario is simulated, the amount of bandwidth on link L would be needed for restoring traffic under that scenario is computed, and then just enough bandwidth on L to handle the worst-case failure scenario is allocated. According to an embodiment of the present invention, a computer may be used to achieve the simulation, computation, and allocation.

2003006, Apr 3, 2003

Sep 27, 2002

10/256411

Philip Lin - Newton MA, US
Timothy Chow - Quincy MA, US
James Mills - Wilmington MA, US

G06F015/16
G06F015/173

709/232000, 709/238000

A method for protecting a mesh network from connection failures includes reviewing, for each link in the mesh network, the single failure scenarios which would require support from the particular link. The method includes determining from these single failure scenarios the worst-case bandwidth required of the particular link to support them and designating this worst-case bandwidth as the capacity for the particular link.

2006018, Aug 17, 2006

Feb 17, 2005

11/059781

Timothy Chow - Cambridge MA, US
George Elias - Seattle WA, US
Chenteh Fan - Cambridge MA, US
Richard Garfield - Seattle WA, US

G06F 19/00
G06F 17/00

463042000

The home viewing audience of a program that is broadcast over a television or other mass media network plays a game by matching events on the program or its commercials with a personal telephone number or similar personal codeword. In one version, the organizers distribute a code table listing events that might occur on the program, and associate a code with each such event. A player watches for events listed on the code table, hoping to match the associated codes to parts of his codeword. A player becomes eligible to win if his entire codeword is successfully matched to codes of events that actually occur on the program, and may telephone a predetermined telephone number to declare his eligibility to win prizes. A second version of the game is like the first except there is no code table; the players watch for direct appearances of the codes themselves.

2008010, May 1, 2008

Oct 5, 2007

11/973202

Timothy Chow - Quincy MA, US
Philip Lin - Newton MA, US
James Mills - Wilmington MA, US

Tellabs Operations, Inc. - Naperville IL

H04L 12/56

370390000

Interruptions between a source in a first network and a destination in a second network are reduced by providing first primary and secondary nodes in the first network, and second primary and secondary nodes in the second network. First primary routes in the first network facilitate delivery of a first set of the data to the first primary node; and a second set of the data to the first secondary node. Inter-network routes between the first and second networks deliver the first and second sets of the data to the second primary node and the second secondary node. Second primary routes in the second network facilitate delivery of at least one of the first and second sets of data to the destination. A selector within the second network selects one of the sets of data. Route selectors select secondary routes in the event that a primary route is disabled.