Open Shortest Path First (OSPF) is the correct answer because it is designed to support hierarchical network structures through areas and provides an efficient routing mechanism that conserves bandwidth by reducing update traffic. OSPF uses the Dijkstra shortest path first algorithm, which computes the shortest path between nodes, making it suitable for complex enterprise network environments. RIP, while also a dynamic routing protocol, uses hop count as its metric and is not suitable for larger and more hierarchical networks due to its maximum hop count limitation and slow convergence. EIGRP, although efficient and fast in convergence, does not use the Dijkstra algorithm but instead uses a composite metric that includes bandwidth and delay. BGP is primarily used for routing between autonomous systems on the Internet and not typically for routing within an enterprise network.