A VC-merge capable switch reducing buffer requirement by sharing reassembly buffers in MPLS

In the MPLS (multiprotocol label switching), VC-merge (virtual circuit-merge) is known as a scalable technique to reduce the total number of VC. However, in the conventional VC-merge capable switch, the number of reassembly buffers greatly increases as the switch size grows large. We propose a VC-merge capable switch with less buffer requirement. In the proposed model, we can reduce the number of reassembly buffers and decrease the access speed of buffer memory since we can share reassembly buffers between the cells that arrived at all input ports by the controller. We compare the packet loss probability and the mean system delay performance of the proposed model with those of the conventional model by computer simulations. As a result, we show that the number of reassembly buffers decreases on the order of O(N) and the access speed of buffer memory becomes low. Therefore, the proposed model is effective in MPLS