Multiprotocol label switching (MPLS) network is used to remove the overhead of routing table lookup at each router. Within the MPLS network, the routing table lookup is done at the edge routers which match the routing table values with the label table values and attach a label for the MPLS network. But, on comparative analysis, it is being found out that for the smaller and larger networks the time taken in MPLS network becomes more. In this paper, we propose a hierarchical MPLS network algorithm to reduce the time taken by the packets to reach from source to destination in a large MPLS network. It also deals with the small MPLS network and suggests solution for the same.