METHOD AND APPARATUS FOR HIERARCHICAL ROUTING IN MULTIPROCESSOR MESH-BASED SYSTEMS

• US 20090274157A1
• Filed: 05/01/2008
• Published: 11/05/2009
• Est. Priority Date: 05/01/2008
• Status: Abandoned Application

• Current Assignee: Intel Corporation
• Original Assignee: Intel Corporation
• Inventors: Vaidya, Aniruddha S., Jayasimha, Doddaballapur N.
• Application Number:
  US12/113,281
• Publication Number:
  US 20090274157A1
• Time in Patent Office: Days
• US Class Current: 370/400
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04W 40/24 Connectivity information management, e.g. connectivity discovery or connectivity update
• CPC Class Codes: H04W 40/32 for defining a routing cluster membership
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A method and apparatus for hierarchical routing in mesh systems. The method may include splitting 420 a mesh network of nodes into a plurality of partitions, each partition including at least one node, dividing 430 a first partition into a plurality of rectangular regions, determining 440 a partition route from a source region to a destination region of the plurality of rectangular regions, and providing 450 a region route from a source node within one of the plurality of rectangular regions to a destination node within the same rectangular region. The method may also include routing 460 a packet from a source node within the source region to a destination node within the destination region using the partition route and the region route.

Claims

1. A method comprising:

splitting a mesh network of nodes into a plurality of partitions, each partition including at least one node;

dividing a first partition into a plurality of rectangular regions;

determining a partition route from a source region to a destination region of the plurality of rectangular regions;

providing a region route from a region source node within one of the plurality of rectangular regions to a region destination node within the same rectangular region; and

routing a packet from a source node within the source region to a destination node within the destination region using the partition route and the region route.

2. The method according to claim 1, wherein the plurality of rectangular regions comprises a plurality of adjacent rectangular regions.

3. The method according to claim 1, wherein a first partition of the plurality of partitions provides performance isolation from a second partition of the plurality of partitions.

4. The method according to claim 1, wherein splitting the mesh network allows for non-rectangular partitions while providing performance isolation between any two partitions.

5. The method according to claim 1, wherein providing a region route comprises providing a region route from a region source node within each of the plurality of rectangular regions to a region destination node within the same rectangular region.

6. The method according to claim 1, further comprising assigning a packet with both a packet destination region identifier and a packet destination node intra-region identifier.

7. The method according to claim 6, further comprising:

assigning a node with both a node region identifier and an intra-region identifier; and

comparing the packet destination region identifier with the node region identifier to determine if the packet has reached the destination region.

8. The method according to claim 7, further comprising comparing the packet destination node intra-region identifier with the node intra-region identifier to determine if the packet has reached the destination node within the destination region.

9. The method according to claim 1, further comprising:

examining a packet destination node intra-region identifier and a packet destination region identifier;

comparing the packet destination region identifier with a node region identifier to determine if the packet has reached the destination region; and

comparing, if the packet has reached the destination region, the packet destination node intra-region identifier with a node intra-region identifier to determine if the packet has reached the destination node.

10. The method according to claim 1, wherein providing a region route comprises providing a region route from a region source node within the destination region to a region destination node within the destination region.

11. The method according to claim 1, further comprising creating a tree of the plurality of rectangular regions,

wherein determining comprises determining a partition route from a source region to a destination region of the plurality of rectangular regions using an using up-down routing.

12. The method according to claim 1, wherein routing the packet employs deadlock freedom by routing the packet from the source node within the source region to the destination node within the destination region first using a deadlock free partition route and then using a deadlock free region route.

13. An apparatus comprising:

a mesh network including a plurality of nodes; and

a controller coupled to the mesh network, the controller including a routing initialization module configured to split the mesh network into a plurality of partitions, each partition including at least one node, divide a first partition into a plurality of rectangular regions; and

at least one local routing module coupled to a node of the plurality of nodes, the at least one local routing module configured to determine a partition route from a source region to a destination region of the plurality of rectangular regions, provide a region route from a region source node within one of the plurality of rectangular regions to a region destination node within the one of the plurality of rectangular regions, and route a packet from a source node within the source region to a destination node within the destination region using the partition route and the region route.

14. The apparatus according to claim 13, wherein the routing initialization module is configured to split the mesh network to allow for non-rectangular partitions while providing performance isolation between at least two partitions.

15. The apparatus according to claim 13, wherein the at least one local routing module provides a region route by providing a region route from a source node within each of the plurality of rectangular regions to a destination node within each of the plurality of rectangular regions.

16. The apparatus according to claim 13, wherein the routing initialization module is configured to assign a packet with a packet destination region identifier and a packet destination node intra-region identifier and assign a node with a node region identifier and a node intra-region identifier.

17. The apparatus according to claim 16, wherein the at least one local routing module includes a routing comparison module configured to compare the packet destination region identifier with the node region identifier to determine if the packet has reached the destination region and compare the packet destination node intra-region identifier with the node inter-identifier to determine if the packet has reached the destination node within the destination region.

18. The apparatus according to claim 13, wherein the routing initialization module is further configured to divide each of multiple partitions into a plurality of rectangular regions that have performance isolation.

19. A method comprising:

splitting a mesh network of nodes into a plurality of partitions, each partition including at least one node, at least one partition providing performance isolation from at least one other partition of the plurality of partitions;

dividing a first partition into a plurality of rectangular regions;

determining a partition route from a source region to a destination region of the plurality of rectangular regions;

providing a region route from a region source node within the destination region to a region destination node within the destination region;

examining a packet destination region identifier and a packet destination node intra-region identifier;

comparing the packet destination region identifier with a node region identifier to determine if the packet has reached the destination region; and

comparing, if the packet has reached the destination region, the packet destination node intra-region identifier with a node intra-identifier to determine if the packet has reached the destination node.

20. The method according to claim 19, wherein the plurality of partitions comprises a combination of rectangular and non-rectangular partitions.