Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 1 of 57 PageID #: 484
`
`Exhibit 1
`
`           
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 2 of 57 PageID #: 485
`
`(12)
`
`United States Patent
`Holt et al.
`
`(10) Patent N0.:
`(45) Date of Patent:
`
`US 6,701,344 B1
`*Mar. 2, 2004
`
`US006701344B1
`
`(54) DISTRIBUTED GAME ENVIRONMENT
`
`(75) Inventors: Fred B. Holt, Seattle, WA (US); Virgil
`E. Bourassa, Bellevue, WA (US)
`
`(73) Ass1gnee: gflhgBoelng Company, Seattle, WA
`
`( * ) Notice:
`
`Subject to any disclaimer, the term of this
`patent is extended or adjusted under 35
`U.S.C. 154(b) by 417 days.
`
`This patent is Subject to a terminal dis_
`Claimm
`
`(21) APPL NO; 09/629,042
`(22) Filed:
`Jul. 31, 2000
`
`3/1998 Yu
`5,734,865 A
`4/1998 Periasamy et al.
`5,737,526 A
`5/1998 B11115 @191
`5,754,830 A
`6/1998 M111“
`57617425 A
`6/1998 Onweller
`5,764,756 A
`(List Continued on next page‘)
`
`OTHER PUBLICATIONS
`
`PR Newswire, “Microsoft Boosts Accessibility to Internet
`Gaming Zone with Latest Release,” Apr. 27, 1998, pp. 1ff.*
`PR Newswire, “Microsoft Announces Launch Date for
`UltraCorps, Its Second Premium Title for the Internet Gam
`ing Zone,” Ma 27, 1998, pp. 1ff.*
`Business Wire, “Boeing and Panthesis Complete SWAN
`Transaction,” Jul. 22, 2002, pp. 1ff.*
`(List continued on neXt page.)
`
`7
`(51) Int. Cl. .............................................. .. G06F 15/16
`(52) U S C]
`709/204_ 709/205 709/203
`709/243; 463/42
`
`Primary Examiner—Dung C. Dinh
`Assistant Examiner_Brad1ey Edelman
`(74) Attorney, Agent, or Firm—Perkins Coie LLP
`(57)
`ABSTRACT
`
`(56)
`
`2 13;
`
`’
`
`’
`
`’
`
`’
`
`(58) Field of Search ............................... .. 709/204, 205,
`709/227, 243, 203; 463/40, 42
`_
`References Clted
`US PATENT DOCUMENTS
`_
`gal“ et al-
`u
`11:23:12‘: et al' """"" "
`2 Z:
`5,117,422 A * 5/1992 Hauptschein et a1_
`5:309j437 A
`5/1994 Perlman et a1_
`5,426,637 A
`6/1995 Derby et a1_
`5,459,725 A * 10/1995 Bodner et al. ............ .. 370/390
`5,471,623 A * 11/1995 Napolitano, Jr- ---------- -- 709/243
`5,535,199 A
`7/ 1996 A_II1fi et al-
`2 1(6);
`iubon et al'
`1,1, _
`?ltrgset' """"""""" " 709/219
`2 *
`5’696’903 A 12/1997 Maiany '
`5,732,074 A
`3/1998 Spaur et al.
`5,732,086 A * 3/1998 Liang et al. .............. .. 370/410
`5,732,219 A
`3/1998 Blumer et al.
`
`370055
`
`Abroadcast teehniqlle in Which abroadcast Channel Overlays
`a point-to-point communications network is provided. The
`broadcasting of a message over the broadcast channel is
`effectively a multicast to those computers of the network that
`are currently connected to the broadcast channel. In one
`embodiment, the broadcast technique provides a logical
`broadcast channel to which host computers through their
`executing processes can be connected. Each computer that is
`connected to the broadcast channel can broadcast messages
`onto and receive messages off of the broadcast channel.
`Each computer that is connected to the broadcast channel
`receives all messages that are broadcast while it is con
`nected. The logical broadcast channel is implemented using
`an underlying network system (e.g., the Internet) that allows
`each computer connected to the underlying network system
`to send messages to each other connected computer using
`each computer’s address. Thus, the broadcast technique
`effectively provides abroadcast channel using an underlying
`network system that sends messages on a point-to-point
`basis
`
`19 Claims, 39 Drawing Sheets
`
`Distribute
`broadcast message
`
`message
`from neighbor
`
`2401
`
`Select next neighbor
`
`All neighbor
`selected
`
`Send internal
`message
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 3 of 57 PageID #: 486
`
`US 6,701,344 B1
`Page 2
`
`US. PATENT DOCUMENTS
`
`8/1998 SistaniZadeh et al.
`5,790,548 A
`8/1998 Deaton, Jr. et al.
`5,790,553 A
`8/1998 Onweller
`5,799,016 A
`9/1998 Hirviniemi
`5,802,285 A
`5,850,592 A * 12/1998 Ramanathan ................ .. 455/7
`5,864,711 A
`1/1999 Mairs et al.
`5,867,660 A
`2/1999 Schmidt et al.
`5,867,667 A
`2/1999 Butman et al.
`5,870,605 A
`2/1999 Bracho et al.
`5,874,960 A
`2/1999 Mairs et al.
`5,899,980 A
`5/1999 Wilf et al.
`5,907,610 A
`5/1999 Onweller
`5,925,097 A * 7/1999 Gopinath et al. ......... .. 709/200
`5,928,335 A
`7/1999 Morita
`5,935,215 A
`8/1999 Bell et al.
`5,948,054 A
`9/1999 Nielsen
`5,949,975 A
`9/1999 Batty et al.
`5,956,484 A
`9/1999 Rosenberg et al.
`5,970,232 A * 10/1999 Passint et al. ............ .. 709/238
`5,974,043 A 10/1999 Solomon
`5,987,506 A 11/1999 Carter et al.
`6,003,088 A 12/1999 Houston et al.
`6,013,107 A
`1/2000 Blackshear et al.
`6,023,734 A
`2/2000 Ratcliff et al.
`6,029,171 A
`2/2000 Smiga et al.
`6,032,188 A
`2/2000 Mairs et al.
`6,038,602 A
`3/2000 Ishikawa
`6,047,289 A
`4/2000 Thorne et al.
`6,094,676 A
`7/2000 Gray et al.
`6,115,580 A * 9/2000 Chuprun et al. ............. .. 455/1
`6,167,432 A * 12/2000 Jiang .............. ..
`709/204
`6,173,314 B1 * 1/2001 Kurashima et al. ....... .. 709/204
`6,199,116 B1
`3/2001 May et al.
`6,216,177 B1
`4/2001 Mairs et al.
`6,223,212 B1
`4/2001 Batty et al.
`6,243,691 B1
`6/2001 Fisher et al.
`6,268,855 B1
`7/2001 Mairs et al.
`6,271,839 B1
`8/2001 Mairs et al.
`6,272,548 B1 * 8/2001 Cotter et al. .............. .. 709/239
`6,285,363 B1
`9/2001 Mairs et al.
`6,304,928 B1
`10/2001 Mairs et al.
`6,321,270 B1 * 11/2001 Crawley ................... .. 709/238
`6,463,078 B1 * 10/2002 Engstrom et al. .
`370/466
`
`6,524,189 B1 * 2/2003 Rautila . . . . . . . . . . . . .
`
`. . . .. 463/40
`
`2002/0027896 A1 * 3/2002 Hughes et al. ............ .. 370/342
`
`OTHER PUBLICATIONS
`
`AZar et al., “Routing Strategies for Fast Networks,” May
`1992, INFOCOM ’92, Eleventh Annual Joint Conference of
`the IEEE Computer and Communications Societies, vol. 1,
`170—179.*
`Cho et al., “A Flood Routing Method for Data Networks,”
`Sep. 1997, Proceedings of 1997 International Conference on
`Information, Communications, and Signal Processing, vol.
`3, pp. 1418—1422.*
`Komine et al., “A Distributed Restoration Algorithm for
`Multiple—Link and Node Failures of Transport Networks,”
`Dec. 199 Global Telecommunications Conference, 1990,
`and Exhibition, IEEE, vol. 1, pp. 459—463.*
`Peercy et al., “Distributed Algorithms for Shortest—Path,
`Deadlock—Free Routing and Broadcasting in Arbitrarily
`Faulty Hypercubes,” Jun. 1990, 20”1 International Sympo
`sium on Fault—Tolerant Computing, 1990, pp. 218—225.*
`US. patent application Ser. No. 09/629,570, Bourassa et al.,
`?led Jul. 31, 2000.
`US. patent application Ser. No. 09/629,577, Bourassa et al.,
`?led Jul. 31, 2000.
`
`US. patent application Ser. No. 09/629,575, Bourassa et al.,
`?led Jul. 31, 2000.
`US. patent application Ser. No. 09/629,572, Bourassa et al.,
`?led Jul. 31, 2000.
`US. patent application Ser. No. 09/629,023, Bourassa et al.,
`?led Jul. 31, 2000.
`US. patent application Ser. No. 09/629,043, Bourassa et al.,
`?led Jul. 31, 2000.
`US. patent application Ser. No. 09/629,024, Bourassa et al.,
`?led Jul. 31, 2000.
`US. patent application Ser. No. 09/629,576, Bourassa et al.,
`?led Jul. 31, 2000.
`Murphy, Patricia, A., “The Next Generation Networking
`Paradigm: Producer/Consumer Model,” Dedicated Systems
`MagaZine—2000 (pp. 26—28).
`The Gamer’s Guide, “First—Person Shooters,” Oct. 20, 1998
`(4 pages).
`The O’Reilly Network, “Gnutella: Alive, Well, and Chang
`ing Fast,” Jan. 25, 2001 (5 pages) http://www.open2p.com/
`1pt... [Accessed Jan. 29, 2002].
`Oram, Andy, “Gnutella and Freenet Represents True Tech
`nological Innovation,” May 12, 2000 (7 pages) The O’Reilly
`Network http://www.oreillynet.com/1pt... [Accessed Jan.
`29, 2002].
`Internetworking Technologies Handbook, Chapter 43 (pp.
`43—1—43—16).
`Oram, Andy, “Peer—to—Peer Makes the Internet Interesting
`Again,” Sep. 22, 2000 (7 pages) The O’Reilly Network
`http://linux.oreillynet.com/1pt... [Accessed Jan. 29, 2002].
`Monte, Richard, “The Random Walk for Dummies,”MIT
`Undergraduate Journal of Mathematics (pp. 143—148).
`Srinivasan, R., “XDR: External Data Representation Stan
`dard,” Sun Microsystems, Aug. 1995 (20 pages) Internet
`RFC/STD/FYI/BCP
`Archives
`http://www.faqs,.org/
`rfc1832.html [Accessed Jan. 29, 2002].
`A. Databeam Corporate White Paper, “A Printer on the
`T120 Series Standards,” Copyright 1995 (pp. 1—16).
`Kessler, Gary, C., “An Overview of TCP/IP Protocols and
`the Internet,” Apr. 23, 1999 (23 pages) Hill Associates, Inc.
`http://www.hill.com/library/publications/t... [Accessed Jan.
`29, 2002].
`Bondy, J .A., and Murty, U.S.R., “Graph Theory with Appli
`cations,” Chapter 1—3 (pp. 1—47), 1976 American Elsevier
`Publishing Co., Inc., New York, New York.
`Cormen, Thomas H. et al., Introduction to Algorithms,
`Chapter 5.3 (pp. 84—91), Chapter 12 (pp. 218—243), Chapter
`13
`245), 1990, The MIT Press, Cambridge, Massachu
`setts, McGraw—Hill Book Company, New York.
`The Common Object Request Broker: Architecture and
`Speci?cation, Revision 2.6, Dec. 2001, Chapter 12 (pp.
`12—1—12—10), Chapter 13 (pp. 13—1—13—56), Chapter 16(pp.
`16—1—16—26), Chapter 18 (pp. 18—1—18—52), Chapter 20
`(pp. 20—1—20—22).
`The University of Warwick, Computer Science Open Days,
`“Demonstration of the Problems of Distributed Systems,”
`http://www.dcs.warwick.ac.u... [Accessed Jan. 29, 2002].
`Alagar, S. and Venkatesan, S., “Reliable Broadcast in
`Mobile Wireless Networks,” Department of Computer Sci
`ence, University of Texas at Dallas, Military Communica
`tions Conference, 1995, MILCOM ’95 Conference Record,
`IEEE San Diego, California, Nov. 5—8, 1995 (pp. 236—240).
`International Search Report for The Boeing Company, Inter
`national Patent Application No PCT/US01/24240, Jun. 5,
`2002 (7 pages).
`
`* cited by examiner
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 4 of 57 PageID #: 487
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 1 0f 39
`
`US 6,701,344 B1
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 5 of 57 PageID #: 488
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 2 0f 39
`
`US 6,701,344 B1
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 6 of 57 PageID #: 489
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 6 of 57 Page|D #: 489
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 3 of 39
`
`US 6,701,344 B1
`
`“'
`
`0
`
`Z
`
`ig.3B
`
`A
`
`ig.3A
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 7 of 57 PageID #: 490
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 4 0f 39
`
`US 6,701,344 B1
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 8 of 57 PageID #: 491
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 5 0f 39
`
`US 6,701,344 B1
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 9 of 57 PageID #: 492
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 6 0f 39
`
`US 6,701,344 B1
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 10 of 57 PageID #: 493
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 7 0f 39
`
`US 6,701,344 B1
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 11 of 57 PageID #: 494
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 8 0f 39
`
`US 6,701,344 B1
`
`0:
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 12 of 57 PageID #: 495
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 9 0f 39
`
`US 6,701,344 B1
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 13 of 57 PageID #: 496
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 10 0f 39
`
`US 6,701,344 B1
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 14 of 57 PageID #: 497
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 11 0f 39
`
`US 6,701,344 B1
`
`4; .ME
`
`E .ME
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 15 of 57 PageID #: 498
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 12 0f 39
`
`US 6,701,344 B1
`
`000
`
`H35
`
`“tom
`
`now
`
`@ .45
`
`v
`
`Now
`
`0
`
`0
`
`0
`
`w o
`
`v. 858305 0
`
`~ 0
`
`wow wow
`
`553305 25 EEEQV
`
`A3555 35:20
`_ c2323.?
`
`60
`
`588965 35 658.3
`N noggin?
`
`62532 658%
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 16 of 57 PageID #: 499
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 13 0f 39
`
`US 6,701,344 B1
`
`ooh
`
`NE. 29am
`
`NON
`
`
`huso?mwmu . Eton
`iEBxm _ mg m xumm 62:60
`
`mow Fob
`
`no»
`
`.oco?a?n
`
`#
`
`
`
` . H mmE H . 2952
`
`v 0:281
`Bs?wn? c
`
`2 m2: h
`
`no“. N 58205 25€<
`
`
`BEBE won QMMH ommmmoE
`
`0 ,ME
`
`NON 00h
`
`Z we: m $262
`
`298i S0550
`
`BEBE N a
`
`
`
`wow 33985
`
`. mom voh
`
`62500
`
`032 =8
`
`SN
`
`0280M
`
`35%“!
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 17 of 57 PageID #: 500
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 14 0f 39
`
`US 6,701,344 B1
`
`(Channel Type,
`Channel Instance,
`Connect Aux Info)
`
`Fig“ 8
`
`l
`
`Connect
`
`)
`
`Open call in port
`
`801
`
`802
`
`Set connect-time
`
`803
`Seek portal - computer
`(channel type channel
`instance)
`
`Return (false)
`
`806
`
`Achieve connection
`
`807
`
`Install external dispatcher
`
`Contacts
`
`0
`
`808
`
`Install external dispatcher
`
`809
`
`Connect request
`
`1
`
`Return (true)
`
`)
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 18 of 57 PageID #: 501
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 15 0f 39
`
`US 6,701,344 B1
`
`Seek portal
`computer
`'
`
`902
`
`Channel Type
`Channel Instance
`
`Select next depth
`
`All depths selected
`
`Select next portal computer
`
`. F 11g, 9
`
`All portal computers
`selected
`
`906
`Dial portal computer
`
`907
`
`Y
`
`908
`
`Contact process
`
`909
`l
`Hang up selected portal
`computer
`
`911
`Check for external
`'
`call
`
`Selected portal
`computer connected
`
`Return (success)
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 19 of 57 PageID #: 502
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 16 0f 39
`
`US 6,701,344 B1
`
`Fig. 10
`
`< Contact process I
`
`1001
`Send external message
`
`1002
`Receive external message
`
`Success
`
`1005
`Add as connected portal
`computer
`
`Answering process
`connected
`
`1006
`Add as fellow seeking
`computer
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 20 of 57 PageID #: 503
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 17 0f 39
`
`US 6,701,344 B1
`
`Connect request
`
`Was a fully
`connected portal foun
`
`1 103
`Dial call in port of portal
`computer
`
`1104
`
`Success
`
`1105
`Y
`Send external message
`
`1106
`Receive external message
`
`1107
`
`N
`
`Success
`
`1 108
`Set expect holes from
`response
`
`1109
`Set diameter from response
`
`1
`
`Return
`
`1
`
`1 1 12
`Add neighbor
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 21 of 57 PageID #: 504
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 18 0f 39
`
`US 6,701,344 B1
`
`heck for extern
`call
`
`1201
`
`Answer
`
`Fig.
`12
`
`Success
`
`Receive external message
`
`ype = = seeking
`connection call
`
`‘l 205
`Send external message
`
`206
`
`Success
`
`N
`
`Y
`
`1 207
`Add other as fellow seeker
`
`<
`
`Return
`
`>
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 22 of 57 PageID #: 505
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 22 of 57 Page|D #: 505
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 19 of 39
`
`US 6,701,344 B1
`
`
`
`Achieve connection
`
`1 301
`
`
`
`Fig. 13
`
`
`
`
`Connection - state = fiilly
`connected
`
`1 302
`
`Notify fellow seekers
`
`1 303
`
`Invoke connect call back
`
`
`
`
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 23 of 57 PageID #: 506
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 23 of 57 Page|D #: 506
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 20 of 39
`
`US 6,701,344 B1
`
`External dispatcher
`
`1401
`Pick up and receive
`external message
`
`Fig. 114
`
`
`Handle seeking
`connection call
`
`
`
`
`
`1 406
`
`Handle connection
`
`request call
`
`1 408
`
`Handle edge proposal
`call
`
`1410
`
`
`
`Port connect call
`
`Handle port
`connection call
`
`
`
`
`
`Handle connected
`statement
`
`Connected statement
`statement
`
`Condition repair
`
`
`
`
`1414
`
`Handle condition
`
`repair statement
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 24 of 57 PageID #: 507
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 24 of 57 Page|D #: 507
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 21 of 39
`
`US 6,701,344 B1
`
`Handle seeking
`connecnon call
`
`Fig_ I5
`
`
`
`connected
`
`
`1 502
`
`Set message to indicate
`connected
`
`Set message to not
`
`1 503
`
`1504
`
`Add other as fellow
`seeking process
`
`1505
`
`Send external message
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 25 of 57 PageID #: 508
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 25 of 57 Page|D #: 508
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 22 of 39
`
`US 6,701,344 B1
`
`0 I
`
`I6
`
`andle connection
`request call
`
`1601
`Connected
`
`N
`
`.—K (DO(.0
`
`.
`Set newcomer s
`holes_to_expect
`1 60 ‘
`
`Set diameter estimate in
`
`response
`
`605
`
`Sent external message
`connect request resp.
`O) O\|
`
`1
`
`Set newcomer's
`ho1cs_to_fill
`
`508
`
`Y
`
`I
`
`Add neighbor
`
`1 609
`
`I
`
`1610
`
`
`
`Newcomer's
`ho1es_to__fill --
`
`Holes to fill - = Z
`
`1617
`
`-YI Fillhole(requestor) I
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 26 of 57 PageID #: 509
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 26 of 57 Page|D #: 509
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 23 of 39
`
`US 6,701,344 B1
`
`Add neighbor
`
`1701
`
`Identifies calling party
`
`Fig.» I 7
`
`1702
`Sets neighbor to
`messages pending
`
`703
`
`.
`
`1704
`
`— §:,'::::;'::a::*:;::
`
`N 4
`
`1705
`
`Add as neighbor
`
`1 706
`Install interal dispatcher
`for new neighbor
`
`
`
`1707
`
`709
`
` Holes = =
`
`xpected hole
`
`N
`
`1711
`
`Y
`
`Achieve connected I
`
`Y
`
`1712
`Purge pending edges
`
`N
`
`1708
`
`I,
`
`N 1
`
`
`
`
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 27 of 57 PageID #: 510
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 27 of 57 Page|D #: 510
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 24 of 39
`
`US 6,701,344 B1
`
`/Fig. 178
`
`
`
`Forward connection
`edge search
`
`requestor
`distance remaining
`
`
`
`Distance
`
`remaining > 0
`
`
`
`
`
`
`
`
`
`neighbor =
`requestor
`
` All neighbors
`
`selected .
`
`N
`
`
`
`Note connection edge
`search call
`
`neighbors
`> 1
`
`#of
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 28 of 57 PageID #: 511
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 28 of 57 Page|D #: 511
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 25 of 39
`
`US 6,701,344 B1
`
`Handle edge
`PT°P05a1 03“
`
`in message
`out message
`
`Fig. l/9
`
`
`
`N
`
`1903
`
`create edge (pending)
`
`
`
`
`proposed
`neighbors
`pending
`
`N
`
`1 907
`
`1 91 1
`
`Send external message
`
`Send external message
`
`1 91 2
`
`1908
`
`NE
`
`“°‘°“‘°"“
`
`Y
`mi hole
`
`1913
`
`Y
`
`1909
`,
`V
`Add edge as pendmg
`
`N
`
` I
`
`Add neighbor
`
`I
`
`1910
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 29 of 57 PageID #: 512
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 29 of 57 Page|D #: 512
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 26 of 39
`
`US 6,701,344 B1
`
`2003
`
`
`
`
`Handle port
`connection call
`
`Fig. 20
`
`
`
` Caller is not
`
`neighbor
`
`Send external message
`(point-connect-resp
`not ok)
`
`Send external message
`(point-connect-resp, ok)
`
`
`
`
`2006
`
`
`I
`
`
`
`2008
`
`I Connect request I
`
`N
`
`Add neighbor
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 30 of 57 PageID #: 513
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 30 of 57 Page|D #: 513
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 27 of 39
`
`US 6,701,344 B1
`
`Fill hole
`
`2101
`
`Initialize internal
`message
`
`
`
`
`Handle connection
`ports search edit
`
`2
`
`
`2103
`
`Distribute internal
`message
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 31 of 57 PageID #: 514
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 31 of 57 Page|D #: 514
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 28 of 39
`
`US 6,701,344 B1
`
`Internal
`dispatcher
`
`2201
`
`22
`
`Received internal message
`2202
`
`Assess diameter
`
`
`This
`
`proces = =
`
`originatin ;
`
`
`
`
`2005
`Handle broadcast
`message
`
`
`Type
`: = broadcast
`
`statement
`
`
`
`Insert message into
`pending connection buffer
`
`2007
`
`Y
`
`Handle shutdown
`
`‘ statement I
`
`
`
`Pending
`connection buffer
`
`
`11
`N
`
`Y
`
`
`
`Y -
`
`Receive response (
`
`)
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 32 of 57 PageID #: 515
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 32 of 57 Page|D #: 515
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 29 of 39
`
`US 6,701,344 B1
`
`Handle broadcast
`message
`
`Process out of order
`
`message
`
`origin
`from neighbor
`message
`
`
`
`
`
`Fig.
`
`
`
`
`
`
`
`2302
`
`Distribute broadcast
`
`message
`
`
`
`2304
`
`Clear out of order info
`
`messages
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 33 of 57 PageID #: 516
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 33 of 57 Page|D #: 516
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 30 of 39
`
`US 6,701,344 B1
`
`Fig. 24
`
`
`Distribute
`broadcast message
`
`
`
`message
`from neighbor
`
`2401
`
`Select next neighbor
`
`
`
`402
`
` All neighbor
`
`selected
`
`2403
`
`Send internal
`
`message
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 34 of 57 PageID #: 517
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 34 of 57 Page|D #: 517
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 31 of 39
`
`US 6,701,344 B1
`
`Handle connection
`f0I' search
`
`from neighbor
`message
`
`2601
`
`Distribute internal
`
`,F'g- 26
`
`602
`
`N
`
`Y
`
`
`
`603
`
`Is requestor
`a neighbor
`
`
`
`N
`
`2604
`
`I
`
`Court neighbor
`
`I
`
`605
`
`enerate
`
`condition check
`messa e w/nelhbors
`
`
`
`2607
`
`Send internal message
`to requestor
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 35 of 57 PageID #: 518
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 35 of 57 Page|D #: 518
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 32 of 39
`
`US 6,701,344 B1
`
`Court neighbor
`
`Prospect
`
`
`
` Is prospect
`
`a neighbor
`
`N
`
`2702
`
`Dial prospect
`
`703
`
`N
`
`
`
`I
`
`Send and receive
`external message
`
`|
`
`Add neighbor
`
`2706
`
`Hang up prospect
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 36 of 57 PageID #: 519
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 36 of 57 Page|D #: 519
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 33 of 39
`
`US 6,701,344 B1
`
`Handle connection
`Cdgfi search can
`
`from neighbor
`message
`
`801
`
`my message 11
`holes >= Z
`
`Not
`
`
`
`
`
`Fig. 28
`
`2813
`
`Message
`
`N from this pt. &&
`
`
`
`Y
`
`2814
`
`
`I
`
`w
`
`Fill hole (self)
`
`N
`
`2815
`
`’
`en “mm
`
`I message (from
`net; bor, ack
`
`I
`
`2803
`
`Forward
`
`connection second
`Remaining
`
`
`edge (requestor
`
`remainin dist -1)
`
`
`
`
`
`
`
`
`R
`t
`Forward
`.
`. eques °r
`connection edge
`
`is neighbor or edge
`Search (requestor,
`reserved
`0)
`
`
`2806
`
`"V
`V
`
`
`
`
`
`2807
`
`Send and receive
`
`external message
`
`808
`
`
`
`is edge acceptable
`
`Y
`
`2809
`
`Reserve edge of from
`neighbor
`
`2810
`
`N
`
`Add neighbor
`
`I
`
`2811
`
`Remove neighbor
`
`2812
`
`‘
`
`
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 37 of 57 PageID #: 520
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 37 of 57 Page|D #: 520
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 34 of 39
`
`US 6,701,344 B1
`
`Handle edge search‘
`FCSP.
`
`
`
`2901
`Note connection edge
`search response
`
`origin
`from neighbor
`message
`
`Edge selected
`
`
`
`2903
`Y
`Reserve edge of from
`neighbor
`
`2904
`
`Remove from neighbor
`
`2905
`
`
`
`Fig. 29
`
`
`
`
`
`
`
`I
`
`Court neighbor I
`
`
`
`
` Y 2908
`Fill hole (self)
`I
`
`
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 38 of 57 PageID #: 521
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 38 of 57 Page|D #: 521
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 35 of 39
`
`US 6,701,344 B1
`
`message
`
`Fig. 30
`
`
`
`Set message sequence
`number
`
`
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 39 of 57 PageID #: 522
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 39 of 57 Page|D #: 522
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 36 of 39
`
`US 6,701,344 B1
`
`
`
`Acquire message
`
`message
`
`
`
`Fig. 31
`
`31 01
`
`Pop message queue
`
`
`
`
`Message
`retrieved
`
`Return false
`
`
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 40 of 57 PageID #: 523
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 40 of 57 Page|D #: 523
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 37 of 39
`
`US 6,701,344 B1
`
`Handle condition check
`
`
`
`Same set of
`
`neighbors
`
`3205
`e ect a neig or
`of sending process
`not m neihbor
`
`
`
`3206
`
`Send external message
`to selected neighbor
`
`3207
`
`Add neighbor
`
`
`
`
`
`
`
`
`
`
`Set up message with list
`of neighbors
`
`_
`Send internal message
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 41 of 57 PageID #: 524
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 41 of 57 Page|D #: 524
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 38 of 39
`
`US 6,701,344 B1
`
`Handle condition
`repair statement
`
`
`
` Select a neighboy not
`involved in C0nd1tl0l'l
`
`
`
`Remove selected
`neighbor
`
`
`
`I
`
`3304
`
`Add neighbor
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 42 of 57 PageID #: 525
`Case 1:15—cv—OO228—RGA Document 7-1 Filed 03/31/15 Page 42 of 57 Page|D #: 525
`
`U.S. Patent
`
`Mar. 2, 2004
`
`Sheet 39 of 39
`
`US 6,701,344 B1
`
`
`
`
`Same set of
`
`neighbors
`
`N
`
`3407
`
`.
`Send mtemal_message_
`to-from nelghbor
`
`
`
`Reset diameter to 1
`
`3405
`
`Send internal message
`
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 43 of 57 PageID #: 526
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 43 of 57 Page|D #: 526
`
`US 6,701,344 B1
`
`1
`DISTRIBUTED GAME ENVIRONMENT
`
`CROSS-REFERENCE TO RELATED
`APPLICATIONS
`
`This application is related to U.S. patent application Ser.
`No. 09/629,576, entitled “BROADCASTING
`NETWORK,” filed on Jul. 31, 2000; U.S. patent application
`Ser. No. 09/629,570, entitled “JOINING A BROADCAST
`CHANNEL,” filed on Jul. 31, 2000; U.S. patent application
`Ser. No. 09/629,577, “LEAVING A BROADCAST
`CHANNEL,” filed on Jul. 31, 2000; U.S. patent application
`Ser. No. 09/629,575, entitled “BROADCASTING ON A
`BROADCAST CHANNEL,” filed on Jul. 31, 2000; U.S.
`patent application Ser. No. 09/629,572, entitled “CON-
`TACTING A BROADCAST CHANNEL,” filed on Jul. 31,
`2000; U.S. patent application Ser. No. 09/629,023, entitled
`“DISTRIBUTED AUCTION SYSTEM,” filed on Jul. 31,
`2000; U.S. patent application Ser. No. 09/629,043, entitled
`“AN INFORMATION DELIVERY SERVICE,” filed on Jul.
`31, 2000; and U.S. patent application Ser. No. 09/629,024,
`entitled “DISTRIBUTED CONFERENCING SYSTEM,”
`filed on Jul. 31, 2000, the disclosures of which are incor-
`porated herein by reference.
`
`TECHNICAL FIELD
`
`The described technology relates generally to a computer
`network and more particularly, to a broadcast channel for a
`subset of a computers of an underlying network.
`
`BACKGROUND
`
`There are a wide variety of computer network communi-
`cations techniques such as point-to-point network protocols,
`client/server middleware, multicasting network protocols,
`and peer-to-peer middleware. Each of these communications
`techniques have their advantages and disadvantages, but
`none is particularly well suited to the simultaneous sharing
`of information among computers that are widely distributed.
`For example, collaborative processing applications, such as
`a network meeting programs, have a need to distribute
`information in a timely manner to all participants who may
`be geographically distributed.
`The point-to-point network protocols, such as UNIX
`pipes, TCP/IP, and UDP, allow processes on different com-
`puters to communicate via point-to-point connections. The
`interconnection of all participants using point-to-point
`connections, while theoretically possible, does not scale well
`as a number of participants grows. For example, each
`participating process would need to manage its direct con-
`nections to all other participating processes. Programmers,
`however, find it very difficult to manage single connections,
`and management of multiple connections is much more
`complex. In addition, participating processes may be limited
`to the number of direct connections that they can support.
`This limits the number of possible participants in the sharing
`of information.
`
`The client/server middleware systems provide a server
`that coordinates the communications between the various
`
`clients who are sharing the information. The server functions
`as a central authority for controlling access to shared
`resources. Examples of client/server middleware systems
`include remote procedure calls (“RPC”), database servers,
`and the common object request broker architecture
`(“CORBA”). Client/server middleware systems are not par-
`ticularly well suited to sharing of information among many
`participants. In particular, when a client stores information
`
`60
`
`65
`
`2
`to be shared at the server, each other client would need to
`poll the server to determine that new information is being
`shared. Such polling places a very high overhead on the
`communications network. Alternatively, each client may
`register a callback with the server, which the server then
`invokes when new information is available to be shared.
`
`Such a callback technique presents a performance bottleneck
`because a single server needs to call back to each client
`whenever new information is to be shared. In addition, the
`reliability of the entire sharing of information depends upon
`the reliability of the single server. Thus, a failure at a single
`computer (i.e., the server) would prevent communications
`between any of the clients.
`The multicasting network protocols allow the sending of
`broadcast messages to multiple recipients of a network. The
`current implementations of such multicasting network pro-
`tocols tend to place an unacceptable overhead on the under-
`lying network. For example, UDP multicasting would
`swamp the Internet when trying to locate all possible par-
`ticipants. IP multicasting has other problems that include
`needing special-purpose infrastructure (e.g., routers) to sup-
`port the sharing of information efficiently.
`The peer-to-peer middleware communications systems
`rely on a multicasting network protocol or a graph of
`point-to-point network protocols. Such peer-to-peer middle-
`ware is provided by the T.120 Internet standard, which is
`used in such products as Data Connection’s D.C.-share and
`Microsoft’s NetMeeting. These peer-to-peer middleware
`systems rely upon a user to assemble a point-to-point graph
`of the connections used for sharing the information. Thus, it
`is neither suitable nor desirable to use peer-to-peer middle-
`ware systems when more than a small number of partici-
`pants is desired. In addition, the underlying architecture of
`the T.120 Internet standard is a tree structure, which relies on
`the root node of the tree for reliability of the entire network.
`That is, each message must pass through the root node in
`order to be received by all participants.
`It would be desirable to have a reliable communications
`
`network that is suitable for the simultaneous sharing of
`information among a large number of the processes that are
`widely distributed.
`BRIEF DESCRIPTION OF THE DRAWINGS
`
`FIG. 1 illustrates a graph that is 4-regular and 4-connected
`which represents a broadcast channel.
`FIG. 2 illustrates a graph representing 20 computers
`connected to a broadcast channel.
`
`FIGS. 3A and 3B illustrate the process of connecting a
`new computer Z to the broadcast channel.
`FIG. 4A illustrates the broadcast channel of FIG. 1 with
`
`an added computer.
`FIG. 4B illustrates the broadcast channel of FIG. 4A with
`
`5
`
`10
`
`15
`
`20
`
`25
`
`30
`
`35
`
`40
`
`45
`
`50
`
`55
`
`an added computer.
`FIG. 4C also illustrates the broadcast channel of FIG. 4A
`
`with an added computer.
`FIG. 5A illustrates the disconnecting of a computer from
`the broadcast channel in a planned manner.
`FIG. 5B illustrates the disconnecting of a computer from
`the broadcast channel in an unplanned manner.
`FIG. 5C illustrates the neighbors with empty ports con-
`dition.
`
`FIG. 5D illustrates two computers that are not neighbors
`who now have empty ports.
`FIG. 5E illustrates the neighbors with empty ports con-
`dition in the small regime.
`
`

`
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 44 of 57 PageID #: 527
`Case 1:15-cv-00228-RGA Document 7-1 Filed 03/31/15 Page 44 of 57 Page|D #: 527
`
`US 6,701,344 B1
`
`3
`FIG. 5F illustrates the situation of FIG. 5E when in the
`
`large regime.
`FIG. 6 is a block diagram illustrating components of a
`computer that is connected to a broadcast channel.
`FIG. 7 is a block diagram illustrating the sub-components
`of the broadcaster component in one embodiment.
`FIG. 8 is a flow diagram illustrating the processing of the
`connect routine in one embodiment.
`
`FIG. 9 is a flow diagram illustrating the processing of the
`seek portal computer routine in one embodiment.
`FIG. 10 is a flow diagram illustrating the processing of the
`contact process routine in one embodiment.
`FIG. 11 is a flow diagram illustrating the processing of the
`connect request routine in one embodiment.
`FIG. 12 is a flow diagram of the processing of the check
`for external call routine in one embodiment.
`
`FIG. 13 is a flow diagram of the processing of the achieve
`connection routine in one embodiment.
`
`FIG. 14 is a flow diagram illustrating the processing of the
`external dispatcher routine in one embodiment.
`FIG. 15 is a flow diagram illustrating the processing of the
`handle seeking connection call routine in one embodiment.
`FIG. 16 is a flow diagram illustrating processing of the
`handle connection request call routine in one embodiment.
`FIG. 17 is a flow