1 / 16

PeerNet: Pushing Peer-to-Peer Down the Stack

PeerNet: Pushing Peer-to-Peer Down the Stack. Jakob Eriksson, Michalis Faloutsos, Srikanth Krishnamurthy University of California, Riverside. What is PeerNet. an approach to separate address and identity address reflects the node’s current location identifier remains the same

palmer-maxwell
Télécharger la présentation

PeerNet: Pushing Peer-to-Peer Down the Stack

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. PeerNet: Pushing Peer-to-Peer Down the Stack Jakob Eriksson, Michalis Faloutsos, Srikanth Krishnamurthy University of California, Riverside

  2. What is PeerNet • an approach to separate address and identity • address reflects the node’s current location • identifier remains the same • a p2p-based network layer for large networks • an alternative to the IP layer

  3. PeerNet Goals • targeting large, wireless and mobile networks • emphasis on mobile nodes and p2p interactions • minimizing the need for manual configuration • favoring distributed and p2p solutions instead of centralized solutions and node specialization • localizing control overhead

  4. ...and Challenges • while location-based addressing simplifies routing, new challenges are created: • consistent dynamic address allocation • efficient node lookup service for finding addresses for given identifiers => the project proposes distributed solutions

  5. PeerNet Network layer (1/2) • dynamic addressing, depending on the node’s current location in the network • addresses organized as a binary tree • selecting addresses so that locality of communication is guaranteed (subtree/area)

  6. PeerNet Network Layer (2/2) • Area invariant • all nodes belong to a nested sequence of areas, one of each level • all nodes within an area share a unique address prefix • l bit addresses  l area levels • violating node resigns & rejoins • Three major parts of the network layer • address allocation • routing • node lookup

  7. Address Allocation in General • addresses assigned dynamically, preserving the invariant • goals: • balancing the tree & effective utilization of address space • good physical connectivity within an area • improving scalability & minimizing control overhead

  8. Address Allocation: Joining the Network • physical connection • requesting address • registering to node lookup service • moving node => new request & registration

  9. Address Allocation: Details • each node controls a range of addresses • responding node splits its range in half • joining node gets the lower half • joining node’s address is the lowest address in that range • nodes get evenly distributed in the address space

  10. Address Allocation: Challenges • 1. Keeping the tree balanced • local congestion leads to address unavailability • solution: proactively migrating nodes • 2. Maximizing intra-area connectivity • solution: nodes within an area have to be well-connected by physical links => improves routing performance and tolerance to link failures, desirable in mobile networks

  11. Routing • sender only needs to know the identifier of the receiving node • address provided by the lookup service • packets include both the identifier and last known address • address rechecked along the route if necessary

  12. Routing: Details routing one level at a time each step takes closer to destination in both topology and address tree • a distance vector type approach: • each node has l=log N entries, one for each level • each entry stores the next hop to corresponding sibling subtree • destination address compared to node address bit by bit, MSB first, packet then forwarded to corresponding sibling subtree

  13. Node Lookup Service (1/3) • distributed node lookup for finding addresses for given node identifiers • Storing lookup entries (id, addr) • choosing a node with minimum xor-distance (address XOR identifier) • Challenges • node movement => address change => lookup entries need to be updated or moved

  14. Node Lookup Service (2/3) • Solutions: • Preserving locality of lookups • multiple locations for lookup tables, chosen so that local queries get local answers • iterating from local scope to larger subtrees • Creating locality of updates • moving nodes change their low bits more often • storing LSB locally and MSB in remote nodes • remote nodes need less updating • MSB found first, query then forwarded to corresponding area

  15. Node Lookup Service (3/3) • Communication abstractions • identifier mapping to multiple addresses • effective implementation of multicast/anycast For example: • multicast group id & group of receiving nodes • service id & group of providing nodes

  16. Further Directions of the Project • security • performance issues • tree balancing and local connectivity • portability • leveraging various infrastructures • tunneling through the Internet to connect PeerNets • interconnection with Internet nodes • TCP/IP emulation on PeerNet nodes • actual data / results / comparison ?

More Related