General Disclaimer

One or more of the Following Statements may affect this Document

This document has been reproduced from the best copy furnished by the 

organizational source. It is being released in the interest of making available as 

much information as possible.

This document may contain data, which exceeds the sheet parameters. It was 

furnished in this condition by the organizational source and is the best copy 

available.

This document may contain tone-on-tone or color graphs, charts and/or pictures, 

which have been reproduced in black and white.

This document is paginated as submitted by the original source.

Portions of this document are not fully legible due to the historical nature of some 

of the material. However, it is the best reproduction available from the original 

submission.

Produced by the NASA Center for Aerospace Information (CASI)
t^

1.^

r

NAM CR 168238

(NASA - Cfl-1F8238 %

CCMCC5ICA 1 1CN! NEIWCEK a84-14378

CESIGI: AND COSTING MCCEI USEFS AANUZL Fin31

Feport ( Sonalpsts, Inc._) 15E t'

HC A08/MP A01 CSCL 17E

G3/32

Communications Network

Design and Costlag Model

User's Manual

Lnclas

1 1 104

^a1.

i.

1

rprepared by

SONAL'YSTS, INC.

215 Parkway North

Post Office Box 280

Waterford, Connecticut 06385

NASA Lewis Research Center

Contract NA63-29348

JAN 1'84

RECEIVED

NASA In FAOIt TY

AWEd DIFT,

prepared for

NATIONAL AERONAUnCS AND SPADE ADMINISTRATION
V

NASA CR 168238

l

i

Communications Network

Design and Costing Model

User's Manual

prepared b_y

SONALYSTS, INC.

215 Parkway North

Post Office Box 280

Waterford. Comiectieut 06385

prepared for

NATIONAL AERONAUTICS AND SPACE ADMINISTRATION

NASA Uvis Research Center

Contract NAS3-23348
♦ r

ORIGINAL PAGE iS

OF POOR QUALIT,

I

Ir

F

i

it

E'

b

1. Newt No 2. Government Attention No, 3. Recipient's Catalog No.

CR 168238

e. Title and Subtitle 5, Report Dote

Communications Network Design and Costing Model

30 Sptdmber 1983

Users Manual 5, Performing Organization Code

7. Authorial 8. Perfurming Orgenuatipn Relent No

K. P. Logan, S. S. Somes, and C. A. Clark

_ 10. Work Unit No.

8 Perforrmng Organization Nam and Addraes

Sonalysts Inc.

21 r, Parkway North 1i. Contract or Grant No

P.O. Box 280

Waterford, CT 06385 NAS3-23348

13, Type of Report and Period Covered

Contractor Re port P

12. Sponsoring Agency Nam and Address

National Aeronautics and Space Administration

Lewis Research Center 14, Sponwring Agency Code

Cleveland, OH 44135

15, Supplementary Notes

Project Manager, James E. Hollansworth

Space Communications Division

16. Abstract

A Communications Network Design and Costing (CNDC) computer model provides the capability

for analyzing long-haul communications networks. The model is well-suited for market assessment

studies Involving the integration of developing satellite communication systems into the environment of existing service offerings of licensed domestic and specialized interstate communications common carriers. A capability 1s provided for analyzing long-haul trunking networks

c(xnprising a set of user-defined cities, traffic conditions, and tariff rates. Networks may

consist of all terrestrial connectivity, all satellite connectivity, or a combination of terrestrial and satellite connectivity. Network solutions provide the least-cost routes between all

cities, the least-cost network routing configuration, and terrestrial and satellite service cost

totals. The CNDC model allows analyses involvingthree specific FCC-approved tariffs, which are

uniquely structured and representative of most existing service connectivity and pricing philosophies. User-defined tariffs that can be variations of these three tariffs are accepted as

input to the model and allow considerable flexibi',ity `n network problem specification.

The resulting model extends the domain of network analysis from traditional fixed link cost

(distance-sensitive) problems to more complex problems involving combinations of distance- and

traffic-sensitive tariffs. A heuristic algorithm 1s developed to determine minimum cost network

routing solutions specifying the location of satellite access cities and their hubbing terrestrial extensions for typical customer premise services.

This manual presents a detailed description of the CNDC computer model from the user's

point of view.

17. Key Words (Suggested by Authx(s)) 18. Distribution Statement

Optimization, Least-Cost, Communications,

Costing, Net•>ork, Tariff, Terrestrial, Unclassified

Satellite., Distance-Sensitive, TrafficSensitive

18. Security Claesif.(of . this report) 20. Security Claesif. (of this page) 2t. No. of Pages 22. Price'

Unclassified TUncl.assified

P, "

r

C

e^

s '

r

i- I

' For sale by the National Technical Information Service, Springfield, Virginia 22161

'-` NASA-C-168 (Rev. 10.75)

t
0

COMMUNICATIONS NETWORK

``1

DESIGN AND COSTING MODEL

USER'S MANUAL

is

JULY 1983

r

J1

1

't ^- Y 

I
i

REVISIONS

This User's Manual describes the concepts and ope, , ating procedures of

the Communications Network Design and Costing (CNDC) Model developed for NASA

Lewis Research Center. All revisions to the original User's Manual produced

in July 1983 are shown below by page and date of revision.

Page Revision Page Revision Page Revision

1

I^
Y 

PREFACE

MANUAL OBJECTIVES

The primary objective of this manual is to present the information and

procedures needed to exercise the Communications Network Design and Costing

(CNDC) Model for performing network analyses. Specific procedures are provided for executing the model on the NASA Lewis Research Center (LeRC) IBM

3033 computer. While some familiarity of the operating procedures will be

helpful in understanding the model's operating environment, minimal knowledge

of the LeRC computer is necessary. Descriptions are given of the concepts,

functions, and data bases relating to the model. In addition, this manual

also provides detailed descriptions of model parameters and their format

specifications for running the model.

INTENDED AUDIENCE

This manual is intended as a tutorial for novice users of the CNDC M

Model, as well as a reference document for experienced network analysts.

This manual, as well as the model itself, was designed for ease of use. The

chapters are organized to correspond to the varioas user sessions of the

model, providing a step by step guide through model execution.

i

STRUCTURE OF THE DOCUMENT

i

The manual is organized into four major parts: 

Part I - Introduction to the CNDC Model,

Part II - Running the CNDC Model in INTERACTIVE Mode,
T

Part III - Running the CNDC Model in BATCH Mode, and

Part IV - Interpretation of CNDC Mode Outputs.

Part I presents an introduction to the CNDC Model. Chapter I provides

an overview of the model concepts and summarizes the capabilities and uses of

the model.

Chapter 2 discusses the relational nature of the various data structures

i

within the data base. The information is presented in enough detail to allow

the user to understand the interaction between the data base and the CNDC

Model. Chapter 2 discusses the Traffic and Tariff data bases and also

describes the construction and use of Execution Control Files. These user

constructed files define the network problems to be analyzed by the model.

Part II presents detailed instructions for running the CNDC Model in

INTERACTIVE mode. Chapter 3 provides a brief overview of the general program

options and model operating procedures. Chapters 4, 5, and 6 give specific

instructions to the user for creating network, tariff, and execution control

files, respectively. Chapter 7 summarizes the procedures for running the

model and obtaining output reports.

Part III presents detailed instructions for executing the CNDC Model in

BATCH mode. Chapter 8 presents the general BATCH operating procedures within

the LeRC IBM 3033 operating environment. It also discusses the various BATCH

a

mode job control parameters and how they are used. This chapter provides a

tutorial for creating and organizing BATCH input files and card decks and

I also summarizes the procedures for submitting BATCH runs.

Part IV discusses each of the model's output reports. A detailed discussion of each of the various reports is provided to allow the user to

clearly interpret their meaning. Examples of output reports are presented

along with annotated descriptions of the information they provide.

^, Any changes to the tariffs will be set forth in the Addendum.
L

ASSOCIATED OOCUMFNTS

This manual is one volume of a three volume set of documentation on the

CNDC Model. Supporting documents include the following:

Final Technical Report - Communications Network Design and Costing

Model, and

Programmer's Manual - Communications Network Design and Costing Model.

The Final Technical Report contains a detailed description of the network

optimization algorithms, as well as a summary of the work efforts throughout

the project. The Programmer's Manual contains a programmer level description

of the CNDC Model and its supporting data bases.

1

f

iv
I

TABLE OF CONTENTS

Page

REVISIONS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i

PREFACE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

TABLE OF CONTENTS . . . . . . . . . . . . . . . . . . . . . . . . . . . v

LIST OF FIGURES . . . . . . . . . . . . . . . . . . . . . . . . . . . . viii

i

i; LIST OF TABLES . . . . . . . . . . . . . . . . . . . . . . . . . . . x

CHAPTER 1 - OVERVIEW OF THE CNDC MODEL . . . . . . . . . . . . . . . . 1-1

r

I ' 1.1 INTRODUCTION . . . . . . . . . . . . . . . . . . . . . . . 1-1

C ! 1.2 OVERVIEW OF MODEL PROGRAM STRUCTURE . . . . . . . . . . . . 1-2

E[} 1.3 OVERVIEW OF OPERATING PROCEDURES . 1-4

} 1.4 SUMMARY OF CNDC MODEL OUTPUTS . . . . . . . . . . . . . . . 1-6

g CHAPTER 2 - OVERVIEW OF THE CNDC MODEL DATA BASE . . . . . . . . . .

E

1.

2.1 ORGANIZATIONAL STRUCTURE OF CNDC MODEL . . . . . . . . .

f ,(. 2.2 CNOC PRESTORED DATA BASE . . . . . . . . . . . . . . . .

R

f 2.3 CNDC USER-DEFINED DATA BASE . . . . . . . . . . . . . . .

CHAPTER 3 - GENERAL OPERATING MODES AND PROCEDURES . . . . . . . . . . 3-1

I3.1 LOGON PROCEDURE FOR INTERACTIVE OPERATION . . . . . . . . . 3-1

t 3.2 LOGON PROCEDURE FOR BATCH OPERATION . . . . . . . . . . . . 3-2

- CHAPTER 4 - CREATING AND MANAGING NETWORK FILES . . . . . . . . . . . . 4-1

4.1 OVERVIEW . . . . . . . . . . . . . . . . . . . . . . . 4-1

i

4.2 CREATING A NETWORK FILE . . . . . . . . . . . . . . . . . . 4-3

4.2.1 Network File Name. . . . . . . . . . . . . 4-3

4.2.2 Verification of IndividualEntries . . . . . . . . . . . . 4-5 -

4.2.3 Selection of Prestored SMSA Cities . . . . . . . . . . . . 4-5

4.2.3.1 Selecting ALL Prestored Cities . . . . . . 4-6

4.2.3.2 Selecting ALL EXCEPT a Subset of Prestored Cities . . . . . 4-6

f

4.2.3.3 Selecting ONLY a Subset of Prestored Cities . . . . . . . . 4-7

L

v

2-1

2-1

2-3

2-5
12

TABLE OF CONTENTS (Continued)

Page

4.2.3.4 Selecting Prestored Cities Representing a Given

PERCENT of Network Traffic . . . . . 4-7

4.2.4 Traffic Volume fo , Prestored SMSA Cities . . . . 4-9

4.2.5 Entering Additio-ii l Cities . . . . . . . . . . . . . . 4-10

4.2.6 Review of Intercity Traffic Volumes . . . . . . . . . . . . 4-11

4.2.7 Entering Additional Traffic Volumes . . . . . . . . . . . . 4-12

4.2.8 Traffic Table Listing . . . . . . . . . . . . . . . . . . . 4-13

4.3 DELETING A NETWORK FILE . . . . . . . . . . . . . . . . . . 4-14

4.4 LISTING A NETWORK FILE OR THE NETWORK DIRECTORY . . . . . . 4-14

4.4.1 Network File Listing . . . . . . . . . . . . . . . . . . . 4-15

i

4.4.2 Network Directory Listing . . . . . . . . . . . . . . . . . 4-17

r

4.5 EXITING THE NETWORK CONSTRUCTION SESSION . . . . . . . . . 4-18

CHAPTER 5 - CREATING AND MANAGING TARIFF FILES . . . . . . . . . . . . 5-1

'J 5.1 OVERVIEW • .. • • • • • • . • • • • • • • • • • . 5-1

= r 5.2 CREATING A TARIFF FILE . . . . . . . . . . . . . . . . . . 5-3

5.2.1 Tariff File Name . . . . . . . . . . . . . . . . . . . . . 5-3

5.2.2 Tariff Type . . . . . . . . . . . . . . . . . . . 5-5

5.2.3 Creating an ATT-Type Tariff rile . . . . . . . . . . . . . 5-5

5.2.4 Creating a WU-Type Tariff File . . . . . . . . . . . . . . 5-10

g, 5.2.5 Creating an SBS-Type Tariff File . . . . . . . . . . . . . 5-13

5.3 DELETING A TARIFF FILE . . . . . . . . . . . . . . . . . . 5-18

5.4 LISTING A TARIFF FILE OR THE TARIFF DIRECTORY . . . . . . . 5-18

5.4.1 ATT-Type Tariff File Listing . . . . . . . . . . . . . 5-19

, 5.4.2 WU-Type Tariff File Listing . . . . . . . . . . . . . . . . 5-21 E

5.4.3 SBS-Type Tariff File Listing . . . . . . . . . . . . . . . 5-22

5.4.4 Tariff Directory Listing . . . . . . . . . . . . . . . . . 5-24

5.5 EXITING THE TARIFF CONSTRUCTION SESSION . . . . . . . . . . 5-25

[ CHAPTER 6 - CREATING EXECUTION CONTROL FILES . . . . . . . . . . . . . 6-1

' 6.1 OVERVIEW . . . . . . . . . . . . . . . . . . . . . . . . . 6-1

6.2 CREATING AN EXECUTION CONTROL FILE . . . . . . . . . . . . 6-3

6.2.1 Run Identification . . . . . . . . . . . . . . . . . . . 6-5

} 6.2.2 Number of Problems to Run . . . . . . . . . . . 6-5 

6.2.3 Network Mode

.

. . . . . : : 6-6 

6.2.4 Identifying the Network File to Use . . . . . . . . . . . . 64

nvi

}

I

i 

1h
+r

TABLE OF CONTENTS (Continued)

Page

1

6.2.5 Identifying the Tariff Files to Use . . . . . . . . . . . . 6-8

6.2.6 Selecting Output Tables to be Printed . . . . . . . . . . . 6-11

6.3 LISTING THE EXECUTION FILE . . . . . . . . . . . . . . . . 6 -12

6.4 EXITING THE EXECUTION CONTROL SESSION . . . . . . . . . . . 6 -12

CHAPTER 7 - RUNNING THE MODEL AND PRINTING OUTPUT FILES . . . . . . . . 7-1

CHAPTER 8 - RUNNING THE CNDC MODEL IN BATCH MODE . . . . . . . . . . . 8-1

8.1 OVERVIEW . . . . . . . . . . . . . . . . . . . . . . . . . 8-1

8.2 BATCH MODE JOB CONTROL PARAMETERS . . . . . . . . . . . . . 8-2

8.3 CREATING AND ORGANIZING BATCH INPUT FILES . . . . . . . . . 8 -4

8.4 SUBMITTING 8P.rCH RUNS FOR EXECUTION . . . . . . . . . . . . 8-13

CHAPTER 9 - INTERPRETATION OF CNDC MODEL OUTPUTS . . . . . . . . . . . 9-1

9.1 OVERVIEW . . . . . . . . . . . . . . . . . . . . . . . . . 9-1

9.2 INPUT AS OUTPUT . . . . . . . . . . . . . . . . . . . . . . 9-1

9,3 LEAST-COST ROUTE SOLUTIONS . . . . . . . . . . . . . . . . 9-6

9.4 LEAST-COST NETWORK SOLUTIONS . . . . . . . . . . . . . . . 9-10

9.5 NETWORK TOTALS . . . . . . . . . . . . . . . . . . . . . . 9-13

9.6 TARIFF SUMMARY . . . . . . . . . . . . . . . . . . . . . . 9-16

9.7 TRAFFIC TABLE . . . . . . . . . . . . . . . . . . . . . . . 9-19

1 APPENDIX A - PRESTORED SMSA CITIES OF THE CNDC MODEL . . . . . . . . . A-1

APPENDIX B - PRESTORED TARIFFS OF THE CNDC MODEL . . . . . . . . . . . B-1

i'

APPENDIX C - ERROR MESSAGES . . . . . . . . . . . . . . . . . . . . . C-1

ADDENDUM

i

vii

I

1
LIST OF ILLUSTRATIONS

Figure Page

1-1 Overall Program Flow of CNDC Model . . . . . . . . . . . . 1-3

2-1 Major Components of the Communications Network Design

and Costing Model . . . . . . . . . . . . . . . . . . . . . 2-2

4-1 Logical Relationship Between the INPUT and Network

Construction Sessions . . . . . . . . . . . . . . . . . . . 4-1

4-2 Sequence of Inputs for Network File Creation . . . . . . . 4-4

5-1 Logical Relationship Between the Tariff Construction

and INPUT Sessions . . . . . . . . . . . . . . . . . . . . 5-1

5-2 Sequence of Inputs for Tariff File Creation . . . . . . . . 5-4

6-1 Logical Relationship Between the Execution Control

and INPUT Sessions . . . . . . . . . . . . . . . . . . . . 6-2

6-2 Sequence of Inputs for Execution Control File

Creation . . . . . . . . . . . . . . . . . . . . . . . . . 6-4

8-1 Organization of BATCH Input Data Set . . . . . . . . . . . 8-2

B-2 BATCH Mode Network File Definition with

Option 1 - ALL . . . . . . . . . . . . . . . . . . . . . . 8-5

8-3 BATCH Mode Network File Definition with

Option 2 - ALL EXCEPT or Option 3 - ONLY . . . . . . . . . 8-6

8-4 BATCH Mode Network File Definition with

Option 4 - PERCENT . . . . . . . . . . . . . . . . . . . . 8-7

8-5 BATCH Mode ATT-Type Tariff File Definition . . . . . . . . 8-8

8-6 BATCH Mode WU-Type Tariff File Definition . . . . . . . . . 8-9

B-7 BATCH Mode SBS-Type Tariff File Definition . . . . . . . . 8-10

8-8 BATCH Mode Execution Control File Definition with

Network Mode 1, 2, or 3 . . . . . . . . . . . . . . . . . . 8-11

8-9 BATCH Mode Execution Control File Definition with

Network Mode 4 or 5 . . . . . . . . . . . . . . . . . 8-12

9-1 Sample TABLE 1 Output Report - Input as Output . . . . . . 9-3

9-2 Sample TABLE 2 Output Report - Least Cost Routes . . . . . 9-9

$, viii

O
LIST OF ILLUSTRATIONS ( Continued)

F gure Page

9-3 Sample TABLE 3 Output Report - Least Cost Network . . . . . 12

9-4 Sample TABLE 4 Output Report - Network Totals . . . . . . . 9-15

9-5 Sample TABLE 5 Output Report - Tariff Summary . . . . . . . 9-18

9-6 Sample TABLE 6 Output Report - Traffic Table . . . . . . . 9-20

I

r

1

1

1

Lix
LIST OF TABLES

I able Page

1-1 Summary of CNDC Model Outputs . . . . . . . . . . . . . . . 1-7

8-1 Data Item Description for Network File Definition . . . . . 8-15

8-2 Data Item Description for Tariff File Definition . . . . . 8.16

8-3 Data Item Description for Execution Control File

Definition . . . . . . . . . . . . . . . . . . . . . . . . 8-17

x
CHAPTER 1 - OVERVIEW OF THE CIJDC MODEL

This chapter provides a brief summary of the model's capabilities, the

f

kinds of problems analyzed, and the types of input required and output

reports produced. This chapter should be read first in order to achieve an

overall understanding of the model.

L.

1.1 INTRODUCTION

The CNDC Model is a tool for analyzing the market capture potential of

postulated tariffs for a given network of cities. The model provides the

capability to perform detailed investigations of voice traffic distribution

changes on a service by service basis (terrestrial and satellite) given

postulated tariffs. Network routing alternatives and costs are assessed by

the model to determine optimal routing solutions.

The model allows the user to define the network analysis problem by

specifying a network of cities and a set of applicable tariffs. In general,

there are three problem types which can be analyzed using the model. These

are:

All terrestrial networks,

All satellite networks, and

Mixed terrestrial/satellite networks.

Ipe is defined by the types of tariffs specified as input

For all terrestrial problems, some combination of a preuser-defined (AT&T type) tariffs are specified. All

are either WU type or SRS type. In either case, some

prestored tariff and/or user-defined tariffs of a corresponding type are specified. Mixed terrestrial/satellite problems involve a

single terrestrial tariff of any type and a single satellite tariff of any

type.

1-1

The problem t,

for each analysis.

stored AT&T and/or

satellite problems

combination of the
The model uses the network and tariff files specified by the user to

calculate: 1) the set of least-cost routes between all network cities

(exclusive of other network traffic) and 2) a least-cost network solution

(incltr-ive of the total network traffic). Each solution results in the

identification of a set of optimal links between network cities.

1.2 OVERVIEW OF MODEL PROGRAM STRUCTURE

The CNDC Model consists of the following five primary program modules:

INPUT module,

INIT module,

COSTING module,

OPTIMIZATION module, and

OUTPUT module.

The logical relationship between the primary program modules is illustrated

in figure 1-1.

N

The following paragraphs provide a brief description of each of the

major program modules.

f INPUT Module - All user input necessary for the execution of the CNDC

Model is controlled through this module. Specifically, the user is provided the capability to construct one or more network files for analysis, select the desired common carrier tariffs to be used or create his

j own, and set input parameters controlling program execution. The user

is provided with a convenient data base management capability with which

to manipulate problem data sets.

INIT Module - All the necessary initialization functions required for

program execution are performed by this module. Program variables, data

arrays, and key data elements are set to their initial values. Input

1-2

r 
Figure 1-1. Overall Program Flow of CNDC Model

1-3

e,I

L
i

data are sorted and placed in the appropriate order for use by other

program modules. Data fixes and internal storage arrays are also

created.

COSTING Module - This module uses the network and tariff data specified

as input to calculate link costs between all nodes of a specified network. Link costs are calculated for both terrestrial and satellite

services and are dependent on the tariffs being used. The resulting

link costs calculated by this module are used by other program modules.

OPTIMIZATION Module - The computer algorithms which solve the least-cost

routing and least-cost network problems are contained in this module.

The optimal selection of routing alternatives is based on the network

file, traffic conditions, and the combination of tariffs specified

during the INPUT session. The resulting network solutions are stored

- internally in the computer for use by other program modules which produce the output summary reports.

OUTPUT Module - The generation of all output reports resulting from an

execution of the model are controlled by this module. Reports and

tabular data files are the principle outputs. The user is provided with

the capability of selecting the desired output reports during the INPUT

session.

r , The user's only interface with the model is through the INPUT session

f controlled b y the INPUT module. All other CNDC Model functions are transparent to the user. The majority of this manual provides information

f relating to the user's interface with the INPUT module.

1.3 OVERVIEW OF OPERATING PROCEDURES

The CNDC Model was designed for ease of use and maximum user flexibility. The user controls the execution of the model via one of two possible

1; modes: INTERACTIVE or BATCH. In the INTERACTIVE mode, the user supplies

E^

f` 1-4

l`
al ^'

r

l

1-5

model inputs and performs data base operations interactively on a CRT terminal. In the BATCH mode, model input and control parameters are supplied from

a card deck or disk file created off-line from the program. In either the

INTERACTIVE or BATCH mode, the user has complete control of problem specification and setup. Network and tariff files can be created in either of the

two modes.

The CNDC Model provides the user with the capability of specifying the

types of networks to be analyzed. The user is able to build and maintain a

library of network files, specifying the cities included in.each network, as

well as the voice traffic between them. The user has the option of entering

a specific list of cities for each network definition or selecting cities

from a prestored list of 350 Statistical Metropolitan Sampling Area (SMSA)

cities. The user can maintain a library of up to 20 different network files.

The model provides the user with the same flexibility in specifying the

types of tariffs to be used in network analysis problems. An option is provided to allow tha user to select prestored and/or user-defined tariffs to be

included in network problems. The prestored tariffs included in the model

are:

AT&T Tariff F.C.C. No. 260 - Private Line Service,

AT&T Tariff F.C.C. No. 264 - List of Rate Centers,

Western Union Tariff F.C.C. No. 261 - Satellite Transmission

Service, and

Satellite Business Systems Tariff F.C.C. No. 2 - Communications

Network Service.

The user may define his own tariffs and use them to analyze market

K`

capture given postulated rates. User-defined tariffs must follow the same

connectivity philosophy as one of the prestored tariffs. The model provides

the user with the capability to build and maintain a library of the tariff

files which contain the specifications for each user-defined tariff. Up to

twelve different user-defined tariff files can be maintained in the tariff
library. The user may specify one or more of these files for inclusion in

network problems, in addition to any of the three prestored tariffs.

The model allows the user to run several network analysis problems

within a single execution. The user simply selects the network and tariff

files for each problem from the libraries stored on disk. By specifying the

names of the files in response to program prompts, the user defines each network analysis prnhlem. During the INPUT session, the program also prompts

for other types of user inputs. A detailed discussion of the INPUT session

begins in chapter 3.

1.4 SUMMARY OF CNDC MODEL OUTPUTS

i The CNDC Model generates six different output reports for each network

r.

ii.

analysis problem. Table 1-1 provides a summary of these reports and the

I information contained in each. The user is provided with the option of

E

Y selecting the reports to be generated by the program during each problem run.

^

f Chapter 9 discusses in detail the information contained in the output

reports.

^' 

r:

i

r

I^

r 

iI

E!

1-6 
SUMMARY LIST FOR EACH TARIFF INCLUDED IN NETWORK SOLUTION

TOTAL CIRCUIT MILEAGE

TOTAL TRAFFIC

PERCENT OF NETWORK TRAFFIC USING TARIFF SERVICE

TOTAL NETWORK COST ASSOCIATED WITH TARIFF

PERCENT OF NETWORK COST ASSOCIATED WITH TARIFF SERVICE

(TERRESTRIAL/SATELLITE)

OUTPUT REPORT 6 - TRAFFIC TABLE

TRAFFIC VOLUME (VOICE CIRCUITS) BETWEEN ALL NETWORK CITY PAIRS

TABLE 1-1 - SUMMARY OF CNDC MODEL OUTPUTS

OUTPUT REPORT 1 - INPUT AS OUTPUT

LIST OF NETWORK CITIES

TOTAL TRAFFIC LEVEL FOR NETWORK (VOICE CIRCUITS)

LISTING OF EACH TARIFF USED

OUTPUT REPORT 2 - LEAST-COST ROUTE SOLUTION

LISTING OF LEAST-COST ROUTE LINKS

LINK SUMMARIES

TOTAL AIRLINE MILEAGE

TRAFFIC VOLUME ON LINK (VOICE CIRCUITS)

VOICE CIRCUIT FACILITY GROUPINGS (JUMBO, MASTER,, SUPER, BASE)

COST PER CIRCUIT OVER LINK

TOTAL COST OF CIRCUITS OVER LINK

TARIFF USED

TYPE OF SERVICE USED (TERRESTRIA.L OR SATELLITE)

i

OUTPUT REPORT 3 - LEAST-COST NETWORK SOLUTION

I ,

LISTING OF LEAST-COST ROUTES

LINK SUMMARIES (SAME AS REPORT 2)

OUTPUT REPORT 4 - NETWORK SUMMARY

TOTAL TERRESTRIAL CIRCUIT MILEAGE

TOTAL SATELLITE CIRCUIT MILEAGE

TOTAL TERRESTRIAL TRAFFIC

TOTAL SATELLITE TRAFFIC

TOTAL NETWORK TRAFFIC

TOTAL TERRESTRIAL COSTS

TOTAL SATELLITE COSTS

TOTAL NETWORK COSTS

OUTPUT REPORT 5 - TARIFF SUMMARY
CHAPTER 2 - OVERVIEW OF THE CNDC MODEL DATA RASE

This chapter provides a summary of the data base which supports the CNDC

Model. The objective of this chapter is to present the user with the types

of information used by the model and to identify those specific data elements

which the user must supply as input.

2.1 ORGANIZATIONAL STRUCTURE OF CNDC MODEL

The CNDC Model is comprised of programs and a supporting data base. The

types of programs included in the model are categorized as either data base

management programs or network analysis programs. The data base management

programs provide the capability to create and maintain the data base which

supports the CNDC model. The network analysis programs perform the costing

and optimization functions of the model. Figure 2-1 depicts the relationship

between the different types of programs and the CNDC data base.

The CNDC data base is comprised of two types of information: 1) prestored data and 2) user-defined data. The prestored data consists of the

following:

Master list of SMSA cities,

Traffic between all SMSA city pairs,

Tariff information on the actual communication carriers (ATT, WU,

and SRS), and

Library directories of user-defined networks and tariffs.

The information in the prestored portion of the CNDC data base cannot be

directly modified by the user. The user-defined portion of the data base

contains the information that the user will be changing to create different

network problems. The user-defined data consists of the following:

i

2-1
1

r ^.

q

^

fd

t

t

E

1

I

t

y

y•

r.

CNDC

OPTIMIZATION

AND COSTING

MODEL

CNDC

DATA BASE

MANAGEMENT

SYSTEM

i

Figure2-1. Major Components ofthe Communications Network Design and

Costing Model

2-2

a
User-defined networks,

User-defined tariffs, and

User-defined execution control file.

The information contained in both the prestored and user-defined portions of the CNDC data base are described in more detail in the following

sections.

2.2 CHDC PRESTORED DATA BASE

The prestored data base contains a master list of SMSA cities and the

traffic between them, rate and other information related to the actual ATT,

1•!U, and SBS tariffs, and the directories for the user-defined tariff and

network files. The computer files which contain the prestored data cannot be

altered by the user.

The prestored master list of SMSA cities contains 350 city names and

their associated alphabetic code names. When creating user-defined networks,

the user may include any or all of these 350 cities in his network by specifying their code names as part of the input. The directional traffic

between all pairs of cities in the master list is included in the prestored

data base as a traffic table. The traffic table defines the traffic between

any two node pairs as a percentage of the total traffic volume between all

350 SMSA cities. The user inputs the total traffic volume when defining a

network and the percentages are converted to numbers of voice circuits by the

program.

The type of Drestored tariff data varies for each tariff. The prestored

ATT tariff contains a list of the Private Line Service Category A rate centers and the rates for Series 2000/3000 channels between any two cities.

Three different rate schedules are included in the prestored ATT tariff. The

different schedules apply under the following conditions:

2-3

V 
Schedule 1 - Both cities of a specified pair are category A rate

centers,

Schedule 2 - Only one city of a specified pair is a category A rate

center, and

Schedule 3 - Neither city of a specified pair is a category A rate

center.

Each of the three ATT tariff schedules is defined by a table of rates which

are a function of mileage between cities.

The prestored Western Union tariff contains a list of satellite access

city pairs along with an indication of the channel category (long haul,

medium haul, or short haul). The prestored tariff also contains the rate

charges associated with each channel category.

r

The prestored Satellite Business Systems tariff contains the monthly

rates for equipment applicable to the Series A Communications Network Service. Specifically, the prestored tariff contains monthly rates for Network

Access Centers (NACs), Supplemental Capacity Units (SCUs), Full-Time Transmission Units (FTUs), and analog Channel Access Units (CAUs).

The CNDC Model maintains directories of user-defined tariff and network

files. Tive model allows 12 tariff files and 20 network files to be defined

by the user. The files are given standard name;; which cannot be changed by

the user. The tariff and network directories contain status information on

each file which indicates if the file is available for storage of a userdefined entry. Both the tariff and network directories are part of the

prestored data base and cannot be directly altered by the user.

2-4
E

2.3 CNDC USER-DEFINED DATA BASE

The user-defined portion of the CNDC data base consists of the

following:

User-defined network files,

User-defined tariff files, and

User-defined execution control files.

The CNDC Model allows the user to define a network configuration for

each problem run and to store this information in a network file. In defining a network, the user may specify which of the prestored SMSA cities are to

be included in the network configuration. The user may also include cities

not contained in the prestored SMSA list in his network. The traffic volume

between all cities included in the network is specified as input by the user.

During an INPUT session, the user enters all information which defines a

network and saves it in an available network file. The file can then be

specified as an input to a problem data set when the user creates execution

control records. The user can store up to twenty separate network files at

any one time.

The model provides the user with the capability to define postulated

tariffs having the same connectivity philosophy as any of the three prestored

tariffs. The user can store up to twelve separate tariff files at any one

time.

In creating an ATT-type tariff, the user may redefine which cities are

to be considered category A cities. The user can add new cities to the Category A list of the actual ATT tariff or delete any cities from this same

list. The user can also specify his own set rates for each of the three

ATT tariff rate schedules.

L2-5

^ 
2-6

In creating a WU-type tariff, the user may modify the actual WU tariff

by adding satellite access city pairs or by deleting city pairs from the

standard list in the WU tariff. The user can also define his own channel

charges for short, medium, and long haul satellite charnels.

In creating an SBS-type tariff, the user may specify his own monthly

rates for any of the CNS-A equipment, including NACs, SCUs, FTUs, and CAUs.

In order to execute the CNDC Model, an execution control record must be

I'

specified for each network problem. The execution control record contains

information the computer needs to read the appropriate data inputs, model the

specified network, and produce the desired output reports. In creating an

execution control record, the user must specify the following information:

s

e Problem identification number,

Problem type (terrestrial, satellite, or mixed terrestrial/

satellite),

File name containing the user-defined network,

File names containing the prestored or user-defined tariffs to be

used, and

Output reports desired.

The user can create several execution control records during on INPUT session

to cause multiple network problems to be consecutively executed.

A detailed discussion of all user inputs is given in Part II - Running

the CNDC Model (INTERACTIVE mode). The reader should pay close attention to

the information and examples p resented in this part of the manual.
CHAPTER 3 - GENERAL OPERATING MODES AND PROCEDURES

The CNDC Model can be executed in either of two modes: INTERACTIVE or

BATCH. In the INTERACTIVE mode, the user supplies model inputs and performs

data base operations interactively on a CRT terminal. In running the model

in BATCH nude, input and control parameters are supplied from a card deck or

disk file created off-line from the program. In either the INTERACTIVE or

BATCH mode, the user has complete control of input file creation, problem

specification, and output report generation. Chapters 4 through 7 provide

the detailed procedures for the INTERACTIVE sessions. Chapter 8 provides the

details for BATCH mode operation.

3.1 LOGON PROCEDURE FOR INTERACTIVE OPERATION

During the LOGON procedure, the user causes the computer to acknowledge

his presence at a CRT terminal, to load in the CNDC programs and data files,

and to begin executing the model. All user inputs on the CRT should be followed by pressing the carriage return key. The system cursor symbol should

appear in the left most column of the screen, indicative that the system is

ready to accept user commands. The cursor symbol is a single underline character. The user should type the following command to LOGON the system:

LOGON USERID, PASSWORD, PACK = A

The USERID and PASSWORD are access codes given to the user by the computer

system manager. Shortly after the user enters the LOGON command followed by

a carriage return, the system should respond by again displaying the cursor

symbol. The user should now enter the command

UNLOADA

The system will again respond by displaying the cursor symbol. At this

point, the user should enter the following command to execute the CNDC Model:

CNDC

3-1 1^ 
I

The system will then begin loading and executing the model. This process

y will take a few minutes and several system messages will appear on the

screen. When the following message appears, the model has been successfully

loaded and is waiting for further user actions:

f

I

NASA COMMUNICATIONS NETWORK DESIGN AND COSTING MODEL

PREPARED BY

SONALYSTS, INC.

215 PARKWAY NORTH

WATERFORD, CT 06385

M

INPUT MENU

1 - NETWORK CONSTRUCTION

2 - TARIFF CONSTRUCTION

3 - EXECUTION CONTROL

4 - EXIT

SELECT OPTION (1-4)

At this point, the procedures discussed in chapters 4 through 7 should be

followed.

3.2 LOGON PROCEDURE FOR BATCH OPERATION

BATCH execution of the CNDC Model is controlled by an input data set

that can be a disk data set or a deck of punched cards. In either form, the

input data set contains all the commands necessary to run a task. The BATCH

command format is very similar to that of the INTERACTIVE mode. The first

card or record of the data set must contain a LOGON command of the following

l format:

F

LOGON USERID,TIME=60,PACK=A

^- 3-2
3-3

The second card of the data set should be

UNLOADA

The third card of the data set must contain the command to load and execute

the BATCH version of the CNDC Model. This command is as follows:

BATRUN

Chapter 8 discusses the other types of input cards which follow the initial

two cards. The final card of the data set should be

LOGOFF

1- The TIME= parameter of the LOGON card requires more explanation. The number

entered, expressed in seconds, specifies the number of seconds of execution

time to be allowed before the timer terminates the task. If the fob requires

more than 3600 seconds, an additional command, the TIME ccmmand, must be

included in the batch run stream along with the TIME = parameter of the LOGON

command. The TIME command specifies the number of minutes of execution time

before the timer interrupts the task. The maximum time allowed is 450 min-

" utes (7 1/2 hours). The following pair of commands

LOGON USERID,PACK =A,TIME=27000

^- TIME 450 k

is requesting the maximum time of 7 1/2 hours. Again, if the time value

requested is less than 3600 seconds, the TIME command (second command) can be

omitted.
TARIFF I 1 EXECUTION

CONSTRUCTION I CONTROL EXIT

Figure 4-1. Logical Relationship Between the INPUT and Network

Construction Sessions

T

I

t

4.1 OVERVIEW

ORIGINAL PA02 rg

OF POOR QUALITY

CHAPTER 4 - CREATING AND MANAGING NETWORK FILES

The network construction session allows the user to maintain a set of

network files for input to the CNDC Model. Entry into a network Construction

session is accomplished by selecting option 1 - NETWORK CONSTRUCTION from the

INPUT menu. Exiting fram the session returns the user to the INPUT menu.

The relationship between the input and network construction sessions is shown

in figure 4-1.

INPUT

SESSION

i.

's

1

NFIN

CCNSTI

r

f

, F

L

F

i

r

L

NETWORK

CONSTRUCTION

CREATE I I DELETE I I LISTNETWORK

NETWORK NETWORK FILE OR EXIT

FILE. FILE DIRECTORY
During a network construction session, the user can perform the following functions:

` Create one or more network files,

Delete previously stored network files,

Examine the contents of any network file, and

Examine the network file directory to determine the availability

status of any network file.

The overall control of a network construction session is provided by a

menu that enables the user to select the function to be performed next. The

NETWORK menu is as follows:

NETWORK MENU f

1 - CREATE NETWORK FILE

2 - DELETE NETWORK FILE

3 - LIST A NETWORK FILE OR NETWORK DIRECTORY

4 - EXIT

SELECT OPTION (1-4)

Upon completion of creating, deleting, or listing a network file (or the

network directory), program control returns to the NETWORK menu. Only the

EXIT option causes the program to return to the INPUT menu. Creation of a

network file consists of a series of input actions by the user. The user has

the capability to return to the NETWORK menu without completing a network

file creation. If the user chooses to return to the NETWORK menu, the

partially created network file is lost.
C+1

K

j 4.2 CREATING A NETWORK FILE

a

To create a network file, the user selects option 1 - CREATE NETWORK

FILE from the NETWORK menu.

The model prompts the user to provide the information necessary to construct

a network filA. The information the user must provide includes:

Network file name,

Selection of prestored nodes,

Traffic volume for prestored nodes,

E Identification of additional cities, and

Additional traffic entries.

The segtience of user inputs is diagrammed in figure 4-2. The following sec- 

tions describe all user inputs and the associated program responses in the

order in which they occur.

a

r

4.2.1 Network File Name

r

t

The program prompts the user to enter a name for the file being created

-.

by printing the following message:

4

p3

T v.

r ENTER, THE NAME OF THE NETWORK FILE TO CREATE (6 CHARACTERS) 

The user must provide the name of a file that is listed in the network file 

- directory and is available for file storage. The twenty file names that are

j currently defined in the directory are NETOOI through NET020.

4-3
ENTER

r ^,

C

1

I

t

k.

I!C

i3•f

S ^!

Figure 4-2. Sequence of Inputs for Network File Creation 

4-4

L

ltw 
:7. ^

4-5

4.2.2 Verification of Individual Entries

After a valid network file name has been entered, the program issues the

following prompt:

DO YOU WANT TO VERIFY INDIVIDUAL ENTRIES IN CITY LISTS? (Y/N)

If the user enters a "Y", all city codes entered during the network file

creation session will be echoed to the user for verification. This verification provides the user with a double check to ensure that :ill code names

are entered correctly.

4.2.3 Selection of Prestored S'4SA Cities

The user is provided with four methods for selecting the prestored SMSA

cities to be included in his network. The four options involve including all

350 prestored cities, all but a subset of the prestored cities, only a subset

of the prestored cities, or the set of prestored cities that accounts for a

giver, percentage of the total traffic volume of the prestored cities. The

model prints the following prompt:

1 - ALL

2 - ALL EXCEPT

3 - ONLY

4 - PERCENT

ENTER OPTION TO USE FOR SELECTING PRESTORED CITIES (1-4)
^m

The user selects one option by entering a single digit from 1 to 4. The

following paragraphs provide a detailed explanation of each option.

4.2.3.1 Selecting ALL Prestored Cities

If the user selects option 1 - ALL, the program automatically includes

all of the cities in the prestored traffic table in the new network file.

Appendix A lists the prestored SMSA cities and their associated code names.

4.2.3.2 Selecting ALL EXCEPT a Subset of Prestcred Cities

If the user selects option 2 - ALL EXCEPT, all prestored cities except

those entered by the user will be included in the new network file. After

selecting the option, the user inputs a list of four-character city codes he

wishes to exclude from the network file. The program will issue the following prompt for each city code.

ENTER FOUR CHARACTER CITY CODES -- <CR> TO STOP

The four-character codes entered must be codes associated with cities listed

In Appendix A. When the complete list of cities has been entered, the user

enters a single carriage return and the network file creation session

continues.

a•

y,

^ L

4-5

r^
r

4.2.3.3 Selecting ONLY a Subset of Prestored Cities

If the user selects option 3 - ONLY, only those prestored cite codes

entered by the user are included in the new network file. After selecting

this option, the user inputs four-character city codes to define the network. The program issues the following prompt for each city code:

ENTER FOUR CHARACTER CITY CODES -- <CR> TO STOP

The four-character codes entered must be codes associated with cities listed

in Appendix A. When the complete list of cities has been entered, the user

enters a single carriage return and the network file creation session

continues.

4.2.3.4 Selecting Prestored Cities Representing a Given

PERCENT of Network Traffic

The PERCENT option causes the program to select cities from the prestored SMSA list based on a user-input percentage. The program arranges

cities by total originating traffic volume from highest to lowest. The

percentage of the total traffic is then computed and added to a cumulative

percentage as each city is processed. When the cumulative percentage equals

or exceeds the percentage input by the user, the processing stops. At this

point, the cities processed represent the desired percentage of the total

traffic volume of the prestored SMSA cities.

4-7

Cf
If the user selects option 4 - PERCENT, the program will print the

following prompt:

1 ENTER PERCENT TO USE IN SELECTING CITIES - 0.0 TO 100.0

The user must enter a number between 0.0 and 100.0 indicating the percentage

of total network traffic. The number must include a decimal point. After a

.7 -

 valid percentage is entered, the user is given the opportunity to examint the

cities selected by the program. The program prints the following question:

DO YOU WANT TO VIEW NODES IN THIS NETWORK? (Y/N)

IT

I,

v.

g: If the user responds with a "Y", the set of cities will be printed. For

example, if the user specified 20.0 percent, the following list of cities

would be printed:

M

^pl

C

f

4-8

L
THE TOP 20 PERCENT NODES ARE

NENY CIIL LOCA PHPA

DEMI MANY WADC BAMD

_ NWNJ JENJ CLOH PIPA

HOTX M 114 NEW CIOH

MIWI LOW ATGA BOMA

ININ DATX SLMO COOH

DECO HACT LOKY BRCT

TOOH PAW DAOH NOPA

HWC SFCA MIFL AKOH

HAPA KAMO WIDE GRMI

NELA HATN METH NOVA

BUNY RIVA ALPA BUNG

PRRI CHNC RONY LAMI

BIAL OKOK SNCA FLMI

YOOH FOIN GRNC GAIN

PHAZ SPCT RANC ALNY

KNTN SYNY SJCA CAOH

;. TMFL JOTN COSC ANCA

OMNE TUOK WOMA

4.2.4 Traffic Volume for Prestored SMSA Cities

Once the selection of prestored cities is complete, the program asks the

!iser to enter the total traffic volume between tiie prestored cit ifies by printing the following prompt:

ENTER TOTAL NUMBER OF VOICE CIRCUITS FOR PRESTORED C I TIES -

INCLUDE DECIMAL POINT

The user must enter the traffic volume in voice circuits. The number entered

must include a decimal point. The volume entered is used to compute traffic

levels in voice circuits between the prestored cities included in the network.

I_

4-9
^f1

4.2.5 Entering Additional Cities

The user is given the option of including additional cities in the network. Additional cities are cities ether than those included in the prestored list of Appendix A which the user wishes to include in the network

file. The program will print the following question:

I DO YOU WANT TO INCLUDE ADDITIONAL CITIES (Y/N)?

t If the user types "N", the program proceeds to the next question. If the

user types "Y", he will be prompted to enter a list of additional city codes

along with vertical and horizontal coordinates for each. The program issues

the following prompt for each additional city entry:

TA

i

ENTER ADDITIONAL CITY DATA IN THE FORMAT

4 CHARACTER CITY CODE, 4 DIGIT VERTICAL COORDINATE, 4 DIGIT HORIZONTAL

COORDINATE

ENTER <CR> TO STOP

The four-character codes entered must not match any codes associated with the

prestored cities of Appendix A. If the code name of a prestored city is

entered as an additional city, the user will he notified and prompted to

reenter. Vertical and horizontal coordinates must be exactly four digits

each and must follow the additional city code entry. The three fields (code

name, vertical coordinate, horizontal coordinate) must be entered on one line

in the correct sequence and the fields must he separated by commas. For

example, if the user wants to define a city code of EIRU with vertical and

horizontal coordinates of 4568 and 5857, he would type the following:

4-10
1

EIRU,4568,9857

When the complete list of additional cities has been entered, the user enters

a single carriage return and the network file creation session continues.

4.2.6 Review of Intercity Traffic Volumes

Upon completion of specifying the cities to be included in the network,

P;

the user may wish to review traffic volumes between specific cities. The

i

program prints the following query:

E"

iDO YOU WANT TO REVIEW ANY INTERCITY TRAFFIC VOLUMES? (Y/N)

If the user types "Y", he may review as many traffic volumes as he wishes by

r. entering city pairs. The program will then issue the following prompt:

f

I

R.. ENTER CITY PAIRS IN THE FORMAT

^' I 4 CHARACTER FROM CITY CODE, 4 CHARACTER TO CITY CODE

<CR> TO STOP

The user must enter the code names of two cities that are included in the

network. If either of the code names cannot be found in the list of cities

4-11
J

i

r

p ,defining the network, the user will be informed of the error and prompted to

reenter. The two code names must he exactly four characters each and they

must be sepa w ,d by a comma. For example, if the user enters the valid code

names, GHJF,,.. `1, the program will print the appropriate volume in voice

circuits as follows:

THE TRAFFIC VOLUME FROM GHJF TO ABCD IS 0 VOICE CIRCUITS

ti

x

4.2.7 Entering Additional Traffic Volumes

After reviewing selected intercity traffic volumes, the user may wish to

supplement individual volumes by entering additional traffic. The program

prints the following query:

i

d

DO YOU WANT TO ENTER ADDITIONAL TRAFFIC? (Y/N)

,

I

If the user enters "Y", the program will prompt for additional traffic

entries as follows:

ENTER TRAFFIC TABLE ADDITIONS IN THE FORMAT

4 CHARACTER FROM CITY CODE, 4 CHARACTER TO CITY CODE, VOICE CIRCUITS

c' INCLUDE DECIMAL POINT

ENTER <CR> TO STOP

€I

I

' t

4-12

{ f

rP
The user may enter the code names of city pairs along with a number of additional voice circuits associated for each pair. The city code names must be

exactly four characters each and the number of voice circuits must include a

decimal point. The three fields (frjm city code, to city code, traffic volume) must be entered on one line in the correct sequence and the fields must

be separated by commas. For example, to add 10 voice circuits to the volume

f of traffic from city AKOH to city BAMI, the user enters:

AKOH,BAMI,10.0

The city code names must be included in the network. Entry of a single carriage return by the user signals the program to end the additional traffic

entry process.

4.2.8 Traffic Table Listing

The program gives the user the option to have the final traffic table

for the network spooled to the high speed printer by prompting:

DO YOU WANT A LISTING OF THE TRAFFIC TABLE? (Y/N)

If the user types "Y", a listing of the traffic table will be spooled to the

printer. The user is notified that the creation of the network file is complete and control returns to the NETWORK menu.

_ 4-13

L
4.3 DELETING A NETWORK FILE

To delete a previously created network file, the user selects option 2 -

DELETE NETWORK FILE from the NETWORK menu. After selecting the DELETE

option, the user is prompted for a file name corresponding to the file to be

deleted as follows:

ENTER THE NAME OF THE NETWORK FILE TO DELETE (SIX CHARACTERS)

If the user enters a file name that is not in the network directory, the user

^- is informed of the error and the Drogram returns to the NETWORK manu. If a

valid network file name is entered, the user is queried as follows to verify

his intention to delete the named file (in this case NET020):

DELETE NET020? (Y/N)

F

If the user enters "Y", the file is made available for storing a new network

definition. The user is informed that the named file has been deleted and

the program returns to the NETWORK menu.

4.4 LISTING A NETWORK FILE OF THE NETWORK DIRECTORY

To list a network file or the network directory, the user selects option

-- 3 - LIST A NETWORK FILE OR NETWORK DIRECTORY from the NETWORK menu. The program will prompt the user for the name of the file to list by printing the

It following message:

4-14

C
ENTER THE NAME OF THE FILE TO LIST -- <CR> FOR DIRECTORY

If the user enters the name of a file that is not in the network directory,

an appropriate error message is displayed and he is prompted to reenter the

file name. After the requested file or directory has been listed, the program returns to the NETWORK menu.

4.4.1 Network File Listing

The following sections describe the contents of a network file listing.

The network in the example is stored with file name NETO20.

Total Number of Cities

The total number of cities in the network is indicated as follows:

THERE ARE 12 CITIES IN NETWORK FILE NET020

The total number of cities is the sum of the number of prestored cities

included in the network plus the number of additional cities entered.

4-15
i

Li st of City Mnemonics and V-H Coordinates

The code names and vertical and horizontal coordinates of each of the

cities in the network are listed in alphabetical order by codes as in the

following example:

ABTX 8698 4513

ADIW 4858 2048

AKOH 5637 2472

AKSD 4848 3948

ANCA 7810

ANSC 69610 1894

ATGE 7130 1948

t BAMI 5713 3124

BETX 8777 3344

HFIW 9384 3736

HSYQ 4856 5853

JAJW 9393 2739

ENTER <CR> TO CONTINUE

If there are more than twenty nodes in the network, they are listed in groups

of twenty. The user is prompted to enter a carriage return <CR> to continue

after each group of twenty cities.

J

Traffic Level for Prestored Cities

r

The traffic level (voice circuits) used to determine the base traffic

volumes for the prestored cities is listed as follows:

THE TRAFFIC LEVEL FOR THE PRESTOP.ED CITIES IS 394865 VOICE CIRCUITS

r 

L

4-16

1 V7
Additional Traffic

The number of additional traffic entries, the from and to city code

names, and the number of additional voice circuits are listed as follows:

THERE ARE 2 PAIRS OF ADDITIONAL TRAFFIC SPECIFIED

ABTX AKOH 56

AKOH BAMI 394

ENTER <CR> TO CONTINUE

If there are more than twenty additional traffic entries, they are listed in

groups of twenty. The user is prompted to enter a carriage return <CR> to

continue after each group of twenty entries.

4.4.2 Network Directory Listing

If the user enters a single carriage return instead of a network file

name after selecting option 3 from the NETWORK menu, the program lists the

network file directory. The following is an example of a network directory

listing. In the example, files NET002 through NET006 are used to store

network files. Files NET001 and NET007 through NET020 are available for

network file storage.

L
NETWORK

NET001

NET002

NET003

NET004

NET005

NET006

NET007

NET008

NET009

NET010

NET011

NET012

NET013

NET014

NET015

NET016

NET017

NET018

NET019

NET020

E14TER <CR> TO CONTINUE

DIRECTORY

UNUSED

IN USE

IN USE

IN USE

IN USE

IN USE

UNUSED

UNUSED

UNUSED

UNUSED

UNUSED

UNUSED

UNUSED

UNUSED

UNUSED

UNUSED

UNUSED

UNUSED

UNUSED

UNUSED

T

t" 

4.5 EXITING THE NETWORK CONSTRUCTION SESSION

To exit from the network construction session, the user selects option

4 - EXIT from the NETWORK menu. Program control then returns to the INPUT

menu. Any network files that have been created and stored are available to

be specified as input to the model in an execution control session. Network

files remain available for use until they are intentionally deleted by the

user.
CHAPTER 5 - CREATING AND MANAGING TARIFF FILES

5.1 OVERVIEW

Through the tariff construction session, the user is able to create and

maintain a set of tariff files used for input to the CNDC Model. Entry into

a tariff construction session is accomplished by selecting option 2 - TARIFF

CONSTRUCTION from the INPUT menu. Exiting from the session returns the user

to the INPUT menu. The logical relationship between the input and tariff

construction sessions is shown in figure 5-1.

InruI

SESSION

CONSTRUCTION I I I CONTROL EXIT

TARIFF

CONSTRUCTION

CREATE

TFLE FOFLEF OR

 TARIFF FILE EXIT

Figure 5-1. logical Relationship Between Tariff Construction and INPUT

Sessions

5-1
During a tariff construction session, the user can perform the following

functions:

Create one or more user-defined tariff files,

Delete any previously stored tariff file,

Examine the contents of any tariff file, and

Examine the tariff file directory to determine the availability I '

status of any tariff file.

The overall control of a tariff construction session is provided by a

menu that enables the user to select the function to be performed. The

TARIFF menu is displayed as follows:

!

TARIFF MENU

s 1 - CREATE TARIFF FILE

2 - DELETE TARIFF FILE

3 - LIST A TARIFF FILE OR TARIFF DIRECTORY

4 - EXIT

SELECT OPTION (1-4)

I

' Upon completion of creating, deleting, or listing a tariff file (or the

tariff directory), program control returns to the TARIFF menu. The creation

1-

of a tariff file consists of a series of user inputs which vary depending on

the tariff type. The user has the capability to return to the TARIFF menu

without completing a tariff file creation. If the user chooses to return to

( the TARIFF menu, the partially created tariff file is lost. Program control

returns back to the TARIFF menu upon completion of each function, until the

user selects the EXIT option. Control is then returned to the INPUT menu.

5-2

I5-3

5.2 CREATING A TARIFF FILE

To create a new tariff file, the user selects option 1 - CREATE TARIFF

FILE from the TARIFF menu. The program will prompt the user for information

necessary to construct a tariff file. The information the user must provide

depends on the type of tariff being created (ATT, WU, or SBS). The sequence

of user inputs is diagrammed in figure 5••2. The following sections describe

all the user inputs and the associated program responses for each of the

three tariff types (ATT, WU, and SBS).

i

5.2.1 Tariff File Name

The program prompts the user to provide a nar'^ for the file being

created by printing the following message:

ENTER THE NAME OF THE TARIFF FILE TO CREATE (6 CHARACTERS)

The user must provide the name of a file that is listed in the tariff file

directory and available for file storage. The twelve file names that are

currently listed in the directory are TAR001 through TARO12. By listing the

tariff file directory, the user can determine which files are currently in

use and which are unused (available).

i
I

I

i

n ^ .

F^

F

1

.1

^sqi'

r

C i

,"v 111

I>

q 1 _

a

l

ENTEq

TARIFF

FILE

NAME

TARIFF TYPE

ATT WU SOS

OF LIST OF ACCESS ENTER

GORY CITY PAIR USER NO

MENTS ADJUSTMENTS PLACEMENT

OF NAC'.S

Z

YES

MENT

JIMOWNT

LONG, MEDIUM,

AND SHORT LIST

GES HAUL CHANNEL OF NAC

REPEACHARGES CITIES

SCHED

1, 2, AEW/

ION OF

MENT

GES

NAC CHARGES

S'11.1 CHARGES

FTU CHARGES

MINIMUM

CAU CHARGE

PER NAC

INCREMENTAL

CAU CHARGES

E%17

1

L 

' Figure 5-2. Sequence of Inputs for Tariff File Creation 

ff

5-4

Li

w 
5.2.2 Tariff Type

iThe program prompts the user to identify the type of tariff he wishes to

create by printing the following:

1 - AT&T

2 -WU

3 - SBS

ENTER TARIFF TYPE

The user must enter a single digit (1, 2, or 3) to indicate the file type.

Depending on the user's response, the program will prompt for the inputs to

define an ATT, WU, or SBS type tariff, respectively.

!) 5.2.3 Creating an ATT-Type Tariff File

1 If the user enters a file type of "1" (ATT), the pro g ram will acknowledge the user's wish to create an ATT-type tariff file by displaying the

i following message:

r

1. 

I CREATE A NASA TARIFF BASED ON THE AT&T PHILOSOPHY

,I

The program then proceeds to prompt the user for the required inputs.

! 5-5
The philosophy of an ATT-type tariff is based on AT&T - FCC Tariffs 260

and 264. Category A rate centers are defined by a list of cities within the

AT&T tariff. These are shown in Appendix B. Any city not included in this

list is declared as a Category B rate center by the tariff.

To create a tariff based on the AT&T philosophy, the user can make

1

adjustments to:

1. The categories of individual rate centers, and

2. The increment charges for Schedules I, II, and III.

The associated program/user interactions are described in the following

sections.

P 1

Entering Adjustments to Rate Center Categories

s..

t J

r The two possible ways to adjust the category of a rate center are:

j 1. Change a Category B ("unlisted") rate center to Category A

. ("listed"), or

rt

2. Change a Category A ("listed") rate center to Category B

t

f

unlisted).

r The program issues the following prompt:

j

ENTER AUDITIONS AND DELETIONS OF CATEGORY A PATE CENTERS

t FOR ADDITIONS ENTER CODE NAME, +1 AND FOR DELETIONS ENTER CODE NAME, -1.

ENTER <CR> TO STOP

1

5-6
To change the status of a city from "unlisted" to "listed", the user enters

the four-character code name of the city followed by +1. If the named city

is already a Category A rate center, an error message is printed and the

entry is ignored. To change the status of a city from "listed" to

j "unlisted", the user enters the four-character code name of the city followed

1 by -1. The two fields (code name, ±1) must be entered on one line and

I

separated b-. a comma. For example, if the user wishes to add Ridgewood, Mew

Jersey (RINJ) to the list of Category A rate centers, he enters:

RINJ ,+1

If he wishes to change Boise, Idaho (ROIO) from Category A to Category B, he

enters:

BOIO,-1

When the list of rate center category adjustments is complete, the user

enters a single carriage return and the tariff creation session continues.

Entering Incremental Mileage Charges for Rate Schedules I, II, and III

The structure of the ATT tariff provides for a rate calculation for

private line service based on the distance between any two cities. The

tariff contains base rates for a fixed set of distances or mileages, which

include 1, 15, 25, 40, 60, 80, 100, and 1000 miles. The rate for any distance other than these ei g ht is calculated based on an incremental charge on

each mile over the closest fixed base mileage. Given a set of incremental

mileage charges the base rates for the eight fixed distances can he calculeted by the program. The user can create his own ATT-type tariffs by inputting a complete set of incremental mileage charges for each of the three rate

schedules within an ATT-type tariff.

f I^•

5-7
The user is prompted by the program to enter increment charges in

exactly the same manner for each of the three schedules in turn. All charges

entered must include a decimal point. The input of increment charges is

introduced by the following message:

ENTER INCREMENT CHARGES FOR EACH MILEAGE BREAKPOINT IN SCHEDULES 1, 2,

i

AND 3 -- INCLUDE DECIMAL POINTS

i

I

The program then identifies each schedule in turn, followed by prompts

for the necessary increment charges. A sample session with user inputs

underlined is as follows:

SCHEDULE 1

ENTER INCREMENT CHARGE FOR EACH MILE UP TO 1 MILES

24.00

U- M INCREMENT CHARGE FOP. EACH MILE UP TO 15 MILES

20.00

E17M INCREMENT CHARGE FOR EACH MILE UP TO 25 MILES

18.00 MR INCREMENT CHARGE FOR EACH MILE UP TO 40 MILES

16.00

EATER'INCREMENT CHARGE FOR EACH MILE UP TO 60 MILES

13.00

ERM INCREMENT CHARGE FOR EACH MILE UP TO 80 MILES

10.00

ERTSti INCREMENT CHARGE FOR EACH MILE UP TO 100 MILES

8.00

VRTE1F INCREMENT CHARGE FOR EACH MILE UP TO 1000 MILES

5.00

E TES INCREMENT CHARGE FOR EACH MILE OVER 1000 MILES

3.00

Increment charges for Schedules iI and III are input in an identical manner.

5-8
r

Reviewing and Correcting Increment Charges

To ensure the increment charges are correct, each schedule is printed

upon completion of user inputs and the user is given the opportunity to

correct any errors. For the previous example, the program echoes the entire

schedule as follows:

1. THE CHARGE FOR EACH MILE UP TO 1 IS 24.00

2. THE CHARGE FOR EACH MILE UP TO 15 IS 20.00

3. THE CHARGE FOR EACH MILE UP TO 25 IS 18.00

j 4: THE CHARGE FOR EACH MILE UP TO 40 IS 16.00

1 5. THE CHARGE FOR EACH MILE UP TO 60 IS 13.00

6. THE CHARGE FOR EACH MILE UP TO 80 IS 10.00

7. THE CHARGE FOR EACH MILE UP TO 100 IS 8.00

1 8. THE CHARGE FOR EACH MILE UP TO 1000 IS 5.00

9. THE CHARGE FOR EACH MILE OVER 1000 IS 3.00

ENTER NUMBER OF CHANGE -- <CR> IF NO CHANGES

If the user enters a number correzponding to one of the increments, he is

prompted to reenter the associated charge. The new value entered replaces

the old value and the entire schedule is printed again, g iving the user the

opportunity to make further ccr-ections. When all values have been entered

correctly, the user enters a single carriage return and the tariff file

creation session continues.

When all increment charges for the three schedules are entered correctly, the user is notified that the creation of the tariff file is

complete, and program control returns to the TARIFF menu.

5-9
5.2.4 Creating a WU-Type Tariff File

If the user enters a file type of "2" (WU), the program will acknowledge

the users wish to create a WU-type tariff file by displaying the following

message:

CREATE A NASA TARIFF FILE BASED ON THE WU PHILOSOPHY

The program will then proceed to prompt the user for the required inputs.

F The philosophy of a WU-type tariff is based on Western Union FCC Tariff

No. 261. The relevant contents of the prestored Western Union tarif are

provided in Appendix B. To create a tariff based on the Western Union

philosophy, the user can make adjustments to

k

1. The rate categories (long, medium, or short haul) of individual

• access city pairs, and

2. Long, medium, and short haul channel charges.

The associated program/user interactions are described in the following

sections.

i'

Entering Access City Pair Adjustments

-^ I The three possible ways to adjust the list of WU satellite access city

pairs are:

f 1. Add a new access city pair to one of the three categories,

Fi

5-10
F2. Change the category of an existing access city pair, or

3. Delete an access city pair.

The program 'Issues the following prompt:

- ENTER ADJUSTMENTS TO SATELLITE ACCESS CITY PAIRS

TO ADD AN ACCESS CITY PAIR OR TO CHANGE THE RATE CATEGORY OF A PAIR

ENTER CODE NAME, CODE NAME, CATEGORY (1, 2, or 3)

CATEGORIES ARE

1 - LONG HAUL

2 - MEDIUM HAUL

3 - SHORT HAUL

FOR DELETIONS ENTER CODE NAME, CODE NAME, 0

' ENTER <CR> TO STOP

i

To add a new access city pair to one of the three categories, the user

enters the two four-character code names followed by a 1, 2, or 3 to indicate

7 the rate category (long haul, medium haul, or short haul).

To change the category of an existing access city pair, the user enters

the two four-character code names followed by a 1, 2, or 3 to indicate the

new category as above.

To delete an access city pair, the user enters the two four-character

code names followed by a 0. If the named access pair is not listed in the

prestored WU tariff, an error message is printed and the entry is ignored.

The three fields (code name,code name,category) must be entered on one

line and separated by commas. For example, if the user wishes to change the

category of the access city pair Los Angeles (LOCA) - Atlanta (ATGA) from

long haul to medium haul, he enters:

LOCA,ATGA,2

k 5-11

t

Po
V

When the entry of all satellite access city pair adjustments has been

completed, the user enters a single carriage return and the tariff creation

session continues.

Entering Long, Medium, and Short Haul WU Satellite Channel Charges

The user is prompted to enter long, medium, and short haul channel

charges. These charges represent the monthly charge per satellite channel

for each rate category. All charges entered must include a decimal point.

The following is an example of a typical session with user responses

underlined:

ENTER CHANNEL CHARGES FOR EACH CATEGORY -- INCLUDE DECIMAL POINT

CATEGORY 1 -- LONG HAUL

1275.00

ClR` M 2 -- MEDIUM HAUL

955.00

CATMY 3 -- SHORT HAUL

673.00

When all channel charges have been entered, the user is notified that the

creation of the tariff file is complete and control returns to the TARIFF

menu.

C 

5-12

1-—.-.
5.2.5 Creating an SBS-Type Tariff File

If the user enters a file type of "3" (SBS), the program will acknowledge the user's wish to create an SBS-type tariff file by displaying the

following message:

CREATE A NASA TARIFF BASED ON THE SBS PHILOSOPHY

The program then proceeds to prompt the user for the required inputs.

The philosophy of an SBS-type tariff is based on Satellite Business

Systems, Inc. FCC Tariff No. 2. The relevant contents of the prestored SBS

tariff are provided in Appendix B. To create a tariff based on the SBS

philosophy, the user can make adjustments to:

1. The placement of satellite access cities,

2. The monthly charge per Network Access Center (NAC),

3. The monthly charge per Supplemental Capacity Unit (SCU),

4. The monthly charge per Full-Time Transmission Unit (FTU),

5. The minimum monthly charge per Connection Arrangement Unit (CAU)

per NAC, and

6. The monthly charge for incremental CAUs.

The associated program/user interactions are described in the following

sections. 

5-13
Selection of Satellite Access Cities

I

Unlike the Western Union tariff which contains specific satellite access

city pairs, the prestored SBS tariff allows for satellite access equipment to

be installed at customer premises anywhere in the United States. These premises are referred to as Network Access Centers or simply NAC cities. For

mixed satellite/terrestrial problems using the SRS-type satellite tariff, the

placement of NAC cities must be determined. The user has two alternatives in

the selection of NAC Cities:

1. The user may choose to have the program select the NAC cities

automatically, or

2. The user may choose to define the NAC cities as user input.

The program determines which of these two options to follow by issuing the

following user prompt:

DO YOU WISH TO DEFINE THE NAC PLACEMENT (Y/N)?

The user should respond with a "Y only if he desires to input a

specific set of NAC cities. Otherwise, the program will use its internal

algorithms to determine NAC cities based on network costs.

Automatic Selection of NAC Cities

If the user enters "N" to the previous prompt, the program will execute

an iterative routine to determine the MAC city selection that results in

minimization of overall network cost. No further user interaction is necessary for NAG selection. The tariff file creation session then continues.

5-14
User Selection of NAC Cities

If the user enters "Y" to the previous prompt to indicate that he wishes

to define the NAC city placement, the program will prompt for the codes of

t the user-selected NAC cities as follows:

r

ENTER CODE OF NEXT NAC. LOCATION - <CR> TO STOP

The user must enter four-character codes, one entry per line, to identify the

f cities to be used for satellite access in the tariff. As specified in the

SBS tariff, a minimum of three city codes must be entered. When the identification of NAC locations is complete, the user enters a single carriage

return and the tariff file creation session continues.

Entering SBS Monthly Rates

All month-to-month charges listed in an SBS-type tariff must be entered

'

[

with a decimal point. The program issues the following instruction prior to

`- prompting for the tariff charges.

5

USE A DECIMAL POINT IN ALL NUMERIC INPUTS

l

l-'

5-15

^
The program then prompts the user to enter the monthly charge per NAC as

follows:

ENTER CHARGE PER NETWORK ACCESS CENTER

The user must enter the monthly cost per NAC in dollars, including a decimal

point.

The program then prompts the user to enter the monthly charge per SCU as

follows:

P

ENTER CHARGE PER SUPPLEMENTAL CAPACITY UNIT

y.

F..

The user must enter the monthly cost per SCU in dollars, including a decimal

` point.

t

The program then prompts the user to enter the monthly charge per FTU as

follows:

ENTER CHARGE PER FULL TIME TRANSMISSION UNIT

f

The user must enter the monthly cost per FTU in dollars, including a decimal

I point.

5-16
The user must now define both the minimum CAU charge per NAC and a set

of incremental volume-sensitive CAU charges. A minimum CAU charge applies to

each NAC whenever the monthly charge for CAUs at that NAC is less than the

specified amount. The program prompts the user to specify this minimum

charge as follows:

ENTER MINIMUM CAU CHARGE PER NAC

The user must enter the minimum CAU charge per NAC in dollars, including a

decimal point.

,T 

SBS Tariff No. 2 specifies incremental CAU charges that depend on traffic volume. The program prompts for each of the necessary increment charges.

All charges entered must include a decimal point. A sample session with user

inputs underlined is as follows:

ENTER INCREMENTAL CAU CHARGES

ENTER MONTHLY CHARGE PER CAU UP TO 150

95.00

UTE1f MONTHLY CHARGE PER CAU UP TO 300

90.00

=MONTHLY CHARGE PER CAU IN EXCESS OF 300

65.00

When all incremental CAU charges have been entered, the user is notified

that the creation of the tariff file is complete and control returns to the

TARIFF menu.

5-17
I

5.3 DELETING A TARIFF FILE

To delete a previously created tariff file, the user selects option 2 -

DELETE TARIFF FILE from the TARIFF menu. After selecting the DELETE option,

the user is prompted for the file name to be deleted as follows:

ENTER THE NAME OF THE TARIFF FILE TO DELETE

If the user enters a file name that is not in the tariff directory, the user

is informed of the error and the program returns to the TARIFF menu. If a

valid tariff file name is entered, the user is queried as follows to verify

1 . his intention !.0 =?elete the named file (in this case TARO12):

(

DELETE TARO12? (Y/N)

If the user enters "Y", the file is made available for storing a new tariff

definition. The user is informed that the named file has been deleted and

the program returns to the TARIFF menu.

5.4 LISTING A TARIFF FILE OR THE TARIFF DIRECTORY

To list a tariff file or the tariff directory, the user selects option

3 - LIST A TARIFF FILE OR TARIFF DIRECTORY. The program will prompt the user

for the name of the file he wishes to list by printing the following message:

I 
5-19

ii

I^

a

ENTER THE NAME OF THE FILE TO LIST — <CR> FOR DIRECTORY

gN

g

9pp

If the user enters the name of a file that is not in the tariff directory, an

.t appropriate error message is displayed and he is prompted to reenter the file

11 name. After the requested file or directory has been listed, the program

returns to the TARIFF menu.

5,4.1 ATT-Tyre Tariff File Listing

IL

The following sections describe the contents of an ATT-type tariff file

c ^. listing. The tariff in the example is stored with file name TARO02.

Rate Center Category Adjustments

The total number of rate center category adjustments and the specific

charges are indicated as follows:

THERE ARE 4 CATEGORY A ADJUSTMENTS IN TARIFF TAR002

THESE ADJUSTMENTS ARE

SACA UNLISTED

SNTX UNLISTED

SUCA LISTED

WWWW LISTED

ENTER <CR> TO CONTINUE
I

Y

If there are more than twenty rate center category adjustments in the tariff,

they are listed in groups of twenty. The user is prompted to enter a carriage return <CR> to continue after each group of twenty adjustments. In the

above example, two rate centers that are Category A ("listed") cities in the

prestored AT&T tariff, namely Sacramento, California (SACA) and San Antonio, I Texas (SNTX), arf> changed to Category B ("unlisted") cities, and two cities

with code names SKA and WWWW are added to the set of Category A ("listed")

cities.

ATT Rate Schedules I, II, and III

The three rate schedules are displayed in one table with base and

increment charges for each mileage breakpoint as follows.

THERE ARE 9 LEVELS SPECIFIED IN ATT TARIFF

SCHEDULE 1 SCHEDULE 2 SCHEDULE 3

MILEAGE BASE INC BASE INC BASE INC

UP TO 1 0.00 75.00

----------------------------------------------------------------------------

0.00 76.00 0.00 77.00

UP TO 15 75.6a 5.00 76.00 6.00 77.00 7.00

UP TO 25 145.00 4.00 160.00 5.00 175.00 6.00

UP TO 40 185.00 3.00 210.00 4.00 235.00 5.00

UP TO 60 230.00 2.00 270.00 3.00 310.00 4.00

UP TO 80 270.00 1.00 330.00 2.00 390.00 3.00

UP TO 100 290.00 0.90 370.00 1.00 450.00 2.00

UP TO 1000 308.00 0.80 390.00 0.90 490.00 1.00

OVER 1000 1028.00 0.50 1200.00 0.60 1390.00 0.50

ENTER <CR> TO CONTINUE

The user enters a carriage return <CR> when he is ready to continue and

program control returns to the TARIFF menu.

5-20

L
5.4.2 WU-Type Tariff File Listing

1

Y

The following sections describe the contents of <a WU-type tariff file

listing. The tariff in the example is stored with file name TARO10.

Access City Pair Adjustments

The total number of access city pair category adjustments are indicated

as follows:

THERE ARE 8 ADJUSTMENTS TO PRESTORED SATELLITE

ACCESS CITY PAIRS IN WU TARIFF TARO10

CIIL BAMD MEDIUM

CIIL DATX LONG

CIIL HOTX LONG

CIIL NENY EXCLUDE

CIIL PHPA EXCLUDE

CIIL WADC MEDIUM

CIIL WIDE MEDIUM

NLCT WFCT SHORT

ENTER <CR> TO CONTINUE

)

If there are more than twenty access city pair category adjustments in the

tariff, they are listed in groups of twenty. The user is prompted to enter a

carria ge return <CR> to continue after each group of twenty adjustments. In

the above example, satellite access between Chicago, Illinois (CIIL) and each

of the three cities Baltimore, Maryland (BAMD), Washington, DC (WADC), and

Wilmington, Delaware (WIDE) is to be considered as Category II (medium haul)

access rather than Category III (short haul). Similarly, satellite access

between Chicago and both Dallas and Houston, Texas (DATX and HOTX) is changed

from Category III (short haul) to Category I (long haul). Satellite access

5-21
between Chicago and both New York, New York (NENY) and Philadelphia, Pennsylvania (PHPA) is eliminated. The city pair New London, Connecticut (NLCT) and

Waterford, Connecticut (WFCT) is added to the set of Category III (short

haul) satellite access city pairs.

Long, Medium, and Short Haul Channel Charges

The monthly charges per channel (in dollars) for long, medium, and short

^j haul point-to-point service are listed as follows:

1

1 LONG HAUL RATE 925.00

l MEDIUM HAUL RATE 695.00

SHORT HAUL RATE 580.00

ENTER <CR> TO CONTINUE

The user enters a carriage return <CR> when he is ready to continue and program control returns to the TARIFF menu.

5.4.3 SBS-Type Tariff File Listing

The following sections describe the contents of an SBS-type tariff file

listing. The tariff in the example is stored with file name TARO12.

NAC Locations

The program indicates user specified satellite access cities by printing

the total number of locations specified and listing the corresponding city

codes as follows:
5-23

I

THERE ARE 6 NAC LOCATIONS SPECIFIED IN SBS TARIFF TAR012

BAMD CIIL DEMI LOCA NANY NENY PHPA WADC

ENTER <CR> TO CONTINUE

If the user chose automatic program selection of NAC cities, there will be

0 NAC locations listed in the tariff. In this case, the identification of

MAC cities occurs when the CNDC Model is executed in a mixed satellite/

terrestrial mode using this tariff file.

Equipment Charges

The monthly charge for all SRS equipment are listed (in dollars) as

follows:

i; NAC CHARGE IS 35700.

SCU CHARGE IS 2650.

k

f FTU CHARGE IS 1275.

( '

MINIMUM CAU CHARGE IS 9000.

I I THERE ARE 3 BREAKPOINTS IN CAU RATE TABLE

f ------------- N0--CAU-------BASE INC

UP TO 150 0. - 49.

UP TO 300 7350. 45.

OVER 300 14100. 33.

{ r . ENTER <CR> TO CONTINUE
For each breakpoint, the table lists the number of CAUs, the base rate in

dollars for the minimum number of CAUs in each interval, and the incremental

CAU charge for the interval in dollars.

5.4.4 Tariff Directory Listing

If the user enters a single carriage return instead of a TARIFF file

name after selecting option 3 from the TARIFF menu, the program lists the

tariff file directory. The following is an example of a tariff directory

listing. In the example, files TAROO1, TAR002, TAR007, and TAR008 are used

to store AT&T-type tariffs. Files TAR009 and TAR010 are used to store

Western Union type tariffs. Files TAR.003, TAR006, TARO11, and TAR012 are

used to store SRS-type tariffs, and files TAR004 and TAR005 are available to

4 store other tariffs.

TARIFF DIRECTORY

TAROO1 ATT

TAR002 ATT

TAR003 SBS

TAR004 UNUSED

TAR005 UNUSED

TAR006 SBS

TAR007 ATT

TAR008 ATT

TAR009 WU

TAR010 WU

TAR011 SRS

TAR012 SBS

ENTER <CR> TO CONTINUE

5-24

i

1... td.. I . J
5.5 EXITING THE TARIFF CONSTRUCTION SESSION

1

To EXIT from the tariff construction session, the user selects option

4 - EXIT from the TARIFF menu. Program control then returns to the INPUT

menu. Any tariff files that have been created and stored are available to be

specified as input to the model in an execution control session. Tariff

files remain available for use until they are intentionally deleted by the

user.

s
CHAPTER 6 - CREATING EXECUTION CONTROL FILES

6.1 OVERVIEW

During an execution

that defines the network

trol session is accompli

the INPUT menu. Exiting

The logical relationship

shown in figure 6-1.

control session, the user creates the execution file

problem to be modeled. Entry into an execution conshed by selecting option 3 - EXECUTION CONTROL from

from the session returns the user to the INPUT menu.

between the input and execution control sessions is

During an execution control session, the user can perform the following

functions: '

1. Create an execution control file, and

2. Examine the contents of the current execution control file.

The execution control session is menu driven and enables the user to

select the function to be performed next. An example of the EXECUTE menu is

shown below.

EXECUTE MENU

1 - CREATE EXECUTION FILE

2 - LIST EXECUTION FILE

3 - EXIT

SELECT OPTION (1 - 3)

6-1
ORIMAL Pf O'E. S

OF POOR QUALITY

INPUT

SESSION

NETWORK TARIFF EXIT CONSTRUCTION CONSTRUCTION

F

k

q ^ 5

iS Y. n.t ^4 <b 4M,f'A, t"

EXECUTION

CONTROL

CREATE LIS7

EXECU710N EXECUTION EXIT FILE, FILE

Figure 6-1. Logical Relationship Between the Execution Control and INPUT

Sessions

6-2
(D 

Jpon completion of creating or listing the execution file, program control

returns to the EXECUTE menu. Creation of an execution control file consists

of a series of input actions by the user. The user has the capability to

return to the EXECUTE menu at any point without creating an execution control file, should he encounter an error condition.

6.2 CREATING AN EXECUTION CONTROL FILE

To create an execution control file, the user selects option 1 - CREATE

EXECUTION FILE from the EXECUTE menu. The program prompts the user for the

required information. The information the user must provide includes:

Run identification,

Number of problems to run,

Network mode for each problem,

Network file for each problem,

Tariff files for each problem, and

Output table selection.

The sequence of user inputs is diagrammed in figure 6-2. The following sections describe all user inputs and the associated program responses in the

order in which they occur.

6-3

r
ENTER

TERRESTRIAL

TARIFF FILE

ENTER

TARIFF FILES

SELECT

OUTPUT TABLES

REPEAT

FOR EACH

ENTER

SATELLITE

TARIFF FILE

ENTER

RUN

IDENTIFICATION

NUMBER OF

PROBLEMS

NETWORK

MODE

MIXED TERRESTRIAL/

SATELLITE

TERRESTRIAL

ONLY OR

11TELLITE ONLY

EXIT

Figure 6-2. Sequence of Inputs for Execution Control File Creation

F_a
6.2.1 Run Identification

The program prompts the user to provide a name for the run by printing

the following message:

ENTER EIGHT CHARACTER RUN IDENTIFICATION

The user enters up to eight characters to define an identifier which will be

printed on all output associated with the run.

6.2.2 Number of Problems to Run

The user can specify multiple problems to he analyzed sequentially

within one run of the CNDC model. The program prompts the user to specify

the number of problems he wishes to run by printing the following message:

HON MANY PPORLEMS DO YOU WISH TO RUN? (UP TO 10) INCLUDE DECIMAL POINT

The user must enter a number from one to ten and the number must include a

decimal point. Problems within a run can vary based on the problem mode

(terrestrial only, satellite only, or mixed terrestrial/satellite), the

network file used, the tariff file(s) used, and the output tables generated.

The program will prompt the user for the necessary information for each

separate problem. The inputs described in sections 6.1.3 through 6.1.6 most

be provided for each problem in the run.

6-5

s

r;

I

I

f

I

1
6.2.3 Network Mode

The CNDC model analyzes communications networks hased on a variety of

satellite and/or terrestrial systems. The pro g ram prompts the user to

specify the network mode for each problem by printin g the followinn:

NETWORK MODES

1 - TERRESTRIAL ONLY

2 - SATELLITE ONLY (WU PHILOSOPHY)

3 - SATELLITE ONLY (SBS PHILOSOPHY)

4 - MIXED TERRESTRIAL/SATELLITE (WU PHILOSOPHY)

5 - MIXED TERRESTRIAL/SATELLITE (SBS PHILOSOPHY)

ENTER NETWORK MODE FOR PROBLEM (1-5)

The user enters a sing le number to indicate the type of connectivity the

model wall consider. The types of the tariff files specified for each

problem must he consistent with the network mode selected.

r

Terrestrial-Only Mode

I

C

The TERRESTRIAL ONLY network mode specifies a problem in which all

L

or (,. connectivity is via terrestrial systems. Up to thirteen terrestrial tariffs

f

based on the philosophy of the prestored AT&T tariff can be included in a

... TERRESTRIAL ONLY analysis.
TSatellite-Only Mode

The SATELLITE ONLY NO PHILOSOPHY or SRS PHILOSOPHY) network modes

specify prohlems in which all connectivity is via satellite systems. Up to

thirteen satellite tariffs can he included in a SATELLITE ONLY analysis. WU

and SBS type user-defined tariffs cannot be mixed within the same problem.

There is no restriction on the types of problems that can be included as

multiple problem executions within the same run.

Mixed Terrestrial/Satellite Mode

The MIXED TERRESTRIAL/SATELLITE network modes specify problems in which

connectivity is via any combination of terrestrial and/or satellite systems.

Exactly one ATT-type terrestrial tariff and one satellite tariff (either

WU-type or SRS-type) can he included in a MIXED TERRESTRIAL/SATELLITE

analysis.

6.2.4 Identifying the Network File to Use

The program prompts the user to specify the naive of the network file to

be used for each prohlem by printing the following:

ENTER THE NAME OF THE NETWORK FILE TO BE USED FOR PROBLEM 1

<CR> TO LIST NETWORK DIRECTORY

If the user enters a single carriage return <CC>, the network directory is

printed as follows:

6-7

L
NETWORK DIRECTORY

NET001 UNUSED

NET002 IN USE

NET003 IN USE

NET004 IN USE

NET005 IN USE

NET006 IN USE

NET007 UNUSED

NET008 UNUSED

NET009 UNUSED

NETOIO UNUSED

NETO11 UNUSED

S NET017 UNUSED

WET013 UNUSED

NET014 UNUSED

NET015 UNUSED

NET016 UNUSED

NETO17 UNUSED

NET018 UNUSED

NET019 UNUSED

NETO20 IN USE

ENTER <CR> TO CONTINUE

When the user enters another carriage return <CR> to continue, the program

again prompts for the name of the network file to use. The user must enter

the name of a file that is listed in the network directory with the IN USE

status.

6.2.5 Identifying the Tariff Files to Use

For each problem within the run, the user must specify the names of the

tariff files to be used as input. If the network. mode specified for the

problem is TERRESTRIAL ONLY or SATELLITE ONLY, the program prompts the user

to enter the number of different tariffs to be used as follows:

it

F ^_

r

6-8
1

HOW MANY TARIFFS ARE TO BE CONSIDERED FOR PROBLFM I? - 114CLUDL DECIMAL P01NT

The iiser must enter a decimal number froin one to thirteen. The program

prompts the user for the file names, one at a timp., as follows:

DITER THE NAME OF THE FILE CONTAINTNG TARIFF I (RUM 1)

<CR> TO us'r TARIFF DIRECTORY

If the user enters a single carriage return <CR>, the tariff directory if

printed as follows:

TARIFF DIRECTORY

TAROO1 ATT

TAR002 ATT

r TAR003 SBS

TAR004 UNUSED

TAR005 UNUSED

TAR006 SBS

TAR007 ATT

TAR008 ATT

TAR009 14U

TAR010 WU

TAR011 SBS

TAR012 SBS

r ^:TER <CR> TO CONTINUE

6-9
I

6-10

I

i

<CR> to continue, the program

The user must enter either the

r TRFSI3S) or the name of a file

user-defined tariff must not

entered must be consistent with

The appropriate tariff types for

When the user enters another carriage return

again prompts for the name of a tariff file.

name of a prestored tariff (TRFrifT, TRFWU, o

that is listed in the tariff directory. The

have an UNUSED status. The type of the file

the network mode s pecified for the problem.

network modes 1, 2, and 3 are as follows:

Network Mode Acceptable Tariff Type

1 - TERRESTRIAL ONLY ATT

2 - SATELLITE ONLY (WU PHILOSOPHY) WU

3 - SATELLITE ONLY (SBS PHILOSOPHY) SBS

When a tariff file name has been entered successfully, the program repeats

the procedure, prompting for the next file name as follows:

ENTER THE NAME OF THE FILE CONTAINING TARIFF 2 (RUN 1)

<CR> TO LIST TARIFF DIRECTORY

The program will continue to prompt for tariff file names until the specified

number of tariffs are input.

If the network mode specified for the problem is MIXED TERRESTRIAL/

SATELLITE, the program first prompts the user to enter the name of the

terrestrial tariff file as follows:

ENTER THE NAME OF THE FILE CONTAINING THE TERRESTRIAL TARIFF FOR RUN 1 --

<CR> TO LIST TARIFF DIRECTORY
r

The user may enter a single carriage return <CR> to view the tariff dire ^:r-•r

as previously described. The user must enter either TRFATT to select the

prestored terrestrial tariff or the name of an ATT-type fiic that is listed

in the tariff directory. The program then prompts the user to enter the name

of a satellite tariff file as follows:

ENTER THE NAME OF THE FILE CONTAINING THE SATELLITE TARIFF FOR RUN 1 --

<CR> TO LIST TARIFF DIRECTORY

The user may again enter a single carriage return <CR> to view the tariff

directory. The user must enter either TRFWU or TRFSBS to select a prestored

satellite tariff, or the name of a file that is listed in the tariff directory. The type of the file entered must be consistent with the network mode

specified for the problem. The appropriate satellite tariff types for network modes 4 and 5 are as follows:

Network Mode Acceptable Satellite Tariff Type

4 - MIXED TERRESTRIAL/SATELLITE (WU WU

PHILOSOPHY)

5 - MIXED TERRESTRIAL/SATELLITE (SBS SBS

PHILOSOPHY

6.2.6 Selecting Output Tables to be Printed

C: I By default, the program will print out all reports for each problem run. 

k..

I The user may choose to suppress the printing of selected output tables by

entering the numbers of the tables to be suppressed in response to the fol -

lowing prompt:

t

r

1

6-11

((
OUTPUT TABLES

1. 1 - INPUT AS OUTPUT

2 - LEAST-COST ROUTES

3 - LEAST-COST NETWORK

4 - OUTPUT NETWORK TOTALS

5 - TARIFF SUMMARY

6 - TRAFFIC TABLE

ENTER THE NUMBERS CORRESPONDING TO OUTPUT TABLES TO BE SUPPRESSED

ONE ENTRY PER LINE -- <CR> TO STOP

The user enters numbers from one to six to indicate the output tables he does

not want printed. When the list of tables to be suppressed has been entered,

the user enters a single carriage return. The program notifies the user that

the creation of the execution control file is complete, and program control

returns to the EXECUTE menu.

6.3 L!STING THE EXECUTION FILE

To list the execution file, the user selects option 2 - LIST EXECUTION

FILE from the EXECUTE menu. After The execution file has been listed, the

program again returns to the EXECUTE menu.

6.4 EXITING THE EXECUTION CONTROL. 7,3SION

To EXIT from the execution control session, the user selects option 3 -

i ' EXIT from the EXECUTE menu. Program control then returns to the INPUT menu.

Only one execution control file can be stored by the program. The file

remains in computer storage until it is replaced by the creation of a new

execution control file.

L:

6-12
(4*f S_ (

CHAPTER 7 - RUNNING THE MODEL AND PRINTING OUTPUT FILES

Once the user has completed network, tariff, and execution control file

construction, the program should return control to the INPUT menu and display

the following:

INPUT MENU

1 - NETWORK CONSTRUCTION

2 - TARIFF CONSTRUCTION

3 - EXECUTION CONTROL

4 - EXIT

SELECT OPTION (1-4)

In order to run the model, the user must first select option 4 - EXIT.

The program will respond by displaying the following prompt:

AN EXECUTION CONTROL FILE WAS CREATED THIS SESSION. DO YOU WANT TO

EXECUTE THE MODEL WITH THE MOST RECENTLY CREATED FILE (Y/N)?

At this point, the user can cause the model to begin executing by entering "Y" in response to the prompt. The program will then use the current

execution control file to determine the problem parameters. The user can

terminate the program without executing by simply entcring "N" in response to

the prompt.

Once the user has caused the model to being execution, the program will

print out the following messages, indicating the completion of each problem:

7-1
r

a,

Y

OUTPUT COMPLETED FOR CASE I OF RUNID

OUTPUT COMPLETED FOR CASE n OF RUNID

OUTPUT GENERATED IN FILE CNOCOUT

(system messages closing up data base)

When all problems have been completed, model execution will be terminated automatically and the system cursor symbol will appear on the screen.

The user can now instruct the computer to print the output files generated

during the run by entering the following command:

PRINT CNDCOUT, ERASE = Y

The output file will then be spooled to the system printer. The system

should then respond by again displaying the cursor symbol. The user should

now LOGOFF the system by entering the following command:

LOGOFF

The user may, however, run CNDC several times during the same session simply

by reentering the command CNDC each time the model is to be run. Each time

1

the model executes, it puts the output in the file called CNDCOUT. If the

output from a previous run hasn't yet been printed, it will be lost (written

over) once CNDC is run again. To avoid this problem, the user may print the

(

output using the command

T'

LISTOUT fname

where fname is any name other than CNDCOUT not currently in use by the user.

LISTOUT copies CNDCOUT into fname, erases CNOCOUT, and prints fname, erasing

fname when it has been printed. In this way, CNDCOUT has been freed fr use

by a subsequent run of the model.

-

r 

I L

7_2

L
CHAPTER 8 - RUNNING THE CNDC MODEL IN BATCH MODE

8.1 OVERVIEW

In the BATCH mode of operation, all commands that direct model execution

are provided in a nonconversational data set. There i.; no direct communication between the system and the user. The commands and data in the input

data file are acted upon by the system in the order in which they are stored.

i

The BATCH mode of the CNDC Model enables the user to perform all the

( same functions as provided in the INTERACTIVE mode. It may be convenient to

i use the BATCH mode to define large network files or to define a number of

network and tariff files simultaneously. Long lists of city mnemonics that

 may be tedious to input interactively can be easily stored on punched cards

or in a disk filr. Changes to large network u^r tariff files may be easier to

perform in BATCH mode. By using combination;: o f the five options defined for

the BATCH mode, the user can (1) create network files, (2) create tariff

files, (3) create an execution control file, (4) execute the model, or (5)

terminate without executing the model. Since no provision is made in BATCH

mode for deleting files, the BATCH mode must be used in conjunction with the

INTERACTIVE mode of the CNDC Model. Network, tariff, and execution control

files are stored in exactly the same way in either the BATCH or INTERACTIVE

modes. The user can maintain his library of tariff and network files and

delete unnecessary files by using the INTERACTIVE mode. The BATCH mode

provides a supplemental capability to the INTERACTIVE mode and is more convenient for manipulating large data sets.

This chapter describes the details of BATCH mode operation of the CNDC

model. The procedures described must be precisely followed to prevent errors

in program execution. If errors are encountered in the input data set, one 

of two possible outcomes results. If the error can be ignored by the program

L! without affecting execution, a warning message or non-fatal error will be

r , printed to the output files and the run will continue. If the error cannot 

Il be ignored, a fatal error message is printed to the output files, and the run

is terminated. [ 

r- 

I

8-1

O 
ORIIN IAI: PAGE IS

OF POOR QUALITY

V

8.2 BATCH MODE JOB CONTROL PARAMETERS r ^

I

BATCII execution of the CNDC Model is controlled by an input data set

that car )e a disk data set or a deck of punched cards. In either form, the

input: data set contains all the commands necessar y to run a task. The BATCH

command format is exactly the same format used in the INTERACTIVE mode. Figure 8-1 shows the overall organization of the input data set.

j LOGOFF

t

PRINT CNDCOUT

i

e

4OR5

• —EXECUTION CONTROL --

- FILE DEFINITION c

— -- TARIFF FILE --

_ DEFINITION - -

2

-:_ — ^ III I

i 

I _

I

i

—NETWORK FILE

DEFINITION

I „ BATRUN

LOGON USERID. TIME-60

[ 

fr

Figure 8-1. Organization of BATCH Input Data Set 
1

r The first card in the data set must be a LOGON command and the last card

must be a LOGOFF command. The TIME parameter must be included in the LOGON

fj command. It is used to determine the batch job partition that the job will

run in. It should be a reasonable estimate of the number of seconds the job

will take to execute. For more details, see section 3.2.

1

The second card shown in figure 8-1 contains the command BATRUN. This

invokes a command that will execute the CNDC Model.

The BATRUN command is followed by groups of cards that instruct the program to perform one or more of the five options. The first card of each

group must contain a single digit from 1 to 5 in column 1 to indicate the

desired option. The five options are as follows:

Option Function

n

1 Create a network file,

C 2 Create a tariff file,

V

3 Create the execution control file,

4 Execute the model, and

r •'

5 Terminate.

` Detailed descriptions of the card images associated with each of these

P ^' options are contained in section 8.2. The final option card must contain

f either 4 or 5 to execute or terminate the model.

t'

The next to the last card shown in figure 8-1 contains the command PRINT

f CNDCOUT. This command causes the output of the model to be printed and

should only be included if an option 4 was specified to execute the model.

It is possible to submit a batch run for the purpose of creating network,

tariff, and/or execution control files without executing the model. In this

rr case, the final option card would contain a 5 to terminate the program and

the PRINT CNDCOUT command would be omitted. Whenever a network or tariff

file is successfully created, the updated directory and the newly created

r` file are printed to an output data set that is automatically spooled to the 

printer.

8-3
8-4

V8.3 CREATING AND ORGANIZING BATCH INPUT FILES

The overall organization of the CNDC batch input data set is shown in

figure 8-1. The data set is pictured as a deck of punched cards, but it can

also be a cataloged data set residing on disk with each card image corresponding to one line of the data set. The input data set can be constructed

from a terminal by using one of the text editors or it can he punched on

cards and submitted to the system operator for entry into the system via the

card reader. A data set residing on disk can be converted to a card deck and

a card deck can be converted to a disk data set by following the appropriate

procedures. The user is referred to the IBM Time Sharing System Command

1

System User's Guide and the Lewis CSUG Supplement for further information

i about data set manipulation.

The job control parameters that are included in the input data set have

been described in section 8.1. The BATRUN command is followed by option

codes that define the functions to be performed by the model along with the

data associated with each option specified. Option codes 4 and 5 indicate

execution and termination of the model, respectively, and are not accompanied

by any other data inputs. Option codes 1, 2, and 3 indicate that a network,

tariff, or execution control file is to he created. Each of these options is

followed by the appropriate data defining the file.

The content of the input data file varies according to the options exercised in the run. Figures 8-2, 8 -3, and 8-4 &how the three possible BATCH

data set organizations for a network file definition. The organization used

depends on the network option specified for selecting prestored cities. Figures 8-5, 8-6, and 8-7 show the organization of the data sets required for

three types of tariff file definition. figures 8 -8 and 8-9 show two possible

data set organizations for an execution control file definition. The organization of the data for each network problem depends on the network mode

specified.
f

1 ,,,,

F

OOR 1

TRAFFIC TABLE

ORlIGANAL PAGE 13 SPOOL OPTION

OF POOR QUALITY

BLANK CARD

-- UP TO 250 ENTRIES.

FROM CITY, TO CITY,

tl ADDITIONAL TRAFFIC

^

BLANK CARD

J

r

iE

^.

1 UP TO 250 ENTRIES -.-^I1

ADDITIONAL CITY CODE. I

VERTICAL AND HORIZONTAL .^

COORDINATES

LV ^.

TRAFFIC VOLUME FOR

_ PRESTORED NODES

1

NETWORK

R fl OPTION ALL

r

fNETWORK

FILE NAME 'r

f:

OPTION CODE FOR

NETWORK FILE

DEFINITION

S ^,

S

I

t

Figure 8-2. BATCH Mode Network File Definition with Option 1-ALL

i

(

i

L

8-5
ORIGINAL PAGE 13

OF POOR QUALITY TRAFFIC TABLE

SPOOL OPTION

t_ 

III.ANK 1'!,1111

UP TO 250 ENTER

FROM CITY. TO CITY.

ADDITIONAL TRAFFIC

0 33

A

Ey

ta,

:a

i..

i+

tf'

F

M

1

i

4

Figure 8-3. BATCH Mode Network File Definition with Option 2 - ALL EXCEPT

a or Option 3 - ONLY
1

^W

^a

1 ^.

i

F

i.

F

3

I_

j

))I `

1

I

CODE

NETWORK

FILE NAME

p^

OF POOR Q ALIYY

OO

TRAFFIC TABLE

SPOOL OPTION

BLANK CARD

X UP TO 2SBENIRIES

FROM CITY. TO CITY.

ADDITIONAL TRAFFIC

BLANK CARD

i UP TO ]50 ENTlIES=

ADDITIONAL CITY CODE.

VERTICAL AND HORIZONTAL

COORDINATES

TRAFFIC VOLUME FOR

PRESTORED NODES

/ PERCENT TO USE

I/ IN SELECTING

PRESTORED CITIES

4 NETWORK

OPTION PERCENT

Figure8-4. BATCH Mode Network File Definition with Option 4 -PERCENT

8-7

Y ^
ORIVINWL' P> v11^

OF POOR QUALITY

CURRENTLY 9 ENTRIES

MILEAGE CHARGES

FOR SCHEDULES

7- CURRENTLY 9 ENTRIE

MILEAGE CHARGES

FOR SCHEDULE 

; CURRENTLY 9 ENTRIEE

MILEAGE CHARGES

FOR SCHEDULE i

BLANK CARD

ADDITIONAL ENTRIES

-

CITY CODE,

LISTED CITY CH/ 'Uli tl

I

I t!

ATT-TYPE

TARIFF

TARIFF FILE NAME

OPTION CODE FOR

TARIFF FILE

DEFINITION

Figure 8-5. BATCH Mode ATT-Type Tariff File Definition

8-8
I

a

°t

e

{ I

1

r—

I

rte.

C..

h n

C

t {

1

^1 I

$j

I

^.e

f

!

f

(ywt3Si 'e',v •^^9f li

OF POOR 4

ADDI OQUAL ERTYIjES

CITV,CITY, CATEGORY

SATELLITE ACCESS

CITY PAIR ADJUSTMENTS i f

2 WU-TYPE

TARIFF

TARIFF FILE NAME

1 OPTION CODE FOR

TARIFF FILE

DEFINITION

SHORT HAUL

CHANNELCHARGES

MEDIUM HAUL

CHANNEL CHARGES

LONG HAUL

CHANNEL CHARGES

BLANK CAND

c9

e'Y

i

'el

Figure 8-6. BATCH Mode WU-Type Tariff File Definition

8-9
01WOUNAL C'::1 ? {S

OF POOR QUALITY

2 OPTION CODE FOR

DEFINE

DEFINITION

1

I

Figure 8-7. BATCH Mode SBS-Type Tariff File Definition

l_-. 

8-10
' ^ 

of4100NAL PAGE {S

OF POOR QUALITY BLANK CARD

•ri.

der,

_

—A

ENTRIES_._

:- OUTPUT TABLC

,^. P=Q TC SUPPRESS ,II

` 4P

00v0O

M ^ NUMBER OF ENTRIES -- ch AS SPECIFIED

Qkol TARIFF FILES

P

1P

0 = -

^^ 00 jai dd NUMBER OF TARIFFS

11"

1

NETWORK FILE

a i u

1, z,OR3

\ NETWORK MODE

t

NUMBER OF

RESTARTS

v

. 3 OPTION CODE FOR

EXECUTION CONTROL

FILE DEFINITION

4

L Figure 8-8. BATCH Mode Execution Control File Definition with Network 

I f Mode 1, 2, or 3

C 5-11
I

ONV21 AL PAGE 19

OF POOR QUALITY

^ 20

PV Zry.

W{% q0 

Q

^P 3

X04

^^ web PQ

2~

BLANK CARD

d

i L ADDITIONAL ENTRIES'

OUTPUT TABLE

TO SUPPRESS

SATELLITE

TARIFF FILE ._

TERRESTRIAL

TARIFF FILE

FWORK

i

1

4

I

( Figure 8-9. BATCH Mode Execution Control File Definition with Network I Mode 4 or 5

8-12
Tables 8-1, 8-2, and 8-3 provide lists of all data items that can appear

in network, tariff, and execution control file definitions ? l ong with the

FORTRAN formats used, the card columns in which the data musc appear, and the

range of acceptable values.

j

8.4 SUBt7ITTING BATCH RUNS FOR EXECUTION

I

The method of submitting a batch run for execution depends on the form

of the input data set. A batch run that is defined by a deck of punched

cards must be submitted to the system operator to be read into the system via

the high speed card reader. The card input will be handled by a system task

that is provided for that purpose. When the data set is read in, it defines

a nonconversational task that is executed as soon as space is available. In

this case, the user has little or no involvement.

^T A batch run that is defined by a cataloged data set residing on disk is

initiated by issuing the EXECU"E command. The command may be entered from a

terminal as part of a conversational task, or given within the input data set

of nonconversational task. The format of the command is EXECUTE DSNAME where a

DSNAME is the name of the cataloged input dz)ta set defining the run. The

EXECUTE command requests creation of a nonconversational task that is independent of the user's current tasks.

Following is an example of submitting a batch run from a data set. F

Suppose the user wishes to run CNDC requesting option 4, execute model using

current definition in the execution control file. First, a data set must be

created using a text editor. This data set may be organized VI or VS. The

data set created for this example, named BATCHER^is defined below:

I:OGON USERID,TIME=24000,PACK=A

TIME 420

UNLOADA

BATRUN

4

LOGOFF r

f

8-13
I

To submit this batch ,ioh, enter the cLiamand

EXECUTE BATCHER

The system will respond with

BSN=nnnn

where nnnn is the number by which this batch ,fob is known to the system. The

output will be written into SYSOUT.BSNnnnn and automatically printed.

Regardless of which method is used to initiate the batch run, the user's

task is assigned a four-digit decimal number called the batch sequence number

(BSN). This number identifies the user's nonconversationai task. The status

of the task can be checked by issuing the TSS command JOBS to display the

user's batch work queue. When the BSN assigned to the task no longer appears

in the queue, the task has been completed. A previously initiated nonconversational task can be deleted from the user's batch work queue b y issuing the

i

TSS command CANCEL followed by the batch sequence number assigned to the

task. For more information about TSS commands, the user is referred to the

IBM TSS Command System User's Guide and the Lewis CSUG Supplement.

8-14
S

W

TABLE 8-1. DATA ITEM DESCRIPTION FOR NETWORK FILE DEFINITION

' ITEM FORTRAN FORMAT CARD COLUMNS RANGE OF ACCEPTABLE VALUES

Network file name A6 1-6 NET001-NET020

1 Network option I1 1 1-4

' Prestored city A4 1-4 Entries in Appendix A

mnemonic (table of prestored codes)

y Percent to use in F6.2 1-6 0.0-100.0.

selecting pre- (include decimal point)

stored cities by

the PERCENT option

;. ) Traffic volume for F10.0 1-10 0.0-2147483647.

prestored nodes (include decimal point)

' Additional city A4 1-4 Any four letter codes

code except those listed in

Appendix A

' Vertical coordi- I4 6-9 0001-9999

nate (no decimal point)

Horizontal coordi- I4 11-14 0001-9999

;; d

nate (no decimal point)

From city code A4 1-4 AAAA-ZZZZ

(must be a network node)

To city. code A4 6-9 AAAA-7ZZZ

(must be a network node)

{

Additional traffic F10.0 11-20 0.0-2147483647.

(include decimal point)

Traffic table I1 1 0 or 1 (no decimal point)

spool option 0 = No, 1 = Yes

T

t

^'

sr 

r

8-15
^• 

TABLE 8 - 2. DATA ITEM DESCRIPTION FOR TARIFF FILE DEFINITION

ITEM FORTRAN FORMAT CARD COLUMNS RANGE OF ACCEPTABLE VALUES

Tariff file name A6 1-6 TAR001-TAR012, TRFATT,

TRFWU, or TRFSBS

File type I1 1 1-3

ATT type:

City code for A4 1-4 AAAA-ZZZZ

listed city

change

Insert/delete Al 6 +1 or -1

code for listed (no decimal point)

city change

Mileage charges F12.2 1-12 0.0 - 999999999999.

i

Sr i

(include decimal point)

^

Rie

Y

W

`y U type: 

Satellite access A4 1-4 AAAA-ZZZZ

from city code

Satellite access A4 6-9 AAAA-ZZZZ

to city code

Satellite access I1 11 0-3

I`I city pair cate- (no decimal point)

.. t . gory

Channel charges F12.2 1-12 0.0 - 999999999999.

f

(include decimal point)

G

SBS type:

NAC location A4 1-4 AAAA-ZZZZ

NAC charges F12.2 1-12 0.0 - 999999999999.

(include decimal point)

f

e SCU charge F12.2 1-12 0.0 - 999999999999.

(include decimal point)

FTU charge F12.2 1-12 0.0 — 999999999999.

(include decimal point)

Minimum CAU F1.2.2 1-12 0.0 - 999999999999.

ti charge (include decimal point)

( Incremental CAU F12.2 1-12 0.0 - 999999999999.

charges (include decimal point)

C

r

F

1

8-16

tI
8-17

TABLE. 8-3. DATA ITEM DESCRIPTION FOR EXECUTION CONTROL FILE DEFINITION

ITEM FORTRAN FORMAT CARD COLUMNS RANGE OF ACCEPTABLE VALUES

Run IU A8 1-8 Any 8 characters

Number of restarts F4.2 1-4 1. - 10.

!include decimal point)

'C Network mode I1 1 1 - 5

(no decimal point)

} Network file name A6 1-6 NET001-NET020

Number of tariffs F4.2 1-4 1. - 13.

(include decimal point)

Tariff file name A6 1-6 TAR001-TAR012, TRFATT,

TRFWU, TAFSBS

^. Table to suppress I1 1 1-5

(no dec i mal point)
CHAPTER 9 - INTERPRETATION OF CNDf. MODEL OUTPUTS

9.1 OVERVIEW

Output is generated by the CNDC Model upon completion of each individual

problem within a run. Output consists of six reports or tables. By default,

the program will generate all six output reports. Any of the reports can be

suppressed by user request. These reports include:

Table 1.

Table 2.

Table 3.

Table 4.

Table 5.

Table 6.

Input as Output,

Least-Cost Routes,

Least-Cost Network,

Output Network Totals,

Tariff Summary, and

Traffic Table.

The contents of the six output reports are described in the following

sections.

9.2 INPUT AS OUTPUT

The user has the option of having the input data set for each problem

printed as the first output report. This report is printed out by default,

unless the user explicitly suppresses it via execution control file inputs.

Specifically, TABLE 1 contains the following types of information, which

appear annotated on figure 9-1:

1. Indication of problem type (terrestrial only, satellite only,

etc.),

2. Listing of network file,

3. Total traffic level for the network,
4. List of tariff files, and

S. Listing of user input NAC cities (mixed SBS problems only).
ORIGINAL PAGE 18

OF POOR QUALITY

Cl)

xMx

N

O

Mx% 1- MMM O H

M % M

O^

x M M

MMM

N

V^

L

M Mx

W

H (n

M x xO

AIU

M

x xxx

Z 1 W

7

MM x M M

q I¢V

x

2

M M M M

X

P I U

H

%

M x M :Y.

H 1 O

m

xM

xx

xxx M xx

E IwI>

>O

:K

x M x K iA 1 'O' o

%

M

N U' 160

O

M

x

xxx xx M "L 1 ¢

O ..+

x

M xMx

N

H Iz

V

OC

i

x

x *MW

H

3 w I W

o

a

M

M x M% O E 1 0

S

o^

x

M

M

M

Ja_ 1 ^'

VN ' x x % * q V 1 0 W I x M x l M X LL Y 1 1 w i x .< x :KdM 31 W HI z U'Z 1 M H O x N x MZM r>] 2 U 1 4 Z aE O. M H o] x xHx N 1- i OY^d I VI x v x M M I¢ J-I Z

V W x O x x x Z N I 1 0 1 ¢O O

^-

x

X

W

xM

Mr

Z I zO . x N M xH:K K H I¢ JHWiLw

==

Z

ZC

M ut¢

WW

x

M

M

¢ 1 NWHzJ= . a

x [q

V

X

% x W 

M LL

H 1 10.1

-{ "J H

O

M

N

H :A MJM

O

z 1 EOOF-0f^ I L'wc7 +

W

>

t

M A: xw :Y.O I H^VHZ^002 4'

x

x M¢;Y. rl

V 1 wH<[O«Q?-<H

O

O '!

x

x M 1- x I S Y- V C' to J S Fx x M M .-I 16J HHtrIN^HN N^

x

M

M

x

W

X d' M x x M x m H O i x x W. 0 W fQ W M x x M d W LL W :K :K x x % J x CL x xx

% :K X x:K %H

LL

JW

M

M M K %

:KM

M

:K xxx Mx%

O

WI CI V:LH:_VZZfLO J

M

x MM:K .j OI.".. .:HW O<L lL2<L

V

x

r

x

x x% F- V I aGIV

g J^:^LL

-r'S

H

x

x x x;K

W LL

iI! x M K2 LL % x x 4 QJ KX OL

x x 

X

%

x

;K X.9

I-^

MM x LL

fICC

r

,I

9-3
OgIGWAL PACE M

DOOR QUALITY

CM

O

N

1 N N N N N V1 N N I h N N M VI N N Vf 1 VI N

I W W W W W W W W I W W W W W W W W I W d

1 J J J J J J J J I J J J J J J J J i J L I ly M r

H H H H H 1 ^+ H H H H N H H 1 H

p I r U1 Vl o e o O o I r ul 1A 0 0 0 0 o I .-1 If ; .-f N v .o N •-I N ^t v'l q

j

' ll I

r o

r

1

I

r o

H I

_n.

LL 1 1 1 J

a

H

p! I

{

L"WC!WcNW W6! W

p!

W

0! K

W Wp! 1 p: L" N_ 0! C' G! C: C.' I C! O 1 W W W W W W W W I W

I1 K 1 > 7 > > > > > 9 1 > > 5 -1 > I > V1

H I O O O O O O O O I O O O O O O o O 1 O 10

p F- I W W W W W W W W 1 W W W W I?1 W W W j W 1-• 1 J J J J J -! J J I J J J J J J J J 1 J 7

Q CL I MI H M 1.+ H I-1 M H 1 H r H LI H .-1 H H I Iti OW q

a

1

£ £ .'= i- c £ E £ I £

1

£ T £ £ E 1

!

£

'- N W 1 T S S S S T T S I S S S T 1 S I

7 0_' W I V V U U U U V U W 1 U U V V V V U U W I U

O U I ¢ K Q ¢ K K K K O I K K ¢ ¢ C Q O I ¢ 0

N /- p! 1 IL W W W W W W W W

d 1 W W W W W W W W K 1 W p

LL N ¢ I T I ¢ I S1

LL W 0 1 0! 0! K K K K 1 K d R. K S I K ^

H V I 0

O O O O

0

O O O O 0U 1 O O

a

O O O O

o 0

O O U I O

p! d I LL LL LL LL LL W LL LL I I.J. W LL LL LL W LL LL I LL

1- 0 •p N N N N .1' y I n n P 0 In N S 00 I N ~

H I Ill y P P P P 1l1 I M

r

a

H I N N r H .^ .-1 0 0 1 v v N .-I r H O e 1 •0 1- i N N N N N N N N 1 N N N N N N N N I N

x LL O

K I + + + + + t + h I t + + ? + + + + 1 } r

1- I I 1 y

V_ !W N N N N N N N N N N N N N N I O O y y Op y M M M M M M M M M M i M M M j^ LL I Ill 111 C'J y.t .fhhHH Yl It7PNPP IOOhhV'TOOyWyyOOy y tOW I.TVM (^

K 1 MMPPrH Vl my lg ooNN y 41 I Nulrr•O .p PP y y nh•0 .ONN 1 x•0111 Q i nnoOf•?M1A l/lyyNNllI YIPP 1 nn v.NN N .. OOVVPP I nn.t /- I rrr-^HH.w r..1 NNN NO O I HrrHNNNN MMMMrr i -1 I r.^I I rr I ^. ^^ I 1 1 1 N N N N N N N N N N N N N N N N I N N N N N N N N N N N N N N N N 1 N N N ^

r N M (n

1 rvV1v 1/1P OPOO.OPOPOO 1 .1.1'Il1P00. O POPO POO I -IV In { WW 1 rHNNMVk1.On00POP00 WW 1 rH tv

N

N MVI/l .G ntOPOPeO WW Hr t' d{ ...IU I I

it OQ 1 owl 1 I 1 1 I 1

r.y 1

7¢ 1 owl 1 I 1 1 1 1 1

rr =¢l MW 1 1 W-, I N W .0 r H .-! r 0! W.J I K W-, I N

_ 2 H 1 r-I N v .o M o W ="I r N .f .O c0 o W ="I 

vl I O an 1 O N I

LL.

L

9-4
cow0

C7NNL

_a0N

c0aCI OaN7

_a0

QI

.naE

(nr

aj

OF II POR QUALITY I Y N ^^

tr G C W V U r

0 0

W U

1 In 0

Ulm 1•••r M C

N

NN

NN

N

N W,^-,

N j

4J

WW

WWWW

r

JHJN

`J

JHJJJ

G

O I W W

H

NH^

J

EE

^

N

N

o

E0

0

c.

'c0

Eo

CCC HLL

LLU.

J

Oooe oo^0 II

oo

O 1 00 rti N ^t V q O O }S CL 1 G¢ r

.-Io C•C

<

GN 000e 1 VV

.+O r G In o vi In

Iw

K

O con ut

q

1

K C'

W NW

UU

Ww

wW

WwW

Ww

w

l'J tJW

r

C

^.NN

.

I V V

.-r •-r I <<

U

>

0

`>> 6}

<

NC 1 WW

¢

0

0op

o

o c)z 1 J W qLL NNNIDW 1 C

w

WW

WW

WW P2 WLL 1 C

JJ

00CO

J

J

JJJ Kr •0.' 1 LLLL W

")

H

H

HHH

H

H O L .• .¢ I .4

EE

E

EEEE r¢ •S I oo

L

to Nr .0 I =oo

S=

S

S ^'

S 2} 1 G

}

VV

U

U

UU

V ^2

w

^N I Uo41 LL

¢a¢

aG

GG - K aH_ I P.D

H

www

ww

ww oz I S

V

-, W h I V

W

aOKO

0.' 0.' C'

K 0.'

J

S • W I¢ 0.

O

OOOO

O HC' ••

•

O I W

N LL LL LL LL LL LL LL LL O .C'. I

co

M

MH ttl t`

q WU HLL .= 1 O N N

J

^t

OO

MPP

N S O

N

V I w}}

H rJ N W

N

vM

N .•IoO wr • O l o00

3

NN

NN

N

N

N

N N¢ w W W C I O mm

IL W U' V' V' U I •

••

K

H

K w I uloo JY

r^

r ^"^ I Nh

O

MMM UUU.::

1 vn

K gg tJ qqq W g t0 a0 CO U.¢ LLH H 1 •-IN 0. r1HHll^M ti.•^MMMMMM VU

HK U»

^ 1

d 0. G V r H I W

l,l000O.-I•-1h h.D •DPP

Q Gp ZNLLE I NNN

S .ONN g t'I Q'e-<D q N NPP h . -, NNNCJM MM rn ^t .tNN J rC 1

r1ti

H 0. I G NNN NN NNNNNNNN V I pOS ui w 2 4 1 0 0 0 r U1 ^ l(^PO POP OPOPOO M4 1 000 N NIg vL'1 •Dnty Q! I L

r-I P O O lnfo W I •--I rn M .•9 N LL a: (D I I 1 I I I I LLeJ c l 00 m .^ .-I H H .-1 N I h h G' .•I N .o q o WlL K I W o r 1 » o aU

9-5
1

d

r

1 9.3 LEAST-COST ROUTE SOLUTION

Output table 2 describes the facilities and circuits determined to

" supply communication services between each pair of cities in the network at

the lowest tariffed cost. The traffic on each of the least-cost rocites is

provided in the form of link summaries. The contents of TABLE 2 fir a single

city pair are shown in figure 9-2. The outputs are repeated for all unique

city pairs in the network. The numbered annotations on figure 9-2 are

described as follows:

1. Unique city pair. The field identifies the unique city pair by

I printing the four-character city codes of the originating and

l terminating cities.

2. Least-cost route. This output field identifies the nodes in the

least-cost route for the city pair. All nodes are referenced by

d the corresponding four-character city code.

3. Total circuit mileage. The total circuit mileage on the least-cost

route is calculated by summing the airline mileages over the route.

This number is the sum of the individual link airline mileages

listed in the Link Summary.

4. Total cost of circuits. The total circuit cost in dollars is calculated by summing the cost of each link on the least-cost route.

The number is the sum of the costs associated with the individual

links listed in the Link Summary.

The remaining entries in TABLE 2 for a given city pair are included

in a tabular summary that itemizes information about the individual

links that comprise the least-cost route. Two link summaries are

provided for each directional link between the cities. The upper

link lists traffic inclusive of other network or "pass-through"

traffic. The lower link lists traffic exclusive of pass-through

traffic over the link.

9-5

r
The following information appears in both Link Summaries and is

annotated on figure 9-2.

NOTE: The upper link summary is inclusive of traffic between only

those cities included on the least-cost route.

5. Link. The entries in the first column of a Link Summary identify

the character codes of the service nodes defining each link in the

least-cost route.

6. Total airline mileage. This column contains the airline mileage on

each link as calculated from the vertical and horizontal coordinates of the corresponding service nodes.

7. Traffic volume. The traffic volume on each link includes all voice

circuit requirements between nodes.

8. Facility size. The traffic requirement on each link is used to

determine the number of base groups, super groups, master groups, i

and jumbo groups necessary to handle the volume on the link. A

base group consists of 12 4-kHz channels, a super group consists of

60 4-kHz channels, a master group consists of 600 4-kHz channels,

and a jumbo group consists of 3,600 4-kHz channels.

1

9. Cost per circuit. This column contains the minimum tariffed cost

in dollars of a single circuit providing voice communication

between the respective service nodes.

10. Total cost of circuits. This column contains the total tariffed

p ost in dollars for each link. Th: total cost is the product of

I the cost of an individual circu' f (item 9) multiplied by the link

traffic volume in voice circuits (item 7).

L:

9-7

F

r
9-8

« 11. Tariff. This column contains the name associAted with the tariff

file yielding the lowest cost per circuit for each link.

12. Service. This field contains the word "TERRESTRIAL" or the word

"SATELLITE" to reflect the type of service represented by the

4 tariff used to supply circuits on each link.

D
~, ,.---~ ~ --. ---, 

----

... 

I 

... 

TAglE Z 

NM;Y - LoeA CD 

TIlE LEAST-COST ROUTE FROM NANY TO LOCA IS CD 

IMNY-NENY-LOCA 

TIlE TOTAL CIRcun rtILEAGE FROM NANY TO LOCA IS 

THE TOUL COST OF CIRCUITS FROM NANY TO LOCA IS ~ 

2463 MILES. CD 

4327542.2 CD 

LINK SUr.l'lARY 

0---- -------

T~L I TRillIC 1-------· ---~~::~:~~-~:~~-----------I COS~EP. TOTA~OST I ® 

AlP-LIRE VOlUNE ON I JUMBO I m.STER I SUPE?. I BASE I CIRCUIT OF CIRCUITS I T~.:

rUlEAGE LI'NK eve's), GROUPS I GROUPS I G?OUPS , GROUPS I (COltJ'RS,.) (DOll;"RS) I 

® 

LItlK 

-----------------------------------------------------------------------------~ ... -----------------------------

NANY-NENy I 20 I 21560 5 5 9 21s 120.62 $ 26!1C567.20!Ti'F

UENY-lOCA' 2443 I 1867 0 3 1 1 1$ 925.00 $ 1726~75.~ol tr:F

I I 

LIt:, sumtr.p.y 

CD CD 0 CD ® ® I FACILITY SIZE I ® 

TOTAL TRAFFIC 1-----------------------------------1 COST PER TOTAl cnST 

LINK AIRLlI:E VOLUME 011 I JUMBO I rlAS TEP. I surER I Bf.SE I c rRr:u IT or crr.cU!";1 i:,~ 

MILEAGE LINK (ve'S)1 G~OUPS I GROUPS I GROUPS I GROUrs I (D2LLAF:S) (DUlL.'-~:;) 

I I I I I I 

tlArtY-NEtlY 20 725 o I 1 I 2 I 1 It 1::!{).62 f $ ~744~.5~lt~~~

1 I I ! I I "ENY-LOCA 2443 725 o I 2 I 1 IS 925.00 I $ 670'j25.~~1 rr.r

I I I I I I 

Figure 9-2. Table 2 Output Report - Least Cost Routes 

~'-' ,+" •• ---' 
a

9.4 LEAST-COST NETWORK SOLUTION

TABLE 3 describes the least-cost routes between all city pairs, indicating on each link of the routes the medium that is necessary to satisfy the

traffic requirements of the entire network. The contents of TABLE 3 for a

single city pair is shown in figure 9-3. The outputs are repeated for all

unique city pairs in the network. The annotated numbers are associated with

the following descriptions:

1. Unique city pair. This field identifies the unique city pair by

printing the four-character city codes of the originating and

terminating cities.

2. Least-cost route. This output field identifies the nodes in the

least-cost route for the city pair. All nodes are referenced by

the corresponding four-character city code.

The remaining entries in TABLE 3 for a g 4 ven city pair are included

lin a tabular summary that itemizes information about the individual

tt

links that comprise the least-cost route.

3. Link. The entries in the first column of a Link Summary identify

the character codes of the service nodes defining each link in the

east-cost route.

4. Traffic volume. This field contains the total volume of network

traffic that traverses each link in the least-cost network

expressed as a number of voice circuits. If the least-cost route

connecting any pair of cities in the network includes the link, the

corresponding directional traffic volume between those cities is

included in the total network traffic volume in the link.

5. Facility size. The total network traffic requirement on each link

is used to determine the number of base groups, super groups,

master groups, and Jumbo groups necessary to handle the volume on

the link.
6. Cost per circuit. This column contains the minimum tariffed cost

in dollars of a :single circuit providing voice communication

i

between the respective service nodes.

7. Total cost of circuits. This column contains the total tariffed

cost in dollars for each link. The total cost is the product of

the cost of an individual circuit (item 6) multiplied by the total

network traffic volume on the link in voice circuits (item 4).

8. Tariff. This column contains the name associated with the file

containing the tariff that was determined to yield the lowest cost

per circuit for each link.

9. Service. This field contains the word "TERRESTRIAL" or the word

"SATELLITE" to reflect the type of service represented by the

tariff used to supply circuits on each link.

9-11
ONM4VOO>GzO

LL

VO

W

J

^>

_

O

Z

O

CW

f

21

1IN>

161

O2 U I u a Iol I z

I J 1

N I I YI

H I I I 1 I W I > 1

WJ

J I "L I O IGI 6 1'LI

W=

H 1 I N

N:

I^t

t*r

F1

f,

ji4

{(

n'if

$F`c

r

ORIGMAL PAGE M

OF POOR QUALITY

J

lJw

HL^ J

w w t 1

.1

1 L'•

a N

n o

a 

o

^ N

n n

T P

^ Nn

V 

N

WuN

w rcwm

LL

OWw MG>N

N M N OOh VVC r p:J JN J

Fu on

OLL^r

1-O i

I an N I111

1 N 

o K N I N o W 1-fl I dMG I O V1

OHOJ I N P NIYO I

>I °u uQ

rc 1

1

F 1 I N N

^ 1

I

O I

1I N I 1 N I N N

1 W a I 1L I 1 N^ 1

M 1 I WK 1

JI

I VI I I 1 I

W 1 K 1 1 n ^

ry

I W ^ 1

I LL O 1 In I oa 1

(^^> I O V I VM 1 1 J I KYl t H H •11 wal V 1 » 1

4 1 N 0 1

LLICtZ'JI

1 __ 1 1 1 ^^ 1 I 1 YI 1 ^O O I OLL 1

1 £ O 1

1 O N I 1'101

^I^ 1

W ^ 1 Y£YI I ao- I v n O.JU I n N

OW^vI N °O> I V t^

^ 2VY1 M S 1

JLL N t

GLLJI

> G I

9- OP 0 1 HO 1I

I > G

1V

I W O

Y I 2 J

ON 1 ; 

> J I •- 2

I G W

I 2 2 11

YO3r2NOUJLQGN

irC

_a0aRdQm

co

co

d)

^I 9-12
I

9.5 NETWORK TOTALS

TABLE 4 summarizes least-cost routing totals for the entire least-cost

network including airline mileage, number of circuits, and circuit costs. A

typical output table is shown in figure 9-e. The annotated numbers are

associated with the following descriptions:

l 1. Total circuit mileage. The total terrestrial circuit mileage, the

total satellite circuit mileage, and the combined total circuit

mileage are printed. The mileage between each pair of cities is

included in the appropriate satellite or terrestrial mileage total

depending on the service betvieen the cities. The total terrestrial

and satellite circuit mileages sum to the combined total circuit

mileage.

2. Total voice circuits. The total number of terrestrial voice circuits, the total number of satellite voice circuits, and the combined total number of voice circuits are printed. The number of

voice circuits determined to be required to handle the network

traffic on each link of the least-cost network is added to the

appropriate total depending on the service used to provide voice

communication between the cities. The total number of terrestrial

and satellite voice circuits sum to the combined total.

3. Cost. The total cost of all the terrestrial circuits, satellite

circuits, and combined circuits are printed. The total cost of

circuits on each link is added to the appropriate total (satellite

or terrestrial) depending on the service between the cities. The

total cost of terrestrial and satellite circuits sum to the combined total cost of all circuits. For problems involving SBS-type

tariffs, the following output is also included in TABLE 4:

4. Summary of satellite earth station equipment. A summary of all SBS

earth station equipment is given, broken down into NACs, SCUs,

FTUs, and CAUs.
r

i

r:: I

x

r

1

5. Summary of optimization results. The results of each iteration of

the cost optimization algorithm are printed. The program prints

the total number of NACs, the total number of separate MAC locations (there may be multiple NACs at a given location), and the

total system cost.

6. SBS MAC cities. Those cities which were determined to be cost

effective for MAC placement are printed out by the program.
N N N N_ N N N N

O O O O U O D U H H H H H H H H

h1-h hl'-hl'•h

U U U U U U U V 0 0 0 0 0 0 U U J J J J J J J J

C.IUUUV000

N OMlf lfl •p nOpP 0J O J

N OLLN

QF- 1 00000000

N N I o 0 0 o . o 0 0

tl HU I •ON%At .

O %e%

H 1 PIII ^Y'%P^<f% H N^ I %HOMwPC]fJ

4 ZW I NHMNPPnct K Oh 1 H%%%%C')Nn W HN I %O nlfl%•OOv h H} I HM%•SNCOrJ H QN I C'JN <tv ^f A?<f r•I U I % O J I ,x 1F• I

U O I

S Lh I fJ Z N N N N N N N N •O IL0

d O

Zh 0.'N I W U I h W 4 I

7 E Z 1 W O I 3 ZLL I orn At 111 .on %P O 1 N S I UN owl < I_ L W 1 7tl wnI H I

II_h hZ 1 O 4 <Z 1 U

K U 1- W J N

W OU U ^a2 2 Ja

h P H U 1. W 1- J

W S N hN

03h N xH

H 7

ao

off U h J ^ < J

QOw

X_1

H 

O

M H ^ N

NATOP HNIf1Pv P%

N N N N

^Uh<_

N LL U

LLLL LLLL O O O O

W W W W W !D 4'I W EPEE

Z Z Z Z

O}zKU NOJJ

O UO

N ^. W

fY.

N 0.

O C HLU

O O J

U W <2P Hw

wvSh JU

Xa

X 

N

X R1

s' O v' YL

r 

O

rX' 3

Y x.Z>t: I X «

x 

O

Y QI r. CC :1 « A 7a v 7

r 

r.

O

X Q a d

:r' F r

v N

c EG

i. M x

x ^11

y O7 x ^ x `

x 01

LL

4UOJ

aY

}wS

- _ is 

TI

ORIGINAL PAGE [y

OF POOR QUALITY

N N N ' HI-H 000 M H H O O O C N N N > > > W W W UVCJ JJJ Y: ^:K bNo If1M%

OEL'EOVUV HHH HHH .^.ON ^ wPAT

InNn AT <f ap Af N.0 NPto O P P P P% •O M% , 111 n N 1f1 P u1 •••r N M qp 00.0

n n .00M 

.<N

*'A* U/NN ***

* * *

* * * le * * w

rc

H

** Owhe

Z

N*IN% 13- oa

wS

••.

*J*

• W=io

•

• IL ^.. *4* ZH ^a N

*/-* WH

O 1.: *O* HZW IL CY r * h * : W K '

0h OX *?4* O 0N1- -•G:M Z 7.1 be loo )-04: O HCL O! hV0 WHO ly *_;* WOO N I V zl- * P: * Z : 3 <HI WF- <{ *W* 1--h WNH h=w •r

1... *Z* 1- Ww J<N N Z

N

** NZZ WK 01- X1-* O WJW U1NH

S li X1* 1 0 HW !-VO w

E *1-* 1-00 SW N 1 U

<

*

X N U U Z H S K h 1

w

* O* K 1 1 H H W N H

iK :*If .JNN NHZ JW<H I * •* K< 1- H WJW Y' *At* WWW H0 T J J

^^

*

* S...IJ

W

J

*W*

h VH1- SW

W *_l* W W K O H Z H S 1.

l.. 1 *W* ZSS 1-IVO II` W. H1-/- VA:U

ZN 'k *h* Ha N..Z * * WZZ WUH I- H LL * * O H H V U Ho O

I'

*

* <W HW D1-0

r

*** w%w OVW UHh }. * * * J<0 >HU OC=H

I *** H W Q O H H U m

Q

* * * EJw

J>0 cia cr

E

**X. HJ K > HW

L *** 1••EH HW JUH 71 ** :i: H 1' h LL < U N I *** ^H 1•1­10 HW * * * UHI- NJ wl-LL I *** WM" WJOC I-HO *** HUm p:WW NJ • *** Vn!U w W W-Ih * ** H W<' O.: WN

*** JUH F-N7 Kh0 < U 2 W < V

H W LL LL h N

r

pL f•J OOJJ

of wlH 001- W J O W W O O

0.• W I-- mmi) Hhh

W<0 »O 000 1-NW ZZW VUW Z Z Z

J J H J J H J J H K<n 44W Q<C] 00 0 HH

^ otlo 000 00`0 h HU F- F-U /-1-U

•4eF4

9-15
9.6 TARIFF SUMMARY

TABLE 5 presents a summary of tariff utilization in the routing solutions. Statistics associated with each tariff are presented both as totals

{ and as percentages of the corresponding overall network totals. A typical

output table is shown in figure 9-5. The annotated numbers are associated

with the following descriptions:

1. Tariff. Each tariff included in the routing solution is identified

by name.

2. Total circuit mileage. The least-cost routing mileage associated

with each tariff is printed. The mileage between each pair of

cities is included in the appropriate tariff total depending on tho

tariff providing communication service between the cities. The

total circuit mileages for the individual tariffs sum to the total

network circuit mileage printed in TABLE 4.

3. Total voice circuits. The total number of circuits associated with

each tariff is printed. The number of voice circuits between each

pair of cities is included in the appropriate tariff total depending on the tariff providing communication service between the

cities. The total number of voice circuits for the individual

tariffs sum to the total number of voice circuits in the least-cost

network as printed in TABLE 4.

4. Percent of network circuits. The total number of voice circuits

associated with each tariff is expressed as a percentage of the

total number of voice circuits in the least-cost network.

5. Total cost. The total least-cost routing circuit cost associated

with each tariff is printed. The cost of voice circuits between

each city pair is included in the appropriate tariff total depending on the tariff providing communication service between the

s.:

C

9-16
cities. The total coFts of voice circuits for the individual

tariffs sun to the total cost of voice circuits in the least-cost

network as printed in TABLE 4.

6. Percent of network cost. The total cost of voice circuits associated with each tariff is expressed as a percentage of the total

cost of voice circuits in the least-cost network.

7. Service. This field contains the word "TERRESTRIAL" or the word

"SATELLITE" to indicate the type of service represented by each of

the tariffs included in the routing solution.

9-17

r
Orjj M ,'%l FAGS 13

OF POOR QUALM

J

1

4

W

W

w

H

Ce

r I VI

J

KI

W

W

W 1 d' /- VI 1 W 1411 I FLL I

MxM ovI xMx R' 1 H

n

xx:K HQY-1 ^f

N

a xMx

r LuZV

xxM WHO I e

o

Ix x U W U I

MxM

1 11w U5

Q

xxMd M x:K 1

xxx

-- —

1 -----

xxM

1

xxx

1

x Kx 1

xMx 1- 1 UO

N M X.:K VI I VI M M. x 'K O I b ^E

` x :1t xU I P

M

x

1

O

^r

N

M

K

J 1 N

P

Mx

4

I

D

N

M } x h- 1 .•1

N x oex o I

x4x 1- I

x ..^--_ M 1

^' M}'x 1 l . M N wx --- 11 -----

w U x LL I xLLx ou VII M H x WL

0 V I x w x 1- M I 1:

VI

O

E` M4xxxx

==m

O 

W1 u 1 e

e

MM U W K 1

it

M

x ad="1 M • M W U 1 1 IK 1 w d 1 x M I M W :K --- I ---^--

M J 'K1I

•xX4

x

t

w

1 xFx Ln 01

N

xx H I V1

P

`

qqq IK

x J W

I

O

P

xMx n1

b

x x x

O4U01

H" U 1 f.}ILLM-S 1 N

r x:Y.x U 1

xxx xxx

I

t

^ M y 

X 1

MMx ---I -----

[LLL xx :v. 1 M x M I x x :Y. 1

x x:K I O

P

M x:K 1-W 1 Vl

n

xMx .C=<

N 404 1 n

^• ON HUW I OG=J I 1 MN 1 •

WE:1

^.i 11I } _ f _ 1

LL1H

N

O U. ►1 1 4

N

K

I LL LL

r 1 ^ 1- i

9-18

1 w* ', &
c

9.7 TRAFFIC TABLE

TABLE 6 presents a summary of the directional traffic between all cities

in the network being evaluated. The summary is presented in the form of a

Traffic Table, which is a matrix format whose entries indicate the number of

voice circuits between any two cities. The number of voice circuits between

any city pair is calculated based on user inputs of network traffic. Figure 9-6 provides a sample of a typical Traffic Table.

9-19
ORJOINAL PAGE Is

OF POOR QUALITY

X x

xx

xx

x a:

xx

xx

xx

xx

x x

xx

xx

xx

x N:

x :1: xx

xx

xx

xx

x

x

W x J x

mx¢x1- x

x

UX

.+ x

LLx

LL 

G x

w 

I- x

x

x

x

•o x

W J x

mx¢x

1- x

x

x

x

xx

xx

xx

xx

xx

xx

xx

xx

xx

xx

xx

xx

xx

xx

xx

xxMx

xx

1 ^1gJHOL'1gON 1 P:==0 n V

1 M•Onn g v^n r-1 I n...-. n y n

¢ I

0.I xla. I1

1

1

1 NJJ .o Nlryoorl 1 V1P.I CJJM yo 1 •O UI.-IM.^!J MN 1 J N N o q J

1 N rz

w

z

I hMJhV10111 V1J 1 M.^rl •GN Mhh 1 C•.I q •-loh qJh N H N O M N

1 N

TIZ 1 c 1

Z I

I o.INhOV1NOh

1 dVfJP NJOq

I Nh.r y h '. qh I •O '+ r-1 I N ¢ 1

U I O 1 J 1

h eJOC.h•OMN NHh P•p y N•1 M N V g O M M M HN NN NN

M

W W J O

m

G

U PMOJNJJJq

LL 1!1 N ^O r-1 r-1 ry M M LL .^. Nrl .l N.+•"1

1' J H MN

U

wa"= W-r ^? It1M MNPNO

N NNh g 1P1 .ON NN NJ M•O

¢

m

oOPh O.h NrIM J•-IN •On V10h

NVIM NN•OMN

N

N

JD

fC

l0

I

a

cp

H

d

a

EA

7

lL

I MJ gNhJ.-I .tiO I ho.^.rghoM 1 NCJMMhhNr-1 1 •GNN •-1JM

6 U 1 o I A 1 z I K 1 ¢ I 31

Q GJI-IGrr GU U ^N"U:_^dG1 SCI-^WOGw-^:

amUOJZZa-•

I GQJi-^KriKU

I U:=rICU2ZC_ I zK^•I woatst^< 14mUFJZZG3

.y ra

9-20
G

L

i

Appendix A

PRESTORED SMSA CITIES OF THE CNUC MODEL

L'

1
T

PRESTORED SMSA CITIES (SHEET 1 OF 7)

VERTICAL HORIZONTAL

CODE DESCRIPTIVE NAME COORDINATE COORDINATE

ABTX ABILENE TX 8698 4513

AKOH AKRON OH 5637 2472

ALG ALBANY GA 7649 1817

ALNY ALBANY-SCHENECTADY-TROY NY 4639 1629

ALNM ALBUQUERQUE NM 8549 5887

ALLA ALEXANDRIA LA 8409 3168

ALPA ALLENTOWN-BETHLEHEM-EASTON PA-NJ 5166 1585

ATPA ALTOONA PA 5460 1972

AMTX AMARILLO TX 8266 5076

ANCA ANAHEIM-SANTA ANA-GARDEN GROVE CA 9250 7810

ANIN ANDERSON IN 6173 2958

ANSC ANDERSON SC 6961 1894

ANMI ANN ARBOR MI 5602 2908

ANAL ANNISTON AL 7406 2304

APWI APPLETON-OSHKOSH WI 5589 3776

ASNC ASHEVILLE NC 6749 2001

ATGE ATHENS GE 7130 1948

ATGA ATLANTA GA 7260 2083

ATNJ ATLANTIC CITY NJ 5284 1284

AUGA AUGUSTA GA-SC 7089 1674

AUTX AUSTIN TX 9005 3996

BACA BAKERSFIELD CA 8497 8060

BAMU BALTIMORE MD 5510 1575

RAME BANGOR ME 3777 1322

BALA. RATON ROUGE LA 8476 2874

RAMI BATTLE CREEK MI 5713 3124

BYMI BAY CITY MI 5368 3085

BETX BEAUMONT-PORT ARTHUR-ORANGE TX 8777 3344

BEWA BELLINGHAM WA 6087 8933

BEMI BENTON HARBOR MI 5850 3281

BIMT BILLINGS MT 6391 6790

BIMS BILOXI-GULFPORT MS 8295 2481

BINY BINGHAMTON NY-PA 4943 1837

BIAL BIRMINGHAM AL 7519 2446

BI^jO BISMARK NO 5840 5736

BLIN BLOOMINGTON IN 6417 2984

BLIL BLOOMINGTON-NORMAL IL 6358 3483

BOID BOISE CITY ID 7096 7869

BOMA BOSTON MA 4422 1249

BRFL BRADENTON FL 8270 1116

BRWA BREMERTON WA 6349 8940

BRCT BRIDGEPORT CT 4841 1360

BICT BRISTOL CT 4730 1394

BRMA BROCKTON MA 4465 1205

BRTX BROWNSVILLE-HARLINGEN-SAN BENI TX 9820 3663

BYTX BRYAN-COLLEGE STATION TX 8827 3788

BUNY BUFFALO NY 5075 2326

A-1

9
,,

PRESTOREO SMSA CITIES (SHEET 2 OF 7)

VERTICAL HORIZONTAL

CODE DESCRIPTIVE NAME COORDINATE COORDINATE

BUNC BURLINGTON NC 6364 1588

BUVT BURLINGTON VT 4270 1808

CAOH CANTON OH 5676 2419

CAWY CASPER WY 6918 6297

CEIA CEDAR RAPIDS IA 6261 4021

CHIL CHAMPAIGN-URBANA-RANTOUL IL 6371 3336

CHSC CHARLESTON-NORTH CHARLESTON SC 7021 1281

CHWV CHARLESTON WV 6152 2174

CHNC CHARLOTTE-GASTONIA NC 6657 1698

CHVA CHARLOTTESVILLE VA 5919 1683

CHTN CHATTANOOGA TN-GA 7098 2366

CIIL CHICAGO IL 5986 3426

CHCA CHICO CA 8057 8668

CIOH CINCINNATI OH-KY 6263 2679

CLTN CLARKSVILLE-HOPKINSVILLE TN-KY 6988 2837

CLOH CLEVELAND OH 5574 2543

COCO COLORADO SPRINGS CO 7679 5813

COMO COLUMBIA MO 6901 3841

COSC COLUMBIA SC 6901 1589

COGA COLUMBUS GA-AL 7556 2045

COON COLUMBUS OH 5972 2555

COTX CORPUS CHRISTI TX 9475 3739

CUMD CUMBERLAND MD-WV 5650 1916

DATX DALLAS-FORT WORTH TX 8436 4034

DACT DANBURY CT 4829 1423

DAVA DANVILLE VA 6270 1640

DAIA DEVENPORT-ROCK ISLAND-MOLINE IA-IL 6273 3817

DAOH DAYTON OH 6113 2705

DAFL DAYTONA BEACH FL 7791 1.032

DEIL DECATUR IL 6478 3413

DECO DENVER-BOULDER CO 7501 5899

DEIA DES MOINES IA 6471 4275

DEMI DETROIT MI 5536 2828

DUTA DUBUQUE IA 6088 3925

DUMN DULUTH-SUPERIOR MN-WI 5352 4530

EAWI EAU CLAIRE WI 5698 4261

ELTX EL PASO TX 9231 5655

ELIN ELKHART IN 5895 3168

ELNY ELMIRA NY 5029 1953

ENOK ENID OK 7783 4505

ERPA ERIE PA 5321 2397

EUOR EUGENE-SPRINGFIELD OR 7128 8954

EVIN EVANSVILLE IN-KY 6729 3019

FAMA FALL RIVER MA-RI 4543 1170

FANG FARGO-MOORHEAD ND-MN 5615 5182

FANC FAYETTEVILLE NC 6501 1385

FAAR FAYETTEVILLE-SPRINGDALE AR 7600 3872

A-2
a

PRESTORED SMSA CITIES (SHEET 3 OF 7)

VERTICAL HORIZONTAL

CODE DESCRIPTIVE NAME COORDINATE COORDINATE

F1MA FITCHBURG-LEOMINSTER MA 4459 1374

FLMI FLINT MI 5461 2993

FLAL FLORENCE AL 7344 2715

FOSC FORENCE SC 6744 1417

1 FOCO FORT COLLINS CO 7331 5965

FOFL FORT LAUDERDALE-HOLLYWOOD FL 8282 557

- FRFL FORT MYERS FL 8359 904

FOAR FORT SMITH AR-OK 7752 3855

FTFL FORT WALTON BEACH FL 8097 2097

FOIN FORT WAYNE IN 5942 2982

FRCA FRESNO CA 8669 8239

GAAL GADSDEN AL 7355 2368

GAFL GAINESVILLE FL 7838 1310

^- GATX GALVESTON-TEXAS CITY TX 8985 3397

GAIN GARY-HAMMOND-EAST CHICAGO IN 6017 3354

GLNY GLENS FALLS NY 4515 1704

GRND GRAND FORKS ND-MN 5418 5297

l GRMi GRAND RAPIDS MI 5628 3261

GRMT GREAT FALLS MT 6120 7281

GRCO GREELEY CO 7345 5895

GRWI GREEN BAY WI 5512 3747

GRNC GREENSBORO-WINSTON-SALEM-NIGH NC 6400 1638

GRSC GREENVILLE-SPARTANBURG SC 6250 1226

HAMD HAGERSTOWN MD 5555 1772

HAON HAMILTON-MIDDLETOWN OH 6210 2718

HAPA HARRISBURG PA 5363 1733

HACT HARTFORD CT 4687 1373

H1NC HICKORY NC 6611 1833

HOTX HOUSTON TX 8938 3536

HUWV HUNTINGTON-ASHLAND WV-KY 6212 2299

( HUAL HUNTSVILLE AL 7267 2535

j ININ INDIANAPOLIS IN 6272 2992

I01W IOWA CITY 1W 6313 3972

{{ JAMI JACKSON MI 5663 3009

JAMS JACKSON MS 8035 2880

JAFL JACKSONVILLE FL 7649 1276

JANC JACKSONVILLE NC 6412 1131

f JAWI JANESVILLE-BELIOT WI 5970 3688

I: JENJ JERSEY CITY NJ 5006 1409

JOTN JOHNSON CITY-KINGSPORT-BRISTOL TN-VA 6595 2050

JOPA JOHNSTOWN PA 5542 2021

JOMO JOPLIN MO 7421 4015

KAMI KALA!MAZ00-PORTAGE MI 5749 3177

KAIL KANKAKEE IL 6149 3381

KAMO KANSAS CITY MO-KS 7027 4203

KEWI KENOSHA WI 5865 3526

KITX KILLEEN-TEMPLE TX 8832 4063

A-3
T

PRESTORED SMSA CITIES (SHEET 4 OF 7)

a CODE DESCRIPTIVE NAME

VERTICAL

COORDINATE

HORIZONTAL

COORDINATE

KNTN KNOXVILLE TN 6801 2251

4 KOIN KOKOMO IN 6135 3063

LAWI LA CROSSE WI 5874 4133

LALA LAFAYETTE LA 8587 2996

e LAIN LAFAYETTE—WEST LAFAYETTE IN 6206 3167

LKLA LAKE CHARLES LA 8679 3202

LAFL LAKELAND—WINTER HAVEN FL 8084 1034

LAPA LANCASTER PA 5348 1626

LAMI LANSING—EAST LANSING MI 5584 3081

LATX LAREDO TX 5'681 4099 

LANM LAS CRUCES NM 9132 5742

LANV LAS VEGAS NV 8665 7411

LAKS LAWRENCE KS 7098 4294

LAMA LAWRENCE—HAVERHILL MA—NH 4373 1311 

" LAOK LAWTON OK 8178 4451

LEME LEWISTON-AUBURN ME 4042 1391

LEKY LEXINGTON-FAYETTE KY 6459 2562

F LIOH LIMA OH 5921 2799 

y LINE LINCOLN NE 6823 4674

LIAR LITTLE ROCK—NORTH LITTLE ROCK AR 7721 3451

LONJ LONG BRANCE—ASBURY PARK NJ 5073 1348

^'. LOTX LONGVIEW TX 8348 3660

`. LOOH LORAIN—ELYRIA OH 5623 2608

LOCA LOS ANGELES—LONG BEACH CA 9213 7878 

y LOKY LOUISVILLE KY—IN 6529 2772

9 LOMA LOWELL MA—NH 4399 1320

If LUTX LUBBOCK TX 8598 4962

LYVA LYNCHBURG VA 6093 1703

MAGA MACON GA 7364 1865

MAWI 14ADISON WI 5887 3796

r

MANN MANCHESTER NH 4354 1388 

MAOH MANSFIELD OH 5783 2575

MCTX MCALLEN-PHARR-EDINBURG TX 9856 3764

MEOR MEDFORD OR 7503 8892

MEFL MELBOURNE—TITUSVILLE-COCOA FL 7925 903

METN MEMPHIS TN—AR 7471 3125

MECT MERIDEN CT 4740 1358

•• MIFL MIAMI FL 8351 527

r MITX MIDLAND TX 8934 4888

F MIWI MILWAUKEE WI 5788 3589

' MI'MN MINNEAPOLIS—ST PAUL MN—WI 5781 4525

r MOAL MOBILE AL 8167 2367

- MOCA MODESTO CA 8499 8473

MOLA MONROE LA 8148 3218

- MNAL MONTGOMERY AL 7692 2247

MUI'N MUNCIE IN 6130 2925

MUMI MUSKEGON-NORTON SHORES—MUSKEGO MI 5622 3370

A-4I
s PRESTORED SMSA CITIES (SHEET 5 OF 7)

VERTICAL HORIZONTAL

CODE DESCRIPTIVE NAME COORDINATE COORDINATE

I.

HANH NASHUA NH 4394 1356

NATN NASHVILLE-DAVIDSON TN 7010 2710

NANY NASSAU-SUFFOLK NY 4961 1355

NEMA NEW BEDFORD MA 4532 1131

NECT NEW BRITAIN CT 4715 1373

NENJ NEW BRUNSWICK-PERTH AMBOY-SAYR NJ 5085 1434

NWCT NEW HAVEN-WEST HAVEN CT 4792 1342

NLCT NEW LONDON-NORWICH CT-RI 4700 1242

NELA NEW ORLEANS LA 8483 2638

NENY NEW YORK NY-NJ 4997 1406

NWNJ NEWARK NJ 5015 1430

NEOH NEWARK OH 5904 2480

NWNY NEWBRGH-MIDDLETOWN NY 4915 1556

NEVA NEWPORT NEWS-HAMPTON VA 5908 1260

NOVA NORFOLK-VIRGINIA BEACH-PORTSMO VA-NC 5918 1223

NOPA NORTHEAST PENNSYLVANIA PA 5068 1719

NOCT NORWALK CT 4877 1379

OCFL OCALA FL 7909 1227

ODTX ODESSA TX 8982 4930

OKOK OKLAHOMA CITY OK 7947 4373

OLWA OLYMPIA WA 6469 8971

OMNE OMAHA NE-IA 6687 4595

ORFL ORLANDO FL 7954 1031

OWKY OWENSBORO KY 6731 2928

OXCA OXNARD-SIMI VALLEY-VENTURA CA 9205 8050

PAFL PANAMA CITY FL 8057 1914

PAWV PARKERSBURG-MARIETTA WV-OH 5976 2268

PAMS PASCAGOULA-MOSS POINT PATERSON MS 8273 2419

PANJ PATERSON-CLIFTON-PASSAIC NJ 4984 1452

PEFL PENSACOLA FL 8147 2200

PEIL PEORIA IL 6362 3592

PEVA PETERSBURG-COLONIAL HEIGHTS-HO VA 5961 1429

PHPA PHILADELPHIA PA-NJ 5251 1458

PHAZ PHOENIX AZ 9135 6748

PIAR PINE BLUFF AR 7803 3358

PIPA PITTSBURGH PA 5621 2185

PIMA PITTSFIELD MA 4626 1539

POME PORTLAND ME 4121 1334

POOR PORTLAND OR-WA 6799 8914

PONH PORTSMOUTH-DOVER-ROCHESTER NH-ME 3760 1431

PONY POUGHKEEPSIE NY 4821 1526

PRRI PROVIDENCE-WARWICK-PAWTUCKET RI-MA 4550 1219

PRUT PROVO-OREM UT 7680 7006

PUCO PUEBLO CO 7787 5742

RAWI RACINE WI 5837 3535

RANC RALEIGH-DURHAM NC 6344 1436

REPA READING PA 5258 1612

A-5
1

A-6

­ 

PRESTORED SMSA CITIES (SHEET-6 OF 7)

VERTICAL HORIZONTAL

CODE DESCRIPTIVE NAME COORDINATE COORDINATE

r°

^y

RECA REDDING CA 7880 8778

RENV RENO NV 8064 8323

RIWA RICHLAND-KENNEWICK WA 6583 8415

RIVA RICHMOND VA 5906 1472

RICA RIVERSIDE-SAW BERNARDINO-ONTAR CA 9172 7710

ROVA ROANOKE VA 6196 1801

ROMN ROCHESTER MN 5916 4326

BONY ROCHESTER NY 4913 2195

ROIL ROCKFORD IL 6022 3675

ROSC ROCK HILL SC 6730 1692

SA.CA SACRAMENTO CA 8304 8580

SAMI SAGINAW MI 5404 3074

STMN ST CLOUD MN 5721 4705

STMO ST JOSEPH MO 6913 4301

SLMO ST LOUIS MO-IL 6807 3482

SAOR SALEM OR 6929 8958

SLCA SALINAS-SEASIDE-MONTEREY CA 8722 8560

SANC SALISBURY-CONCORD NC 6601 1679

SAUT SALT LAKE CITY-OGDEN UT 7576 7065

SATX SAN ANGELO TX 8944 4563

SNTX SAN ANTONIO TX 9225 4062

SNCA SAN DIEGO CA 9468 7629

SFCA SAN FRANCISCO-OAKLAND CA 8492 8719

SJCA SAN JOSE CA 8583 8619

STCA SANTA BARBARA-SANTA MARIA-LOMP CA 9171 8150

SCCA SANTA CRUZ CA 8664 8633

SRCA SANTA ROSA CA 8354 8787

SAFL SARASOTA FL 8295 1094

SAGA SAVANNAH GA 7266 1379

SEWA SEATTLE-EVERETT WA 6336 8896

SHPA SHARON PA 5520 2348

SHWI SHEBOYGAN WI 5633 3629

SHTX SHERMAN-DENISON TX 8253 4072

SHLA SHREVEPORT LA 8272 3495

SINE SIOUX CITY HE-IA 6468 4768

SISD SIOUX FALLS SO 6279 4900

SOIN SOUTH BEND IN 5918 3206

SPWA SPOKANE WA 6247 8180

SPIL SPRINGFIELD IL 6539 3513

SPMO SPRINGFIELD MO 7310 3836

SPOH SPRINGFIELD OH 6049 2666

SPCT SPINGFIELD-CHICOPEE-HOLYOKE CT-MA 4620 1408

STCT STAMFORD CT 4897 1388

STPA STATE COLLEGE PA 5360 1933

STOH STEUBENVILLE-WEIRTON OH-WV 5689 2262

SOCA STOCKTON CA 8435 8530

SYNY SYRACUSE NY 4798 1990
A-7

PRESTORED SMSA CITIES (SHEET 7 OF 7)

VERTICAL HORIZONTAL

CODE DESCRIPTIVE NAME COORDINATE COORDINATE

TAWA TACOMA WA 6415 8906

TAFL TALLAHASSEE FL 7877 1716

TMFL TAMPA-ST PETERSBURG FL 8173 1147

TEIN TERRE HAUTE IN 6428 3145

TETX TEXARKANA TX-AR 8111 3626

TOOH TOLEDO OH-MI 5704 2820

TOKS TOPEKA KS 7110 4369

TRNJ TRENTON NJ 5164 1440

TUAZ TUCSON AZ 9345 6485

TUOK TULSA OK 7707 4173

TUAL TUSCALOOSA AL 7643 2535

TYTX TYLER TX 8417 3744

UTNY UTICA-ROME NY 4701 1878

VACA VALLEJO-FAIRFIELO-NAPA CA 8422 8699

VITX VICTORIA TX ti245 3748

VINJ VINELAND-MILLVILLE-BRIDGETON NJ 5320 1380

VICA VISALIA-TULARE-PORTERVILLE CA 8746 8139

WATX WACO TX 8706 3993

WADC WASHINGTON DC-MD 5622 1583

WACT WATERBURY CT 4761 1391

WAIA WATERLOO-CEDAR FAILS IA 6208 4167

WAWI WAUSAU WI 5542 4014

WEFL WEST PALM BEACH-BOCA RATON FL 8166 607

WHWV WHEELING WV-OH 5755 2241

WIKS WICHITA KS 7489 4520

WITX WICHITA FALLS TX 8326 4413

WIPA WILLIAMSPORT PA 5200 1873

WIDE WILMINGTON DE-NJ 5326 1485

WINC WILMINGTON NC 6559 1143

WOMA WORCESTER MA 4513 1330

YAWA YAKIMA WA 6533 8607

YOPA YORK PA 5402 1674

POOH YOUNGSTOWN-WARREN OH 5557 2353

YUCA YUBA CITY CA 8181 8624
r

f

Appendix B

PRESTORED TARIFFS OF THE CODC MODEL

E

s)

P ^^

t

^,

L f ^.

F^

u i

YY

i

t

F^ 
Table B-1. Prestored American Telephone and Telegraph Company Listed

Cities as Defined in F.C.C. No. 260 (Effective July 3, 1983)

(Sheet 1 of 11)

RATE CENTER CODE

Alabama

Anniston ANAL

Birmingham BIAL

Decatur DEAL

Huntsville HUAL

Mobile MOAL

Montgomery MNAL

Troy TRAL

Arizona

Flagstaff FLAR

Phoenix PHAZ

Prescott PRAR

Tucson TUAZ

Yuma YUAR

Arkansas

Fayetteville FAAR

Forrest City FOAR

Hot Springs HOAR

Jonesboro JOAR

Little Rock LIAR

Pine Bluff PIAR

Searcy SEAR

California

Anaheim ANCA

Bakersfield BACA

Chico CHCA

Eureka EUCA

Fresno FRCA

Garoena GACA

Hayward HACA

Long Beach (Los Angeles) LOCA

Los Angeles LOCA

Oakland (San Francisco) SFCA

{ Redwood City ROCA

Sacramento SACA

Salinas SLCA

San Bernardina (Riverside) RICA

San Diego SNCA

San Francisco SFCA

San Jose SJCA

l

San Luis Obispo SUCA

Santa Monica STCA

Santa Rosa SRCA

` E-1
BEC T

BLCT

BRCT

BJCT

EACT

GRCT

HMCT

HACT

NWCT

NLCT

NOCT

ORCT

STCT

SACT

WECT

WSCT

WTCT

WIDE

WADC

CHFL

CLFL

MEFL

CRFL

DAR

B-2

k

Table B-1. Prestored American Telephone and Telegraph Company Listed

Cities as Defined in F.C.C. No. 260 (Effective July 3, 1983)

(Sheet 2 of 11)

RATE CENTER CODE

California (continued)

Stockton SOCA

Sunnyvale SVCA

Ukiah UKCA

Van Nuys VNCA

Colorado

Colorado Springs COCO

Denver DECO

Fort Collins FOCO

Fort Morgan FRCO

Glenwood Springs GLCO

Grand Junction GACO

Greeley CRCO

Montrose MOCO

Pueblo PUCO

r.

E'

id

Connecticut

Bethany

Bloomfield

Bridgeport

Brookfield

East Hartford

Groton

Hamden

Hartford

New Haven

New London

North Haven

Orange

Stamford

Stratford

West Hartford

West Haven

Wethersfield

Delaware

Wilmington

Destrict of Columbia

Florida

Chipley

Clearwater

Cocoa (Melbourne)

Crestview

Daytona Beach
I

Table B-1. Prestored American Telephone and Telegraph Company Listed

Cities as Defined in F.C.C. No. 260 (Effective July 3. 1983)

(Sheet 3 of 11)

RATE CENTER CODE

Florida (continued)

Fort Lauderdale FOFL

Fort Meyers FRFL

Fort Pierce FPFL

Fort Walton Beach FTFL

Gainesville GAFL

Jacksonville JAFL

Key West KEFL

Lake City LKFL

Miami MIFL

Ocala OCFL

Orlando ORFL

Panama City PAFL

Pensacola PEFL

St. Petersburg (Tampa) TMFL

Sarasota SAFL

Tallahassee TAFL

Tampa TMFL

West Palm Beach WEFL

Winter Garden WIFL

Winter Haven (Lakeland) LAFL

Georgia

j Albany ALGA

i Atlanta ATGA

Augusta AUGA

Brunswick BRGA

Columbus COGA

Conyers CNGA

Dublin DUGA

Fitzgerald FIGA

Macon MAGA

Rome ROGA

` Savannah SAGA

Thomasville THGA

Waycross WAGA C Idaho

Boise BOID

Pocatello POID

Twin Falls TWID

1

Illinois

Centralia CEIL

Champaign-Urbana CHIL

Chicago CIIL

Collinsville COIL

B-3
Table B-1. Prestored American Telephone and Telegraph Company Listed

Cities as Defined in F.C.C. No. 260 (Effective July 3, 1983)

(Sheet 4 of 11)

I

RATE CENTER CODE

Illinois (continued)

Be Kalb DKIL

Hinsdale HIIL

Joliet JOIL

Marion MAIL

Mattoon MIIL

Newark NEIL

Northbrook NOIL

Peoria PEIL

Rockford ROIL

Rock Island (Davenport) DAIA

Springfield SPIL

Woodstock WOIL

Indiana

Bloomington BLIN

Evansville EVIN

Fort Wayne FOIN

Indianapolis ININ

Muncie MUIN

New Albany NEIN

South Bend SOIN

Terre Haute TEIN

Iowa

Boone BOIA

Burlington BUTA

Cedar Rapids CEIA

Davenport DAIA

Dubuque DUTA

Iowa City I01W

Sioux City SINE

Waterloo WAIA

Kansas

Dodge City DOKS

Hutchinson HUKS

Kansas City KAMO

Manhattan MAKS

Salina SAKS

Topeka TOKS

Wichita WIKS

Kentucky

Danville DAKY

Frankfort FRKY

Loutsville LOKY

B-4
Table B-1. Prestored American Telephone and Telegraph Company Listed

Cities as Defined in F.C.C. No. 260 (Effective July 3, 1983)

(Sheet 5 of 11)

RATE CENTER CODE

Kentucky (continued)

Madisonville MAKY

i Paducah PAKY

Winchester I s WIKY

Louisiana

j Alexandria ALLA

j Baton Rouge BALA

Lafayette LALA

Lake Charles LKLA

Monroe MOLA

New Orleans NELA

Shreveport SHLA

Maine

Augusta AUME

j Lewiston LEME

J Portland POME

Maryland

Baltimore BAMD

Washington WADC

j Massachusetts

t Boston BOMA

Brockton BRMA

Cambridge CAMA

t Fall River FAMA

Framingham FRMA

Lawrence LAMA

Springfield SPCT

Worchester WOMA

Michigan

Detroit DEMI

Flint FLMI

Grand Rapids GRMI

Houghton HOMI

Iron Mountain IRMI

Jackson JAMI

Kalamazoo KAMI

4 Lansing LAMI

Petoskey PEMI

Plymouth PLMI

^.; Pontiac POMI

Saginaw SAMI

f Sault Ste. Marie SUMI

1

Traverse City TRMI

8-5
B-6

£ 9 

{IF «( Ta.,le B-1. Prestored American Telephone and Telegraph Company Listed

1 Cities as Defined in F.C.C. No. 260 (Effective July 3. 1983)

(Sheet 6 of 11)

RATE CENT; CODE

Minnesota

Duluth DUMN

Minneapolis MIMN

St. Cloud STMN

St. Paul (Minneapolis) MIMN

Virginia VIMN

Wadena WAMN

Willmar WIMN

Mississippi

Biloxi BIMS

Columbus COMS

Greenville GRMS

Greenwood GEMS

Gulfport (Biloxi) BIMS

Hattiesburg HAMS

Jackson JAMS

Laurel LAMS

McComb MCMS

` Meridian MEMS

Tupelo TUMS

Missouri

i

Cape Giradeau

Joplin JOMO

Kansas City KAMO

St. Joseph STMO

St. Louis SLMO

Sikeston SIMO

Springfield SPMO

Montana

Billings BIMT

Glendive GLMT

Helena HEMT

Missoula MIMT

Nebraska

Grand Island GRNE

Omaha OMNE

Sidney SDNE

Nevada

Carson City CANV

Las Vegas LANV

Reno RENV
Table B-1. Prestored American Telephone and Telegraph Company Listed

Cities as Defined in F.C.C. No. 260 (Effective July 3, 1983)

(Sheet 7 of 11)

RATE CENTER CODE

New Hampshire

Concord CONH

Dover (Portsmouth) POHN

Manchester MANH

Nashua NANH

New Jersey

Atlantic City ATNJ

Camden CANJ

Hackensack HANJ

Morristown MONJ

Newark NENJ

New Brunswick NENJ

Trenton TRNJ

New Mexico

Albuquerque ALNM

Las Cruces LANM

Roswell ROHM

Santa Fe SANM

New York

Albany ALNY

Binghamton BINY

Buffalo BUNY

Huntington HUNY

Nassua NANY

New York City NENY

Potsdam PTNY

^- Poughkeepsie PONY

Rochester RONY

Syracuse SYNY

Troy (Albany) AL NY

Westchester WENY

North Carolina

Asheville ASNC

Charlotte CHNC

Fayetteville FANC

Gastonia (Charlotte) CHNC

Greensboro GRNC

Greenville GENC

Laurinburg LANC

New Bern NENC

t_ Raleigh RANC

Rocky Mount RONC

Wilmington WINC

Winston-Salem (Greensboro) GiRNC

B-7 L
Table B-1. Prestored American Telephone and Telegraph Company Listed

Cities as Defined in F.C.C. No. 260 (Effective July 3. 1983)

(Sheet 8 of 11)

RATE CENTER

North Dakota

Bismark

Casselton

Dickinson

Fargo

Grand Forks

Ohio

Akron

Canton

Cincinnati

Cleveland

Columbus

Dayton

Findley

Mansfield

Toledo

Youngstown

Oklahoma

Enid

Lawton

Muskogee

Oklahoma City

Tulsa

Oregon

Medford

Pendleton

Portland

Pennsylvania

Allentown

Altoona

Harrisburg

Philadelphia

Pittsburg

Pottsville

Reading

Scranton

State College

Williamsport

Rhode Island

Providence

CODE

BIND

CAND

DIND

FAND

GRND

AKOH

CAOH

CIOH

CLOH

COOH

DAOH

FIOH

MAOH

TOOH

YOOH

ENOK

LAOK

MUOK

OKOK

TUOK

ME OR

PEOR

POOR

ALPA

ATPA

NAPA

PHPA

PIPA

POPA

REPA

SCPA

STPD

WIPA

PRRI

B-8
I

I

r'

r

^.

,r

t

Ik

r

V'

Table B-1. Prestored American Telephone and Telegraph Company Listed

Cities as Defined in F.C.C. No. 260 (Effective July 3, 1983)

(Sheet 9 of 11)

i

I

RATE CENTER CODE

South Carolina

Charleston

Columbia

Florence

Greenville

Orangeburg

Spartanburg (Greenville)

South Dakota

Aberdeen

Huron

Sioux Fails

Tennessee

Chattanooga

Clarksville

Jackson

Johnson City

Kingsport (Johnson City)

Kno,ivil le

Memphis

Morristown

Nashville

Texas

Abilene

Amarillo

Austin

Beaumont

Corpus Christi

Dallas

E1 Paso

Fort Worth (Dallas)

Freeport

Harlingen (Brownsville)

Houston

Laredo

Longview

Lubbock

Midland

San Angelo

San Antonio

Sweetwater

Waco

CHSC

COSC

FOSC

GRSC

ORSC

GRSC

ABSD

HUSD

SISD

CHTN

CLTN

JATN

JOTN

JOTN

KNTN

METN

MOTN

NATN

ABTX

AMTX

AUTX

BETX

COTX

DATX

ELTX

DATX

FRTX

BRTX

HOTX

LATX

LOTX

LUTX

MITX

SATX

SNTX

SWTX

WATX

k

E : B-9

w ^!
Table B-1. Prestored American Telephone and Telegraph Company Listed

Cities as Defined in F.C.C. No. 260 (Fffective July 3, 1983)

(Sheet 10 of 11)

RATE CENTER CODE

Utah

Logan LOUT

Ogden (Salt Lake City) SAUT

Provo PRUT

Salt Lake Lity SAUT

Vermont

Burling ton BUVT

White River Junction WHVT

Virginia

Blacksburg BLVA

Leesburg LEVA

Lynchburg LYVA

Newport News NEVA

Norfolk NOVA

Petersburg PEVA

Richmond RIVA

Roanoke ROVA

Washington WADC

Washington

Billingham BEWA

Kennewick (Richland) RIWA

North Bend NOWA

Seattle SEWA

Spokane SPWA

Yakima YAWA

West Virginia

Beckley BEWV

Charleston CHWV

Clarksburg CLWV

Fairmort. FAWV

Huntington HUWV

Morgantown MOWV

Parkensburg PAWV

Wheeling WHWV

Wisconsin

Appleton APWI

Dodgeville DOWI

Eau Claire EAWI

Green Bay GRWI

La Crosse LAWI

Madison MAWI

B-10

^
Table B-1. Prestored American Telephone and Telegraph Company Listed

Cities as Defined in F.C.C. No. 260 (Effective July 3, 1983)

(Sheet 11 of 11)

RATE CENTER

Wisconsin (Continued) A

Milwaukee

Racine

Stevens Port

Wyoming

Casper

Cheyanne

CODE

MIWI

RAWI

STWI

CAWY

CHWY

a

k

i

'r

a Y

Yi

4

h

..

F^

f

B-11
Table B-2. American Telephone and Telegraph Company Rate Schedules as

Defined In F.C.C. 260 (Effective March 3, 1982)

Schedule I • Schedule II"" Schedule III***

Basic Monthly Incremental Basic Monthly Incremental Basic Monthly Incremental

Charge (Up to Monthly Charge Charge (Up to Monthly Charge Charge (Up to Monthly Charge

Mileage Breakpoint Per Additional Breakpolnt Per Additional Breakpoint Per Additional

Breakpoint Mileage) Mile Mileage) Mile Mileage) Mlle

1 73.56 0.00 75.00 0.00 76.43 0.00

15 73.56 2.59 75.00 4.77 76.43 6.35

25 109.82 2.16 141.78 4.77 165.33 5.48

40 131.42 1.62 186.48 2.89 220.13 4.03

60 155.72 1.62 229.83 1.95 280.58 3.03

80 188.12 1.62 268.83 1.95 341.18 2.31

100 220.52 1.62 307.83 1.95 387.38 1.95

1000 252.92 0.94 346.83 0.94 426.38 0.97

over 1000 1098.92 0.58 1192.83 0.58 1299.38 0.58

Effective Date.,March 3, 1982

"Applies between a pair of Category "A" Rate Centers (listed titles).

**Applies between a pair of rate centers where one Is In Category "A" (listed titles) and the other

Is In Category "B" (nonllsted cities).

***Applies between a pair of Category "B" Rate Centers (nonlisted titles).

B-12
CA

l

I Table B-3. Prestored Western Union Telegraph Company Tariff as Defined

in F.C.C. No. 261 (Effective May 11, 1982) (Sheet 1 of 4)

l Category I: LONG HAUL

Los Angeles - Atlanta (LOCA-ATGA)

Los Angeles - Baltimore (LOCA-BAMD)

Los Angeles - Boston (LOCA-SOMA)

Los Angeles - Buffalo (LOCA-BUNY)

Los Angeles - Cincinnati (LOCH-CIOH)

Los Angeles - Cleveland (LOCA-CLOH)

Los Angeles - Columbus (LOCA-000H)

q Los Angeles - Dayton (LOCA-DAGH)

Los Angeles - Detroit (LOCA-DEMI)

Los Angeles - New York (LOCA-NENY)

Los Angeles - Philadelphia (LOCA-PHPA)

Los Angeles - Pittsburgh (LOCA-PIPA)

Los Angeles - Washington (LOCA-WADC)

Los Angeles - Wilmington (LOCA-WIDE)

1 San Francisco - Atlanta (SFCA-ATGA)

;.

l

San Francisco - Balti-.,,re (SFCA-BAMD)

F San Francisco - Bosti , (SFCA-BOMA)

E

San Francisco - Buffalo (SFCA-BUNY)

San Francisco - Cincinnati (SFCA-CIOH)

San Francisco - Cleveland (SFCA-CLOH)

k San Francisco - Columbus (SFCA-COON)

CEr

San Francisco - Dayton (SFCA-DAOH)

San Francisco - Detroit (SFCA-DEMI)

San Francisco - New York (SFCA-NENY)

San Francisco - Philadelphia (SFCA-PHPA)

San Francisco - Pittsburgh (SFCA-PIPA)

r

San Francisco - Washington (SFCA-WADC)

San Francisco - Wilmington (SFCA-WIDE)

k" Seattle - Boston (SEWA-BOMA)

Seattle - Cleveland (SEWA-CLOH)

Seattle - Detroit (SEWA-DEMI)

t" Seattle - New York (SEWA-NENY)

Seattle - Philadelphia (SEWA-PHPA)

Seattle - Pittsburgh (SEWA-PIPA)

Seattle - Washington (SEWA-WADC)

Category II: MEDIUM HAUL

Dallas/Ft Worth - Baltimore (DATX-BAMD)

•' Dallas/Ft Worth - Boston (DATX-BOMA)

Dallas/Ft Worth - Buffalo (DATX-BUNY)

Dallas/Ft Worth - Los Angeles (DATX-LOCA)

Dallas/Ft Worth - New York (DATX-NENY)

Dallas/Ft Worth - Philadelphia (DATX-PHPA)

f Dallas/Ft Worth - San Francisco (DATX-SFCA)

Dallas/Ft Worth - Washington (DATX-WADC)

_ B-13
Table B-3 Prestored Western Union Telegraph Company Tariff as Defined

in F.C.C. No. 261 (Effective May 11, 1982) (Sheet 2 of 4)

Category II: MEDIUM HAUL (Continued)

Houston - Baltimore (HOTX-BAMD)

Houston - Boston (HOTX-BOMA)

Houston - Cleveland (HOTX-CLOH)

Houston - Columbus (HOTX-000H)

Houston - Dayton (HOTX-DAOH)

Houston - Detroit (HOTX-DEMI)

Houston - Los Angeles (HOTX-LOCA)

Houston - New York (HOTX-NENY)

Houston - Philadelphia (HOTX-PHPA)

Houston - Pittsburg (HOTX-PIPA)

Houston - San Francisco (HOTX-SFCA)

Houston - Washington (HOTX-WADC)

Houston - Wilmington (HOTX-WIDE)

Kansas City - Boston (KAMO-SOMA)

Kansas City - Los Angeles (KAMO-LOCA)

Kansas City - New York (KAMO-NENY)

Kansas City - San Francisco (KAMO-SFCA)

Los Angeles - Chicago (LOCA-CIIL)

*Los Angeles - Bridgeton, Mo (LOCA-SLMO)

Los Angeles - Indianapolis (LOCA-ININ)

Los Angeles - Milwaukee (LOCA-MIWI)

Los Angeles - Minneapolis (LOCA-MIMN)

Los Angeles - St Louis (LOCH-SLM0)

Minneapolis - Boston (MIMN-BOMA)

San Francisco - Chicago (SFCA-CIIL)

San Francisco - Indianapolis (SFCA-ININ)

San Francisco - Milwaukee (SFCA-MIWI)

San Francisco - Minneapolis (SFCA-MIMN)

San Francisco - St Louis (SFCA-SLMO)

Seattle - Chicago (SEWA-CIIL)

Seattle - Dallas/Ft Worth (SEWA-DATX)

Seattle - Kansas City (SEWA-KAMO)

Seattle - Milwaukee (SEWA-MIWI)

Seattle - Minneapolis (SEWA-MIMN)

Seattle - St Louis (SEWA-SLMO)

Category III: SHORT HAUL

Atlanta - Baltimore (ATGA-BAMD)

Atlanta - Boston (ATGA-SOMA)

Atlanta - Chicago (ATGA-CIIL)

Atlanta - Cleveland (ATGA-CLOH)

Atlanta - Dallas/Ft Worth (ATGA-DATX)

Atlanta - Detroit (ATGA-DEMI)

Atlanta - Houston (ATGA-HOTX)

*Bridgeton, Mo. will be viewed as St Louis, Mo.

6

B-14
f^

1

Table B-3. Prestored Western Union Telegraph Company Tariff as Defined

in F.C.C. No. 261 (Effective May 11, 1982) (Sheet 3 of 4)

Category III: SHORT HAUL (Continued)

Atlanta - Indianapolis (ATGA-ININ)

Atlanta - Kansas City (ATGA-KAMO)

Atlanta - Milwaukee (ATGA-MIWI)

Atlanta - Minneapolis (ATGA-MIMN)

Atlanta - Philadelphia (ATGA-PHPA)

Atlanta - New York (ATGA-NFhv,l

Atlanta - Washington (ATGA-WADC)

Atlanta - Wilmington (ATGA-WIDE)

Boston - Chicago (SOMA-CIIL)

Boston - Cincinnati (SOMA-CIOH)

Boston - Columbus (BOMA-COON)

;H Boston - Dayton (BOMA-DAOH)

Boston - Indianapolis (BOMA-ININ)

Boston - Milwaukee (BOMA-MIWI)

Boston - St Louis (SOMA-SLM0)

l1 Chicago - Baltimore (CIIL-BAMD)

Chicago - Dallas/Ft Worth (CIIL-DATX)

Chicago - Houston (CIIL-HOTX)

Chicago - New York (CIIL-NENY)

Chicago - Philadelphia (CIIL-PHPA)

Chicago - Washington (CIIL-WADC)

i

Chicago - Wilmington (CIIL-WIDE)

Dallas/Ft Worth - Cincinnati (DATX-CIOH)

Dallas/Ft Worth - Cleveland (DATX-CLOH)

Dallas/Ft Worth - Columbus (DATX-000H)

Dallas/Ft Worth - Dayton (DATX-DAOH)

Dallas/Ft Worth - Detroit (DATX-DEM1)

s Dallas/Ft Worth - Indianapolis (DATX-ININ)

Dallas/Ft Worth - Milwaukee (DATX-MIWI)

Dallas/Ft Worth - Minneapolis (DATX-MIMN)

Dallas/Ft Worth - Pittsburgh (DATX-PIPA)

Dallas/Ft Worth - St Louis (DATX-SLMO)

Houston - Cincinnati (HOTX-CIOH)

Houston - Indianapolis (HOTX-ININ)

Houston - Milwaukee (HOTX-MIWI)

Houston - Minneapolis (HOTX-MIMN)

Houston - St Louis (HOTX-SLMO)

Milwaukee - Baltimore (MIWI-BAMD)

Milwaukee - New York (MIWI-NENY)

Milwaukee - Philadelphia (MIWI-PHPA)

Milwaukee - Washington (MIWI-WADC)

. New York - Columbus (NENY-COON)

New York - Dayton (NENY-DAOH)

New York - Indianapolis (NENY-ININ)

New York - Minneapolis (NENY-MIMN)

Philadelphia - Indianapolis (PHPA-ININ)

Philadelphia - Kansas City (PHPA-KAMO)

I
t

Table B-3. Prestored Western Union Telegraph Company Tariff as Defined

in F.C.C. No. 261 (Effective May 11, 1982) (Sheet 4 of 4)

Catgoory III: SHORT HAUL (Continued)

St Louis - Baltimore (SLMO-BAMD)

St Louis - New York (SLMO-NENY)

St Louis - Washington (SLMO-WADC)

St Louis - Wilmington (SLMO-WIDE)

Seattle - Los Angeles (SEWA-LOCA)

Seattle - San Francisco (SEWA-SFCA)

Washington - Indianapolis (WADC-ININ)

Washington - Minneapolis (WADC-MIMN)

Western Union Category I, II, and III Monthly Channel Charges

Category I: Long Haul - $92510

Category II: Medium Haul - $695.00

Category III: Short Haul - $580.00

r

E '

It

t

rl

w

f

. 1

B-16
Table B-4. Prestored Satellite Business Systems Tariff as Defined

in F.C.C. No. 2 (Effective October 1, 1982)

Network Access Centers (NACs -

mi nimum of 3)

Supplemental Capacity Units (SCUs)

Full-Time Transmission Units (FTUs)

Minimum Connection Arrangement Unit

(CAU) Charge Per NAC

Incremental CAU Charges:

Monthly Charge

$17,850.00 each

$5,700.00 each

$2,550.00 each

$17,850.00

Breakpoint No. of CAUs

150

300

over 300

Basic Monthly Charge

(Up to Breakpoint CAUs)

$0.00

$14,250.00

$27,750.00

Incremental Monthly

Charge Per Additional CAU

$95.00

$90.00

$65.00

e

r

B-17
C-1

t.

APPENDIX f. - ERROR MESSAGE

The following is a list of all the error message within the model. The

fatal errors cause model execution to be terminated. Fatal errors may indicate that files within the data base have errors within them. They may also

indicate that codes within the model have been altered incompletely. Fatal

j errors require the intervention of a programmer and will not occur under

normal conditions.

Nonfatal errors occur during initialization of a problem during optimization. They indicate that specifications within a problem are invalid, perhaps because the user is accessing a user defined file which is no longer

valid because of tariff changes. A common cause of errors is invalid user

^. input. Upon encountering an error condition, the user should first ensure

11

that his input adheres to the specifications detailed in this manual.

^^ I

It

N

t

u

I

^l

^_

It[

^.

I!l
1130 IBLSBS

2010 BSTRCT

2020 BSTRCT

2030 BSTRCT

2040 BSTRCT

2050 BSTRCT

2060 BSTRCT

2070 BSTRCT

2080 BSTRCT

Fatal Errors

NUMBER MODULE

1010 IN IT

I01fU IUUST

1030 IBLNET

1040 IBLTRF

1050 IBLATT

1060 IBLATT

107U IBLWUI

1080 IBLWU2

1090 IBLWU3

1100 IBLWU3

1110 IBLSBI

1120 IBLSBS

2090 BSTRCT

MESSAGE

Execution control file header not as expected.

File header of prestored ATT tariff file not as

expected.

File header of user-defined network not as expected.

File header of prestored traffic table riot as

expected.

Header record of tariff file not as expected.

Header of prestored ATT file not as expected.

Header record of prestored WU tariff not as expected.

File header of user-defined WU tariff not as expected.

File header of prestored WU tariff not as expected.

File header of user-defined WU tariff not as expected.

File header of prestored SBS tariff not as expected.

File header of user-defined SBS tariff not as

expected.

File header of prestored SBS tariff not as expected.

Header from traffic nodes not as expected.

Header from prestored ATT tariff not as expected.

ATT tariff levels exceeds array size in model.

Header from prestored SBS tariff not as expected.

SBS tariff levels exceeds array size in model.

Header from prestored WU tariff not as expected.

Number of items in prestored network array exceeds

number allowed.

Number of items in prestored category A list exceeds

number allowed.

Number of items required for WU access cities exceeds

number allowed.

C-2
f

NUMBER MODULE

S" 3010 NINIT

302U NINIT

3030 GETTFC

GETPER

GETPER

DEFNOD

NCREAT

NCREAT

NOELET

NLSTFL

NLSTFL

TINIT

TINIT

TCREAT

TCREAT

TCREAT

TDELET

TLSTFL

TLSTFL

TLSTFL

TLSTAT

TLSTWU

TLSTSB

ACC

3040

3050

3060

3070

3080

3090

3100

3110

4010

4020

4030

4040

4050

4060

4070

4080

4090

4100

4110

41120

5000

C-3

MESSAGE

File header of network directory not as expected.

Number of files in directories exceeds the capacity of

arrays.

File header of prestored traffic table not as

expected.

File header of TRFVOL file not as expected.

Desired percent not found in table.

Number of user-defined nodes not number put into

array.

File specified for network file already defined.

File specified for network file not in directory.

File name to delete not in directory.

File specified to be printed not in directory.

Header record of file not as expected.

File header of tariff directory not as expected.

Number of files in directory exceeds VAe capacity of

array in model.

File name to create not in directory.

File specified already created.

File type to be created invalid.

File to be deleted not in directory.

File to list not in directory.

File to be listed empty.

File type of tariff to be listed in invalid.

File header of ATT tariff invalid.

File header of WU tariff invalid.

File header of SBS tariff invalid.

Input arguments out of range.
w

x NUMBER MODULE MESSAGE

5010 ATCOST Input arguments out of range.

w

i

5020 CATEG Input arguments out of range.

5030 LISTED Input arguments out of range.

'

G

5040 'MILES Input arguments out of range.

5050 PTRPRS Input arguments out of range.

5060 ROWTOT Input arguments out of range.

li . 3 5070 SBCOST Input arguments out of range.

r

5080 TARTYP Input arguments out of range.

5090 DEFPRE File header of prestored network file not as expected.

r 5100 DIRGEN File header from tariff directory not as expected.

5110 DIRGEN File header from network directory not as expected.

5120 FACSIZ Number of input voice circuits out of range.

5130 RUTH Nodes specified don't exist in user-defined network.

5140 WUCOST Input arguments out of range.

5150 FILDEF Directory requested is invalid.

81000 INPUTB Invalid option code.

k 82010 NETB Invalid network file name.

x

B2020 NETB Network file already defined.

B2030 NETB Invalid network option.

^i

62040 NETB Invalid prestored city code,

82050 NETB Exceeded number of prestored nodes.

± I B2060 NETB Invalid percent for selecting prestored nodes.

k B2070 NETB

Invalid traffic level.

B208U NETB Maximum additional cities exceeded.

B2090 NETB Invalid additional traffic volume.

C-4
F

NUMBER MODULE

22100 NETB

82110 NETB

B2120 NETB

B3000 TARB

B3010 TARB

B3020 TARB

B31OU CRATTB

B3110 CRATTB

84000 EXCONB

B4010 EXCONB

84020 EXCONB

84030 EXCONB

84040 EXCONB

84050 EXCONB

84060 EXCONB

84070 EXCOMB

Nonfatal Errors

1510 INIT

1520 INIT

1530 INIT

1540 INIT

1550 INIT

1560 IBLNET

MESSAGE

Additional traffic entry city not in network.

Traffic table spool option invalid.

Invalid additional city coordinate.

Invalid tariff file name.

Tariff file already defined.

Invalid tariff file type.

Invalid listed city addition/deletion.

Listed city addition/deletion duplication

Negative number of restarts specified.

Invalid option.

Undefined network file.

Undefined tariff file.

Tariff not ATT-type.

Invalid file type.

Negative number of tariff files specified.

No valid tariff files specified.

Error encountered in building tariff input for

specified problem.

Number of tariffs specified in execution control file

out of range.

Error encountered in building network for specified

problem.

Error encountered in building data structured for

specified case - run option out of range.

Error encountered in input for specified case -

proceeding to next case.

Network file requested is not in directory.

I

C-5
NUMBER

1570

1580

1590

1600

1610

1620

1630

j.

1640

1650

1660

1670

1680

1690

1700

1710

3.510

352U

4510

6000

8250

8251

8252

MODULE MESSAGE

IBLNET Network file requested is not defined.

IBLTAR Requested file not defined.

IBLTAR Status of file out of range.

IBLTAR Mismatch between run type and tariff file type.

IBLTAR More than two tariff files specified for mixed run.

IBLTAR Tariff option out of range.

IBLTAR For mixed mode there should be two tariffs defined -

one for an ATT tariff, the other a satellite tariff.

1BLLST Number of breakpoint specified in ATT tariff exceeds

array capacity in model.

IBLTRF Additional traffic specified for a node not in the

user-define network. d

IBLATT Number of mileage breakpoints specified in tariff file

not as expected.

IBLATT Mileage breakpoint specified in tariff file not as

expected.

IBLWU3 Number of satellite access codes for this problem

exceeds array capacity of this model.

IBLSBI Number of entries in CAU cost table grrater than

capacity of arrays in model.

IBLS8S Number of breakpoints in SBS table not as expected.

IBLSBS Breakpoint values in Si3S table not as in prestored

tariff.

NDELET File name to delete has already been deleted.

NLSTFL File specified to be printed not defined.

TDELET File name to delete has already been deleted.

OUT1 Tariff in problem has invalid type.

0 NETB Prestored node duplication.

i

0 NETB Additional city a prestored node.

0 NETB AddiVonal city duplication.

C-6
NUMBER I40DULE MESSAGE

82530 NETB Additional traffic pair duplication.

B35OU CRATB City to be added already listed.

B3510 CRWUB City to be deleted not a listed city.

B3600 CRWUB Access pair category change erroneous.

83610 CRWUB Access pair to be deleted not in list.

83620 CRWUB Category out of range.

83630 CRWUB Access pair duplication.

B3700 CRSBSB Duplicate NAC entry.

B7710 CRSBSB Less than three NACs specified, zero HACs assumed.

84500 EXCONB Maximum problems exceeded.

B4510 EXCONB Maximum tariffs exceeded.

84520 EXCONB Tariff file duplication.

84530 EXCONB Undefined tariff file.

84540 EXCONB Invalid file type.

B4550 EXCONB Invalid output table number.

C-7