Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 1 of 951
`Case 1:16-cv—02690-AT Document 121-7 Filed 08/05/16 Page 1 of 951
`
`D-2
`
`D-2
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 2 of 951
`
`The ‘062 Patent
`
`communication step, and a
`housekeeping step; and
`
`
`U.S. Patent No. 5,757,783 (Eng ‘783); see also U.S. Patent No. 5,822,309 (Ayanoglu ‘309);
`U.S. Patent No. 5,623,495 (Eng ‘495); U.S. Patent No. 5,717,689 (Ayanoglu ‘689); U.S.
`Patent No. 6,122,759 (Ayanoglu ‘759); U.S. Patent No. 5,774,461 (Hyden)) (collectively
`WaveLAN)
`
`
`“FIG. 4 shows one preferred embodiment of a PBS architecture according to the present
`invention.” Eng ‘783 at 2:53-54.
`
`
`
`
`
`
`
`
`-405-
`
`

`

`The ‘062 Patent
`
`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 3 of 951
`
`U.S. Patent No. 5,757,783 (Eng ‘783); see also U.S. Patent No. 5,822,309 (Ayanoglu ‘309);
`U.S. Patent No. 5,623,495 (Eng ‘495); U.S. Patent No. 5,717,689 (Ayanoglu ‘689); U.S.
`Patent No. 6,122,759 (Ayanoglu ‘759); U.S. Patent No. 5,774,461 (Hyden)) (collectively
`WaveLAN)
`
`
`“[T]he PBS chip 30 includes a plurality of high speed interfaces 34 for communicating with
`other PBSs. The high speed interfaces 34 transmit, for example, in the Gb/s range and …
`may be hardwired, but are preferably coupled wirelessly using radio… .” Eng ‘783 at 4:1-5.
`
`“[T]he PBS 22 is comprised of two main components … a PBS VSLI chip 30 … and a PBS
`processor unit 32… The PBS processor unit 32 is basically a controller that can be
`implemented with single-chip designs as well.” Eng ‘783 at 3:60-67.
`
`“The present invention relates to packet-based telecommunications networks, and more
`particularly to the routing of ATM cells in such a network.” Eng ‘783 at 1:17-20.
`
`“Referring to FIG. 4, there is shown one preferred embodiment for a PBS architecture 22
`according to the present invention. As shown, the PBS 22 is comprised of two main
`components, for example, a PBS VLSI chip 30 which contains all switching and interface
`functions and a PBS processor unit 32. The switching and interface functions of the PBS chip
`are included in a single chip so as to minimize power and space. The PBS processor unit 32 is
`basically a controller that can be implemented with single-chip designs as well. As can be
`seen, the PBS chip 30 includes a plurality of high speed interfaces 34 for communicating with
`other PBSs. The high speed interfaces 34 transmit, for example, in the Gb/s range and as
`mentioned previously, may be hard wired, but are preferably coupled wirelessly using radio
`and/or optics. The high speed interfaces 34 are coupled to ATM switching fabric 36 which is
`responsible for the physical routing within the chip 30. Also coupled to the switching fabric is
`an optional ATM 38 interface which has connections to and from an ATM network. The
`ATM switching fabric 36 is coupled to the PBS processor unit 32 by means of a local port
`interface 40. The local port interface 40 is in turn coupled to a processor interface 42 which
`couples to the PBS processor 44. Signals to and from the mobile laptops are transmitted and
`received at an antenna 46 or other receive/transmit means where the signals travel at the Mb/s
`
`
`
`-406-
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 4 of 951
`
`The ‘062 Patent
`
`a plurality of clients each providing a
`client process including a data
`sending and receiving step, a send
`and receive data buffer maintenance
`step, and
`
`
`U.S. Patent No. 5,757,783 (Eng ‘783); see also U.S. Patent No. 5,822,309 (Ayanoglu ‘309);
`U.S. Patent No. 5,623,495 (Eng ‘495); U.S. Patent No. 5,717,689 (Ayanoglu ‘689); U.S.
`Patent No. 6,122,759 (Ayanoglu ‘759); U.S. Patent No. 5,774,461 (Hyden)) (collectively
`WaveLAN)
`range. A wireless interface 48 couples the antenna 46 to the PBS processor 44. The processor
`interface 42 may also have a direct connection to the optional ATM interface 38 for control
`purposes.” Eng ‘783 at 3:58-4:20.
`
`
`
`“The present invention relates to packet-based telecommunications networks, and more
`particularly to the routing of ATM cells in such a network.” Eng ‘783 at 1:17-20.
`
`“FIG. 3 shows a representation of an Ad-Hoc Wireless LAN according to the present
`invention.” Eng ‘783 at 2:51-52.
`
`
`
`“FIG. 4 shows one preferred embodiment of a PBS architecture according to the present
`invention.” Eng ‘783 at 2:53-54.
`
`
`
`
`
`
`-407-
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 5 of 951
`
`The ‘062 Patent
`
`U.S. Patent No. 5,757,783 (Eng ‘783); see also U.S. Patent No. 5,822,309 (Ayanoglu ‘309);
`U.S. Patent No. 5,623,495 (Eng ‘495); U.S. Patent No. 5,717,689 (Ayanoglu ‘689); U.S.
`Patent No. 6,122,759 (Ayanoglu ‘759); U.S. Patent No. 5,774,461 (Hyden)) (collectively
`WaveLAN)
`
`
`“[T]he PBS chip 30 includes a plurality of high speed interfaces 34 for communicating with
`other PBSs. The high speed interfaces 34 transmit, for example, in the Gb/s range and …
`may be hardwired, but are preferably coupled wirelessly using radio… .” Eng ‘783 at 4:1-5.
`
`“Referring to FIG. 4, there is shown one preferred embodiment for a PBS architecture 22
`according to the present invention. As shown, the PBS 22 is comprised of two main
`components, for example, a PBS VLSI chip 30 which contains all switching and interface
`functions and a PBS processor unit 32. The switching and interface functions of the PBS chip
`are included in a single chip so as to minimize power and space. The PBS processor unit 32 is
`basically a controller that can be implemented with single-chip designs as well. As can be
`seen, the PBS chip 30 includes a plurality of high speed interfaces 34 for communicating with
`other PBSs. The high speed interfaces 34 transmit, for example, in the Gb/s range and as
`mentioned previously, may be hard wired, but are preferably coupled wirelessly using radio
`and/or optics. The high speed interfaces 34 are coupled to ATM switching fabric 36 which is
`responsible for the physical routing within the chip 30. Also coupled to the switching fabric is
`an optional ATM 38 interface which has connections to and from an ATM network. The
`
`
`
`-408-
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 6 of 951
`
`The ‘062 Patent
`
`a link selection step that is one of a
`direct link to a server and an indirect
`link to said server through at least one
`of the remainder of said plurality of
`clients,
`
`U.S. Patent No. 5,757,783 (Eng ‘783); see also U.S. Patent No. 5,822,309 (Ayanoglu ‘309);
`U.S. Patent No. 5,623,495 (Eng ‘495); U.S. Patent No. 5,717,689 (Ayanoglu ‘689); U.S.
`Patent No. 6,122,759 (Ayanoglu ‘759); U.S. Patent No. 5,774,461 (Hyden)) (collectively
`WaveLAN)
`ATM switching fabric 36 is coupled to the PBS processor unit 32 by means of a local port
`interface 40. The local port interface 40 is in turn coupled to a processor interface 42 which
`couples to the PBS processor 44. Signals to and from the mobile laptops are transmitted and
`received at an antenna 46 or other receive/transmit means where the signals travel at the Mb/s
`range. A wireless interface 48 couples the antenna 46 to the PBS processor 44. The processor
`interface 42 may also have a direct connection to the optional ATM interface 38 for control
`purposes. Eng ‘783 at 3:58-4:20.
`
`
`“ATM cells from user A that are destined to user B are first routed from A to the Home PBS
`for A. The cells are then routed along a predetermined virtual path from the Source Home
`PBS to the Destination Home PBS, where they are buffered and then delivered in-sequence to
`B's Local PBS.” Eng ‘783 at 6:19-29.
`
`“The mobile then uses a single FIFO buffer to delay (if necessary) the cells transmitted to the
`new Destination Home PBS (D.sub.2) until all cells have arrived from DH.” Eng ‘783 at 8:62-
`65.
`
`“In order to maintain reliable in-sequence ATM transmissions as users move during the
`course of a connection, a ‘Source Home Station’ and ‘Destination Home Station’ are utilized.
`These stations refer to particular PBSs, associated with a connection, that play a pivotal role
`in maintaining cell sequence. ATM cells from user A that are destined for user B are first
`routed from A to the Home PBS for A. The cells are then routed along a predetermined
`virtual path from the Source Home PBS to the Destination Home PBS, where they are
`buffered and then delivered in-sequence to B’s Local PBS.
`
`Referring to Fig. 8, a virtual path from PBS 2 to 7 (passing through 4 and 6) transports ATM
`cells from A to B.” Eng ‘783 at 6:19-32.
`
`
`
`
`-409-
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 7 of 951
`
`The ‘062 Patent
`
`U.S. Patent No. 5,757,783 (Eng ‘783); see also U.S. Patent No. 5,822,309 (Ayanoglu ‘309);
`U.S. Patent No. 5,623,495 (Eng ‘495); U.S. Patent No. 5,717,689 (Ayanoglu ‘689); U.S.
`Patent No. 6,122,759 (Ayanoglu ‘759); U.S. Patent No. 5,774,461 (Hyden)) (collectively
`WaveLAN)
`Figure 8:
`
`wherein said server process further
`comprising the step of maintaining a
`client link tree having client link
`entries.
`
`
`15. A method as recited in claim 14,
`wherein said server process further
`comprises the steps of:
`
`comparing a selected link from said
`client to said server to a currect client
`link entry in said client link tree; and
`
`
`
`
`
`“In order to administer the per PBS VPI allocations … routing tables are needed to be set up
`in the PBSs… Each PBS stores the VPI routing table … which is a mapping of an incoming
`VPI on any port to an outgoing port. … The algorithms for configuring and maintaining these
`tables can be executed in a centralized or distributed manner… Using shortest path
`algorithms, such as Dijkstra’s or Bellman-Ford, a tree is set up from each PBS to all other
`PBSs.” Eng ‘783 at 8:45-63.
`
`
`
`
`“When a mobile moves from Local PBS D1 to Local PBS D2, (Destination Forwarding) the
`mobile sends a signaling request (through D2) to its Destination Home DH. Since D2 has
`knowledge of the network topology and it also controls the assignment of VCIs for
`connections destined to itself, it includes in the message to DH the new VPI and VCI. In
`addition, the mobile informs DH of the sequence number of the last received cell. If the last
`
`
`
`-410-
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 8 of 951
`
`The ‘062 Patent
`
`updating said client link tree when
`said comparison meets predetermined
`conditions.
`
`
`
`16. A method as recited in claim 15,
`wherein said server process further
`comprises steps of:
`
`determining if said client is authentic;
`
`
`determining if said client is already in
`said client link tree if client is
`determined to be authentic;
`
`deleting said client from said client
`link tree if said client is already in
`
`
`
`U.S. Patent No. 5,757,783 (Eng ‘783); see also U.S. Patent No. 5,822,309 (Ayanoglu ‘309);
`U.S. Patent No. 5,623,495 (Eng ‘495); U.S. Patent No. 5,717,689 (Ayanoglu ‘689); U.S.
`Patent No. 6,122,759 (Ayanoglu ‘759); U.S. Patent No. 5,774,461 (Hyden)) (collectively
`WaveLAN)
`sequence number transmitted from DH doesn't match the last sequence number received by the
`mobile, then DH retransmits the appropriate ATM cells to D2 --using the new VPI and VCI.
`Note that this requires the PBS to have a low-rate ‘Forwarding Queue’ that stores the last ‘N’
`ATM cells it forwarded for each connection. In addition, there is need for VPI/VCI translation
`for forwarding cells.” Eng ‘783 at 7:38-57.
`“When a mobile moves from Local PBS D1 to Local PBS D2, (Destination Forwarding) the
`mobile sends a signaling request (through D2) to its Destination Home DH. Since D2 has
`knowledge of the network topology and it also controls the assignment of VCIs for
`connections destined to itself, it includes in the message to DH the new VPI and VCI. In
`addition, the mobile informs DH of the sequence number of the last received cell. If the last
`sequence number transmitted from DH doesn't match the last sequence number received by the
`mobile, then DH retransmits the appropriate ATM cells to D2 --using the new VPI and VCI.
`Note that this requires the PBS to have a low-rate ‘Forwarding Queue’ that stores the last ‘N’
`ATM cells it forwarded for each connection. In addition, there is need for VPI/VCI translation
`for forwarding cells.” Eng ‘783 at 7:38-57.
`
`
`
`It would have been obvious to implement authentication of clients and maintence of a client
`link tree. See Section V.G supra.
`
`It would have been obvious to implement authentication of clients and maintence of a client
`link tree. See Section V.G supra.
`
`
`It would have been obvious to implement authentication of clients and maintence of a client
`link tree. See Section V.G supra.
`
`-411-
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 9 of 951
`
`The ‘062 Patent
`
`said client link tree; and
`
`inserting said client into said client
`link tree if said client is authentic.
`
`
`
`
`
`
`
`
`
`
`U.S. Patent No. 5,757,783 (Eng ‘783); see also U.S. Patent No. 5,822,309 (Ayanoglu ‘309);
`U.S. Patent No. 5,623,495 (Eng ‘495); U.S. Patent No. 5,717,689 (Ayanoglu ‘689); U.S.
`Patent No. 6,122,759 (Ayanoglu ‘759); U.S. Patent No. 5,774,461 (Hyden)) (collectively
`WaveLAN)
`
`It would have been obvious to implement authentication of clients and maintence of a client
`link tree. See Section V.G supra.
`
`
`
`-412-
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 10 of 951
`
`The ‘062 Patent
`
`2. A wireless network system
`comprising:
`
`a server including a server controller
`and a server radio modem,
`
`said server controller implementing a
`server process that includes the
`control of said server radio modem,
`said server process including the
`receipt and transmission of data
`packets via said server radio modem;
`and
`
`a plurality of clients each including a
`
`
`
`Exhibit Y - Brownrigg, Lynch, and Pepper
`
`Brownrigg, Lynch, and Pepper, “Packet Radio for Library Automation,” 3 Inf. Tech.
`and Libraries 229 (Sept. 1984) (Brownrigg, Lynch, and Pepper)
`
`“The demonstrations have created interest within the library community in the potential for
`‘wireless’ online catalog terminals. In fact, packet radio can be used to create local area
`networks that include terminals, personal computers, and large mainframes, as well as
`gateways to remote networks and systems.” Brownrigg, Lynch, and Pepper at 229.
`
`“A packet radio consists of a transceiver and a microprocessor that, when connected to a
`terminal or microcomputer, allow the device to send and receive data, making possible
`wireless data communications. Figure 1 is a block diagram of a packet radio unit. A receiver
`will recognize and accept only packets that bear its address, allowing a number of receivers to
`listen for data over the same channel. Packetized data also allows a number of transmitters to
`operate over the same channel by permitting the use of communications protocols.”
`Brownrigg, Lynch, and Pepper at 229.
`
`“Packet radio is primarily a local technology. At the University of California, for example, we
`are viewing it as a means of providing access to the online catalog on certain buildings on a
`campus, or perhaps on a campus as a whole. Therefore, it must be tied to a more traditional
`long-haul backbone network—at DLA, the network linking the campuses across the state to
`the DLA computer center in Berkley.” Brownrigg, Lynch, and Pepper at 229.
`
`“A packet radio consists of a transceiver and a microprocessor that, when connected to a
`terminal or microcomputer, allow the device to send and receive data, making possible
`wireless data communications. Figure 1 is a block diagram of a packet radio unit. A receiver
`will recognize and accept only packets that bear its address, allowing a number of receivers to
`listen for data over the same channel. Packetized data also allows a number of transmitters to
`operate over the same channel by permitting the use of communications protocols.”
`Brownrigg, Lynch, and Pepper at 229.
`
`“A packet radio consists of a transceiver and a microprocessor that, when connected to a
`
`-413-
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 11 of 951
`
`The ‘062 Patent
`
`client controller and a client radio
`modem, said client controller
`implementing a client process that
`includes the control of said client
`radio modem, said client process
`including the receipt and transmission
`of data packets via said client radio
`modem,
`
`wherein said client process of each of
`said clients initiates and selects a
`radio transmission path to said server
`that is one of a direct link to said
`server and an indirect link to said
`server through at least one the
`remainder of said plurality of clients,
`
`Brownrigg, Lynch, and Pepper, “Packet Radio for Library Automation,” 3 Inf. Tech.
`and Libraries 229 (Sept. 1984) (Brownrigg, Lynch, and Pepper)
`
`terminal or microcomputer, allow the device to send and receive data, making possible
`wireless data communications. Figure 1 is a block diagram of a packet radio unit. A receiver
`will recognize and accept only packets that bear its address, allowing a number of receivers to
`listen for data over the same channel. Packetized data also allows a number of transmitters to
`operate over the same channel by permitting the use of communications protocols.”
`Brownrigg, Lynch, and Pepper at 229.
`
`
`“The second question, how best to handle routing in a network, is addressed in the network
`layer of the ISO model. This layer involves the means by which packets travel through the
`network to get to their destination.” Brownrigg, Lynch, and Pepper at 234.
`
`“In semibroadcast packet radio networks, routing algorithms will be necessary in order to
`control the repeating of packets. There are several approaches to routing, including broadcast
`routing, path finding, and duct routing.” Brownrigg, Lynch, and Pepper at 237; see also
`Brownrigg, Lynch, and Pepper at 237-38.
`
`“Path finding is a set of techniques whereby a source node identifies a path through a series of
`repeaters to the destination node by either using broadcast routing tables or by broadcasting
`‘probe’ packets until it can find enough repeaters to the reach the destination. Once the path is
`established, this is the most efficient way to route packets, since a packet is not repeated any
`more than is necessary.” Brownrigg, Lynch, and Pepper at 237.
`
`“Kahn [4] discusses path finding and broadcast routing in some detail.” Brownrigg, Lynch,
`and Pepper at 237.
`
`“In duct routing, a path is chosen between the sender and receiver. The path must be wide
`enough to include several different routes for packets, to provide redundancy in case one or
`more of the repeaters in the path fails.” Brownrigg, Lynch, and Pepper at 237.
`
`
`
`-414-
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 12 of 951
`
`The ‘062 Patent
`
`wherein said server process further
`includes logic that maintains a client
`link tree having client link entries.
`
`
`3. A wireless network system as
`recited in claim 2, wherein said server
`process further comprises:
`
`
`
`
`
`
`Brownrigg, Lynch, and Pepper, “Packet Radio for Library Automation,” 3 Inf. Tech.
`and Libraries 229 (Sept. 1984) (Brownrigg, Lynch, and Pepper)
`
`
`“The second question, how best to handle routing in a network, is addressed in the network
`layer of the ISO model. This layer involves the means by which packets travel through the
`network to get to their destination.” Brownrigg, Lynch, and Pepper at 234.
`
`“In semibroadcast packet radio networks, routing algorithms will be necessary in order to
`control the repeating of packets. There are several approaches to routing, including broadcast
`routing, path finding, and duct routing.” Brownrigg, Lynch, and Pepper at 237; see also
`Brownrigg, Lynch, and Pepper at 237-38.
`
`“Path finding is a set of techniques whereby a source node identifies a path through a series of
`repeaters to the destination node by either using broadcast routing tables or by broadcasting
`‘probe’ packets until it can find enough repeaters to the reach the destination. Once the path is
`established, this is the most efficient way to route packets, since a packet is not repeated any
`more than is necessary.” Brownrigg, Lynch, and Pepper at 237.
`
`“Kahn [4] discusses path finding and broadcast routing in some detail.” Brownrigg, Lynch,
`and Pepper at 237.
`
`“In duct routing, a path is chosen between the sender and receiver. The path must be wide
`enough to include several different routes for packets, to provide redundancy in case one or
`more of the repeaters in the path fails.” Brownrigg, Lynch, and Pepper at 237.
`
`
`
`
`-415-
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 13 of 951
`
`The ‘062 Patent
`
`logic that compares a selected link
`from said client to said server to a
`current client link entry in said client
`link tree; and
`
`logic that updates said client link tree
`when said comparison meets
`predetermined conditions.
`
`4. A wireless network system as
`recited in claim 3, wherein said server
`process further comprises:
`
`logic that determines if said client is
`authentic;
`
`logic that determines if said client is
`already in said client link tree if client
`is determined to be authentic;
`
`logic that deletes said client from said
`client link tree if said client is already
`in said client link tree; and
`
`logic that inserts said client in said
`client link tree if said client is
`authentic.
`
`6. A wireless network system
`comprising:
`
`
`
`Brownrigg, Lynch, and Pepper, “Packet Radio for Library Automation,” 3 Inf. Tech.
`and Libraries 229 (Sept. 1984) (Brownrigg, Lynch, and Pepper)
`
`It would have been obvious to compares links in a client link tree to links made available
`during operation and update the client link tree accordingly. See Section V.F supra.
`
`
`It would have been obvious to compares links in a client link tree to links made available
`during operation and update the client link tree accordingly. See Section V.F supra.
`
`
`
`
`It would have been obvious to implement authentication of clients and maintence of a client
`link tree. See Section V.G supra.
`
`It would have been obvious to implement authentication of clients and maintence of a client
`link tree. See Section V.G supra.
`
`
`It would have been obvious to implement authentication of clients and maintence of a client
`link tree. See Section V.G supra.
`
`It would have been obvious to implement authentication of clients and maintence of a client
`link tree. See Section V.G supra.
`
`
`“The demonstrations have created interest within the library community in the potential for
`‘wireless’ online catalog terminals. In fact, packet radio can be used to create local area
`
`-416-
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 14 of 951
`
`The ‘062 Patent
`
`
`
`
`
`server means providing a server
`process including receiving data
`packets via a server wireless
`communication means, sending data
`packets via said wireless
`communication means,
`communicating with a network, and
`performing housekeeping functions;
`and
`
`
`a plurality of client means, each client
`means providing a client process
`including sending and receiving data
`packet via a client wireless
`communication means, maintaining a
`send/receive data buffer in digital
`memory, and
`
`Brownrigg, Lynch, and Pepper, “Packet Radio for Library Automation,” 3 Inf. Tech.
`and Libraries 229 (Sept. 1984) (Brownrigg, Lynch, and Pepper)
`
`networks that include terminals, personal computers, and large mainframes, as well as
`gateways to remote networks and systems.” Brownrigg, Lynch, and Pepper at 229.
`
`
`“A packet radio consists of a transceiver and a microprocessor that, when connected to a
`terminal or microcomputer, allow the device to send and receive data, making possible
`wireless data communications. Figure 1 is a block diagram of a packet radio unit. A receiver
`will recognize and accept only packets that bear its address, allowing a number of receivers to
`listen for data over the same channel. Packetized data also allows a number of transmitters to
`operate over the same channel by permitting the use of communications protocols.”
`Brownrigg, Lynch, and Pepper at 229.
`
`“Packet radio is primarily a local technology. At the University of California, for example, we
`are viewing it as a means of providing access to the online catalog on certain buildings on a
`campus, or perhaps on a campus as a whole. Therefore, it must be tied to a more traditional
`long-haul backbone network—at DLA, the network linking the campuses across the state to
`the DLA computer center in Berkley.” Brownrigg, Lynch, and Pepper at 229.
`
`Brownrigg, Lynch, and Pepper at Fig. 1 (“/O Buffers”).
`
`“A packet radio consists of a transceiver and a microprocessor that, when connected to a
`terminal or microcomputer, allow the device to send and receive data, making possible
`wireless data communications. Figure 1 is a block diagram of a packet radio unit. A receiver
`will recognize and accept only packets that bear its address, allowing a number of receivers to
`listen for data over the same channel. Packetized data also allows a number of transmitters to
`operate over the same channel by permitting the use of communications protocols.”
`Brownrigg, Lynch, and Pepper at 229.
`
`Brownrigg, Lynch, and Pepper at Fig. 1 (“I/O Buffers”).
`
`
`
`
`-417-
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 15 of 951
`
`The ‘062 Patent
`
`selecting a link to said server means
`that is one of a direct link to said
`server and an indirect link to said
`server through at least one of the
`remainder of said plurality of client
`means,
`
`
`wherein said server process further
`comprises a means for maintaining a
`client link tree having client link
`entries.
`
`Brownrigg, Lynch, and Pepper, “Packet Radio for Library Automation,” 3 Inf. Tech.
`and Libraries 229 (Sept. 1984) (Brownrigg, Lynch, and Pepper)
`
`
`“The second question, how best to handle routing in a network, is addressed in the network
`layer of the ISO model. This layer involves the means by which packets travel through the
`network to get to their destination.” Brownrigg, Lynch, and Pepper at 234.
`
`“In semibroadcast packet radio networks, routing algorithms will be necessary in order to
`control the repeating of packets. There are several approaches to routing, including broadcast
`routing, path finding, and duct routing.” Brownrigg, Lynch, and Pepper at 237; see also
`Brownrigg, Lynch, and Pepper at 237-38.
`
`“Path finding is a set of techniques whereby a source node identifies a path through a series of
`repeaters to the destination node by either using broadcast routing tables or by broadcasting
`‘probe’ packets until it can find enough repeaters to the reach the destination. Once the path is
`established, this is the most efficient way to route packets, since a packet is not repeated any
`more than is necessary.” Brownrigg, Lynch, and Pepper at 237.
`
`“Kahn [4] discusses path finding and broadcast routing in some detail.” Brownrigg, Lynch,
`and Pepper at 237.
`
`“In duct routing, a path is chosen between the sender and receiver. The path must be wide
`enough to include several different routes for packets, to provide redundancy in case one or
`more of the repeaters in the path fails.” Brownrigg, Lynch, and Pepper at 237.
`
`“The second question, how best to handle routing in a network, is addressed in the network
`layer of the ISO model. This layer involves the means by which packets travel through the
`network to get to their destination.” Brownrigg, Lynch, and Pepper at 234.
`
`“In semibroadcast packet radio networks, routing algorithms will be necessary in order to
`control the repeating of packets. There are several approaches to routing, including broadcast
`routing, path finding, and duct routing.” Brownrigg, Lynch, and Pepper at 237; see also
`
`
`
`-418-
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 16 of 951
`
`The ‘062 Patent
`
`
`7. A wireless network system as
`recited in claim 6, wherein said server
`process further comprises:
`
`a means for comparing a selected link
`from said client to said server to a
`current client link entry in said client
`link tree; and
`
`a means for updating said client link
`tree when said comparison meets
`predetermined conditions.
`
`8. A wireless network system as
`
`
`
`Brownrigg, Lynch, and Pepper, “Packet Radio for Library Automation,” 3 Inf. Tech.
`and Libraries 229 (Sept. 1984) (Brownrigg, Lynch, and Pepper)
`
`Brownrigg, Lynch, and Pepper at 237-38.
`
`“Path finding is a set of techniques whereby a source node identifies a path through a series of
`repeaters to the destination node by either using broadcast routing tables or by broadcasting
`‘probe’ packets until it can find enough repeaters to the reach the destination. Once the path is
`established, this is the most efficient way to route packets, since a packet is not repeated any
`more than is necessary.” Brownrigg, Lynch, and Pepper at 237.
`
`“Kahn [4] discusses path finding and broadcast routing in some detail.” Brownrigg, Lynch,
`and Pepper at 237.
`
`“In duct routing, a path is chosen between the sender and receiver. The path must be wide
`enough to include several different routes for packets, to provide redundancy in case one or
`more of the repeaters in the path fails.” Brownrigg, Lynch, and Pepper at 237.
`
`
`
`
`It would have been obvious to compares links in a client link tree to links made available
`during operation and update the client link tree accordingly. See Section V.F supra.
`
`
`It would have been obvious to compares links in a client link tree to links made available
`during operation and update the client link tree accordingly. See Section V.F supra.
`
`
`
`
`-419-
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 17 of 951
`
`Brownrigg, Lynch, and Pepper, “Packet Radio for Library Automation,” 3 Inf. Tech.
`and Libraries 229 (Sept. 1984) (Brownrigg, Lynch, and Pepper)
`
`
`It would have been obvious to implement authentication of clients and maintence of a client
`link tree. See Section V.G supra.
`
`It would have been obvious to implement authentication of clients and maintence of a client
`link tree. See Section V.G supra.
`
`
`It would have been obvious to implement authentication of clients and maintence of a client
`link tree. See Section V.G supra.
`
`It would have been obvious to implement authentication of clients and maintence of a client
`link tree. See Section V.G supra.
`
`
`“The demonstrations have created interest within the library community in the potential for
`‘wireless’ online catalog terminals. In fact, packet radio can be used to create local area
`networks that include terminals, personal computers, and large mainframes, as well as
`gateways to remote networks and systems.” Brownrigg, Lynch, and Pepper at 229.
`
`“A packet radio consists of a transceiver and a microprocessor that, when connected to a
`terminal or microcomputer, allow the device to send and receive data, making possible
`wireless data communications. Figure 1 is a block diagram of a packet radio unit. A receiver
`
`-420-
`
`The ‘062 Patent
`
`recited in claim 7, wherein said server
`process further includes:
`
`
`
`
`
` a
`
` means for determining if said client
`is authentic;
`
`a means for determining if said client
`is already in said client link tree if
`client is determined to be authentic;
`
`a means for deleting said client from
`said client link tree if said client is
`already in said client link tree; and
`
`a means for inserting said client in
`said client link tree if said client is
`authentic.
`
`10. A method for providing wireless
`network communication comprising:
`
`
`providing a server implementing a
`server process including receiving
`data packets via r.f. transmission,
`
`
`
`

`

`Case 1:16-cv-02690-AT Document 121-7 Filed 08/05/16 Page 18 of 951
`
`The ‘062 Patent
`
`sending data packets via r.f.
`transmission, communicating with a
`network, and performing
`housekeeping functions; and
`
`
`providing a plurality of clients, each
`client providing a client process
`including sending and receiving data
`packet via r.f transmission,
`maintaining a send/receive data
`buffer in digital memory, and
`
`
`selecting a transmission path to said
`server via that is one of a direct link
`to said server and an indirect link to
`said server through at least one of the
`remainder of said plurality of clients,
`
`Brownrigg, Lynch, and Pepper, “Packet Radio for Library Automation,” 3 I