FRINK Linked Data Fragments server

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

• W2112952441 abstract "Mobile agents constitute a computing paradigm of a more general nature than the widely used client/server computing paradigm. A mobile agent is essentially a computer program that acts autonomously on behalf of a user and travels through a network of heterogeneous machines. However, the greater flexibility of the mobile agent paradigm compared to the client/server computing paradigm comes at additional costs. These costs include, among others, the additional complexity of developing and managing mobile agent-based applications. This additional complexity comprises such issues as reliability. Before mobile agent technology can appear at the core of tomorrow's business applications, reliability mechanisms for mobile agents must be established. In this context, fault tolerance and transaction support are mechanisms of considerable importance. Various approaches to fault tolerance and transaction support exist. They have different strengths and weaknesses, and address different environments. Because of this variety, it is often difficult for the application programmer to choose the approach best suited to an application. This thesis introduces a classification of current approaches to fault-tolerant and transactional mobile agent execution. The classification, which focuses on algorithmic aspects, aims at structuring the field of fault-tolerant and transactional mobile agent execution and facilitates an understanding of the properties and weaknesses of particular approaches. In a distributed system, any software or hardware component may be subject to failures. A single failing component (e.g., agent or machine) may prevent the agent from proceeding with its execution. Worse yet, the current state of the agent and even its code may be lost. We say that the agent execution is blocked. For the agent owner, i.e., the person or application that has configured the agent, the agent does not return. To achieve fault-tolerance, the agent owner can try to detect the failure of the agent, and upon such an event launch a new agent. However, this requires the ability to correctly detect the crash of the agent, i.e., to distinguish between a failed agent and an agent that is delayed by slow processors or slow communication links. Unfortunately, this cannot be achieved in systems such as the Internet. An agent owner who tries to detect the failure of the agent thus cannot prevent the case in which the agent is mistakenly assumed to have crashed. In this case, launching a new agent leads to multiple executions of the agent, i.e., to the violation of the desired exactly-once property of agent execution. Although this may be acceptable for certain applications (e.g., applications whose operations do not have side-effects), others clearly forbid it. In this context, launching a new agent is a form of replication. In general, replication prevents blocking, but may lead to multiple executions of the agent, i.e., to a violation of the exactly-once execution property. This thesis presents an approach that ensures the exactly-once execution property using a simple principle: the mobile agent execution is modeled as a sequence of agreement problems. This model leads to an approach based on two well-known building blocks: consensus and reliable broadcast. We validate this approach with the implementation of FATOMAS, a Java-based FAult-TOlerant Mobile Agent System, and measure its overhead. Transactional mobile agents execute the mobile agent as a transaction. Assume, for instance, an agent whose task is to buy an airline ticket, book a hotel room, and rent a car at the flight destination. The agent owner naturally wants all three operations to succeed or none at all. Clearly, the rental car at the destination is of no use if no flight to the destination is available. On the other hand, the airline ticket may be useless if no rental car is available. The mobile agent's operations thus need to execute atomically, i.e., either all of them or none at all. Execution atomicity also needs to be ensured in the event of failures of hardware or software components. The approach presented in this thesis is non-blocking. A non-blocking transactional mobile agent execution has the important advantage that it can make progress despite failures. In a blocking transactional mobile agent execution, by contrast, progress is only possible when the failed component has recovered. Until then, the acquired locks generally cannot be freed. As no other transactional mobile agents can acquire the lock, overall system throughput is dramatically reduced. The present approach reuses the work on fault-tolerant mobile agent execution to prevent blocking. We have implemented the proposed approach and present the evaluation results." @default.
• W2112952441 created "2016-06-24" @default.
• W2112952441 creator A5067512009 @default.
• W2112952441 date "2002-01-01" @default.
• W2112952441 modified "2023-09-23" @default.
• W2112952441 title "FAULT-TOLERANT AND TRANSACTIONAL MOBILE AGENT EXECUTION" @default.
• W2112952441 cites W126436876 @default.
• W2112952441 cites W1483827732 @default.
• W2112952441 cites W1486463146 @default.
• W2112952441 cites W1489712265 @default.
• W2112952441 cites W1491268894 @default.
• W2112952441 cites W1492999019 @default.
• W2112952441 cites W1510940979 @default.
• W2112952441 cites W1518666325 @default.
• W2112952441 cites W1525343879 @default.
• W2112952441 cites W1526484487 @default.
• W2112952441 cites W1542378772 @default.
• W2112952441 cites W1542867100 @default.
• W2112952441 cites W1546023440 @default.
• W2112952441 cites W1561569259 @default.
• W2112952441 cites W1581766414 @default.
• W2112952441 cites W1587988245 @default.
• W2112952441 cites W1595646256 @default.
• W2112952441 cites W1713457808 @default.
• W2112952441 cites W1802544268 @default.
• W2112952441 cites W1821608153 @default.
• W2112952441 cites W1822681519 @default.
• W2112952441 cites W1826967458 @default.
• W2112952441 cites W1884773913 @default.
• W2112952441 cites W1897250020 @default.
• W2112952441 cites W1963615255 @default.
• W2112952441 cites W1967597999 @default.
• W2112952441 cites W1968347165 @default.
• W2112952441 cites W1970594962 @default.
• W2112952441 cites W1983427623 @default.
• W2112952441 cites W1991674178 @default.
• W2112952441 cites W2003811039 @default.
• W2112952441 cites W2016679348 @default.
• W2112952441 cites W2017319219 @default.
• W2112952441 cites W2026080185 @default.
• W2112952441 cites W2037628724 @default.
• W2112952441 cites W2043318789 @default.
• W2112952441 cites W2049984501 @default.
• W2112952441 cites W2060189343 @default.
• W2112952441 cites W2066775342 @default.
• W2112952441 cites W2071187449 @default.
• W2112952441 cites W2083537476 @default.
• W2112952441 cites W2086240295 @default.
• W2112952441 cites W2096154177 @default.
• W2112952441 cites W2101148098 @default.
• W2112952441 cites W2102779878 @default.
• W2112952441 cites W2103814941 @default.
• W2112952441 cites W2106529232 @default.
• W2112952441 cites W2113155603 @default.
• W2112952441 cites W2117457392 @default.
• W2112952441 cites W2118748833 @default.
• W2112952441 cites W2122048894 @default.
• W2112952441 cites W2122291290 @default.
• W2112952441 cites W2124617909 @default.
• W2112952441 cites W2126041223 @default.
• W2112952441 cites W2126047215 @default.
• W2112952441 cites W2131929623 @default.
• W2112952441 cites W2133059071 @default.
• W2112952441 cites W2133943294 @default.
• W2112952441 cites W2142717373 @default.
• W2112952441 cites W2144522323 @default.
• W2112952441 cites W2145921665 @default.
• W2112952441 cites W2146096658 @default.
• W2112952441 cites W2146406197 @default.
• W2112952441 cites W2146424550 @default.
• W2112952441 cites W2146516325 @default.
• W2112952441 cites W2146618061 @default.
• W2112952441 cites W2153649450 @default.
• W2112952441 cites W2154010459 @default.
• W2112952441 cites W2155276556 @default.
• W2112952441 cites W2161381283 @default.
• W2112952441 cites W2162833503 @default.
• W2112952441 cites W2166713120 @default.
• W2112952441 cites W2613214602 @default.
• W2112952441 cites W2618898480 @default.
• W2112952441 cites W2624367663 @default.
• W2112952441 cites W2914206182 @default.
• W2112952441 cites W3022136953 @default.
• W2112952441 cites W3137220996 @default.
• W2112952441 cites W3142333173 @default.
• W2112952441 cites W3175637049 @default.
• W2112952441 cites W330182082 @default.
• W2112952441 cites W35152802 @default.
• W2112952441 cites W573932026 @default.
• W2112952441 cites W634486782 @default.
• W2112952441 cites W1666870309 @default.
• W2112952441 doi "https://doi.org/10.5075/epfl-thesis-2654" @default.
• W2112952441 hasPublicationYear "2002" @default.
• W2112952441 type Work @default.
• W2112952441 sameAs 2112952441 @default.
• W2112952441 citedByCount "4" @default.
• W2112952441 countsByYear W21129524412014 @default.
• W2112952441 crossrefType "journal-article" @default.
• W2112952441 hasAuthorship W2112952441A5067512009 @default.
• W2112952441 hasConcept C111919701 @default.

• next