Cost-Effective Server Placement and Network Slice Provisioning for Virtual Power Plants

Page view(s)
5
Checked on Jul 08, 2024
Cost-Effective Server Placement and Network Slice Provisioning for Virtual Power Plants
Title:
Cost-Effective Server Placement and Network Slice Provisioning for Virtual Power Plants
Journal Title:
IEEE Global Communications Conference
DOI:
Keywords:
Publication Date:
08 December 2023
Citation:
V. Sridharan, E. Kurniawan, S. Sun and A. Boonkajay, & Cost-Effective Server Placement and Network Slice Provisioning for Virtual Power Plants, 2023, IEEE Global Communications Conference (Globecom), Kuala Lumpur, Malaysia, 2023.
Abstract:
Effective communication service for a Virtual Power Plant (VPP) is a major challenge as a VPP has very stringent latency and reliability requirements for communication with the Distributed Energy Resources (DERs). Network slicing is a promising solution to this challenge as network slices can be customized and provisioned to satisfy the requirements of the VPP's communication traffic. While determining the resources required for the network slice, it is important to consider the location of the VPP server and the paths along which the traffic is routed as significant latency can be experienced if the DERs are spread across a large area. The server's placement and traffic paths chosen can also impact the cost incurred as it would impact the required bandwidth on the links. We formulate a VPP Server Placement and Provisioning Problem that determines i) placement of VPP server, ii) paths for traffic distribution and iii) required bandwidth on each link in a wide area network connecting the DERs and the server while satisfying latency constraints and minimizing cost of reserving bandwidth on the links. We develop a heuristic algorithm for the formulation to obtain an effective solution in reasonable time. We also present a modified, convex version of the formulation under certain constraints through which an optimal solution can be obtained. We demonstrate the performance of our heuristic algorithm by comparing it with the optimal solution for the convex problem and another heuristic approach.
License type:
Publisher Copyright
Funding Info:
This research / project is supported by the National Research Foundation - Industry Alignment Fund (Pre-Positioning) (IAF-PP)
Grant Reference no. : NA
Description:
© 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
ISSN:
0895-1195
Files uploaded:

File Size Format Action
m11386-sridharan-final.pdf 387.79 KB PDF Request a copy