Recherche Images Maps Play YouTube Actualités Gmail Drive Plus »
Connexion
Les utilisateurs de lecteurs d'écran peuvent cliquer sur ce lien pour activer le mode d'accessibilité. Celui-ci propose les mêmes fonctionnalités principales, mais il est optimisé pour votre lecteur d'écran.

Brevets

  1. Recherche avancée dans les brevets
Numéro de publicationUS7194564 B2
Type de publicationOctroi
Numéro de demandeUS 11/021,337
Date de publication20 mars 2007
Date de dépôt21 déc. 2004
Date de priorité5 nov. 1999
État de paiement des fraisPayé
Autre référence de publicationUS6587904, US6842805, US6985981, US7389371, US20050117528, US20070255871
Numéro de publication021337, 11021337, US 7194564 B2, US 7194564B2, US-B2-7194564, US7194564 B2, US7194564B2
InventeursJerrold V. Hauck, Colin Whitby-Strevens
Cessionnaire d'origineApple Computer, Inc.
Exporter la citationBiBTeX, EndNote, RefMan
Liens externes: USPTO, Cession USPTO, Espacenet
Method and apparatus for preventing loops in a full-duplex bus
US 7194564 B2
Résumé
A method and apparatus is disclosed for preventing loops in a full-duplex bus. One method has the acts of: selecting at least two candidates to join said bus; establishing a dominant candidate from one of said at least two candidates; testing for loops in said bus; and joining said dominant candidate if no loops are found in said bus.
Another method has the acts of: selecting a plurality candidates to join said bus; establishing at least one dominant candidate; testing for loops in said bus; and joining said at least one dominant candidate if no loops are found in said bus. Alternative embodiments are shown that utilize unique identifiers to facilitate candidate selection and to establish dominance on the bus.
Images(23)
Previous page
Next page
Revendications(34)
1. In a network of a plurality of nodes, each node in communication with other nodes in the network via a full-duplex communications bus, a method for performing loop breaking, the method comprising:
detecting which nodes from said plurality select an untested connection;
wherein said act of selecting comprises:
transmitting a request containing a unique identifier;
receiving requests transmitted by other candidates;
ignoring said received requests that meet a first condition;
abandoning the transmittal of further requests if said received requests meet a second condition and acknowledging the existence of said received requests; and
challenging the request if said received request meets a third condition;
testing for loops through said untested connection by said detected nodes; and
joining said untested connection to said full-duplex bus by said detected nodes if no loops are found in said bus.
2. The method of claim 1, wherein said first condition is met if said unique identifier contained within said transmitted request is greater than said unique identifier contained within said received request.
3. The method of claim 1, wherein said first condition is met if said unique identifier contained within said transmitted request is less than said unique identifier contained within said received request.
4. The method of claim 1, wherein said first condition is met if said unique identifier contained within said transmitted request is equal to said unique identifier contained within said received request.
5. The method of claim 1, wherein said act of joining further comprises:
arbitrating for control of said bus;
waiting for a predetermined period of time;
issuing a short bus reset if said arbitration is won within said predetermined period of time; and
issuing a long bus reset if arbitration is not won within said predetermined period of time.
6. The method of claim 5, wherein said predetermined period of time is less than or equal to the time period of one asynchronous packet on said bus.
7. In a network of a plurality of nodes, each node in communication with other nodes in the network via a full-duplex communications bus, a method for performing loop breaking, the method comprising:
detecting which nodes from said plurality select an untested connection;
wherein said act of detecting nodes comprises:
selecting a candidate by arbitrating for control of said bus;
transmitting a packet containing a unique identifier on said bus;
listening for packets received on said bus;
designating the selected candidate as a dominant node if the received packet meets a first condition;
dropping transmission of packets if said received packets meet a second condition; and
re-transmitting packets a predetermined number of times if the received packets meet a third condition;
testing for loops through said untested connection by said detected nodes; and
joining said untested connection to said full-duplex bus by said detected nodes if no loops are found in said bus.
8. The method of claim 7, wherein said first condition is met if said unique identifier contained within said transmitted packet is greater than said unique identifier contained within said received packet.
9. The method of claim 7, wherein said first condition is met if said unique identifier contained within said transmitted packet is less than said unique identifier contained within said received packet.
10. The method of claim 7, wherein said first condition is met if said unique identifier contained within said transmitted packet is equal to said unique identifier contained within said received packet.
11. The method of claim 7, wherein said predetermined number of tries is less than or equal to ten.
12. The method of claim 7, further comprising the act of transmitting a join request on said bus when said first condition has been met.
13. In a network comprising a plurality of nodes present in a full-duplex bus, a method for building a loop free bus, comprising:
determining which nodes from said plurality comprise an untested connection;
testing for loops if said detected nodes were to be joined to said full-duplex bus; and
joining said detected nodes to said full-duplex bus if no loops are found during said act of testing.
14. The method of claim 13, wherein said full-duplex bus comprises a serial communications bus.
15. The method of claim 13, wherein said act of determining which nodes from said plurality comprises an untested connection further comprises:
transmitting a candidate identifier message from a candidate node to a peer node;
transmitting a peer identifier message from said peer node to said candidate node; and
determining a relationship between a candidate identifier number present within said candidate identifier message and a peer identifier number present within said peer identifier message.
16. The method of claim 15, wherein said candidate identifier message further comprises an outbound service request.
17. The method of claim 16, wherein if said relationship indicates that said peer identifier number is greater than said candidate identifier number then said candidate node abandons any outbound service requests.
18. The method of claim 15, wherein if said relationship indicates that said peer identifier number is equal to said candidate identifier number then a random challenge is invoked.
19. In a network comprising a plurality of nodes in a full-duplex bus, at least one node comprising computer instructions which when executed, perform loop breaking, according to the method comprising:
selecting an untested connection in said plurality of nodes;
establishing at least one dominant node in said full-duplex bus;
testing for loops through said untested connection by said at least one dominant node; and
joining said untested connection to said full-duplex bus by said at least one dominant node if no loops are found during said act of testing.
20. The at least one node of claim 19, wherein said act of establishing at least one dominant node further comprises:
selecting a candidate by arbitrating for control of said bus;
transmitting a packet containing a transmitted unique identifier on said bus;
listening for one or more packets, each comprising a received unique identifier received on said bus;
establishing said candidate as a dominant node if the received packet meets a first condition;
dropping transmission of packets if said received packets meet a second condition; and
re-transmitting packets a predetermined number of times if the received packets meet a third condition.
21. The at least one node of claim 20, wherein said first condition is met if said unique identifier contained within said transmitted packet is greater than said unique identifier contained within said received packet.
22. The at least one node of claim 20, wherein said first condition is met if said unique identifier contained within said transmitted packet is less than said unique identifier contained within said received packet.
23. The at least one node of claim 20, wherein said first condition is met if said unique identifier contained within said transmitted packet is equal to said unique identifier contained within said received packet.
24. The at least one node of claim 20, wherein said predetermined number of tries is less than or equal to ten.
25. The at least one node of claim 20, further comprising transmitting a join request on said bus when said first condition has been met.
26. A device, comprising a plurality of instructions which when executed by said device prevents loops in a full-duplex bus by performing the method, comprising:
selecting a plurality of candidate nodes to join said bus;
establishing at least one dominant candidate node;
testing for loops in said bus; and
joining said at least one dominant candidate node if no loops are found in said bus.
27. The device of claim 26, wherein said act of establishing at least one dominant candidate node comprises:
selecting a candidate by arbitrating for control of said bus;
transmitting a packet containing a transmitted unique identifier on said bus;
listening for packets containing a received unique identifier on said bus; and
establishing said candidate as said at least one dominant node if the received packet meets a first condition.
28. The device of claim 27, wherein said first condition is met if said unique identifier contained within said transmitted packet is greater than said unique identifier contained within said received packet.
29. The device of claim 27, wherein said first condition is met if said unique identifier contained within said transmitted packet is less than said unique identifier contained within said received packet.
30. The device of claim 27, wherein said first condition is met if said unique identifier contained within said transmitted packet is equal to said unique identifier contained within said received packet.
31. The device of claim 27, wherein said predetermined number of tries is less than or equal to ten.
32. The device of claim 27, further comprising the act of transmitting a join request on said bus when said first condition has been met.
33. The device of claim 26, wherein said act of joining a candidate further comprises:
arbitrating for control of said bus;
waiting for a predetermined period of time;
issuing a short bus reset if said arbitration is won within said predetermined period of time; and
issuing a long bus reset if arbitration is not won within said predetermined period of time.
34. The device of claim 33, wherein said predetermined period of time is less than or equal to the time period of one asynchronous packet on said bus.
Description
PRIORITY CLAIM

This application is a continuation of U.S. patent application Ser. No. 10/390,944, filed Mar. 17, 2003 now U.S. Pat. No. 6,842,805, which is a continuation application of U.S. patent application Ser. No. 09/435,160, filed Nov. 5, 1999, now U.S. Pat. No. 6,587,904, issued Jul. 1, 2003 which are hereby incorporated by reference as if set forth herein.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to serial bus management. In particular, the present invention relates to a method and apparatus for preventing loops in a serial bus system.

2. The Prior Art

Modern electronic equipment has greatly enhanced the quality of our lives. However, as the use of such equipment has increased, so has the need to connect equipment purchased from different manufacturers. For example, while a computer and a digital camera may each be useful when used alone, the ability to connect the digital camera to the computer and exchange information between the two makes the combination even more useful. Therefore, a need was apparent for a serial bus standard that would allow for the connection and communication between such devices.

The IEEE 1394-1995 standard was developed to satisfy this need. This standard, revolutionized the consumer electronics industry by providing a serial bus management system that featured high speeds and the ability to “hot” connect equipment to the bus; that is, the ability to connect equipment without first turning off the existing connected equipment. Since its adoption, the IEEE 1394-1995 standard has begun to see acceptance in the marketplace with many major electronics and computer manufacturers providing IEEE 1394-1995 connections on equipment that they sell.

However, as technologies improved, the need to update the IEEE 1394-1995 standard became apparent. Improvements such as higher speeds and longer connection paths are needed. There is currently an improved standard in development, herein referred to as the P1394b, which will provide such improvements.

One problem that is associated with serial bus systems is that of loops occurring in a system. In order for a serial bus system to function properly, one end of the bus cannot be connected to the other. Loops typically occur when an end user, typically a consumer, inadvertently connects a new device to the bus in such a manner that a loop is formed. If this occurs, a “loop” is formed in the system, and the system will fail to properly initialize. Once a loop is formed, the system will not function properly, since communications between devices is impossible.

Consequentially, there is a need for an method for managing a serial bus system that detects when a loop has been formed, and eliminates the loop.

Furthermore, since there will be equipment utilizing both the α and β standards on the market, there is a need for a serial bus loop-breaking system that is compatible with the β standard, and is backwards-compatible with the α standard.

Finally there is a need for a system that prevents the above problems by building a loop-free connection from the start.

BRIEF DESCRIPTION OF THE INVENTION

The invention satisfies the above needs. The present invention relates to a method and apparatus for preventing loops in a full-duplex bus. A preferred method for preventing loops in a full-duplex bus has the following acts: selecting at least two candidates to join the bus; establishing a dominant candidate from one of the at least two candidates; testing for loops in the bus; and joining the dominant candidate if no loops are found in the bus.

Another preferred method for preventing loops in a full-duplex bus has the following acts: selecting a plurality candidates to join the bus: establishing at least one dominant candidate; testing for loops in the bus; and joining the at least one dominant candidate if no loops are found in the bus.

Another preferred method for breaking loops in a bus containing both full-duplex and uniplex devices is disclosed, the method comprising the acts of: determining whether the loop comprises only full-duplex devices and breaking the loop at any point on the bus; determining whether the loop comprises only uniplex devices and quarantining the loops comprising uniplex devices from the bus; and determining whether the loop comprises both uniplex and full-duplex devices, and breaking the loop by utilizing only full-duplex device to break the loop.

An electronic device adapted to communicate on a full-duplex bus is disclosed, the device comprising: means for selecting two candidates to join the bus; means for establishing a dominant candidate; means for testing for loops in the bus; and means for joining the dominant candidate if no loops are found in the bus.

An electronic device adapted to communicate on a full-duplex bus is disclosed, the device comprising: means for selecting a plurality candidates to join the bus; means for establishing at least one dominant candidate; means for testing for loops in the bus; and means for joining the at least one dominant candidate if no loops are found in the bus.

A method for detecting and breaking loops in a full-duplex electronic bus is disclosed, the method comprising the acts of: selecting candidates to join to the bus; arbitrating for control of the bus; transmitting a loop test packet containing a unique identifier on the bus; receiving loop test packets from the bus, the received loop test packets containing a unique identifier; surrendering control of the bus if any the unique identifier contained in any the received loop test packet is greater than the unique identifier contained in the transmitted loop test packet and waiting for the bus to return to idle before attempting to join the bus again; and joining the selected candidates to the bus if any the unique identifier contained in the transmitted loop test packet is greater than or equal to any the unique identifier contained in the received loop test packet.

A method for detecting and breaking loops in a full-duplex electronic bus, the method comprising the acts of: connecting a device to the bus; testing for a loop in the bus; quarantining the device from the bus a loop is found; resuming the device if no loop is found; testing for a loop in the bus if the device does not resume within a predetermined time period; activating the device; and testing for a loop in the bus if the device does not activate within the predetermined time period.

Finally, a program storage device readable by a machine, tangibly embodying a program of instructions executable by a machine to prevent loops on a full-duplex bus, is disclosed, the device comprising: means for selecting a plurality candidates to join the bus; means for establishing at least one dominant candidate; means for testing for loops in the bus; and means for joining the at least one dominant candidate if no loops are found in the bus.

BRIEF DESCRIPTION OF THE DRAWING FIGURES

FIG. 1A is a block diagram of a pure beta loop.

FIG. 1B is a block diagram of a hybrid loop.

FIG. 1C is a block diagram of a pruned loop.

FIG. 2 is a block diagram of a “LoopFreeBuild”.

FIG. 3 is a block diagram of a Single Candidate Selection process.

FIG. 4A is an example of a Single Candidate Selection process.

FIG. 4B is an example of a Single Candidate Selection process.

FIG. 4C is an example of a Single Candidate Selection process.

FIG. 4D is an example of a Single Candidate Selection process.

FIG. 4E is an example of a Single Candidate Selection process.

FIG. 4F is an example of a Single Candidate Selection process.

FIG. 5A is an example of an Establish Dominance process.

FIG. 5B is an example of an Establish Dominance process.

FIG. 5C is an example of an Establish Dominance process.

FIG. 5D is an example of an Establish Dominance process.

FIG. 5E is an example of an Establish Dominance process.

FIG. 6 is a flow chart of a Join Procedure.

FIG. 7A is an example of a Multiple Candidate Selection process.

FIG. 7B is an example of a Multiple Candidate Selection process.

FIG. 7C is an example of a Multiple Candidate Selection process.

FIG. 7D is an example of a Multiple Candidate Selection process.

FIG. 7E is an example of a Multiple Candidate Selection process.

FIG. 8 is state machine diagram of a possible LoopFreeBuild process.

FIG. 9 is state machine diagram of a possible LoopFreeBuild process.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Persons of ordinary skill in the art will realize that the following description of the present invention is illustrative only and not in any way limiting. Other embodiments of the invention will readily suggest themselves to such skilled persons having the benefit of this disclosure.

The present invention relates to data communications. More particularly, the present invention relates to a method and apparatus for breaking loops on a serial bus using the P1394b standard. The invention further relates to machine readable media on which are stored embodiments of the present invention. It is contemplated that any media suitable for retrieving instructions is within the scope of the present invention. By way of example, such media may take the form of magnetic, optical, or semiconductor media.

The invention further relates to devices that embody the IEEE-P1394b standard. By way of example, such devices may include those typically used in an audio/video entertainment system, such as home theater receivers, DVD players, computers, or hand-held devices such as cameras and the like. The devices may also include those industrial in nature, such as test and measurement equipment, professional audio/video recording devices, as well as system control or robotic devices found in an industrial environment.

The invention also relates to nodes and physical computers, such as state machines. The present invention may be embodied in any collection of nodes linked together through a bus. Typically, each device connected to the bus will also have one corresponding node physical layer controller embedded therein. However, a given device may have more than one node, and therefore it follows that one device may have more than one connection to more than one bus. For the discussion that follows, the examples will show the typical situation where one node corresponds to one device.

Each node may communicate to other nodes in a P1394b-compatible system though links. Typically, a cable is used for a link, as is provided for in the IEEE-P1394b standard. However, any communication means may be employed. By way of example, an infrared, RF, or other wireless system may be used, as well as an optical system.

Typically, a link is coupled to a node through a port. A port transmits and receives messages and data between the node and link. As is known by those of ordinary skill in the art, each node may have more than one port.

In the discussion that follows, much of the lower-level detail such as ports and links will be omitted, and the discussion will focus instead on nodes. Furthermore, the discussion will focus on nodes connected to a serial bus compatible with the IEEE 1394-1995 standard. In accordance with the IEEE 1394-1995 standard, a physical node is referred to as a PHY. Therefore, in the discussion that follows PHYs that are compatible with either the IEEE 1394-1995 or the P1394a standards will be referred to as α PHYs, and PHYs compatible with the P1394b standard will be referred to as β PHYs. Finally, β nodes that must communicate with both α and β devices are referred to herein as “border” nodes.

Since the present invention requires that two nodes communicate, it is directed towards the IEEE-P1394b standard, and the advantages contained therein. However, any high-performance bus standard could be used for the present invention. For example, any standard that allows for full-duplex communication between nodes may be used.

As the IEEE-P1394b standard enters the market, it is contemplated that end users may encounter at least three potential loop scenarios: 1) a loop may be formed by all β PHYs; 2) a loop may be formed by all α PHYs; or 3) a loop may be formed by a combination of α and β PHYs. Each scenario will now be examined in turn.

Referring first to FIG. 1A, a system containing only β PHYs is shown. Each β device 16 represents a physical node compatible with the IEEE-P1394b standard, or a β PHY, as discussed above. FIG. 1A shows β PHYs 16 forming a loop which must be broken.

In a preferred embodiment of the present invention, when a loop is formed solely by β PHYs, the loop may be broken anywhere in the loop. The method and apparatus for breaking such loops will be discussed in more detail later. FIG. 1A shows the loop broken at location 18, between nodes 1 and 6. However, because the loop in FIG. 1A is made up of only β PHYs, the loop may be broken anywhere in the loop by a pair of β PHYs.

FIG. 1B shows a system containing both α and β PHYs. In a preferred embodiment of the present invention, when a loop contains both α and β PHYs, the loop-breaking algorithm will be optimized to insure that the loop will be broken between two β devices. Therefore, when breaking loops containing both α and β PHYs, operation of α PHYs will not be effected.

FIG. 1B shows β PHYs 21 and 26, α/β border nodes 22 and 25, and α PHYs 23 and 24. Since it is preferable in accordance with the present invention to break loops between two β PHYs, the present invention could break loop at location 27, between β PHYs 21 and 26, thus leaving the α PHYs unaffected.

FIG. 1C shows a situation where an α loop must be completely pruned from the bus. In FIG. 1C, β PHYs 7, 8, 10, and 11 are joined through hybrid PHY 9 to a loop completely formed by α PHYs 12, 13, 14, 15, 16 and 17. As is known by those of ordinary skill in the art, the loop formed by the α devices will render the bus inoperable. Because α PHYs cannot break loops themselves, the present invention will instead break the loop near β PHYs 8 and 10 by severing the loop at locations 19 and 20, respectively. This effectively “prunes” the α PHY loop from the bus, and recovers operation of the bus by creating two separate operational buses consisting of β devices 7 and 8, and β devices 10 and 11.

Referring now to FIG. 2, a block diagram of an overview of the present invention is shown. FIG. 2 shows the four basic acts for building a loop-free bus which comprise a presently preferred embodiment of the present invention: Act 200, Select Candidate(s), determine which untested connection(s) should be processed; Act 201, Establish Dominance, assert temporary exclusive right to activate candidate connection(s); Act 202, Test for Loop, test whether candidate connection(s) would form a loop if enabled; and Act 203, Join, activate candidate connection(s) which tested “loop free”.

The acts shown in FIG. 2 comprise the essential elements of what the inventors term a “LoopFreeBuild”, that is, building a system free from loops. In practice, however, two fundamentally different approaches to LoopFreeBuild have been explored. The first situation is where only one new, or “candidate”, connection has presented itself to the bus for joining. The second situation is where multiple candidates are presented to the bus for joining at the same time. Each will now be taken in turn.

Single Candidate LoopFreeBuild

Selection of Candidates

FIG. 3 is a flow chart showing the Single Candidate Selection process. Starting at act 302, the candidate PHY transmits a HUID (hereinafter a TxHUID) to the peer PHY; and in act 304, the PHY receives a HUID (hereinafter a RxHUID) from the peer PHY. In decision act 304, the RxHUID is compared with the TxHUID. If the RxHUID is greater than the RxHUID, than the process proceeds to act 308, where the candidate PHY abandons its outbound ServiceRequest, and acknowledges the incoming bid, thereby ending its bid. If the RxHUID is not greater than the TxHUID, than the process moves to decision act 310.

In decision act 310, if the RxHUID is equal to the TxHUID, than the PHY will invoke a random challenge in act 312. If the RxHUID is not equal to the TxHUID, than by definition the TxHUID is greater than the RxHUID, and the process will move to the Establish Dominance and Test for Loops process.

FIGS. 4A–4F show an example how this is accomplished in a preferred embodiment of the present invention.

FIG. 4A shows three PHYs X, Y, and Z. PHY X is shown having three ports 400, 402, and 404. PHY Z is shown having three ports 406, 408, and 410. PHY Y is shown having three ports 414, 416, and 418.

PHY X, through port 400, has an untested connection 412 to PHY Z through port 406. PHY X, through port 402, has an untested connection 422 to PHY Y through port 414. Finally, PHY Y, through port 418, has an untested connection 420 to PHY Z through port 408. An untested connection is one that has achieved connectivity but has not yet been tested for loops. This state may occur for any number reasons; by way of example, PHYs X and Z may all be connected by a user at the same time or may be powered up simultaneously.

PHY X has a qualified connection 424 through port 404 to an existing bus, shown herein as bus cloud 430. Likewise, PHY Y has a qualified connection 426 through port 416 to bus cloud 430, and PHY Z has a qualified connection 428 through port 410 to bus cloud 430.

In a preferred embodiment of the present invention, in order for a candidate connection to be tested and joined, peer PHY ports at the opposing ends of the candidate connection must agree to service the connection at a given instant.

FIG. 4B shows PHYs X, Y, and Z beginning to communicate with each other. To establish the necessary cooperation, a given PHY attempts to gain the attention of a neighboring PHY by sending a ServiceRequest symbol across a single chosen untested connection. In effect, the ServiceRequest says to a neighboring PHY “I would like to have your attention, please.” As is appreciated by those of ordinary skill in the art, challenges must be asserted long enough to ensure that all candidate PHYs have heard the challenge.

Within the ServicePacket, each PHY X, Y, and Z includes a Hopefully Unique Identifier number (HUID). A HUID is created by a random number generator within each PHY. In general, whoever has the highest HUID will establish dominance. In FIG. 3B, PHY Z sends a ServiceRequest symbol containing a HUID of 2 to PHY X, PHY Y sends a ServiceRequest symbol containing a HUID of 5 to PHY Z, and PHY X sends a ServiceRequest symbol containing a HUID of 5 to PHY Y.

For the purposes of this embodiment, when a PHY generates a HUID, it stores a copy internally. All PHYs listen on untested connections for an inbound ServiceRequest. When it receives a neighbor's HUID, the PHY then compares the received HUID with the HUID generated and stored internally. If the received HUID is greater than the PHYs own HUID, the PHY then cancels its bid to join the bus by abandoning its outbound ServiceRequest and acknowledging the inbound bid. If an equivalent HUID is received, a probalistically seeded back off or random challenge is invoked.

FIG. 4C shows this procedure in action. Since PHY Z sent an outbound HUID of 2, and it received an inbound HUID of 5, PHY Z is shown dropping its bid by canceling its outbound ServiceRequest to PHY X. FIG. 4D shows PHY Z acknowledging PHY Y's inbound ServiceRequest by sending an acknowledgement, or ACK. At the same time PHY X is continuing to send another challenge to PHY Y.

The process continues in FIG. 4E. The presence of an acknowledgement from PHY Z allows PHY Y to acknowledge PHY Z, and send a Busy signal to PHY X. A Busy signal indicates the recipient that the sender will not entertain any more challenges for the present cycle.

In FIG. 4F, PHY Z, upon seeing PHY Y's acknowledgement, busies PHY X as well. As a result, PHYs Y and Z have now selected each other to continue and test the link. As is appreciated by those of ordinary skill in the art, the result of this process is that a methodical and systematic method has been demonstrated which allows multiple candidates for connection to be narrowed down to two candidates.

Establish Dominance and Test for Loops

As is appreciated by those of ordinary skill in the art, it is essential that only one candidate pair be testing for loops at any one time. The Establish Dominance act ensures this occurs by forcing a PHY that to arbitrate for control of the bus before joining.

In practice, the next two acts of establishing dominance and testing for loops are performed simultaneously. FIGS. 4A–4F show these acts in action.

FIG. 5A shows two buses, Bus 0 and Bus 1. Bus 0 has PHYs A, B, and C connected with pre-existing links 502 and 504, respectively; and Bus 1 has PHYs D, E, and F connected with pre-existing links 506 and 508, respectively. In FIG. 5A, PHYs A and D would like to join through link 510, and PHYs C and F would like to join through link 512. In a presently preferred embodiment, this selection occurred as a result of the Single Candidate Selection process as just described. As is appreciated by those of ordinary skill in the art, if PHYs A and D were allowed to join simultaneously with PHYs C and F, a loop would form.

To prevent this, in a preferred embodiment of the present invention, ports on the candidate connection arbitrate for control of their respective buses. In practice, isolated PHYs wait a bit longer to begin arbitration to help reduce the need for long bus resets when joining.

FIG. 5B shows all four PHYs arbitrating for their respective buses, that is, PHYs A and C are arbitrating for control of Bus 0, and PHYs D and F are arbitrating for control of Bus 1. In a preferred embodiment of the present invention, this arbitration takes place in accordance with the IEEE-P1394b standard.

FIG. 5C shows that in this example, it will be assumed that PHYs D and C win arbitration. In accordance with a preferred embodiment of the present invention, PHYs C and D has established themselves as dominant, and can begin transmitting their Loop Test Packet (LTP) on the main bus.

FIG. 5C shows PHY A privately reporting any LTP it receives to PHY D, and PHY F privately reports any LTP it receives to PHY C. This private reporting ensures that the LTP sent by PHY C is heard by PHY D, and visa versa, thus allowing dominance to be established.

Next, FIG. 5D shows the HUID comparison process in action. The peer port is instructed to listen for any LTP and communicate any received HUID back to the local port. If an LTP is received with a higher HUID, the local PHY drops transmission of the LTP and will retry after a bus reset or the peer PHY reports the absence of a received LTP. A lower received HUID, or no received LTP, establishes the local PHY as dominant. An equivalent received HUID causes a pseudo-random back-off sequence.

A loop is detected if a port must try a specified number of tries unsuccessfully. If a port reaches a predetermined number of tries, a loop is presumed to exist and the PHY moves on to the next untested port. In a presently preferred embodiment of the present invention, a preset limit of four or five tries has proved satisfactorily.

As a result of the above process, FIG. 5D shows PHY C withdrawing its LTP given the lower HUID.

As can be appreciated by those of ordinary skill in the art, many different schemes can be employed within a HUID. By way of example, one could encode the HUID with a code which weighted the numerical value with factors such as port speed or location. This would allow the faster ports to join sooner. Also, if one desired a certain device to always join, one could program a Guaranteed Unique Identifier, or a GUID. In one preferred embodiment, the GUID may be formed by allocating the most significant bits to the GUID, or zeros if one not available, and the least significant bits to a random number.

FIG. 5E shows PHY D recognizing that it has established dominance and not found a loop. Therefore, PHY D begins the join process with PHY A by sending a Joining Request privately on Bus 1.

Meanwhile, PHY broadcasts its join intent on Bus 1. In a presently preferred embodiment, the Join Message is encoded to be higher than any HUID. This ensures that PHYs which may join late will lose to a Join Request in a HUID contest. In a preferred embodiment, it is specified that an LTP is sent for a minimum amount of time equal to a subaction gap before dominance can be determined to allow for late-corners.

Additional Methods for Establishing Dominance

As was explained above, one of the main goals of the Establish Dominance act was to have one of the pair of candidate nodes establish control of its local bus. However, there may be situations were it is more desirable for one rather than the other candidate to establish control of its bus. For example, if one candidate node already has a pre-existing connection, and the other candidate node has no connections, then it is preferred that the connected node establish dominance rather than the unconnected, or remote node, thereby avoiding long bus resets.

It is contemplated that there are many ways to embody this preference. For example, in one preferred embodiment, the indicator that indicates whether the source node has a pre-existing connection may be included along with the HUID. In another preferred embodiment, the node itself may be programmed to determine its own connection status and behave accordingly when communicating with other nodes so programmed. In another preferred embodiment, the node determines whether it has pre-existing connections. If it does, the node will immediately move to establish dominance. It the node has no connections, then the node will wait a pre-determined amount of time before moving to establish dominance.

Join

The final act in the LoopFreeBuild process is the join. Once a connection has been tested and found loop-free through the above acts, it can be joined.

The join process comprises four acts as shown in the flowchart in FIG. 6. In a presently preferred embodiment, the following acts are taken to reduce the risk of bus resets.

In act 600, remote PHYs are identified and are asked to join. In act 602, the remote PHY identified in act 600 attempts to win arbitration.

As is known by those of ordinary skill in the art, the timing of the arbitration act is critical. In a preferred embodiment of the present invention, if arbitration sought in acts 600 and 602 is won within the time period of a maximum-sized asynchronous packet, query 604 will result in a short bus reset being issued to both buses in act 606. As is known by those of ordinary skill in the art, a short bus reset is advantageous because there is minimum impact to the operation of devices connected to the bus.

If arbitration is not won within the specified timeout, the decision of act 63 will result in a long bus reset is issued in act 608.

Single Candidate Advantages

As can be appreciated by those of ordinary skill in the art, the single candidate process has certain advantages. For example, there will be a lower occurrence of long bus resets since only a maximum of two arbitration domains have to line up at a time. The single candidate process is easier to weight towards high speed connections coming up first through the use of weighted HUIDs or GUIDs. Furthermore, in a single candidate process, it may be simpler to validate and ensure that loops will not be formed. In other words, the LoopFreeBuild process is more reliable in the single candidate scenario. Finally, in a single candidate process, remote PHYs only need to be listened to on one untested port at a time.

Multiple Candidate

The discussion will now turn to the LoopFreeBuild multiple candidate case, where at any instant in time, any number of candidate connections to a given bus are selected for testing and joining.

Selection of Candidates

The selection of candidates is simplified in the multiple candidate case. Here, each local PHY selects all untested ports as candidates; there is no selection procedure as in the single candidate case.

Establish Dominance and Test for Loops

As with the single candidate LoopFreeBuild process, the acts of establishing dominance and testing for loops are combined. FIGS. 7A–7E show the multiple candidate process.

Referring now to FIG. 7A, PHYs G, H, I, J, K, and L are presented for joining. In FIG. 7A, PHYs G and J have a qualified connection 700, and PHYs K and L have a qualified connection 702.

In FIG. 7A, PHYs G and H have an untested connection 704, PHYs H and K have an untested connection 706, PHYs J and K have an untested connection 708, PHYs H and I have an untested connection 710, and PHYs I and L have an untested connection 712.

In a multiple candidate case, each PHY with untested ports arbitrates for its active bus. In practice, isolated PHYs wait a bit longer to begin arbitration to help reduce the need for long bus resets when joining.

Referring now to FIG. 7B, after winning arbitration, a Loop Test Packet (LTP) containing a HUID is transmitted on the bus, and a Loop Test Symbol (LTS) is sent through any untested ports. At all times, untested ports transmit the last HUID seen in a LTP to their respective peer ports as an LTS. Likewise, they receive HUIDs from their peers within an LTS. In FIG. 7B, PHY G transmits a LTP with a HUID of 1, PHY H transmits a HUID with a value of 2, PHY I transmits a LTP with a HUID of 3, and PHY K transmits a LTP with a HUID of 3.

After transmitting a LTP for the minimum duration, the PHY examines the received HUIDs contained within a given received LTS. If any received HUID is greater than the transmitted HUID, the PHY shall not join any connections. That is, any PHY which receives a higher HUID than it is transmitting refrains from any join attempts until the next time around.

Referring now to FIG. 7C, if the maximum received HUID is less than the transmitted HUID, the PHY is free to simultaneously join those connections which are reporting a HUID less than the transmitted HUID. If the received HUID is greater than the transmitted HUID, the PHY must withdraw its bid. Here, PHYs G and H drop out due to their lower HUIDs.

Referring now to FIG. 7C, any untested port receiving a HUID equal to the one being transmitted must refrain from any join attempt until the next time around. Here PHY L drops out due to its equal HUID.

As can be appreciated by those of ordinary skill in the art, the use of random HUIDs will allow all but looped connections to eventually activate.

Join

Referring now to FIG. 7D, the remaining nodes now send a Join Request to the other surviving candidates.

Referring finally to FIG. 7E, a bus reset is performed, and joins are performed on the remaining untested ports.

As those of ordinary skill in the art will appreciate, the system has been built with no loops and only one bus reset.

Multiple Candidate Advantages

As will be appreciated by those of ordinary skill in the art, the multiple candidate process has certain advantages. For example, there is no need for the selection of candidates process that is required in the single candidate scenario. Also, since only one bus reset is required to join multiple candidates, the multiple candidate scenario is likely to result in fewer total bus resets when coming up from ground state. Furthermore, the multiple candidate scenario is easier to weight towards servicing more untested ports per cycle. Finally, there is no special case required for the loop-back-to-self situation, where a user inadvertently connects a device to itself.

Disconnect Detection

As is appreciated by those of ordinary skill in the art, after a user removes the connection that is causing the loop, two separate buses now exist that may be connected. In a preferred embodiment of the present invention, a procedure for detecting such an event is provided. Periodically at a predetermined rate, or after a bus reset, the system will attempt to connect the quarantined branches.

State Diagrams

FIG. 8 shows sequence according to the present invention described in a machine state diagram. In a preferred embodiment of the present invention, state 800 begins the process of selecting one or more candidates. The selected candidates then arbitrate for control and to send a loop test packet in state 802. After winning arbitration, the candidates then send their loop test packets in state 804, and listen for received loop test packets, and compare their transmitted loop test packets (TxLTP) with those received (RxLTP).

If any RxLTP is greater than the TxLTP, the sequence moves to state 806; and the candidate surrenders, and will wait for the receiving bus to return to idle before trying again in state 800. For those candidates whose TxLTP is greater than or equal to the maximum RxLTP, they may join the bus in state 808. The sequence will then return to the selection of candidates state in state 800.

FIG. 9 shows a state machine diagram according to a preferred embodiment of the present invention that includes a contingency for when a device returns from a suspend state. The sequence starts in state 900 with a device in a disconnected state. When the device is connected in state 902, the system is tested for loops. If a loop is found, the device is quarantined in state 904. If no loop is found, then the device may be returned to a resuming state in state 906. If for some reason the device has a Tree-ID timeout while resuming, it will be returned to state 902. When the device becomes active on the bus, it will be in the active state as shown in state 908. Once active, if the device has a Tree-ID timeout it will be returned the untested state in state 902.

However, once a device connection has been tested for loops, it is possible for the user to place the device in a suspend mode. In accordance with a preferred embodiment of the present invention, when a device is in suspended state 910, and is resumed, it will be returned to the resuming state 906.

While embodiments and applications of this invention have been shown and described, it would be apparent to those skilled in the art that many more modifications than mentioned above are possible without departing from the inventive concepts herein. The invention, therefore, is not to be restricted except in the spirit of the appended claims.

Citations de brevets
Brevet cité Date de dépôt Date de publication Déposant Titre
US415679829 août 197729 mai 1979Doelz Melvin LSmall packet communication network
US419411313 avr. 197818 mars 1980Ncr CorporationMethod and apparatus for isolating faults in a logic circuit
US50142622 janv. 19907 mai 1991At&T Bell LaboratoriesApparatus and method for detecting and eliminating call looping in a node-by-node routing network
US527463111 mars 199128 déc. 1993Kalpana, Inc.Computer network switching system
US532181229 avr. 199114 juin 1994International Business Machines Corp.For use in computer networks
US534346127 août 199130 août 1994Ameritech Services, Inc.Full duplex digital transmission facility loop-back test, diagnostics and maintenance system
US539455621 déc. 199228 févr. 1995Apple Computer, Inc.In a computer system
US540664311 févr. 199311 avr. 1995Motorola, Inc.Method and apparatus for selecting between a plurality of communication paths
US54523306 juil. 199219 sept. 1995Digital Equipment CorporationBus-oriented switching system for asynchronous transfer mode
US549025031 déc. 19916 févr. 1996Amdahl CorporationMethod and apparatus for transferring indication of control error into data path of data switcher
US549025324 juin 19936 févr. 1996At&T Corp.Multiprocessor system using odd/even data buses with a timeshared address bus
US549548130 sept. 199427 févr. 1996Apple Computer, Inc.Method and apparatus for accelerating arbitration in a serial bus by detection of acknowledge packets
US55242541 juil. 19944 juin 1996Digital Equipment CorporationScheme for interlocking line card to an address recognition engine to support plurality of routing and bridging protocols by using network information look-up database
US553939027 janv. 199523 juil. 1996Sony CorporationMethod for setting addresses for series-connectd apparatuses
US554167023 mai 199530 juil. 1996Sony CorporationElectric apparatus and connector
US556848728 nov. 199422 oct. 1996Bull, S.A.Process for automatic conversion for porting telecommunications applications from the TCP/IP network to the OSI-CO network, and module used in this process
US556864118 janv. 199522 oct. 1996Hewlett-Packard CompanyPowerfail durable flash EEPROM upgrade
US55839225 avr. 199510 déc. 1996Radish Communication Systems, Inc.Telecommunication system for automatic switching between voice and visual data communications using forms
US562165927 oct. 199415 avr. 1997Sony CorporationCentral control device and operation devices
US563017321 déc. 199213 mai 1997Apple Computer, Inc.In a computer system
US563201627 sept. 199420 mai 1997International Business Machines CorporationIn a computer system
US564059529 juin 199317 juin 1997International Business Machines CorporationMultimedia resource reservation system with graphical interface for manual input of resource reservation value
US564251517 avr. 199224 juin 1997International Business Machines CorporationNetwork server for local and remote resources
US56546571 août 19955 août 1997Schlumberger Technologies Inc.Accurate alignment of clocks in mixed-signal tester
US56847157 juin 19954 nov. 1997Canon Information Systems, Inc.Interactive video system with dynamic video object descriptors
US570147629 nov. 199423 déc. 1997Intel CorporationMethod and apparatus for dynamically loading a driver routine in a computer memory
US570149229 mars 199623 déc. 1997Canon Kabushiki KaishaFail-safe flashing of EPROM
US570627820 juil. 19956 janv. 1998Raytheon CompanyDeterministic network protocol
US57128347 févr. 199627 janv. 1998Sony CorporationControl apparatus for data reproduction and recording devices
US571986214 mai 199617 févr. 1998Pericom Semiconductor Corp.Packet-based dynamic de-skewing for network switch with local or central clock
US57547656 juin 199519 mai 1998Intel CorporationAutomatic transport detection by attempting to establish communication session using list of possible transports and corresponding media dependent modules
US57649301 avr. 19969 juin 1998Apple Computer, Inc.Method and apparatus for providing reset transparency on a reconfigurable bus
US57846481 déc. 199521 juil. 1998Apple Computer, Inc.Token style arbitration on a serial bus by passing an unrequested bus grand signal and returning the token by a token refusal signal
US58020481 août 19961 sept. 1998Apple Computer, Inc.Method and apparatus for accelerating arbitration in a serial bus by detection of acknowledge packets
US58020571 déc. 19951 sept. 1998Apple Computer, Inc.Fly-by serial bus arbitration
US58023652 mai 19961 sept. 1998Apple Computer, Inc.Dynamic device matching using driver candidate lists
US580507325 févr. 19938 sept. 1998Sony CorporationApparatus for connecting electric appliances
US58093311 avr. 199615 sept. 1998Apple Computer, Inc.System for retrieving configuration information from node configuration memory identified by key field used as search criterion during retrieval
US581911528 juin 19966 oct. 1998Compaq Computer CorporationDriver bundle including a compressed, self-extracting, executable driver for the host processor and an adapter driver for the processor of a network adapter card
US582602711 oct. 199520 oct. 1998Citrix Systems, Inc.Method for supporting an extensible and dynamically bindable protocol stack in a distrubited process system
US5826038 *1 sept. 199520 oct. 1998Fujitsu LimitedCommunication network configuration detecting method using frame transmission
US583229830 mai 19953 nov. 1998Canon Kabushiki KaishaAdaptive graphical user interface for a network peripheral
US583576117 juil. 199710 nov. 1998Mitsubishi Denki Kabushiki KaishaInformation processing system capable of updating a BIOS programme without interrupting or stopping the operational of a system
US584515219 mars 19971 déc. 1998Apple Computer, Inc.Method for transmission of isochronous data with two cycle look ahead
US5862129 *23 déc. 199619 janv. 1999Dsc Telecom L.P.Apparatus and method for the detection and elimination of circular routed SS7 global title translated messages in a telecommunications network
US586773031 juil. 19972 févr. 1999Micron Eletronics, Inc.Method for configuration of peripherals by interpreting response from peripherals to enable selection of driver file and altering configuration file to enable loading of selected driver file
US58753018 juil. 199723 févr. 1999Apple Computer, Inc.Method and apparatus for the addition and removal of nodes from a common interconnect
US592366324 mars 199713 juil. 1999Compaq Computer CorporationMethod and apparatus for automatically detecting media connected to a network port
US593048010 oct. 199627 juil. 1999Apple Computer, Inc.Method of controlling a data stream in a computer system
US59352086 nov. 199810 août 1999Apple Computer, Inc.Incremental bus reconfiguration without bus resets
US593876423 oct. 199617 août 1999Micron Electronics, Inc.Apparatus for improved storage of computer system configuration information
US59406001 avr. 199617 août 1999Apple Computer, Inc.Isochronous channel having a linked list of buffers
US595479611 févr. 199721 sept. 1999Compaq Computer CorporationSystem and method for automatically and dynamically changing an address associated with a device disposed in a fire channel environment
US59681524 avr. 199719 oct. 1999Apple Computer, Inc.Method and apparatus for extending key space in a plug and play ROM
US597005219 sept. 199719 oct. 1999International Business Machines CorporationMethod for dynamic bandwidth testing
US598760528 févr. 199816 nov. 1999Hewlett-Packard Co.Methods and apparatus for dual-boot memory selection, update, and recovery in a programmable device
US599184225 août 199723 nov. 1999Canon Kabushiki KaishaCommunication system for providing digital data transfer, electronic equipment for transferring data using the communication system, and an interface control device
US600948012 sept. 199728 déc. 1999Telxon CorporationIntegrated device driver wherein the peripheral downloads the device driver via an I/O device after it is determined that the I/O device has the resources to support the peripheral device
US60322026 janv. 199829 févr. 2000Sony Corporation Of JapanHome audio/video network with two level device control
US603226130 déc. 199729 févr. 2000Philips Electronics North America Corp.Bus bridge with distribution of a common cycle clock to all bridge portals to provide synchronization of local buses, and method of operation thereof
US60382342 févr. 199814 mars 2000Intel CorporationEarly arbitration on a full duplex bus
US60386256 janv. 199814 mars 2000Sony Corporation Of JapanMethod and system for providing a device identification mechanism within a consumer audio/video network
US607018726 mars 199830 mai 2000Hewlett-Packard CompanyMethod and apparatus for configuring a network node to be its own gateway
US607320630 avr. 19986 juin 2000Compaq Computer CorporationMethod for flashing ESCD and variables into a ROM
US609172618 févr. 199718 juil. 2000AlcatelDevice and method for handling, assembling and transmission of data packets
US611576427 sept. 19945 sept. 2000International Business Machines CorporationAcyclic cable bus having redundant path access
US61222488 juil. 199919 sept. 2000Pioneer Electronic CorporationData transmission system with bus failure recovery
US61311291 juil. 199810 oct. 2000Sony Corporation Of JapanComputer system within an AV/C based media changer subunit providing a standarized command set
US613113427 juil. 199810 oct. 2000Primax Electronics Ltd.Hot plug-and-play converter of a universal serial bus interface
US613116317 févr. 199810 oct. 2000Cisco Technology, Inc.Network gateway mechanism having a protocol stack proxy
US613393811 mars 199917 oct. 2000Sony Corporation Of JapanDescriptor mechanism for assuring indivisible execution of AV/C operations
US61381967 oct. 199924 oct. 2000Canon Kabushiki KaishaCommunication system for providing digital data transfer, electronic equipment for transferring data using the communication system, and an interface control device
US61417021 juil. 199831 oct. 2000Sony Corporation Of JapanModel and command set for an AV/C-based disc media player recorder
US61417673 avr. 199831 oct. 2000Sony CorporationMethod of and apparatus for verifying reliability of contents within the configuration ROM of IEEE 1394-1995 devices
US614501824 nov. 19977 nov. 2000Intel CorporationMethod for hindering some types of nodes from becoming a bus arbitration controller
US615797220 nov. 19985 déc. 2000Texas Instruments IncorporatedApparatus and method for processing packetized information over a serial bus
US61607966 janv. 199812 déc. 2000Sony Corporation Of JapanMethod and system for updating device identification and status information after a local bus reset within a home audio/video network
US61675325 févr. 199826 déc. 2000Compaq Computer CorporationAutomatic system recovery
US617332711 juil. 19969 janv. 2001Jeroen De BorstObject-oriented method and apparatus for information delivery
US619218910 août 199820 févr. 2001Sony CorporationData recording method and apparatus, data recorded medium and data reproducing method and apparatus
US619911911 juin 19996 mars 2001Apple Computer, Inc.Method and apparatus for the addition and removal of nodes from a common interconnect
US620221021 août 199813 mars 2001Sony Corporation Of JapanMethod and system for collecting data over a 1394 network to support analysis of consumer behavior, marketing and customer support
US621217122 juin 19983 avr. 2001Intel CorporationMethod and apparatus for gap count determination
US621263326 juin 19983 avr. 2001Vlsi Technology, Inc.Secure data communication over a memory-mapped serial communications interface utilizing a distributed firewall
US62196972 mai 199717 avr. 20013Com CorporationMethod and apparatus for operating the internet protocol over a high-speed serial bus
US622668027 avr. 19981 mai 2001Alacritech, Inc.Intelligent network interface system method for protocol processing
US623361528 janv. 200015 mai 2001Sun Microsystems, Inc.System for maintaining strongly sequentially ordered packet flow in a ring network system with busy and failed nodes
US62336248 mai 199715 mai 2001Microsoft CorporationSystem and method for layering drivers
US624377813 oct. 19985 juin 2001Stmicroelectronics, Inc.Transaction interface for a data communication system
US62470631 juil. 199812 juin 2001Fujitsu LimitedNetwork terminal equipment capable of accommodating plurality of communication control units
US624708315 janv. 199912 juin 2001Duetsche Thomson-Brandt GmbhMethod and apparatus for bi-directionally transferring data between an IEEE 1394 bus and a device to be controlled by a control signal transmitted via the bus
US62531143 juin 199826 juin 2001Sony CorporationElectronic device controller
US62532558 mai 199726 juin 2001Microsoft CorporationSystem and method for batching data between transport and link layers in a protocol stack
US62560597 janv. 19993 juil. 2001Intel CorporationAutomatic transfer of image information between imaging device and host system
US626006317 mars 199810 juil. 2001Sony CoporationMethod and apparatus for representing devices and available information within a network of devices using object lists and object entries
US626633420 juil. 199824 juil. 2001Zayante, Inc.Method for optimizing acknowledge packet rate
US62663443 oct. 199724 juil. 2001Sony CorporationData communication method, electronic apparatus, and physical-layer-control integrated circuit
US62667012 juil. 199724 juil. 2001Sitara Networks, Inc.Apparatus and method for improving throughput on a data network
US627588926 juil. 200014 août 2001Nec CorporationConnection control apparatus
US628259719 oct. 199828 août 2001Sony CorporationInformation processing apparatus, control method, and transmission medium using thin protocol that responds to A/V control commands
US629284029 janv. 199818 sept. 2001Microsoft CorporationVoice/audio data communication with negotiated compression scheme and data header compressed in predetermined scheme
US6587904 *5 nov. 19991 juil. 2003Apple Computer, Inc.Method and apparatus for preventing loops in a full-duplex bus
US6842805 *17 mars 200311 janv. 2005Apple Computer, Inc.Method and apparatus for preventing loops in a full-duplex bus
Citations hors brevets
Référence
1"1394b IEEE Standard for a High Performance Serial Bus-Amendment 2," Institute of Electrical and Electronics Engineers, Inc. pp. I-xxx, 2002.
2"AV/C Digital Interface Command Set General Specification," Rev. 3.0, 1394 Trade Association, pp. 4-5, 20-34, Apr. 15, 1998.
3"Enhancements to the AV/C General Specification 3.0 Version 1.0FC1," 1394 Trade Association, pp. 4, 6-17 Nov. 5, 1998.
4"Fibre Channel-Methodologies for Jitter Specification," NCITS TR-25-1999, Jitter Working Group Technical Report, Rev. 10, pp. 1-96, Jun. 9, 1999.
5"IEEE Standard for a High Performance Serial Bus," IEEE Standard 1394-1995, Institute of Electrical and Electronics Engineers, Inc., pp. 1-384, approved Jul. 22, 1996.
6"IEEE Standard for a High Performance Serial Bus-Amendment 1," Institute of Electrical and Electronics Engineers, Inc., pp. 1-196, approved Mar. 30, 2000.
7"Information Technology-Microprocessor systems-Control and Status Registers (CSR) Architecture for microcomputer buses," ANSI/IEEE Standard 1212, The Institute of Electrical and Electronics Engineers, Inc. pp. I-122, 1994 Edition.
8"P1394a Draft Standard for a High Performance Serial Bus (Supplement)," Draft 3.0, Institute of Electrical and Electronics Engineers, Inc., pp. 1-187, Jun. 30, 1999.
9"P1394b IEEE Draft Standard for a High Performance Serial Bus (High Speed Supplement) P1394b Draft 1.3.3," Institute of Electrical and Electronics Engineers, Inc., pp. 1-408, Nov. 16, 2001.
10Bregni et al., "Jitter Testing Technique and Results at VC-4 Desynchronizer Output of SDH Equipment," IEEE International Conference on Communications, vol. 3, pp. 1407-1410, May 12, 1994.
11Bregni et al., "Jitter Testing Technique and Results at VC-4 Desynchronizer Output of SDH Equipment," IEEE Transactions on Instrumentation and Measurement, vol. 44, Issue 3, pp. 675-678, Jun. 1995.
12 *P1394a Draft Standard for a High Performance Serial Bus (Supplement) Draft 2.0 Mar. 15, 1998.
13Shiwen et al., "Parallel positive justification in SDH C-4 mapping," IEEE International Conference on Communications, vol. 3, pp. 1577-1581, Jun. 12, 1997.
Référencé par
Brevet citant Date de dépôt Date de publication Déposant Titre
US7389371 *19 mars 200717 juin 2008Apple Inc.Method and apparatus for loop breaking in a data bus
US7539154 *17 oct. 200026 mai 2009Cisco Technology, Inc.Method and apparatus to detect and break loop configuration
US75900654 août 200415 sept. 2009Microsoft CorporationEqual-opportunity bandwidth regulation
US77069011 oct. 200427 avr. 2010Microsoft CorporationLow latency real-time audio streaming
US7756594 *14 juin 200413 juil. 2010Microsoft CorporationSystems and methods for parsing flexible audio codec topologies
US788047426 juil. 20041 févr. 2011Cisco Technology Inc.Distributed network repeater system
US80783021 déc. 200913 déc. 2011Microsoft CorporationLow latency real-time audio streaming
US20100257400 *18 mars 20107 oct. 2010Colin Whitby-StrevensNetwork loop healing apparatus and methods
US20120221692 *24 févr. 201130 août 2012Steiner Moritz MMethod and apparatus for localization in peer-to-peer systems
Classifications
Classification aux États-Unis710/104, 709/221, 370/256
Classification internationaleH04L12/64, H04L12/26, H04L12/40, G06F13/00, H04L12/28, G06F15/16, H04B1/56
Classification coopérativeH04L12/40078, H04L12/2697, H04L12/40123, H04L12/6418, G06F13/426, H04L12/40117, H04L43/50
Classification européenneH04L12/64B, H04L12/40F10, H04L12/40F11, H04L12/26T, H04L12/40F4, H04L43/50, G06F13/42D6
Événements juridiques
DateCodeÉvénementDescription
20 août 2014FPAYFee payment
Year of fee payment: 8
18 août 2010FPAYFee payment
Year of fee payment: 4
13 juin 2007ASAssignment
Owner name: APPLE INC., CALIFORNIA
Free format text: CHANGE OF NAME;ASSIGNOR:APPLE COMPUTER, INC.;REEL/FRAME:019668/0117
Effective date: 20070109
Owner name: APPLE INC.,CALIFORNIA
Free format text: CHANGE OF NAME;ASSIGNOR:APPLE COMPUTER, INC.;US-ASSIGNMENT DATABASE UPDATED:20100223;REEL/FRAME:19668/117
Free format text: CHANGE OF NAME;ASSIGNOR:APPLE COMPUTER, INC.;US-ASSIGNMENT DATABASE UPDATED:20100420;REEL/FRAME:19668/117
Free format text: CHANGE OF NAME;ASSIGNOR:APPLE COMPUTER, INC.;US-ASSIGNMENT DATABASE UPDATED:20100504;REEL/FRAME:19668/117