Method and apparatus for enhanced routing within a shortest path based routed network containing local and long distance links
Use of a Location ID in addition to normal information to allow development of non-shortest path routes. The edge switches which terminate the distance links between locations are identified. Shortest path routes are determined for all switches in the same location. For each edge switch, routes over the distance links to other locations are determined, marking the interface connected to the distance links. The two determined sets of routes are combined. For devices directly connected to the edge switch, only the marked interface is used to reach the other location. For switches directly connected to the edge switch, use only routes from non-marked interfaces to marked interfaces and remove any routes from marked to marked or non-marked to non-marked interfaces. This operation for the directly connected switches allows single hops that are non-shortest path to an edge switch and removes certain potential loopback situations due to shortest path routes.
1. A method for routing comprising:
determining whether each domain is local or is accessible over a distance link;
developing a routing table which uses shortest path routing for all local domains and includes non-shortest path routes used for domains accessible over a distance link; and
routing using the routing table,
wherein said developing step includes:
determining shortest path routes for all domains in the same location;
determining routes to domains at different locations for each distance link;
determining, for a switch connected to a distance link, for switches connected to the switch connected to a distance link, routes from the switches to the distance link; and
removing, for a switch connected to a distance link, any routes from distance links to a location to distance links to the same location or local links to local links.
2. The method of claim 1 , wherein said developing step further includes:
determining, for devices connected to a switch, routes to domains at a different location that use all eligible links.
3. A switch comprising:
at least one distance port for connection to a distance link to a remote location of a network, the remote location including at least one domain;
at least one local port for connection to a device or switch at a local location of a network, the local location including at least one domain in addition to the switch;
a processor;
a memory coupled to said processor and containing software programs executed by said processor to perform functions; and
a routing circuit connecting said at least one local port and said at least one distance port,
wherein said software programs include instructions to cause said processor to:
determine whether each domain is local or is accessible over a distance link;
develop a routing table which uses shortest path routing for all local domains and includes non-shortest path routes used for domains accessible over a distance link; and
provide said routing table to said routing circuit so that routing is performed using said routing table,
wherein said developing step includes:
determining shortest path routes for all domains in the same location;
determining routes to domains at different locations for each distance link;
determining, for a switch connected to said at least one local port, routes from the switch to said at least one distance port; and
removing any routes from said at least one distance port to a location to another said at least one distance port to the same location or said at least one local port to another said at least one local port.
4. The switch of claim 3 , wherein said developing a routing table further includes:
determining, for devices connected said at least one local port, routes to domains at a different location using all eligible links.