LOGICAL TOPOLOGY AND ADDRESS ASSIGNMENT FOR INTERCONNECTED DIGITAL NETWORKS

摘要

A method of designing a network results in a network with an efficient addressing scheme which allows for filters to perform a simple logical operation. The process begins by arranging a plurality of nodes connected by a plurality of bi-directional links in a tree topology. Each node is assigned a range of consecutive flow process addresses such that each packet carried in a first direction on one of the bi-directional links has an address within the range A < X < B and each packet carried in a second direction on the same bi-directional link has an address within the range A < X < B.