Provider link state bridging

  title={Provider link state bridging},
  author={David Allan and Peter Ashwood-Smith and Nigel Bragg and Don Fedyk},
  journal={IEEE Communications Magazine},
Wide area communications technology has been challenged to virtualize large numbers of Ethernet LAN segments. This is a consequence of a mismatch between the broadcast nature of the LAN segment and the extremely constrained connectivity implied by the p2p connections or tunnels available in the WAN environment, which have been combined to create virtual LAN segments. PBB-TE has been a practical demonstration of how filtering applied to a broadcast media can result in a connection. This article… 
Smart Spanning Tree Bridging for Metro Ethernets
  • A. Meddeb
  • Computer Science
    2008 33rd IEEE Conference on Local Computer Networks (LCN)
  • 2008
This paper aims at illustrating that it can still use spanning trees in metro ethernet provided that the tree generation and VLAN-spanning-tree mapping are performed adequately and calls the solution smart spanning tree bridging (SSTB), which can be used to enhance the 802.1s MSTP.
Performance Analysis of Shortest Path Bridging Control Protocols
  • J. Farkas, Zoltan Arato
  • Computer Science
    GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference
  • 2009
An extensive analysis of Ethernet control protocols based on simulations focusing on protocol convergence time, which is a key attribute of carrier grade networks is provided.
Comparative Study of Multicast Protection Algorithms Using Shared Links in 100GET Transport Network
Three multicast protection algorithms based on the shared capacity between primary and backup solutions are proposed and evaluated and the blocking probability is used to evaluate the performance of the proposed algorithms.
Enhancing NGN's versatility for Multi-Service support: The Bridging Virtualization approach
An architectural model which is based on Broadband Forum technical recommendations for Multi-Service (TR-058), and makes use bridging technology in all the nodes, and a radically new approach for network convergence, Bridging Virtualization are presented.
Ontc Prism Newsletter Mpls-tp Shortest Path Bridging: a Novel Control Plane for Ethernet
A warm welcome from the Editorial desk of the ONTC’s newsletter “Prism”. It is our pleasure to bring to you this third edition of PRISM – ONTC’s quarterly newsletter. The industry is moving towards
Intelligent load balancing for shortest path bridging
An overview of a method to enhance the load spreading algorithms used by IEEE 802.1aq Shortest Path Bridging, which provides balanced network utilization and the ability to apply subtle modifications to the distribution of the traffic matrix previously unachievable with shortest path forwarding alone.
Using Modified Floyd-Warshall Algorithm to Implement SPB IEEE 802.1aq Protocol Simulator on NS-3
The design and implementation of an SPB simulator for NS-3 is presented and the results prove that the communication maintains the crucial property of SPB; congruency between multicast and unicast, and symmetry between forward and backward paths.
Fault Recovery in Carrier Ethernet, Optical and GMPLS Networks
The fault recovery functionalities in optical, Carrier Ethernet and GMPLS networks are described, considering the role ofGMPLS in each scenario, and the currently standardized schemes and published research are overviewed.
International Journal of advanced studies in Computer Science and Engineering
This work proposed an improved method applying ECMP in a big network, in which there are more than 16 shortest paths between some two bridges, and ECMP becomes limited.


Metro Ethernet - deploying the extended campus using Ethernet technology
  • F. Brockners, N. Finn, S. Phillips
  • Computer Science
    28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings.
  • 2003
A look at redundancy and loop avoidance for large layer-2 provider networks - including a discussion of the current approaches in VPLS as well as new proposals, which lead to a generic solution for redundancy in large Layer 2 provider networks.
Ethernet Data Plane Evolution for Provider Networks
The development of data plane maintenance protocols (OAM), and scaling enhancements, initially in the form of VLANs, then VLAN stacking, and more recently complete recursion of headers have led to the ability to decouple the infrastructure data plane from traditional bridging behavior while preserving other desirable attributes.
LSOM: A Link State protocol Over MAC addresses for metropolitan backbones using Optical Ethernet switches
Simulation results for 4-node and 9-node topologies show that LSOM can improve throughput over RPR by a factor of up to 1.7 and full freedom to choose any MAN active topology allows an effective use of the available dark fiber resources.
Alternative multiple spanning tree protocol (AMSTP) for optical Ethernet backbones
A new protocol, the alternative multiple spanning tree protocol (AMSTP), that uses multiple source based spanning trees for backbones using Ethernet switches, that provides minimum paths and more efficient usage of optical backbone infrastructure than currently proposed protocols such as resilient packet ring and rapid spanning tree.
Analyses of the reverse path forwarding routing algorithm
  • C. Marr, G. Lowe
  • Computer Science
    International Conference on Dependable Systems and Networks, 2004
  • 2004
This work considers the case where the cost of links is independent of the node using that link, and uses a special-purpose network sampling program to increase confidence in the correctness of this stricter protocol, and a hand-proof to verify correctness.
Reverse path forwarding of broadcast packets
Reverse path forwarding is a practical algorithm for broadcast routing in store-and-forward packet switching computer networks which can be implemented in existing networks with less complexity than that required for the known alternatives.
A note on two problems in connexion with graphs
  • E. Dijkstra
  • Mathematics, Computer Science
    Numerische Mathematik
  • 1959
A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Algorithm 97: Shortest path
The procedure was originally programmed in FORTRAN for the Control Data 160 desk-size computer and was limited to te t ra t ion because subroutine recursiveness in CONTROL Data 160 FORTRan has been held down to four levels in the interests of economy.