Improvement of the Colored Thread Algorithm to Prevent Loop in MPLS Network

Improvement of the Colored Thread Algorithm to Prevent Loop in MPLS Network

, , Journal of Internet Computing and Services, Vol. 3, No. 1, pp. 41-50, Feb. 2002
Full Text:

Abstract

Ohba has suggested the Colored Thread Algorithm to prevent looped path when LSP is to be setup. M immediate node sends thread information such as color, hop count. ill, to downs1ream node via LDP message for the set-up of LSP. Afterward, decides that the looped path is formed when it receives a message with a same colored thread that was sent to downs1ream node, and it searches another path. If the message reaches to the egress node, then acknowledged message is sent to upstream node as reverse direction to the ingress node to set up loop-free path. For the algorithm, Ohva has defined three thread states as Null, Colored, Transparent. In this paper, the state of thread is extended to 5 states such as Extending, Merging, Stalling, Null, and Transparent. By the way, related FSM and TCB was redefined to make clear the ambiguity of thread states which causes faulty actions and to remove overhead. And, to improve performance, it limits to generate a thread in the state of Stalling.

Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from November 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

[APA Style]

전환식 & 김한경 (2002). Improvement of the Colored Thread Algorithm to Prevent Loop in MPLS Network. Journal of Internet Computing and Services, 3(1), 41-50.

[IEEE Style]

전환식 and 김한경, "Improvement of the Colored Thread Algorithm to Prevent Loop in MPLS Network," Journal of Internet Computing and Services, vol. 3, no. 1, pp. 41-50, 2002.

[ACM Style]

전환식 and 김한경. 2002. Improvement of the Colored Thread Algorithm to Prevent Loop in MPLS Network. Journal of Internet Computing and Services, 3, 1, (2002), 41-50.