IETF-71 P2PSIP SEP

423 views

Published on

Published in: Technology, Business
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
423
On SlideShare
0
From Embeds
0
Number of Embeds
3
Actions
Shares
0
Downloads
0
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

IETF-71 P2PSIP SEP

  1. 1. Service Extensible Peer Protocol (SEP) draft-jiang-p2psip-sep-01.txt 71st IETF - Philadelphia, PA, USA P2PSIP WG Meeting Jiang XingFeng [email_address] Carlos Macian Ruiz carlos.macian@upf.edu Victor Pascual Avila victor.pascuala@upf.edu
  2. 2. <ul><li>Introduce SEP distinctive features </li></ul><ul><ul><li>Several features, now focus on Service Discovery </li></ul></ul><ul><li>Contribute in the coming WG Peer Protocol </li></ul>Goals
  3. 3. Service Discovery <ul><li>The distribution of the service capability </li></ul><ul><ul><li>Each peer encodes its service capabilities; </li></ul></ul><ul><ul><li>Each peer advertises the info by using overlay maintenance mechanism; </li></ul></ul><ul><li>Peer’s routing states will keep the service capabilities of its neighbors </li></ul>Transport Address Service Capability Processing Status Other Features Peer ID Associated Features Peer ID Associated Features
  4. 4. Service Discovery <ul><li>If a peer wanting service providers: </li></ul><ul><ul><li>Indicating its desire for a service in a request; </li></ul></ul><ul><ul><li>Intermediate peers will check its routing state for matched peers; </li></ul></ul><ul><ul><li>In the end, the peer gets the info about service providers in the response. </li></ul></ul><ul><li>How to choose the key-ID for the request </li></ul><ul><ul><li>Choose randomly; May try several times; </li></ul></ul><ul><ul><li>How about define a new reserved ID for a random walk </li></ul></ul><ul><ul><ul><li>which indicate to the overlay that the message should be routed around the overlay hop-by-hop until the matched entries are to be found </li></ul></ul></ul><ul><li>We need some experimental data to see how well it works </li></ul><ul><li>A new message LookupServicePeer defined in SEP </li></ul>
  5. 5. Service Discovery <ul><li>Pros and Cons: </li></ul><ul><ul><li>Pros: </li></ul></ul><ul><ul><ul><li>Works in both structured and unstructured algorithms; </li></ul></ul></ul><ul><ul><ul><li>Less maintenance cost: </li></ul></ul></ul><ul><ul><ul><li>Reflect the status change of the peers’ service capability timely (rely on the keepalive message to advertise the status change) </li></ul></ul></ul><ul><ul><li>Cons: </li></ul></ul><ul><ul><ul><li>Success Rate is undertermined </li></ul></ul></ul><ul><ul><ul><ul><li>May try several times before finding the answer; </li></ul></ul></ul></ul><ul><ul><ul><ul><li>Random walk until finding the answer may be a choice. </li></ul></ul></ul></ul>
  6. 6. Comments and Questions?

×