Traffic route finder in communications network

A method of determining a plurality of routes for a plurality of connections across a network comprising a plurality of nodes and links, each said connection between a source node and a plurality of destination nodes, said method comprising the steps of:

• generating a network representation data of said network, said network representation data describing a plurality of interconnected nodes and links;
• for each said connection generating a plurality of bit representations of intermediate nodes between said source node and said destination nodes;
• for each said connection, evaluating a cost of a set of routes corresponding to one of said intermediate nodes by decoding one of said bit representations as a minimum spanning tree representation;
• for all said connections, evaluating a total cost of all corresponding said routes, from said plurality of costs evaluated for said plurality of minimum spanning trees.

A method of determining a plurality of routes for a plurality of connections across a network comprising a plurality of nodes and links, each said connection having a source node and a plurality of destinations nodes, said method comprising the steps of:

• generating a network representation data of said network, said network representation data describing a plurality of interconnected nodes and links of said network wherein each link is assigned a link cost data;
• for each of said plurality of connections, representing a plurality of routes of said connection as a minimum spanning tree of nodes and links connecting said source node and said destination nodes of said connections;
• for each said connection evaluating a cost of routes represented by said corresponding minimum spanning tree from a plurality of link costs assigned to links of said minimum spanning tree;
• and
• determining a total cost of all said connections from said plurality of costs evaluated for each said minimum spanning tree.