| Document Date: 2003-07-24 11:26:27
Open Document File Size: 286,80 KBShare Result on Facebook
Company Fiat / / Country Germany / / Currency pence / USD / / / Event Product Recall / Product Issues / / Facility Computer Science Texas A&M University College Station / building DHTs / / IndustryTerm Internet graphs / basic algorithms / search request / Internet graph / Internet culture / peer-topeer networks / real Internet / Law et al. / low-degree networks / butterfly networks / aware peer-to-peer networks / interconnection networks / efficient routing algorithm / analytical tools / graph using breadth-first search / butterfly network / wireless ad-hoc networks / analysis tool / xed-degree networks / structured peer-to-peer networks / wireless networks / / Organization Sai Ganesh Department of Computer Science Texas A&M University College Station / / Person Modeling / Anuj Kumar / Vivek Rai / / Position hB / constant connectivity hB / Network Protocols General / ball expansion hB / / Product Motivation / Minox / Leica DM-1 Digital Camera / / ProvinceOrState New Mexico / / Technology existing protocols / efficient routing algorithm / Peer-to-Peer / routing protocols / same basic algorithms / string-matching algorithm / simulation / peer-to-peer system / Network Protocols / /
SocialTag |
Graph-Theoretic Analysis of Structured Peer-to-Peer Systems: Routing Distances and Fault Resilience Dmitri Loguinov, Anuj Kumar, Vivek Rai, Sai Ganesh Department of Computer Science Texas A&M University College Station,