Reliable Multi-Bit-Rate VPN Provisioning for Multipoint Carrier-Grade Ethernet Services Over Mixed-Line-Rate WDM Optical Networks

Marwan Batayneh; Dominic Schupke; Marco Hoffmann; Andreas Kirstaedter; Biswanath Mukherjee

doi:10.1364/JOCN.3.000066

Journal of Optical Communications and Networking
Vol. 3,
Issue 1,
pp. 66-76
(2011)
•https://doi.org/10.1364/JOCN.3.000066

Reliable Multi-Bit-Rate VPN Provisioning for Multipoint Carrier-Grade Ethernet Services Over Mixed-Line-Rate WDM Optical Networks

Marwan Batayneh, Dominic Schupke, Marco Hoffmann, Andreas Kirstaedter, and Biswanath Mukherjee

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Marwan Batayneh, Dominic Schupke, Marco Hoffmann, Andreas Kirstaedter, and Biswanath Mukherjee, "Reliable Multi-Bit-Rate VPN Provisioning for Multipoint Carrier-Grade Ethernet Services Over Mixed-Line-Rate WDM Optical Networks," J. Opt. Commun. Netw. 3, 66-76 (2011)

Export Citation
- BibTex
- Endnote (RIS)
- HTML
- Plain Text
Citation alert
Save article

Abstract

Ethernet’s success in local-area networks (LANs) is fueling the efforts to extend its reach to cover metro and long-haul networks. A key enabler for using Ethernet in the carrier’s network is its ability to efficiently support multipoint-to-multipoint (MP2MP) services. MP2MP service is the core underlying structure to enable standard Ethernet services such as Ethernet virtual private networks (E-VPNs). Since most of the research, standardization, and development have focused on designing protection architectures for point-to-point (P2P) Ethernet connections, protecting E-VPN services is an important research problem. Among the various transport methods for realizing carrier Ethernet, the wavelength-division multiplexing (WDM) optical network is a strong candidate. Wavelength channel rates are increasing from 10 to $40 Gbits ∕ s$ and even $100 Gbits ∕ s$ , and they can also coexist in the same fiber. We study the problem of cost-efficient provisioning of multi-bit-rate $(1 ∕ 10 ∕ 40 ∕ 100 Gbits ∕ s)$ self-protected E-VPN demands over a carrier-grade Ethernet network employing WDM optical network (Ethernet over WDM) with mixed line rates (MLRs). We study two algorithms for self-protected E-VPN provisioning. The first algorithm reforms the original E-VPN topology and increases the provisioning rates $(10 ∕ 40 ∕ 100 Gbits ∕ s)$ of the E-VPN edge demands to create excess capacity that can be used for protection (E-VPN reformation). The second algorithm routes the E-VPN edge demands using the lowest available rate $(10 ∕ 40 ∕ 100 Gbits ∕ s)$ and establishes backup capacity for protecting the E-VPN (no E-VPN reformation). Our algorithms are tested on a 17-node German national network topology. The results show that using E-VPN reformation achieves significant cost reduction and significant improvement in the network’s performance by reducing the traffic-blocking ratio.

Full Article | PDF Article

More Like This

New Strategies for Connection Protection in Mixed-Line-Rate Optical WDM Networks

Menglin Liu, Massimo Tornatore, and Biswanath Mukherjee
J. Opt. Commun. Netw. 3(9) 641-650 (2011)

Adaptive Reliable Multipath Provisioning in Survivable WDM Mesh Networks

Sheng Huang, Chip Martel, and Biswanath Mukherjee
J. Opt. Commun. Netw. 2(6) 368-380 (2010)

Efficient Shared Subconnection Protection in Mixed-Line-Rate Optical WDM Networks

Menglin Liu, Massimo Tornatore, and Biswanath Mukherjee
J. Opt. Commun. Netw. 5(11) 1227-1235 (2013)

Previous Article Next Article

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (18)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (2)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription


Step 1) For each E-VPN, do the following:
1) For each E-VPN edge (demand), select the rate of the optical channel that will carry the edge as the lowest optical transmission rate that can carry the edge’s traffic; update E-VPN; call it E- ${VPN}^{*}$ .
2) For an edge in E-VPN with demand D, do the following:
a) Demultiplex D into the corresponding number of the finest traffic granularity units $(u)$ that can be supported by the Ethernet switches:
b) For each unsatisfied u, do the following:
i) Determine the residual capacity in each E- ${VPN}^{*}$ edge and construct residual capacity graph $G r$ , where $G r$ includes all the edges with residual capacity and that do not violate any resource-sharing constraints.
ii) Assign weights to each edge in $G r$ , where the weight of each edge is equal to its available capacity; find shortest path over $G r$ ; if path is found, mark u as satisfied.
iii) If no path is found, add dummy edges one at a time to $G r$ between any node pairs that are not connected by a direct edge; assign weight to dummy edge of lowest line rate; find shortest path [22] each time a dummy edge is added.
iv) Mark u as unsatisfied; store u along with paths found in a list $L 1$ .
3) For all paths in $L 1$ , do the following:
a) Determine the frequency (number of appearances in all paths) for each dummy edge and store them in a list $L 2$ ; sort $L 2$ entries in descending order according to their frequencies.
b) Start with top of $L 2$ :
i) If the selected dummy edge originally belongs to E- ${VPN}^{*}$ , set the rate of the original edge to be the next higher optical rate available in the network; goto Step 1.2.b.
ii) Else, add the dummy edge to E- ${VPN}^{*}$ and select its rate to be lowest rate that can carry the maximum number of traffic units using the edge at a time; goto Step 1.2.b.
4) Record resource-sharing constraints, i.e., any two edges with protection resources in common must be recorded.
Step 2) Pass E- ${VPN}^{*}$ to Algorithm 2 for mapping over the given physical topology.
Step 3) If no physical topology mapping is found, record the physical topology constraints (lack of resources or link- disjoint paths that satisfy the resource-sharing constraints) that prevented successfully mapping E- ${VPN}^{*}$ ; goto Step 1.


Step 1) For each E-VPN, do the following:
1) For each E-VPN edge (demand), select the rate of the optical channel that will carry the edge as the lowest optical transmission rate that can carry the edge’s traffic; update E-VPN; call it E- ${VPN}^{*}$ .
2) For an edge in E-VPN with demand D, do the following:
a) Demultiplex D into the corresponding number of the finest traffic granularity units $(u)$ that can be supported by the Ethernet switches:
b) For each unsatisfied u, do the following:
i) Determine the residual capacity in each E- ${VPN}^{*}$ edge and construct residual capacity graph $G r$ , where $G r$ includes all the edges with residual capacity and that do not violate any resource-sharing constraints.
ii) Assign weights to each edge in $G r$ , where the weight of each edge is equal to its available capacity; find shortest path over $G r$ ; if path is found, mark u as satisfied.
iii) If no path is found, add dummy edges one at a time to $G r$ between any node pairs that are not connected by a direct edge; assign weight to dummy edge of lowest line rate; find shortest path [22] each time a dummy edge is added.
iv) Mark u as unsatisfied; store u along with paths found in a list $L 1$ .
3) For all paths in $L 1$ , do the following:
a) Determine the frequency (number of appearances in all paths) for each dummy edge and store them in a list $L 2$ ; sort $L 2$ entries in descending order according to their frequencies.
b) Start with top of $L 2$ :
i) If the selected dummy edge originally belongs to E- ${VPN}^{*}$ , set the rate of the original edge to be the next higher optical rate available in the network; goto Step 1.2.b.
ii) Else, add the dummy edge to E- ${VPN}^{*}$ and select its rate to be lowest rate that can carry the maximum number of traffic units using the edge at a time; goto Step 1.2.b.
4) Record resource-sharing constraints, i.e., any two edges with protection resources in common must be recorded.
Step 2) Pass E- ${VPN}^{*}$ to Algorithm 2 for mapping over the given physical topology.
Step 3) If no physical topology mapping is found, record the physical topology constraints (lack of resources or link- disjoint paths that satisfy the resource-sharing constraints) that prevented successfully mapping E- ${VPN}^{*}$ ; goto Step 1.

Abstract

Cited By

Figures (18)

Tables (2)

Journal of Optical Communications and Networking