Telephonic communications – Plural exchange network or interconnection – With interexchange network routing
Reexamination Certificate
2006-12-05
2006-12-05
Tieu, Benny Q. (Department: 2614)
Telephonic communications
Plural exchange network or interconnection
With interexchange network routing
C370S254000
Reexamination Certificate
active
07146000
ABSTRACT:
A system for automated installation of a communication line using an optimal route between a source location and a destination location is disclosed. The system includes a routing engine providing an automated design process for rendering the optimal route. The routing engine utilizes a routing algorithm to select the optimal route from a graph of capacity links defining a plurality of possible routes between the source and destination locations. If, at any time during the design process, the optimal route or capacity links defining the optimal route are detected as unavailable for any reason, the routing engine re-initiates the design process and thereafter selects a new optimal route based upon a new capacity graph built without the previously unavailable capacity link. Once designed, the available optimal route is provided to a command and control engine, which, in turn, manages the installation of the communication line using the optimal route. The command and control engine manages the process for assigning the optimal route in the provisioning system.
REFERENCES:
patent: 5291477 (1994-03-01), Liew
patent: 5337352 (1994-08-01), Kobayashi et al.
patent: 5402478 (1995-03-01), Hluchyj et al.
patent: 5586254 (1996-12-01), Kondo et al.
patent: 5596719 (1997-01-01), Ramakrishnan et al.
patent: 5680448 (1997-10-01), Becker
patent: 5809282 (1998-09-01), Cooper et al.
patent: 5841759 (1998-11-01), Russ et al.
patent: 5963544 (1999-10-01), Ding et al.
patent: 6058103 (2000-05-01), Henderson et al.
patent: 6061332 (2000-05-01), Branton, Jr. et al.
patent: 6134671 (2000-10-01), Commerford et al.
patent: 6185193 (2001-02-01), Kawakami et al.
patent: 6240463 (2001-05-01), Benmohamed et al.
patent: 6262974 (2001-07-01), Chevalier et al.
patent: 6301244 (2001-10-01), Huang et al.
patent: 6603742 (2003-08-01), Steele, Jr. et al.
patent: 6948101 (2005-09-01), Saito
patent: 2002/0018264 (2002-02-01), Kodialam et al.
patent: 2002/0045453 (2002-04-01), Juttner et al.
patent: 2002/0143872 (2002-10-01), Weiss et al.
patent: 2002/0187770 (2002-12-01), Grover et al.
patent: 2003/0005149 (2003-01-01), Haas et al.
patent: 2003/0099014 (2003-05-01), Egner et al.
patent: 0 568 477 (1993-11-01), None
patent: 0 926 860 (1999-06-01), None
patent: 1 014 627 (2000-06-01), None
patent: 1 263 260 (2002-12-01), None
patent: WO 99/21336 (1999-04-01), None
patent: WO 01/86435 (2001-11-01), None
patent: WO 02/19135 (2002-03-01), None
patent: WO 01/41578 (2002-05-01), None
Whay C. Lee et al., Routing Subject to Quality of Service Constraints in Integrated Communication Networks, IEEE Network, Jul./Aug. 1995, pp. 3-6, 20-23, No. 4, New York, US.
Tenenbaum A S, Shortest Path Routing, Computer Networks (1996), Prentice-Hall International, pp. 348-365, London, GB.
Barberis G et al., A Shortest Route Algorithm for Graphs Having Weighted Nodes and Arcs With Application to S/F Communication Networks, CSELT Rapporti Tecnici, (1977), pp. 63-68, vol. 5, No. 1, Turin, IT.
Dijkstra E W, Note On Two Problems In Connexion With Graphs, Numerische Mathematik, Springer Verlag (1959), pp. 269-271, vol. 1, Berlin, DE.
Ishiwa, Nobumasa, et al., “An Expert System for Planning Private Networks,” UDC 681.3.02:658.512.2.011.56:621.395.4 NEC Res. & Develop., vol. 35 No. 3, Jul. 1994.
Doshi, B. T., et al., “Overview of InDT-A New Tool for Next Generation Network Design” 0-7803-2509-May 1995 IEEE, pp. 1942-1946.
Asalian Kaveh
Bonewitz Christopher M.
Henes Alex J.
Hollman Brett P.
Joseph George T.
Faegre & Benson LLP
Level (3) Communications
Tieu Benny Q.
LandOfFree
Routing engine for telecommunications network does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Routing engine for telecommunications network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Routing engine for telecommunications network will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3678681