The traffic on the Internet has been growing exponentially for some time. This growth is beginning to stress the current-day routers. However, switching technology offers much higher performance. So the label switching network which combines IP routing with switching technology, is emerged.
Especially in the data driven label switching, flow classification and cache table management are needed. Flow classification is to classify packets into switching and non-switching traffic, and cache table management is to mantain the cache table which contains information for flow classification and label switching.
However, the cache table management affects the performance of label switching network considerably as well as flow classification, because the bigger cache table makes more traffic switched and maintains setup cost lower, but cache is restricted by local router resources. For that reason, there is need to study the cache replacement scheme for the efficient cache table management with the Internet traffic characterized by user.
So in this thesis, we propose several cache replacement schemes for label switching network. First, without the limitation at switching capacity in the router, we introduce FIFO(First In First Out), LFC(Least Flow Count), LRU(Least Recentrly Used)}, priority LRU and weighted priority LRU scheme. Second, with the limitation at switching capacity in the router, we introduce LFC-LFC, LFC-LRU, LRU-LFC and LRU-weighted LRU scheme. Without limitation, weighted priority LRU scheme and with limitation, LRU-weighted LRU scheme showed best performance in this thesis.