Fault-tolerant resource allocation model for service function chains with joint diversity and redundancy

Kang, Rui; He, Fujun; Oki, Eiji

doi:10.1016/j.comnet.2022.109287

Cited by 6 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Set of imaginary links a lot of studies formulated the SFC problem as an ILP and proposed heuristic algorithms [31][32][33][34][35]. In the context of mathematical optimization, the VNE (resp.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Mixed Integer Linear Programming Formulation and Heuristics for Delay-Aware Neural Network Placement Problem in In-Network Learning

Hara

2024

Preprint

View full text Add to dashboard Cite

In-network learning (INL), which is one of the distributed machine learning (ML), enables both learning and inference over a network by deploying small models representing parts of the global neural network (NN) model on the network. The inference and learning speed of INL model depends on the computation and communication cost. Therefore, the small NN models should be properly deployed on the physical network to meet the service requirements. In other words, INL involves an NN placement problem to aim at minimizing the maximum end-to-end delay. In this paper, we formulate this NN placement problem as a mixed integer linear program (MILP) and develop a heuristic algorithm to overcome its computational complexity. Through the numerical experiments, the proposed MILP works well up to 400 physical nodes. However, the MILP cannot output the optimal solution in case of more than 400 physical nodes, due to the time limit or the out of memory. The proposed heuristic algorithm can provide the feasible solution with a shorter computation time against the physical network size at the sacrifice of the solution optimality, compared with the MILP.

show abstract

Section: Related Workmentioning

confidence: 99%

“…These procedures correspond to the constraints ( 13) and ( 14 means the last physical node in the kth subpath r k on which the NN subset m is deployed. After that, the algorithm assigns one to the binary decision variables x n,m u,v along the path r k (lines [34][35][36][37].…”

Section: Greedy Heuristic Algorithm Based On Path Tour Searchmentioning

confidence: 99%

A Mixed Integer Linear Programming Formulation and Heuristics for Delay-Aware Neural Network Placement Problem in In-Network Learning

Hara

2024

Preprint

View full text Add to dashboard Cite

show abstract

Dependability of Network Services in the Context of NFV: A Taxonomy and State of the Art Classification

Azadiabad,

Khendek

2024

J Netw Syst Manage

View full text Add to dashboard Cite

Robust function deployment against uncertain recovery time in different protection types with workload-dependent failure probability

Zhu

Oki

2023

Computer Networks

View full text Add to dashboard Cite

Fault-tolerant resource allocation model for service function chains with joint diversity and redundancy

Cited by 6 publications

References 18 publications

A Mixed Integer Linear Programming Formulation and Heuristics for Delay-Aware Neural Network Placement Problem in In-Network Learning

A Mixed Integer Linear Programming Formulation and Heuristics for Delay-Aware Neural Network Placement Problem in In-Network Learning

Dependability of Network Services in the Context of NFV: A Taxonomy and State of the Art Classification

Robust function deployment against uncertain recovery time in different protection types with workload-dependent failure probability

Contact Info

Product

Resources

About