Method for re-routing signals in a switch network
AssigneeHughes Electronics Corporation
InventorsKar W. Yung, David C. Cheng, Thu-Tam Trinh-Perches, Kenneth N. Gibson
Life of this patent
Estimating the term…
Abstract
A method (100) for identifying re-routing path solutions for signals within a switch network (10). The path solutions are subject to special constraints that provide the most desired solution for a user. The method applies an algorithm that works by transforming a global problem (110) into many individual sub-problems (112). The algorithm then solves the individual sub-problems (112) systematically according to desired constraints until the global solution is met (120). The method finds a unique state for each switch such that the overall requirements of the system are met.
Claims5
A method for finding signal re-route paths in a switch network comprising the steps of:
- defining a state space for said switch network;
- applying rules necessary to meet global constraints for a solution, said step of applying rules further comprises:
- defining a network configuration in which each switch is connected to other switches in a pattern defined by a user;
- defining consistent signal flow paths between switches;
- eliminating from consideration all switch states that are not possible;
- applying local constraints to each switch in said switch network;
- searching said state space until each switch satisfies its local constraints whereby said global constraints are satisfied and a re-route path is identified.
A method for finding signal re-route paths in a switch network having n switches with R states, said method comprising the steps of:
- defining a state space, kn;
- applying rules necessary to meet global constraints for a solution, said step of applying rules further comprises;
- defining a network configuration in which each switch is connected to other switches in a pattern defined by a user;
- defining consistent signal flow paths between switches;
- eliminating from consideration all switch states that are not possible;
- applying local constraints to each switch in said switch network;
- searching said state space until each switch satisfies its local constraints whereby said global constraints are satisfied and a re-route path is identified.
A method for finding signal re-route paths to by-pass at least one failed device in a switch network having n switches with k states, said method comprising the steps of:
- defining a state space, kn;
- applying rules necessary to meet global constraints for a solution;
- applying local constraints to each switch in said switch network;
- searching said state space until each switch satisfies its local constraints whereby said global constraints are satisfied and a re-route path is identified;
- and
- wherein said failed devices are part of a network of traveling wave tube amplifiers.
A method for finding signal re-route paths to by-pass at least one failed device in a switch network having n switches with k states, said method comprising the steps of:
- defining a state space, kn;
- applying rules necessary to meet global constraints for a solution, said step of applying rules further comprises:
- defining a network configuration in which each switch is connected to other switches in a pattern defined by a user;
- defining consistent signal flow paths between switches;
- eliminating from consideration all switch states that are not possible;
- allying local constraints to each switch in said switch network;
- searching said state space until each switch satisfies its local constraints whereby said global constraints are satisfied and a re-route path is identified.
Dependencies are inferred from the claim text.