Layer 2 Routing with Multi-Spanning Tree Per a Node 


Vol. 33,  No. 9, pp. 751-759, Sep.  2008


PDF
  Abstract

Carrier Ethernet backbone network integrates distributed layer-2 based metro networks. In this networks, Multiple Spanning Tree Protocol (MSTP) has been used as a main routing protocol that allows multiple spanning trees in a network. A better routing protocol called IEEE802.1aq - Shortest Path Bridging (SPB) is recently proposed, that generates the shortest spanning tree per a destination node. As SPB provides a routing path per a destination node, there is no way to adapt network traffic at normal condition. If we are free from the principle of "a spanning tree per a destination node", we can achieve adaptive routing. Based on this philosophy, we propose a new spanning tree based protocol - Edge Node DIvided Spanning Tree (ENDIST). ENDIST divides an edge node into sub-nodes as many as connecting links from the node and each sub-node generates a single shortest path tree based on SPB. Depending on network or nodal status, ENDIST chooses a better routing path by flow-basis. This added traffic engineering ability contributes to enhanced throughput and reduced delay in backbone networks. The simulation informs us that ENDIST's throughput under heavy load performs about 3.4-5.8 and 1.5-2.0 times compared with STP's and SPB's one respectively. Also, we verified that ENDIST's throughput corresponds to the theoretical upper bound at half of cases we investigated. This means that the proposed ENDIST is a dramatically enhanced and the close-to-perfect spanning tree based routing schemes.

  Statistics
Cumulative Counts from November, 2022
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]

C. Suh, J. Shin, K. Kim, "Layer 2 Routing with Multi-Spanning Tree Per a Node," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 9, pp. 751-759, 2008. DOI: .

[ACM Style]

Changjin Suh, Jisoo Shin, and Kyungmi Kim. 2008. Layer 2 Routing with Multi-Spanning Tree Per a Node. The Journal of Korean Institute of Communications and Information Sciences, 33, 9, (2008), 751-759. DOI: .

[KICS Style]

Changjin Suh, Jisoo Shin, Kyungmi Kim, "Layer 2 Routing with Multi-Spanning Tree Per a Node," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 9, pp. 751-759, 9. 2008.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880