Re: [p2p] Direct Connections
From: Geogy Samuel [MSFT] (geogys_at_online.microsoft.com)
Date: 03/23/04
- Next message: Scott Senkeresty [MSFT]: "Re: [p2p] PNRP Identities and Routing."
- Previous message: Oren: "RE: local area network"
- In reply to: Jay: "Re: [p2p] Direct Connections"
- Next in thread: Geogy Samuel [MSFT]: "Re: [p2p] Direct Connections"
- Messages sorted by: [ date ] [ thread ]
Date: Tue, 23 Mar 2004 12:19:47 -0800
Hey Jay,
I might not have been very clear the first time. But the way Direct
connections work is that the originating node establishes a brand new TCP
connection with the destination node. And this connection (which is direct)
is independent of the graph (neighbor) topology.
Please let me know if you have any other questions.
Geogy
-- This posting is provided "AS IS" with no warranties, and confers no rights. "Jay" <no_spam@spam.com> wrote in message news:%23BeFlTtCEHA.580@TK2MSFTNGP11.phx.gbl... > Hi, > > Sorry I'm replying on this thread instead. The other thread seems to have > been killed on the server I have posting access too (that's why there are > two posts :-)). > > Is there anyway I can get further information on the technical side of this > subject, like how the address switching is achieved and what underlying > protocols are used UDP + TCP etc, etc. > > I am interested in the efficiency of the neighbour tunnels. For example if I > understand correctly, for each direct connections the data with have to be > physically addressed to the next hop (neighbour) first, and sent with enough > additional information to provide the receiving node the ability to forward > the data to the final destination and be made aware of the original source. > Therefore if you form a direct connection to your neighbour this additional > information is not strictly necessary, so is it removed in this case or left > for simplicities sake? > > Thanks, > > Jay. > > > Hey Jay, > > > > Direct connection data is sent over the P2P Graph (neighbor connection) in > > the form of messages (not records, that are stored in the database). The > > advantage of using Direct Connections is that the connection will not be > > torn down even though Graph Maintenance decides that the link between the > 2 > > nodes are not very useful. > > > > Geogy > > "Jay" <no_spam@spam.com> wrote in message > news:uSGfvFTCEHA.2600@TK2MSFTNGP09.phx.gbl... > > I have a question about the way that direct connections in the p2p api > > works. > > > > I have read the white paper and API and I'm still unsure. Are 'Direct > > Connections' (PeerGraphOpenDirectConnection) physical IPv6 layer routed so > > that they are much the same as a standard v6 socket. Or is the direct > > connection data routed through the p2p graph like records are (where the > > data is pushed onto the transparent neighbour connections along with an > > final destination addr and then routed from peer node to peer node until > it > > reaches a suitable destination)? > > > > I know I could apply my own routing logic to do it either way, by finding > > the IPv6 addr or enumerating neighbour connections, I just want to know > how > > it is actually done. > > > > Thanks a lot. > > > > Jay. > > > > > >
- Next message: Scott Senkeresty [MSFT]: "Re: [p2p] PNRP Identities and Routing."
- Previous message: Oren: "RE: local area network"
- In reply to: Jay: "Re: [p2p] Direct Connections"
- Next in thread: Geogy Samuel [MSFT]: "Re: [p2p] Direct Connections"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|