Method for routing data in networks

• US 7,864,682 B2
• Filed: 06/27/2006
• Issued: 01/04/2011
• Est. Priority Date: 06/27/2006
• Status: Active Grant

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Appaji, Anu, Ji, Baowei, van Rensburg, Cornelius
• Primary Examiner(s): Pham; Chi H.
• Assistant Examiner(s): Hom; Shick
• Application Number:
  US11/426,757
• Publication Number:
  US 20070297388A1
• Time in Patent Office: 1,652 Days
• Field of Search: None
• US Class Current: 370/235
• CPC Class Codes: H04L 12/66 Arrangements for connecting between networks having differing types of switching systems, e.g. gateways

Abstract

A method for routing data in a network is disclosed. As an example, a method for routing data in a wireless mesh network is disclosed. The method determines what type of data is to be routed, associates the type of data with one or more routing link performance parameters such as, for example, link latency and link capacity, selects a plurality of nodes based on the one or more routing link performance parameters, determines what node of the plurality of nodes provides an optimal level of performance associated with the one or more routing link performance parameters, and selects that node as a recipient node for the data to be routed.

Claims

1. A method comprising:

selecting data to be routed;

determining the type of the data to be routed;

associating the type of data with at least one routing link performance parameter, wherein the at least one routing link performance parameter relates to a service class of the type of data;

selecting a plurality of nodes based on the at least one routing link performance parameter;

determining which node among the plurality of nodes provides an optimal level of performance relative to at least one other of the plurality of nodes associated with the at least one routing link performance parameter for the data;

selecting that node as a recipient node for the data to be routed;

verifying that the recipient node has sufficient capacity for the data to be routed; and

routing the data through a data network comprising at least some of the plurality of nodes based upon the service class of the type of data.

2. The method of claim 1, wherein the steps are performed by a digital processing device in a source node.

3. The method of claim 1, wherein the plurality of nodes comprises a set of neighbor nodes.

4. The method of claim 1, wherein the type of data comprises an application type.

5. The method of claim 1, wherein the data to be routed comprises packet data.

6. The method of claim 1, wherein the data to be routed comprises single stream data.

7. The method of claim 1, wherein the network is a mesh network.

8. The method of claim 1, wherein the network is an ad hoc, multi-hop network.

9. The method of claim 1, wherein the type of data comprises at least one of voice data, real-time data and best effort data.

10. The method of claim 1, wherein the at least one routing link performance parameter comprises link latency, and the optimal level of performance comprises a lowest level of latency.

11. The method of claim 1, wherein the at least one routing link performance parameter comprises link capacity, and the optimal level of performance comprises a highest level of capacity.

12. The method of claim 1, wherein the at least one routing link performance parameter comprises at least one of link throughput, loading, jitter and availability.

13. The method of claim 1, wherein the type of data comprises an application service class for at least one of the cdma2000, WCDMA and WiMAX air interface protocols.

14. A method comprising:

receiving data to be routed;

determining an application type for the data to be routed wherein the application type relates to a service class of the type of data;

associating the application type for the data to be routed to at least one of high link capacity and low link latency;

selecting a first set of neighbor nodes wherein each node of the first set includes a link for data communication that provides a level of latency less than a predetermined value, determining what node of the first set provides the lowest level of latency, and selecting that node of the first set as a recipient for the data to be routed;

verifying that the recipient node has sufficient capacity for the data to be routed; and

routing the data through a data network.

15. A network-comprising:

a plurality of neighbor nodes, each node of the plurality of neighbor nodes coupled for data communication to a source node, wherein the source node is adapted to;

determine the type of data to be routed;

associate the type of data with at least one routing link performance parameter wherein the at least one routing link performance parameter relates to a service class of the type of data;

select a subset of nodes from the plurality of neighbor nodes based on the at least one routing link performance parameter;

determine which node among the subset of nodes provides an optimal level of performance associated with the at least one routing link performance parameter;

select that node as a recipient node for data to be routed;

verify that the recipient node has sufficient capacity for the data to be routed; and

route the data through at least one of the plurality of neighbor nodes.

16. The network of claim 15, wherein the network comprises at least one of a mesh network and a mobile ad hoc network.

17. The network of claim 15, wherein the type of data comprises an application service class for a wireless air interface protocol.

18. The network of claim 15, wherein the coupling for data communication between nodes comprises at least one of a wireless data link and a wired data link.

19. The network of claim 15, wherein the at least one routing link performance parameter comprises at least one of channel latency, capacity, throughput, loading, jitter and availability.

20. The network of claim 15, wherein the source node is further adapted to forward the data to the recipient node.