FRINK Linked Data Fragments server

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

• W2790355970 abstract "Communication networks and more in general distributed systems are undergoing rapid advancements. The last few years have experienced a steep growth in research on different related aspects. However, although the great promise for our future communication capabilities, several challenges need still to be addressed. A crucial ingredient for the successful development end employment of the corresponding arising technologies is the design of networks better suited for the management of large bandwidth and high quality services, as required by the emerging tasks, such as on-demand-video, multimedia and data integrated networks, seamless and ubiquitous access to system resources in mobile environments, secure on-demand data, and so forth. In this thesis we focus on the analysis of the performance and complexity of distributed systems such as optical networks (representing the main contribution of the thesis) and wireless networks. More specifically, we consider classical combinatorial optimization problems arising in communication networks from two different perspectives. In the first part we consider the design of classical centralized polynomial time (approximation or exact) algorithms. Such an investigation is conducted under a traditional computational complexity setting in which time constraints must be taking into account for tractability and efficiency matters. The above perspective implicitly or explicitly assumes that the resources of the system are directly accessible and controllable by a centralized authority, but this assumption in highly distributed systems might be too strong or unrealistic. Therefore, in the second part of the thesis we consider communication problems arising in networks with autonomous or non-cooperative users. In such a scenario users pursue an own often selfish strategy and the system evolves as a consequence of the interactions among them. The interesting arising scenario is thus characterized by the conflicting needs of the users aiming to maximize their personal profit and of the system wishing to compute a socially efficient solution. Algorithmic Game theory is considered the most powerful tool dealing with such non-cooperative environments in which the lack of coordination yields inefficiencies. In such a scenario we consider the pure Nash equilibrium as the outcome of the game and in turn as the concept capturing the notion of stable solution of the system. Under the above perspectives, the thesis makes different progresses on the understanding of a variety of problems in communication networks. Our results include: polynomial time algorithms, NP-complete results, approximation algorithms and inapproximability results; analysis of performances, convergence and existence of Nash equilibria in selfish scenarios." @default.
• W2790355970 created "2018-03-29" @default.
• W2790355970 creator A5051227299 @default.
• W2790355970 date "2010-04-01" @default.
• W2790355970 modified "2023-09-23" @default.
• W2790355970 title "Optimization and Non-Cooperative Issues in Communication Networks." @default.
• W2790355970 hasPublicationYear "2010" @default.
• W2790355970 type Work @default.
• W2790355970 sameAs 2790355970 @default.
• W2790355970 citedByCount "0" @default.
• W2790355970 crossrefType "journal-article" @default.
• W2790355970 hasAuthorship W2790355970A5051227299 @default.
• W2790355970 hasConcept C108037233 @default.
• W2790355970 hasConcept C120314980 @default.
• W2790355970 hasConcept C120665830 @default.
• W2790355970 hasConcept C121332964 @default.
• W2790355970 hasConcept C192209626 @default.
• W2790355970 hasConcept C2776257435 @default.
• W2790355970 hasConcept C31258907 @default.
• W2790355970 hasConcept C41008148 @default.
• W2790355970 hasConcept C555944384 @default.
• W2790355970 hasConcept C76155785 @default.
• W2790355970 hasConceptScore W2790355970C108037233 @default.
• W2790355970 hasConceptScore W2790355970C120314980 @default.
• W2790355970 hasConceptScore W2790355970C120665830 @default.
• W2790355970 hasConceptScore W2790355970C121332964 @default.
• W2790355970 hasConceptScore W2790355970C192209626 @default.
• W2790355970 hasConceptScore W2790355970C2776257435 @default.
• W2790355970 hasConceptScore W2790355970C31258907 @default.
• W2790355970 hasConceptScore W2790355970C41008148 @default.
• W2790355970 hasConceptScore W2790355970C555944384 @default.
• W2790355970 hasConceptScore W2790355970C76155785 @default.
• W2790355970 hasOpenAccess W2790355970 @default.
• W2790355970 hasRelatedWork W1481384555 @default.
• W2790355970 hasRelatedWork W1528530582 @default.
• W2790355970 hasRelatedWork W1600340728 @default.
• W2790355970 hasRelatedWork W1618113455 @default.
• W2790355970 hasRelatedWork W19002037 @default.
• W2790355970 hasRelatedWork W1969893348 @default.
• W2790355970 hasRelatedWork W2004750243 @default.
• W2790355970 hasRelatedWork W2074914376 @default.
• W2790355970 hasRelatedWork W2078587062 @default.
• W2790355970 hasRelatedWork W2085413353 @default.
• W2790355970 hasRelatedWork W2186159016 @default.
• W2790355970 hasRelatedWork W2270030204 @default.
• W2790355970 hasRelatedWork W2572187299 @default.
• W2790355970 hasRelatedWork W2579460505 @default.
• W2790355970 hasRelatedWork W2612616897 @default.
• W2790355970 hasRelatedWork W2766864503 @default.
• W2790355970 hasRelatedWork W2877069161 @default.
• W2790355970 hasRelatedWork W2952586155 @default.
• W2790355970 hasRelatedWork W3007111576 @default.
• W2790355970 hasRelatedWork W3203606636 @default.
• W2790355970 isParatext "false" @default.
• W2790355970 isRetracted "false" @default.
• W2790355970 magId "2790355970" @default.
• W2790355970 workType "article" @default.