• 父子对等组之间的关系


    遇到一个问题:超级结点和边缘结点都加入对等组P
    超级结点在对等组P中启动汇聚服务
    边缘结点连接到超级结点
    此时边缘结点(创建)加入P的子对等组C
    问题:超级结点是否有必要也创建或加入对等组C
    以保证边缘结点在对等组C中的通信
    ————————————————————————————————————————————————
    PeerInfoService
    List<PeerID> getLocalEdgeView()
    ___________________________________________________________________________
    https://www.java.net/node/662222
     

    > So it seems like I manage to connect to the jxta-38
    > Render-Vous peer, thanks for that.
    Correct.
    >
    > However, I have a question left: a peer can become a
    > rendez-vous for a peer group, does it mean that I may
    > loose some capacity to reach rendez-vous peers after
    > the switch from Edge to Rendez-vous (or even to
    > Relay)?
    No. RDVs are scoped per peergroup. This means that
    if you create a sub-peergroup this group can have
    a new set of rendezvous that are indepent of the
    NetPeergroup (root peergroup) RDVs. While your
    peer connect to the sub-group RDVs, it will remain
    connected to the NetPeerGroup RDVs. You can
    explore this within the JXTA shell using the
    chpgrp command to switch the peergroup context and
    check the output of the "rdvstatus" command.

    >In other words, if I want to develop an
    > application relying on JXTA, should I automatically
    > set the configuration of my users to Edge?
    For the NetPeergroup you want to be an
    edge, for the remaining sub-peergoups you should
    let your peer (if you have good connectivity) dynamically
    act as a RDV via the auto-RDV election
    option.

    Hth,

    B.
    >Will they
    > automatically be able to reach any other users for
    > their peer groups from behind any firewall and
    > proxys? If not what is the solution?
    >
    > I apologize if this is a basic question, but I could
    > not find a definitive answer from the JXTA v2.3.x:
    > Java Programmer’s Guide.
    >
    > Thanks !!!

  • 相关阅读:
    NOIP2015 斗地主
    BZOJ 2120: 数颜色
    BZOJ 1014: [JSOI2008]火星人prefix
    BZOJ 4665: 小w的喜糖
    BZOJ 3665: maths
    BZOJ 3270: 博物馆
    BZOJ 1419: Red is good
    【转】二分图的最大匹配
    POJ 3026 Borg Maze(Prim+BFS建邻接矩阵)
    POJ 2485 Highway(Prim+邻接矩阵)
  • 原文地址:https://www.cnblogs.com/cuizhf/p/3166237.html
Copyright © 2020-2023  润新知