DIRECTLY PROGRAMMABLE NETWORKS

摘要

A procedure for establishing a scalable spanning tree over a network composed of nodes and links in which the resources for each node are independent of the size of the network. The procedure involves the selection of a set of states, a set of messages, state transition rules as well as a completion rule to thereby detect the setting up of the spanning tree. Once established, data may be distributed over the spanning tree so that coordination of data is maintained over all the nodes in the network.