A Study on the Efficient Label Management Methods in High-Speed IP switching Networks


The KIPS Transactions:PartC, Vol. 11, No. 4, pp. 527-538, Aug. 2004
10.3745/KIPSTC.2004.11.4.527,   PDF Download:

Abstract

In this paper, we present the flow aggregation method and the FLTC(flow lasting time control) algorithm to reduce the number of flows and solve the scalability problem in high speed IP switching networks. The flow aggregation based on the destination address could reduce the total number of flows, improve the label efficiency, and increase the total amount of the switched packets. The FLTC algorithm also eliminates the waste of label by deleting the flow binding efficiently. With the traces of real Internet traffics, we evaluate the performance of these schemes by simulation. The label efficiency, the average number of label used, and the percentage of packets switched and the number of packets switched are used as performance measures for this simulation.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. H. Shim and H. Chang, "A Study on the Efficient Label Management Methods in High-Speed IP switching Networks," The KIPS Transactions:PartC, vol. 11, no. 4, pp. 527-538, 2004. DOI: 10.3745/KIPSTC.2004.11.4.527.

[ACM Style]
Jae Hun Shim and Hoon Chang. 2004. A Study on the Efficient Label Management Methods in High-Speed IP switching Networks. The KIPS Transactions:PartC, 11, 4, (2004), 527-538. DOI: 10.3745/KIPSTC.2004.11.4.527.