Name
Abstract | ||
|---|---|---|
This paper presents our work in combining peer-to-peer dynamic tree management with hierarchical Operational Transformation (OT) over document trees to achieve low computational and communication costs. We discuss our approach in storing the document tree in a peer-to-peer, distributed manner and maintaining convergence, causality preservation, and intention preservation (CCI) via a peer-to-peer caching system. Because changes are sent to other users within the system only as needed (and cached when possible), our approach minimizes communication costs among multiple readers and writers. Our algorithms balance the traffic and computational load among peers. They ensure that users always have the most current/correct copy of the section(s) of the document which they are viewing. Our approach outperforms existing OT techniques that broadcast messages and compute OT for each operation at all peers. This paper presents our algorithms and simulation results demonstrating the efficiencies and load balancing among peers within the system. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-77220-0_39 | HiPC |
Keywords | Field | DocType |
computational load,p2p document tree management,communication cost,real-time collaborative editing system,causality preservation,algorithms balance,approach minimizes communication cost,document tree,peer-to-peer dynamic tree management,peer-to-peer caching system,ot technique,intention preservation,load balancing,load balance,real time,p2p | Convergence (routing),Broadcasting,Operational transformation,Load balancing (computing),Collaborative editing,Computer science,Cache,Parallel computing,Computer network,Distributed computing | Conference |
Volume | ISSN | ISBN |
4873 | 0302-9743 | 3-540-77219-7 |
Citations | PageRank | References |
1 | 0.37 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jon A. Preston | 1 | 71 | 11.31 |
| Prasad, Sushil K. | 2 | 355 | 46.44 |