BEARdocs

Analysis of transaction throughput in P2P environments.

DSpace/Manakin Repository

Show simple item record

dc.contributor.advisor Speegle, Gregory D. (Gregory David)
dc.contributor.advisor Donahoo, Michael J.
dc.contributor.advisor Gipson, Stephen L. (Stephen Lloyd)
dc.contributor.advisor Green, Gina, 1962-
dc.contributor.author Chokkalingam, Arun.
dc.contributor.other Baylor University. Dept. of Computer Science.
dc.date.copyright 2005
dc.identifier.uri http://hdl.handle.net/2104/3010
dc.description.abstract In recent years P2P systems have gained tremendous popularity. Support of a transaction processing facility in P2P systems would provide databases at a low cost. Extending distributed database algorithms such as 2PC and ROWA to P2P environments might not provide the best performance because the P2P systems are characterized by high site failure rates and an unpredictable network topology. The choice of algorithms in building P2PDB is difficult because of the lack of information about the performance of database algorithms in P2P environments. This thesis analyzes the performance of one such algorithm, the epidemic algorithm against the performance of traditional database algorithms in simulated P2P environments. en
dc.rights Baylor University theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. Contact librarywebmaster@baylor.edu for inquiries about permission. en
dc.subject Peer-to-peer architecture (Computer networks). en
dc.title Analysis of transaction throughput in P2P environments. en
dc.type Thesis en
dc.description.degree M.S. en
dc.rights.accessrights Worldwide access en
dc.contributor.department Computer Science. en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search BEARdocs


Advanced Search

Browse

My Account

Statistics