Least cost routing with repeated searches for lower cost route

Details Least cost routing with repeated searches for lower cost route Least cost routing with repeated searches for lower cost route

1999-03-03

2000-02-08

Loomis, Paul N

Telephonic communications

With usage measurement

Call charge metering or monitoring

379115, 379220, 379221, H04M 1500, H04M 700

Patent

active

060235012

ABSTRACT:
In a communications network, a database is searched for a least cost route in response to a call request from a subscriber, and a connection is established along the least cost route between the calling subscriber and a called subscriber. For the duration of the call, the database is repeatedly searched for a route having a cost lower than the cost of a previously determined route. If the route of lower cost is detected, a new connection is established along the lower cost route, instead of the currently established connection.

REFERENCES:
patent: 5027388 (1991-06-01), Bradshaw et al.
patent: 5515425 (1996-05-01), Penzias et al.
patent: 5606602 (1997-02-01), Johnson et al.
patent: 5659601 (1997-08-01), Cheslog
patent: 5675636 (1997-10-01), Gray
patent: 5748718 (1998-05-01), Manicone
patent: 5781620 (1998-07-01), Montgomery et al.
patent: 5790643 (1998-08-01), Gordon et al.
patent: 5799072 (1998-08-01), Vulcan et al.
patent: 5802502 (1998-09-01), Gell et al.
patent: 5915214 (1999-06-01), Reece et al.
patent: 5930343 (1999-07-01), Vasquez

Affiliated with

Also associated with

Rating

Least cost routing with repeated searches for lower cost route does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Least cost routing with repeated searches for lower cost route, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Least cost routing with repeated searches for lower cost route will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1686430