Dynamic frequency slot allocation on IP-over-EON access links with multiple-type and time-varying traffic

Junyi Shao; Shuai Zhang; Weiqiang Sun; Weisheng Hu

doi:10.1364/JOCN.481355

Journal of Optical Communications and Networking
Vol. 15,
Issue 6,
pp. 304-317
(2023)
•https://doi.org/10.1364/JOCN.481355

Dynamic frequency slot allocation on IP-over-EON access links with multiple-type and time-varying traffic

Junyi Shao, Shuai Zhang, Weiqiang Sun, and Weisheng Hu

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Junyi Shao, Shuai Zhang, Weiqiang Sun, and Weisheng Hu, "Dynamic frequency slot allocation on IP-over-EON access links with multiple-type and time-varying traffic," J. Opt. Commun. Netw. 15, 304-317 (2023)

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

Abstract

Access links that connect client networks to public networks have to carry multiple-type and time-varying traffic. Those hybrid traffic flows compete for limited bandwidth, yet at the same time have drastically different performance requirements. As planning the link capacity for peak traffic demand is not economically viable, it is important that bandwidth on the access links is shared between different traffic classes in a way that maximal network utility can be achieved. In this paper, we study the frequency slot allocation problem on IP-over-elastic optical network (EON) access links that carry three types of traffic, namely, packet streams, latency critical circuit connections (e.g., video conferencing), and delay tolerant circuit connections (e.g., bulk data transfers). We define four network operation states; in each of which an access link serves traffic with different levels of fulfillment. We then formulate the allocation problem into a weak-constrained optimization problem and propose a genetic algorithm to solve it in real time. Numerical results show that the relative error of the genetic algorithm is within 3% and the access link keeps maintaining the optimal achievable network operation state. We also show that, by increasing the storage size, the access link can adapt to the increasing traffic load within a certain range without upgrading the expensive access link bandwidth. Our study provides useful insights in managing and operating IP-over-EON access links, and the concept of multiple network operation states can be generalized to networks that serve more than one type of traffic.

Full Article | PDF Article

More Like This

Dimensioning access link capacity for time-varying traffic with mixed packet streams and circuit connections

Junyi Shao, Shuai Zhang, Weiqiang Sun, and Weisheng Hu
J. Opt. Commun. Netw. 13(11) 276-288 (2021)

Dynamic resource allocation for multicast in SDM-EON: time-decoupled dynamic path cross talk and joint weight

Yudong Ma, Xin Yang, Qiang Sun, and Yue Zhao
J. Opt. Commun. Netw. 15(9) 687-699 (2023)

On the Cross-Layer Orchestration to Address IP Router Outages With Cost-Efficient Multilayer Restoration in IP-Over-EONs

Siqi Liu, Wei Lu, and Zuqing Zhu
J. Opt. Commun. Netw. 10(1) A122-A132 (2018)

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

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

Equations (29)

You do not have subscription access to this journal. Equations 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

Category	Symbol	Definition
Traffic	$λ_{t}$	Time-varying traffic arrival rate of multi-type flows
	$Λ_{t} / σ_{t}$	Mean value/standard deviation of $λ_{t}$
	$λ_{L C} (t) / λ_{D T} (t) / λ_{p a c k e t} (t)$	Traffic arrival rate of LC flows/DT flows/packet streams
	${s i z e}_{c i r c u i t} / {s i z e}_{p a c k e t}$	Average size of circuit connections/packet streams in bytes
	$μ_{L C} / μ_{D T}$	Service rate for LC flows/DT flows
Resource	$B a n d$	Total bandwidth of the access link
	$f$	Spectrum width of each FS
	$η$	Number of modulated bits per symbol
	$C$	Total amount of FSs on the access link
	$C_{L C} (t) / C_{D T} (t) / C_{p a c k e t}$	Amount of FSs allocated to LC flows/DT flows/packet streams
	$C_{s h a r e} (t)$	Amount of preemptable FSs by LC flows
	$C_{s t o r a g e}$	Storage size
	$Δ_{C_{L C}} (t) / Δ_{C_{D T}} (t) / Δ_{C_{s h a r e}} (t)$	Difference percentage of resource allocation parameters between adjacent time slots
	$N$	Average amount of FSs required by each light path
	$k_{L C}$ , $k_{D T}$	Number of LC flows or DT flows in transmission system, also can be regarded as the state of the corresponding queuing system
	$p (k_{L C})$ , $p (k_{D T})$	Probability of state $k_{L C}$ in the M/M/C/C (for LC flows) and state $k_{D T}$ in the M/M/C/K (for DT flows) queueing systems
QoS	${f_{b l o c k}}_{L C} (t) / {f_{b l o c k}}_{D T} (t)$	Blocking probability function for LC flows/DT flows
	$f_{d e l a y} (t)$	Average delay performance function for packet streams
	$f_{{s t o r e}_{D T}} (t)$	Probability function for DT flows kept in storage
	${f_{p r e e m}}_{L C} (t)$	Preemption probability function from LC flows
Others	$L$	Length of packet streams in the random early detection (RED) cache queue
	$L_{max} / L_{min}$	Maximal/minimal queue threshold in RED
	$p_{s i z e}$	Packet size in bytes
	$p_{l o s t}$	Packet losing rate of packet streams
	$t_{t r a n s}$	Transmission delay
	${t h r o u g h p u t}_{p a c k e t}$	Throughput of packet streams
	${u t i l i z a t i o n}_{p a c k e t}$	Bandwidth utilization of packet streams
	${d e l a y}_{k_{L C}}$	Delay performance function for packet streams
	$p r e e m max$	Maximum preemption probability acceptable for the access link
	$d e l a y max$	Maximum delay performance acceptable for packet streams
	$b l o c k max$	Maximum blocking probability acceptable for circuit connections
	$Δ_{max}$	Maximum acceptable difference percentage of resource allocation parameters between adjacent time slots
	$b_{L C} (t) / b_{D T} (t) / b_{p a c k e t} (t)$	Binary variable, equals 1 if corresponding QoS requirement is met
	$C_{L C}^{^{'}} (t) / C_{D T}^{^{'}} (t) / C_{s h a r e}^{^{'}} (t)$	Results obtained from the genetic algorithm
	$δ_{L C} / δ_{D T} / δ_{p a c k e t}$	Daily relative errors of resource allocated to LC flows/DT flows/packet streams
	${T P}_{A F} / {T P}_{M F} / {T P}_{P F} / {T P}_{N F}$	Time proportion of each network operation state in a day
	${T H}_{AF-MF} / {T H}_{MF-PF} / {T H}_{PF-NF}$	Traffic load threshold of network operation state transitions
	$T_{s l o t}$	The length of each time slot

Network Operation State	Definition
All fulfilled (AF)	QoS requirements from LC flows, packet streams and DT flows are satisfied: $f_{{b l o c k}_{L C}} (t) \leq b l o c k max$ $f_{d e l a y} (t) \leq d e l a y max$ $f_{{b l o c k}_{D T}} (t) \leq b l o c k max$
Mostly fulfilled (MF)	QoS requirements from LC flows and packet streams are satisfied: $f_{{b l o c k}_{L C}} (t) \leq b l o c k max$ $f_{d e l a y} (t) \leq d e l a y max$ $f_{{b l o c k}_{D T}} (t) > b l o c k max$
Partially fulfilled (PF)	Only the QoS requirement from LC flows is satisfied: $f_{{b l o c k}_{L C}} (t) \leq b l o c k max$ $f_{d e l a y} (t) > d e l a y max$ $f_{{b l o c k}_{D T}} (t) > b l o c k max$
None fulfilled (NF)	No QoS requirements are able to be satisfied: $f_{{b l o c k}_{L C}} (t) > b l o c k max$ $f_{d e l a y} (t) > d e l a y max$ $f_{{b l o c k}_{D T}} (t) > b l o c k max$

Optimization Objective	(14) $min f_{d e l a y} (t)$
Strong constraints	(15) $C_{L C} (t) + C_{s h a r e} (t) + C_{D T} (t) + C_{p a c k e t} = C$
	(16) $0 < C_{L C} (t), C_{s h a r e} (t), C_{D T} (t) < C - C_{p a c k e t}$
	(17) $Δ_{C_{L C}} (t), Δ_{C_{s h a r e}} (t), Δ_{C_{D T}} (t) \leq Δ_{max}$
	(18) $b_{L C} (t) \geq b_{p a c k e t} (t) \geq b_{D T} (t)$
	(19) $f_{{p r e e m}_{L C}} (t) \leq p r e e m max$
Weak constraints	(20) ${f_{b l o c k}}_{L C} (t) \leq b l o c k max$
	(21) $f_{d e l a y} (t) \leq d e l a y max$
	(22) ${f_{b l o c k}}_{D T} (t) \leq b l o c k max$

Category	Symbol	Definition
Traffic	$λ_{t}$	Time-varying traffic arrival rate of multi-type flows
	$Λ_{t} / σ_{t}$	Mean value/standard deviation of $λ_{t}$
	$λ_{L C} (t) / λ_{D T} (t) / λ_{p a c k e t} (t)$	Traffic arrival rate of LC flows/DT flows/packet streams
	${s i z e}_{c i r c u i t} / {s i z e}_{p a c k e t}$	Average size of circuit connections/packet streams in bytes
	$μ_{L C} / μ_{D T}$	Service rate for LC flows/DT flows
Resource	$B a n d$	Total bandwidth of the access link
	$f$	Spectrum width of each FS
	$η$	Number of modulated bits per symbol
	$C$	Total amount of FSs on the access link
	$C_{L C} (t) / C_{D T} (t) / C_{p a c k e t}$	Amount of FSs allocated to LC flows/DT flows/packet streams
	$C_{s h a r e} (t)$	Amount of preemptable FSs by LC flows
	$C_{s t o r a g e}$	Storage size
	$Δ_{C_{L C}} (t) / Δ_{C_{D T}} (t) / Δ_{C_{s h a r e}} (t)$	Difference percentage of resource allocation parameters between adjacent time slots
	$N$	Average amount of FSs required by each light path
	$k_{L C}$ , $k_{D T}$	Number of LC flows or DT flows in transmission system, also can be regarded as the state of the corresponding queuing system
	$p (k_{L C})$ , $p (k_{D T})$	Probability of state $k_{L C}$ in the M/M/C/C (for LC flows) and state $k_{D T}$ in the M/M/C/K (for DT flows) queueing systems
QoS	${f_{b l o c k}}_{L C} (t) / {f_{b l o c k}}_{D T} (t)$	Blocking probability function for LC flows/DT flows
	$f_{d e l a y} (t)$	Average delay performance function for packet streams
	$f_{{s t o r e}_{D T}} (t)$	Probability function for DT flows kept in storage
	${f_{p r e e m}}_{L C} (t)$	Preemption probability function from LC flows
Others	$L$	Length of packet streams in the random early detection (RED) cache queue
	$L_{max} / L_{min}$	Maximal/minimal queue threshold in RED
	$p_{s i z e}$	Packet size in bytes
	$p_{l o s t}$	Packet losing rate of packet streams
	$t_{t r a n s}$	Transmission delay
	${t h r o u g h p u t}_{p a c k e t}$	Throughput of packet streams
	${u t i l i z a t i o n}_{p a c k e t}$	Bandwidth utilization of packet streams
	${d e l a y}_{k_{L C}}$	Delay performance function for packet streams
	$p r e e m max$	Maximum preemption probability acceptable for the access link
	$d e l a y max$	Maximum delay performance acceptable for packet streams
	$b l o c k max$	Maximum blocking probability acceptable for circuit connections
	$Δ_{max}$	Maximum acceptable difference percentage of resource allocation parameters between adjacent time slots
	$b_{L C} (t) / b_{D T} (t) / b_{p a c k e t} (t)$	Binary variable, equals 1 if corresponding QoS requirement is met
	$C_{L C}^{^{'}} (t) / C_{D T}^{^{'}} (t) / C_{s h a r e}^{^{'}} (t)$	Results obtained from the genetic algorithm
	$δ_{L C} / δ_{D T} / δ_{p a c k e t}$	Daily relative errors of resource allocated to LC flows/DT flows/packet streams
	${T P}_{A F} / {T P}_{M F} / {T P}_{P F} / {T P}_{N F}$	Time proportion of each network operation state in a day
	${T H}_{AF-MF} / {T H}_{MF-PF} / {T H}_{PF-NF}$	Traffic load threshold of network operation state transitions
	$T_{s l o t}$	The length of each time slot

Network Operation State	Definition
All fulfilled (AF)	QoS requirements from LC flows, packet streams and DT flows are satisfied: $f_{{b l o c k}_{L C}} (t) \leq b l o c k max$ $f_{d e l a y} (t) \leq d e l a y max$ $f_{{b l o c k}_{D T}} (t) \leq b l o c k max$
Mostly fulfilled (MF)	QoS requirements from LC flows and packet streams are satisfied: $f_{{b l o c k}_{L C}} (t) \leq b l o c k max$ $f_{d e l a y} (t) \leq d e l a y max$ $f_{{b l o c k}_{D T}} (t) > b l o c k max$
Partially fulfilled (PF)	Only the QoS requirement from LC flows is satisfied: $f_{{b l o c k}_{L C}} (t) \leq b l o c k max$ $f_{d e l a y} (t) > d e l a y max$ $f_{{b l o c k}_{D T}} (t) > b l o c k max$
None fulfilled (NF)	No QoS requirements are able to be satisfied: $f_{{b l o c k}_{L C}} (t) > b l o c k max$ $f_{d e l a y} (t) > d e l a y max$ $f_{{b l o c k}_{D T}} (t) > b l o c k max$

Abstract

Cited By

Figures (9)

Tables (3)

Equations (29)

Journal of Optical Communications and Networking