×

Terminal and N-tree constructing method

  • US 8,520,556 B2
  • Filed: 12/26/2008
  • Issued: 08/27/2013
  • Est. Priority Date: 02/08/2008
  • Status: Active Grant
First Claim
Patent Images

1. A terminal apparatus for setting a packet transmission path between nodes in multipoint-to-multipoint communication, the terminal apparatus comprising:

  • a metric collector that, using address information which specifies members participating in the multipoint-to-multipoint communication, measures a bandwidth of a link and a round trip time between the members, and stores measurement results in a metric database;

    an application layer multicast forwarding table constructor that, using the measurement results, forms a packet transmission path (N-tree) between the members, such that bandwidths are equal, and stores the packet transmission path in a server forwarding table;

    an application layer multicast forwarding table distributor that converts the packet transmission path formed by the application layer multicast forwarding table constructor into information including a combination of an incoming port number, a destination address and a destination port number, and reports the information to the members,wherein, during an execution of an N-tree algorithm, the application layer multicast forwarding table constructor;

    orders all members in a N-tree session, based on a specific heuristic rule stored in a heuristic rule database, and prepares an ordered list;

    selects members that have not established links to all the other nodes in the N-tree from a member of the highest order in the ordered list and prepares a rule-based ordered list by ordering the selected members;

    forms a pair of nodes by selecting a member from the highest order in the rule-based ordered list and a member from the ordered list satisfying the specific heuristic rule stored in the heuristic rule database, orders the pair of nodes, and prepares a rule pair node ordered list; and

    selects members satisfying an additional rule stored in the heuristic rule database from a pair of nodes of a highest order in the rule pair node ordered list, and forms the N-trees.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×