Sciweavers

6808 search results - page 942 / 1362
» Distributed Concurrency Control
Sort
View
IPPS
2005
IEEE
15 years 10 months ago
Optimal Oblivious Path Selection on the Mesh
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
Costas Busch, Malik Magdon-Ismail, Jing Xi
127
Voted
ISPAN
2005
IEEE
15 years 10 months ago
P2P Architecture for Self-Atomic Memory
We propose an architecture for self-adjusting and self-healing atomic memory in highly dynamic systems exploiting peer-to-peer (p2p) techniques. Our approach, named SAM, brings to...
Emmanuelle Anceaume, Maria Gradinariu, Vincent Gra...
SPAA
2005
ACM
15 years 10 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
IWDC
2005
Springer
117views Communications» more  IWDC 2005»
15 years 10 months ago
Oasis: A Hierarchical EMST Based P2P Network
Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems and ...
Pankaj Ghanshani, Tarun Bansal
COORDINATION
2004
Springer
15 years 10 months ago
A Lightweight Coordination Middleware for Mobile Computing
This paper presents Limone, a new coordination model that facilitates rapid application development over ad hoc networks consisting of logically mobile agents and physically mobile...
Chien-Liang Fok, Gruia-Catalin Roman, Gregory Hack...