IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 1 of 28
`
`

`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 2 of 28
`
`

`
`The Information
`System
`Consultant's
`Handbook
`Systems Analysis
`and Design
`
`William S. Davis
`Miami Univer�b;
`and
`David C. Yen
`Miami University
`
`CRC Press
`Boca Raton London New York Washington, D.C.
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 3 of 28
`
`

`
`- \
`
` S r/
`.lD
`�7�}�
`1 '11 I
`
`Lihrary of Congress Cataloging-in-Publication Data
`
`Davis, William S., 1943-
`The information system consultant's handbook : systems analysis
`and design I by WilliamS. Davis and David C. Yen.
`p. em.
`Includes index.
`ISBN 0-8493-7001-9 (alk. paper)
`I. System analysis--Handbooks, manuals, etc. 2. System design­
`-Handbooks. manuals, etc. 3. Management information systcrns-
`-H;mdbooks. manuals, etc. J. Yen, David C. II. Tille.
`T57.6.D378 1998
`004.2'1-dc21
`
`98-28765
`CLP
`
`This book contnins information obtained from authentic and highly regarded sources. Reprinted
`mnterial is quoted with permission, and sources nrc indicated. A wide variety of references nrc listed.
`Reasonable efforts have been made to publish reliable data and informmion, but the author and the
`publisher cannot assume responsibility for the validity of nil materials or for the consequences of their use.
`Neither this book nor any part may be reproduced or transmitted in nny form or by any means,
`electronic or mechanical, including photocopying, microfilming, and recording, or by any information
`stomge or retrieval system, without pl'ior permission in writing from the publisher.
`The consent of CRC Press LLC does not extend to copying for gcnernl distribution, for promotion,
`for creating new works, or for resale. Specific permission must be obtained in writing from CRC Press
`LLC for such copying.
`Direct all inquiries to CRC Press LLC. 2000 Corpor:�te Blvd., N.W .. Boca Raton, Aorida 33431.
`
`Trademark Notice: Product or corporate names may be tmdernnrks or registered trademarks. and
`are only used for identification and explanation, without intent ro infringe.
`
`Q 1999 by CRC Press LLC
`
`No claim to original U.S. Government works
`lnremutionnl Standard Book Number 0-8493-7001-9
`Libmry of Congress Card Number 98-28765
`Printed in the United States of America I 2 3 4 5 6 7 8 9 0
`Printed on acid-free paper
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 4 of 28
`
`

`
`chapter fifty-two
`
`Network models
`
`David C. Yen and William S. Davis
`
`Contents
`
`52.1 Purpose . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 415
`52.2 Strengths, weaknesses, and limitations . . . . . .. . . . . . .. . . . . . . . 416
`. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 416
`52.3 Inputs and related ideas
`52.4 Concepts
`. . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . 416
`52. 4.1 Star topology
`. . . . . . . .. . . . . . . . . . . . . . . . . . . . . .. . . . . 416
`. . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . 4 1 8
`52.4.2 Mesh topology
`52.4.3 Bus topology . . . . .. . . . . . . .. . . . . . . . . . . . . . . . . . . . . . . 4 1 9
`. . . . . . . . ... . . . . . . . . . . . . . . . . . . . . . . . . 420
`52.4.4 Tree topology
`52. 4. 5 Ring topology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 2
`52.5 Key terms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 423
`52.6 Software .. . . . . . . . . . . . . . . . . . . . . .. . . . . . . . .. . . . . . . . . . . . . . 42 4
`52.7 References . . .... . . . . . ... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 4
`
`52.1 Purpose
`Network models are used to determine the physical configuration of the
`computers and peripherals that form a network or distributed environment.
`This chapter describes several common network topologies.
`Network design is a highly specialized discipline in its own right, and a
`detailed explanation of network analysis tools and techniques is beyond the
`
`0-8493·7001·9/99/$0.00+$.50
`01999 by CRC Press LLC
`
`415
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 5 of 28
`
`

`
`416
`
`Information System Consultant's Handbook
`
`scope of thls book. This chapter is written for systems analysts and infor­
`mation system consultants who must work with network specialists.
`
`52.2 Strengths, weaknesses, and limitations
`The strengths, weaknesses, and limitations of the various topologies will be
`discussed in context.
`
`52.3
`Inputs and related ideas
`This chapter is concerned with the overall design of a network or a distrib­
`uted system. The process of analyzing and design a given network is cov­
`ered in Chapter 53. Chapter 54 discusses the process of routing messages
`among a network's nodes. Network design is related to hardware interface
`design (Chapter 42). The hardware interface is affected by the network
`topology, and each network node can be viewed as a hardware interface.
`Readers who are not familiar with data communications theory and
`concepts should review the data communications chapter in an introduc­
`tory management information systems or computer information systems
`textbook.
`
`52.4 Concepts
`Network models are used to determine the physical configuration of the
`computers and peripherals that form a network or distributed environment.
`This chapter describes several common network designs, or topologies. The
`terms network design and topology design are sometimes used to describe the
`process of designing a network topology.
`A network consists of two or more computers linked by a communica­
`tion line. The line might consist of coaxial cables, telephone wires, fiber optic
`cables, microwave signals, satellite signals, or some combination of media.
`The computers that form a local area network are usually located in
`close geographic proximity (for example, within the same building, complex
`of buildings, or campus) and are generally linked by direct lines. The com­
`puters that form a wide area network are usually geographically disbursed
`and are often linked by common carriers. Each computer in a wide area net­
`work is called a host. Each connection point (computer, workstation, periph­
`eral, concentrator, etc.) in the network is called a node.
`
`52.4.1 Star topology
`On a star network, all messages must pass through a central computer before
`they are passed to the destination computer. A simple star network (Figure
`52.1 ) consists of several computers and/or peripherals each linked to a cen­
`tral host computer via a dedicated line. A variation of a simple star network
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 6 of 28
`
`

`
`Chapter ftfhj-two: Network models
`
`417
`
`Fig11re 52.1 A simple star network.
`
`features several computers, terminals, and/ or peripherals connected to a
`cluster controller and sharing a communication link from the controller to
`the central computer.
`Two or more simple star networks can be linked to form a complex star
`network as shown in Figure 52.2. Generally, one of the hub computers (usu­
`ally, a powerful mainframe or minicomputer) serves as central boss and con­
`trols the network by scheduling, prioritizing, and holding incoming and
`outgoing messages. For example, in Figure 52.2, hub 2 and hub 3 must com­
`municate with each other through hub 1 , the central node or boss. If there is
`no single, clear, dominant, central node, several hub computers can work
`together as partners to relay messages.
`Because dedicated lines are used to connect the remote nodes to the cen­
`tral node, star topology is the simplest but most expensive topology. The
`central node makes centralized supervisory and control functions relatively
`easy to perform. However, the entire network goes down if the central node
`goes out of service unless funds are spent to provide a reliable backup for
`both hardware and software. Many telephone company computer systems
`use star topology.
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 7 of 28
`
`

`
`418
`
`Information System Consultant's Handbook
`
`Hub l
`
`Hub2
`
`Hub3
`
`Figure 52.2 A complex star network.
`52.4.2 Mesh topology
`A mesh network allows any two remote computers to communicate directly,
`although there may be cases when a third computer relays a message from a
`source to a destination. In a fully connected mesh network every computer is
`directly connected to all the other computers in the network (Figure 52.3)
`In a partially connected mesh network, every computer is connected (either
`directly or via a relay computer) to at least two other computers in the net­
`work by more than one path (Figure 52.4).
`Mesh topology is the most reliable and most expensive network topol­
`ogy. Most mesh topology networks belong to the government, the military,
`or a big corporation that needs a secured path to transmit data.
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 8 of 28
`
`

`
`Cl1apter fifty-two: Network models
`
`419
`
`Fig.1re 52.3 A fully connected mesh network.
`
`Figure 52.4 A partially connected mesh network.
`52.4.3 Bus topology
`On a bus network (Figure 52.5), the host computer is located at one end of a
`common communication line and all the other computers and peripherals in
`the network are attached to the same line.
`A bus network is relatively inexpensive and easy to expand because all
`the nodes share a common communication path. However, traffic is heavy on
`the common line, and the network tends to degrade as the number of nodes
`increases. The location of the host node (relative to certain other nodes) can
`create an unbalanced network and negatively impact network performance.
`One host node may not be sufficient to handle all the traffic, and sophisti­
`cated equipment and software are needed to control the network
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 9 of 28
`
`

`
`420
`
`Information System Consultant's Handbook
`
`Server
`
`PC
`
`PC
`
`PC
`
`PC
`
`Figure 52.5 A bus network
`
`52.4.4 Tree topolOglJ
`
`Tree topology (or hierarchical topology) is a hybrid topology. Generally,
`two or more star or bus networks are connected to form a tree network. A
`rooted tree network (Figure 52 .6) is a tree network with a clearly defined
`root node that serves as a base for the entire network. An unrooted tree net­
`work (Figure 52.7) has no clearly defined base root. Instead, there are sever­
`al nodes that act as major hubs to relay messages or perform limited super­
`visory functions.
`Tree topology is easy to implement using gateways, bridges, and/ or
`routers. A major problem is that bottlenecks can develop in the equipment
`that connects the subnetworks.
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 10 of 28
`
`

`
`Chapter ftftt;-two: Network models
`
`421
`
`Figure 52.6 A rooted tree network.
`
`Figr�re 52.7 An unrooted tree network.
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 11 of 28
`
`

`
`422
`
`Information System Consultant's Handbook
`
`Figure 52.8 A ring network.
`
`52.4.5 Ring topology
`A ring network (Figure 52.8) consists of a series of nodes connected to form
`a ring. Each message is received, repeated, and retransmitted by each node
`as it works its way around the ring in a predetermined direction. A loop is
`a variation of a ring network with controlling nodes in the ring.
`Because a ring or loop network transmits information in one direction
`only, transmission speed tends to be faster than with the other topologies.
`Ring networks are usually implemented using a token-passing protocol,
`which tends to limit network size, however. (For example, the nodes on a
`500-node network can face lengthy delays waiting for the token.) The need
`for a special token symbol and procedures to enforce the direction of flow
`adds to the complexity of ring network design.
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 12 of 28
`
`

`
`Chapter fifty-two: Network models
`
`423
`
`52.5 Key terms
`Bus network-A network in which the host computer is located at one
`end of a common communication line and all the other computers
`and peripherals in the network are attached to the same line.
`Complex star network-A network that consists of two or more linked
`simple star networks.
`Data communication - The act of transmitting data from one compo­
`nent to another.
`Fully connected mesh network-A mesh network in which every com­
`puter is directly connected to all the other computers in the network.
`Host - A computer in a wide area network.
`Local area network (LAN) -A network in which the nodes are located
`in dose geographic proximity and are generally linked by direct lines
`(such as hard wires).
`Mesh network-A network that allows any two remote computers to
`communicate directly.
`Network-Two or more computers linked by a communication line.
`Node - A connection point (computer, workstation, peripheral, con­
`centrator, etc.) in a network.
`Partially connected mesh network -A mesh network in which every
`computer is connected (either directly or via a relay computer) to at
`least two other computers in the network by more than one path.
`Ring network -A network that consists of a series of nodes connected
`to form a ring.
`Rooted tree network -A tree network with a clearly defined root node
`that serves as a base for the entire network.
`Simple star network -A network that consists of several computers
`and/ or peripherals, each linked to a central host computer via a ded­
`icated line.
`Star network -A network on which all messages must go through a
`central computer before they are passed to the destination computer.
`Token passing - A network management technique in which an elec­
`tronic token is passed continuously from node to node around the
`network and a given node can transmit a message only when it holds
`the token.
`Topology - A map of a network; a physical arrangement of the nodes
`and connections in a network.
`Tree topology (hierarchical topology) -A hybrid topology that usually
`consists of two or more linked star or bus networks.
`Unrooted tree network -A tree network with no dearly defined base
`root; instead, there are several nodes that act as major hubs to relay
`messages or perform limited supervisory functions.
`Wide area network (WAN) -A network in which the nodes are (usu­
`ally) geographically disbursed and linked by common carriers.
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 13 of 28
`
`

`
`424
`
`Information System Consultant's Handbook
`
`52.6 Software
`Not applicable.
`
`52.7 References
`1. Conrad, J. W., Handbook of Communications Systems Management, Auerbach,
`Boston, MA, 1988, 1989, 1990-1991.
`2. Martin, J. and Leben, J., Principle of Data Communications, Prentice-Hall,
`Englewood Cliffs, NJ, 1988.
`3. Martin, J. and Leben, J., Data Communications Technology, Prentice-Hall,
`Englewood Cliffs, NJ, 1988.
`4. Ramos, E., Schroeder, A., and Beheler A., Computer Networking Concepts,
`Prentice-Hall, Englewood Cliffs, NJ, 1996.
`5. Rhodes, P. D., Building a Network: How to Specify, Design, Procure, and Install a
`Corporate LAN, McGraw-Hill, New York, 1995.
`6. Slone,]. P. and Drinan, A., Handbook of Local Area Networks, Auerbach,
`Boston, MA, 1991.
`7. Spohn, D. L., Data Network Design, McGraw-Hill, New York, 1997.
`8. Stallings, W., Business Data Communications, Macmillan, New York, 1990.
`9. Stallings, W., Handbook of Computer-Communications Standards: The OSI Model
`and OSI-Related Standards, Vol. 1, Macmillan, New York, 1987.
`10. Stallings, W., Handbook of Computer-Communications Standards: Local Network
`Standards, vol. 2, Macmillan, New York, 1987.
`11. Stallings, W., Handbook of Computer-Communications Standards: DOD Protocol
`Standards, vol. 3, Macmillan, New York, 1988.
`12. Taylor, D. E., The McGraw-Hill Interne/working Handbook, McGraw-Hill, New
`York, 1995.
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 14 of 28
`
`

`
`chapter fifty-three
`
`Network analysis
`
`David C. Yen and William S. Davis
`
`Contents
`
`. . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . .
`
`4 2 5
`53.1 Purpose
`53.2 Strengths, weaknesses, and limitations . . ... .. . . . . . . . . . . . . . . 4 25
`Inputs and related ideas ...... . .... ........ .. . ...... . . .. . . 42 6
`53.3
`53.4 Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 6
`53. 4 .1 Requirements identification ............ .. .. .. . .. . . 42 6
`53. 4.2 Network design
`. ..... .............. .... . . . . . .. . . 42 7
`53. 4 .3 Cost estimating . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 7
`53. 4.4 Documentation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42 7
`53.5 Key terms . .. ........ . . . . ... . . . . .. . .. .. . . . . . . . . . . . . . . . . 42 8
`.. . . . . . . . 430
`53.6 Software . . . . ... . . . . . . .. . ...... ... .... ... . . . . .
`53.7 References
`. . . . . .. . . . . . . . . . . . . . . . .. . . . .. . . . .... . . . . .. . .
`430
`
`53.1 Purpose
`The purpose of this chapter is to overview the key activities in the network
`analysis and design process. Network analysis is a highly specialized disci­
`pline in its own right, and a detailed explanation of network analysis tools
`and techniques is beyond the scope of this book. This chapter is written for
`systems analysts and information system consultants who must work with
`network specialists.
`
`53.2 Strengths/ weaknesses/ and limitations
`Not applicable.
`
`0-8493-7001-9/99 /$0.00+$.50
`C>1999 by CRC Press LLC
`
`425
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 15 of 28
`
`

`
`426
`
`Infomiation System Consultant's Handbook
`
`53.3
`Inputs and related ideas
`Network topologies are discussed in Chapter 52. Location connectivity
`analysis is covered in Chapter 54. Simulation (Chapter 19) and queuing the­
`ory (Chapter 79) are two mathematical tools that are often used to support
`network analysis. The cost estimating process might include a cost/benefit
`analysis (Chapter 38). Network consultants often develop detailed cost esti­
`mates in response to a competitive procurement opportunity (Chapter 41).
`The need for a network is established during the analysis (Part IV) and high­
`level design (Part V) stages of the system development life cycle. Key net­
`work design parameters are documented in the requirements specifications
`(Chapter 35).
`
`53.4 Concepts
`The purpose of this chapter is to overview the key activities in the network
`analysis and design process. A detailed explanation of network analysis
`tools and techniques is beyond the scope of this book.
`
`53.4.1 Requirements identification
`The purpose of requirements identification is to ensure that the network
`designers have clear definitions and a detailed understanding of the essen­
`tial network requirements and related network design attributes.
`Geographical requirements analysis begins with a careful study of the
`system's geographical locations (i.e., buildings and areas) and focuses on
`such issues as topology (Chapter 52) and transmission media (dedicated
`cable, microwave, satellite, common carrier). Traffic flow pattern analysis is
`also used to help define the network's topology (Chapter 52) and connec­
`tions (Chapter 54) as well as message volumes associated with the various
`data flows.
`Traffic load analysis includes such elements as peak load analysis, mes­
`sage duration analysis, and busy hour analysis. Together, they are used to
`determine the required number of communication lines, the maximum
`required capacity for each line, the time slots during which the communica­
`tion lines are likely to be busy, and several related network performance
`parameters. The purpose of availability requirements analysis is to deter­
`mine and document the effect of time differences (time zone shifts) between
`the different geographical areas covered by the network.
`As the name implies, response time analysis is concerned with deter­
`mining the system's response time requirements (e.g., interactive, store and
`forward, real-time, etc.). Reliability requirements analysis provides infor­
`mation that helps the designer develop a back-up plan or create necessary
`redundancies.
`Hardware analysis is used to define the requirements for the personal
`computers, workstations, terminals, peripherals, communication interfaces,
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 16 of 28
`
`

`
`Chapter fifty-three: Network analysis
`
`427
`
`modems, and other hardware that will be attached to the network.
`Additionally, such software as the operating system and communication
`protocols must be specified. Future projection analysis focuses on parame­
`ters that affect capacity planning, storage requirements, transmission speed,
`connections with the Internet, and the highway (or Turnpike) effect.
`
`53.4.2 Network design
`
`Based on the network requirements identified in the previous stage, the net­
`work is physically designed.
`Topology determination focuses on physically laying out the network
`using such tools as location connectivity diagrams (Chapter 54). The
`required line speeds are defined based on such criteria as transmitted char­
`acters per day, computer time (input, output, and processing) per message,
`and the required response time. Concentration point determination is con­
`cerned with the system's concentration points (or hubs). Such factors as the
`number of hubs, the capacities and related requirements for the lines that
`link the hubs, and the number of clients per server (or per hub) must be
`weighed against network efficiency.
`Bottlenecks (or choke points) are places in the network where message
`flow exceeds capacity, resulting in delays and even lost messages.
`Bottleneck analysis (an application of queuing theory, Chapter 79) is a use­
`ful, mathematical tool for identifying choke points and for evaluating how
`various line capacities, transmission speeds, and hardware options (pro­
`cessing speed, storage capacity) affect performance. Queuing theory can
`also be used to gauge the sensitivity of a network design to such variables
`(or assumptions) as average message length, message duration, and busy
`hours. Simulation (Chapter 19) is another useful mathematical tool that can
`help identify and solve many network design problems. The advantages of
`using mathematical tools such as queuing theory and simulation include
`quick feedback, the flexibility to consider numerous variables or assump­
`tions, and low cost.
`
`53.4.3 Cost estimating
`
`Networks are expensive to develop and to operate. Clear, accurate develop­
`ment, and operating cost estimates are essential before the final decision to
`implement a network is made. The cost estimating process might include a
`cost/benefit analysis (Chapter 38). Network consultants often develop detailed
`cost estimates in response to a competitive procurement opportunity (Chapter 41 ).
`
`53.4.4 Documentation
`
`Once the network analysis is completed, the various design decisions must
`be carefully documented. Connection diagrams define the topology,
`connection points, and traffic flows. Key supporting details include the
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 17 of 28
`
`

`
`428
`
`Information System Consultant's Handbook
`
`types of transmission media, the desired technology (e.g., Tl, ISDN, fiber
`
`
`
`optics, satellite, microwave), the capacities, speeds, and costs of those
`media, and a back-up plan. The act of preparing the connection diagrams
`
`and supporting documentation is sometimes called logical documentation
`and preparation.
`During the physical documentation and preparation phase, a complete
`
`
`component list is prepared for each node in the network. Key parameters
`
`include the brand name, model, speed, and other relevant specifications for
`such hardware components as the computers, the modems, and related
`
`
`
`peripherals (printers, scanners, etc.), and the nature and description of all
`Sometimes, hierarchy charts (Chapters 48 and 62) are
`cables and connectors.
`prepared to help document the components that form a subnetwork con­
`trolled by a hub.
`The network specifications incorporate all the information related to
`
`
`
`the network. In addition to the documentation described above, routers,
`bridges, and other message switching equipment or devices must be docu­
`
`mented in detail. Finally, such details as floor plans, rising cables, distribut­
`
`
`ing cables, central switch boxes, server locations, telephone jack locations,
`and power outlets must be documented in a wiring diagram.
`
`53.5 Key terms
`requirements analysis -A network analysis process that
`Availability
`
`helps to determine and document the effect of time differences (time
`
`
`zone shifts) between the different geographical areas covered by the
`network.
`Bottleneck (choke point) -A place in the network where message flow
`
`
`exceeds capacity, resulting in delays and even lost messages.
`Bridge- A computer that links two networks with similar protocols.
`Client-A computer (more generally, a node) that requests a service
`
`from a server.
`- A network in which client computers request services
`Client/server
`from a central server computer.
`-A network analysis process that
`
`
`Concentration point determination
`
`is concerned with the system's concentration points (or hubs).
`Connection diagram -A diagram that shows the topology, connection
`points, traffic flows, and patterns of a network.
`
`Data communication - The act of transmitting data from one compo­
`nent to another.
`
`cable - Generally, a cable that links the computers or
`Distributing
`nodes on a single floor.
`Future projection analysis - A network analysis process that focuses
`
`on parameters that affect capacity planning, storage requirements,
`
`
`transmission speed, connections with the Internet, and so on.
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 18 of 28
`
`

`
`Chapter fifty-three: Network analysis
`
`429
`
`Gateway -A computer that links two or more networks with different
`protocols.
`Geographical requirements analysis-A preliminary network analysis
`process that begins with a ccu:eful study of the system's geographical
`locations and focuses on such issues as topology and transmission
`media.
`Hardware analysis -A network analysis process that helps to define
`the requirements for the personal computers, workstations, termi­
`nals, peripherals, communication interfaces, modems, and other
`hardware that will be attached to the network, and such software as
`the operating system and communication protocols.
`Highway effect (turnpike effect) -The tendency of users to quickly
`adopt new technology as soon as it proves its usefulness; because of
`the highway effect, the demands placed on a system often exceed
`projections. This term was initially coined in the 1950s when the traf­
`fic load on the Pennsylvania Turnpike exceeded the designers' long­
`term, worst-case projections soon after the road opened.
`Host-A computer in a wide area network.
`Hub -A central controlling device, point, or node in a network.
`Local area network (LAN)-A network in which the nodes are located
`in close geographic proximity and are generally linked by direct
`lines.
`Message switching-The process of routing a message from its source
`to its destination; note that sometimes messages are decomposed into
`packets that reach their destination via different transmission paths.
`Network-Two or more computet·s linked by a communication line.
`Network topology -A map of a network; a physical arrangement of
`the nodes and connections in a network.
`Node - A connection point (computer, workstation, peripheral, con­
`centrator, etc.) in a network.
`Protocol -A set of rules that governs data communication.
`Reliability requirements analysis - A network analysis process that
`helps the designer develop a back-up plan or create necessary redun­
`dancies.
`Response time analysis - A network analysis process that helps to
`determine the system's response time requirements (e.g., interactive,
`store and forward, real-time, etc.).
`Rising cable - Generally, a cable that runs between two floors in a
`building.
`Router -An intelligent device that provides network connections and
`performs such services as protocol conversion and message routing.
`Server - A computer that holds centralized resources and provides
`them to clients on request.
`Token passing -A network management technique in which an elec­
`tronic token is passed continuously from node to node around the
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 19 of 28
`
`

`
`430
`
`Information System Consttltant's Handbook
`
`network and a given node can transmit a message only when it holds
`the token.
`Topology -A map of a network; a physical arrangement of the nodes
`and connections in a network.
`Topology determination -A network analysis process that focuses on
`physically laying out the network using such tools as location con­
`nectivity diagrams.
`Traific flow pattern analysis-A network analysis process that helps to
`define the network's topology and connections as well as the mes­
`sage volumes associated with the various data flows.
`Traffic load analysis -A network analysis process that helps to deter­
`mine the required number of communication lines, the maximum
`required capacity for each line, the time slots during which the com­
`munication lines are likely to be busy, and several related network
`performance parameters.
`Wide area network (WAN)-A network in which the nodes are (usu­
`ally) geographically disbursed and linked by common carriers.
`
`53.6 Software
`Not applicable.
`
`53.7 References
`1. Conrad, J. W., Handbook of Comnumications Systems Management, Auerbach,
`Boston, MA, 1988,1989,1990-1991.
`2. Martin,]. and Leben, J., Principle of Data Communications, Prentice-Hall,
`Englewood Cliffs, NJ, 1988.
`3. Martin, J. and Leben,]., Data Communications Technology, Prentice-Hall,
`Englewood Cliffs, NJ, 1988.
`4. Ramos, E., Schroeder, A., and Beheler A., Computer Networking Concepts,
`Prentice-Hall, Englewood Cliffs, NJ, 1996.
`5. Rhodes, P. D., Building a Network: How to Specifi;, Design, Procure, and Install a
`Corporate LAN, McGraw-Hill, New York, 1995.
`6. Slone, J. P. and Drinan, A., Handbook of Local Area Networks, Auerbach,
`Boston, MA, 1991.
`7. Spohn, D. L., Data Network Design, McGraw-Hill, New York, 1997.
`8. Stallings, W., Business Data Communications, Macmillan, New York, 1990.
`9. Stallings, W., Handbook of Computer-Communications Standards: The OS/ Model
`and OSI-Related Standards, vol. 1, Macmillan, New York, 1987.
`10. Stallings, W., Handbook of Computer-Comnnmications Standards: Local Nettuork
`Standards, vol. 2, Macmillan, New York, 1987.
`11. Stallings, W., Handbook of Computer-Commrmications Standards: DOD Protocol
`Standards, vol. 3, Macmillan, New York, 1988.
`12. Taylor, D. E., The McGraw-Hill lnlemetworking Handbook, McGraw-Hill, New
`York, 1995.
`
`
`
`IPR2016-00726-ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR, Ex. 1014 , p. 20 of 28
`
`

`
`chapter fifty-four
`
`Network routing tools
`and techniques
`
`David C. Yen and William S. Davis
`
`Contents
`
`. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 431
`54.1 Purpose
`54.2 Strengths, weaknesses, and limitations . . . . . . . . . . . . . . . . . . . . . 432
`54.3 Inputs and related ideas ..... .. . . . . . . ... .. . . . . . . .. . ... . . . .432
`54.4 Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 432
`5 4.4.1 Centralized routing
`. . . . . . ....... . .... . . . . . . . . . . . . 432
`5 4.4.2 Distributed routing
`. . . . . ... . . . . . . .. ... . . . .. .. . ... 4 3 3
`5 4.4.2.1 Static routing . . . . . . . . . . ....... . . . . ...... 4 3 3
`5 4.4.2.2 Adaptive routing ... . . . . . . . ..... . .. . .. .. . 4 3 3
`5 4. 4.2.3 Broadcast routing ..... .. ......... ..... . . 4 3 4
`5 4.5 Key terms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 435
`. . . ..... . . . . ....... . ..... . . . . .......... . .... . . 4 3 6
`5 4.6 Software
`5 4.7 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 3 6
`
`54.1 Purpose
`This chapter focuses on several common network routing techniques (gen­
`erally, l