FRINK Linked Data Fragments server

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

• W2335855723 abstract "Network systems, in both wired and wireless domains, traditionally forward data along a single best routing path for communication. Given that network communication has become a major part of today's economy, it is important to guarantee the robustness of network communication toward general failures or malicious attacks. However, there are fundamental constraints on re-engineering existing network systems to use robustness mechanisms. First, network systems are not amenable to centralized solutions because they usually span multiple administrative domains. Also, it is non-trivial to modify low-layer hardware and protocols of legacy network systems to support new robustness mechanisms. To overcome the fundamental robustness challenges, we propose to adapt existing network systems into robust architectures using the concept of overlays. Layered atop the physical network, overlays provide a flexible platform for building robustness mechanisms. In particular, we seek to design distributed solutions that are amenable to nodes that can communicate with one another, but are independently operated and prefer to make local decisions on link costs and route choices. This thesis proposes to use diversity overlay routing to address two robustness problems: (1) resilient multipath routing, in which distributed algorithms are proposed to route data along multiple available network paths in order to minimize the loss of throughput due to node or link failures, and (2) network fault correction, in which an end-to-end inference approach is proposed to aggregate information from multiple paths in order to minimize the cost of diagnosing and repairing network failures. First, we develop a distributed resilient multipath solution that routes data across available network paths to improve routing resilience in wired overlay networks. Our solution allows routing decisions to be locally made by network nodes without requiring centralized information, such as the entire network topology. We devise two distributed algorithms termed the Bound-Control algorithm and the Lex-Control algorithm, with an objective of minimizing the loss of throughput due to a single-link attack. We formally prove that both algorithms converge to their respective optimal solutions. Using simulation, we show that our resilient multipath solution effectively mitigates the loss of throughput due to single-link attacks as well as multi-link attacks. We next consider the use of opportunistic routing to boost the throughput gain of routing in multi-hop wireless networks. Our goals are to overlay the 802.11 MAC layer, exploit the broadcast nature of wireless communication, and utilize the spatial diversity of a network. We consider a novel routing scheme called Stable Opportunistic Routing (SOR), which integrates the techniques of forwarder scheduling and network coding to improve the throughput gain. Using nsclick simulation, we show that SOR improves throughput when compared with traditional single-path routing and previous opportunistic routing schemes under various settings, including the scenarios where link-level measurements are inaccurate. We also verified the benefits of SOR using testbed experiments. Finally, we consider an end-to-end approach of inferring network faults in an overlay system, with an optimization goal of minimizing the expected cost of correcting (i.e., diagnosing and repairing) all faulty nodes. Conventional fault localization problems first check the most likely fault node, i.e., the node with the highest conditional failure probability given a network with faulty nodes. By taking into account the cost of correcting faulty nodes, we prove that an optimal strategy should start with checking one of the candidate nodes, which are identified based on a potential function that we develop. We proposeseveral efficient heuristics for inferring the best node to check in large-scale networks. By extensive simulation, we show that checking first a candidate node decreases the cost of correcting all faulty nodes when compared with checking first the most likely faulty node. This thesis seeks to provide insights into the solutions of overcoming the fundamental robustness challenges of existing network systems. We consider one possible solution, i.e., using diversity routing on top of an overlay architecture, and show that how this solution improves the robustness of network communication toward general failures or malicious attacks." @default.
• W2335855723 created "2016-06-24" @default.
• W2335855723 creator A5019484217 @default.
• W2335855723 creator A5022420771 @default.
• W2335855723 date "2008-01-01" @default.
• W2335855723 modified "2023-09-27" @default.
• W2335855723 title "Achieving network robustness with diversity overlay routing" @default.
• W2335855723 hasPublicationYear "2008" @default.
• W2335855723 type Work @default.
• W2335855723 sameAs 2335855723 @default.
• W2335855723 citedByCount "0" @default.
• W2335855723 crossrefType "journal-article" @default.
• W2335855723 hasAuthorship W2335855723A5019484217 @default.
• W2335855723 hasAuthorship W2335855723A5022420771 @default.
• W2335855723 hasConcept C104317684 @default.
• W2335855723 hasConcept C104954878 @default.
• W2335855723 hasConcept C110875604 @default.
• W2335855723 hasConcept C120314980 @default.
• W2335855723 hasConcept C136085584 @default.
• W2335855723 hasConcept C136764020 @default.
• W2335855723 hasConcept C169851745 @default.
• W2335855723 hasConcept C185592680 @default.
• W2335855723 hasConcept C199360897 @default.
• W2335855723 hasConcept C204948658 @default.
• W2335855723 hasConcept C31258907 @default.
• W2335855723 hasConcept C41008148 @default.
• W2335855723 hasConcept C55493867 @default.
• W2335855723 hasConcept C63479239 @default.
• W2335855723 hasConcept C74172769 @default.
• W2335855723 hasConcept C76522221 @default.
• W2335855723 hasConceptScore W2335855723C104317684 @default.
• W2335855723 hasConceptScore W2335855723C104954878 @default.
• W2335855723 hasConceptScore W2335855723C110875604 @default.
• W2335855723 hasConceptScore W2335855723C120314980 @default.
• W2335855723 hasConceptScore W2335855723C136085584 @default.
• W2335855723 hasConceptScore W2335855723C136764020 @default.
• W2335855723 hasConceptScore W2335855723C169851745 @default.
• W2335855723 hasConceptScore W2335855723C185592680 @default.
• W2335855723 hasConceptScore W2335855723C199360897 @default.
• W2335855723 hasConceptScore W2335855723C204948658 @default.
• W2335855723 hasConceptScore W2335855723C31258907 @default.
• W2335855723 hasConceptScore W2335855723C41008148 @default.
• W2335855723 hasConceptScore W2335855723C55493867 @default.
• W2335855723 hasConceptScore W2335855723C63479239 @default.
• W2335855723 hasConceptScore W2335855723C74172769 @default.
• W2335855723 hasConceptScore W2335855723C76522221 @default.
• W2335855723 hasLocation W23358557231 @default.
• W2335855723 hasOpenAccess W2335855723 @default.
• W2335855723 hasPrimaryLocation W23358557231 @default.
• W2335855723 hasRelatedWork W1568176622 @default.
• W2335855723 hasRelatedWork W1672365780 @default.
• W2335855723 hasRelatedWork W1817131426 @default.
• W2335855723 hasRelatedWork W1941416550 @default.
• W2335855723 hasRelatedWork W1964139077 @default.
• W2335855723 hasRelatedWork W1966967076 @default.
• W2335855723 hasRelatedWork W2013976699 @default.
• W2335855723 hasRelatedWork W2014288420 @default.
• W2335855723 hasRelatedWork W2029731678 @default.
• W2335855723 hasRelatedWork W2033141454 @default.
• W2335855723 hasRelatedWork W2089888150 @default.
• W2335855723 hasRelatedWork W2095682406 @default.
• W2335855723 hasRelatedWork W2101025623 @default.
• W2335855723 hasRelatedWork W2125030869 @default.
• W2335855723 hasRelatedWork W2139924440 @default.
• W2335855723 hasRelatedWork W2151076198 @default.
• W2335855723 hasRelatedWork W2156650297 @default.
• W2335855723 hasRelatedWork W2184766758 @default.
• W2335855723 hasRelatedWork W3159103225 @default.
• W2335855723 hasRelatedWork W2553973061 @default.
• W2335855723 isParatext "false" @default.
• W2335855723 isRetracted "false" @default.
• W2335855723 magId "2335855723" @default.
• W2335855723 workType "article" @default.