Method and system for performing a least cost routing function for data communications between end users in a multi-network environment
US6104701A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Aug 5, 1997 |
| Grant date | Aug 15, 2000 |
| Priority date | — |
| Expiry date | Aug 5, 2017 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04Q3/66
- WIPO fieldTelecommunications
- WIPO sectorElectrical engineering
Abstract
A method and system for determining the best data path in a communication network is presented. A Least Cost Routing path between end users in a multi-network environment, including both public and private networks, is determined based upon a longest prefix match. At network activation time, the numbers or prefixes of numbers of end users attached to the public network (304, 305) are stored in entry node data bases A and C of the private network (303). Assuming an end user terminal U1 calls a target end user U3, an entry node B first checks for a longest prefix match between the called number and numbers already stored into its memory. If this is the first time U3 is called via node B, no match will occur and node B will then broadcast a Query to all nodes in the private network (i.e. Nodes A and C). Only those nodes providing possible access to U3 answer this Query. Node B then determines the longest prefix match with the called number amongst the various query answers, and sets the data path via that node having the longest prefix match.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.