紧密耦合系统中的广播模型仍是现代网络系统中讨论的重点之一，现今经常使用的广播模型如传统广播模型及全局表模型都由于没有充分发挥软件的功能而具有较大的局限性．它们要么因存储多张表而不必要地耗费大量的系统资源，要么在一张表上呆板地使用一种预先规定好的路由选择策略而使得该模型的适应性较差并且难于设计．本文提出了一种新的广播模型——智能表广播模型ＩＬＢＭ．在该模型中每一结点都被赋予一个邻结点表与一个结点算法，由结点算法来灵活决定结点在广播过程中对各连接的转发顺序，从而以软件静态形式上的一致实现运行效果的不一致，进而统一邻居表；同时，ＩＬＢＭ中结点算法的引入还增强了网络广播操作的自适应性，能够灵活处理广播源点处于拓扑中不同位置的情况．在整体上，ＩＬＢＭ有效地改善了广播操作的时间性能、系统资源的消耗以及路由算法的设计复杂度．对该模型的实际应用情况，本文讨论了ＩＬＢＭ在一些紧耦合系统常用拓扑结构中的性质，如ｔｒｅ，ｒｉｎｇ，ｇｒｉｄ，ｔｏｒｕｓ，ｈｙｐｅｒｃｕｂｅ及ｄｅＢｒｕｉｊｎ． The broadcast model in the tightly coupled system is still one of the focuses of discussion in modern network systems. The broadcast models that are frequently used today, such as the traditional broadcast model and the global table model, all have great limitations because they do not give full play to the functions of the software. They either require large amounts of system resources unnecessarily for storing multiple tables or rigidly use a pre-defined routing strategy on a single table, making the model less adaptable and difficult to design. This paper presents a new broadcast model - the intelligent table broadcast model ILBM. In this model, each node is given a neighbor node table and a node algorithm, the node algorithm to flexibly determine the node in the broadcast process of forwarding the order of each connection, so as to the software static form of the same So as to realize the inconsistency of operation effect and further unify the neighbor table. Meanwhile, the introduction of node algorithm in ILBM also enhances the adaptability of network broadcast operation and can flexibly handle the situations where broadcast source points are in different positions in the topology. Overall, ILBM effectively improves the time performance of broadcast operations, the consumption of system resources, and the design complexity of routing algorithms. For the practical application of this model, we discuss the properties of ILBM in some commonly used topological structures of tightly coupled systems such as tre, ring, grid, torus, hypercube and de Bruijn.