@inproceedings{tsipis2024employing,

title = {Employing Immersive Technologies and Digital Museology for Successful Cultural Heritage Promotion: Experience Gained from Previous Cultural Projects and the Case of the v-Corfu Project},

author = {Athanasios Tsipis and Katerina Kontopanagou and Sofia Fanarioti and Vasileios Komianos},

year  = {2024},

date = {2024-04-17},

urldate = {2024-04-17},

booktitle = {5th CAA-GR Conference 2024 Transforming Heritage Research in a Transforming World},

keywords = {},

pubstate = {forthcoming},

tppubtype = {inproceedings}

}

@inproceedings{tsipis2024alternative,

title = {Εναλλακτικές Πραγματικότητες και Ψηφιακές Εφαρμογές για την Ανάδειξη Αρχιτεκτονικής Κληρονομιάς: Η Περίπτωση της Κέρκυρας και του Έργου v-Corfu},

author = {Athanasios Tsipis and Sofia Fanarioti and Katerina Kontopanagou and Vasileios Komianos},

year  = {2024},

date = {2024-03-09},

urldate = {2024-03-09},

booktitle = {5ο Πανελλήνιο Συνέδριο Ψηφιοποίησης Πολιτιστικής Κληρονομιάς (EuroMed 2023)},

pages = {1-12},

abstract = {Οι εμβυθιστικές τεχνολογίες έχουν αναδυθεί ως καινοτόμες προτάσεις για την ανάδειξη του υλικού ή μη υφιστάμενου πολιτισμικού κεφαλαίου ενός τόπου. Παράλληλα, παρατηρείται ότι νέες και πρωτότυπες μέθοδοι παρουσίασης της αρχιτεκτονικής κληρονομιάς προσελκύουν σταθερά το κοινό, νέο ή παλιό. Υπό το πρίσμα αυτό, η αναπαράσταση πολιτιστικών αντικειμένων και κτηρίων μέσω ψηφιακών τριδιάστατων (3Δ) μοντέλων, πλαισιωμένα από καθηλωτικές εμπειρίες και διαδραστικά εικονικά περιβάλλοντα, επιτρέπει τη δημιουργία νέων μονοπατιών γνώσης, τροφοδοτώντας την εμπεριστατωμένη κατανόηση και ενεργό συμμετοχή του χρήστη στη διαδικασία προώθησης και ανάδειξής τους. Στην παρούσα εργασία μελετάται η χρήση εναλλακτικών πραγματικοτήτων (εικονική, επαυξημένη, εκτεταμένη, κτλ.) για την ενημέρωση του κοινού σχετικά με την αρχιτεκτονική κληρονομιά, λαμβάνοντας υπόψη την περίπτωση της Κέρκυρας και το έργο με τίτλο «Εικονικός Εκθεσιακός Χώρος Κέρκυρας στους Τομείς Πολιτισμού, Τουρισμού και Περιβάλλοντος» (v-Corfu). Το έργο ακολουθεί μία πολύπλευρη προσέγγιση για την αλληλεπίδραση με το ψηφιακό περιεχόμενο που επιτρέπει στους εικονικούς επισκέπτες να περιηγηθούν και να έρθουν σε επαφή με τα εικονικά εκθέματα όπως θα έκαναν σε έναν πραγματικό εκθεσιακό χώρο ή μουσείο. Συνδυάζοντας διαφορετικές εμβυθιστικές τεχνολογίες, το v-Corfu τοποθετεί τα 3Δ αρχιτεκτονικά μνημεία στο επίκεντρο της εικονικής έκθεσης, καθιστώντας το ευρύ κοινό κοινωνό της γνώσης αυτής. Συμπληρωματικές εφαρμογές, όπως ψηφιακά μίνι παιχνίδια, και πλούσιο πληροφοριακό και πολυμεσικό περιεχόμενο επεκτείνουν την εμπειρία προσφέροντας ευκαιρίες για ψυχαγωγία και μάθηση.},

keywords = {},

pubstate = {forthcoming},

tppubtype = {inproceedings}

}

@inproceedings{10167963,

title = {Load Balancing of Virtual Network Functions through Packet Delegation},

author = {Alexandros Zervopoulos and Konstantinos Oikonomou},

doi = {10.1109/BalkanCom58402.2023.10167963},

year  = {2023},

date = {2023-01-01},

urldate = {2023-01-01},

booktitle = {2023 International Balkan Conference on Communications and Networking (BalkanCom)},

pages = {1-6},

abstract = {Network Function Virtualization is a promising technology that can provide complex packet processing capabilities through Virtual Network Function (VNF) chains. Service Function Chaining aims to facilitate the management of these chains, typically through centralized management and orchestration, which perform inadequately when operating under heavy load, as they require the exchange of a significant amount of packets and they often optimize for network-wide metrics, potentially providing subpar performance to a few individuals. To address these shortcomings, a packet delegation mechanism is proposed in this paper, which can be integrated into the lifecycle managers of VNFs and serves as a load sharing mechanism redirecting traffic from VNFs under heavy load to other servers. Additionally, the prioritization of delegated packets is proposed to reduce the delay overhead that is introduced by the additional hops that delegated packets may need to traverse. The packet delegation mechanism is analytically studied under certain assumptions using queueing theory and its performance is evaluated through experimentation in a simulation setting. The acquired results validate the analysis, which indicates that packet delegation can effectively redirect traffic from overburdened VNFs and reduce end-to-end delay, while utilizing purely local information.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{9937029,

title = {On Utilizing Unused Slots In Topology-Transparent TDMA MAC Policies for Ad Hoc Networks},

author = {Vasileios Dragonas and Dimitrios Kallergis and Georgios Tsoumanis and Konstantinos Oikonomou},

doi = {10.1109/GIIS56506.2022.9937029},

year  = {2022},

date = {2022-01-01},

urldate = {2022-01-01},

booktitle = {2022 Global Information Infrastructure and Networking Symposium (GIIS)},

pages = {57-61},

abstract = {In the age of the Internet of Things, numerous devices of diverse characteristics are communicating with each other. The underlying networks supporting those communications can either use some sort of infrastructure or implement an ad hoc network. For the latter type of networks and depending on the application requirements, Topology-Transparent TDMA MAC policies can be considered as they are inherently suited for dynamic and unstructured topologies. However, such TDMA-based schemes may suffer from low throughput performance, especially in sparse networks, where a significant portion of available time slots remains unused. To address this challenge, a Topology-Transparent TDMA MAC policy is revisited in this paper, which utilizes unused slots by allowing nodes to transmit in them under a common and fixed probability p . Additionally, an improvement is proposed, where every node can calculate its own individual access probability based on information gathered from its local neighborhood. Simulation results demonstrate that the use of the individual access probability leads to improved performance in terms of system throughput. Moreover, the requirement for assigning a value to probability p during the network initialization is relaxed, as this value is now calculated dynamically and distributively during the network operation.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{9912838,

title = {A Spectrum Analysis Approach for the Median Problem in Modern Network Environments},

author = {Konstantinos Oikonomou},

doi = {10.1109/ISCC55528.2022.9912838},

year  = {2022},

date = {2022-01-01},

urldate = {2022-01-01},

booktitle = {2022 IEEE Symposium on Computers and Communications (ISCC)},

pages = {1-6},

abstract = {Service facility location is a challenging problem in the emerging dynamic modern network environments of increased number of users, devices, and supported applications. Under this perspective, the median problem is revisited here from a spectrum analysis point of view. More specifically, a median matrix depending on the network topology and the traffic requirements of the network nodes is introduced and studied in this paper. An analytical investigation of its spectral properties reveals that the minimum elements of its principal eigenvector correspond to the solution of the median problem. The smallest eigenvalue is also studied through simulations to demonstrate the effectiveness of the spectrum analysis approach introduced in this paper. Moreover, its relation to a metric related to the robustness of the median solution is investigated, thus shedding further light on the particulars of facility location problems.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{9936934,

title = {A Study on Robustness for the Single Server Location in Distributed Interactive Applications},

author = {Athanasios Tsipis and Sofia Fanarioti and Vasileios Komianos and Spyros Sioutas and Konstantinos Oikonomou},

doi = {10.1109/GIIS56506.2022.9936934},

year  = {2022},

date = {2022-01-01},

urldate = {2022-01-01},

booktitle = {2022 Global Information Infrastructure and Networking Symposium (GIIS)},

pages = {68-72},

abstract = {In distributed interactive application ecosystems, service provision and availability are key factors for the end user's perceived quality. Therefore, the location of any server facility is important from the provider's standpoint for efficient capital expenditure. Given the dynamicity of such environments (e.g., due to traffic load variance over time), modeling this challenge as a median problem may require the continuous calculation of the optimal location. To address this robustness issue, a new robustness metric is introduced here for the case of the single server in edge computing, which depends on the overall delay experienced by the data traffic. Moreover, the smallest eigenvalue of the median matrix is considered as an alternative means for measuring this robustness. Using trace-driven simulation results, it is demonstrated that there is indeed a relationship between the proposed robustness metric and the smallest eigenvalue for the under consideration environment.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{9904397,

title = {Fairness-Oriented Edge Allocation for Interactive Group Gaming in Edge Computing},

author = {Athanasios Tsipis and Vasileios Komianos and Konstantinos Oikonomou},

doi = {10.1109/IISA56318.2022.9904397},

year  = {2022},

date = {2022-01-01},

urldate = {2022-01-01},

booktitle = {2022 13th International Conference on Information, Intelligence, Systems & Applications (IISA)},

pages = {1-8},

abstract = {In recent years, edge computing has emerged as a highly promising paradigm for the extension of cloud multimedia systems, enabling network latency reduction by pushing services and data from remote clouds to edge servers. For immersive distributed interactive applications, such as virtual reality and multiplayer online games, this shift has revolutionized the way nearby mobile users interact with one another to jointly participate in collaborative virtual events. However, because the virtual world is shared among many users, one fundamental decision problem for the game providers relates to: (i) how the servers will be deployed, given the limited budget in edge infrastructure investment; and, subsequently, (ii) in what manner the users will be assigned to maintain group fairness across all participating parties, given the lag variance in game view consistency. In this paper, we call this the “Fairness-oriented Edge Allocation” (FEA) problem, and formally formulate its properties and discuss its complexity. To provide solutions efficiently, we present a heuristic algorithm, namely the h-FEA, and theoretically analyze its time complexity. We, then, evaluate h-FEA against several benchmark alternatives using comprehensive simulations on a real-world topological trace. The results clearly demonstrate, under different scenarios, the superiority of our proposed algorithm in minimizing the fairness loss for users engaged with the same games, while achieving high edge user admission rates.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{9937025,

title = {Study of a Proposed Spectral-based Approach for Facility Location in Tree Topologies},

author = {Asterios Papamichail and Athanasios Tsipis and Georgios Tsoumanis and Konstantinos Oikonomou},

doi = {10.1109/GIIS56506.2022.9937025},

year  = {2022},

date = {2022-01-01},

urldate = {2022-01-01},

booktitle = {2022 Global Information Infrastructure and Networking Symposium (GIIS)},

pages = {73-77},

abstract = {The wide proliferation of smart devices in the emerging Internet of Things (IoT) networking environment necessitates a revisit to the facility location problems, i.e., where to locate a certain service facility in order to minimize a corresponding cost function (e.g., minimize energy consumption in wireless sensor network by selecting a suitable location for the sink). To address this problem for a single facility, a spectral-based approach is presented in this paper for tree topologies considering the principal eigenvector of the distance matrix and the aggregate traffic loads. It was observed using simulation that even for those cases that the proposed approach does not produce the optimal location (i.e., the solution of the median problem), the corresponding cost is still close to the minimum.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{9566263,

title = {A Proposed Multi -Head Clustering Algorithm for VANET Environments},

author = {Spiridon Vergis and Georgios Tsoumanis and Konstantinos Oikonomou},

doi = {10.1109/SEEDA-CECNSM53056.2021.9566263},

year  = {2021},

date = {2021-01-01},

urldate = {2021-01-01},

booktitle = {2021 6th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)},

pages = {1-8},

abstract = {Vehicular Ad Hoc Networks (VANETs) have the potential to become viable to Intelligent Transportation System (ITS) real-world applications. Vehicles' high mobility along with real-world application scalability are some of the main challenges in this network environment. The various mobility-based characteristics can be exploited by forming clusters of vehicles with similar attributes within the network. Clustering in VANET environments is an approach that converts the network structure from flat into hierarchical by dividing the network into groups of vehicles, called clusters. One of the main requirements for effective VANET clustering is stability given the dynamicity of the environment. This paper presents a multi-head clustering algorithm that utilizes mobility-based metrics to form clusters in a vehicular network. The proposed algorithm assumes that each vehicle can be a member of multiple clusters, thus creating stable clusters that are robust in this environment. Several simulations are carried out to test the algorithm's effectiveness under different scenarios. The proposed algorithm is also compared against a previously presented algorithm, called Double-Head Clustering Algorithm. The performance evaluation is based on metrics regarding the clusters' lifetime. The results outline that the presented algorithm outperforms the clustering algorithm of the bibliography both in cluster stability and cluster size.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{9593134,

title = {A Refined Topology-Independent Probabilistic TDMA MAC Policy for Ad Hoc Networks},

author = {Vasileios Dragonas and Georgios Tsoumanis and Konstantinos Oikonomou},

doi = {10.1109/BalkanCom53780.2021.9593134},

year  = {2021},

date = {2021-01-01},

urldate = {2021-01-01},

booktitle = {2021 International Balkan Conference on Communications and Networking (BalkanCom)},

pages = {61-65},

abstract = {Entering the age of the Internet of Things, millions of devices with different requirements and diverse characteristics will soon be interconnected. This interconnection, depending on the scenario, can be achieved either through the cloud or by implementing an ad hoc network. Frequent topology changes and energy consumption issues create the need for researching new MAC Policies that are better suited to tackle the aforementioned problems.In this paper a TDMA Medium Access Control Policy for wireless ad hoc networks is proposed which is unaware of the underlying topology. The proposed policy is based on an already existing topology-independent policy which utilizes the non-assigned TDMA slots by means of transmitting during them probabilistically. The policy suggested here tries to improve by identifying transmissions that have a high chance of creating collisions. Experimental results show that the proposed policy achieves better performance in terms of system throughput and at the same time achieves fewer total transmissions, thus contributing in energy conservation},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{9593261,

title = {Scalable Server Location for Distributed Interactive Applications Under Budget Constraints},

author = {Athanasios Tsipis and Vasileios Komianos},

doi = {10.1109/BalkanCom53780.2021.9593261},

year  = {2021},

date = {2021-01-01},

urldate = {2021-01-01},

booktitle = {2021 International Balkan Conference on Communications and Networking (BalkanCom)},

pages = {21-25},

abstract = {Mobile Edge Computing (MEC) has emerged as a popular paradigm for the support of distributed interactive applications (DIAs), promising continuous service provision and availability to mobile users, that is otherwise not easily attainable under the centralized cloud-only model. Yet, in order to alleviate the app provider from unnecessary capital expenditure, a judicious location of the edge servers must be adopted, that can effectively cope with both the network demands and the deployment cost, and still abide by the budget constraints of the app provider. In this paper, we formally formulate the problem as a budget-constrained facility location problem. We then propose a distributed and scalable algorithm, that employs elastic server relocation, to address it. Trace-driven simulations under various MEC deployment scenarios verify the expected behavior and testify to the algorithm’s accountability in obeying the budget limits and converging to a placement solution close to the optimal in finite time slots, rendering it suitable for DIAs ecosystems.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{9593230,

title = {Design of a Computational Offloading Platform for Immersive Experiences in Digital Culture},

author = {Vasileios Komianos and Athanasios Tsipis and Katerina Kontopanagou},

doi = {10.1109/BalkanCom53780.2021.9593230},

year  = {2021},

date = {2021-01-01},

urldate = {2021-01-01},

booktitle = {2021 International Balkan Conference on Communications and Networking (BalkanCom)},

pages = {40-44},

abstract = {Recent advances in three-dimensional (3D) media delivery technologies, such as Augmented and Mixed Reality, have paved the way towards the realization of high-quality immersive experiences in digital culture applications. Nowadays, these services play a crucial role in cultural heritage dissemination, transforming visitors from passive spectators into proactive culture caretakers and content creators. Nevertheless, they demand significant computational resources and are subject to low delay tolerances, that are generally difficult to acquire via standard mobile devices. Under this scope, the current paper deals with the preliminary design of a hybrid cloud/edge computing platform for the support of digital culture applications. The goal is to recognize computationally intensive services that are to be offloaded based on their resource and time criticality to the cloud or edge respectively, and offer constant guarantees regarding the visitors’ Quality of Experience. The use case of Byzantine Monuments and Churches is also reported to better contextualize the approach and present the platform’s layering and data flow.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{9593243,

title = {Constructing Budget Connected Dominating Sets in Large-Scale IoT Network Environments},

author = {Konstantinos Skiadopoulos and Athanasios Tsipis and Konstantinos Oikonomou},

doi = {10.1109/BalkanCom53780.2021.9593243},

year  = {2021},

date = {2021-01-01},

urldate = {2021-01-01},

booktitle = {2021 International Balkan Conference on Communications and Networking (BalkanCom)},

pages = {75-79},

abstract = {Several critical operations depend on various types of information dissemination in the Internet of Things (IoT) networks. To avoid costly flooding-based solutions in these typically large-scale network environments, it is frequently sufficient enough to involve only a proper subset of the nodes (or backbone network), ensuring that every other node will be at most d hops away from a node belonging to the specific subset, i.e., a connected dominating set (CDS). In many cases, the outputted CDS size is upper bounded by a specific physical requirement or constraints relating to the limited available processing and memory capacities of the IoT nodes. Thus, a budget parameter k is frequently introduced as an upper bound for the number of nodes comprising the CDS, leading to the creation of a Budget Connected Dominating Set (BCDS). In this work, a novel distributed algorithm for constructing a BCDS is proposed based on information available d hops away from the network nodes, assuming an upper budget k limit regarding its final size. An additional upper bound parameter relating to the number of sent messages for each node, i.e., the stop, is also for the first time utilized. It is shown using simulation results that when stop is employed, a BCDS with increased coverage (i.e., the fraction of nodes at most d hops away from the BCDS nodes) is constructed under the proposed algorithm.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{9631480,

title = {Player Assignment in MEC Gaming for Social Interactivity and Server Provisioning Optimization},

author = {Athanasios Tsipis and Konstantinos Oikonomou},

doi = {10.1109/ISCC53001.2021.9631480},

year  = {2021},

date = {2021-01-01},

urldate = {2021-01-01},

booktitle = {2021 IEEE Symposium on Computers and Communications (ISCC)},

pages = {1-7},

abstract = {In Mobile Edge Computing (MEC), edge servers are deployed on Base Stations (BSs) to provide high accessibility to nearby users, alleviating the computational burden of the remote cloud and significantly reducing network delays. Still, for distributed interactive applications (DIAs), such as cloud games, where players team up and form social communities, one fundamental challenge is the discovery of the most suitable player-to-server assignment, that achieves a balanced tradeoff between low-delay social interactivity and low-cost server provisioning, under strict proximity and capacity constraints. In this paper, we formally model the problem via mixed-integer linear programming. However, its solution is complex falling under the category of existing capacitated facility location problems. Thus, we present the “Interactivity-based Edge Server Allocation” (IESA) algorithm, a novel heuristic approach to efficiently assign and then iteratively improve the player-to-server allocation. IESA is evaluated using trace-driven simulations that demonstrate how it outperforms the baseline and state-of-the-art assignment alternatives.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{9593218,

title = {A Migration-Based Approach for the SDN Controller Placement Problem in Tree Topologies},

author = {Alexandros Zervopoulos and Konstantinos Oikonomou},

doi = {10.1109/BalkanCom53780.2021.9593218},

year  = {2021},

date = {2021-01-01},

urldate = {2021-01-01},

booktitle = {2021 International Balkan Conference on Communications and Networking (BalkanCom)},

pages = {127-132},

abstract = {The advent of Software-Defined Networking (SDN) brings about a major shift in network management but also introduces various challenges, like scalability, giving rise to physically distributed approaches towards a logically centralized controller. When deploying multiple controllers, where to place them in the network in order to minimize response times and overhead is an issue that naturally arises. This has been termed as the Controller Placement Problem (CPP). The CPP can be viewed as an extension of the k-median problem, if the number of controllers is known. However, unlike the k-median problem, assigning switches to the available controllers is a challenging task, as even the reassignment of a single switch can affect the performance of others. In this work, the CPP is studied in the context of tree topologies, where it is shown that reassigning a switch only affects its directly adjacent switches. Additionally, a migration-based approach for solving the CPP is considered, consisting of two parts: (i) the controller migration policy; and (ii) the switch migration policy. The controller migration policy is based on an existing service migration approach, whereas two different switch migration policies are proposed and studied in this paper. Simulation results demonstrate that in tree topologies, switch migrations offer limited benefit. This is attributed to the limited opportunities for switch migration that arise because of the topological aspects of trees. On the other hand, the controller migration policy suffices to closely approximate optimal solutions.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{9284390,

title = {Elastic Distributed Rendering Service Placement in Capacitated Cloud/Fog Gaming Systems},

author = {Athanasios Tsipis and Vasileios Komianos and Konstantinos Oikonomou and Ioannis Stavrakakis},

doi = {10.1109/IISA50023.2020.9284390},

year  = {2020},

date = {2020-01-01},

urldate = {2020-01-01},

booktitle = {2020 11th International Conference on Information, Intelligence, Systems and Applications (IISA},

pages = {1-8},

abstract = {Fog-assisted cloud computing advances have paved the way for new solutions in online gaming, by integrating all rendering resources directly into the edges of the cloud. However, despite the numerous benefits, these systems still remain prone to network delays, ergo, the discovery of an optimal rendering service placement in the fog layer, that effectively reduces capital deployment cost for the game providers and access latency cost for the game clients, is a challenging issue. In fact, it falls into the category of the well-known (NP-hard) facility location problems. As such, conventional centralized approaches, that require global network knowledge, in most cases are deemed unscalable and cost-prohibitive, thus, distributed solutions must be further explored. The approach followed here, introduces a Rendering Service Allocation Policy (RSAP) to autonomously allocate services towards an optimal placement, based strictly on local information available to the fog renderers regarding their aggregate rendering demands, yielding reduced access latency and deployment costs, whilst meeting their stringent capacity bounds. Simulation results showcase the efficiency of RSAP and verify its elastic behavior under different deployment scenarios.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{9221778,

title = {QoE-Aware Rendering Service Allocation in Fog-Assisted Cloud Gaming Environments},

author = {Athanasios Tsipis and Konstantinos Oikonomou and Vasileios Komianos and Ioannis Stavrakakis},

doi = {10.1109/SEEDA-CECNSM49515.2020.9221778},

year  = {2020},

date = {2020-01-01},

urldate = {2020-01-01},

booktitle = {2020 5th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)},

pages = {1-8},

abstract = {Cloudification of heterogeneous networks along with the virtualization of gaming resources, allow the game providers to move into the cloud gaming era. Cloud gaming offloads computation-intensive tasks to the cloud in order to alleviate the computational burden of end-users’ devices, but introduces delay which deteriorates their Quality of Experience (QoE). To solve the optimization problem of rendering service allocation with QoE guarantees and reduce the operational expenditures of game providers, fog computing is deemed a promising solution. However, the optimization problem is NP-hard since it falls into the category of the well-known Facility Location Problems. In the current paper, a distributed policy is proposed, named QoE-Aware Rendering Service Allocation (QoERSA), which takes advantage of strictly local network information, to reallocate the rendering services inside the fog computing network, towards an optimal delay-sensitive placement, given the QoE gaming constraints and the need for capital investment reduction. To this end, it employs Mean Opinion Score objective QoE assessment and simple mechanics that move, copy and merge services with high elasticity and scalability. QoERSA is evaluated through simulations that highlight its efficiency and showcase its capability of overall service access and deployment cost reduction.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}