FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2953649879> ?p ?o ?g. }

• W2953649879 abstract "Many distributed services in computer networks rely on a set of active facilities that are selected among a potentially large number of candidates. The active facilities then contribute and cooperate to deliver a specific service to the users of the distributed system. In this scenario graph partitioning or clustering is often adopted to determine the most efficient locations of the facilities. The identification of the optimal set of facility locations is known as the p-median problem in networks, is NP-hard and is typically solved by using heuristic methods. The goal is to select p locations among all candidate network nodes such that some cost function is minimised. A typical example of such a function is the overall communication cost to deliver the service to the users of the distributed system. Locating facilities in near-optimal locations has been extensively studied for different application domains. Most of these studies have investigated sequential algorithms and centralised approaches. However, centralised approaches are practically infeasible in large-scale and dynamic networks, where the problem is inherently distributed or because of the large communication overhead and memory requirements for gathering complete information about the network topology and the users. In this work distributed approaches to the p-median problem are investigated. Two solutions are proposed for addressing the facility locations problem in a fully distributed environment. Two different iterative heuristic approaches are applied to gradually improve a random initial solution and to converge to a final solution with a local minimum of the overall cost. While the first approach adopts a fine granularity by identifying a single change to improve the solution at each iteration, the second approach applies changes to every component of the solution at each iteration. An experimental comparative analysis based on simulations has shown that the approach with a finer granularity is able to deliver a better optimisation of the overall cost with longer convergence time. Both approaches have excellent scalability and provide an effective tool to optimise the facility locations from within the network. No prior knowledge of the system is required, no data needs to be gathered in a centralised server and the same process is used to identify and to deploy the facility locations solution in the network since the process is fully decentralised." @default.
• W2953649879 created "2019-07-12" @default.
• W2953649879 creator A5007549483 @default.
• W2953649879 creator A5026941307 @default.
• W2953649879 creator A5065387842 @default.
• W2953649879 date "2019-01-01" @default.
• W2953649879 modified "2023-09-27" @default.
• W2953649879 title "The Distributed p-Median Problem in Computer Networks" @default.
• W2953649879 cites W12382059 @default.
• W2953649879 cites W1565528801 @default.
• W2953649879 cites W1968756810 @default.
• W2953649879 cites W1995082536 @default.
• W2953649879 cites W2000174298 @default.
• W2953649879 cites W2069093792 @default.
• W2953649879 cites W2105599110 @default.
• W2953649879 cites W2109691905 @default.
• W2953649879 cites W2116725038 @default.
• W2953649879 cites W2122448542 @default.
• W2953649879 cites W2137394440 @default.
• W2953649879 cites W2153171506 @default.
• W2953649879 cites W2186249859 @default.
• W2953649879 cites W2409682755 @default.
• W2953649879 cites W2467149847 @default.
• W2953649879 cites W86242020 @default.
• W2953649879 doi "https://doi.org/10.1007/978-3-030-24311-1_39" @default.
• W2953649879 hasPublicationYear "2019" @default.
• W2953649879 type Work @default.
• W2953649879 sameAs 2953649879 @default.
• W2953649879 citedByCount "0" @default.
• W2953649879 crossrefType "book-chapter" @default.
• W2953649879 hasAuthorship W2953649879A5007549483 @default.
• W2953649879 hasAuthorship W2953649879A5026941307 @default.
• W2953649879 hasAuthorship W2953649879A5065387842 @default.
• W2953649879 hasBestOaLocation W29536498792 @default.
• W2953649879 hasConcept C111919701 @default.
• W2953649879 hasConcept C120314980 @default.
• W2953649879 hasConcept C126255220 @default.
• W2953649879 hasConcept C130120984 @default.
• W2953649879 hasConcept C132525143 @default.
• W2953649879 hasConcept C154945302 @default.
• W2953649879 hasConcept C173801870 @default.
• W2953649879 hasConcept C177264268 @default.
• W2953649879 hasConcept C199360897 @default.
• W2953649879 hasConcept C199845137 @default.
• W2953649879 hasConcept C2779960059 @default.
• W2953649879 hasConcept C31258907 @default.
• W2953649879 hasConcept C33923547 @default.
• W2953649879 hasConcept C41008148 @default.
• W2953649879 hasConcept C48903430 @default.
• W2953649879 hasConcept C73555534 @default.
• W2953649879 hasConcept C80444323 @default.
• W2953649879 hasConceptScore W2953649879C111919701 @default.
• W2953649879 hasConceptScore W2953649879C120314980 @default.
• W2953649879 hasConceptScore W2953649879C126255220 @default.
• W2953649879 hasConceptScore W2953649879C130120984 @default.
• W2953649879 hasConceptScore W2953649879C132525143 @default.
• W2953649879 hasConceptScore W2953649879C154945302 @default.
• W2953649879 hasConceptScore W2953649879C173801870 @default.
• W2953649879 hasConceptScore W2953649879C177264268 @default.
• W2953649879 hasConceptScore W2953649879C199360897 @default.
• W2953649879 hasConceptScore W2953649879C199845137 @default.
• W2953649879 hasConceptScore W2953649879C2779960059 @default.
• W2953649879 hasConceptScore W2953649879C31258907 @default.
• W2953649879 hasConceptScore W2953649879C33923547 @default.
• W2953649879 hasConceptScore W2953649879C41008148 @default.
• W2953649879 hasConceptScore W2953649879C48903430 @default.
• W2953649879 hasConceptScore W2953649879C73555534 @default.
• W2953649879 hasConceptScore W2953649879C80444323 @default.
• W2953649879 hasLocation W29536498791 @default.
• W2953649879 hasLocation W29536498792 @default.
• W2953649879 hasLocation W29536498793 @default.
• W2953649879 hasOpenAccess W2953649879 @default.
• W2953649879 hasPrimaryLocation W29536498791 @default.
• W2953649879 hasRelatedWork W1516830477 @default.
• W2953649879 hasRelatedWork W1530562558 @default.
• W2953649879 hasRelatedWork W17575113 @default.
• W2953649879 hasRelatedWork W1998890701 @default.
• W2953649879 hasRelatedWork W2270280079 @default.
• W2953649879 hasRelatedWork W3021470323 @default.
• W2953649879 hasRelatedWork W4287805370 @default.
• W2953649879 hasRelatedWork W94000989 @default.
• W2953649879 hasRelatedWork W176894511 @default.
• W2953649879 hasRelatedWork W2516240846 @default.
• W2953649879 isParatext "false" @default.
• W2953649879 isRetracted "false" @default.
• W2953649879 magId "2953649879" @default.
• W2953649879 workType "book-chapter" @default.