VC merge capable switch reduced buffer requirement in MPLS

摘要

In MPLS (MultiProtocol Label Switching), we focus on VC merge which is scalable technique due to decrease the total number of VC. However, in the conventional VC merge capable switch, the number of reassembly buffers greatly increases as switch size grows large. In this paper, we propose VC merge capable switch reduced buffer requirement. In the proposed model, we can greatly reduce the number of reassembly buffers and decrease the access speed of memory since we can share the reassembly buffers between the cells arrived at all input ports by controller. We evaluate the packet loss probability and the mean system delay performance of the proposed model and the conventional model by computer simulations. As a result, we show that the number of reassembly buffers decrease on the order of 0(N) and the access speed of memory become low. Therefore, the proposed model is effective in MPLS.