Back to Results
First PageMeta Content
Network architecture / Chord / Pastry / Gnutella / Tapestry / Routing / Peer-to-peer / Distributed hash table / Koorde / Distributed data storage / File sharing networks / Computing


Efficient Routing for Peer-to-Peer Overlays Anjali Gupta, Barbara Liskov, and Rodrigo Rodrigues MIT Computer Science and Artificial Intelligence Laboratory {anjali,liskov,rodrigo}@csail.mit.edu Abstract
Add to Reading List

Document Date: 2004-03-01 13:48:20

Open Document

File Size: 192,32 KB

Share Result on Facebook

Company

Artificial Intelligence Laboratory / /

/

Event

Person Communication and Meetings / /

IndustryTerm

per-message protocol / open Internet environment / deployed systems / large-scale distributed applications / successive inter-slice communications / hop routing algorithm / lookup algorithms / inter-slice communications / hop protocol / local area networks / Internet measurements / larger networks / hop systems / theoretical optimum systems / lookup algorithm / local processing / large scale systems / /

Organization

MIT / Slice Leader Unit / /

Person

Barbara Liskov / Anjali Gupta / Rodrigo Rodrigues / /

Position

slice leader / leader / representative / ith slice leader / individual slice leader / unit leader / /

Technology

per-message protocol / DNS / one hop routing algorithm / peer-to-peer / one hop protocol / one-hop lookup algorithm / simulation / same protocol / Chord protocol / peer-to-peer system / local area networks / lookup algorithms / routing algorithm / cable modems / /

SocialTag