Fortinet FCP_FGT_AD-7.6 Questions & Answers

Static route distance and priority (4.1) would demonstrate or implement: Mismatched distance or priority can select a slower WAN path while the preferred next hop remains available. The case states: the most appropriate corrective action AND the specific evidence confirming success. The most direct paired action and test is: SD-WAN member status, zone membership and a controlled flow agree with the approved path selection.

Equal-cost route redundancy and path verification (4.1) addresses another technical failure: Assuming equal-cost paths provide perfect balancing or fast failover without link monitoring can cause session disruption. This choice can be useful for that problem, but it does not establish the Sd-wan members and zones control being assessed here.

Static route next-hop reachability (4.1) would demonstrate or implement: A bounded trace and route lookup show the gateway is reachable and the authorized flow leaves by the intended interface. The paired-answer requirement concerns Sd-wan members and zones; this alternative does not provide the matching intervention and separate acceptance evidence.

Static route distance and priority (4.1) addresses another technical failure: Mismatched distance or priority can select a slower WAN path while the preferred next hop remains available. The case states: A voice service deteriorates on one ISP but a simple port-up check still reports its link healthy. The most direct diagnosis is: Use supported SD-WAN performance SLAs to monitor appropriate destinations and thresholds for latency, jitter and packet loss.

Static route next-hop reachability (4.1) addresses another technical failure: A route to an unreachable next hop can blackhole permitted packets even when its configuration appears syntactically valid. This choice can be useful for that problem, but it does not establish the Sd-wan performance sla probes control being assessed here.

Equal-cost route redundancy and path verification (4.1) addresses another technical failure: Assuming equal-cost paths provide perfect balancing or fast failover without link monitoring can cause session disruption. The required diagnosis concerns Sd-wan performance sla probes; a passing result for this alternative could leave that requirement unresolved.

Longest-prefix match and route lookup (4.1) would demonstrate or implement: A test destination uses the expected longest-prefix route and packet output agrees with the selected next hop. This choice can be useful for that problem, but it does not establish the Sd-wan performance sla probes control being assessed here.

Equal-cost route redundancy and path verification (4.1) would demonstrate or implement: Controlled client tests demonstrate permitted traffic distribution and recovery after one approved path becomes unavailable. This case instead tests Sd-wan performance sla probes; the choice measures or changes another part of the system.

Routing versus firewall policy separation (4.1) would demonstrate or implement: Traffic logs and route diagnostics show both the intended route and an approved first-match firewall policy. The required evidence concerns Sd-wan performance sla probes; a passing result for this alternative could leave that requirement unresolved.

Equal-cost route redundancy and path verification (4.1) addresses another technical failure: Assuming equal-cost paths provide perfect balancing or fast failover without link monitoring can cause session disruption. The case states: A branch configures SLA probes toward a host unreachable from the private MPLS member. The most direct corrective action is: Use supported SD-WAN performance SLAs to monitor appropriate destinations and thresholds for latency, jitter and packet loss.

Longest-prefix match and route lookup (4.1) addresses another technical failure: A broad default route cannot override an installed more-specific matching prefix solely because its interface is healthy. This choice can be useful for that problem, but it does not establish the Sd-wan performance sla probes control being assessed here.

Routing versus firewall policy separation (4.1) addresses another technical failure: A successful route lookup does not itself authorize a packet, and an allow rule does not create a missing return route. This case instead tests Sd-wan performance sla probes; the choice measures or changes another part of the system.

Routing versus firewall policy separation (4.1) would demonstrate or implement: A successful route lookup does not itself authorize a packet, and an allow rule does not create a missing return route. The case states: A branch configures SLA probes toward a host unreachable from the private MPLS member. The most direct risk is: An unreachable or unsuitable probe target can make a healthy WAN look failed or fail to detect real application degradation.

Longest-prefix match and route lookup (4.1) would demonstrate or implement: A broad default route cannot override an installed more-specific matching prefix solely because its interface is healthy. This choice can be useful for that problem, but it does not establish the Sd-wan performance sla probes control being assessed here.

Static route distance and priority (4.1) would demonstrate or implement: Mismatched distance or priority can select a slower WAN path while the preferred next hop remains available. This case instead tests Sd-wan performance sla probes; the choice measures or changes another part of the system.

Longest-prefix match and route lookup (4.1) addresses another technical failure: A broad default route cannot override an installed more-specific matching prefix solely because its interface is healthy. The case states: An SLA target is so strict that every WAN link is marked unhealthy during normal traffic. The most direct corrective action is: Use supported SD-WAN performance SLAs to monitor appropriate destinations and thresholds for latency, jitter and packet loss.

Routing versus firewall policy separation (4.1) addresses another technical failure: A successful route lookup does not itself authorize a packet, and an allow rule does not create a missing return route. This case instead tests Sd-wan performance sla probes; the choice measures or changes another part of the system.

Static route distance and priority (4.1) addresses another technical failure: Mismatched distance or priority can select a slower WAN path while the preferred next hop remains available. The required corrective action concerns Sd-wan performance sla probes; a passing result for this alternative could leave that requirement unresolved.

Static route distance and priority (4.1) would demonstrate or implement: Route-table inspection and a controlled primary-path test confirm expected route preference and backup behavior. The case states: An SLA target is so strict that every WAN link is marked unhealthy during normal traffic. The most direct evidence is: Measured link health and an application test agree on which WAN members satisfy the required quality thresholds.

Routing versus firewall policy separation (4.1) would demonstrate or implement: Traffic logs and route diagnostics show both the intended route and an approved first-match firewall policy. This choice can be useful for that problem, but it does not establish the Sd-wan performance sla probes control being assessed here.

Static route next-hop reachability (4.1) would demonstrate or implement: A bounded trace and route lookup show the gateway is reachable and the authorized flow leaves by the intended interface. The required evidence concerns Sd-wan performance sla probes; a passing result for this alternative could leave that requirement unresolved.

Routing versus firewall policy separation (4.1) addresses another technical failure: A successful route lookup does not itself authorize a packet, and an allow rule does not create a missing return route. The case states: A provider route stays up while packet loss makes video calls unusable. The most direct corrective action is: Use supported SD-WAN performance SLAs to monitor appropriate destinations and thresholds for latency, jitter and packet loss.

Static route next-hop reachability (4.1) addresses another technical failure: A route to an unreachable next hop can blackhole permitted packets even when its configuration appears syntactically valid. This choice can be useful for that problem, but it does not establish the Sd-wan performance sla probes control being assessed here.

Static route distance and priority (4.1) addresses another technical failure: Mismatched distance or priority can select a slower WAN path while the preferred next hop remains available. The required corrective action concerns Sd-wan performance sla probes; a passing result for this alternative could leave that requirement unresolved.

Static route next-hop reachability (4.1) would demonstrate or implement: A route to an unreachable next hop can blackhole permitted packets even when its configuration appears syntactically valid. This choice can be useful for that problem, but it does not establish the Sd-wan performance sla probes control being assessed here.

Static route distance and priority (4.1) would demonstrate or implement: Mismatched distance or priority can select a slower WAN path while the preferred next hop remains available. This case instead tests Sd-wan performance sla probes; the choice measures or changes another part of the system.

Equal-cost route redundancy and path verification (4.1) would demonstrate or implement: Assuming equal-cost paths provide perfect balancing or fast failover without link monitoring can cause session disruption. The required risk concerns Sd-wan performance sla probes; a passing result for this alternative could leave that requirement unresolved.

Static route distance and priority (4.1) addresses another technical failure: Mismatched distance or priority can select a slower WAN path while the preferred next hop remains available. This choice can be useful for that problem, but it does not establish the Sd-wan performance sla probes control being assessed here.

Static route next-hop reachability (4.1) addresses another technical failure: A route to an unreachable next hop can blackhole permitted packets even when its configuration appears syntactically valid. This case instead tests Sd-wan performance sla probes; the choice measures or changes another part of the system.

Equal-cost route redundancy and path verification (4.1) addresses another technical failure: Assuming equal-cost paths provide perfect balancing or fast failover without link monitoring can cause session disruption. The required corrective action concerns Sd-wan performance sla probes; a passing result for this alternative could leave that requirement unresolved.

Routing versus firewall policy separation (4.1) addresses another technical failure: A successful route lookup does not itself authorize a packet, and an allow rule does not create a missing return route. The case states: An operator wants to use packet-loss and jitter evidence rather than relying only on interface bandwidth counters. The most direct paired action and test is: Use supported SD-WAN performance SLAs to monitor appropriate destinations and thresholds for latency, jitter and packet loss.

Longest-prefix match and route lookup (4.1) would demonstrate or implement: A test destination uses the expected longest-prefix route and packet output agrees with the selected next hop. This choice can be useful for that problem, but it does not establish the Sd-wan performance sla probes control being assessed here.

Equal-cost route redundancy and path verification (4.1) would demonstrate or implement: Assuming equal-cost paths provide perfect balancing or fast failover without link monitoring can cause session disruption. This case instead tests Sd-wan performance sla probes; the choice measures or changes another part of the system.