Abstract: A method and system for transmitting data between at least one receiver operatively connected to at least one transmitter, and more particularly to a method and a system for permissible transmission via at least one high-speed link having a plurality of virtual channels. The method includes the receiver sending a virtual channel credit packet for a particular virtual channel to the transmitter, the credit packet being indicative that the receiver is available to receive data and having a unique virtual channel number assigned to said particular virtual channel thereto. The transmitter responds to the virtual channel credit packet, which includes transmitting data to the receiver if data is available. The receiver receives the data transmitted from the transmitter.

Abstract: An improved method for identifying a bus topology, even when the bus contains one or more loops between nodes. The invention allows the tree identification process to be resolved within a known maximum amount of time. The method uses a superset of a globally unique ID as part of the tree identification process. After a bus reset, nodes repeat a highest priority number constructed from the GUID. At the end of a fixed time, all nodes become stable and their ports are sending either their own priority number which is the highest priority number on the bus, repeating such number, or sending a submission marker. The submission marker is a signal condition or a packet of information that indicates that a port is a child with respect to a sending port. A node becomes a root node if it is sending a priority number that matches its own priority number. Nodes with ports that neither send nor receive a submission marker, mark such ports as “loop branches” and disable them from the bus topology.