Title:
【発明の名称】非サイクル有向グラフに関わる固有アドレス割当て、ノード自己識別及びトポロジーマッピングの方法及び装置
Document Type and Number:
Japanese Patent JP3243613
Kind Code:
B2
Abstract:
A node identification system is described for use in a computer system in which the various components of the system are interconnected via nodes on a communications bus. Once the topology of the nodes has been resolved into an acyclic directed graph, each node may be assigned a non-predetermined unique address. Each node having a plurality of ports has an apriori assigned priority for port selection. Each child node connected to a parent is allowed to respond in the predetermined sequence depending upon the port through which it is connected to its parent. Each node in the graph will announce its presence according to its location in the graph. Each receives an address incremented from the previous addresses assigned, thereby insuring uniqueness. The same mechanism may be implemented to allow each node in turn to broadcast information on the bus concerning the parameters of its local host. Likewise, additional information may be conveyed from each node concerning connections to other nodes thereby allowing a host system to generate a map of the resolved topology including any information about disabled links which may be used for redundancy purposes.
Inventors:
Oppressk, florin
Application Number:
JP51531694A
Publication Date:
January 07, 2002
Filing Date:
December 16, 1993
Export Citation:
Assignee:
Apple Computer Incorporated
International Classes:
G06F15/16; G06F13/00; G06F13/14; G06F13/36; G06F13/362; G06F13/40; G06F15/173; G06F15/177; H04L12/40; H04L12/44; H04L29/12; H04L12/56; H04L12/64; (IPC1-7): G06F13/362; G06F13/14; H04L12/44
Domestic Patent References:
| JP62237840A | ||||
| JP4196641A | ||||
| JP4196642A | ||||
| JP1272248A | ||||
| JP5153148A |
Other References:
高野 誠「マルチメディアＬＡＮにおける自動構成管理方法」、電子情報通信学会技術報告 ＩＮ９２−２８〜４３、１９９２−９−１７、Ｖｏｌ．９２ Ｎｏ．２１９、ｐ．３３−３８
Attorney, Agent or Firm:
Masaki Yamakawa (5 outside)