1,403 Hits in 6.6 sec

An Approximation Algorithm for Path Computation and Function Placement in SDNs [article]

Guy Even and Matthias Rost and Stefan Schmid
2016 arXiv   pre-print
Our main result is a randomized approximation algorithm for path computation and function placement with the following guarantee.  ...  We consider the task of computing (combined) function mapping and routing for requests in Software-Defined Networks (SDNs).  ...  In this paper we focus on an algorithmic problem that the network manager needs to solve in an NFV/SDN setting. This problem is called path computation and function placing.  ... 
arXiv:1603.09158v1 fatcat:rf5f2rvgnjemfcyh6oekmopvgy

Controller Placement in SDN-enabled 5G Satellite-Terrestrial Networks [article]

Nariman Torkzaban, John S. Baras
2021 arXiv   pre-print
In this paper, we formulate an optimization problem for the SDN controller placement with the objective of minimizing the average failure probability of SDN control paths to ensure the SDN switches receive  ...  In this regard, the SDN controller placement problem in SDN-enabled ISTNs becomes of paramount importance.  ...  In all the topologies the lengths of the links that are used in the shortest path algorithm are extracted and computed from [7] .  ... 
arXiv:2108.09176v1 fatcat:berivzlsevc3bibhua2ojatxke

Joint Satellite Gateway Deployment Controller Placement in Software-Defined 5G-Satellite Integrated Networks [article]

Nariman Torkzaban, John S. Baras
2021 arXiv   pre-print
Moreover, with the increasing interest in the software-defined integration of 5G networks and satellites, the existence of an effective scheme for optimal placement of SDN controllers is essential.  ...  We then show that the resulting problems can be modeled as the optimization of submodular set functions and can be solved efficiently with provable optimality gaps.  ...  With such an approach, the authors in [23] have previously used the algorithm mentioned in theorem 3, for SDN controller placement at edge.  ... 
arXiv:2103.08735v2 fatcat:5xrcsuak3zfjpkve46hrsppdfq

Centralized approaches for virtual network function placement in SDN-enabled networks

Akshay Gadre, Anix Anbiah, Krishna M. Sivalingam
2018 EURASIP Journal on Wireless Communications and Networking  
The network function placement (NFP) problem involves placing VNFs to satisfy the service function chaining (SFC) requests of the flows in the network.  ...  A combination of this divide-and-conquer solution with a modified version of Dijkstra's algorithm is used to solve the problem for dynamic requests.  ...  Acknowledgements The authors would like to acknowledge their fellow researchers at the DonLab Research Group of the Department of Computer Science and Engineering, IIT Madras for their valuable input and  ... 
doi:10.1186/s13638-018-1216-0 fatcat:pjqnb3votjhd7fxrxeqeo6vumq

Efficient Placement of Service Function Chains in Cloud Computing Environments

Marwa A. Abdelaal, Gamal A. Ebrahim, Wagdy R. Anis
2021 Electronics  
In this paper, a novel approach for the VNF placement problem for SFCs, called virtual network functions and their replica placement (VNFRP), is introduced.  ...  Hence, the VNF placement problem is first formulated as an integer linear programming (ILP) optimization problem, aiming to minimize link bandwidth consumption, energy consumption, and SFC placement cost  ...  Another algorithm that approximately solved VNF placement problem was presented in [38] . However, it took only one network function into account while ignoring the chaining of service functions.  ... 
doi:10.3390/electronics10030323 fatcat:eyp6bqsumjd53p4a3l7g3gecx4

A Survey of Controller Placement Problem in Software Defined Networks [article]

Abha Kumari, Ashok Singh Sairam
2019 arXiv   pre-print
Distributed SDN along with its benefits brings along the problem of the number of controllers required and their placement in the network.  ...  Finally, we point out the existing literature gap and discuss the future research direction in this domain.  ...  The algorithm computes a parameter to select candidate nodes which is a function of node connectivity and path weight.  ... 
arXiv:1905.04649v1 fatcat:cqu3jm5ct5fdlmrv5zeicdhmie

Efficient NFV-Enabled Multicasting in SDNs

Zichuan Xu, Weifa Liang, Meitian Huang, Mike Jia, Song Guo, Alex Galis
2019 IEEE Transactions on Communications  
We then devise two approximation algorithms with an approximation ratio of 2M for the NFV-enabled multicasting problems with and without resource capacity constraints, if the number of servers for implementing  ...  heuristic, and for a special case of dynamic request admissions, we devise an online algorithm with a competitive ratio of O(log n) for it when M = 1, where n is the number of nodes in the network.  ...  ACKNOWLEDGEMENTS We would like to thank the three anonymous referees and the associate editor for their expertise comments and constructive suggestions, which have helped us improve the quality and presentation  ... 
doi:10.1109/tcomm.2018.2881438 fatcat:fwl4sqlcdzg3rac2d5bfwqjf5y

Partition-Based Joint Placement of Gateway and Controller in SDN-Enabled Integrated Satellite-Terrestrial Networks

Kongzhe Yang, Bangning Zhang, Daoxing Guo
2019 Sensors  
In this paper, a network partition algorithm, Simulated Annealing Partition-based K-means (SAPKM), is proposed and analyzed for further ameliorating the problem.  ...  Therein, the joint gateway and controller placement problem is of fundamental significance for designing ISTNs with flexible and efficient management capabilities.  ...  Acknowledgments: The authors would like to extend their gratitude to the anonymous reviewers for their valuable and constructive comments, which have largely improved and clarified this paper.  ... 
doi:10.3390/s19122774 fatcat:oxakxjsoejbuzprigkw4lvzlvu

It's a Match!

Tamás Lukovszki, Matthias Rost, Stefan Schmid
2016 Computer communication review  
The algorithm is based on optimizing over a submodular function which can be computed efficiently using a fast augmenting path approach.  ...  The virtualization and softwarization of modern computer networks offers new opportunities for the simplified management and flexible placement of middleboxes as e.g. firewalls and proxies.  ...  For each p, the set of such middlebox nodes can be computed in a pre-processing step by performing an allpairs shortest paths algorithm to compute d(u, v) for each u, v in the network, and for each p =  ... 
doi:10.1145/2875951.2875956 fatcat:awkkssxmajhxtbvfcpsbag7elm

Approximation and Online Algorithms for NFV-Enabled Multicasting in SDNs

Zichuan Xu, Weifa Liang, Meitian Huang, Mike Jia, Song Guo, Alex Galis
2017 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)  
We then devise the very first approximation algorithm with an approximation ratio of 2K for the NFV-enabled multicasting problem if the number of servers for implementing the network functions of each  ...  Multicasting is a fundamental functionality of networks for many applications, including online conferencing, event monitoring, video streaming, and system monitoring in data centers.  ...  ACKNOWLEDGEMENTS The work by Zichuan Xu and Alex Galis is partially supported by the H2020 projects of SONATA ( and 5GEx (https://5gex.tmit.bme.bu).  ... 
doi:10.1109/icdcs.2017.43 dblp:conf/icdcs/XuLHJGG17 fatcat:mvoxpvr3wngufdy4bcntlqvxau

On reliability-optimized controller placement for Software-Defined Networks

Yannan Hu, Wendong Wang, Xiangyang Gong, Xirong Que, Shiduan Cheng
2014 China Communications  
After presenting a metric to characterize the reliability of SDN control networks, several placement algorithms are developed.  ...  This paper addresses the problem of placing controllers in SDNs, so as to maximize the reliability of control networks.  ...  Therefore, some approximation algorithms must be used for a sub-optimal solution.  ... 
doi:10.1109/cc.2014.6821736 fatcat:ezsp532ldrf7to7m6bylorv4jy

Comprehensive Review of SDN Controller Placement Strategies

Bassey Isong, Reo Molose, Adnan M. Abu-Mahfouz, Nosipho Dladlu
2020 IEEE Access  
It employed a clustering algorithm for optimal placement for the shortest-path and a greedy algorithm for multi-paths between controller and switches for sub-optimal placement.  ...  CPP was formulated as an ILP problem to search for optimal placement that minimizes the reaction time or delays apparently at the switches and also proposed an approximate algorithm is to solve it.  ... 
doi:10.1109/access.2020.3023974 fatcat:73esdrjiobbfdc2tnfqdzn5ef4

Optimising resource allocation for virtual network functions in SDN/NFV‐enabled MEC networks

Nahida Kiran, Xuanlin Liu, Sihua Wang, Changchuan Yin
2021 IET Communications  
Network function virtualisation (NFV), software defined networks (SDNs), and mobile edge computing (MEC) are emerging as core technologies to satisfy increasing number of users' demands in 5G and beyond  ...  SDN provides clean separation of the control plane from the data plane while NFV enables the flexible and on-the-fly creation and placement of virtual network functions (VNFs) and are able to be executed  ...  This paper proposes an SDN/NFV-enabled MEC model for optimal virtual network function placement and resource allocation (VNFPRA) with the goal to minimise both the overall deployment cost and resource  ... 
doi:10.1049/cmu2.12183 fatcat:fixfqjfn5ff6fom6cqsrp45scm

A Survey of Controller Placement Problem in Software-Defined Networking

Jie Lu, Zhen Zhang, Tao Hu, Peng Yi, Julong Lan
2019 IEEE Access  
With the deployment and the applications of SDN, researchers have found that the controller placement directly affects network performance in SDN.  ...  Then, we classify this paper of controller placement problem into four aspects (latency, reliability, and cost and multi-objective) depending on their objective and analyze specific algorithms in different  ...  [46] proposes the clustering based global optimization algorithm for shortest path and the local optimization algorithm based on greedy algorithm for multi-paths.  ... 
doi:10.1109/access.2019.2893283 fatcat:mtbtj64tj5fhjfaxzqp3wdedcq

Load-balanced Service Function Chaining in Edge Computing over FiWi Access Networks for Internet of Things [article]

Jing Liu, Guochu Shou, Qingtian Wang, Yaqiong Liu, Yihong Hu, Zhigang Guo
2020 arXiv   pre-print
and computing for chaining VNFs.  ...  We also propose two approximation optimal deployment algorithms named Greedy-Bisection Multi-Path (GBMP) and KSP MultiPath (KSMP) taking advantage of the multi-instance virtual network functions (VNFs)  ...  The orchestration and management layer is responsible for the SFC orchestration, including several functional modules for VNF placement, selecting forwarding paths, scheduling the network, computing and  ... 
arXiv:2006.08134v1 fatcat:mcdlvear3vewtca24dxkp3g6ti
« Previous Showing results 1 — 15 out of 1,403 results