Method and apparatus for generating a degree-constrained minimum spanning tree

摘要

A method and apparatus for generating a degree-constrained minimum spanning tree (MST) may include a plurality of point-to-point (P2P) packet switching nodes for receiving and sending data packets; a plurality of point-to-multi-point (P2MP) packet switching nodes for sending and receiving the data packets; and a plurality of transmission links coupling pairs of the plurality of packet switching nodes, where each of the plurality of transmission links has a distance. A path computation module may determine a degree-constrained MST such that each of the plurality of P2P packet switching nodes has a degree of two. An extended Bellman-Ford algorithm successively analyzes each of the plurality of packet switching nodes as a present node and calculates the degree-constrained MST as a function of the distance of each of the plurality of transmission links and whether a previous node from the present node is a P2P packet switching node or a P2MP packet switching node.