IP Library Granted Patent US 7,701,857
Granted Patent B2
US 7,701,857 · App. 11/448,999 · Granted Apr 20, 2010

Method, system, and computer-readable medium for resource-based route selection

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,701,857
App. No.
11/448,999
Granted
Apr 20, 2010
Kind
B2
Abstract

A method, system, and computer-readable medium for selecting a route in a network are provided. A respective link cost is assigned to links of a plurality of routes, and a respective node cost is assigned to nodes of the plurality of routes. A respective link cost is calculated for each of the links, and a respective node cost is calculated for each of the nodes. A respective route cost for each of the plurality of routes is calculated based on the calculated link cost for each of the links and the calculated node cost for each of the nodes.

Claims (41)

1. A method of selecting a route on a network, comprising:

in a converged network that includes constituent networks of various types:

assigning a respective link cost to links of a plurality of routes;

assigning a respective node cost to nodes of the plurality of routes; and

calculating, for each route of the plurality of routes, a respective route cost based on the link cost of respective links included in the route and the node cost of respective nodes included in the route, wherein at least some of the routes span constituent networks of different types and wherein calculating the route costs includes calculating the costs for the routes that span the constituent networks of different types, wherein calculating the route costs includes calculating the cost of a route that includes a time division multiplexed (TDM) signaling link and an Internet protocol (IP) signaling link, wherein

route cost=Σ(link cost)+Σ(node cost)

and wherein a link comprises a communications interconnection between nodes, a node comprises a hardware device for providing telecommunications switching services and/or media conversion services, the link cost includes a metric accounting for link characteristics, and the node cost includes a metric accounting for processing performed by a node associated with service-impacting factors.

2. The method of claim 1 , further comprising:

assigning a weight to each respective link cost; and

assigning a weight to each respective node cost.

3. The method of claim 2 , wherein assigning a weight to each respective link cost further comprises assigning a weight to each respective link cost based on operator-defined criteria, and wherein assigning a weight to each respective node cost further comprises assigning a weight to each respective node cost based on operator-defined criteria.

4. The method of claim 3 , wherein the operator-defined criteria comprises one or more of a link distance, quality of service, traffic type, and service level agreement.

5. The method of claim 1 , further comprising selecting a route from the plurality of routes based on the respective route cost.

6. The method of claim 1 , wherein one or more of the plurality of routes includes heterogeneous network nodes.

7. The method of claim 6 , wherein the heterogeneous network nodes each respectively comprise one of a wireline network node, a packet network node, and a wireless network node.

8. The method of claim 1 , wherein assigning a respective node cost to the nodes comprises assigning a value to a node cost for each of the nodes, wherein the value is dependant on whether codec translation is required by the nodes.

9. The method of claim 1 , wherein assigning a respective node cost to the nodes comprises assigning a value to a node cost for each of the nodes, wherein the value is dependent on availability of at least one service at each of the nodes.

10. The method of claim 9 , wherein the service comprises one or more of a transcoder free operation service, a tandem free operation service, a voice quality enhancement service, and a codec translation for voice over Internet protocol calls.

11. A system for selecting a route in a network, comprising:

an originating node to which a call originator may convey call data;

a terminating node adapted to communicatively couple with a call terminator; and

a plurality of routes interconnecting the originating node and the terminating node, wherein each route respectively comprises at least one link having a respective link cost assigned thereto and at least one node having a respective node cost assigned thereto, wherein a respective route cost is calculated, for each route of the plurality of routes, based on the link cost of respective links in the route and the node cost of respective nodes included in the route, wherein at least some of the routes span a converged network that includes constituent networks of various types and wherein at least some of the respective route costs are calculated for routes for the routes that span the constituent networks of different types, wherein the calculated route costs include a route cost that is calculated for a route that includes a time division multiplexed (TDM) signaling link and an Internet protocol (IP) signaling link, wherein

route cost=Σ(link cost)+Σ(node cost)

and wherein a link comprises a communications interconnection between nodes, a node comprises a hardware device for providing telecommunications switching services and/or media conversion services, the link cost includes a metric accounting for link characteristics, and the node cost includes a metric accounting for processing performed by a node associated with service-impacting factors.

12. The system of claim 11 , wherein a weight is assigned to each respective link cost, and wherein a weight is assigned to each respective node cost.

13. The system of claim 11 , wherein a route is selected from the plurality of routes based on the respective route cost.

14. The system of claim 11 , wherein the network comprises nodes each respectively comprising one of a wireline network node, a packet network node, and a wireless network node.

15. A computer-readable medium having computer-executable instructions for execution by a processing system, the computer-executable instructions for selecting a route in a network, comprising:

in a converged network that includes constituent networks of various types:

instructions that assign a respective link cost to links of a plurality of routes;

instructions that assign a respective node cost to nodes of the plurality of routes; and

instructions that calculate, for each route of the plurality of routes, a respective route cost based on the link cost of respective links included in the route and the node cost of respective nodes included in the route, wherein at least some of the routes span constituent networks of different types and wherein calculating the route costs includes calculating the costs for the routes that span the constituent networks of different types, wherein calculating the costs includes calculating the cost of a route that includes a time division multiplexed (TDM) signaling link and an Internet protocol (IP) signaling link, wherein

route cost=Σ(link cost)+Σ(node cost)

and wherein a link comprises a communications interconnection between nodes, a node comprises a hardware device for providing telecommunications switching services and/or media conversion services, the link cost includes a metric accounting for link characteristics, and the node cost includes a metric accounting for processing performed by a node associated with service-impacting factors.

16. The computer-readable medium of claim 15 , wherein the instructions that assign a respective node cost to the nodes comprise instructions that assign a respective value to a node cost for each of the nodes that is dependent on whether codec translation is required by the nodes.

17. The computer-readable medium of claim 15 , wherein the instructions that assign a respective node cost to the nodes comprise instructions that assign a respective value to a node cost for each of the nodes that is dependent on availability of at least one service at the nodes.

18. The computer-readable medium of claim 17 , wherein the at least one service comprises one or more of a transcoder free operation service, a tandem free operation service, a voice quality enhancement service, and a codec translation for voice over Internet protocol calls.

19. The computer-readable medium of claim 15 , wherein the network comprises a converged network.

20. The computer-readable medium of claim 15 , further comprising:

instructions that assign a weight to each respective link cost; and

instructions that assign a weight to each respective node cost.

Assignments (18)
SHORT-FORM PATENTS SECURITY AGREEMENT Recorded Sep 5, 2024
From: RIBBON COMMUNICATIONS OPERATING COMPANY, INC.
To: HPS INVESTMENT PARTNERS, LLC, AS ADMINISTRATIVE AGENT
Reel/Frame 068857/0290 →
MERGER AND CHANGE OF NAME Recorded Jul 19, 2024
From: GENBAND US LLC; RIBBON COMMUNICATION OPERATING COMPANY, INC.
To: RIBBON COMMUNICATIONS OPERATING COMPANY, INC.
Reel/Frame 068462/0379 →
RELEASE OF SECURITY INTEREST Recorded Jun 24, 2024
From: CITIZENS BANK, N.A.
To: RIBBON COMMUNICATIONS OPERATING COMPANY, INC. (F/K/A GENBAND US LLC AND SONUS NETWORKS, INC.)
Reel/Frame 067822/0433 →
TERMINATION AND RELEASE OF PATENT SECURITY AGREEMENT AT R/F 044978/0801 Recorded Dec 6, 2021
From: SILICON VALLEY BANK, AS ADMINISTRATIVE AGENT
To: RIBBON COMMUNICATIONS OPERATING COMPANY, INC. (F/K/A GENBAND US LLC AND SONUS NETWORKS, INC.)
Reel/Frame 058949/0497 →
SECURITY INTEREST Recorded Mar 3, 2020
From: RIBBON COMMUNICATIONS OPERATING COMPANY, INC.
To: CITIZENS BANK, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 052076/0905 →
SECURITY INTEREST Recorded Jan 2, 2018
From: GENBAND US LLC; SONUS NETWORKS, INC.
To: SILICON VALLEY BANK, AS ADMINISTRATIVE AGENT
Reel/Frame 044978/0801 →
TERMINATION AND RELEASE OF PATENT SECURITY AGREEMENT Recorded Dec 29, 2017
From: SILICON VALLEY BANK, AS ADMINISTRATIVE AGENT
To: GENBAND US LLC
Reel/Frame 044986/0303 →
CORRECTIVE ASSIGNMENT TO CORRECT PATENT NO. 6381239 PREVIOUSLY RECORDED AT REEL: 039269 FRAME: 0234. ASSIGNOR(S) HEREBY CONFIRMS THE PATENT SECURITY AGREEMENT. Recorded Jan 3, 2017
From: GENBAND US LLC
To: SILICON VALLEY BANK, AS ADMINISTRATIVE AGENT
Reel/Frame 041422/0080 →
RELEASE AND REASSIGNMENT OF PATENTS Recorded Jul 7, 2016
From: COMERICA BANK, AS AGENT
To: GENBAND US LLC
Reel/Frame 039280/0467 →
PATENT SECURITY AGREEMENT Recorded Jul 6, 2016
From: GENBAND US LLC
To: SILICON VALLEY BANK, AS ADMINISTRATIVE AGENT
Reel/Frame 039269/0234 →
RELEASE OF SECURITY INTEREST Recorded Jan 10, 2014
From: ONE EQUITY PARTNERS III, L.P., AS COLLATERAL AGENT
To: GENBAND US LLC
Reel/Frame 031968/0955 →
SECURITY AGREEMENT Recorded Nov 9, 2010
From: GENBAND US LLC
To: COMERICA BANK
Reel/Frame 025333/0054 →
PATENT SECURITY AGREEMENT Recorded Jun 18, 2010
From: GENBAND US LLC
To: ONE EQUITY PARTNERS III, L.P., AS COLLATERAL AGENT
Reel/Frame 024555/0809 →
CHANGE OF NAME Recorded Jun 2, 2010
From: GENBAND INC.
To: GENBAND US LLC
Reel/Frame 024468/0507 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 5, 2009
From: SANTERA SYSTEMS, LLC
To: GENBAND, INC.
Reel/Frame 023471/0754 →
MERGER Recorded Mar 28, 2008
From: SANTERA SYSTEMS, INC.
To: SANTERA SYSTEMS, LLC
Reel/Frame 020741/0943 →
MERGER Recorded Mar 25, 2008
From: SANTERA SYSTEMS, INC.
To: SANTERA SYSTEMS, LLC
Reel/Frame 020723/0150 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 25, 2006
From: HIKSPOORS, HANK P.; HALL, BILL J.; CAO, CHEN; LI, SAN-QI
To: SANTERA SYSTEMS, INC.
Reel/Frame 018172/0155 →