WO2001038951A2 - A method and system for circumscribing a topology to form ring structures - Google Patents

Abstract

A method and system for ordering an interconnect topology to form a ring structure, the topology forming a looped bus bridge topology (600), comprising a number of nodes, described. In one embodiment, a self identifier (612) for each of the nodes is determined. Further, the self identifier is mapped to a ring identifier (602) for each node. In addition, each node computes the ring identifier of one of its port-connected nodes as its topologically adjacent neighbor identifier (625).

Description

A METHOD AND SYSTEM FOR CIRCUMSCRIBING A TOPOLOGY TO FORM RING

STRUCTURES

This application claims benefit of U.S. Provisional Application No. 60/167,958 filed November 29, 1999.

FIELD OF THE INVENTION The present invention relates generally to audio, video, and audio /video interconnected systems for home and office use. In particular, the present invention relates to circumscribing a topology of audio, video, and audio /video interconnect systems to form ring structures.

BACKGROUND OF THE INVENTION With the development of consumer electronic audio /video (A/V) equipment, and the advance of digital A/V applications, such as consumer A/V device control and signal routing and home networking, various types of data in various formats can now be transferred among several audio /video control (AV/C) devices via one digital bus system. However, many current systems do not have sufficient bandwidth resources to transfer and display all the different types of data at the same time.

Typical computer systems solve the bandwidth problem by increasing the bandwidth of the system bus to handle all of these forms, types and amount of data. As a result, as users request more types of information such as in multimedia applications, the system bus has become more clogged with information other than information directly utilized and needed by the main processor.

Many computer systems incorporate at least two buses. A first bus, commonly referred to as a memory bus, is typically used for communications between a central processor and a main memory. A second bus, known as a peripheral bus, is used for communications between peripheral devices such as graphics systems, disk drives, or local area networks. To allow data transfers between these two buses, a bus bridge is utilized to "bridge" and thereby couple, the two buses together.

One example of a high-speed bus system for interconnecting A/V nodes, configured as a digital interface used to transport commands and data among interconnecting audio/video control (AV/C) devices, is the IEEE 1394 standard serial bus implemented by IEEE Std 1394-1995, Standard For A High Performance Serial Bus, August 30, 1996 (hereinafter "IEEE 1394 standard") and other related 1394 standards.

The IEEE 1394 standard is an international standard for implementing a high-speed serial bus architecture, which supports both asynchronous and isochronous format data transfers. The IEEE 1394 standard defines a bus as a non-cyclic interconnect, consisting of bus bridges and nodes. Within a non- cyclic interconnect, devices may not be connected together so as to create loops. Within the non-cyclic interconnect, each node contains an AV/C device, and bus bridges serve to connect buses of similar or different types.

The primary task of a bridge is to allow data to be transferred on each bus independently without demonstrating performance of the bus, except when traffic crosses the bus bridge to reach the desired destination on the other bus. To perform this function, the bridge is configured to understand and participate in the bus protocol of each of the buses.

Multi-bus systems are known to adequately handle large amounts of information. However, communication between buses and devices on different buses is difficult. Typically, a bus bridge may be used to interface I/O buses to the system's high-performance processor /memory bus. With such I/O bridges, the CPU may use a 4-byte read and write transaction to initiate DMA transfers. When activated, the DMA of a serial bus node generates split-response read and write transactions which are forwarded to an intermediate system backbone bus that also implements serial bus services.

Depending on the host system design, the host-adapter bridge may have additional features mandated by differences in bus protocols. For example, the host bus may not directly support isochronous data transfers. Also, the host- adapter bridge may enforce security by checking and translating bridge-bound transaction addresses and may often convert uncached I/O transactions into cache-coherent host-bus transaction sequences.

Each time a new device or node is connected or disconnected from an IEEE 1394 standard serial bus, the entire bus is reset and its topology is reconfigured. The IEEE 1394 standard device configuration occurs locally on the bus without the intervention of a host processor. In the reset process, three primary procedures are typically performed; bus initialization, tree identification, and self identification. Within the IEEE 1394 standard, a single node must first be established as the root node during the tree identification process in order for the reconfiguration to occur.

SUMMARY OF THE INVENTION A method and system for ordering an interconnect topology to form a ring structure, the topology comprising a number of nodes, are described. In one embodiment, a self identifier for each of the nodes is determined. Further, the self identifier is mapped to a ring identifier for each node. In addition, each node computes the ring identifier of one of its port-connected nodes as its topologically adjacent neighbor identifier.

BRIEF DESCRIPTION OF THE DRAWINGS Features and advantages of the present invention will be apparent to one skilled in the art in light of the following detailed description in which: Figure 1 is a block diagram of one embodiment for an interconnect topology;

Figure 2 is a block diagram of a device of Figure 1;

Figure 3 is a block diagram of one embodiment for a 1394 standard bus bridge system;

Figure 4 is a block diagram of one embodiment for a 1394 bus bridge topology;

Figure 5 is a block diagram of one embodiment for a looped bus bridge topology;

Figure 6 is a block diagram of one embodiment for bus bridge components;

Figure 7 is a block diagram of one embodiment for a next-neighbor ordering topology;

Figure 8 is a block diagram of one embodiment for a portal-to-portal net refresh message path topology;

Figure 9 is a block diagram of one embodiment for a net refresh message path topology during the addition of a node;

Figures 10 and 11 are block diagrams of one embodiment illustrating a purging net refresh; /

Figures 12, 13, and 14 are block diagrams of one embodiment for a secondary bus reset after node detachment;

Figure 15 is a block diagram of one embodiment for an interconnect broadcast topology;

Figure 16 is a flow diagram of one embodiment for ordering a topology of nodes to form a ring structure;

Figure 17 is a flow diagram of one embodiment for refreshing an interconnect topology;

Figure 18 is a flow diagram of one embodiment for message broadcast flow control on a bus bridge interconnect; and Figure 19 is a flow diagram of one embodiment for a multi-phase net reset on a bus bridge interconnect.

DETAILED DESCRIPTION

A method and system for ordering an interconnect topology to form a ring structure, the topology comprising a number of nodes, are described. In one embodiment, a self identifier for each of the nodes is determined. Further, the self identifier is mapped to a ring identifier for each node. In addition, each node saves the ring identifier of one of its port-connected nodes as its next neighbor identifier.

In the following detailed description of the present invention, numerous specific details are set forth in order to provide a thorough understanding of the present invention. However, it will be apparent to one skilled in the art that the present invention may be practiced without these specific details. In some instances, well-known structures and devices are shown in block diagram form, rather than in detail, in order to avoid obscuring the present invention.

Figure 1 is a block diagram of one embodiment for an interconnect topology 100. Referring to Figure 1, server 102 is connected to a wide area network (WAN) 110 and to a bus bridge 170. The bus bridge is interconnected to a number of audio, video, and/or audio/video devices, 120, 130, 140, 150, and 160. In one embodiment, the devices (120-160) are connected to bus bridge 170 via the IEEE 1394 standard serial bus. Server 102 may be any device that is capable of connection to both a bus bridge 170 and wide area network 110, such as, for example, a personal computer or a set-top box. In one embodiment, network 110 may be a wide area network, such as, for example, the Internet, or a proprietary network such as America Online®, CompuServe®, Microsoft Network®, or Prodigy®. In addition, WAN 110 may be a television communications network. Server 102 includes a network interface which communicates with WAN 110. Topology 100 includes high speed serial bus 180a and 180. In one embodiment, serial bus 180 is the IEEE 1394 standard serial bus. Topology 100 includes various consumer electronic devices 120-160 connected via the high speed serial bus 180 to bus bridge 170. The consumer electronic devices 120-160 may include, for example, a printer, additional monitor, a video camcorder, an electronic still camera, a video cassette recorder, digital speakers, a personal computer, an audio actuator, a video actuator, or any other consumer electronic device that includes a serial interface which complies with a serial interface standard for networking consumer electronic devices — for example, the IEEE 1394 standard. Topology 100 may be contained within a home or office. Bus bridge 170 is used to connect devices 120-160 in which devices 120-160 may be physically located within different rooms of the home or office. Although the original IEEE bus standard is designed for use with a cable interconnect, any communication media may be used such as radio frequency (RF) communication or the like.

Figure 2 is a block diagram of a device 120. Referring to Figure 2, device 120 may be a laser printer, digital camera, set-top box, or any other appropriate consumer electronic device capable of being connected via a high speed serial bus 180. In one embodiment, the device 120 includes a controller 202, memory 208, and I/O 210, all connected via bus 215. Memory 208 may include, for example, read only memory (ROM), random access memory (RAM), and/or non-volatile memory. I/O 210 provides connection with wide area network 110, bus bridge 170, and another peripheral device (130-160).

In one embodiment, I/O 210 is a serial bus interface that complies with a serial interface standard for networking with consumer electronic devices (120- 161) and bus bridge 170 within topology 100. For example, the serial bus interface and topology 100 may use the IEEE 1394 standard serial bus. I/O 210 provides for receiving signals from and transmitting signals to other consumer electronic devices (130-160) or bus bridge 170. Memory 208 provides temporary storage for voice and data signal transfers between outside network 110 and topology 100. In addition, memory 208 may buffer digital voice and data signals received by I/O 210 from WAN 110 before signals are transmitted onto IEEE 1394 standard bus 180.

Controller 202 controls various operations of device 120. Controller 202 monitors and controls the traffic through the device 120 to and from topology 100 and WAN 110.

Device 120 I/O 210 may have one or more physical ports. A single port device discontinues the bus along the given branch of the bus, whereas devices with two or more ports allow continuation of the bus. Devices with multiple ports permit a daisy chained bus topology, even though the signaling environment is point-to-point. That is, when a multi-port node receives a packet of data, the data is detached and retransmitted to the necessary port as indicated within the data. The configuration is performed dynamically as new devices are attached and/or removed from bus 180.

The 1394 standard bus protocol is designed to support peer-to-peer transfers between devices. This allows serial bus devices to transfer data between themselves without intervention from a computer system or host system. This allows high throughput between devices without affecting the performance of the computer system. Thus, a video camera may be set up to transfer between itself and a video cassette recorder without accessing a computer system.

Figure 3 is a block diagram of one embodiment for a 1394 standard bridge bus system 400. Referring to Figure 3, system 400 includes bridge 402 which connects two or more buses 408 and 410. Bus 408 and 410 may be the same or different types of buses. For example, bus 408 may be a 1394 standard serial bus and bus 410 may be a different high performance bus. The 1394 standard bus architecture limits the number of nodes or devices 310 on a bus 263 and supports multiple bus systems via bus bridge 402. The control and status register (CSR) architecture, ISO/IEC 13213 (ANSI/IEEE 1212), Information systems-Control and Status Registers (CSR) Architecture Microcomputer Buses, defines the 1394 standard bus addressing structure, which allows approximately 2¹⁶ nodes (404, 406, 412-420). The CSR standard defines their registry, their functionality, and, where appropriate, where they appear in the address space.

Figure 3 is the simplest instance of a bus topology in which the net has one bus bridge. Figure 4 illustrates a net that may have more than one bus bridge and, when so structured, is hierarchical in nature. Figure 5 illustrates a network whose physical topology may have loops, but whose loops are electronically disabled to generate a hierarchical structure. In the description that follows, a collection of multiple buses connected through a bus bridge is referred to as a "net".

Figure 4 is a block diagram of one embodiment for a 1394 bridge bus topology 500. Referring to Figure 4, topology 500 has one prime portal 504 and one or more alpha portals 506 and 508. The primary bus 525 has exactly one prime portal 504 and the secondary buses 527, 529, 531, 533, and 535 have exactly one alpha portal each — 506, 508 and 510. Each bus 525-535 may have any number of secondary portals. An alpha portal is on the path to a prime portal. Any portal not a prime portal or an alpha portal is a secondary portal. The prime portal or the alpha portal may be referred to as a primary portal.

Within an interconnect topology 500, the bridge portal with the largest portal ID identifier is elected to become the prime portal 504. In an alternate embodiment, the bridge portal with the smallest portal ID identifier is elected to become the prime portal 504. Each portal appears as a node on its attached bus. The bus with the prime portal 504 is termed the primary bus 525 and other buses 527-535 are termed secondary buses. On secondary buses 527-535, the bridge portal that leads to the primary bus 525 is called the alpha portal (506, 508). After a bridge bus interconnect is configured, any node within the interconnect may be accessed by its unique 16-bit node identification address. The node identification address contains the bus ID and the local ID components. Referring to Figure 4, the bus identification IDs of nodes 512-524 are indicated by the letters a, b, and c and the local ID is indicated by the numbers 0-4.

Alpha portal 504 is responsible for rejecting missed address asynchronous data packets by accepting these requests and returning error reporting responses. The previous and current prime and alpha portal identifiers are used to classify nodes when an interconnect topology changes, and the alpha portal is the isochronous clock reference for other nodes on the bus.

Bus bridge topology 500 may change and be established dynamically during operation of bus bridge system 500. In one embodiment, the bus bridge topology 500 is established during net refresh. Within topology 500, portals selectively route packets. Asynchronous routing tables are stable until topology 500 changes during a net refresh or net reset operation. Asynchronous routing tables are dynamic and are changed by their asynchronous connect and disconnect operations of the protocols.

Figure 5 is a block diagram of one embodiment for a looped bus bridge topology 600. Referring to Figure 5, during node 300 addition, portal 606 may be added to the topology 600 forming a loop. Thus, a path exists from a0-b4 through cO back to aO. During initialization, the redundant portal 606 is disabled so that a hierarchical bus bridge topology remains.

In an alternate embodiment, cyclical net topologies may be allowed. In this alternate embodiment, software routines may partially activate the redundant bridge 606 and allow a shortest path routing between nodes. For example, traffic between bus a 605 and bus c 615 may be efficiently routed without introducing deadlocks.

Figure 6 is a block diagram of one embodiment for bus bridge components 700. Referring to Figure 6, bus bridge components 700 are maintained within each portal in which bus "a" to bus "b" components 702 and bus "b" to bus "a" components 704 are independently maintained. Components 700 also contains shared microprocessor and RAM 706.

Asynchronous and isochronous packet transfers may not acquire a bus at the same time. Therefore, asynchronous packets are placed in request queues 708, 720 and response queues 710, 722. The asynchronous packets are selected for transfer at times when isochronous packets are not being transferred. Isochronous packets are received and time stamped 712, 724. Time gates 718, 730 release the isochronous packets 714, 726, together with common isochronous packet (CIP) headers 716, 728, at fixed times. Routing tables select which asynchronous and isochronous packets are accepted and queued for adjacent bus delivery.

Topologies may share physical buffer space rather than implementing physical distinct stacks subject to the following: bus "a" to bus "b" and bus "b" to bus "a" queues operate independently, response processing is never blocked by queued requests, and asynchronous subactions and isochronous packets are forwarded independently. Topologies may block a request behind the previously queued response without generating potential deadlocks; however, requests and responses are processed independently.

Isochronous routing decisions are made by checking the isochronous packet's channel number. Accepted packets are converted and retransmitted on the adjacent bus with newly assigned channel numbers, speeds, and CIP-header and, when a CIP-header is provided, time-stamp parameters 716, 728 from the CIP-header. CIP-headers may be pre-appended to some isochronous packets to further describe their format and function and desired presentation time. When the packets incur delays while traversing through a bridge, then presentation time must be adjusted to compensate for this delay. CIP headers are defined in ISO/IEC 61883 specification. Isochronous packets received in cycle n are forwarded to the adjacent bus in cycle n+k where k is an implementation dependent constant. Messages may be passed around one bus or pass through a bridge by writing to a standardized message location 732, 734, 736, 738 on a bridge's portal. This allows bus-interconnect topologies to be restored while freezing, or discarding when necessary, previously queued subactions.

Distribution of clock-sync information 740, 742 from the primary-bus source is performed by placing calibration information in isochronous-clock pseudo queues before forwarding this information to the clock master on the adjacent portal. In one embodiment, clock-sync information flows from the primary bus downward, so that only one clock-sync pseudo queue may be required.

In support of bus bridges, each node has two node ID addresses: physical ID address and virtual ID address. A physical node ID has a 3FF₁₆ valued bus ID; a virtual node ID has smaller bus ID addresses. In the absence of bus bridges, all nodes are accessed through their physical addresses. In the presence of bus bridges, the physical address is used to configure the node and the virtual address is normally used thereafter.

Directed-asynchronous routing decisions are made by checking the destination ID addresses of pass-through packets. Accepted packets are directly routed to the bridge's opposing port. In addition, an asynchronous quarantine is maintained which selectively enables forwarding of a request sub-action based on the local identification of a bus-local requester. A set of legacy bits identifies local nodes which requires specific processing of sourced requests and returning responses.

Figure 7 is a block diagram of one embodiment for a next-neighbor ordering topology 1000. Referring to Figure 7, topology 1000 contains a number of nodes 1002, 1004, 1006, 1008, and 1010. Each node 1002-1010 is defined by a relative ring identification (ringID) value made up of the bus identification (busID) and physical identification (phylD) portions. Each node 1002-1010 defines its next neighbor by the relative ringID values in which each node derives the ringID value from the observed self identification (selfID) packets. In one embodiment, a mapping is applied to selflD (packets) in order to arrive at a phylD to ringID mapping. During the self-identify process, each node uniquely identifies itself (selflD), maps its selflD to ringID, and uses its ringID to communicate with its topologically adjacent node.

In one embodiment, the assignment of ringID values is based on a conceptual routing of signals through a node's ports. Using node C 1006 as an example, port[a] 1022 identifies physical port 0, port[b] 1024 identifies physical port 1, and port[c] 1020 identifies physical port 2. Ports 1020-1024 have an implied internal ordering as follows: port[a].in → port[b].out 1040 port[b].in → port[c].out 1042 port[c].in → counter → port[a].out 1044

In one embodiment, each node 1002-1010 assigns conceptual ringID values to the other nodes, starting with ringID = 0 on its own portfa] 1022 output. The ringID values are assigned by logically tracing a path through other physical ports, incrementing the ringID when logically passing through the port[a] 1022 output.

The bus itself defines protocols for sending selflD packets for purposes of assigning unique phylDs to each of the attached nodes. Although phylDs are guaranteed to be unique, they are not guaranteed to be the same if the bus is reset again. Thus, there is a need for defining ringlDs which do not change unless the cable topology actually changes.

This assignment strategy always yields the same next-neighbor selections, despite changes in the selected-root assignment or a change in the root node. Thus, in the example shown in Figure 7, node B 1004 determines that node C 1006 is its next neighbor, node C 1006 determines that node D 1008 is its next neighbor, node D 1008 determines that node E 1010 is its next neighbor, node E 1010 determines that node A 1002 is its next neighbor, and node A 1002 determines that node B 1004 is its next neighbor. The topology, rather than the physical nodes, is traced by following paths 1030, 1032, 1034, 1036, and 1038 from a port to its next neighbor, and any node 1002-1010 may be used as the root.

Figure 8 is a block diagram of one embodiment for a portal-to-portal net refresh message path topology 1100. A net refresh is used to assign unique busIDs to each node in the system. Referring to Figure 8, the communication protocols for net refresh involve the sending of messages from each portal 1108, 1110, 1112 to its neighbor in a daisy-chained fashion. In one embodiment, these responseless write messages are idempotent, so that missing-ack failures may be simply and safely retried (e.g. multiple writes have the same effect as one write).

A net refresh is typically triggered by a bus reset. After the bus reset completes, each portal 1108, 1110, 1112 sends messages to its next neighbor, allowing messages to flow in a circular direction. Thus, the topology-dependent, root-independent portal ordering is available after bus reset. This allows each portal 1108-1112 to circulate messages by sending them in a next-neighbor ordering.

In the example shown in Figure 8, portal 1108 first sends a message via path 1102 to portal 1112, portal 1112 then sends a message via path 1104 to portal 1110, and finally, portal 1110 sends a message via path 1106 to portal 1108. In this context, "next" means the portal with the next larger ringID assignment.

In one embodiment, a 2-bit precedence is pre-appended to the portal's 64- bit extended unique identifier (EUI) to generate a stable refresh identifier (refreshlD). The prime portal's EUI also serves as the context identifier for bridge routing tables. The refreshlD allows topology 1000 to specify prime-portal preferences. To coordinate activities when resets occur on multiple buses, a prime portal is selected to coordinate the net refresh activities. In any net, the local-bus portal with the largest refreshlD is selected to become the net's prime portal. Write messages that incur errors or busy indications are immediately retried until successful. Confirmations are provided by allowing these write messages to circulate through other portals until they return to the origin portal. The constant sending of these responseless write messages ensures their successful completion without mandating special fault-retry protocols. The circular nature of the communication allows the originator of these write messages to verify their completion. Such communications are sufficient for reliable broadcasts, but are more flexible because write payloads may be modified as they pass through connected portals.

In one embodiment, a bus reset may occur when a new node is attached to the net. The bus reset has the effect of invalidating the bus ID address contained within the node ID registers of local portals, which effectively isolates them from the remaining portion of the net. A net refresh acquires a new bus number for the reset bus without affecting the busID addresses or routes of other portals.

A net refresh starts with messages sent between local bus bridge portals. A prime-portal is selected to coordinate the net refresh operation. Each node sends acquisition messages to its next neighbor, and these messages initially contain refreshlD (a prime-portal selection identifier). Each candidate portal monitors incoming refreshlD values and changes to a subservient portal when a larger refreshlD is observed. In one embodiment, the largest refreshlD value eventually circulates to all local portals, as illustrated by Figure 8. In alternate embodiments, other refreshlD values may be used to determine the prime-portal. The acquisition message supplies the refreshlD, as well as a bus Count and portal Count.

The portal Count value in the acquisition messages is incremented when passing through the portals. This ensures the eventual demise of rogue resets, by allowing them to be aged until dead. Reset messages are sent periodically, once each arbitration interval, until the net refresh completes. In the absence of continuous messages, portals time out and attempt to become prime portals.

The net refresh eventually forms a spanning tree by circumscribing the paths through bus bridge portals 1108-1112. Each portal communicates with its adjacent neighbor by writing messages into a standardized control and status register (CSR) location. During the final state of a net refresh, the portal-to- portal messages flow in the direction of paths 1102, 1104, and 1106.

At the conclusion of the net refresh, each node has a net-unique nodelD consisting of busID and locallD components. A node's locallD equals its phylD. In addition, each portal has a distinctive portal identifier (portallD) that may be used to navigate through the topology.

In one embodiment, a net-changed indication is broadcast to all nodes during a net refresh. As no packets are corrupted if this notification is ignored, the system is not compromised by these unconfirmed broadcast indications. This event notification allows nodes to determine when bus numbers have changed or when audio/video (AV/C) controller reconnections are required. AV/C protocols are used to establish, monitor, and release isochronous connections as required. The net-changed event is bus-local and is sent during net refresh. Since all portals are communicating with others during net refresh, the coordination of these bus-local resets comes out of the net-refresh sequencing. During the net refresh, each of the dominant (prime or alpha) portals is responsible for distributing the net-changed event indication to locally attached secondary portals.

One of the reasons for invoking a net refresh is to resolve inconsistent or ambiguous non-local isochronous resource allocations. The listener and talker proxies assume this obligation, allowing resources to be reclaimed (or lost) in a timely fashion.

A net refresh refers to the sequence of actions that assign busID addresses and establish the bus bridge routing tables. The term net refresh is used because the effects of a net refresh on the bridge portals within the net are similar to, but less disruptive than, the effects of a bus reset on the nodes attached to the bus.

In one embodiment, the net refresh maintains the previous busID assignments, bridge portal routing tables, established isochronous channels, and queued subactions.

A configuring net refresh (often abbreviated as configuring refresh) has the effect of assigning non-conflicting busID addresses to each of the attached buses. When busIDs conflict, either with a currently assigned busID or a DIRTY (previously assigned) busID, new FREE busIDs are assigned.

As an example, a configuring refresh occurs on the surviving portion of a severed net (assuming that a sufficient number of FREE-state busIDs remain).

A cleansing net refresh (often abbreviated as "cleansing refresh") has all of the properties of a configuring refresh and (in addition) initiates the DIRTY- to-FREE recycling of stale busIDs by setting quarantines in each bus-bridge portal. After the quarantines have been set, the portal can recycle DIRTY busIDs after a time delay of T_dirt. The T_dirl value is the maximum time a transaction can remain queued before parsing of the bus bridge.

A cleansing refresh is typically performed when the number of DIRTY busIDs exceeds the number of FREE busIDs. The intent is to recycle the DIRTY busID states, to avoid the invocation of a more disruptive purging net refresh. A net refresh is also invoked on the victim portion of a severed net, to reduce the disruption of survivor subnet buses when the victim and survivor sub-nets are reconnected.

A purging refresh is performed when the number of desired busIDs exceeds the number of FREE busIDs. Although a cleansing refresh would eventually change busIDs from DIRTY-to-FREE, the purging refresh avoids the delay associated with the cleansing-refresh recycling process.

Since bus bridges may have previously-queued transactions with DIRTY- state busID addresses, these queues are purged. This occurs quickly and without timeout-related delays, with the disadvantage of disrupting currently-active transactions.

During the net refresh, nodes communicate the parameters related to in T_dlrt in net refresh messages so as to compute the worst case values. The maximum number of hops, N, between any requester and any responder is also computed and distributed to portals during net refresh.

Figure 9 is a block diagram of one embodiment for a net refresh message path topology 1200 during the addition of a node. Referring to Figure 9, topology 1200 consists of prime portal 1202, alpha portals 1204, 1206, 1208, primary bus 1232, secondary buses (1238, 1234, and 1236), existing nodes (1210, 1212, 1216, 1218, 1220, 1222, 1224, 1226) and a node to be attached 1214.

"Net refresh" refers to the sequence of actions that assigns bus identification addresses and establishes the bus bridge routing tables. The term refresh is used because the effects of a net refresh on the bridge portals in the net are similar to, but less destructive than, the effects of a bus reset on the nodes attached to the bus. Whenever possible, the net refresh maintains the previous bus identification assignments, bridge portal routing tables, establish isochronous channels, and queued sub-actions. A net initialization established the spanning tree as described above for the topology and assigns non- conflicting busIDs.

In one embodiment, three forms of net initialization may be specified: 1) net refresh, which assigns new busIDs, 2) net restart, which is a net refresh plus delayed busID recycling quarantine overhead for recently active requesters, and 3) net reset, which is a net refresh plus immediate busID recycling and transaction termination for currently active transactions. During bus resets, each bridge portal is assumed to be aware of the bridge portal next neighbor with the next larger ringID address as described above. In this embodiment, local daisy chain sequences are possible. For example, portal A sends messages to portal B, portal B sends messages to portal C, and portal C returns messages to portal A. A net refresh may occur when a new node 214 is added to the topology 1200. In one embodiment, a net refresh configures a primary bus 1232 with one primary alpha portal 1202. Other secondary buses (1238, 1234, and 1236) and one alpha portal 1204 are also configured during a net refresh.

Net reset is a multi-phase operation, as discussed in reference to Figures 10 and 11 below. In one embodiment, the net reset is accomplished in three stages: the acquire stage, the breach stage, and the commit stage. The initial acquire and breach phases select the prime portal and detect addressing conflicts, while the final commit phase assigns busID assignments, establishes routing tables, and, when necessary, purges asynchronous bridge queues. During the acquire phase, periodic acquisition messages are distributed to other bus local portals. During the breach phase, the acquired portals sequentially extend their acquisitions to adjacent buses. During the commit phase, the prime portal sends commit messages, allowing bus numbers and routing tables to be updated.

Referring to Figure 9, the addition of node 1214 may invoke a net reset. The net reset invalidates local busID assignments and all reset portals (1202, 1204, and 1206) become prime portal candidates. Each reset portal 1202-1206 attempts to restore its own invalid busID addresses and disables pass-through traffic. In an alternate embodiment, reset portals 1202-1206 may allow local traffic and some amount of pass-through traffic.

During a purging net refresh, topology 1200 is left in a known initial state. Purging refreshes are designed to be robust and timely, which requires them to be more disruptive. The process of initializing net topology 1200 involves formation of a spanning tree by circumscribing the net while passing through bus bridge portals, as illustrated in Figure 7. For stability, the node with the largest refreshlD is selected to become the prime portal (in the examples of Figures 10 and 11, it is assumed that portal 1202 becomes the prime portal). The prime portal's extended unique identifier (EUI) is also the basis for the contextID that is distributed among the nodes.

In the discussion that follows, a net refresh is assumed to be initiated by prime portal 1202. However, a purging net refresh may be initiated by any portal. If a purging net refresh is initiated by a non prime portal, the initial net refresh messages would eventually propagate the prime portal, which (due to its larger refresh identifier) would become responsible for completing the net refresh, as discussed below.

Figure 10 is a block diagram of one embodiment illustrating a purging net reset of interconnect 1300. A net reset may occur when a new node 1314 is attached to interconnect 1300. The net reset has the effect of invalidating portals (1302, 1304, 1306, 1308) nodelD and busID addresses. This has the effect of isolating the portals from external access. In the example of Figure 10, the net reset on interconnect 1300 is assumed to be initiated by the prime portal 1302. However, all reset bus portals (1302, 1304, 1306, 1308) may act as the prime portal, and the prime portal status is speculative and must be reconfirmed during net refresh (as described in reference to Figure 7).

A net reset begins with a "reset acquire" message sent between bus bridge portals 1302-1308. The first of these messages is sent from prime portal 1302 and circulates through secondary portals 1304 and 1306 on the primary bus 1342. The message paths are indicated by hash lines 1330, 1332, and 1334, beginning at prime portal 1302.

As discussed above, portallD values in the net reset packets are incremented when passing through the not yet enumerated bus bridge portals (1302-1308). This ensures the eventual demise of rogue resets by allowing them to be "aged until dead." In one embodiment, reset messages are sent periodically, once each arbitration interval, until the net refresh completes. In the absence of a prime portal's resets, other portals may timeout and attempt to become prime portals. Candidate portals (1302-1308) recognize their loss (i.e., not the prime portal) when higher precedence acquire messages are observed, whereupon the portals forward the messages to other portals (next neighbor).

The acquisition of the primary bus completes when the candidate's message returns to the candidate. For example, prime portal 1302 sends a message via 1330 to portal 1304 to acquire bus 1342. The message is passed from portal 1304 via 1332 to portal 1306 and from portal 1306 via 1334 to portal 1302. Once the acquire message returns to portal 1302, portal 1302 acquires its own bus 1342.

After the primary bus 1342 has been acquired, the prime portal transmits a breach message as illustrated in Figure 11. Prime portal 1402 transmits a breach message via path 1430 to portal 1404. The receipt of a breach message by portal 1404 causes portal 1404 to breach onto adjacent bus 1444. The breach commands trigger sequential acquisitions of adjacent buses. The reset breach message initiates the acquisition of the first remote bus 1444 as indicated by paths 1432, 1434, and 1436.

After adjacent buses are acquired, breach packets are sent to initiate a remote bus acquisition. The next portal on the adjacent bus observes the returning reset acquire indication and propagates a reset breach indication to its adjacent bus. That reset acquire circulates and acquires the third bus and subsequent portals. For example, portal 1404 breaches 1408 to acquire bus 1446. The breach messages eventually circulate through all remote buses. The breach messages may reach leaf buses (a leaf bus has no other attached portals) or may close in on themselves when they pass through a bus bridge and discover that the adjacent portal has been acquired by the same candidate portal. The breach messages establish tentative busID assignments and routes; however, these are not activated until the final commit phase. During remote bus acquisition, the breach packets avoid previously acquired buses.

As in the primary bus acquisition, all bus acquisitions complete when the breach messages return to the initiating portal. After the breach is completed, the net knows the addresses that may be reclaimed, which addresses are free, and how many nodes are trying to claim free addresses.

The commit phase begins after the breach packets return bridge routing tables to the initiating prime portal 1402. During the commit phase, the bridge routing tables are updated and the busID assignments are finalized. The commit phase changes the bus bridge paths and opens closed bridges. During the commit phase, all portals receive assignments and routing information. After the commit phase is complete, all blocked portals are released and traffic may commence. Commit packets are sent, initiating the prime portal 1402 and traversing the interconnect topology 1400. The commit completes when the commit packets return to the prime portal 1402. Normal operation of the net is possible at this time, as the sending of the commit messages stops and the bridges become operational.

Figures 12, 13, and 14 are block diagrams of one embodiment for a secondary bus reset after node detachment.

Figure 12 is a block diagram illustrating the subnet 1500 prior to this connection. Referring to Figure 12, subnet 1500 consists of prime portal 1502 and secondary alpha portal 1504. Two subnets may be disconnected during operation of the interconnect by, for example, pulling a cable or detaching a bridge portal. During a disconnection, one subnet is referred to as the survivor subnet and one is referred to as the victim subnet. During a disconnection, both subnets at the disconnection point receive new busIDs.

For example, if a disconnection occurs at point 1550 in Figure 12, the two surviving subnets are as shown in Figure 13. The original bus 1532 is shown as buses 1632 and 1634. In this example, it is assumed that subnet 1650 is the survivor subnet and that subnet 1660 is the victim subnet. The nodes 1606 and 1608 on the survivor subnet 1650 receive new busIDs, as indicated by the change of letter in the figure. (For example, node 1506 is changed from "b.l" to "e.l" in node 1606.) In addition, node 1610 receives a new busID. The victim subnet 1660 identification is removed from the tables within the survivor 1650 portal tables. Thus, within survivor subnet 1650 previous busIDs of b, c, and d are invalidated and marked as previously used. Within the victim subnet 1660, the previously used busIDs are marked as invalid in preparation for a reconnect.

During the reconnection of the subnets, new busIDs are assigned within the victim subnet 1660. In addition, a new busID is assigned to the merged reset bus, as illustrated in Figure 14. Thus, in the example of Figure 14, new busID F is assigned to the merged bus 1732 and a new busID G is assigned to bus 1734 in the previous victim subnet 1660. Because busIDs B, C, and D were marked as invalid in the prior disconnection, these busIDs are no longer used. In addition, the assigned busID of E that was used in Figure 13 to indicate the disconnection is also not used during the reconnection process. A new busID F is assigned to the merged, rejoined bus 1732. The survivor subnet 1650 has an unchanged prime portal 1702 identifier (a in the example) and other survivor buses keep their assigned busID addresses. The victim subnet 1660 has a changed prime portal 1704 identifier and other victim buses are assigned new busID addresses, as required.

Figures 12, 13, and 14 illustrate one embodiment of a configuring net refresh. A configuring net refresh has the effect of assigning non-conflicting busID addresses to each of the attached buses. When busIDs conflict, either with the currently assigned busID or a dirty, (that is, previously assigned) busID, new free busIDs are assigned.

A cleansing net refresh is similar to a configuring net refresh as the recycling of "dirty" to "free" of stale busIDs by setting quarantines in each bus bridge portal. After the quarantines have been set, the portal may recycle dirty busIDs after a time delay of T^. The T_dlrt value is the maximum time a transaction can remain queued before passing into a bus bridge. A cleansing net refresh is performed when the number of dirty busIDs exceeds the number of free busIDs within the busID tables. The cleansing net refresh recycles the dirty busID stage to avoid the invocation of more disruptive purging net refresh. A cleansing net refresh is also invoked on a victim portion of the subnet to reduce the disruption of survivor subnet buses when the victim and survivor subnets are reconnected.

A purging refresh is performed when the number of desired busIDs exceeds the number of free busIDs. Although the cleansing refresh would eventually change busIDs from dirty to free, the purging refresh avoids the delay associated with the cleansing refresh recycling process. Because bus bridges may have previously queued (stale) transactions with dirty busID addresses, these queues are purged during a purging net refresh. This occurs quickly without timeout related delays. However, a purging net refresh disrupts currently active transactions.

When subnets are reattached, as exemplified in Figure 14, it is necessary to consistently determine which nodes are survivor nodes and which are victim nodes when the two sets of bus addresses are collapsed into one. In one embodiment, the prime portal may determine which portals are on the victim or survivor sub-net. The sub-net which contains the prime portal is the survivor subnet. The sub-net which acquires a new prime portal is called the victim subnet. The prime portal is defined as the portal with the largest refreshlD.

In one embodiment, the refreshlD is determined by attaching a two bit preference to the EUI of the portals and using this value to determine the prime portal. The "EUI plus preference" value is transmitted with the net refresh messages from next neighbor to next neighbor and each portal votes on the refreshlD value.

In one embodiment, the portal with the largest refreshlD value is used as the prime portal. In an alternate embodiment, the portal with the smallest refreshlD value may be used as the prime portal. In alternate embodiments, any manner of comparison or arithmetic ordering of EUI values may be used to determine a unique node such as the smallest bit-reversed EUI value or the node with the largest portal ID value.

In one embodiment, the EUI plus preference value is passed through the interconnect. This scheme has two purposes: 1) identify the prime portal to other portals; and (2) allow the prime portal to determine when all others have observed its messages, because only then do the messages return to the prime portal.

Figure 15 is a block diagram of one embodiment for an interconnect broadcast topology 1800. A broadcast message may be used after busIDs have changed, for example, when one or more nodes may have been removed, one or more nodes may have been added or the nodelDs have changed within the interconnect. The broadcast is implemented as two-phase process: first, portals communicate between themselves using directed messages, as described herein, and, second, one of the portals, typically the alpha portal, uses a broadcast transaction to communicate the event to other bus-local nodes. Thus, only bus- local broadcast transactions are required to be sent. This is valuable because the IEEE 1394 standard serial bus defines mechanisms for bus local broadcast but has no provisions for flow controlling these writes based on remote bus loading. Under certain conditions, a bus bridge portal may receive more broadcasts than it can source on an adjacent bus, and some will be discarded. Thus, there is no assurance that normal broadcast transactions can be successfully forwarded through remote buses.

Referring to Figure 15, any node (1810-1826) may initiate a broadcast message by writing that message to its bus local portal (1802-1808). The bus local portal (1802-1802) forwards this message to the next portal (next neighbor as described in reference to Figure 7). The next neighbor then passes the message to its next neighbor. The message passing continues from one portal to the next until the message returns to its initial portal, where it is removed. Thus, if prime portal 1802 receives a broadcast from one of its nodes (1816, 1818), the broadcast message is passed to its next neighbor, portal 1804. Portal 1804 then broadcasts the message to portal 1808, which broadcasts the message to portal 1806, which broadcasts the message to portal 1802. Once portal 1802 receives its own broadcast message, the message is removed and dropped.

Each broadcast message generates a broadcast write transaction when it enters a bus through the dominant portal, ensuring one and only one broadcast on each bus. The broadcast messages are implemented as a sequence of directed- write transactions, in which each transaction may be flow controlled. Thus, the broadcast messages are flow controlled and need not be discarded on congested bridges. In addition, the completion of a broadcast message is confirmed when it returns to the initiating portal, and broadcast messages may be used to establish routing paths within the interconnect.

Broadcast messages are designed to be idempotent, so that they may be safely retired once they are returned to the initiating portal. In order to accomplish this, bus bridge portals maintain a copy of the previously received message, discarding the second and following copies after accepting the first. The broadcast message writes are acknowledged, but no response is returned to the sending portal. Because there are no responses that must be distinctly labeled, this allows an identical transaction to be safely and immediately reused after a short acknowledge-missing delay.

To avoid circular dependency deadlocks, one portal in the circular list of portals receives the message in a logical request queue and outputs the message to the next portal on a second logical response queue. Deadlock is avoided by mandating that request queue messages never block the processing of response queue messages.

In one embodiment, a broadcast message may trigger the return of information from multiple nodes. This form of broadcast trigger /collection is referred to as "broadcall" in the backplane environment. Within the interconnect, a broadcall protocol that returns selected node addresses is referred to as address resolution protocol (ARP). In one embodiment, the information received from multiple nodes may be triggered by supplying the EUI of the portal or node as the broadcast message is passed along. Thus, information is appended to the broadcast message as it passes through each portal and finally returns to the initiating portal. As the information passes through each portal, the information may be maintained in tables within the portal for later use.

Figure 16 is a flow diagram of one embodiment for ordering a topology of nodes to form a ring structure. Initially, at processing block 1905, a self identification process is initialized. The self identification process may be initialized by any node within the topology. Each node sends a self identification grant (selflD grant) to all nodes, beginning with a connected node with the lowest numbered identification. The connected node numbering is based upon the port numbers defined during bus initialization.

At processing block 1910, the topology is traversed by conceptually routing message packets (ringID packets) to at least one physical port of each of the nodes in the topology. Each node sends users its ringID to communicate with its topologically adjacent node.

At processing block 1915, each node determines the ringID of its topologically adjacent neighbor. Each node begins with its own ringID equal to zero on its own port 1022 output. Each node monitors ringID packet transmissions and keeps track of its own ringID.

At processing block 1920, a node the self identifier (selflD) is mapped in order to arrive at a phylD to ringID mapping. Each node is defined by a relative ring identification (ringID) value made up of the bus identification (busID) and physical identification (phylD) portions.

At processing block 1925, each node saves the phylD of its topologically adjacent neighbor node (with the next larger ringID). Each node saves only its own ringID and the ringID of its adjacent neighbor. Thus, each node knows its topologically adjacent neighbor and is able to forward any packets or messages from itself to its next neighbor within the topology.

Figure 17 is a flow diagram of one embodiment for refreshing an interconnect topology. In this embodiment, the interconnect topology comprises a number of nodes and a number of bus bridges. Initially at processing block 2005, a next neighbor ordering of the interconnect topology is determined as described in reference to Figure 16.

At processing block 2010, an acquisition message is sent from a node to its next neighbor node. In one embodiment, each node sends the acquisition message to its next neighbor and these messages initially contain a prime portal selection identifier (refreshlD). In addition, in one embodiment, the prime portal selection identifier contains a bus count and a portal count. The portal count value in the acquisition message is incremented when passing through each bus bridge.

At processing block 2015, a prime portal is selected from a number of bus bridges on the interconnect. Each bus bridge monitors the refreshlD. If the refreshlD of the current bus bridge is larger than the incoming refreshlD, then the bus bridge overrides the refreshlD with its own refreshlD. The current bridge passes the new refreshlD to its own next neighbor. After the refreshlD is passed throughout the topology, the bus bridge with the largest refreshlD is selected as the prime portal.

At processing block 2020, a spanning tree of the interconnect is generated. The spanning tree is generated by circumscribing a path from the prime portal through the bus bridges in a daisy-chain manner from next neighbor to next neighbor.

Figure 18 is a flow diagram of one embodiment for message broadcast flow control on a bus bridge interconnect. Initially at processing block 2105, a next neighbor bus bridge topology is determined as described in reference to Figure 16. At processing block 2110, a broadcast message is initiated by an initiating node at an initiating bus bridge. In one embodiment, the broadcast message is initiated by the initiating node sending the broadcast message to its own local bus bridge. Each broadcast message generates a broadcast write transaction when it enters a bus through its own bus bridge. This ensures that only one broadcast message is on each bus at a given time. The broadcast messages are implemented as a sequence of directed write transactions in which each transaction may be flow controlled. Thus the broadcast messages are flow controlled and need not be discarded on congested bridges.

At processing block 2115, the broadcast message is forwarded to a next neighbor bus bridge. Next neighbor processing is described in reference to Figure 7. The next neighbor bus bridge then passes the broadcast message to its own next neighbor. The message passage continues from one bus bridge to the next until the message returns to its initial bus bridge. In one embodiment, each bus bridge maintains a copy of the received broadcast message and discards a second or subsequent copy of the broadcast message as each is received. All but one bus bridge that receives the broadcast message into a logical request queue sends that message to its adjacent neighbor's request queue; similarly, messages received in the response queue are sent to the adjacent neighbor's response queue. One of the bus bridges takes its received request messages and sends them to the adjacent neighbor's response queue; similarly, messages received in the response queue are discarded. This ensures that the broadcast messages pass through all portals, in a non-deadlocking fashion, before being discarded.

At processing block 2120, the forwarded broadcast message is received back at the initiating bus bridge. In one embodiment, once the initiating bus bridge receives the broadcast message, the message is removed from the system.

In an alternate embodiment, as the broadcast message is received at each bus bridge, each bus bridge appends its own extended unique identifier (EUI) to the broadcast message. The broadcast message is transferred, with the appended EUI, to the next neighbor and finally returns to the initiating bus bridge. Once the appended broadcast message is received at the initiating bus bridge, the initiating bus bridge saves the EUI information of all of the interconnect portals.

Figure 19 is a flow diagram of one embodiment for a multi-phase net reset on a bus bridge interconnect. Initially, at processing block 2205, bus bridge identifiers are refreshed, as described in reference to Figure 18.

At processing block 2210, a net reset is initiated. The net reset may be initiated by removing a node or subnet of the interconnect or adding a node or subnet to the interconnect.

At processing block 2215, a primary bus is acquired. In one embodiment, the primary bus may be the bus on which the rest is initiated. A bus bridge initially sends a reset acquire message to its next neighbor bus bridge. Next neighbor topologies are described in reference to Figure 7. The first of these messages is sent from the prime portal and circulates through secondary portals on the primary bus. As each bus bridges receives the acquire message, it determines whether it is a candidate for being the prime portal. In one embodiment, the best prime portal candidate is determined by the highest EUI on the primary bus. After the acquire messages are circulated through the topology, the prime portal is determined. The acquisition of the primary bus completes when the acquire message of the candidate (initiating bus bridge) returns to the portal with the highest EUI.

At processing block 2220, adjacent buses are breached. After the primary bus has been acquired, the prime portal transmits a breach message to its next neighbor. The receipt of the breach message by the receiving portal causes the portal to breach onto an adjacent bus. The breach commands trigger sequential acquisitions of each adjacent bus. The reset breach message initiated by the initiating bus bridge causes the acquisition of the first remote bus. The prime portal acquires all buses adjacent to itself by sending breach messages to each of the attached bus bridges. The next portal on the adjacent bus observes the returning reset acquire indication and propagates a reset breach indication to its adjacent bus. That reset circulates and acquires the subsequent buses.

The breach messages eventually circulate through all remote buses. The breach messages establish tentative busID assignments and routes. However, these tentative assignments are not activated until the commit phase, as discussed below. During remote bus acquisition, the breach packets avoid previously acquired buses. As in the acquiring of the primary bus, all bus acquisitions complete when the breach message returns to the initiating bus bridge portal. After the breach is completed, the addresses that may be reclaimed, which addresses are free, and how many nodes are trying to claim free addresses are all known.

At processing block 2225, the commit phase of new bus identifier assignments is performed. Breach packets return bridge routing tables to the prime portal. During the commit phase, the bridge routing tables are updated and the busID assignments are finalized. The commit phase changes the bus bridge paths and opens closed bridges. During the commit phase, all portals receive assignments and routing information. Commit packets are sent initiating the prime portal and traverse the interconnect topology. The commit completes when the commit packets return to the prime portal. Normal operation of the net is possible at this time, as the sending of the commit messages stops and the bridges become operational.

A mechanism for distributing or collecting messages by sending these messages from one portal to another until they return to their source is disclosed. The mechanism can support several applications in a reliable fashion. For example, the mechanism can perform a "node removed" function, (i.e., this node no longer exists and resources associated with it should be discarded). The mechanism may also perform "node added" (i.e., a new node exists, and resources may be needed to be allocated for it). The mechanism may also perform "discovery" (the presence of a class of nodes of (in the extreme) all nodes can be determined). The mechanism may be the looped bus bridge as shown in Figure 5, for example.

These functions may be performed by sending messages from one bus bridge portal to another. These messages are designed to be independent, in that a sequence number allows the receiver to determine when a duplicate message was sent (typically due to a fault) and should be discarded. All of these message writes are acknowledged, but responseless. Thus, the "tLabel" values can be safely reused before the normal SPLIT-TIMEOUT timeout delay.

To avoid circular-dependency deadlocks, one portal in this circular lists of portals receives the message in a logical "request" queue and outputs a message (to the next portal) on a second logical "response" queue. Message processing hardware /firmware allows response queue messages to be processed ahead of previously accepted request queue messages.

These messages propagate through all portals, collecting information from bus-local nodes (in the case of a collection message) or broadcasting information to local nodes (in the case of a distribution message).

The latencies of these messages is longer than broadcast writes, but has the benefit that they are not lost under congestion conditions; are not lost under transient transmission error conditions; and can be confirmed (the message sender can easily specify that a confirmation message be returned when the message has been observed by all others). This also eliminates the need to forward GASP (special broadcasts) through bridges.

Note this technique may be valuable for "announcement" messages, since these may need to be seen by many nodes and having them simultaneously sent to all nodes could cause much of the information to be lost.

Broadcast messages are useful for distribution of event notifications, such as busld changes. A broadcast event can also trigger selective nodes to provide descriptive information, such as their address and/or function. Broadcast messages support a wide range of application, including events (the node configuration may have changed in one of the following ways: a) Less. One or more nodes may have been removed from the net, b) Plus. One or more nodes may have been added to the net, or c) Diff. The node remains connected, but its nodeld address may have changed); addressing (ARP (address resolution protocol) associated a nodeld with an EUI-64 argument); and discovery (this allows one node to discover the location and function of others.

To ensure message deliveries, a simple form of broadcast flow control is provided. Any node can initiate a broadcast message by writing that message to its bus-local delta-portal. The delta portal forwards this message to the next portal, that message is passed to the next portal. The message passing continues, from one portal to the next, until the message returns to the initials delta portal, where it is removed.

Each broadcast message generated a broadcast write transaction when entering a bus through the dominant portal, ensuring one and only broadcast on each bus. Thus, broadcast messages are implemented as sequences of directed- write transactions, each of which can be safely flow-controlled. This form of message passing has several beneficial properties:

1) Controlled. Broadcast messages are flow-controlled and need not be discarded in congested bridges.

2) Confirmed. The completion of a broadcast message is confirmed when it returns to the sender.

3) Routing. Broadcast messages use established routing paths. Messages are designed to be idempotent, so that they can be safely retired. To accomplish this goal, bus-bridge portals maintain a copy of the previously received messages, discarding the second following copies after accepting the first. These message writes are acknowledged, but no response is returned. This allows the tLabel values to be safely and immediately reused, after a short acknowledge-missing (as opposed to SPLIT_TIMEOUT) delay.

To avoid circular-dependency deadlocks, one portal in the circular list of portals receives the message in a logical "request" queue and outputs a message to the next portal on a second logical "response" queue. Deadlock is avoided by mandating that request-queue messages never block the processing or response- queue messages.

A broadcast message can trigger the return of information from multiple nodes. This form of broadcast trigger /collection is sometimes called broadcall, in the backplane environment. In network applications, a broadcall protocol that returns selected node addresses is called ARP (address resolution protocol).

The specific arrangements and methods herein are merely illustrative of the principles of this invention. Numerous modifications in form and detail may be made by those skilled in the art without departing from the true spirit and scope of the invention.

Claims

CLAIMS What is claimed is:

1. A method for ordering an interconnect topology to form a ring structure, the topology comprising of a plurality of nodes, the method comprising: determining a self identifier for each of the plurality of nodes 612; mapping the self identifier to a ring identifier for each of the plurality of nodes 602; computing the ring identifier of at least one port-connected node 612 as an adjacent neighbor identifier; and associating a message 625 from each node with a source queue or a destination queue.

2. The method of claim 1 further comprising: initializing the topology ordering of the plurality of nodes; and traversing the topology by conceptually routing message packets through at least one physical port of each of the plurality of nodes.

3. The method of claim 1 wherein mapping further comprises: assigning a physical identification value to each of the plurality of nodes; and communicating with an adjacent neighbor using the adjacent neighbor identifier.

4. The method of claim 1 wherein determining the ring identifier of each of the plurality of nodes further comprises: initializing the ring identifier to zero; and incrementing the ring identifier when the message packets are passed through a given port of each node of the plurality of nodes.

5. The method of claim 1 wherein the message packets are responseless write messages.

6. The method of claim 1 further comprising: traversing the topology in a depth first manner.

7. The method of claim 1 wherein the plurality of nodes are connected to a bus.

8. The method of claim 7 wherein the bus conforms substantially to the IEEE 1394 standard serial bus.

9. A method for circumscribing an interconnect topology, the topology comprising a plurality of nodes and a plurality of bus bridges, the method comprising: determining a next neighbor ordering of the interconnect topology; sending an acquisition message to a next neighbor node; selecting a prime portal from the plurality of bus bridges; generating a source queue; generating a destination queue; and generating a spanning tree of the interconnect topology.

10. The method of claim 9 wherein determining a next neighbor comprises: determining a ring identifier for each of the plurality of nodes; mapping the ring identifier to a ring identifier for each of the plurality of nodes; and saving the ring identifier of at least one adjacent node.

11. The method of claim 9 wherein generating the spanning tree further comprises circumscribing a path through the plurality of bus bridges.

12. The method of claim 9 wherein the acquisition message comprises a prime portal selection identifier, a bus count, and a portal count.

13. The method of claim 12 wherein selecting a prime portal comprises: monitoring an incoming prime portal selection identifier by each of the plurality of bus bridges; overriding the incoming prime portal selection identifier with a prime portal selection identifier of a first bus bridge of the plurality of bus bridges if the prime portal selection identifier of the first bus bridge is larger than the incoming prime portal selection identifier; and selecting one of the plurality of bus bridges with a largest prime portal selection identifier as the prime portal.

14. The method of claim 11 further comprising: incrementing the portal count as the acquisition message passes through each of the plurality of bus bridges; and aging rogue reset messages.

15. The method of claim 9 further comprising: assigning a node identifier to each of the plurality of nodes; and assigning a portal identifier to each of the plurality of bus bridges.

16. The method of claim 15 wherein the node identifier comprises a bus identifier and a local identifier.

17. The method of claim 16 wherein the local identifier is a physical identifier of a node.

18. The method of claim 9 further comprising: determining a portal identifier for each of the plurality of bus bridges; sending a portal identifier to a next neighbor bus bridge; and assigning a delta portal one each of the plurality of bus bridges.

19. The method of claim 18 wherein determining a portal identifier comprises: attaching a preference identifier to an extended unique identifier of each of the plurality of bus bridges.

20. The method of claim 18 wherein assigning the delta portal comprises: overriding the transfer portal identifier with a current portal identifier of a current bus bridge of the plurality of bus bridges if the current portal identifier is larger than the transfer identifier.

21. A system for ordering an interconnect topology, the topology comprising of a plurality of nodes, to form a ring structure, the system comprising: means for determining a self identifier for each of the plurality of nodes; means for mapping the self identifier to a ring identifier for each of the plurality of nodes; and means for computing the ring identifier of at least one port-connected node as an adjacent neighbor identifier.

22. A system for circumscribing an interconnect topology, the topology comprising a plurality of nodes and a plurality of bus bridges, the system comprising: means for determining a next neighbor ordering of the interconnect topology; means for sending an acquisition message to a next neighbor node; means for selecting a prime portal from the plurality of bus bridges; and means for generating a spanning tree of the interconnect topology.

23. A computer-readable medium comprising program instructions for encoding a block of data by performing the steps of: determining a self identifier for each of the plurality of nodes; mapping the self identifier to a ring identifier for each of the plurality of nodes; and computing the ring identifier of at least one port-connected node as an adjacent neighbor identifier.

24. A computer-readable medium comprising program instructions for encoding a block of data by performing the steps of: determining a next neighbor ordering of the interconnect topology; sending an acquisition message to a next neighbor node; selecting a prime portal from the plurality of bus bridges; and generating a spanning tree of the interconnect topology.

25. A system for ordering an interconnect topology to form a ring structure, the system comprising: a bus; a primary node connected to the bus to determine a self identifier; a processor to map the self identifier to a ring identifier; and at least one adjacent neighbor node having an adjacent neighbor identifier computed from the ring identifier.

26. The system of claim 25 wherein the processor further initializes the topology ordering of the adjacent neighbor node, and traverses the topology by conceptually routing message packets through at least one physical port of the adjacent neighbor node.

27. The system of claim 25 wherein the ring identifier comprises a bus identification value and a physical identification value.

28. The system of claim 25 wherein the processor further assigns a physical identification value to the adjacent neighbor node, and communicates with the adjacent neighbor node using an adjacent neighbor identifier.

29. The system of claim 25 wherein the primary node further initializes the self identifier to zero, and increments the self identifier when the message packets are passed through a given port of each node of the plurality of nodes.

30. The system of claim 25 wherein the message packets are responseless write messages.

31. The system of claim 25 wherein the processor traverses the topology in a depth first manner.

32. The system of claim 25 wherein the bus conforms substantially to the IEEE 1394 standard serial bus.

33. A system for circumscribing an interconnect topology, the system comprising: at least one bus; at least one bus bridge connected to the at least one bus; a adjacent neighbor node connect to the bus; a primary node connected to the bus to determine an adjacent neighbor ordering of the interconnect topology, and send an acquisition message to the adjacent neighbor node; and a prime portal, selected from the at least one of bus bridge, to be the root of spanning tree of the interconnect topology.

34. The system of claim 33 wherein the primary node further determines a self identifier for the adjacent neighbor node, maps the self identifier to a ring identifier for the adjacent neighbor node, and saves the ring identifier of the adjacent neighbor node.

35. The system of claim 33 wherein the prime portal further circumscribes a path through the at least one bus bridge.

36. The system of claim 33 wherein the acquisition message comprises a prime portal selection identifier, a bus count, and a portal count.

37. The system of claim 33 further comprising: a processor to monitor an incoming prime portal selection identifier, override the incoming prime portal selection identifier with a prime portal selection identifier of the at least one bus bridge if the prime portal selection identifier of the at least one bus bridge is larger than the incoming prime portal selection identifier, and select the prime portal form the at least one bus bridge with a largest prime portal selection identifier.

38. The system of claim 37 wherein the processor further increments the portal count as the acquisition message passes through the at least one bus bridge, and ages rogue reset messages.

39. The system of claim 33 wherein the prime portal further assigns a node identifier to each of a plurality of nodes, and assigns a portal identifier to the at least one bus bridge.

40. The system of claim 39 wherein the node identifier comprises a bus identifier and a local identifier.

41. The system of claim 40 wherein the local identifier is a physical identifier of a node.

42. The system of claim 33 wherein the primary portal further determines a portal identifier for the at least one bus bridge, sends a transfer portal identifier to a next neighbor bus bridge, and assigns a delta portal from the at least one bus bridge.

43. The system of claim 42 wherein the primary portal further attaches a preference identifier to an extended unique identifier of the at least one bus bridge.

44. The system of claim 42 wherein the prime portal overrides the transfer portal identifier with a current portal identifier of a current bus bridge of the at least one bus bridge if the current portal identifier is larger than the transfer identifier.