System using label switching techniques to support QoS for mobile ad-hoc networks and its label distributing and switching method

• US 20050111418A1
• Filed: 05/25/2004
• Published: 05/26/2005
• Est. Priority Date: 11/24/2003
• Status: Active Grant

• Current Assignee: Industrial Technology Research Institute
• Original Assignee: Industrial Technology Research Institute
• Inventors: Feng, Vincent, Wu, Pei-Hsuan, Yang, Jen-Shun, Tseng, Chien-Chao
• Granted Patent: US 7,649,896 B2
• Time in Patent Office: Days
• US Class Current: 370/338
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/50 using label swapping, e.g. multi-protocol label switch [MPLS]
• CPC Class Codes: H04W 40/02 Communication route or path selection, e.g. power-based or shortest path routing
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

The present invention provides a system using label switching techniques to support QoS for mobile ad-hoc networks and its label distributing and switching method. The system includes plural clusters, each having plural mobile nodes. At least one mobile node in a cluster is selected as a routing agent. One routing agent in a cluster is selected as a core routing agent. Each core routing agent is capable of obtaining an unique seed for generating an label L=f(S, i, j)=S×3ⁱ×2^j to a new LSP, where S is an unique seed that is an unique prime number, except 2 and 3, obtained by the core routing agent, i represents one of different kinds of LSP, and j represents one of different numbers for the same kind of LSP. Through the interconnecting of core routing agents, the virtual backbones can be constructed for bandwidth sharing.

Claims

1. A system using label switching techniques to support QoS in mobile ad-hoc networks, comprising plural clusters, each cluster having plural mobile nodes, at least one of the mobile nodes in a cluster being selected as a routing agent, one of the routing agents in a cluster being selected as a core routing agent, wherein each core routing agent obtains an unique seed, which is a prime number to generate a label for Label Switch Path (LSP).

2. The system as claimed in claim 1, wherein the seed is applied in following equation to generate the label:

L=f(S, i, j)=S×

3ⁱ×

2^j,

where S is the unique seed, which is a prime number except 2 and 3, obtained by the core routing agent, i represents different type of LSP, and j represents different number of the same type of LSP.

3. The system as claimed in claim 2, wherein a Signal LSP (S-LSP) between a core routing agent and a respective routing agent is pre-constructed by a label L=S×

3¹×

2^j generated by the core routing agent.

4. The system as claimed in claim 2, wherein an S-LSP between two neighboring core routing agents is pre-constructed by labels L=f(S, i, j)=S×

3²×

2^j generated by the two core routing agents respectively.

5. The system as claimed in claim 2, wherein an S-LSP between a core routing agent and non-neighboring core routing agent is pre-constructed by labels L=f(S, i, j)=S×

3³×

2^j generated by the two core routing agents respectively.

6. The system as claimed in claim 2, wherein a Backbone Data LSP (BD-LSP) between two core routing agents is pre-constructed by labels L=S×

3⁴×

2^j generated by the two core routing agents respectively.

7. The system as claimed in claim 2, wherein when a mobile node sends an on-demand connection request for constructing On-Demand Data LSPs (ODD-LSPs), the connection request is forwarded from a source core routing agent to a destination through the S-LSPs, so that forward and backward LSPs are constructed respectively by a label L=S×

3⁰×

2^x generated by the source core routing agent and a label L=S×

3⁰×

2^x+1 generated by the destination core routing agent.

8. The system as claimed in claim 6, wherein the BD-LSP pre-constructed reserves predetermined bandwidth for being shared by all ODD-LSPs passing therethrough.

9. The system as claimed in claim 8, wherein multiple different-path duplicated BD-LSP tunnels are constructed between two core routing agents.

10. The system as claimed in claim 1, wherein the core routing agent selected from the routing agents in each cluster is a slower or half-fixed station.

11. The system as claimed in claim 1, wherein each core routing agent obtains the unique seed from a router of the Internet.

12. A label distributing and switching method for a mobile ad-hoc network, the mobile ad-hoc network including plural clusters, each cluster having plural mobile nodes, at least one of the mobile nodes in a cluster being selected as a routing agent, one of the routing agents in a cluster being selected as a core routing agent, the method comprising the steps:

a seed generating step in which each core routing agent obtains a unique seed which is a prime number; and

a label generating step in which each core routing agent generates a label for Label Switch Path (LSP) based on the seed.

13. The method as claimed in claim 12, wherein in the label generating step, each core routing agent uses a following equation to generate the label:

L=f(S, i, j)=S×

3ⁱ×

2^j,

where S is the unique seed, which is a prime number except 2 and 3, obtained by the core routing agent, i represents different type of LSP, and j represents different number of the same type of LSP.

14. The method as claimed in claim 13, wherein an S-LSP between a core routing agent and a respective routing agent is indicated as i=1.

15. The method as claimed in claim 13, wherein an S-LSP between two neighboring core routing agents is indicated as i=2.

16. The method as claimed in claim 13, wherein an S-LSP between a core routing agent and non-neighbor core routing agent is indicated as i=3.

17. The method as claimed in claim 13, wherein a BD-LSP between two core routing agents is indicated as i=4.

18. The method as claimed in claim 13, wherein an ODD-LSP between source and destination core routing agents for a on-demand connection request is indicated as i=0.