One of the shortcomings of Spanning Tree Protocol (STP) is that it computes a valid, but not necessarily optimal, path between nodes within a network.

The statement is correct. The primary objective of the Spanning Tree Protocol (STP) is to prevent Layer 2 forwarding loops in a network with redundant links by creating a single, loop-free logical topology. It accomplishes this by electing a Root Bridge and ensuring every other switch has only one active, lowest-cost path towards that Root Bridge. All other redundant paths are logically blocked. Consequently, the path taken between any two non-root switches is not necessarily the most direct or lowest-latency physical path. Instead, traffic may have to traverse "up" the spanning tree towards a common ancestor (or all the way to the Root Bridge) and then "down" to the destination switch. A more direct physical link between the two switches might exist but will be in a blocking state to maintain the loop-free topology. Therefore, STP guarantees a valid, loop-free path, but this path is often suboptimal compared to the shortest physical path available.

The "False" option is incorrect because the potential for suboptimal pathing is a fundamental and well-documented characteristic of STP's design. The protocol's algorithm prioritizes loop prevention over path optimization between all pairs of nodes. Newer protocols like Shortest Path Bridging (SPB) were developed specifically to address this and other STP limitations.

1. Nokia Official Documentation: Nokia 7450 ESS, 7750 SR, 7950 XRS, and VSR Layer 2 Services and EVPN Guide, Release 22.10.R1, Section: "Spanning Tree Protocol (STP)". The documentation describes how STP, RSTP, and MSTP operate by creating a single active path to a root, which inherently means other direct paths are blocked. The guide states, "The Spanning Tree Protocol (STP) is a Layer 2 protocol that runs on bridges and switches... STP creates a single spanning tree for the entire bridged network, which results in a single active path between any two nodes." This confirms the creation of a single path, which is not necessarily the most optimal one if a more direct link is blocked.

2. Academic Publication (Original Protocol Design): Perlman, R. (1985). "An algorithm for distributed computation of a spanning tree in an extended LAN." ACM SIGCOMM Computer Communication Review, 15(4), 44–53. https://doi.org/10.1145/318951.319004. While the paper details the algorithm for creating a loop-free tree, subsequent analysis and networking pedagogy built upon this work universally acknowledge that the resulting tree does not guarantee shortest paths between all pairs of nodes, only between each node and the root.

3. University Courseware: Kurose, J. F., & Ross, K. W. (2021). Computer Networking: A Top-Down Approach (8th ed.). Pearson. In Chapter 6, "The Link Layer: Links, Access Networks, and LANs," the text explains the operation of spanning tree. It clarifies that the protocol forces traffic to follow the branches of the tree, even if a "shortcut" link (which is blocked by STP) exists, thus leading to suboptimal routing between some pairs of switches. This textbook is standard curriculum in numerous university computer science and engineering programs.