Question Discussion & Solution

The passage describes BGP as 'a path-vector protocol that exchanges complete AS paths. Its decision-making is heavily influenced by policy and administrative preferences...' and also notes, 'The complexity of routing loops, path oscillations, and ensuring rapid convergence remains a constant challenge across all routing paradigms and protocols.' Option B accurately captures both these aspects. Options A, C, and D contain inaccuracies regarding BGP's nature (it's not metric-based shortest path, not LS, not for virtual circuits) or mischaracterize the challenges (e.g., slow convergence is not unique to BGP, and BGP itself does not inherently 'solve' count-to-infinity as it's a DV-specific issue, though BGP's path attributes offer loop prevention in its own context).