Terminal and N-tree constructing method
First Claim
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.
1 Assignment
0 Petitions
Accused Products
Abstract
A terminal apparatus minimizes traffic congestion by reducing end-to-end delay and maximizes the bandwidth available in shared N-tree ALM nodes. In this terminal apparatus, an optimal stream path information table stores N-tree session information for all nodes. A server forwarding table stores bandwidth-fair ALM route information for all nodes in a specific N-tree session. An ALM forwarding table constructor updates N-tree session information stored in an optimal stream path information table using network metrics and heuristic rules stored in a heuristic rule database, executes ALM_N-tree algorithm using updated N-tree session information, and thereby generates bandwidth-fair ALM route information.
-
Citations
10 Claims
-
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 Dependent Claims (2, 3, 4, 5, 6)
-
-
7. An N-tree construction method comprising:
-
ordering application layer multicasting members in an initial list with reference to metric collector information and group membership information for all nodes; ordering the members of the initial list in an ordered list based on a first heuristic rule, for all nodes in N trees; selecting members from the ordered list satisfying a link connection status with respect to other nodes in the N-trees based on a second heuristic rule and ordering the members in a rule-based ordered list for each N-tree; selecting, from the members of the rule-based ordered list and the members in the initial list, two members having a logical connection satisfying a third heuristic rule as a node pair and ordering node pairs in the rule-based pair list; selecting, from node pairs in the rule-based pair list, members satisfying a fourth heuristic rule; forming an N-tree of a root node selected from the initial list, for all receiving nodes in a group based on a fifth heuristic rule; assuring connection of all links between nodes of a specific N-tree; assuring all nodes in the specific N-tree based on nodes of the initial list included in a N-tree configuration; and assuring all of the N-trees, based on the nodes of the initial list included in a plurality of N-tree configurations. - View Dependent Claims (8, 9, 10)
-
Specification