| 摘要 |
<P>PROBLEM TO BE SOLVED: To minimize traffic congestion by reducing end-to-end delay, and maximize the bandwidth available in shared N-tree ALM nodes. <P>SOLUTION: Compared to an MST-based method of constructing source-based trees and applying bias towards the shortest delay path, the N-tree constructing method of the present invention makes it possible to construct N source trees at the same time and allocate bandwidth in a fair manner for each stream. That is to say, in the N-tree constructing method of the present invention, each node (MY, SG, JP, VN) constructs N-trees at the same time based on fair bandwidth and allowed delay requirement. <P>COPYRIGHT: (C)2013,JPO&INPIT |
