|Numéro de publication||US7194564 B2|
|Type de publication||Octroi|
|Numéro de demande||US 11/021,337|
|Date de publication||20 mars 2007|
|Date de dépôt||21 déc. 2004|
|Date de priorité||5 nov. 1999|
|État de paiement des frais||Payé|
|Autre référence de publication||US6587904, US6842805, US6985981, US7389371, US20050117528, US20070255871|
|Numéro de publication||021337, 11021337, US 7194564 B2, US 7194564B2, US-B2-7194564, US7194564 B2, US7194564B2|
|Inventeurs||Jerrold V. Hauck, Colin Whitby-Strevens|
|Cessionnaire d'origine||Apple Computer, Inc.|
|Exporter la citation||BiBTeX, EndNote, RefMan|
|Citations de brevets (103), Citations hors brevets (13), Référencé par (15), Classifications (24), Événements juridiques (3)|
|Liens externes: USPTO, Cession USPTO, Espacenet|
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.
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.
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.
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
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.
Referring now to
The acts shown in
Single Candidate LoopFreeBuild
Selection of Candidates
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.
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.
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
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.
The process continues in
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.
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.
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,
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.
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.
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
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.
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.
Referring now to
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
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
Referring now to
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.
Referring now to
Referring finally to
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.
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.
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.
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.
|Brevet cité||Date de dépôt||Date de publication||Déposant||Titre|
|US4156798||29 août 1977||29 mai 1979||Doelz Melvin L||Small packet communication network|
|US4194113||13 avr. 1978||18 mars 1980||Ncr Corporation||Method and apparatus for isolating faults in a logic circuit|
|US5014262||2 janv. 1990||7 mai 1991||At&T Bell Laboratories||Apparatus and method for detecting and eliminating call looping in a node-by-node routing network|
|US5274631||11 mars 1991||28 déc. 1993||Kalpana, Inc.||Computer network switching system|
|US5321812||29 avr. 1991||14 juin 1994||International Business Machines Corp.||Loop detection and dissolution in a focal point network|
|US5343461||27 août 1991||30 août 1994||Ameritech Services, Inc.||Full duplex digital transmission facility loop-back test, diagnostics and maintenance system|
|US5394556||21 déc. 1992||28 févr. 1995||Apple Computer, Inc.||Method and apparatus for unique address assignment, node self-identification and topology mapping for a directed acyclic graph|
|US5406643||11 févr. 1993||11 avr. 1995||Motorola, Inc.||Method and apparatus for selecting between a plurality of communication paths|
|US5452330||6 juil. 1992||19 sept. 1995||Digital Equipment Corporation||Bus-oriented switching system for asynchronous transfer mode|
|US5490250||31 déc. 1991||6 févr. 1996||Amdahl Corporation||Method and apparatus for transferring indication of control error into data path of data switcher|
|US5490253||24 juin 1993||6 févr. 1996||At&T Corp.||Multiprocessor system using odd/even data buses with a timeshared address bus|
|US5495481||30 sept. 1994||27 févr. 1996||Apple Computer, Inc.||Method and apparatus for accelerating arbitration in a serial bus by detection of acknowledge packets|
|US5524254||1 juil. 1994||4 juin 1996||Digital Equipment Corporation||Scheme for interlocking line card to an address recognition engine to support plurality of routing and bridging protocols by using network information look-up database|
|US5539390||27 janv. 1995||23 juil. 1996||Sony Corporation||Method for setting addresses for series-connectd apparatuses|
|US5541670||23 mai 1995||30 juil. 1996||Sony Corporation||Electric apparatus and connector|
|US5568487||28 nov. 1994||22 oct. 1996||Bull, 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|
|US5568641||18 janv. 1995||22 oct. 1996||Hewlett-Packard Company||Powerfail durable flash EEPROM upgrade|
|US5583922||5 avr. 1995||10 déc. 1996||Radish Communication Systems, Inc.||Telecommunication system for automatic switching between voice and visual data communications using forms|
|US5621659||27 oct. 1994||15 avr. 1997||Sony Corporation||Central control device and operation devices|
|US5630173||21 déc. 1992||13 mai 1997||Apple Computer, Inc.||Methods and apparatus for bus access arbitration of nodes organized into acyclic directed graph by cyclic token passing and alternatively propagating request to root node and grant signal to the child node|
|US5632016||27 sept. 1994||20 mai 1997||International Business Machines Corporation||System for reformatting a response packet with speed code from a source packet using DMA engine to retrieve count field and address from source packet|
|US5640595||29 juin 1993||17 juin 1997||International Business Machines Corporation||Multimedia resource reservation system with graphical interface for manual input of resource reservation value|
|US5642515||17 avr. 1992||24 juin 1997||International Business Machines Corporation||Network server for local and remote resources|
|US5654657||1 août 1995||5 août 1997||Schlumberger Technologies Inc.||Accurate alignment of clocks in mixed-signal tester|
|US5684715||7 juin 1995||4 nov. 1997||Canon Information Systems, Inc.||Interactive video system with dynamic video object descriptors|
|US5701476||29 nov. 1994||23 déc. 1997||Intel Corporation||Method and apparatus for dynamically loading a driver routine in a computer memory|
|US5701492||29 mars 1996||23 déc. 1997||Canon Kabushiki Kaisha||Fail-safe flashing of EPROM|
|US5706278||20 juil. 1995||6 janv. 1998||Raytheon Company||Deterministic network protocol|
|US5712834||7 févr. 1996||27 janv. 1998||Sony Corporation||Control apparatus for data reproduction and recording devices|
|US5719862||14 mai 1996||17 févr. 1998||Pericom Semiconductor Corp.||Packet-based dynamic de-skewing for network switch with local or central clock|
|US5754765||6 juin 1995||19 mai 1998||Intel Corporation||Automatic transport detection by attempting to establish communication session using list of possible transports and corresponding media dependent modules|
|US5764930||1 avr. 1996||9 juin 1998||Apple Computer, Inc.||Method and apparatus for providing reset transparency on a reconfigurable bus|
|US5784648||1 déc. 1995||21 juil. 1998||Apple 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|
|US5802048||1 août 1996||1 sept. 1998||Apple Computer, Inc.||Method and apparatus for accelerating arbitration in a serial bus by detection of acknowledge packets|
|US5802057||1 déc. 1995||1 sept. 1998||Apple Computer, Inc.||Fly-by serial bus arbitration|
|US5802365||2 mai 1996||1 sept. 1998||Apple Computer, Inc.||Dynamic device matching using driver candidate lists|
|US5805073||25 févr. 1993||8 sept. 1998||Sony Corporation||Apparatus for connecting electric appliances|
|US5809331||1 avr. 1996||15 sept. 1998||Apple Computer, Inc.||System for retrieving configuration information from node configuration memory identified by key field used as search criterion during retrieval|
|US5819115||28 juin 1996||6 oct. 1998||Compaq Computer Corporation||Driver bundle including a compressed, self-extracting, executable driver for the host processor and an adapter driver for the processor of a network adapter card|
|US5826027||11 oct. 1995||20 oct. 1998||Citrix Systems, Inc.||Method for supporting an extensible and dynamically bindable protocol stack in a distrubited process system|
|US5826038 *||1 sept. 1995||20 oct. 1998||Fujitsu Limited||Communication network configuration detecting method using frame transmission|
|US5832298||30 mai 1995||3 nov. 1998||Canon Kabushiki Kaisha||Adaptive graphical user interface for a network peripheral|
|US5835761||17 juil. 1997||10 nov. 1998||Mitsubishi Denki Kabushiki Kaisha||Information processing system capable of updating a BIOS programme without interrupting or stopping the operational of a system|
|US5845152||19 mars 1997||1 déc. 1998||Apple Computer, Inc.||Method for transmission of isochronous data with two cycle look ahead|
|US5862129 *||23 déc. 1996||19 janv. 1999||Dsc Telecom L.P.||Apparatus and method for the detection and elimination of circular routed SS7 global title translated messages in a telecommunications network|
|US5867730||31 juil. 1997||2 févr. 1999||Micron 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|
|US5875301||8 juil. 1997||23 févr. 1999||Apple Computer, Inc.||Method and apparatus for the addition and removal of nodes from a common interconnect|
|US5923663||24 mars 1997||13 juil. 1999||Compaq Computer Corporation||Method and apparatus for automatically detecting media connected to a network port|
|US5930480||10 oct. 1996||27 juil. 1999||Apple Computer, Inc.||Software architecture for controlling data streams based on linked command blocks|
|US5935208||6 nov. 1998||10 août 1999||Apple Computer, Inc.||Incremental bus reconfiguration without bus resets|
|US5938764||23 oct. 1996||17 août 1999||Micron Electronics, Inc.||Apparatus for improved storage of computer system configuration information|
|US5940600||1 avr. 1996||17 août 1999||Apple Computer, Inc.||Isochronous channel having a linked list of buffers|
|US5954796||11 févr. 1997||21 sept. 1999||Compaq Computer Corporation||System and method for automatically and dynamically changing an address associated with a device disposed in a fire channel environment|
|US5968152||4 avr. 1997||19 oct. 1999||Apple Computer, Inc.||Method and apparatus for extending key space in a plug and play ROM|
|US5970052||19 sept. 1997||19 oct. 1999||International Business Machines Corporation||Method for dynamic bandwidth testing|
|US5987605||28 févr. 1998||16 nov. 1999||Hewlett-Packard Co.||Methods and apparatus for dual-boot memory selection, update, and recovery in a programmable device|
|US5991842||25 août 1997||23 nov. 1999||Canon Kabushiki Kaisha||Communication system for providing digital data transfer, electronic equipment for transferring data using the communication system, and an interface control device|
|US6009480||12 sept. 1997||28 déc. 1999||Telxon Corporation||Integrated 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|
|US6032202||6 janv. 1998||29 févr. 2000||Sony Corporation Of Japan||Home audio/video network with two level device control|
|US6032261||30 déc. 1997||29 févr. 2000||Philips 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|
|US6038234||2 févr. 1998||14 mars 2000||Intel Corporation||Early arbitration on a full duplex bus|
|US6038625||6 janv. 1998||14 mars 2000||Sony Corporation Of Japan||Method and system for providing a device identification mechanism within a consumer audio/video network|
|US6070187||26 mars 1998||30 mai 2000||Hewlett-Packard Company||Method and apparatus for configuring a network node to be its own gateway|
|US6073206||30 avr. 1998||6 juin 2000||Compaq Computer Corporation||Method for flashing ESCD and variables into a ROM|
|US6091726||18 févr. 1997||18 juil. 2000||Alcatel||Device and method for handling, assembling and transmission of data packets|
|US6115764||27 sept. 1994||5 sept. 2000||International Business Machines Corporation||Acyclic cable bus having redundant path access|
|US6122248||8 juil. 1999||19 sept. 2000||Pioneer Electronic Corporation||Data transmission system with bus failure recovery|
|US6131129||1 juil. 1998||10 oct. 2000||Sony Corporation Of Japan||Computer system within an AV/C based media changer subunit providing a standarized command set|
|US6131134||27 juil. 1998||10 oct. 2000||Primax Electronics Ltd.||Hot plug-and-play converter of a universal serial bus interface|
|US6131163||17 févr. 1998||10 oct. 2000||Cisco Technology, Inc.||Network gateway mechanism having a protocol stack proxy|
|US6133938||11 mars 1999||17 oct. 2000||Sony Corporation Of Japan||Descriptor mechanism for assuring indivisible execution of AV/C operations|
|US6138196||7 oct. 1999||24 oct. 2000||Canon Kabushiki Kaisha||Communication system for providing digital data transfer, electronic equipment for transferring data using the communication system, and an interface control device|
|US6141702||1 juil. 1998||31 oct. 2000||Sony Corporation Of Japan||Model and command set for an AV/C-based disc media player recorder|
|US6141767||3 avr. 1998||31 oct. 2000||Sony Corporation||Method of and apparatus for verifying reliability of contents within the configuration ROM of IEEE 1394-1995 devices|
|US6145018||24 nov. 1997||7 nov. 2000||Intel Corporation||Method for hindering some types of nodes from becoming a bus arbitration controller|
|US6157972||20 nov. 1998||5 déc. 2000||Texas Instruments Incorporated||Apparatus and method for processing packetized information over a serial bus|
|US6160796||6 janv. 1998||12 déc. 2000||Sony Corporation Of Japan||Method and system for updating device identification and status information after a local bus reset within a home audio/video network|
|US6167532||5 févr. 1998||26 déc. 2000||Compaq Computer Corporation||Automatic system recovery|
|US6173327||11 juil. 1996||9 janv. 2001||Jeroen De Borst||Object-oriented method and apparatus for information delivery|
|US6192189||10 août 1998||20 févr. 2001||Sony Corporation||Data recording method and apparatus, data recorded medium and data reproducing method and apparatus|
|US6199119||11 juin 1999||6 mars 2001||Apple Computer, Inc.||Method and apparatus for the addition and removal of nodes from a common interconnect|
|US6202210||21 août 1998||13 mars 2001||Sony Corporation Of Japan||Method and system for collecting data over a 1394 network to support analysis of consumer behavior, marketing and customer support|
|US6212171||22 juin 1998||3 avr. 2001||Intel Corporation||Method and apparatus for gap count determination|
|US6212633||26 juin 1998||3 avr. 2001||Vlsi Technology, Inc.||Secure data communication over a memory-mapped serial communications interface utilizing a distributed firewall|
|US6219697||2 mai 1997||17 avr. 2001||3Com Corporation||Method and apparatus for operating the internet protocol over a high-speed serial bus|
|US6226680||27 avr. 1998||1 mai 2001||Alacritech, Inc.||Intelligent network interface system method for protocol processing|
|US6233615||28 janv. 2000||15 mai 2001||Sun Microsystems, Inc.||System for maintaining strongly sequentially ordered packet flow in a ring network system with busy and failed nodes|
|US6233624||8 mai 1997||15 mai 2001||Microsoft Corporation||System and method for layering drivers|
|US6243778||13 oct. 1998||5 juin 2001||Stmicroelectronics, Inc.||Transaction interface for a data communication system|
|US6247063||1 juil. 1998||12 juin 2001||Fujitsu Limited||Network terminal equipment capable of accommodating plurality of communication control units|
|US6247083||15 janv. 1999||12 juin 2001||Duetsche Thomson-Brandt Gmbh||Method 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|
|US6253114||3 juin 1998||26 juin 2001||Sony Corporation||Electronic device controller|
|US6253255||8 mai 1997||26 juin 2001||Microsoft Corporation||System and method for batching data between transport and link layers in a protocol stack|
|US6256059||7 janv. 1999||3 juil. 2001||Intel Corporation||Automatic transfer of image information between imaging device and host system|
|US6260063||17 mars 1998||10 juil. 2001||Sony Coporation||Method and apparatus for representing devices and available information within a network of devices using object lists and object entries|
|US6266334||20 juil. 1998||24 juil. 2001||Zayante, Inc.||Method for optimizing acknowledge packet rate|
|US6266344||3 oct. 1997||24 juil. 2001||Sony Corporation||Data communication method, electronic apparatus, and physical-layer-control integrated circuit|
|US6266701||2 juil. 1997||24 juil. 2001||Sitara Networks, Inc.||Apparatus and method for improving throughput on a data network|
|US6275889||26 juil. 2000||14 août 2001||Nec Corporation||Connection control apparatus|
|US6282597||19 oct. 1998||28 août 2001||Sony Corporation||Information processing apparatus, control method, and transmission medium using thin protocol that responds to A/V control commands|
|US6292840||29 janv. 1998||18 sept. 2001||Microsoft Corporation||Voice/audio data communication with negotiated compression scheme and data header compressed in predetermined scheme|
|US6587904 *||5 nov. 1999||1 juil. 2003||Apple Computer, Inc.||Method and apparatus for preventing loops in a full-duplex bus|
|US6842805 *||17 mars 2003||11 janv. 2005||Apple Computer, Inc.||Method and apparatus for preventing loops in a full-duplex bus|
|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.|
|10||Bregni 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.|
|11||Bregni 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.|
|13||Shiwen et al., "Parallel positive justification in SDH C-4 mapping," IEEE International Conference on Communications, vol. 3, pp. 1577-1581, Jun. 12, 1997.|
|Brevet citant||Date de dépôt||Date de publication||Déposant||Titre|
|US7389371 *||19 mars 2007||17 juin 2008||Apple Inc.||Method and apparatus for loop breaking in a data bus|
|US7539154 *||17 oct. 2000||26 mai 2009||Cisco Technology, Inc.||Method and apparatus to detect and break loop configuration|
|US7590065||4 août 2004||15 sept. 2009||Microsoft Corporation||Equal-opportunity bandwidth regulation|
|US7706901||1 oct. 2004||27 avr. 2010||Microsoft Corporation||Low latency real-time audio streaming|
|US7756594 *||14 juin 2004||13 juil. 2010||Microsoft Corporation||Systems and methods for parsing flexible audio codec topologies|
|US7880474||26 juil. 2004||1 févr. 2011||Cisco Technology Inc.||Distributed network repeater system|
|US8078302||1 déc. 2009||13 déc. 2011||Microsoft Corporation||Low latency real-time audio streaming|
|US8909747 *||24 févr. 2011||9 déc. 2014||Alcatel Lucent||Method and apparatus for localization in peer-to-peer systems|
|US20050278168 *||14 juin 2004||15 déc. 2005||Microsoft Corporation||Systems and methods for parsing flexible audio codec topologies|
|US20060031542 *||4 août 2004||9 févr. 2006||Microsoft Corporation||Equal-opportunity bandwidth regulation|
|US20060041895 *||4 août 2004||23 févr. 2006||Microsoft Corporation||Systems and methods for interfacing with codecs across an architecture optimized for audio|
|US20060074637 *||1 oct. 2004||6 avr. 2006||Microsoft Corporation||Low latency real-time audio streaming|
|US20070255871 *||19 mars 2007||1 nov. 2007||Apple Computer, Inc.||Method and apparatus for loop breaking in a data bus|
|US20100257400 *||18 mars 2010||7 oct. 2010||Colin Whitby-Strevens||Network loop healing apparatus and methods|
|US20120221692 *||24 févr. 2011||30 août 2012||Steiner Moritz M||Method and apparatus for localization in peer-to-peer systems|
|Classification aux États-Unis||710/104, 709/221, 370/256|
|Classification internationale||H04L12/64, H04L12/26, H04L12/40, G06F13/00, H04L12/28, G06F15/16, H04B1/56|
|Classification coopérative||H04L12/40078, H04L12/2697, H04L12/40123, H04L12/6418, G06F13/426, H04L12/40117, H04L43/50|
|Classification européenne||H04L12/64B, H04L12/40F10, H04L12/40F11, H04L12/26T, H04L12/40F4, H04L43/50, G06F13/42D6|
|13 juin 2007||AS||Assignment|
Owner name: APPLE INC.,CALIFORNIA
Free format text: CHANGE OF NAME;ASSIGNOR:APPLE COMPUTER, INC.;REEL/FRAME:019668/0117
Effective date: 20070109
|18 août 2010||FPAY||Fee payment|
Year of fee payment: 4
|20 août 2014||FPAY||Fee payment|
Year of fee payment: 8