FRINK Linked Data Fragments server

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

• W2283997060 abstract "The rapid advances in Information Services (IS) have generated many imminent administration challenges in the Information Technology (IT) infrastructure space. Typically, an IS uses the Internet or some other communication network to become widely accessible and further requires some form of computing data center to be supported. The tremendous success and the fast-paced development of IS have thus resulted in massive infrastructural growth rates. This fact coupled with the high expectations from the much-promising next generation of IS have tightened the performance requirements and have created many critical problems in IT infrastructures. This dissertation considers some of the resource control problems that arise in the various layers of large scale computing systems and networks.Adopting a risk mitigation approach, two security issues are initially addressed. First, the problem of controlling the recovery time from epidemic spreads (i.e. viruses and worms) by applying resources to strengthen vulnerable sites and links is analyzed for network topologies. This problem is formulated as an eigenvalue control one which allows construction of scalable distributed algorithms via convex optimization. Second, patching management of software vulnerabilities is studied in data center environments. Unlike pre-existing literature that attempts to optimize defense against an active attack, the objective, here, is to find patching policies that minimize the service disruption cost from both maintenance operations and exploitation threats using a Dynamic Programming (DP) framework.The focus is then placed on power/cost aware management of individual switching components. Well established scheduling algorithms are redesigned to gracefully balance the trade-off between power and packet delay in input queued (IQ) switches, in a way that maintains their ability to achieve maximal throughput. Additionally, after extending long withstanding queueing results, it is proven that power/cost efficient controls need not lack this ability in general queueing/switching service structures (QSSSs) by showing that low workload decisions are insignificant stability-wise.Finally, the problem of online outsourcing of execution capacity in computing and data storage services is tackled. Leveraging from the fact that such services only recently became available online and utilizing a DP formulation, the cost and risk of the supported operations is dynamically optimized. A case study in data storage services validates the findings." @default.
• W2283997060 created "2016-06-24" @default.
• W2283997060 creator A5080458608 @default.
• W2283997060 date "2009-01-01" @default.
• W2283997060 modified "2023-09-26" @default.
• W2283997060 title "Scalable resource control in large-scale computing/networking infrastructures" @default.
• W2283997060 hasPublicationYear "2009" @default.
• W2283997060 type Work @default.
• W2283997060 sameAs 2283997060 @default.
• W2283997060 citedByCount "1" @default.
• W2283997060 countsByYear W22839970602014 @default.
• W2283997060 crossrefType "journal-article" @default.
• W2283997060 hasAuthorship W2283997060A5080458608 @default.
• W2283997060 hasConcept C120314980 @default.
• W2283997060 hasConcept C127413603 @default.
• W2283997060 hasConcept C153740404 @default.
• W2283997060 hasConcept C199845137 @default.
• W2283997060 hasConcept C206729178 @default.
• W2283997060 hasConcept C21547014 @default.
• W2283997060 hasConcept C31258907 @default.
• W2283997060 hasConcept C38652104 @default.
• W2283997060 hasConcept C41008148 @default.
• W2283997060 hasConcept C48044578 @default.
• W2283997060 hasConcept C77088390 @default.
• W2283997060 hasConcept C77270119 @default.
• W2283997060 hasConceptScore W2283997060C120314980 @default.
• W2283997060 hasConceptScore W2283997060C127413603 @default.
• W2283997060 hasConceptScore W2283997060C153740404 @default.
• W2283997060 hasConceptScore W2283997060C199845137 @default.
• W2283997060 hasConceptScore W2283997060C206729178 @default.
• W2283997060 hasConceptScore W2283997060C21547014 @default.
• W2283997060 hasConceptScore W2283997060C31258907 @default.
• W2283997060 hasConceptScore W2283997060C38652104 @default.
• W2283997060 hasConceptScore W2283997060C41008148 @default.
• W2283997060 hasConceptScore W2283997060C48044578 @default.
• W2283997060 hasConceptScore W2283997060C77088390 @default.
• W2283997060 hasConceptScore W2283997060C77270119 @default.
• W2283997060 hasLocation W22839970601 @default.
• W2283997060 hasOpenAccess W2283997060 @default.
• W2283997060 hasPrimaryLocation W22839970601 @default.
• W2283997060 hasRelatedWork W141934337 @default.
• W2283997060 hasRelatedWork W145942541 @default.
• W2283997060 hasRelatedWork W1529874666 @default.
• W2283997060 hasRelatedWork W1582522656 @default.
• W2283997060 hasRelatedWork W1589888154 @default.
• W2283997060 hasRelatedWork W1612506517 @default.
• W2283997060 hasRelatedWork W1966211683 @default.
• W2283997060 hasRelatedWork W1972148404 @default.
• W2283997060 hasRelatedWork W2017725543 @default.
• W2283997060 hasRelatedWork W2118071799 @default.
• W2283997060 hasRelatedWork W2118176249 @default.
• W2283997060 hasRelatedWork W2126106587 @default.
• W2283997060 hasRelatedWork W2137763387 @default.
• W2283997060 hasRelatedWork W2149545994 @default.
• W2283997060 hasRelatedWork W2464050827 @default.
• W2283997060 hasRelatedWork W2509520184 @default.
• W2283997060 hasRelatedWork W2907641280 @default.
• W2283997060 hasRelatedWork W2947448459 @default.
• W2283997060 hasRelatedWork W654847855 @default.
• W2283997060 hasRelatedWork W1666675799 @default.
• W2283997060 isParatext "false" @default.
• W2283997060 isRetracted "false" @default.
• W2283997060 magId "2283997060" @default.
• W2283997060 workType "article" @default.