For information exchange between routers to work efficiently on an IP internetwork, routers must have knowledge of other network IDs or be configured with a default route. On medium-sized or large internetworks, the routing tables must be maintained in an up-to-date state so that network traffic travels along optimal paths. How the routing tables are maintained defines the distinction between static and dynamic routing:
Static routing is based on routing table entries that are manually configured on a static router and that do not change when internetwork topology changes. On a static router, a network administrator with knowledge of the internetwork topology builds and updates the routing table. The routing table on a static router either contains a route for every subnet on the internetwork, or the router is configured to use route summarization and thus the routing table contains only summary routes. Static routers do not exchange routing information with each other.
On an internetwork based on static routing, an IP node is manually configured so that its default gateway address matches the IP address of the local router interface. When a node sends a packet to another network, it forwards the packet to the local router, which checks its own routing table and determines which route to use to forward the packet.
Static routing can work well for small internetworks. Static routing can also be appropriate for connecting a branch office to a main office across a WAN link. However, static routing does not scale well to large or frequently changing internetworks because of the manual administration it requires.
Static routers are not fault tolerant — a static router cannot sense that a neighboring router is no longer available over an operational link or that a remote network segment is no longer reachable if a link goes down. Because a static router is unaware of these changes, it cannot make adjustments to its routing table and requires an administrator to update the router.
A computer running Windows Server 2003 that has two or more network adapters (each configured with an IP address and subnet mask defining routes for local subnets) can function as a static IP router. Typically, to avoid conflicts in case the router is connected to two or more disjoint subnets, only one of the network adapters is configured with a default gateway. For information about disjoint networks, including how to configure an Internet Security and Acceleration (ISA) or virtual private network (VPN) server to prevent disjoint network unreachability, see Default Gateway Behavior for Windows TCP/IP.
On a server running Windows Server 2003 Routing and Remote Access, you can add static routes in three ways:
-
In the console tree of the Routing and Remote Access snap-in, by adding a route on the IP Routing\Static Routes node
-
By using the route add command-line utility (with the -p switch to add a persistent static route)
-
By accessing the netsh routing ip context in a command prompt window and then using the add persistentroute command
Static routing entries
An administrator configuring a static routing entry manually specifies the following information:
-
Destination. A destination IP address for this route, which can be a host address, a subnet address, a summarized network address, or the destination for the default route (0.0.0.0).
-
Network mask. The subnet mask for the static route. This number is used in conjunction with the destination IP address. For example, a mask of 255.255.255.255 means that only an exact match of the network mask with the destination can use this route. A mask of 0.0.0.0 means that any destination can use this route. For more information, see “Details of How IP Makes the Routing Decision” earlier in this document.
-
Gateway. The next-hop IP address for this route. For a LAN interface, the gateway address is the IP address of a neighboring router. For a demand-dial interface, no gateway address is configured.
-
Metric. The cost (such as the number of hops to the destination, or a unitless metric, such as the speed or reliability of the link) associated with this route. When multiple routes to the same destination exist, IP selects the route with the lowest metric.
For more information about how IP handles entries in the routing table, see How the IPv4 Routing Table Works earlier in this section.
Using static routing with dynamic routing
Using static routing exclusively is appropriate only for a small internetwork that is rarely reconfigured. However, a medium-size or large internetwork that primarily uses dynamic routing typically also uses some manually configured static routes. For example, you might use a static route with a higher metric as the redundant backup for a dynamically configured route. In addition, you might use dynamic routing for most paths but configure a few static paths where you want to ensure that network traffic follows a particular route, such as configuring routers to force traffic over a specific path to a high-bandwidth link.
Autostatic updates across temporary WAN links
Using dynamic routing protocols across temporary dial-up WAN links is not feasible because dynamic routing protocols typically advertise the contents of the routing table at periodic intervals. Such automatic periodic advertisements are appropriate only for permanently connected LAN or WAN links. If a dial-up WAN link is configured to use dynamic routing, it might incur long-distance charges each time one router calls another router to establish a connection and update the routing table. A more cost-effective way to update the routing table over a dial-up WAN link is to configure autostatic updates. RIP supports autostatic updates; OSPF does not.
An autostatic route is a static route that is dynamically obtained through an exchange of RIP messages. An administrator can enable autostatic updates on an interface that is used for a demand-dial connection so that — whenever the demand-dial link is in a connected state — a request for updated routes can be sent over that interface. Autostatic updates are automatic only in the sense that, when the administrator gives the command to update routes, the router sends an update request across the link to the router on the other side of the connection, and then the router automatically adds the requested routes as static routes to its routing table. Although the term autostatic update might seem to imply an automatic operation, autostatic updates are not automatically performed when the demand-dial connection is made but only if the command to perform the update is given.
As an alternative to issuing a command to initiate a manual autostatic update, if you use Routing and Remote Access RIP routers, you can use the Routing and Remote Access snap-in, Netsh commands, and Task Scheduler to schedule autostatic updates:
-
In the Routing and Remote Access snap-in, enable autostatic update mode by navigating to the IP Routing\RIP node in the console tree, and then selecting the Auto-static update mode option on the General tab of the InterfaceName Properties page.
-
Create a batch file or Netsh script file that contains the following commands:
netsh interface set interface name=DemandDialInterfaceName connect=CONNECTED
netsh routing ip rip update DemandDialInterfaceName
netsh interface set interface name=DemandDialInterfaceName connect=DISCONNECTED
-
Open Scheduled Tasks in Control Panel, double-click Add Scheduled Task, and then follow the wizard instructions to establish the schedule for the batch file or Netsh script to run.
Static routing in IPv6
A computer running the Windows Server 2003 family can act as a static IPv6 router that forwards IPv6 packets between interfaces based on the contents of the IPv6 routing table. You can configure static routes by using the netsh interface ipv6 add route command.
For information about Windows Server 2003 support for static routing in an IPv6 environment, see “How IPv6 Works” in IPv6 Technical Reference.
Dynamic routing is based on routing table entries that are automatically configured and automatically updated by routers whenever the topology of the internetwork changes. Dynamic routing protocols enable this ongoing maintenance of routing tables by using a series of periodic or on-demand messages containing routing information about the internetwork environment that is exchanged among routers. Any dynamic routing protocol enables routers to perform the following basic functions:
-
Detect other routers (called neighbors) with which it will exchange routing information.
-
Store the routing data that it collects from other routers as entries in its routing table.
A router with dynamically configured and updated routing tables is known as a dynamic router. Except for initial configuration, dynamic routers require little ongoing maintenance and can therefore scale to large internetworks. For dynamic routing to work, the same routing protocol must be installed on each router on the internetwork.
Dynamic routing in a multipath IP internetwork is fault tolerant (for a brief description of multipath routing, see “Single-Path vs. Multipath Routing Infrastructures” earlier in this document). Dynamic routes learned from other routers have a finite lifetime: If a router or link fails, dynamic routers detect the change in the internetwork topology when the lifetime of the learned route expires in the routing table. This change then propagates to other routers so that all routers on the internetwork become aware of the new topology.
The ability to scale and the ability to recover from internetwork faults make dynamic routing the better choice for medium, large, and very large internetworks. Routing protocols do, however, increase network traffic on the internetwork. This additional traffic can be an important factor in planning WAN link usage.
Two or more dynamic routing protocols cannot interoperate on the same internetwork because each protocol collects different types of data and uses different techniques to converge after topological changes occur. However, you can configure two or more routing protocols on a single router to connect internetworks that use different routing protocols. For example, you can configure RIP on an interface that connects to a RIP-based internetwork and configure OSPF on another interface that connects to an OSPF-based internetwork. A router with these interfaces can be configured to exchange routing information between the two networks. The exchange of routing information between networks that use different dynamic routing protocols is sometimes referred to as route redistribution.
A computer running the Windows Server 2003 Routing and Remote Access service can act as a dynamic router that also supports static routing. An administrator can use the Routing and Remote Access snap-in to add RIP, OSPF, or both, and then enable the protocol on the appropriate interface by adding the interface to the RIP or OSPF protocol displayed in the console tree. On a Routing and Remote Access router, you can use the snap-in to add a static route to an internetwork configured to use dynamic routing by using the IP Routing\Static Routes node in the console tree.
Convergence
An important element of a routing protocol implementation is its ability to sense and recover from internetwork faults. How quickly the routing protocol can enable recovery from failures on the internetwork is determined by the type of failure, how it is sensed, and how the routing information is propagated throughout the internetwork.
When all routers on an internetwork have the correct routing information in their routing tables, the internetwork is said to have converged. Convergence is the process by which routers update routing tables after a change in network topology occurs — the change is replicated to all routers that need to know about it. When convergence is achieved, the internetwork is in a stable state and all routing occurs along optimal paths.
When a link or router fails, the internetwork must reconfigure itself to reflect the new topology. Information in routing tables must be updated. Until the internetwork reconverges, it is in an unstable state in which routing loops and black holes (both described later) can occur. The time it takes for the internetwork to reconverge is known as the convergence time. The convergence time varies based on the routing protocol and the type of failure — downed link or downed router.
For more information about convergence, see “Impact of Routing Loops and Black Holes During Convergence” later in this section, and see “How RIP Works” and “How OSPF Works” in How Unicast IPv4 Routing Protocols and Services Work.
Routing Protocols Used Between and Within Autonomous Systems
Autonomous systems (described earlier in “IPv4 Routing Infrastructure”) use two types of routing protocols to update routing information:
-
The protocols used to distribute routing information between two or more autonomous systems are known as Exterior Gateway Protocols (EGPs).
-
The protocols used to distribute routing information within a single autonomous system are known as Interior Gateway Protocols (IGPs).
The following figure depicts two autonomous systems using interior and exterior protocols to communicate.
EGPs are inter–autonomous system routing protocols. EGPs define the way that all routes within the autonomous system are advertised outside of the autonomous system. Routers that connect autonomous systems to the Internet backbone use an EGP to advertise routing information to each other. Advertising can include a list of routes in a flat routing infrastructure or a list of summarized routes in a hierarchical routing infrastructure.
EGPs are independent of the IGPs used within an autonomous system and can enable the exchange of routes between autonomous systems that use different IGPs.
The EGPs for IP internetworks include:
-
Exterior Gateway Protocol (EGP). An obsolete EGP that was developed to communicate information between autonomous systems on the Internet. Although EGP is the eponym for the generic protocol type for inter-autonomous system routing protocols, it is no longer used on the Internet because it cannot support multipath environments or classless routing. EGP was defined in the now obsolete RFC 904, “Exterior Gateway Protocol.”
-
Border Gateway Protocol (BGP). The EGP that is currently used to communicate information between autonomous systems on the Internet. The Internet is a large IP internetwork divided into several autonomous systems that are connected by the Internet’s core routers, which use BGP for communication among themselves. BGP uses autonomous system numbers (ASNs) to avoid routing loops and to implement policy-based routing on the Internet backbone. Unlike its obsolete predecessor EGP, BGP supports complex multipath networks and classless routing. BGP is defined in RFC 1771, “A Border Gateway Protocol 4 (BGP-4)” and RFC 1772, “Application of the Border Gateway Protocol in the Internet” in the IETF RFC Database.
The Windows Server 2003 Routing and Remote Access service does not include EGP or BGP.
IGPs are intra–autonomous system routing protocols. Routers use an IGP to forward routing information to the other routers within the autonomous system. IGPs can distribute routes within the autonomous system in either a flat or hierarchical manner.
The IGPs for IP internetworks include:
-
RIP for IP. An RFC-based distance vector IGP.
-
OSPF. An RFC-based link state IGP.
-
IGRP. A distance vector IGP developed by Cisco Systems, Inc.
The Windows Server 2003 Routing and Remote Access service includes RIP and OSPF, but it does not include a version of IGRP. For detailed information about RIP and OSPF, see the next section, “Common IGP Dynamic Routing Protocols,” and see the companion document How Unicast IPv4 Routing Protocols and Services Work.
A third-party software vendor can develop a version of IGRP that works with the Routing and Remote Access service. For information about Microsoft platform software development kits (SDKs) that provide application programming interfaces (APIs) useful for third-party developers who create software that interacts with Windows Server 2003, including the Routing and Remote Access service, see “IPv4 and Routing and Remote Access APIs” in How Unicast IPv4 Routing Protocols and Services Work.
Common IGP Dynamic Routing Protocols
The most common types of dynamic routing protocols used within a single autonomous system are:
-
Distance vector routing protocols
-
Link state routing protocols
A distance vector routing protocol, such as RIP v2, is more appropriate for a relatively small, simple network that is not expected to grow rapidly. For a large, complex internetwork, a link state routing protocol, such as OSPF, is more appropriate. You must use RIP v2 or OSPF to support VLSM and route summarization. Although the outdated RIP v1 is still widely used in private networks, it does not support either VLSM or route summarization and thus is not well suited for enterprise networks.
Note |
|
The Windows Server 2003 Routing and Remote Access service does not support the dynamic routing protocols RIPng (the version of RIP for IPv6) or OSPF for IPv6. However, a computer running Windows Server 2003 can act as a static IPv6 router, and it is possible to route IPv6 traffic over an IPv4 internetwork using an IPv6 transition technology. For information about Windows Server 2003 support for static IP routing in an IPv6 environment, see “How IPv6 Works” in IPv6 Technical Reference. |
Understanding how distance vector and link state routing protocols work is essential to choosing the type of dynamic routing that best suits your network needs. The primary differences between distance vector and link state routing protocols include:
-
What routing information is exchanged
-
How the information is exchanged
-
How quickly the internetwork can recover from a downed link or a downed router
Distance Vector Dynamic Routing Protocols
A router that uses distance vector routing protocols, the earliest type of dynamic routing protocol, advertises the routes in its routing table to other routers at regular intervals. The routing information that is periodically exchanged between routers by using distance vector routing protocols is typically unsynchronized and unacknowledged.
A distance vector routing protocol advertises the number of hops to a network destination (the distance) and the direction in which a packet can reach a network destination (the vector). The distance vector algorithm, also known as the Bellman-Ford algorithm, enables a router to pass route updates to its neighbors at set intervals. Each neighbor then adds its own distance value and forwards the routing information on to its immediate neighbors. The result of this process is a table containing the cumulative distance to each network destination.
The following table lists several common distance vector routing protocols based on three major routable network protocols.
Common Distance Vector Dynamic Routing Protocols
|
Routable Network Protocol
|
Distance Vector Dynamic Routing Protocol
|
|
IP
|
Routing Information Protocol (RIP) for IP versions 1 and 2 (RIP v1 and RIP v2)
Interior Gateway Routing Protocol (IGRP)
|
|
IPX
|
Routing Information Protocol (RIP) for IPX
|
|
AppleTalk
|
Routing Table Maintenance Protocol (RTMP)
|
The Windows Server 2003 Routing and Remote Access service includes RIP v1 and RIP v2 for IP and RTMP for AppleTalk. Windows Server 2003 Routing and Remote Access does not include IGRP or RIP for IPX.
The advantages of distance vector dynamic routing protocols include:
-
Simpler. Distance vector routing protocols use simple router advertisement processes that are easy to understand.
-
Easy to configure. In its most basic form, configuring a distance vector routing protocol is as easy as enabling the protocol on the router interfaces.
The disadvantages of distance vector dynamic routing protocols include:
-
Large routing tables. Multiple routes to a specific network ID appear as multiple entries in the routing table. In a large internetwork with multiple paths, the IP routing table can have hundreds or thousands of entries.
This disadvantage is eliminated in some RIP router implementations, including Windows Server 2003, which store only one route — the route with the lowest metric — for any subnet in the routing table.
-
High network traffic overhead. Route advertising is done at periodic intervals, even (unnecessarily) after the internetwork has converged.
-
Does not scale. Because of the size of the routing table and the high network traffic overhead, distance vector routing protocols do not scale well to large or very large internetworks.
-
High convergence time. Because of the unsynchronized and unacknowledged way that distance vector information is exchanged, convergence of the internetwork can take several minutes. During convergence, routing loops and black holes can occur and result in lost or undeliverable data.
For more information about the RIP distance vector routing protocol, see the section “How RIP Works” in How Unicast IPv4 Routing Protocols and Services Work.
Link State Dynamic Routing Protocols
A router that uses a link state dynamic routing protocol, such as OSPF, stores information about the state of each link between itself and other routers. Link state routing protocols address some of the limitations of distance vector routing protocols. The most important of these improvements is that link state dynamic routing protocols enable faster convergence than distance vector routing protocols.
Unlike distance vector routing protocols, which broadcast updates to all routers at regularly scheduled intervals, link state routing protocols provide updates only when a network link changes state. When such an event occurs, a notification called a link state advertisement (LSA) is sent throughout the network to update routing tables. LSAs, which include the router network IDs, are sent at startup and again any time that changes in the internetwork topology are detected. Link state updates are sent by using unicast or multicast traffic rather than by broadcasting. Link state routers build a database of LSAs and use the database to calculate the routing table. Routing information exchanged between link state dynamic routers is synchronized and acknowledged.
Link state routing protocols are more reliable and require less bandwidth than do distance vector routing protocols. However, link state routing protocols are also more complex, more memory-intensive, and place a greater load on the CPU of a router.
The following table lists two major link state routing protocols used on internetworks based on two major routable network protocols.
Common Link State Dynamic Routing Protocols
|
Routable Network Protocol
|
Link State Dynamic Routing Protocol
|
|
IP
|
Open Shortest Path First (OSPF)
|
|
IPX
|
NetWare Link Services Protocol (NLSP)
|
The Windows Server 2003 Routing and Remote Access service includes OSPF; it does not include NLSP.
The advantages of link state dynamic routing protocols include:
-
Smaller routing tables. Only a single optimal route for each network ID is stored in the routing table.
-
Low network traffic overhead. Routers that use a link state dynamic routing protocol exchange less routing information after the internetwork has converged than do distance vector dynamic routing protocols. For example, after convergence OSPF sends only Hello packets at regular intervals. Unlike distance vector routing protocols, which broadcast updates to all routers at regularly scheduled intervals, link state routing protocols provide updates (in the form of an LSA) only when a network link changes state.
-
Ability to scale. Because of smaller routing tables and low network traffic overhead, link state routing protocols scale well to large and very large internetworks.
-
Lower convergence time. Link state routing protocols have a much lower convergence time than distance vector routing protocols. An internetwork that uses link state routing protocols converges without producing routing loops.
The disadvantages of link state dynamic routing protocols include:
-
Complexity. Link state routing protocols are more complex and difficult to understand than distance vector routing protocols.
-
More time needed to configure. A link state routing protocol implementation requires additional planning and configuration.
-
Resource intensive. For very large internetworks, the database of LSAs and the calculation of routing table entries can be memory and processor intensive.
For more information about the OSPF link state dynamic routing protocol, see the section “How OSPF Works” in How Unicast IPv4 Routing Protocols and Services Work.
Impact of Routing Loops and Black Holes During Convergence
Routing problems can occur when either a host routing table or a router routing table contains information that does not reflect the correct topology of the internetwork. On an internetwork that uses dynamic routing, the routing internetwork must reconfigure itself to reflect the new topology whenever a link or router fails. The internetwork is in an unstable state during the period of time it takes for convergence to take place — during this period of time, routing loops and black holes can occur.
Routing loops
During the routing process, packets are forwarded by the sending host and then by one or more routers in the optimal direction as determined by information in each node’s local routing table. If the routing table entries on all routers are correct, a unicast packet takes the best path from the source node to the destination node. However, if any routing table entry is incorrect, either through configuration errors or through learned routes that do not accurately reflect the topology of the internetwork, routing loops can occur.
A routing loop is a path through the internetwork that runs in a circle instead of reaching the intended destination. A routing loop occurs when routers forward traffic to each other in a loop that does not include the network segment of the destination.
The following figure illustrates an example of a routing loop that occurs when inaccurate information is stored in local routing tables.
In this example:
-
According to the routing table on Router 1, the optimal route to Network 10 is through Router 2.
-
According to the routing table on Router 2, the optimal route to Network 10 is through Router 3.
-
According to the routing table on Router 3, the optimal route to Network 10 is through Router 1.
The result would be an infinite loop — except that routable protocols use a counter in the network layer header of the packet to prevent the packet from perpetually looping. Each time a router passes the packet from one network segment to another, the router either increases or decreases the counter. If the count reaches its maximum value (when increasing) or reaches 0 (when decreasing), the packet is discarded by the router. For example, when an IP node sends an IP packet, IP sets a maximum link count in the Time to Live (TTL) field in the IP header. Each IP router crossed by the packet decreases the TTL value in the packet by one. When the TTL value is 0, the IP router discards the packet and sends an ICMP Time Exceeded-TTL Exceeded in Transit message back to the sending node from which the packet originated.
One common type of routing loop can be avoided by ensuring that neighboring routers are not configured with default routes that point to each other: that is, on each router, the default route (0.0.0.0, 0.0.0.0) must not have the Default gateway field configured with the IP address of the other router. Because a default route passes all traffic that is not on a directly connected network to the configured router, routers that have default routes pointing to each other can produce routing loops for traffic with an unreachable destination.
By typing ping -i 255 IP_address at a command prompt, you can initiate the detection of a possible routing loop. The -i parameter sets the TTL value in the ICMP Echo message. If the command results in the message TTL Expired In Transit, this indicates a possible routing loop. By typing tracert IP_address at a command prompt, you can then confirm that a routing loop exists if the output displays a set of repeating router IP addresses.
Black holes
The IP protocol is a connectionless, datagram-based protocol, which, by definition, does not guarantee a successful delivery. IP attempts a best effort, unacknowledged delivery to the next hop or to the final destination, which can lead to conditions on the internetwork in which data is lost.
If a downstream router fails and the failure is not detected by an upstream router, the upstream router continues to forward packets to the failed router. Because the failed downstream router does not receive the packets, the packets forwarded by the upstream router are dropped from the internetwork. The upstream router is said to be sending packets to a black hole, which is defined as a case in which packets on an internetwork are lost without any indication of an error.
In the following figure, Router 1 is not informed that Router 2 has failed and, therefore, continues to forward packets to Router 2. Router 2 is now a black hole because the packets are dropped and no error message is returned to Router 1.
A black hole can form when a link or router fails, and the failure is not yet detected. In a dynamic routing environment, routers detect failed links or failed routers when the lifetime of learned routes expires in their routing tables. In a static routing environment, a black hole persists until the functionality of the link or router is restored or until the static routers are reconfigured by the network administrator.
Black holes can also occur when an active router discards packets without indicating why the packets are discarded. For example, a Path Maximum Transmission Unit (PMTU) black hole router discards IP packets that need to be fragmented without returning a message to the sender indicating the error. A PMTU black hole router silently discards IP packets that require fragmentation if the Don't Fragment (DF) flag in the IP header of the received packet is set to 1. PMTU black hole routers can be difficult to detect because packets of smaller sizes are forwarded.
Link state protocols more robust than distance vector protocols
One of the disadvantages of distance vector dynamic routing protocols, such as RIP, is that, on a large internetwork, several minutes might be required for convergence to occur. This delay can allow routing loops or black holes to occur during convergence.
Link state dynamic routing protocols provide more robust protection against black holes and routing loops. For example, OSPF prevents routing loops due to unsynchronized databases by not advertising links until the routers at each end of a link have synchronized their databases. OSPF also reduces the occurrence of black holes caused by one-way links by not including links in its database until the links are known to be bidirectional.
On a network that uses multiple sources of routing information, route sources are ranked in order of preference. If two or more route sources provide a route to the same destination, the route learned by the route source with a lower rank number is the preferred route. One reason that route sources must be ranked — either by accepting the default ranks or by reordering them — is because metric definitions differ for different route sources, including the RIP and OSPF routing protocols. Rather than trying to reconcile these dissimilar metrics, the router uses the route learned from the most preferred route source.
For example, if you configure a Routing and Remote Access router to use both RIP and OSPF, the Routing and Remote Access service adds both RIP-learned routes and OSPF-learned routes to the Route Table Manager (RTM) IP routing table. If you specify that the metric of an OSPF-learned route is 5 and that the metric of the corresponding RIP-learned route is 3, and if OSPF is the preferred routing protocol, RTM adds only the OSPF route to the IP forwarding table.
Caution |
|
If you enable both RIP and OSPF on the same router, make sure that you configure each routing protocol on a separate interface, each connecting to a different network. |
If you use Windows Server 2003 Routing and Remote Access routers, you can modify the default preference levels for the following route sources in the Routing and Remote Access snap-in by navigating to the IP Routing\General node in the console tree and selecting the Preference Levels tab on the General Properties page:
-
Local.
-
Static, which refers to a static route assigned to a demand-dial interface that is added by using the Routing and Remote Access snap-in.
-
Static (non demand-dial), which refers to a static route assigned to a LAN interface that is added by using the Routing and Remote Access snap-in.
-
Auto-static.
-
Network Management, such as SNMP, which refers to a static route assigned to a LAN interface that is added by using the route add command-line tool. You cannot use route add to add a route for a demand-dial interface.
-
OSPF.
-
RIP v2.
Alternatively, you can specify the relative preference level of any of these route sources by using the netsh routing ip set preferenceforprotocol command.