An Algorithm for the Stacking Problem of Asymmetric Merged Tunnelling

As the Internet traffic demand is increasing day by day, we need to fully optimize the network resources available with us in order to meet the demands efficiently. One way to do this is Label Space Reduction i.e. we need to reduce the number of labels required by the Label Switch Routers (LSRs) which in turn reduces the Operational Expenditure (OPEX). There are three methods for label space reduction problem: Label Merging (MP2P), Asymmetric Tunnelling and the combined approach Asymmetric Merged Tunnelling (AMT). It has already been proven that with AMT around 20% more label space reduction can be achieved. But there are some drawbacks of AMT of which one is the Stacking Problem. In this paper we propose an algorithm SP_AMT for solving the Stacking Problem of AMT which uses the concept of a very well known algorithm Longest Common Subsequence (LCS).