(12) United States Patent
`(12) United States Patent
`Gilbert et al.
`Gilbert et al.
`
`II
`US006490247B1
`US0064.90247B1
`(io) Patent No.:
`US 6,490,247 B1
`(10) Patent No.:
`US 6,490,247 B1
`(45) Date of Patent:
`*Dec. 3,2002
`(45) Date of Patent:
`*Dec. 3, 2002
`
`(54) RING-ORDERED DYNAMICALLY
`(54) RING-ORDERED DYNAMICALLY
`RECONFIGURABLE NETWORK USING AN
`RECONFIGURABLE NETWORK USING AN
`EXISTING COMMUNICATIONS SYSTEM
`
`EXISTING COMMUNICATIONS SYSTEM
`
`Inventors: Timothy G. Gilbert, Vermillion, SD
`(75)
`.
`FTM:
`e
`-- - -
`(75) Inventors ?????????????.???SD
`(US); Istvan Fekete, Dakota Dunes, SD
`(US); Istvan Fekete, Dakota Dunes, SD
`-
`e
`-
`-
`(US); Jeffrey Schindler, Sioux City, IA
`? Jeffrey Schindler, Sioux City, IA
`(US)
`
`5,412,652 A + 5/1995 Lu. - - - - - - - - - - - - - - - - - - - - - - - - - - - - - 370/223
`
`6/1994 Chang et al. ...
`.... 370/60
`5,323,388 A
`5,323,388 A 6/1994 Chang et al. ................. 370/60
`5,365,265 A
`11/1994 Shibata et al. ..
`.... 348/15
`5,365,265 A 11/1994 Shibata et al. ................ 348/15
`5,412,652 A *
`5/1995 Lu
`.. 370/223
`5,416,781 A
`5/1995 Ruiz
`370/110.1
`5,416,781 A
`5/1995 Ruiz ....................... 370/110.1
`5,444,703 A
`8/1995 Gagliardi et al.
`. 370/60.1
`5,444,703 A 8/1995 Gagliardi et al. .......... 370/60.1
`5,459,720 A 10/1995 Iliev et al. .................... 370/60
`5,459,720 A
`.... 370/60
`10/1995 Iliev et al
`5.463.623 A 10
`-
`5,463,623 A
`.... 370/79
`10/1995 Grimes et al. ..
`
`
` ? ??? ???
`• ?
`1995/
`Grimes et al. ................ 370/79
`5,517,489 A * 5/1996 Ogusa ........................ 370/223
`5,517,489 A *
`.. 370/223
`5/1996 Ogusa
`FOREIGN PATENT DOCUMENTS
`FOREIGN PATENT DOCUMENTS
`0127138
`12/1984
`()127138
`12/1984
`2590384
`5/1987
`2590384
`5/1987
`OTHER PUBLICATIONS
`OTHER PUBLICATIONS
`Marsden, P., "Interworking IEEE 802/FDDI LAN's via the
`Marsden, P., “Interworking IEEE 802/FDDI LAN's via the
`Proceedings
`ISDN frame
`relay bearer
`service",
`ISDN frame relay bearer service”, Proceedings of the IEEE,
`vol. 79, No. 2, pp. 223-229, (Feb. 1991).
`vol. 79, No. 2, pp. 223–229, (Feb. 1991).
`* cited by examiner
`* cited by examiner
`Primary Examiner—Dang Ton
`Primary Examiner—Dang Ton
`(74) Attorney, Agent, or Firm—Scott Charles Richardson;
`(74) Attorney, Agent, or Firm—Scott Charles Richardson;
`(21) Appl. No.: 08/670,609
`John M. Dahl; Schwegman, Lundberg, Woessner & Kluth
`(21) Appl. No.: 08/670,609
`John M. Dahl; Schwegman, Lundberg, Woessner & Kluth
`Jun. 26, 1996
`(22) Filed:
`(57)
`ABSTRACT
`(22) Filed:
`Jun. 26, 1996
`ABSTRACT
`(57)
`II04.I 3/00
`(51) ?nt. Cl." ................................................... H04J 3/00
`(51) Int. CI.7
`A ring-ordered dynamically reconfigurable computer net
`A ring-ordered dynamically reconfigurable computer net­
`(52) U.S. CI
`370/222; 370/224
`work utilizing an existing communications system. The
`(52) U.S. Cl. ................
`... 370/222; 370/224
`work utilizing an existing communications system. The
`(58) Field of Search
`370/216, 217,
`network comprises a plurality of nodes. Each node is
`(58) Field of Search ................................. 370/216, 217,
`network comprises a plurality of nodes. Each node is
`370/220, 222, 223, 224, 225, 227, 228,
`coupled to the existing communications system by two data
`370/220, 222, 223, 224, 225, 227, 228,
`coupled to the existing
`communications
`
`system by two data
`408, 407, 406, 405, 404, 403, 402, 522,
`channels and a control channel. The network is established
`408, 407, 406, 405, 404, 403, 402, 522,
`channels and a control channel. The network is established
`431, 524, 537,
`
`465, 468, 252, 254; 395/181;
`431, 524, 537, 465, 468, 252, 254; 395/181;
`by each data channel of each node connecting operably to a
`
`
`of by each data channel each node connecting
`operably
`340/827, 825.01,
`825.03;
`379/221
`data channel of another node. All
`
`the nodes are ordered
`in
`340/827, 825.01, 825.03; 379/221
`data channel of another node. All the nodes are ordered in a
`
`ring. The control channel of each node is operably connected
`ring. The control channel of each node is operably connected
`to the switch of the existing communications system. The
`to the switch of the existing communications
`system. The
`network also comprises a network manager to establish the
`network also comprises &l network manager to establish the
`network, facilitate communication among the nodes, and
`network, facilitate communication among the nodes, and
`dynamically reconfigure the network without disturbing
`dynamically reconfigure the network without disturbing
`communication among the nodes. Optionally, each node
`communication among the nodes. Optionally, each node
`connects to the network only when it actually needs to
`connects to the network only when it actually needs to
`communicate with another node
`communicate with another node.
`-
`50 Claims, 5 Drawing Sheets
`50 Claims, 5 Drawing Sheets
`
`(73) Assignee: Gateway, Inc, Poway, CA (US)
`(73) Assignee: Gateway, Inc, Poway, CA
`(US)
`This patent issued on a continued pros-
`(*) Notice:
`This patent issued on a continued pros­
`( * ) Notice:
`ecution application filed under 37 CFR
`ecution application filed under 37 CFR
`1.53(d), and is subject to the twenty year
`1.53(d), and
`is
`
`subject to the twenty year
`patent term provisions of 35 U.S.C.
`patent term provisions of 35 U.S.C.
`154(a)(2).
`154(a)(2).
`
`EP
`EP
`FR
`FR
`
`Subject to any disclaimer, the term of this
`the term of this
`
`Subject to any disclaimer,
`patent is extended or adjusted under 35
`patent is extended or adjusted under 35
`U.S.C. 154(b) by 0 days.
`U.S.C. 154(b) by 0 days.
`
`(56)
`(56)
`
`References Cited
`References Cited
`U.S. PATENT DOCUMENTS
`U.S. PATENT DOCUMENTS
`5/1987 Karbowiak et al.
`4,663,748 A
`.... 370/89
`4,663,748 A 5/1987 Karbowiak et al. ........... 370/89
`9/1989 Black et al
`.... 370/60
`4,866,703 A
`4,866,703 A 9/1989 Black et al. .................. 370/60
`... 379/93
`10/1989 Pemmaraju
`4,872,197 A
`4,872,197 A 10/1989 Pemmaraju .................. 379/93
`370/85.14
`3/1991 Black
`4,999,832 A
`3/1991 Black ............... ... 370/85.14
`4,999,832 A.
`.. 370/223
`3/1991 Farinholt et al. .
`5,003,531 A *
`5,003,531 A * 3/1991 Farinholt et al. ........... 370/223
`.. 370/408
`8/1991 Ebersole et al. ..
`5,041,963 A *
`5,041,963 A * 8/1991 Ebersole et al. ............ 370/408
`. 370/94.1
`8/1993 Barwigk et al. ..
`5,233,607 A
`5,233,607 A 8/1993 Barwigk et al. ........... 370/94.1
`
`of
`
`to
`
`a
`
`a
`
`
`
`1 2
`NODE
`
`10HZ^
`NODE
`
`T-
`22
`
`28'
`
`24
`i
`5
`26
`
`30
`
`14
`NODE
`
`-w
`
`v®
`
`20
`SWITCH
`
`1 6
`NODE
`
`1 8
`NODE
`
`BUNGIE - EXHIBIT 1021
`
`

`

`U.S. Patent
`U.S. Patent
`
`Dec. 3,2002
`Dec. 3, 2002
`
`Sheet 1 of 5
`Sheet 1 of 5
`
`US 6,490,247 B1
`US 6,490,247 B1
`
`
`
`1 4 -
`NODE
`
`1 2
`NODE
`
`.V
`
`.V
`.V
`.V
`28
`.v
`sV .v
`.V
`
`24
`i
`
`\
`\
`
`26
`
`V.
`
`v.
`30
`v.
`V,
`V. v.
`V,
`y.
`
`20
`SWITCH
`
`\
`\
`A
`,v
`,v
`.V
`.V
`.V
`.V
`,\
`.V
`
`FIG. 1
`
`104
`NODE
`
`f
`22
`
`1 6
`NODE
`
`
`
`36-
`36
`MONITOR
`MONITOR
`
`34-
`J4
`COMPUTER
`COMPUTER
`38
`38
`KEYBOARD
`KEYBOARD
`
`
`
`FIG. 2
`
`1 8
`NODE
`
`40
`s
`
`

`

`U.S. Patent
`U.S. Patent
`
`Dec. 3,2002
`Dec. 3, 2002
`
`Sheet 2 of 5
`Sheet 2 of 5
`
`US 6,490,247 B1
`US 6,490,247 B1
`
`41
`4
`NETWORK CARD
`NETWORK CARD
`i
`
`45
`
`5 3 - i ~ 4 7
`53
`CONNECTOR
`CONNECTOR
`
`49
`
`-51
`LOGIC
`
`FIG. 3
`FIG. 3
`
`7
`43
`43
`INTERFACE
`|NTERFACE
`
`44 -
`4.4
`
`X=TOTAL NUMBER
`X=TOTAL NUMBER
`OF NODES
`OF NODES
`N = 1
`N = 1
`
`
`
`
`
`46-
`46
`
`48 -
`48
`
`50-
`50
`
`5 4 -
`54
`
`5 6 -
`56
`
`NODE N CONTACTS
`???? ? ???????S
`N + 1
`
`NODE N CONNECTS
`???? ? ???????S
`TO NODE N+1
`TO NODE N+1
`
`N + 1 I
`I
`
`N = N +1
`
`52
`
`N = X?
`
`
`
`NO
`
`YES
`YES
`
`NODE X CONTACTS
`??[?? ????????S
`NODE 1
`NODE 1
`
`I
`
`NODE X CONNECTS
`??D? ????????S
`TO NODE 1
`?? ??D?1
`
`FIG. 4
`FIG. 4.
`
`

`

`U.S. Patent
`U.S. Patent
`
`Dec. 3,2002
`Dec. 3, 2002
`
`Sheet 3 of 5
`Sheet 3 of 5
`
`US 6,490,247 B1
`US 6,490,247 B1
`
`94
`94
`NODE
`
`92
`-82
`
`90
`
`s O
`
`88
`4
`
`/
`/
`
`/
`
`\
`
`/
`/
`
`.v
`-W" r96
`^ /T \ -I SWITCH
`
`.V
`
`.y
`
`sV
`Cy
`x1
`.v
`
`76
`
`
`
`X
`
`78
`s
`
`y'
`
`/
`7 ,
`7y
`Vj
`7,
`7 j
`7,
`7,
`7,
`7,
`
`\
`\
`\
`\
`\
`\
`\
`\
`\
`\
`\
`
`86
`4
`
`84
`
`<, o
`
`FIG. 5
`
`80
`NODE
`
`
`
`K82
`
`K 14 '
`
`12
`
`sV
`
`sV oo .v
`
`1 0
`NODE
`
`oc
`Cv
`sV
`
`\
`
`
`
`
`
`
`
`T
`26'
`26
`DATA CHANNEL
`DATA CHANNEL
`98
`98
`V.
`DATA CHANNEL
`DATA CHANNEL
`v.
`
`y>
`V,
`104
`
`100
`100
`NODE
`NODE
`
`- ® h - 2 0 '
`'7^ J SWITCH
`
`v,
`
`102
`
`i
`/
`i
`/
`I
`I
`
`,\
`.V
`A
`A
`,v
`,v
`.\
`,v
`Vv
`
`1 8
`
`I
`30 U/
`DATA CHANNEL
`'j
`-16
`NODE
`
`FIG. 6
`
`

`

`U.S. Patent
`U.S. Patent
`
`Dec. 3,2002
`Dec. 3, 2002
`
`Sheet 4 of 5
`Sheet 4 of 5
`
`US 6,490,247 B1
`US 6,490,247 B1
`
`
`
`10a | NEW NODE CONTACTS
`NEW NODE CONTACTS
`1 0 8 -
`2 ADJACENT NODES
`2 ADJACENT NODES
`
`2 ADJACENT NODES
`2 ADJACENT NODES
`110- DROP CONNECTION TO
`110- DROP CONNECTION TO
`??? ??????R
`ONE ANOTHER
`
`1 1 2 —
`1 12
`
`NEW NODE
`NEW NODE
`???????S ?? ?W?
`CONNECTS TO TWO
`ADJACENT NODES
`ADJACENT NODES
`
`FIG. 7
`FIG. 7
`
`K H "
`
`FIG. 8
`
`1 2 »
`
`sV
`HV
`
`OV .v
`cv
`
`.V cv
`Vv
`\
`\
`
`20 "
`20 # I
`SWITCH
`SWITCH
`
`
`
`1 0 "
`NODE
`i
`
`
`
`®
`T
`/ \
`2 6 "
`\ .v
`DATA CHANNEL '
`/
`/
`/
`/
`/
`/
`/
`/
`
`.V
`.V
`,\
`.V
`
`1 1 4
`
`.V
`.V
`,v
`
`1 8 "
`
`1 6 "
`
`

`

`U.S. Patent
`U.S. Patent
`
`Dec. 3,2002
`Dec. 3, 2002
`
`Sheet 5 of 5
`Sheet 5 of 5
`
`US 6,490,247 B1
`US 6,490,247 B1
`
`LEAVING NODE CONTACTS 2
`LEA\/|NG NODE CONTACTS 2
`IT IS
`NODES TO WHICH IT |S
`NODES TO WHICH
`CONNECTED
`? ?????????
`
`2 NODES CONNECTED TO
`2 ??D?S ?????????? ??
`LEA\/|NG NODE DISCONNECT
`LEAVING NODE DISCONNECT
`FROM LEA\/|NG NODE
`FROM LEAVING NODE
`
`I
`I
`
`1 16
`- 1 1 6
`
`12O
`- 1 2 0
`
`118
`- 1 1 8
`
`CONTROL LINE OF LEAVING
`CONTRO LINE OF LEAVING
`NODE |S DISCONNECTED
`NODE IS DISCONNECTED
`FROM THE SWITCH
`FROM THE SWITCH
`
`2 NODES PREVIOUSLY CONNECTED | 122
`2 NODES PREVIOUSLY CONNECTED
`1 2 2
`?? L??V??? ???? ???????
`TO LEAVING NODE CONNECT
`?? ??? ??????R
`TO ONE ANOTHER
`
`FIG. 9
`FIG. 9
`
`I I U
`18
`18 | | | |
`NODE
`NODE
`
`124
`124
`DATA RING
`DATA RING
`
`
`
`t i l l
`
`1 0
`NODE
`
`126
`
`128
`
`-134
`m i
`20
`SWITCH
`
`132
`
`130
`
`U K
`
`1 6
`NODE
`
`# tº
`1 2
`l l l l
`12
`* FIG. 10
`NODE FIG. 10
`
`l l l l
`14
`14 if f :
`NODE
`NODE
`
`

`

`US 6,490,247 B1
`
`1
`RING-ORDERED DYNAMICALLY
`RECONFIGURABLE NETWORK USING AN
`EXISTING COMMUNICATIONS SYSTEM
`
`2
`SUMMARY OF THE INVENTION
`A ring-ordered dynamically reconfigurable computer net­
`work utilizes an existing communications system. A first
`embodiment of the invention comprises a plurality of nodes.
`Each node is coupled to the existing communications system
`FIELD OF THE INVENTION
`by two data channels and a control channel. The network is
`The present invention relates generally to networking
`established by each data channel of each node connecting
`technology, and more particularly to a network that is ring
`operably to a data channel of another node, so that all the
`ordered, dynamically reconfigurable, and utilizes an existing
`nodes are ordered in a ring. The control channel of each node
`communications system.
`is operably connected to a switch of the existing commu­
`BACKGROUND OF THE INVENTION
`nications system. In the first embodiment a network man­
`ager establishes the network, facilitates communication
`Networks are typically used to allow nodes, frequently
`among the nodes, and dynamically reconfigures the network
`computers, to communicate with one another. In this way,
`^ without disturbing communication among the nodes.
`electronic mail, data files, and other information can be
`exchanged among computers. The computers may, for
`In a second embodiment of the invention each node for
`example, be located in a common ofEce, or alternatively
`joining a peer-to-peer ring-ordered dynamically reconfig­
`separated from each other by great distances.
`urable computer network of a plurality of nodes utilizing an
`existing communications system contains a network
`Present-day networks typically utilize technologies which
`are hard wired and use special-purpose cables and circuitry. 20 manager, while in a third embodiment of the invention a
`For example, a local-area network (LAN) connecting com-
`network adaptor is used to connect a node to such a network,
`puters within an ofEce may use an Ethernet topology. In this
`Both of these embodiments also have network management
`situation, a special cable must be run from the server to each
`capability providing the option of a node connecting to the
`computer in the network. Such a network is also generally
`network only when it actually needs to communicate with
`not easily reconfigured. If a computer needs to be added or 25 another node,
`removed from the network, the entire network must first be
`The present invention overcomes problems found in the
`taken down, reconfigured, and then turned back on. No
`prior art. The nodes in the present invention connect in a
`dynamic reconfiguration is usually possible; a node cannot
`ring-ordered network by utilizing an existing communica­
`be added or removed from the network while other nodes on
`tions system, not special-purpose cables. The network man-
`the network continue to communicate with one another.
`30 ager of the present invention allows for dynamic reconfigu­
`ration of the network, which enables nodes to be added to or
`Wide-area networks (WANs) that allow communication
`removed from the network without having to first take the
`among computers separated from one another by great
`entire network down. The network managers also provides
`distances have similar weaknesses. Rather than utilizing
`for the advantage of allowing a node to connect to the
`existing telecommunications systems, such as two data
`channel-one control channel systems like Integrated Ser- 35 network only when it actually needs to communicate with
`another node. Other and further aspects and advantages of
`vices Digital Network (ISDN), they tend to require special,
`the present invention will become apparent in the following
`highly sophisticated cabling and circuitry. Moreover, wide-
`description and by reference to the accompanying drawings.
`area networks typically cannot be assimilated seamlessly
`with local-area networks except through other special-
`BRIEF DESCRIPTION OF THE DRAWINGS
`purpose interfaces. Wide-area networks are also usually 40
`incapable of dynamic reconfiguration.
`FIG. 1 is a diagram of the basic topology of a ring-ordered
`Afurther deficiency with present-day local-area and wide-
`dynamically reconfigurable network utilizing an existing
`area networks is that each computer residing on a particular
`communications system, according to the present invention;
`network typically remains connected to the network all the
`FIG. 2 is diagram of a typical computer networked
`time, regardless of whether the computer is communicating 45 according to the present invention;
`with another computer or not. This means that the cabling
`FIG. 3 is a diagram of a typical network card to allow a
`used to connect computers into a network must be dedicated
`computer to be networked according to the present inven­
`solely for the purpose of networking. The line that connects
`tion;
`a particular computer to a server in a local-area networking
`FIG. 4 is a flowchart showing the preferred method to
`environment, for example, cannot be used for any other 50
`establish a network according to the present invention;
`purpose. Forced constant connection to a network also
`FIG. 5 is a diagram of a network according to an alter­
`becomes expensive in the situation where a user of a
`native embodiment of the invention, in which only the nodes
`computer connected to such a network is charged on a
`that are actually communicating with another node are
`per-minute basis for the connection.
`connected to the network;
`There is a need, therefore, for networking technology that 55
`FIG. 6 is a diagram of a network in which an additional
`utilizes general-purpose lines, such as existing telecommu­
`node has to been added to the network, according to the
`nications systems like ISDN, instead of special-purpose
`present invention;
`cables and circuitry. There is also a need for networking
`FIG. 7 is a flowchart showing the preferred method to add
`technology that allows for the dynamic reconfiguration of a
`network, so that computers can be added to or removed from 60 another node to the network according to the present inven­
`tion;
`the network without disturbing existing communication
`FIG. 8 is a diagram of a network in which a node has been
`among the other computers. Finally, there is a need for
`removed from the network, according to the present inven­
`networking technology that enables a computer to be con­
`tion;
`nected to a network only when it actually needs to commu­
`nicate with another computer, instead of having to remain 65
`FIG. 9 is a flowchart showing the preferred method to
`constantly connected to the network, and thus potentially
`remove a node from the network according to the present
`incurring connect-time charges.
`invention; and,
`
`

`

`10
`
`15
`
`US 6,490,247 B1
`US 6,490,247 B1
`
`20
`20
`
`3
`4
`3
`4
`FIG. 10 is a diagram of the logical data flow within a
`FIG. 10 is a diagram of the logical data flow within a
`embodiment, a single node is selected as a master node and
`embodiment, a single node is selected as a master node and
`must always be coupled to the network to perform the
`must always be coupled to the network to perform the
`network according to the present invention; and,
`network according to the present invention; and,
`network manager functions.
`network manager functions.
`DETAILED DESCRIPTION
`In another embodiment of the present invention, a net-
`In another embodiment of the present invention, a net
`DETAILED DESCRIPTION
`work card couples each line to each computer (for example,
`5 work card couples each line to each computer (for example,
`Referring to FIG. 1, the basic topology of a ring-ordered
`Referring to FIG. 1, the basic topology of a ring-ordered
`line 40 to computer 34). Examples of such network cards
`line 40 to computer 34). Examples of such network cards
`dynamically reconfigurable computer network utilizing an
`dynamically reconfigurable computer network utilizing an
`that may be modified according to the present invention
`that may be modified according to the present invention
`existing communications system according to the present
`existing communications system according to the present
`include the IBM WaveRunner, and the SecureLink II. Refer-
`include the IBM WaveRunner, and the SecureLink II. Refer
`invention is shown. Nodes 10, 12, 14, 16 and 18 are
`invention is shown. Nodes 10, 12, 14, 16 and 18 are
`ring now to FIG. 3, a block diagram of such a network card
`ring now to FIG. 3, a block diagram of such a network card
`operatively coupled to switch 20. Switch 20 is part of the
`is shown Network card 41 has interface 43 for coupling to
`operatively coupled to switch 20. Switch 20 is part of the
`is shown. Network card 41 has interface 43 for coupling to
`existing communications system, which in one particular
`existing communications system, which in one particular
`a computer, and has logical data connections 45 and 47 and
`a computer, and has logical data connections 45 and 47 and
`embodiment is ISDN. However, any existing communica­
`embodiment is ISDN. However, any existing communica
`logical control connections 49 for coupling to two data
`logical control connections 49 for coupling to two data
`tions system capable of implementing two data channels and
`tions system capable of implementing two data channels and
`channel and a control channel, respectively, of an existing
`channel and a control channel, respectively, of an existing
`one control channel can be used, whether such arrangement
`one control channel can be used, whether such arrangement
`communication system. As those skilled in the art know,
`communication system. As those skilled in the art know,
`is logical or physical. For example, although an ISDN line
`however; these logical connections frequently will make up
`is logical or physical. For example, although an ISDN line
`however, these logical connections frequently will make up
`is usually a twisted-pair cable consisting of two wires, there
`is usually a twisted-pair cable consisting of two wires, there
`a single port, for example, connector 53. Interface 43 in one
`a single port, for example, connector 53. Interface 43 in one
`are generally two logical data channels and a logical control
`are generally two logical data channels and a logical control
`embodiment is a connector for connection to a PCI bus, as
`embodiment is a connector for connection to a PCI bus, as
`channel transmitted over these two physical wires. For
`channel transmitted over these two physical wires. For
`those skilled in the art recognize as a common interface by
`those skilled in the art recognize as a common interface by
`further example, an embodiment of an ISDN line having six
`further example, an embodiment of an ISDN line having six
`which expansion cards are connected to a computer;
`which expansion cards are connected to a computer;
`B channels and one D channels can also be used. Each node
`B channels and one D channels can also be used. Each node
`however, the invention is not so limited. Network card 41
`however, the invention is not so limited. Network card 41
`is operatively coupled to the switch via a control channel of
`is operatively coupled to the switch via a control channel of
`also contains data processing logic 51. The port controller
`also contains data processing logic 51. The port controller
`the existing communications system. For example, control
`the existing communications system. For example, control
`runs on each network card, via logic 51, to perform the
`runs on each network card, via logic 51, to perform the
`channel 22 of node 10, indicated by a broken line, is coupled
`channel 22 of node 10, indicated by a broken line, is coupled
`network manager function.
`network manager function.
`to switch 20.
`to switch 20.
`Referring now to FIG. 4, a flowchart outlining the pre
`Referring now to FIG. 4, a flowchart outlining the pre-
`Each node is also operatively coupled to two other nodes.
`Each node is also operatively coupled to two other nodes. 25 ferred method to establish a network according to the
`ferred method to establish a network according to the
`25
`As shown in FIG. 1, node 10 is coupled to nodes 12 and 16;
`As shown in FIG. 1, node 10 is coupled to nodes 12 and 16;
`present invention is shown. The steps of the flowchart are
`present invention is shown. The steps of the flowchart are
`node 12 is coupled to nodes 10 and 14; node 14 is coupled
`node 12 is coupled to nodes 10 and 14; node 14 is coupled
`executed by the network manager. The invention contem­
`executed by the network manager. The invention contem
`to nodes 12 and 18; node 16 is coupled to nodes 10 and 18;
`to nodes 12 and 18; node 16 is coupled to nodes 10 and 18;
`plates a list of nodes that are to be networked. As those
`plates a list of nodes that are to be networked. As those
`and, node 18 is coupled to nodes 16 and 14. Each node is
`and, node 18 is coupled to nodes 16 and 14. Each node is
`skilled in the art can readily appreciate, this list of nodes can
`skilled in the art can readily appreciate, this list of nodes can
`operatively coupled to two other nodes via data channels of
`operatively coupled to two other nodes via data channels of 30 be created in a number of ways, and the invention is not
`be created in a number of ways, and the invention is not
`30
`the existing communications system, through the switch.
`the existing communications system, through the switch.
`limited to any one particular manner. For example, the list of
`limited to any one particular manner. For example, the list of
`For example, data channel 24 of node 10 is operatively
`For example, data channel 24 of node 10 is operatively
`nodes can be predetermined such that each node has the list
`nodes can be predetermined such that each node has the list
`coupled to data channel 28 of node 12 at switch 20, and data
`coupled to data channel 28 of node 12 at switch 20, and data
`prior to the establishment of the network. Alternatively, the
`prior to the establishment of the network. Alternatively, the
`channel 26 of node 10 is operatively coupled to data channel
`channel 26 of node 10 is operatively coupled to data channel
`0f nodes can be completely specified by the node which
`list of nodes can be completely specified by the node which
`30 of node 16 at switch 20. In this way, the nodes are ordered
`30 of node 16 at switch 20. In this way, the nodes are ordered 35 is initiating the network, and passed on to other nodes as
`is initiating the network, and passed on to other nodes as
`35
`in a ring. As those skilled in the art will readily understand,
`in a ring. As those skilled in the art will readily understand,
`they are connected to the network. The list itself must
`they are connected to the network. The list itself must
`the number of nodes of a network contemplated by the
`the number of nodes of a network contemplated by the
`contain enough identifying information regarding each node
`contain enough identifying information regarding each node
`invention can be either greater or less than the number
`invention can be either greater or less than the number
`so that the node can be contacted through the existing
`so that the node can be contacted through the existing
`shown in FIG. 1.
`shown in FIG. 1.
`communications system, and distinguished from the other
`communications system, and distinguished from the other
`Nodes 10, 12, 14, 16 and 18 of FIG. 1 are typically 40 nodes. By way of example only, and not meant to limit the
`Nodes 10, 12, 14, 16 and 18 of FIG. 1 are typically
`nodes. By way of example only, and not meant to limit the
`40
`computers having networking capability. However, the
`computers having networking capability. However, the
`present invention, if the existing communications system is
`present invention, if the existing communications system is
`nodes can also be printers, or other devices, and the inven­
`nodes can also be printers, or other devices, and the inven
`ISDN, then the list would preferably contain what is known
`ISDN, then the list would preferably contain what is known
`tion is not limited to nodes being computers. Referring now
`tion is not limited to nodes being computers. Referring now
`as the directory number of each data channel at each node,
`as the directory number of each data channel at each node,
`to FIG. 2, an example of a computer is shown. Computer 34
`to FIG. 2, an example of a computer is shown. Computer 34
`as well as the name of the node. Each node, therefore, has
`as well as the name of the node. Each node, therefore, has
`has connected to it monitor 36 and keyboard 38. Not shown 45 two directory numbers associated with it, one for each data
`has connected to it monitor 36 and keyboard 38. Not shown
`two directory numbers associated with it, one for each data
`45
`is that computer 34 typically has a read-only memory
`is that computer 34 typically has a read-only memory
`channel. The name of a particular node commonly corre­
`channel. The name of a particular node commonly corre
`(ROM), a random-access memory (RAM), a central pro­
`(ROM), a random-access memory (RAM), a central pro
`sponds to the name of the user of that node.
`sponds to the name of the user of that node.
`cessing unit (CPU), and a storage device such as a hard
`cessing unit (CPU), and a storage device such as a hard
`Still referring to FIG. 4, in step 44, the variable X is set
`Still referring to FIG. 4, in step 44, the variable X is set
`and/or floppy disk drive. Line 40 is also connected to
`and/or floppy disk drive. Line 40 is also connected to
`to the total number of nodes on the list of nodes that are to
`to the total number of nodes on the list of nodes that are to
`computer 34, and comprises the data channels and control
`computer 34, and comprises the data channels and control 50 be networked, while the variable N is a counter which is
`be networked, while the variable N is a counter which is
`50
`channel referred to in FIG. 1 (for example, data channels 22
`channel referred to in FIG. 1 (for example, data channels 22
`initially set to 1 to indicate the first node. In this way, the
`initially set to 1 to indicate the first node. In this way, the
`and 24 and control channel 26 of node 10).
`and 24 and control channel 26 of node 10).
`nomenclature "node X" refers to the last node to be
`nomenclature “node X” refers to the last node to be
`As those skilled in the art understand, the data channels
`networked, while "node N" refers to the Nth node. In step
`networked, while “node N” refers to the Nth node. In step
`As those skilled in the art understand, the data channels
`and control channel are typically connected to the computer
`46, node N contacts node N+l to alert node N+l that it
`and control channel are typically connected to the computer
`46, node N contacts node N+1 to alert node N+1 that it
`via ports on the computer. Such ports typically are RJ-45 or
`via ports on the computer. Such ports typically are RJ-45 or 55 wishes to connect with node N+l. This is accomplished by
`wishes to connect with node N+1. This is accomplished by
`ss
`RJ-11 connectors that accept a twisted-pair cable carrying
`node N sending a message from its control channel to the
`RJ-11 connectors that accept a twisted-pair cable carrying
`node N sending a message from its control channel to the
`switch. The message contains node N's directory numbers,
`two ISDN logical B channels and one ISDN logical D
`switch. The message contains node N’s directory numbers,
`two ISDN logical B channels and one ISDN logical D
`or other unique address information for that node within the
`channel. In one embodiment of the present invention, each
`channel. In one embodiment of the present invention, each
`or other unique address information for that node within the
`existing communications systems, the directory numbers or
`existing communications systems, the directory numbers or
`node of the network is a computer as shown in FIG. 2. A
`node of the network is a computer as shown in FIG. 2. A
`network manager functions to establish the network, facili- 60 other unique address information of node N+l, and a com-
`network manager functions to establish the network, facili
`other unique address information of node N+1, and a com
`60
`mand to the switch that node N wishes to connect with node
`tate communication among the nodes, and to dynamically
`tate communication among the nodes, and to dynamically
`mand to the switch that node N wishes to connect with node
`N+l. Next, in step 48, node N connects to node N+l. This
`reconfigure the network without disturbing communication
`reconfigure the network without disturbing communication
`N+1. Next, in step 48, node N connects to node N+1. This
`is accomplished by a data connection of node N connecting
`is accomplished by a data connection of node N connecting
`among the nodes. In one embodiment of the invention, the
`among the nodes. In one embodiment of the invention, the
`to a data channel of node N+l within the switch. That is, the
`network manager is contained within each node such that the
`network manager is contained within each node such that the
`to a data channel of node N+1 within the switch. That is, the
`nodes communicate in a peer-to-peer manner. In a further 65 switch causes a connection to be made between node N and
`nodes communicate in a peer-to-peer manner. In a further
`switch causes a connection to be made between node N and
`65
`embodiment, a port controller runs on each computer to
`node N+l, assuming that node N+l is available (i.e., not
`node N+1, assuming that node N+1 is available (i.e., not
`embodiment, a port controller runs on each computer to
`communicating with another node). In step 50, the counter
`perform the network manager function. In yet a further
`communicating with another node). In step 50, the counter
`perform the network manager function. In yet a further
`
`

`

`US 6,490,247 B1
`
`^ P^ ^ ^ 6 correspo'ndi;g to switch 20 of ^ j
`
`6
`5
`The addition of a node is dynamic in that network commu­
`is advanced to the next node, that is, the variable N is
`nication is not disturbed while a node is being added to the
`increased by one. If in step 52 the variable N is not equal to
`network. The present invention contemplates the addition of
`the variable X, then control is returned to step 46, and the