Local Restoration With Multiple Spanning Trees in Metro Ethernet Networks

Qiu, Jian; Gurusamy, Mohan; Chua, Kee Chaing; Liu, Yong

doi:10.1109/tnet.2010.2079945

Cited by 21 publications

(16 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The existing system define a local restoration mechanism [1] in metro Ethernet that selects appropriate backup spanning trees for rerouting traffic on a working spanning tree. Then restores the traffic to the backup spanning trees in case of failure locally.…”

Section: Metro Ethernet Local Restoration Frameworkmentioning

confidence: 99%

See 1 more Smart Citation

Local Restoration in Metro Ethernet Networks for Multiple Link Failures

Shibu¹,

K²,

V.T³

2014

IJCATR

View full text Add to dashboard Cite

Ethernet a popular choice for metropolitan-area networks (MAN) due to simplicity, cost effectiveness and scalability. The Spanning-Tree based switching mechanism, which is considered to be very efficient at avoiding switching loops in LAN environment, is a performance bottleneck in Metro network context. Handling of link failure is an important issue in metro Ethernet networks. A link failure may result in serious service disruptions. A local restoration method for metro Ethernet with multiple spanning trees, which aims at fast handling of single link failures in a distributed manner, have been proposed in the literature. In this paper, we propose a local restoration mechanism that uses MULTILINK algorithm for solving multiple link failures

show abstract

Section: Metro Ethernet Local Restoration Frameworkmentioning

confidence: 99%

“…A Metro Ethernet [1] is a computer network that covers a metropolitan area and that is based on the Ethernet standard. It is commonly used as a metropolitan access network to connect subscribers and businesses to a larger service network or the Internet.…”

Section: Introductionmentioning

confidence: 99%

Local Restoration in Metro Ethernet Networks for Multiple Link Failures

Shibu¹,

K²,

V.T³

2014

IJCATR

View full text Add to dashboard Cite

show abstract

“…They often exploit MSTP instructions in their own implementation. We can mention several multiple spanning tree proposals: Qiu in [10] proposed the local restoration with multiple spanning trees. It is a distributed method based on MSTP and virtual local area network specified as VLAN [11].…”

Section: Related Workmentioning

confidence: 99%

Co-spanning tree restoration mechanism for metro Ethernet switched networks

Masoumi

Othman

2014

Photon Netw Commun

View full text Add to dashboard Cite

Ethernet, a popular technology in IT industry, with high transmission rate, simple maintenance, and compatibility with different types of links was invented for local and small-scale computer networks. However, current spanning tree-based Ethernet protocols do not meet the requirements for metro Ethernet networks in terms of network resilience. One of the most important weaknesses is slow re-convergence time in the event of a link failure when a new spanning tree must be reconstructed to ensure the survivability of networks. In this paper, we propose a co-spanning tree restoration (CSTR) mechanism for metro Ethernet switched networks to handle the link failures. Upon failure of a link on the network, a distributed failure restoration protocol will be activated to reconstruct the damaged spanning tree using a co-tree link. We explain the details of the protocol, including advertisement tables and fundamental reconfiguration processes. In addition, we propose a simple and effective solution for a double link failure and develop an optional feature to control unnecessary topology changes. The simulated results of CSTR on different network topologies show its features of efficiency and quick recovery.

show abstract

“…The most recent method proposes that uses a close graphbased reconfiguration method, it works based on up*/Down* [30] routing method .Any topology change occurs during reconfiguration the centralized autonomous system [16] calculates new path by Fully Explicit Algorithm [33] for distributed network and dijkstra based algorithm [18] in Output Channels Input Channels source routing networks .Next recent approach is epoch marking system, it guarantees' that only packets potentially leading to a deadlock will be removed in saturation condition. It is based on regressive deadlock recoveries and used in distributed networks.…”

Section: Related Workmentioning

confidence: 99%

An Efficient Monarchic Reconfiguration Protocol with Deadlock Freedom on Interconnection Networks

MohiadeenAbdulKadhar¹,

Revathi²

2012

IJCA

View full text Add to dashboard Cite

Monarchic Reconfiguration protocol (MRP) is the selfgoverning, independent and autonomous system to resolve the deadlocking problem during reconfiguration in interconnection networks. Deadlock is the cyclic dependency between the old and new routing functions. Our aim is to protect the routing path with deadlocking freedom and improve the performance drastically. Our proposed method will increase the availability and dependability of the network and reduce 100 % pocket drops ratio with deadlock freedom. INTERCONNECTION NETWORKSHigh-performance interconnection networks comprise the communication backbone in digital systems at several system levels. At the higher system levels, local-area networks (LANs) are used in clusters of PCs, networks of workstations and other distributed processing systems which serve as cost/performance effective alternatives to tightly-coupled massively parallel processing systems. System-area networks (SANs) are used for interconnecting processors, memories, and I/O devices in systems with the primary goal of increasing reliability in the presence of link/router failures. Storage-area networks (STANs)[1]are used to increase performance and reliability of large disk arrays by offering access to stored data by processors through multiple paths, thus providing continued service in the presence of processor failure. Internet protocol router fabric (IPRF) networks are used within IP routers to handle IP traffic at high (multi gigabit) sustained line rates. Server I/O(SIO) and inter processor communication (IPC) [2,3] networks are used to overcome many of the scalability limitations of multi chip bus-based systems, allowing high-speed interconnections between memory controllers and I/O devices, direct access to disk from LAN adapters, and concurrent communication between processors, memories and I/O devices in multiprocessors. Likewise, at lower levels, networks-on-chip (NOCs) [4,5,6]are used to overcome many of the performance limitations of bus-based systems at the chip level. Parallel computing and communication systems built from the above networks require high-performance communication services [7] with high reliability, availability and dependability -collectively, high robustness. The performance [8] of the interconnection network is measured, in part, by packet delivery time[9] from source to destination (i.e., latency) and by the number of packets delivered per unit time (i.e., throughput). In essence, a high-performance network allows the maximum number of packets to make forward progress to their destinations in minimal time, preferably along shortest paths [10] to preserve network bandwidth. Likewise, the reliability, availability and dependability of a network equally impact the overall goodness (quality of a system). These attributes are measured, in part, by the network's ability to remain up and running at near normal levels even when events occur which change its configuration, possibly due to changes in users' needs and/or system state. Such reconfiguration events ma...

show abstract

Local Restoration With Multiple Spanning Trees in Metro Ethernet Networks

Cited by 21 publications

References 23 publications

Local Restoration in Metro Ethernet Networks for Multiple Link Failures

Local Restoration in Metro Ethernet Networks for Multiple Link Failures

Co-spanning tree restoration mechanism for metro Ethernet switched networks

An Efficient Monarchic Reconfiguration Protocol with Deadlock Freedom on Interconnection Networks

Contact Info

Product

Resources

About