End-to-end service provisioning based on extended segment routing in multi-domain optical networks of F5G

Xin Li; Yikai Liu; Yongli Zhao; Yajie Li; Zhuotong Li; Sabidur Rahman; Jie Zhang

doi:10.1364/JOCN.452358

Journal of Optical Communications and Networking
Vol. 14,
Issue 7,
pp. 550-561
(2022)
•https://doi.org/10.1364/JOCN.452358

End-to-end service provisioning based on extended segment routing in multi-domain optical networks of F5G

Xin Li, Yikai Liu, Yongli Zhao, Yajie Li, Zhuotong Li, Sabidur Rahman, and Jie Zhang

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Xin Li, Yikai Liu, Yongli Zhao, Yajie Li, Zhuotong Li, Sabidur Rahman, and Jie Zhang, "End-to-end service provisioning based on extended segment routing in multi-domain optical networks of F5G," J. Opt. Commun. Netw. 14, 550-561 (2022)

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

Abstract

As the most important fabric of fixed networks, the optical network plays an important role in expanding network capacity and providing long distance communication. At present, the fixed network has entered a key era, i.e., the fifth-generation fixed network (F5G). As one of the main features of F5G, the full-fiber connection requires a tenfold to hundredfold increase in the number of connections, which means F5G will have tens of thousands of nodes and millions of connections. Large-scale networks are composed of multiple network domains connected to each other. The whole network can be subdivided according to network functional domain. To meet different service requirements, how to provision fast end-to-end service in a multi-domain scenario has become a key issue. In optical networks, lightpath establishment must precede service transmission. The latency of lightpath establishment includes lightpath establishment signaling latency and optical interleaving device configuration latency. The latter depends on equipment performance. Therefore, how to provision fast lightpath establishment signaling is a key problem. To reduce end-to-end service provisioning latency, we propose an extended-segment-routing-based fast service provisioning scheme for the first time, to our knowledge, which consists of two steps: signaling path acquisition and signaling provisioning. For the signaling path acquisition step, we propose an adaptive segment routing (ASR) algorithm that first performs service path calculation based on service requirements, then performs a label compression algorithm to obtain the signaling path represented by the minimum number of labels according to the service path. For the signaling provisioning step, we propose a fast-signaling provisioning (FSP) process that can realize fast signaling provisioning in both single-domain and multi-domain scenarios. The simulation results show that, (1) compared to the Dijkstra algorithm, the ASR algorithm achieves a lower blocking probability for service and a better label compression effect for reducing the number of labels representing the signaling path, and, (2) compared to the traditional distributed signaling provisioning process and centralized signaling provisioning process, the FSP process achieves lower end-to-end latency.

Full Article | PDF Article

More Like This

Network Service Chaining Using Segment Routing in Multi-Layer Networks

Francesco Paolucci
J. Opt. Commun. Netw. 10(6) 582-592 (2018)

Segment Routing for Effective Recovery and Multi-domain Traffic Engineering

A. Giorgetti, A. Sgambelluri, F. Paolucci, F. Cugini, and P. Castoldi
J. Opt. Commun. Netw. 9(2) A223-A232 (2017)

Scalable and low server-to-server latency data center network architecture based on optical packet inter-rack and intra-rack switching

Georgios Drainakis, Peristera Baziana, and Adonis Bogris
J. Opt. Commun. Netw. 15(11) 804-819 (2023)

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 (9)

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

Algorithm: Adaptive Segment Routing Algorithm
Input: $G (V, E), R$
Output: ASR solution containing segment list ${\tilde{p}}_{k}$
1	Initialize the network $G (V, E)$
2	$r_{i} (s_{i}, d_{i}, b_{i})$ comes, and the duration obeys the Poisson distribution
3	for $r_{i}$ in $R$ , do
4	Calculate a path set $P = KSP (G (V, E), r_{i} (s_{i}, d_{i}))$
5	for $p_{k} \in P$ do
6	if the residual bandwidth of $p_{k}$ is greater than $b_{i}$
7	Select the path $p_{k}$ and denote it as ${\tilde{p}}_{k}$
8	end
9	end
10	$a \leftarrow 1, m \leftarrow 0, n \leftarrow 0$
11	for (a)
12	for ( $n \leftarrow m + 1; n <= L_{{\tilde{p}}_{k}}$ ; $n + +$ )
13	if $D (V_{{\tilde{p}}_{k}}^{m}, V_{{\tilde{p}}_{k}}^{n}) == {\tilde{p}}_{k}^{m, n}$ and $L_{{\tilde{p}}_{k}^{m, n}} \neq 2$
14	if $n == L_{{\tilde{p}}_{k}}$ :
15	Delete the intermediate SID between node $V_{{\tilde{p}}_{k}}^{m}$
	and $V_{{\tilde{p}}_{k}}^{n}$ in ${\tilde{p}}_{k}$
16	$a \leftarrow 0$
17	break
18	else if $D (V_{{\tilde{p}}_{k}}^{m}, V_{{\tilde{p}}_{k}}^{n + 1}) \neq {\tilde{p}}_{k}^{m, n + 1}$
19	Delete the intermediate SID between node $V_{{\tilde{p}}_{k}}^{m}$ and
	$V_{{\tilde{p}}_{k}}^{n}$ in ${\tilde{p}}_{k}$
20	$m \leftarrow n$
21	break
22	end
23	end
24	end
25	end
26	end
27	Output: ${\tilde{p}}_{k}$

	Infrastructure		SR Implement		Service Fluctuation		Constraints				Objects
Reference	Optical Layer	Packet Layer	Control Nodes in the DCN	Packet Layer	Static	Dynamic	Explicit Path	Bandwidth	Latency	Segment List Depth	Label Compression Ratio	Label Stack Size	Packet Overhead	Number of Flow Entries
Our work	$+$	−	$+$	−	−	$+$	$+$	−	−	−	$+$	−	−	−
Lazzeri et al. [27]	−	$+$	−	$+$	$+$	−	−	$+$	$+$	−	−	$+$	$+$	−
Zhou et al. [28]	−	$+$	−	$+$	$+$	−	−	−	−	$+$	−	−	$+$	$+$
Giorgetti et al. [29]	−	$+$	−	$+$	$+$	−	−	−	−	−	−	$+$	$+$	−
Guedrez et al. [17]	−	$+$	−	$+$	$+$	−	$+$	−	−	$+$	−	$+$	−	−
Huang et al. [30]	−	$+$	−	$+$	$+$	−	−	$+$	$+$	$+$	−	$+$	−	$+$

Algorithm: Adaptive Segment Routing Algorithm
Input: $G (V, E), R$
Output: ASR solution containing segment list ${\tilde{p}}_{k}$
1	Initialize the network $G (V, E)$
2	$r_{i} (s_{i}, d_{i}, b_{i})$ comes, and the duration obeys the Poisson distribution
3	for $r_{i}$ in $R$ , do
4	Calculate a path set $P = KSP (G (V, E), r_{i} (s_{i}, d_{i}))$
5	for $p_{k} \in P$ do
6	if the residual bandwidth of $p_{k}$ is greater than $b_{i}$
7	Select the path $p_{k}$ and denote it as ${\tilde{p}}_{k}$
8	end
9	end
10	$a \leftarrow 1, m \leftarrow 0, n \leftarrow 0$
11	for (a)
12	for ( $n \leftarrow m + 1; n <= L_{{\tilde{p}}_{k}}$ ; $n + +$ )
13	if $D (V_{{\tilde{p}}_{k}}^{m}, V_{{\tilde{p}}_{k}}^{n}) == {\tilde{p}}_{k}^{m, n}$ and $L_{{\tilde{p}}_{k}^{m, n}} \neq 2$
14	if $n == L_{{\tilde{p}}_{k}}$ :
15	Delete the intermediate SID between node $V_{{\tilde{p}}_{k}}^{m}$
	and $V_{{\tilde{p}}_{k}}^{n}$ in ${\tilde{p}}_{k}$
16	$a \leftarrow 0$
17	break
18	else if $D (V_{{\tilde{p}}_{k}}^{m}, V_{{\tilde{p}}_{k}}^{n + 1}) \neq {\tilde{p}}_{k}^{m, n + 1}$
19	Delete the intermediate SID between node $V_{{\tilde{p}}_{k}}^{m}$ and
	$V_{{\tilde{p}}_{k}}^{n}$ in ${\tilde{p}}_{k}$
20	$m \leftarrow n$
21	break
22	end
23	end
24	end
25	end
26	end
27	Output: ${\tilde{p}}_{k}$

	Infrastructure		SR Implement		Service Fluctuation		Constraints				Objects
Reference	Optical Layer	Packet Layer	Control Nodes in the DCN	Packet Layer	Static	Dynamic	Explicit Path	Bandwidth	Latency	Segment List Depth	Label Compression Ratio	Label Stack Size	Packet Overhead	Number of Flow Entries
Our work	$+$	−	$+$	−	−	$+$	$+$	−	−	−	$+$	−	−	−
Lazzeri et al. [27]	−	$+$	−	$+$	$+$	−	−	$+$	$+$	−	−	$+$	$+$	−
Zhou et al. [28]	−	$+$	−	$+$	$+$	−	−	−	−	$+$	−	−	$+$	$+$
Giorgetti et al. [29]	−	$+$	−	$+$	$+$	−	−	−	−	−	−	$+$	$+$	−
Guedrez et al. [17]	−	$+$	−	$+$	$+$	−	$+$	−	−	$+$	−	$+$	−	−
Huang et al. [30]	−	$+$	−	$+$	$+$	−	−	$+$	$+$	$+$	−	$+$	−	$+$

Abstract

Cited By

Figures (9)

Tables (2)

Journal of Optical Communications and Networking