TY - GEN
T1 - An optimized VPLS Traffic Engineering distributed routing algorithm
AU - Ali, Najah Abu
AU - Mouftah, Hussein T.
AU - Gazor, Saeed
PY - 2005
Y1 - 2005
N2 - Virtual Private LAN Service (VPLS) is a layer 2 service that emulates LAN service across a Wide Area Network (WAN). It differs from conventional L2 Virtual Private Network (VPN) by connecting customers by a multipoint network. One solution to provide the service is the Multi-Protocol Label Switching (MPLS) core networks, as it supports Traffic Engineering (TE) functionality. However, the TE functionality is limited to Point to Point (P2P) paths, while to support VPLS services over MPLS, the network users expect broadcast, multicast and unicast traffic to be forwarded. The paper presents an on line distributed bandwidth guaranteed routing algorithm, which does not assume any knowledge of the expected demands of the network traffic and introduces a new definition for the critical links. The algorithm maximizes the number of admitted requests by avoiding the links which are critical for routing traffic of other source-destinations sets. Additionally, it balances the load over the network by routing traffic over the links with maximum residual bandwidth.
AB - Virtual Private LAN Service (VPLS) is a layer 2 service that emulates LAN service across a Wide Area Network (WAN). It differs from conventional L2 Virtual Private Network (VPN) by connecting customers by a multipoint network. One solution to provide the service is the Multi-Protocol Label Switching (MPLS) core networks, as it supports Traffic Engineering (TE) functionality. However, the TE functionality is limited to Point to Point (P2P) paths, while to support VPLS services over MPLS, the network users expect broadcast, multicast and unicast traffic to be forwarded. The paper presents an on line distributed bandwidth guaranteed routing algorithm, which does not assume any knowledge of the expected demands of the network traffic and introduces a new definition for the critical links. The algorithm maximizes the number of admitted requests by avoiding the links which are critical for routing traffic of other source-destinations sets. Additionally, it balances the load over the network by routing traffic over the links with maximum residual bandwidth.
KW - MPLS
KW - Point-to-multipoint paths
KW - QoS routing
KW - Resource managements
KW - VPLS
UR - http://www.scopus.com/inward/record.url?scp=84870049012&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84870049012&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84870049012
SN - 9781622763504
T3 - International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2005, SPECTS'05, Part of the 2005 Summer Simulation Multiconference, SummerSim'05
SP - 465
EP - 472
BT - International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2005, SPECTS'05, Part of the 2005 Summer Simulation Multiconference, SummerSim'05
T2 - International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2005, SPECTS 2005, Part of the 2005 Summer Simulation Multiconference, SummerSim 2005
Y2 - 24 July 2005 through 28 July 2005
ER -