(12)
`
`United States Patent
`Gilbert et al.
`
`(10) Patent N0.:
`(45) Date of Patent:
`
`US 6,490,247 B1
`*Dec. 3, 2002
`
`US006490247B1
`
`(54) RING-ORDERED DYNAMICALLY
`RECONFIGURABLE NETWORK USING AN
`EXISTING COMMUNICATIONS SYSTEM
`
`(75>
`
`Timéthy G- Gilbert’ “791111109 SD
`ms)’ [swan Fekete’ Dako.“ Dunfg's’ SD
`Je?rey Schmdler, 510“ Clty, IA
`
`(73) Assignee: Gateway, Inc, Poway, CA (US)
`
`(*) Notice:
`
`This patent issued on a continued pros-
`ecution application ?led under 37 CFR
`1.53(d), and is subject to the twenty year
`patent term provisions of 35 U_S_C_
`154(21)(2)_
`
`Subject to any disclaimer, the term of this
`patent is extended or adjusted under 35
`U'S'C' 154(k)) by 0 days‘
`
`(21) Appl' N05 08/670,609
`(22) Filed:
`Jun. 26, 1996
`
`Int. (:1-7 ................................................. ..
`(52) US Cl- ~~~~~~~~~~~~~~ ~~
`370/222; 370/224
`(58) Field of Search
`-------- -- 370/216, 217,
`370020, 222, 223, 224, 225, 227, 228,
`408, 407, 406, 405, 404, 403, 402, 522,
`431, 524, 537, 465, 468, 252, 254; 395/181;
`340/827, 82501, 82503; 379/221
`
`(56)
`
`References Cited
`
`US. PATENT DOCUMENTS
`
`4,663,748 A
`
`5/1987 Karbowiak et a1. ......... .. 370/89
`
`4,866,703 A
`
`9/1989 Black et al. . . . . . . . . .
`
`. . . .. 370/60
`
`379/93
`4,872,197 A 10/1989 Pemmaraju
`370/85.14
`4,999,832 A
`3/1991 Black ............. ..
`5,003,531 A * 3/1991 Farinholt et a1. ......... .. 370/223
`5,041,963 A * 8/1991 Ebersole et a1. .......... .. 370/408
`5,233,607 A
`8/1993 Barwigk et al. ......... .. 370/94.1
`
`6/1994 Chang et a1. ............... .. 370/60
`5,323,388 A
`5,365,265 A 11/1994 Shibata et a1. ........... .. 348/15
`5,412,652 A * 5/1995 Lu~ ........................ .. 370/223
`5,416,781 A
`5/1995 RuiZ ..................... .. 370/110.1
`
`2:223:33?) 2 13/1332 ?ilgvhifi‘f‘.f3-1111111111.?2‘335’65
`5,463,623 A 10/1995 Grimes et a1. ..
`..... .. 370/79
`5,517,489 A * 5/1996 Ogusa ...................... .. 370/223
`
`FOREIGN PATENT DOCUMENTS
`
`EP
`FR
`
`12/1984
`0127138
`5/1987
`2590384
`OTHER PUBLICATIONS
`
`Marsden, P., “Interworking IEEE 802/FDDI LAN ’s via the
`ISDN frame relay bearer service”, Proceedings of the IEEE,
`vol. 79, No. 2, pp. 223—229, (Feb. 1991).
`*
`_
`_
`cued by exammer
`Primary Examiner—Dang Ton
`(74) Attorney, Agent, or Firm—Scott Charles Richardson;
`John M. Dahl; Schwegman, Lundberg, Woessner & Kluth
`(57)
`ABSTRACT
`
`A ring_ordered dynamically recon?gurable Computer net_
`work utilizing an existing communications system. The
`network comprises a plurality of nodes. Each node is
`coupled to the existing communications system by two data
`channels and a control channel. The network is established
`by each data channel of each node connecting operably to a
`data channel of another node. All the nodes are ordered in a
`ring. The control channel of each node is operably connected
`to the switch of the existing communications system. The
`network also comprises a network manager to establish the
`network, facilitate communication among the nodes, and
`dynamically recon?gure the network without disturbing
`communication among the nodes. Optionally, each node
`connects to the network only when it actually needs to
`communicate with another node.
`
`50 Claims, 5 Drawing Sheets
`
`1O
`NODE
`
`IPR2016-00726
`ACTIVISION, EA, TAKE-TWO,
`2K, ROCKSTAR
`Ex. 1028, p. 1 of 13
`
`

`
`U.S. Patent
`
`Dec. 3, 2002
`
`Sheet 1 0f 5
`
`US 6,490,247 B1
`
`MONITOR
`
`54¢
`COMPUTER
`38
`
`KEYBOARDwlé-?
`
`_
`
`U$\
`FIG. 2
`
`IPR2016-00726
`ACTIVISION, EA, TAKE-TWO,
`2K, ROCKSTAR
`Ex. 1028, p. 2 of 13
`
`

`
`U.S. Patent
`
`Dec. 3, 2002
`
`Sheet 2 0f 5
`
`US 6,490,247 B1
`
`41
`NETWORSK CARD
`
`53
`CONNECTOR
`
`45
`
`El 47
`‘-
`
`-E 49
`
`~ 51
`LOGIC
`
`FIG. 3
`
`3
`45
`INTERFACE
`
`XZTOTAL NUMBER
`OF NODES
`
`44¢
`
`N=1
`
`v
`46¢ NODE N CONTACTS
`N+1
`
`v
`483 NODE N CONNECTS
`TO NODE N+1
`
`50
`
`v
`N=N+1
`
`52
`
`NO
`
`YES
`
`54¢ NODE x CONTACTS
`MODE 1
`
`V
`56¢ NODE >< CONNECTS
`TO NODE 1
`
`FIG. 4
`
`IPR2016-00726
`ACTIVISION, EA, TAKE-TWO,
`2K, ROCKSTAR
`Ex. 1028, p. 3 of 13
`
`

`
`U.S. Patent
`
`Dec. 3, 2002
`
`Sheet 3 0f 5
`
`US 6,490,247 B1
`
`100
`NODE
`
`DATA CHANNEL
`
`II,’
`
`IPR2016-00726
`ACTIVISION, EA, TAKE-TWO,
`2K, ROCKSTAR
`Ex. 1028, p. 4 of 13
`
`

`
`U.S. Patent
`
`Dec. 3, 2002
`
`Sheet 4 of5
`
`US 6,490,247 B1
`
`108w NEW NODE CONTACTS
`2 ADJACENT NODES
`
`T
`
`2 ADJACENT NODES
`1 TO»
`DROP CONNECTION TO
`ONE ANOTHER
`
`T
`
`1 12%
`
`NEW NODE
`CONNECTS TO TWO
`ADJACENT NODES
`
`FIG. 7
`
`IPR2016-00726
`ACTIVISION, EA, TAKE-TWO,
`2K, ROCKSTAR
`Ex. 1028, p. 5 of 13
`
`

`
`U.S. Patent
`
`Dec. 3, 2002
`
`Sheet 5 0f 5
`
`US 6,490,247 B1
`
`LEAVING NODE CONTACTS 2
`NODES TO WHICH IT IS
`CONNECTED
`
`x116
`
`II
`2 NODES CONNECTED TO
`LEAVING NODE DISCONNECT
`FROM LEAVING NODE
`
`II
`CONTROL LINE OF LEAVING
`NODE IS DISCONNECTED
`FROM THE SWITCH
`
`@120
`
`N118
`
`II
`2 NODES PREVIOUSLY CONNECTED @122
`TO LEAVING NODE CONNECT
`TO ONE ANOTHER
`
`FIG. 9
`
`18 III)
`NODE
`
`124
`DATA RING
`
`10 III!
`
`NODE .
`
`I34
`
`IIII
`
`SWITCH
`
`IPR2016-00726
`ACTIVISION, EA, TAKE-TWO,
`2K, ROCKSTAR
`Ex. 1028, p. 6 of 13
`
`

`
`US 6,490,247 B1
`
`1
`RING-ORDERED DYNAMICALLY
`RECONFIGURABLE NETWORK USING AN
`EXISTING COMMUNICATIONS SYSTEM
`
`FIELD OF THE INVENTION
`The present invention relates generally to networking
`technology, and more particularly to a network that is ring
`ordered, dynamically recon?gurable, and utilizes an existing
`communications system.
`BACKGROUND OF THE INVENTION
`NetWorks are typically used to alloW nodes, frequently
`computers, to communicate With one another. In this Way,
`electronic mail, data ?les, and other information can be
`exchanged among computers. The computers may, for
`example, be located in a common of?ce, or alternatively
`separated from each other by great distances.
`Present-day netWorks typically utiliZe technologies Which
`are hard Wired and use special-purpose cables and circuitry.
`For example, a local-area netWork (LAN) connecting com
`puters Within an of?ce may use an Ethernet topology. In this
`situation, a special cable must be run from the server to each
`computer in the netWork. Such a netWork is also generally
`not easily recon?gured. If a computer needs to be added or
`removed from the netWork, the entire netWork must ?rst be
`taken doWn, recon?gured, and then turned back on. No
`dynamic recon?guration is usually possible; a node cannot
`be added or removed from the netWork While other nodes on
`the netWork continue to communicate With one another.
`Wide-area netWorks (WANs) that alloW communication
`among computers separated from one another by great
`distances have similar Weaknesses. Rather than utiliZing
`existing telecommunications systems, such as tWo data
`channel-one control channel systems like Integrated Ser
`vices Digital NetWork (ISDN), they tend to require special,
`highly sophisticated cabling and circuitry. Moreover, Wide
`area netWorks typically cannot be assimilated seamlessly
`With local-area netWorks except through other special
`purpose interfaces. Wide-area netWorks are also usually
`incapable of dynamic recon?guration.
`Afurther de?ciency With present-day local-area and Wide
`area netWorks is that each computer residing on a particular
`netWork typically remains connected to the netWork all the
`time, regardless of Whether the computer is communicating
`With another computer or not. This means that the cabling
`used to connect computers into a netWork must be dedicated
`solely for the purpose of netWorking. The line that connects
`a particular computer to a server in a local-area netWorking
`environment, for example, cannot be used for any other
`purpose. Forced constant connection to a netWork also
`becomes expensive in the situation Where a user of a
`computer connected to such a netWork is charged on a
`per-minute basis for the connection.
`There is a need, therefore, for netWorking technology that
`utiliZes general-purpose lines, such as existing telecommu
`nications systems like ISDN, instead of special-purpose
`cables and circuitry. There is also a need for netWorking
`technology that alloWs for the dynamic recon?guration of a
`netWork, so that computers can be added to or removed from
`the netWork Without disturbing existing communication
`among the other computers. Finally, there is a need for
`netWorking technology that enables a computer to be con
`nected to a netWork only When it actually needs to commu
`nicate With another computer, instead of having to remain
`constantly connected to the netWork, and thus potentially
`incurring connect-time charges.
`
`10
`
`15
`
`25
`
`35
`
`45
`
`55
`
`65
`
`2
`SUMMARY OF THE INVENTION
`A ring-ordered dynamically recon?gurable computer net
`Work utiliZes an existing communications system. A ?rst
`embodiment of the invention comprises a plurality of nodes.
`Each node is coupled to the existing communications system
`by tWo data channels and a control channel. The netWork is
`established by each data channel of each node connecting
`operably to a data channel of another node, so that all the
`nodes are ordered in a ring. The control channel of each node
`is operably connected to a sWitch of the existing commu
`nications system. In the ?rst embodiment a netWork man
`ager establishes the netWork, facilitates communication
`among the nodes, and dynamically recon?gures the netWork
`Without disturbing communication among the nodes.
`In a second embodiment of the invention each node for
`joining a peer-to-peer ring-ordered dynamically recon?g
`urable computer netWork of a plurality of nodes utiliZing an
`existing communications system contains a netWork
`manager, While in a third embodiment of the invention a
`netWork adaptor is used to connect a node to such a netWork.
`Both of these embodiments also have netWork management
`capability providing the option of a node connecting to the
`netWork only When it actually needs to communicate With
`another node.
`The present invention overcomes problems found in the
`prior art. The nodes in the present invention connect in a
`ring-ordered netWork by utiliZing an existing communica
`tions system, not special-purpose cables. The netWork man
`ager of the present invention alloWs for dynamic recon?gu
`ration of the netWork, Which enables nodes to be added to or
`removed from the netWork Without having to ?rst take the
`entire netWork doWn. The netWork managers also provides
`for the advantage of alloWing a node to connect to the
`netWork only When it actually needs to communicate With
`another node. Other and further aspects and advantages of
`the present invention Will become apparent in the folloWing
`description and by reference to the accompanying draWings.
`
`BRIEF DESCRIPTION OF THE DRAWINGS
`
`FIG. 1 is a diagram of the basic topology of a ring-ordered
`dynamically recon?gurable netWork utiliZing an existing
`communications system, according to the present invention;
`FIG. 2 is diagram of a typical computer netWorked
`according to the present invention;
`FIG. 3 is a diagram of a typical netWork card to alloW a
`computer to be netWorked according to the present inven
`tion;
`FIG. 4 is a ?oWchart shoWing the preferred method to
`establish a netWork according to the present invention;
`FIG. 5 is a diagram of a netWork according to an alter
`native embodiment of the invention, in Which only the nodes
`that are actually communicating With another node are
`connected to the netWork;
`FIG. 6 is a diagram of a netWork in Which an additional
`node has to been added to the netWork, according to the
`present invention;
`FIG. 7 is a ?oWchart shoWing the preferred method to add
`another node to the netWork according to the present inven
`tion;
`FIG. 8 is a diagram of a netWork in Which a node has been
`removed from the netWork, according to the present inven
`tion;
`FIG. 9 is a ?oWchart shoWing the preferred method to
`remove a node from the netWork according to the present
`invention; and,
`
`IPR2016-00726
`ACTIVISION, EA, TAKE-TWO,
`2K, ROCKSTAR
`Ex. 1028, p. 7 of 13
`
`

`
`US 6,490,247 B1
`
`3
`FIG. 10 is a diagram of the logical data How Within a
`network according to the present invention; and,
`
`DETAILED DESCRIPTION
`
`4
`embodiment, a single node is selected as a master node and
`must alWays be coupled to the netWork to perform the
`netWork manager functions.
`In another embodiment of the present invention, a net
`Work card couples each line to each computer (for example,
`line 40 to computer 34). Examples of such netWork cards
`that may be modi?ed according to the present invention
`include the IBM WaveRunner, and the SecureLink II. Refer
`ring noW to FIG. 3, a block diagram of such a netWork card
`is shoWn. NetWork card 41 has interface 43 for coupling to
`a computer, and has logical data connections 45 and 47 and
`logical control connections 49 for coupling to tWo data
`channel and a control channel, respectively, of an existing
`communication system. As those skilled in the art knoW,
`hoWever, these logical connections frequently Will make up
`a single port, for example, connector 53. Interface 43 in one
`embodiment is a connector for connection to a PCI bus, as
`those skilled in the art recogniZe as a common interface by
`Which expansion cards are connected to a computer;
`hoWever, the invention is not so limited. NetWork card 41
`also contains data processing logic 51. The port controller
`runs on each netWork card, via logic 51, to perform the
`netWork manager function.
`Referring noW to FIG. 4, a ?oWchart outlining the pre
`ferred method to establish a netWork according to the
`present invention is shoWn. The steps of the ?oWchart are
`executed by the netWork manager. The invention contem
`plates a list of nodes that are to be netWorked. As those
`skilled in the art can readily appreciate, this list of nodes can
`be created in a number of Ways, and the invention is not
`limited to any one particular manner. For example, the list of
`nodes can be predetermined such that each node has the list
`prior to the establishment of the netWork. Alternatively, the
`list of nodes can be completely speci?ed by the node Which
`is initiating the netWork, and passed on to other nodes as
`they are connected to the netWork. The list itself must
`contain enough identifying information regarding each node
`so that the node can be contacted through the existing
`communications system, and distinguished from the other
`nodes. By Way of example only, and not meant to limit the
`present invention, if the existing communications system is
`ISDN, then the list Would preferably contain What is knoWn
`as the directory number of each data channel at each node,
`as Well as the name of the node. Each node, therefore, has
`tWo directory numbers associated With it, one for each data
`channel. The name of a particular node commonly corre
`sponds to the name of the user of that node.
`Still referring to FIG. 4, in step 44, the variable X is set
`to the total number of nodes on the list of nodes that are to
`be netWorked, While the variable N is a counter Which is
`initially set to 1 to indicate the ?rst node. In this Way, the
`nomenclature “node X” refers to the last node to be
`netWorked, While “node N” refers to the Nth node. In step
`46, node N contacts node N+1 to alert node N+1 that it
`Wishes to connect With node N+1. This is accomplished by
`node N sending a message from its control channel to the
`sWitch. The message contains node N’s directory numbers,
`or other unique address information for that node Within the
`existing communications systems, the directory numbers or
`other unique address information of node N+1, and a com
`mand to the sWitch that node N Wishes to connect With node
`N+1. Next, in step 48, node N connects to node N+1. This
`is accomplished by a data connection of node N connecting
`to a data channel of node N+1 Within the sWitch. That is, the
`sWitch causes a connection to be made betWeen node N and
`node N+1, assuming that node N+1 is available (i.e., not
`communicating With another node). In step 50, the counter
`
`Referring to FIG. 1, the basic topology of a ring-ordered
`dynamically recon?gurable computer netWork utiliZing an
`existing communications system according to the present
`invention is shoWn. Nodes 10, 12, 14, 16 and 18 are
`operatively coupled to sWitch 20. SWitch 20 is part of the
`existing communications system, Which in one particular
`embodiment is ISDN. HoWever, any existing communica
`tions system capable of implementing tWo data channels and
`one control channel can be used, Whether such arrangement
`is logical or physical. For example, although an ISDN line
`is usually a tWisted-pair cable consisting of tWo Wires, there
`are generally tWo logical data channels and a logical control
`channel transmitted over these tWo physical Wires. For
`further example, an embodiment of an ISDN line having six
`B channels and one D channels can also be used. Each node
`is operatively coupled to the sWitch via a control channel of
`the existing communications system. For example, control
`channel 22 of node 10, indicated by a broken line, is coupled
`to sWitch 20.
`Each node is also operatively coupled to tWo other nodes.
`As shoWn in FIG. 1, node 10 is coupled to nodes 12 and 16;
`node 12 is coupled to nodes 10 and 14; node 14 is coupled
`to nodes 12 and 18; node 16 is coupled to nodes 10 and 18;
`and, node 18 is coupled to nodes 16 and 14. Each node is
`operatively coupled to tWo other nodes via data channels of
`the existing communications system, through the sWitch.
`For example, data channel 24 of node 10 is operatively
`coupled to data channel 28 of node 12 at sWitch 20, and data
`channel 26 of node 10 is operatively coupled to data channel
`30 of node 16 at sWitch 20. In this Way, the nodes are ordered
`in a ring. As those skilled in the art Will readily understand,
`the number of nodes of a netWork contemplated by the
`invention can be either greater or less than the number
`shoWn in FIG. 1.
`Nodes 10, 12, 14, 16 and 18 of FIG. 1 are typically
`computers having netWorking capability. HoWever, the
`nodes can also be printers, or other devices, and the inven
`tion is not limited to nodes being computers. Referring noW
`to FIG. 2, an example of a computer is shoWn. Computer 34
`has connected to it monitor 36 and keyboard 38. Not shoWn
`is that computer 34 typically has a read-only memory
`(ROM), a random-access memory (RAM), a central pro
`cessing unit (CPU), and a storage device such as a hard
`and/or ?oppy disk drive. Line 40 is also connected to
`computer 34, and comprises the data channels and control
`channel referred to in FIG. 1 (for example, data channels 22
`and 24 and control channel 26 of node 10).
`As those skilled in the art understand, the data channels
`and control channel are typically connected to the computer
`via ports on the computer. Such ports typically are RJ-45 or
`RJ-ll connectors that accept a tWisted-pair cable carrying
`tWo ISDN logical B channels and one ISDN logical D
`channel. In one embodiment of the present invention, each
`node of the netWork is a computer as shoWn in FIG. 2. A
`netWork manager functions to establish the netWork, facili
`tate communication among the nodes, and to dynamically
`recon?gure the netWork Without disturbing communication
`among the nodes. In one embodiment of the invention, the
`netWork manager is contained Within each node such that the
`nodes communicate in a peer-to-peer manner. In a further
`embodiment, a port controller runs on each computer to
`perform the netWork manager function. In yet a further
`
`10
`
`15
`
`25
`
`35
`
`45
`
`55
`
`65
`
`IPR2016-00726
`ACTIVISION, EA, TAKE-TWO,
`2K, ROCKSTAR
`Ex. 1028, p. 8 of 13
`
`

`
`US 6,490,247 B1
`
`10
`
`15
`
`25
`
`35
`
`5
`is advanced to the next node, that is, the variable N is
`increased by one. If in step 52 the variable N is not equal to
`the variable X, then control is returned to step 46, and the
`entire process is repeated. Thus, node 1 contacts and then
`connects to node 2, node 2 contacts and then connects to
`node 3, etc.
`Once the counter has counted to the total number of nodes
`that are to be netWorked in step 52, that is, the variable N is
`equal to the variable X, then the last node contacts the ?rst
`node in step 54 and the last node connects to the ?rst node
`in step 56. The last node contacts the ?rst node in step 54 in
`the same manner in Which node N contacts node N+1 in step
`46, While the last node connects to the ?rst node in the same
`manner in Which node N connects to node N+1 in step 48.
`Thus, if three nodes are to be connected into a netWork, after
`node 1 contacts and connects to node 2 and node 2 contacts
`and connects to node 3, node 3 contacts and connects to node
`1, completing the netWork.
`As those skilled in the art Will readily appreciate, many
`adaptations can be made to the manner in Which the netWork
`is established under the present invention, Without departing
`from its scope. For example, in an alternative embodiment
`of the present invention, the netWork is established
`bi-directionally. A ?rst node Would simultaneously contact
`tWo other nodes that are to be netWorked. Each of these
`nodes Would then contact another node, Which Would also
`contact another node, this process continuing until all the
`nodes are connected to the netWork. For example, if there
`Were four nodes to be netWorked, the nodes being numbered
`one through four, node one Would connect With nodes tWo
`and three. Each of nodes tWo and three Would then connect
`With node four, completely establishing the netWork. This
`alternative embodiment has the advantage that the netWork
`Will be established tWice as quickly than if the process
`shoWn in FIG. 4 is folloWed to establish the netWork.
`In yet another embodiment of the present invention, the
`invention alloWs for a node refusing entry into the netWork.
`For example, in step 46 of FIG. 4 node N contacts node N+1.
`HoWever, node N+1 may respond to node N that it does not
`Wish to enter the netWork. Alternatively, node N+1 may be
`“busy” in that it does not have open data channels With
`Which to connect to the netWork. In such case, node N
`contacts and then connects With node N+2 as already dis
`cussed in conjunction With steps 46 and 48 of FIG. 4, and the
`remainder of the netWork is established as has already been
`discussed.
`Referring noW to FIG. 5, a netWork according to an
`alternative embodiment of the present invention is shoWn. In
`the embodiment shoWn in FIG. 5, only the nodes that are
`actually communicating With another node are connected to
`the netWork, in accordance With FIG. 4. This alternative
`embodiment of the invention presents many advantages over
`existing netWork technology. For example, a particular node
`may not communicate frequently With other nodes. Under
`the present invention, this node Would not have to remain
`connected to the netWork at all times. Any connect-time
`charges that this node might incur Will, therefore, be sub
`stantially less than if the node had to remain connected to the
`netWork constantly. In the situation shoWn in FIG. 5, only
`nodes 80 and 94 are communicating With another. Therefore,
`nodes 80 and 94 are the only nodes operatively coupled to
`one another, as Well as to sWitch 96. Nodes 76, 78, 82, 84,
`86, 88, 90, and 92 potentially could also join the netWork if
`they needed to communicate With another node, but as
`shoWn in FIG. 5, they do not, and therefore are not shoWn
`as having joined the netWork.
`Referring noW to FIG. 6, the dynamic addition of a node
`to a netWork according to the present invention is shown.
`
`45
`
`55
`
`65
`
`6
`The addition of a node is dynamic in that netWork commu
`nication is not disturbed While a node is being added to the
`netWork. The present invention contemplates the addition of
`a node to the netWork in tWo situations, although the
`invention is not so limited. First, a node is added to the
`netWork if it is not part of the original list of nodes to be
`networked, but Wishes to join the netWork. Second, a node
`is added to the netWork When it needs to communicate With
`other nodes on the netWork, under the alternative embodi
`ment of the present invention Where nodes are only con
`nected to the netWork When they need to communicate With
`other nodes. In this second situation, either the node initi
`ating communication With another node, the node receiving
`the communication, or both, may have to be added to the
`netWork. Comparing FIG. 6 to FIG. 1, the same netWork is
`shoWn, With nodes 10‘, 12‘, 14‘, 16‘ and 18‘ of FIG. 6
`corresponding to nodes 10, 12, 14, 16 and 18 of FIG. 1, and
`sWitch 20‘ OF FIG. 6 corresponding to sWitch 20 of FIG. 1.
`The difference is that While in FIG. 1 data channel 26 of
`node 10 connects to data channel 30 of node 16, in FIG. 6
`data channel 26‘ of node 10‘ connects to data channel 98 of
`additional node 100, and data channel 30‘ of node 16‘
`connects to data channel 102 of additional node 100. In
`addition, control channel 104 of additional node 100 con
`nects to sWitch 20‘.
`Referring noW to FIG. 7, a ?oWchart outlining the pre
`ferred method to dynamically add another node to a netWork
`according the present invention is shoWn. The steps of this
`?oWchart are executed by a joinder module Within the
`netWork manager. In step 108, an additional node contacts
`tWo adjacent nodes in the netWork, in a similar manner as
`node N contacts node N+1 in step 46 of FIG. 4. HoWever,
`the difference is that the additional node ?rst contacts a node
`it knoWs to be already connected on the netWork. In one
`embodiment, the present invention contemplates the addi
`tional node having the list of nodes to be netWorked,
`although the invention is not so limited. The actual node that
`is contacted by the additional node does not matter under the
`present invention. In one embodiment, the ?rst node on the
`list is contacted. The node contacted by the additional node
`provides information regarding an adjacent node to the
`additional node. An example of such an additional node is
`additional node 100 in FIG. 6, While an example of tWo
`adjacent nodes in the netWork is nodes 10 and 16 in FIG. 1.
`Thus, additional node 100 Would contact node 10, and node
`10 Would provide additional node 100 information regarding
`node 16. The information provided Would preferably be the
`directory numbers of the adjacent node, as Well as the
`adjacent node’s name.
`The node already on the netWork that is to be contacted by
`a node Wishing to enter the netWork is alternatively deter
`mined under other schemes. For example, under one
`embodiment there is a primary node on the netWork that
`receives all incoming calls from other nodes Wishing to enter
`the netWork. The point of entry in the netWork for these other
`nodes is then betWeen the primary node and an adjacent
`node to the primary node. Alternatively, the primary node
`identi?es another node on the netWork for the node Wishing
`to enter the netWork to contact. Alternatively still, the node
`Wishing to enter the netWork contacts the node on the
`netWork to Which it is closest. In yet another embodiment,
`the node Wishing to enter the netWork contacts the node on
`the netWork to Which calling charges over the existing
`communications system is least expensive. Other schemes
`of the present invention include selecting the node on the
`netWork to be contacted by a node Wishing to enter the
`netWork based on speed or security concerns. For example,
`
`IPR2016-00726
`ACTIVISION, EA, TAKE-TWO,
`2K, ROCKSTAR
`Ex. 1028, p. 9 of 13
`
`

`
`US 6,490,247 B1
`
`7
`under one embodiment there is a gatekeeper node on the
`network that receives all incoming calls from other nodes
`Wishing to enter the network, but does not alloW certain
`nodes that are on a restricted list to enter the netWork, or only
`alloWs certain nodes that are on an authorized list to enter the
`netWork.
`Still referring to FIG. 7, in step 110, the tWo adjacent
`nodes drop connection to one another. That is, the data
`channel of one of the nodes no longer connects to a data
`channel of the other. An example of tWo adjacent nodes
`dropping connection to one another Would be for data
`channel 26 of node 10 to disconnect from data channel 30 of
`node 16 in FIG. 1. Finally, in step 112, the additional node
`connects With each of the adjacent nodes, in the same
`manner as node N connects to node N+1 in step 48 of FIG.
`4. For example, data channel 98 of additional node 100
`connects With data channel 26‘ of node 10‘ and data channel
`102 of additional node 100 connects With data channel 30‘ of
`node 16‘ in FIG. 6. The connections by may initiated by any
`one of each adjacent node pair. Once a node has been added
`to the netWork, each node receives a message by the netWork
`manager that the node has joined the netWork, so that, for
`example, the list of nodes possessed by each node in one
`embodiment of the invention can be updated.
`Referring noW to FIG. 8, the dynamic removal of a node
`previously connected to a netWork according to the present
`invention is shoWn. Similar to the addition of a node, the
`removal of a node is dynamic in that removal of a node does
`not disturb communication over the netWork. The present
`invention contemplates the removal of a node from the
`netWork in tWo situations, although the invention is not so
`limited. First, a node is removed from the netWork if it
`Wishes to leave the netWork. Second, a node is removed
`from the netWork if it is currently not communicating With
`other nodes on the netWork, under the alternative embodi
`ment of the present invention Where nodes are only con
`nected to the netWork they need to communicate With other
`nodes. Comparing FIG. 8 to FIG. 1, the same netWork is
`shoWn, With nodes 10“, 12“, 14“, 16“ and 18“ of FIG. 8
`corresponding to nodes 10, 12, 14, 16 and 18 of FIG. 1, and
`sWitch 20“ of FIG. 8 corresponding to sWitch 20 of FIG. 1.
`The difference is that While in FIG. 1 data channel 26 of
`node 10 connects to data channel 30 of node 16, in FIG. 8
`data channel 26“ of node 10“ connects to data channel 114
`of node 18“. In other Words, node 16 in FIG. 1 has been
`removed from the netWork in FIG. 8; its control channel is
`no longer connected to the sWitch, and the tWo other nodes
`it had been connected to via data channels (nodes 10 and 18)
`are noW connected to one another in FIG. 8.
`Referring noW to FIG. 9, a flow chart of the preferred
`method to dynamically remove a node from a netWork
`according to the present invention is shoWn. The steps of the
`flow chart are executed by a removal module of the netWork
`manager. In step 116, a node on the netWork contacts the tWo
`nodes to Which its data channels connect to notify them that
`it is leaving the netWork. In one embodiment of the inven
`tion this contact is facilitated through the data channels;
`hoWever, the invention is not so limited in scope, and this
`contact could potentially also be facilitated through the
`control channel. For example, if node 16 of FIG. 1 Were
`leaving the netWork, it Would contact both node 10 and node
`18.
`In step 120, the tWo nodes to Which the leaving node is
`connected disconnect from the leaving node. For example,
`in FIG. 1 node 10 Would disconnect its data channel 26 from
`data channel 30 of node 16, and node 18 Would disconnect
`its data channel from the other data channel of node 16. In
`
`10
`
`15
`
`20
`
`25
`
`30
`
`35
`
`40
`
`45
`
`50
`
`55
`
`60
`
`65
`
`8
`step 118 , the control channel of the leaving node is
`disconnected from the sWitch. For example, the control
`channel of node 16 of FIG. 1 Would be disconnected from
`sWitch 20. Finally, in step 122, the noW-open data channels
`of the tWo nodes that Were previously connected to the
`leaving node are connected to one another. For example,
`upon the removal of node 16 in FIG. 1, the netWork appears
`as it does in FIG. 8, With data channel 26“ of node 10“
`connected to data channel 114 of node 18“, and node 16“
`completely disconnected from the netWork. The manner in
`Which the tWo nodes are connected is similar to the manner
`in Which node N connects to node N+1 in step 48 of FIG. 4.
`Once a node has been removed from the netWork, the
`netWork manager can transmit to each node still on the
`netWork a con?rmation message that the node has left the
`netWork, so that, for example, the list of nodes possessed by
`each node in a particular embodiment of the invention can
`be updated.
`Referring noW to FIG. 10, a diagram of the logical data
`How of a netWork according to the present invention is
`shoWn. The logical data How in FIG. 10 corresponds to the
`netWork shoWn in FIG. 1. Nodes 10““, 12‘“‘, 14““, 16‘“‘, and
`18““ of FIG. 10 correspond to nodes 10, 12, 14, 16 and 18
`of FIG. 1, and sWitch 20‘“‘ of FIG. 10 corresponds to sWitch
`20 o