Titlebook: Distributed Computing; 18th International C Rachid Guerraoui Conference proceedings 2004 Springer-Verlag Berlin Heidelberg 2004 Routing.SPI

Evocative

https://doi.org/10.1007/978-3-319-68807-7re-and-swap (CAS) operation, by an “optimistic” doubly-linked list whose pointers are updated using a simple store, yet can be “fixed” if a bad ordering of events causes them to be inconsistent. We believe it is the first example of such an “optimistic” approach being applied to a real world data structure.

accrete

Post-modernity as a Cultural Conditionnd that it is robust as long as the virtual node travels through well-populated areas of the network. The Virtual Mobile Node Abstraction significantly simplifies the design of efficient algorithms for highly dynamic mobile . networks.