Jumper cable selection and routing system
AssigneeLucent Technologies Inc.
InventorsAlbon E. Gilbert, Alexander Petrunia, Randy A. Reagan
Life of this patent
Estimating the term…
Abstract
A method and a system are provided to determine the optimum non-congested path to connect two termination points on a distributing frame with a specific type of jumper cable. The length of the jumper cable to be routed through the path is calculated and subsequently a measurement of the same cable and associated slack is displayed on a screen along with the non-congested path with a representation of the cable and slack therein.
Claims23
Apparatus for use in combination with a cable distribution system utilizing fiber optic cables with fixed pre-determined lengths comprising:
- means for receiving coordinates of two termination points within one or more frames in said distribution system;
- and
- means for determining a) a path within at least one trough of said one or more frames, said path being the shortest non-congested path between said points, b) the length of jumper cable to be routed through said path, and c) the minimum acceptable length of slack adjusting means comprising slack loops with a minimum acceptable radius of curvature.
A system for selecting a path for a fiber optic jumper cable with a fixed length to connect to termination points within one or more frames in a cable distribution system comprising:
- means for receiving a data indicative of a) said jumper cable including slack loops conforming to the minimum acceptable radius for said loop, and b) coordinates of said termination points;
- means for selecting a jumper cable path through which said cable is to be routed, said path being a non-congested path that minimizes and troughs of said cable distribution system excess/cordage excluding said slack loop adjacent to said termination points.
A method for determining in the optimal path for a fiber optic cable of fixed length comprising the steps of:
- receiving coordinates of two termination points within one or more frames in a cable distribution system;
- and determining a path within at least one trough of said distribution system, said path being the shortest non-congested path between said points and the length of a jumper cable, said path including slack loops conforming to the minimum acceptable radius in said loops, to be routed through said path.
A method for selecting a path for fiber optic cable comprising the steps of:
- selecting a first jumper cable path between two termination points in a cable distribution system;
- and
- if the first selected path is congested selecting longer paths between said two termination points until a non-congested path has been selected and
- determining the shortest jumper cable length to be routed through said non-congested route, said length including slack loops conforming to the minimum acceptable radius in said loop.
A method for connecting a fiber optic cable of a fixed length to two termination points in a cable distribution system comprising the steps of:
- receiving data indicative of a) said jumper cable length including slack loops of a minimum acceptable radius, and b) coordinates of said termination points;
- selecting a jumper cable path through which said cable is to be routed said path being a non-congested path that minimizes in conduits of said cable distribution system access cordage excluding said slack loops.
A method for selecting a fiber optic jumper cable with a fixed length to be used to connect two termination points within a cable distribution system, said method comprising the steps of:
- receiving data indicative of a) coordinates within said distribution system of termination points and b) the length of said jumper cable including slack loops with a minimum acceptable radius, said length greater than the length of the shortest non-congested path within said cable distribution system between said termination points;
- and
- selecting a non-congested path within said cable distribution system between said termination points which is longer than said shortest non-congested path.
Dependencies are inferred from the claim text.