Optimized QoS protection of ethernet trees

Cinkler, Tibor; Kern, András; Moldován, István

doi:10.1109/drcn.2005.1563889

Cited by 7 publications

(11 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our preceding work [2], [13] focused on the ILP based model and it was compared to the standard based STP and MSTP. These results showed that using more trees realized a doubled throughput, while optimizing these trees doubles the throughput again.…”

Section: Preceding Experiencesmentioning

confidence: 99%

Scalable Tree Optimization for QoS Ethernet

Kern

Moldován

Cinkler

2006

11th IEEE Symposium on Computers and Communications (ISCC'06)

Self Cite

View full text Add to dashboard Cite

The low cost and the wide availability make Ethernet the dominant networking technique of access networks. Standardization further extends the capabilities of Ethernet by adding traffic separation and prioritization (802.1Q) and by allowing use of multiple spanning trees (802.1s). In this paper we present an Ethernet based QoS architecture for broadband services with triple play support. We propose an optimization framework with Traffic Engineering where the MSTP trees are spanned taking both the traffic conditions and the QoS requirements into account. The optimization is based on our previously presented formal model. Here we propose a novel decomposition based tree constructing heuristic with high scalability. We conduct simulations to evaluate the performance of the heuristic method that provides nearly optimal solutions within acceptable time constraints.

show abstract

Section: Preceding Experiencesmentioning

confidence: 99%

Scalable Tree Optimization for QoS Ethernet

Kern

Moldován

Cinkler

2006

11th IEEE Symposium on Computers and Communications (ISCC'06)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The restoration time for Ethernet running RSTP is depending on the processing time of Ethernet switches. Although the failure recovery time is reduced to fall within the range of few seconds [5], it is still far behind the 50 msec failover requirement used in telecommunication networks. The restoration time requirements for network services are summarized in [6].…”

Section: Introductionmentioning

confidence: 99%

“…A VLAN that binds to a spanning tree instance can only use the links belonging to the tree to deliver frames. Multi-VLAN based network protection approaches have been proposed in [5,[10][11][12][13]. Backup VLANs are provisioned in advance to protect working VLANs.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Modeling and Algorithm for Multiple Spanning Tree Provisioning in Resilient and Load Balanced Ethernet Networks

Lee

Lin³

2015

Mathematical Problems in Engineering

View full text Add to dashboard Cite

We propose a multitree based fast failover scheme for Ethernet networks. In our system, only few spanning trees are used to carry working traffic in the normal state. As a failure happens, the nodes adjacent to the failure redirect traffic to the preplanned backup VLAN trees to realize fast failure recovery. In the proposed scheme, a new leaf constraint is enforced on the backup trees. It enables the network being able to provide 100% survivability against any single link and any single node failure. Besides fast failover, we also take load balancing into consideration. We model an Ethernet network as a twolayered graph and propose an Integer Linear Programming (ILP) formulation for the problem. We further propose a heuristic algorithm to provide solutions to large networks. The simulation results show that the proposed scheme can achieve high survivability while maintaining load balancing at the same time. In addition, we have implemented the proposed scheme in an FPGA system. The experimental results show that it takes only fewμsec to recover a network failure. This is far beyond the 50 msec requirement used in telecommunication networks for network protection.

show abstract

“…This mechanism requires that the link failures be propagated to all nodes so they can switch to the corresponding tree. The calculation of the trees is also done offline before the network starts operating and it is described in [44]. It is based on an ILP optimization that creates as few trees as possible but ensuring that all possible link failures are covered.…”

mentioning

confidence: 99%

Building Ethernet Connectivity Services for Provider Networks

Bonada

Sala

2009

IEEE INFOCOM Workshops 2009

View full text Add to dashboard Cite

Στ oυς δυo µας "Si em llevés i fos rei, reuniria a les corts per incloure en el codi penal que es prohibeixi a la gent anar pel món buscant res que no pugui anomenar."(De la cançó Flor Groga de Manel )"If I woke up as king, I would convene the court to include in the penal code that people are forbidden to wander through the world in search of something they cannot name."(From the song Flor Groga by Manel ) AcknowledgementsFirst of all, I want to sincerely thank my advisor. Without her help, her guidance and her support, I wouldn't have been able to complete this work. Her continuous dedication helped me to overtake all the obstacles that I encountered in my way.Thank you Dolors! Also, specially thanks to my colleagues and friends from the second floor of Tànger building for providing me a lot of support and companionship. Thank you for your technical discussions, coffee breaks, economical lectures, delightful dinners, running sessions, friday after-lunch procrastination, etc. Thank you guys! Obviously I also want to thank my whole family for supporting me. Surely they are the ones who have believed in me all this time, even more than myself. Thanks a lot. (Evidentment també full agraïr a la meva família tot el support que m'ha donat. Segurament ells són els que més han cregut en mi durant tot aquest temps, fins i tot més que jo mateix. Moltes gràcies!) Thanks to her. I cannot find enough words to describe my gratitude for being there. This is why I dedicate to her the entire thesis with more than 70.000 words. Anna, υχαριστ ω! And finally, I want to thank this list of people for the enjoyable moments: Paul, John, George, Ringo; Jarvis, Nick, Candida, Steve, Russell; David, Marc, Dani, Xavi, Alfons; Marcus, Winston, Ben, Ted; Guillem, Arnau, Marti, Roger; Damon , Graham, Alex, Dave; Ernest, Jordi, Jordi; Zach, Perrin, Jason, Nick, Kristin, Paul , Jon, Kelly, Tracy, Ben, Lucy; Joan Miquel, Pau, Pere Manel, Jaume, Joan; Win, Regine, Richard, William, Tim, Sarah, Jeremy; Joan, Candid, David, Lluis, Marina; Joe, Mick, Paul, Terry, Nicky; Ian, Bernard, Stephen, Gillian, Phil, Tom, Peter; Robert, Simon, Roger, Jason AbstractThe continuous growing demand of data services in residential and enterprise customers has motivated the network providers to deploy more effective networking technologies in their infrastructures. Ethernet's good properties offer providers an opportunity for using it at very large scale replacing the existing ATM/SONET and even in some extent IP networking. However, Ethernet was originally designed for LANs without very strict requirements, and using it as a carrier-grade technology represents a new application that leads to new requirements such as quick recovery, efficient resource utilization, better path selection and provision of path control.In Ethernet technology the Spanning Tree Protocol (STP) is responsible of establishing the connectivity of the different Ethernet segments in a single interconnected network. The STP creates an active tree on top of the physical topology to avoid p...

show abstract

Optimized QoS protection of ethernet trees

Cited by 7 publications

References 4 publications

Scalable Tree Optimization for QoS Ethernet

Scalable Tree Optimization for QoS Ethernet

Modeling and Algorithm for Multiple Spanning Tree Provisioning in Resilient and Load Balanced Ethernet Networks

Building Ethernet Connectivity Services for Provider Networks

Contact Info

Product

Resources

About