Asynchronous Transfer Mode Network for the Department of National Defence

Design and Optimization of an Asynchronous Transfer Mode Network for the Department of National Defence

by J. J. M. Girard, BEng Major, Canadian Armed Forces

A thesis submitted to the Department of Engineering Management Royal Military College of Canada Kingston, Ontario

In Partial fulfillrnent of the requirements for the degree Master of Engineering July 1995

(c) Copyright 1995 by J.J.M. Girard This thesis may be used within the Department of National Defence but copyright for open publication remains the property of the author. National Library Bibliothèque nationale m*l of Canada du Canada Acquisitions and Acquisitions et Bibliographic Services services bibliographiques 395 Wellington Street 395, nie Wellington -ON K1AW OüawaON K1AON4 Canada Canada rour& votre ldfënmce

Our Me Notre nlfér~l~a

The author has granted a non- L'auteur a accordé une licence non exclusive licence allowing the exclusive permettant à la National Library of Canada to Bibliothéque nationale du Canada de reproduce, loan, distribute or sell reproduire, prêter, distribuer ou copies of this thesis in microfom, vendre des copies de cette thèse sous paper or electronic formats. la forme de microfiche/film, de reproduction sur papier ou sur format électronique.

The author retains ownership of the L'auteur conserve la propriété du copyright in this thesis. Neither the droit d'auteur qui protège cette thése. thesis aor substantial extracts f?om it Ni la thèse ni des extraits substantiels may be printed or othemise de celle-ci ne doivent être imprimés reproduced without the author's ou autrement reproduits sans son permission. autorisation. Abstract

In the past, the Department of National Defence (Dm) has had nurnerous telecommunication networks. The most recent neh~orkacquïred (1989) is the Integrated Data

Network (IDN). Its highest bandwidth link is 56 kbps. With new cornputer projects requir- hg larger bandwidth like videoconfêrencing, IDN will not have enough bandwidth to meet the requirements of DND for the future.

This thesis presents a mathematical model, using a linear programming formulation, to find the nebvork topology that DND will need to meet its fuhw requirements.

The objective function of this model is to minirnize the leasing costs of links fiom Tl

(1 -544 Mbps) to OC- 12 (622.08 Mbps) with the constraint of a maximum link utilizationl delay. Another constraint is that there are at least two paths fiom any node to any other node. This thesis also presents the results of trafic analyses done to forecast the fiiture requirements of trafic for DND.A commercial software package, called GAMS, was used to optimize the objective function. Another commercial software package, OPNET, was used to verifj the level of service of the network found by GAMS to see whether it is acceptable (Le. end-to-end delay). Acknowledgments

I wish to thank Dr. M.H. Rahman and Dr. B.W. Simms of the Royal Military Col- lege of Canada for their valuable help and support throughout this thesis. This thesis would not have been completed without their help. 1 also would like to thank Capt David

Lincourt, Capt Connie Mayor and Mr. Mumay Anderson, nom the Engineering Manage- ment Department for their continuous support and fkiendship. I also would like to thank my colleague, Capt John Weigelt for his niendship and the sharing of information about

OPNET. 1 would like to acknowledge the support of Mr. Richard Beaty and the staff of

RMC Computing Services for giving me the computing resources necessary for my thesis and the technicd support. Finally, I wish to thank my wife, Gy1 for her patience and support throughout this Masters' degree program. Dedication

This thesis is dedicated to my farnily, Gyl, Tanya and Katrina. This thesis and the

Masters' degree program would not have been completed without their patience and love. le vous aime. Table of Contents

Abstract ...... i

O 9 Acknowledgments ...... 11 ... Dedication ...... UI

Viîa ...... iv

Table of Contents ...... v ... List of Figures ...... y111

List of Tables ...... x

CHAPTER 1 ENTRODUCTION ...... 1 1 .1 Background ...... 1 1.2 Aim ...... 3 1.3 Related work ...... 3 1.4 National Communication System Infrastructure ...... 4 1.5 OutIine of the Thesis...... ,...... 5

CfIAPTER 2 ASYNCHRONOUS TRANSF'ER MODE ...... 6 2.1 History of Telecommunication ...... 6 2.2 Broadband-ISDN (B-ISDN)...... 14 2.2.1 B-ISDN Protocol Reference Mode1 (PRM) ...... 14 2.2.1.1 Physical Layer ...... 15 2.2.1.2 ATM Layer ...... 16 2.2.1.3 Adaptation ATM Layer (AAL) ...... 20 2.2.2 B-ISDN Network Concept ...... -22 2.2.3 B -1SDN Reference Configurations ...... -24 2.2.4 Future of B-ISDN ...... 25 2.3 Summary ...... 27

CHAPTER 3 MATHEMATICAL MODEL ...... 0.28 3.1 Background ...... 28 3.2 Mode1 Fomulation ...... -30 3.2.1 Generd Algebraic Modeling System (GAMS) Prograrn ...... 34 3 2.2 Development ...... -35 3.2.2.1 Three-Node Network ...... 35 3.2.2.2 Four-Node Network ...... 37 3.3 Summary ...... 40

CHApTER 4 NETWOW WC...... 41 4.1 Background ...... 41 4.2 Voice ...... 42 4.3 Video ...... 45 4.4 Data ...... 50 4.4.1 IDN Capacity Management Plan ...... 50 4.4.2 IDN Defence Message Handling System (Dm)...... 52 4.4.2.1 Background ...... 52 4.4.2.2 DEMS Traffic Volumes ...... -52 4.4.2.3 MMHS Traffic Volumes ...... 53 4.4.2.4 Assumptions ...... 53 4.4.2.5 Sample Calculation ...... 54 4.4.2.6 Summary ...... 55 4.4.3 Interfacility Data Comms Requirements Analysis for Military Automated Air Traffic System (MAATS) ...... 57 4.4.3.1 Background ...... 57 4.4.3.2 Operational Requirements for Communication ...... 59 4.4.3.3 Sample Calculation ...... 61 4.4.4 Canadian Forces Supply System Upgrade (CFSSU) ...... 64 Background ...... 64 Assumptions ...... 64 Sample Cdculation ...... 65 4.4.5 Quality Assurance Management Information System (QUAMIS) ...... -66 4.4.5.1 Background ...... 66 4.4.5.2 Assurnptions ...... 66 4.4.5.3 Leased Line Traffic ...... 67 4.4.6 Es timated Trafic Analysis ...... 67 4.4.7 Estimate of Network Trafic ...... 69 4.4.7.1 Network Traffic ...... 69 4.4.8 Trafic Proportion ...... -69 4.5 Summary ...... 71

CHAP'lXR 5 GAMS RESULTS.eo.eem.ee...... *...... 72 5.1 Introduction ...... 72 5.2 25 Node Network ...... 72 5.2.1 Initial Network Topology ...... -72 5.2.2 GAMS PROGRAM ...... 72 5.2.3 Development ...... -74 5.2.4 Results ...... 76 5.3 Summary ...... 87

LIST OF FIGURES

Figure 2.1 .Step-by-Step Switch ...... 8

Figure 2.2 .Crossbar Exchange ...... 8

Figure 2.3 .OS1 Reference Mode1 ...... 11

Figure 2.4 .B-ISDN Protocol Reference Mode1 ...... 15

Figure 2.5 .ATM CelI Format ...... 17

Figure 2.6 .Celi Header for the B-ISDN UM and the B-ISDN NNI ...... 18

Figure 2.7 .ATM Adaptation Layer Services ...... 21

Figure 2.8 .Relationship between VPs, VCs and Transmission Path ...... 23

Figure 2.9 .B-ISDN Reference Configuration ...... 24

Figure 3.1 .Three-Node Network ...... 35

Figure 3.2 .Four-Node Network ...... 37

Figure 3.3 .Optimized Topology for a Four-Node Network ...... 38

Figure 4.1 .Military Video Network Usage ...... 48

Figure 5.1 .Initial Topology ...... 75

Figure 5.2 .Optimized Topology with 95% Link Capacity ...... 77

Figure 5.3 .Link Utilization vs . Objective Function for 0% uicrease ...... 79

Figure 5.4 .Delay vs . Objective Function for 0% Increase...... 80

Figure 5.5 .Link Utilization vs . Objective Function for 10% Increase ...... 81

Figure 5.6 .Delay vs . Objective Function for 10% Increase ...... 81

Figure 5.7 .Link Utilizaüon vs . Objective Function for 15% Increase ...... 82

Figure 5.8 .Delay vs . Objective Function for 15% Increase ...... 82 Figure 5.9 .Link Utilization vs . Objective Function for 20% Lncrease ...... 83

Figure 5.10 .Delay vs. Objective Function for 20% Increase ...... 83

Figure 5.1 1 .Link Utilization vs . Objective Function for 10% Increase Comp.. 84

Figure 5.12 Delay vs . Objective Function for 10% Increase Compounded ...... 84

Figure 5.13 .Link Utilization vs . Objective Function for 15% Increase Comp .85

Figure 5.14 Delay vs . Objective Function for 15% Increase Compounded ...... 85

Figure 5.15 .Link Utilization vs . Objective Function for 20% Increase Comp ..86

Figure 5.16 .Delay vs . Objective Function for 20% Increase Compounded ..... 86

Figure 6.1 .ATM Module Mode1 ...... 89

Figure 6.2 .ATM Node Mode1 ...... 89

Figure 6.3 .Probability Density Function for the TrafEc Leaving CFB Borden 9 1

Figure 6.4 .Borden Crossconnect Switch ...... 94

Figure 6.5 .ATM WAN for DND ...... 95

Figure 6.6 .End-to-End Delay for 0% Increase ...... 98

Figure 6.7 .Ce11 Delay Variation for 0% Increase ...... 98

Figure 6.8 .End-to-End Delay for 10% Increase ...... 100

Figure 6.9 .Ce11 Delay Variation for 10% lncrease ...... 100

Figure 6.10 .End-to-End Delay for 20% hcrease Compounded ...... 102

Figure 6.11 .Cell Delay Vanation for 20% Increase Compounded ...... 102 LIST OF TABLES

Table 2.1 .B-ISDN Services ...... 13

Table 2.2 .Payload Type Indicatoa ...... 19

Table 3.1 .Trafic Between Bases ...... 36

Table 3.2 .Possible Link Capacities ...... 37

Table 3.3 .Li& Capacity for the Three-Node Network ...... 37

Table 3.4 .Trafic on Each Link ...... -38

Table 3.5 .Trflic Between Bases ...... -39

Table 3.6 .Link Capacity for Four-Node Network ...... 40

Table 4.1 .Number of Tmnks Required per Base ...... 45

Table 4.2 .Number of Videoconferencing Terrninals Required per Base ...... 47

Table 4.3 .Usage of Military Video Net ...... 48

Table 4.4 .Bandwidth Requirement for Videoconferencing per Base ...... 49

Table 4.5 .Example of IDN Study ...... 52

Table 4.6 - Upgrade Trunks Required for IDN ...... 56

Table 4.7 - MAATS Element Physical Locations ...... 59

Table 4.8 - MAATS Operational Service Requirements ...... 60

Table 4.9 - MAATS Communication Requirements ...... 62

Table 4.10 .Dataflow Characteristics ...... 62

Table 4.1 1 .Surnmary of Communication Access Requirements ...... 64

Table 4.12 .Messages per Day ...... -66

Table 4.13 .CFB Borden Trac Proportion ...... -70

Table 5.1 .Cost of Links ...... 74 Table 5.2 .Results for Optimization at 95% Capacity ...... 76

Table 6.1 .Sources' Packet Size ...... 92

Table 6.2 - SimuIation Results for 0% Increase ...... 97

Table 6.3 - Simulation Results for 10%Increase ...... 99

Table 6.4 - Simulation Results for 20% Increase Compounded ...... 101 GLOSSARY OF ACRONYMS

1ESS Fust Electronic Switching System AAL ATM Adaptation Layer ACC Area Control Centre ADDN Automated Defence Data Network ADIS Automated Data Interchange System ADIZ Air Defence Identification Zone ADS Aeronautical Data Service AMDS Aircraft Movement Data Service AMIS Aircrafl Movement Information Service AMMIS Aircraft Maintenance Management Information System ARDS Altitude Reservation Data Service ARPANET Advanced Research Projects Agency Network ARU Altitude Reservation Unit ATC Air Tr&c Control ATCCU Air Transportable Communication and Control Unit ATM Asynchronous Transfer Mode ATS Air Trac Services AVPN ATM Virtual Private Network AWAN Army Wide Area Network B&B Branch and Bound B-ISDN Broadband Integrated Services Digital Network B-NT1 Broadband Network Termination 1 B-NT2 Broadband Network Termination 2 B-TA Broadband Terminai Adapter B-TE I Broadband Terminal Equipment 1 B-TE2 Broadband Terminal Equipment 2 BBPREPROC Bsanch and Bound Pre-processor BCCN Backbone Cornputer Communication Network BRi Basic Rate Interface BVPN Broadband VMPrivate Network CAATS Canadian Automated Air Tmffic System CAPERRS Cornputer Assisted Publication and Electronic Records Retrieval System CBR Constant Bit Rate cc1T-r Comite Consultatif International de Telegraphie et Telephonie CCPS Central Computation Pay Systern CFB Canadian Forces Base CFS Canadian Forces Station CFSS Canadian Forces Supply System CFSSU Canadian Forces Supply System Upgrade CFWRS Canadian Forces Waning and Reporting System CLP Ce11 Loss Pnority CLS Comectionless CO Central Office CPCS Common Part Convergence Sublayer CPN Customer Premises Network CS Convergence Sublayer CSMN Canadian Supplementary Military Network DDS Defence Data System DEMS Department E-Mail System DGQA Director General Quality Assurance DMHS Defence Message Handling System DND Department of National Defence DTS Defence Telephone System EEC Exercise Evaluation Ce11 EMS Emergency/Alert Message Service ESM Equipment System Management EVPN End-to-End Virtual Pnvate Network

... Xlll FAU Flight Advisory Unit FDDI Fiber Distributed Data Interface FDS Flight Data Service FIS MU11 Financial Information Sy stem Mark III FPDS Flight Planning Data SeMce FPSC Flight Planning Senice Connection FRM Fast Resource Management GAMS General Algebraic Modeling System GFC Generic Flow Control GMS General Mail Service GP ADP General Purpose Automated Data Processing GTIS Government Telecommunication Information System HDW Hi& Defuiition Television HEC Header Error Control 1AS Integrated ADP System IDN Integrated Data Network IFR Instrument Flight Rules NP Intranode Policy ISDN Integrated Services Digital network IT Information Technology ITU International Telegraph Union IWU Inter Working Unit kbps kilobits per second LAN Local Area Network LCMM Life Cycle Maintenance Manager LEMOS LEME Operation System LFIS Land Forces Information System LP Linear Programming MAATS Military Automated Air Traffic System

xiv Mbps Megabits per Second MDS Management Data Se~ce MMHS Military Message Handling System MMS Maintenance Management System MOC Maritime Operation Centre MPCFA Multipenod Capacity and Flow Problem MPIS Military Personnel Information System MSAX Maritime Semi-Automatic Exchange MTCU Military Terminal Control Unit NAAS NORAD Attack Alert System NAFTOC NORAD Automated Forward Telephone Output Circuit NCSI National Communication System Infrastmcture NDHQ National Defence Headquarters NMDS National Material Distribution System NMMIS Naval Maintenance Management Information System NNI Network-Network Interface NNP Neighbow Notification Protocol OPNET OPtimized Network Engineering Tool OSIRM Open Systems Interconnection Reference Mode1 OSL Optimization Subroutine Library PAM Pulse Amplitude Modulation PANDA Packet Network Design and Analysis PAR Precision Approach Radar Pb Probability of Blocking PBX Private Branch Exchange PC Personal Cornputers PCM Pulse Code Modulation PDF Probability Density Function PDP Program Development Plan PM Physical Medium PMD Physical Media Dependant PRI Prirnary Rate Interface PRM Protocol Reference Model PSDN Packet Switched Data Network PT Payload Type PWM Pulse Width Modulation QOS Quality of Service QP Quadratic P rogramming QS Quant System QUAMIS Quality Assurance Management Information System RCC Rescue Coordination Centre RSDS Radar and Sensor Data Service SAR Segmentation and Reassembly SAR Search and Rescue SDR Static Distributed Routing SMSS Strategic Message Switching System socc Sector Operational Control Centre SPCFA Single Period Capacity and Flow Allocation SSCS Service Specific Convergence Sublayer TATS Tactical Air Traffic System TC Transmission Convergence TDS Time Division Switching UNI User-to-Network Interface VBR Variable Bit Rate VC Virtual Channel VCC Virtual Channel Connection VCI Virtuai Channel Identifier VFR Visuai Flight Rules VP Virtuai Path VPC VirtuaI Path Connection VPI Virtual Path Identifier WAN Wide Area Network WDS Weather Data Service

xvii Chapter 1

Introduction

-in the paa three decades, telecommunication technology has changed drarnati- cally with the arrivai of personai computers (PC), private branch exchange (PBX), terres- trial digital system and fiber optic networks. This technological evolution started in the early 1960's with the development of the cornputer network called TYMNET. Following this. there were numerous other computer networks that were engineered like Advanced

Research Projects Agency Network (ARPANET)and Canadian DATAEX in the 1970's.

During and since this time, the Department of National Defence @ND) has tried to follow this developing technology with, as ai ways, a financial constraint attached to it.

The Defence Data System (DDS), designed and implemented in the late1970s, provides secure and non-secure data communications to units and formations in Canada and abroad, to other govemment agencies and to allied military organizations. DDS is divided into three parts:

a. Strategic Message Switching System (SMSS),

b. Canadian Forces Waming and Reporting System (CFWRS)and

c. General Purpose Automated Data Processing (GP ADP).

SMSS has the following networks:

a. Automated Defence Data Network (ADDN): This network is the store and fonvard

message network that is used by DND;

b. Canadian Supplernentary Military Network (CSMN): It provides reliable and secure digital communications for DND. It is a secure teletype user-oriented network;

and

c. Maritime Semi-Automatic Exchange (MSAX). This network conneas the ships to

installations on shore.

CFWRS is not a communication system. Its purpose is to collect, correlate and disseminate al1 information conceming imminent or actual nuclear attack. Tu accomplish these tasks, CFWRS uses numerous communications systems such as:

a. ADDN;

b. Defence Telephone System (DTS);

c. National Waming Teleprinters circuits;

d. NORAD Autornated Fonvard Telephone Output Circuit (NAFïOC);and

e. NORAD Attack Alert System (NAAS).

GP mPis divided into two major components: Integrated ADP System (IAS) and stand-alone ADP systems. The IAS involves data networks such as Financial Informa- tion System (FIS MknI), Central Computation Pay System (CCPS)and Canadian Forces

Supply System (CFSS). The stand-alone ADP systems are smaller data networks which have specific applications to a command headquarter or directorate.

By the early 1980'~~DND desired to have its own data network. The Integrated

Data Network (IDN) was implemented in September 1989. This data network provides

DND a secure cornputer data communication infiastmcture that is necessary to link all sub-networks that are available within DND. IDN was supposed to provide enough bandwidth and switching power for the requirements of data communication. However as of now, DND has not escaped the high demands of technology within the department and the demand for the increase of bandwidth cannot be denied. iDN will not be able to handle

much more trafic in the near future, since both its bandwidth (56 kbps maximum) and its

switching power (X.25 protocol) will not suffice to meet the fùture requirements of data

traEic for DND. Also the deficiencies, as noted in the DMHS tr&c study [29], for al1

information technology (IT) systems in DND are as follows:

a. most of the information systems and networks are not interconnected;

b. most of these systems do not have any management capabilities; and

c. many existing networks, like IDN, will not support upcoming applications which

are bursty, high bandwidth demands and/or multimedia data.

laLiin The aim of this thesis is to design and optimize, by minimizing the cosf an

Asynchronous Transfer Mode (ATM) based network that will meet Dm's requirernents

for the future. This proposed network will be optimal by achieving mini rnum cost wi th an

acceptable level of service. The trafic requirement analysis for DND will take into con-

sideration various Information Technology (IT) projects up to the end of the century. c ATM technology is very recent and it provides the possibility of the arnalgam- ation of three types of communication sources in one pipeline; voice, data and video.

Numerous research, some of which are discussed below, have been done to develop ATM networks using different constraints. ûerla [24] designed an ATM public switched network embedded into a backbone facility network. He forrnulated the problem as a network optimization problem where a congestion measure based on the average packet delay is minimized, subject to capacity constraints of the links used.

Fotedar et al. [19] developed an ATM Virtual Path Network (AVPN) comparing

End-to-End Virtual Private Network (EEVPN) with Broadband Virtual Private Network

(BVPN). The following points are a surnmary of their findings:

a. BVPN solved the congestion problem better than EEVPN.

b. By comparing the cost of an ATM network using two strategies, fast resource man-

agement (FM)and intranode policing (INP), they observed that both of these strate-

gies have comparable performances.

c. There were substantial bandwidth savings over the conventional end-to-end Virtual

Path (VP) approach, depending on the number of nodes in the network.

. . 1.4 NatipDal CommunicatinnSvstemInfram To resolve the deficiencies mentioned above, DND is working on a project called National Communications Systems Infrastructure (NCSI) which began in June

1993. The NCSI project will develop, define and implement an integrated, common user, survivable enterprise-wide communication network to support DND management and CF operations. It will provide the architecture, standards, migration strategy and infrastructure necessary to interconnect DND's existing and planned data, voice and video systems, and will support interoperability among end-users. The NCSI team hopes to have the Program

Development Plan (PDP)approved by Dec 1995. However, as of now, they have not produced a target architecture and a trafic analysis has not been completed to enable them to develop the ATM network for DND.

This thesis was derived from the NCSI project. There has not been an initial topology of the network as of yet and no collection of trafic analyses has been done.

5 Omeof the The&

This thesis contains seven chapters and the contents of the six remaining chap-

ters is as follows. The purpose of Chapter 2 is twofold. First, it outlines a history of tele-

communication technology, then it explains ATM and its components. Chapter 3 describes

the mathematical model used to find an optimized model and results from the General

Algebraic Modeling System (GAMS) optimization software fictional runs that were done.

Chapter 4 contains the description of traffic analyses used for this thesis. These analyses were collected to find out the required capacity of links needed for the network. Chapter 5

will demonstrate the results of the GAMS optimization for the 25-node network that is

developed for this thesis for the requirements of DND.Chapter 6 will examine one of the topologies found in Chapter 5 and this topology will be used to run simulations using a

network simulation software cal led OPtimized Network Engineering Tool (OPNET).

These simulations will be done using different traffiic rates and will demonstrate that the

network used meets an acceptable level of service for ATM. Finally Chapter 7 presents the conclusion and recommendations for fùture work. Chapter 2

Asynchronous Transfer Mode

1 H&rvofTelecPmmuniçatian. .

This chapter will be divided into two parts. Firsf it will describe the history of telecornmunication. Then, it will go into some detail to describe ATM and its components.

Postal services date back to at least the Middle Ages when royal messengers services delivered letten around Europe. Also, the Holy Roman Empire (which included parts of modem Gemany, Austria, Hungary, Poland and Czechoslovakia) gave the monopoly in 1544 to the Thum und Tassis family to provide a postal service. But in the

United States, postal services are best remembered by the Pony Express, whose horse nd- ers delivered the mail to various places in the Wild West. However this particular service did not last long, it was rendered obsolete in the 1840s when Samuel Finley Breese Morse developed the classical Morse telegraph which was the begi~ingof the new era in telecommunication.

The telegraph method is considered to be the oldest way of telecommunication switching: message switching. To enable telegrarns to be sent across borders, The Interna- tional Telegraph Union (ITU now known as the International Telecommunication Union) was fonned in 1865 and has been part of United Nations cornmittees since 1948.

The first telephone cal1 was made by Alexander Graham Bell when he spilled something corrosive on one of the two "telephones" he had made and talked to his assis- tant through it. These telephones were used only as intercoms in those days, since they were connected to each other by a single wire. But as the technology advanced, telephones were connected to nvitchboards and these switchboards were involved in relaying calls between two or more parties over a long distance.

The main difference in transmission technology between the (digital) telegraph and the (analog) telephone is that the telegraph operator could receive and retransmit the same message without error, but the quality of voice for the telephone would degrade because of the number of trunk lines the cal1 had to go through before arriving at its destination.

At that time, the operators had to physically connect the telephone cal1 thmugh their manual switchboard. Then came the automatic telephone exchange, which was invented by Almond Strowger. It was called the step-by-step switch. As Figure 2.1 shows, the switch is divided into three parts: line feeder, selector and connector. The line feeder detects lines that go off-hook and connects them to a dia1 tone when its associated selector is ready to receive digits. The selector (first selector, second selector etc.) accepts one dialed digit at a time, moving its contact am vertically and then spins horizontally until it finds a free path out. This allows each first selector to be connected to as many as ten second selectors. The connector cm decode two digits, the first digit moves the contact am vertically and the second, which is associated to a specific subscnber line, moves horizontally. The connector also applies ringing voltage to the called line. AT&T, which began to use this switch in the late 1920s (after waiting for the patent to expire), manufactured it until 1969.

By the 1930s, a more advanced switch was invented: the crossbar switch. This invention was made by L.M. Ericsson and AT&T. Figure 2.2 shows a simplified diagram of the crossbar exchange. This switch has two separate functions: the matnx carries the voice signal from source to destination while a separate cornmon control decodes the dialed digits and finds the best path for the call to follow.

Figure 2.1 Step-byStep Switch -Path d tan-

Figure 2.2 Crossbar Exchange The crossbar exchange was most popular in North America, but i t also found some applicationsin lapan. This exchange is responsible for the numbering plan in North

America, in which area code and prefix codes are aiways three digits long and then fol-

Iowed by a four-digit line number.

The electronic digital cornputer was invented in the early 1940s and the transis- tor in 1948, but even though the transistonzed cornputer became available in the Iate

1950s, it took Bell Labs until 1965 to develop its first electronic switching system (IESS).

Ln the switch, any given connection involved a path through the exchange over a conduc- tor and a path was assigned to that cal1 alone. Since the calls were separated in space, this was refemed as space division switching. As Nyquist's theorem States in Tanenbaum [39]

(p. 95), any signal can be reproduced by sampling it fast enough, therefore a single connection cm be used to carry many different signals if enough sampling cm be interleaved without overlapping. This is called time division switching (TDS).There were two types: analog and digital TDS. The analog TDS had two versions: pulse amplitude modulation

(PAM) and pulse width modulation (PWM). PAM was less costly than PWM, but more susceptible to noise and cross talk. PWM found limited use in the mid to late 1970s. PAM is still used today with pulse code modulation (PCM) which is descnbed below.

Analog TDS was a transitional phase in the development of telecommunication networks as they went to digital technology. The simplest form of digitized audio is PCM which uses 8000 samples per second, each sample transmitted using eight bits. Digital

TDS has several advantages over analog TDS:

a. any digital transmission cm be easily intenaced with the switch by using the same

digitization technique and b. the receiver only needs to distinguish between Os and 1s.

However digital TDS needed a coder-decoder (codec) to convert the analog voice signal into a digital bit Stream and vice vers9 which made the switches fairly expen- sive. By the early 1980s, however, with improved technology the switches becarne c heaper.

Now, most of the telephone networks are using circuit switching, which provides a fixed amount of bandwidth, either analog or digital. for the duration of the cail.

However, this is not ver-efficient since a lot of bandwidth is wasted which is the most important reason why packet switching was developed.

In packet switching technology, packets from multiple users share the sarne distribution and transmission facilities. The evolution of packet switching brought with it different standards. In 1976, Cornite Consul tatif International pour Telephone et Telegraphie

(CCITT)approved a three-layered interface architecture for packet switching called X.25.

This has since been adopted by almost every packet-switched network and vendor. Then in 1983, CCITT finally approved another standard, called the Open Systems Interconnec- tion Reference Mode1 (OSIRM). This mode! describes data communication in seven layers as explained by Tanenbaum [39] (pp. 16-2 1):

a. Physicai Layer: involves the transmission of raw bits over a communication chan-

ne1 .

b. Data Link Layer: breaks the input data up into data Mes,transmits them sequen-

tially and processes the acknowledgment frames sent back by the receiver. " c. Network Layer: determines the host interface and how the packets are routed in the

network. d. Transport Layer: accepts data from the session layer, passes them to the nework

layer and ensures that ail packets amve correctiy.

e. Session Layer: the user's interface into the network. Once the connection has been

established, the user can begin the dialog with the other end.

E Presentation Layer: performs hnctions that are requested suficienily often to war-

rant finding a general solution for them, rather than letting each user solve the prob-

lem, e.g. Vimial Terminai Protocols (VTPs).

g. Application Layer: the layer which is determined by the user. It allow the user to set

some standards for what he wants to see.

Figure 2.3 shows these layers.

FTAM, VTP, MHS, etc. (7) Application

Presentation Protocol (6) Presentation

Session Protocol (5) Session

Connection-oriented Transport Tp (4) Transpo* Protocol classes 0-4 lCL 1

/ Modems, winng, etc. 1 1 (1) Physical

Figure 2.3 OS1 Reference Mode1

By 1980, most major PBX manufacturers had announced a new data-switching capability; integration of data and voice. That is when Integrated Services Digital Net- works (ISDN) was launched into the telecommunication market. This is an end-to-end digital network, in which al1 components are recognized to be digital and are connected to each other accordingly. There are three basic types of channel defined for ISDN cornmuni- cations:

a. D-Channel:carries signals for user-network signalling and could aiso carry user-

data packets. Its bit rate is 16 kbps or 64 kbps depending upon the user's access inter-

face.

b. -: carries information for user services, including voice, audio, video and

digital data. It operates at the DS-O rate (64 kbps).

c. -: provides fixed increments of bandwidth that cm be used for circuit and

packet mode services. It offers higher speed than B channel, such as 384 kbps (Ho

channel), 1.536 Mbps (HI channel) and 1.%O Mbps (Hiz channel in Europe).

ISDN standards currently define two different access interfaces to the network called the basic rate interface (BRI) and the primary rate interface (PEU). The BRI comprises two B-Channels and one D-Channel and could be used between a residential or business customer and the ISDN central office (CO.).Altematively, BR1 can provide

ISDN access between user equipment and an ISDN-compatible PBX in a business environment. The total bit-rate is L 92 kbps, including 2 X 64 kbps channels and one 16 kbps channel plus additional signahg for the physical connection. In North America, the PRI comprises 23 B-channels and one D-Channel, where the D-Channel operates at 64 kbps.

This PRI is based upon the T 1 carrier, which provides 1.544 Mbps.

One significant feature of ISDN is that it supports a wide range of services.

However more and nîore services require more bandwidth than ISDN can provide. Broad- band services, as show in Table 2.1, require significantly higher bit rates than those provided by the PR1 and BRI. Broadband services, however, can be supported by the B-[SDN network.

Table 2.1: B-ISDN Services

Type of Information Examples of Broadband Services Conversational 1 Moving pictures and sound 1 Broadband video telephonykonference 1 Video surveillance services Videolaudio information transmission services Sound Mu1 tiple-sound prograrn signals Data High-speed digital information transmission 1 High-volume file transfer senrices High-speed teleaction

-- -- Document High-s peed telefax High-resolution image communication ser- vi ces 1 1 Document communication services 1

Moving pictures (video) and Video mail service sound Document Document mail service Retrieval 1 Text, data., graphies, sound, still 1 Broadband videotex 1 images and moving pichires Video retrieval services High-resolution image retrieval services Data retrievd services Document retrieval services Table 2.1: B-ISDN Services

Type of Information Examples of Broadband SeMces Distribution without user-individual presentation control

-- - Moving pichires and sound Video information distribution services Text, graphics and still images Document distribution senrices

------1 Data T High-speed information distribution services 1 Existing quality TV distribution services Video Pay TV

1 1 High-definition TV distribution services 1 Distribution services with user-individual presentation control Text, graphics, sound and still Full-channel broadcast videography images

nd- ISDN (B- [SDN) To support broadband services. the Broadband-ISDN has been designed. It is planned to provide a wide range of services including high definition TV PTV).B-

ISDN is a packet switched network with fixed sized cells (53 bytes), known as ATM cells.

A brief description of the B-ISDN protocol reference mode1 and its layers follow.

2.2.1 B-ISDN Protocol Reference Model (PRM)

In the last three years there has been a lot of work done to define the B-ISDN

Protocol Reference Model. Handel et al. 1281 give a very good basic knowledge of the

PRM in 1990 as defined by CCITT Recommendation 1-321 [9]. Figure 2.4 illustrates the latest version from Onvurai [35] (p. 19) of the B-ISDN PRM.

User Plane 1 I I ATM Adaptation Layer I -----/II.ATM Layer I Physical Layer I/

Figure 2.4 BISDN Protocol Reference Mode1

The physical Iayer provides the transmission payload which carries the ATM cell Stream. At the transmining side, the ATM ce11 is mapped into the transmission payload. The functions of the physical layers are divided into two:

a. the Physical Media Dependent PMD) sublayer provides bit transmission capabili-

ties, including the generation and reception of waveforms suitable for the medium,

insertion and extraction of symbol timing information and electical-to-optical and

optical-to-electrical transformations. The functions of the PMD layer are classified

into two parts, bit timing and line coding, and the physical medium layer.

b. the Transmission Convergence (TC) sublayer performs the Header Error Control

(HEC) generation and verification, frame and ce11 delineation and line coding. On the

transmit side, the TC sublayer receives cells from the ATM layer and packs them into the appropriate physical medium (PM) format. At the link, a continuous Stream of

cells (bytes) is required. This necessitates insertion of idle cells into the medium when

no cells are passed from the ATM layer. These cells are identified by a specific header

value and are not passed to the ATM layer.

72 12A'Mu

The AIU layer is common to al1 services and provides ce11 rnultiplexing, demultiplexing and routing functions using the Virtual Path Identifier (VPI)and Virtual

Channel Identifier (VCI) fields of the ce11 header. The ATM layer also supervises ce11 flow to ensure that connections stay within the limits negotiated at the cal1 establishment phase and the layer will also take corrective actions to make sure that the service quality of connections stay within the negotiated parameters. The ATM layer is also responsible for ce11 sequence integrity for each source, however it does not provide the following:

a. information on the frequency of the synchronous clock of the network;

b. detection of misinserted cells;

c. detection for lost cells;

d. awareness of the content of user infonnation; and

e. means to determine and handle ce11 delay variation.

The ATM layer does not need to provide these functions because not al1 are necessary for every B-ISDN application. For example, voice does not require awareness on the contents of the information and data trafic does not need infonnation on the frequency of the service clock. That is why the next layer has been called the ATM Adaptation Layer

(ML). Its role is to provide for each service class the functions required in reaching the classes' quality of service. The ATM layer receives a 48-byte ce11 from the AAL and appends its header to it.

There are different kinds of cells that have been defined by CCITT Recomrnen- dation 1.321 [9]:

a. MeCeu (physical layer): A ce11 which is insertedextracted by the physicai layer in

order to adapt the ceIl flow rate at the boundary between the ATM layer and the physi-

cal layer to the available payload capacity of the transmission system used.

b. md CeU (physicai layer): A ce11 whose header has no errors or has been modified

by the ce11 header error control WC)verification process.

c. (physical layer): A ceII whose header has errors and has not been mod-

ified by the HEC verification process. This ce11 is discarded at the physical layer.

d. AssiBned (Amlayer): A ce11 which provides a service to an application using

the ATM layer service.

e. Unasçimied Cd(ATM layer): An ATM Iayer ce11 which is not an assigned cell.

Only assigned and unassigned cells are passed to the Amlayer from the physicai layer and are described below. The ce11 format is shown in Figure 2.5.

5 bytes 48 bytes 1 Header Information Field

Figure 2.5 ATM Ce11 Format

The ATM ce11 header contains the following fields: generic flow control (GFC), virtual path identifier (VPI), vimial channel identifier (VCI), header error control (HEC), payload type (PT) and ce11 loss prionty (CLP). The header format at the B-ISDN user-network interface (UNI) is different than the B-ISDN network-node interface (Nm (interface between network nodes), as illustrated in Figure 2.6. At the B-ISDN LM, the first four bits compose an independent unit, GFC, whereas at the B-ISDN NNI these bits are part of the Virhial Path Identifier (VPI).

Bits Bits 1 ... 4 5 ... 8 1 ... 4 5 ... 8 1 1 GFC VPI VPI

2 VPI VCI -7 VPI VCI

Bytes 3 VCI Bytes 3 VCI

4 VCI pT 2LP 4 VCI * CLP

5 HEC 5 HEC 6 6 Information Field Information Field

53, 53 B-ISDN UNI B-ISDN NNI

Figure 2.6 - Ce11 Header at the B-ISDN UNI and the B-ISDN NNI

GFC is a four-bit field providing the control of flow of ATM connections of various quality of service levels at the UNI. This mechanism will be used to control the flow of cells to avoid congestion. Two modes of operation are defined for the GFC field: uncontrolled access and controlled access. The former is expected to be used in early ATM deployments and has no impact on the user's tracsent to the network. The UNI will control the flow rate of cells through controlled access.

ATM is a connection-oriented technique and virtual circuits are required to be established between the end nodes before transmission can start. Routing of cells is done using VPIs and VCIs. These two were defined by CCITT Recommendation 1.113 [6]as:

a. Virtual Channel (VC); a concept used to describe unidirectional transport of ATM cells associated with a common unique-identifier value, referred to as the VCI.

b. Virtual Path (VP); a concept used to describe the unidirectional transport of cells

belonging to VCs that are associated by a common identifier value, referred to as the VPI.

VPIs are used to route packets between two nodes that originate, remove or ter- minate the VP, whereas VCIs are used at the end nodes to distinguish between different connections.

As Table 2.2 shows, there are three bits in the ATM ce11 header to describe the

PT. The CLP field of the ATM ce11 header is a one-bit field used for cell-loss priority. Ifthe value of the CLP is set to 1, the ceIl is subject to discard, depending on the network conditions. However if the value of CLP is set to O, this ce11 will have high ptiority and therefore it will not be discarded and network resources will be allocated to it.

The HEC is used mainly for two purposes: to discard cells with corrupted head- ers and for ce11 delineation. This eight-bit field provides single-bit error correction and low probability compted-ceIl delivery capabilities..

Table 2.2: Payload Type Indicators

PTI Coding Meaning

O00 User data cell, congestion not experienced, user-to-user indication = O 00 2 User data cell, congestion not expenenced, user-to-user indication = 1 O10 User data cell, congestion expenenced, user-to-user indication = O

01 1 User data cell, congestion expenenced, user-to-user indication = 1 1O0 Segment Operation and Maintenance (O AM) flow-related ceIl

--- 101 1 End-to-end O AM flow-related ce11 - 110 1 Resource Management Cell 111 1 Reserved 2213 A-I,a

AAL supports higher layer functions of the user plane (Le. transfer of information between user applications) and the control plane (Le. transfer of information for the

control of user connections andlor network resources) and it suppons connections between ATM and non-ATM interfaces. It is a layer between the ATM layer and the service-user layer. AAL is divided into two sublayers:

a. Seementation Re- (SAR): this sublayer7smain role is to receive (at the

transmit side of the SAR) data and segment the data to make it into an ATM ce11 (48

bytes). On the receiving end, the SAR sublayer reconstructs the data from received

cells and passed them to the upper sublayer (higher layers).

b. -cri sm(CS): this sublayer is subdivided into common part CS

(CPCS)and service specific CS (SSCS). Multiplexing and loss ce11 detection are two

of the fundons that are common to al1 ALL users and are performed by CPCS. The

service specific requirements of different classes of users, for example time recovery

for real time applications, are implernented in the SSCS.

Different combinations of SAR and CS provide different service access points

(SAP) to the layer above the AAL. As Figure 2.7 shows there are four classes that have been defined as of this writing:

a. çlass This class corresponds to constant bit-rate (CBR)connection oriented ser-

vices wi th a timing relation between source and destination. The two common services

are 64-kbps voice and constant bit-rate video.

b. class R: This class cornesponds to variable bit-rate (VBR) connection oriented ser-

vices with a timing relation between source and destination. VBR encoded video is a typical example.

c. w:This class corresponds to VBR connection onented seMces with no tim-

ing relation between source and destination. A typical se~ceis data transfer.

d. w:This class corresponds to VBR comectionless services with no timing

relation between source and destination. Comectionless data transfer between two

local area networks (LANs) over a wide area network (WAN) is a good exarnple.

Tirne relation between Requi red Not Required source and destination Bit Rate Constant Vàri ab1 e Connection Mode Connetion Oriented 1 C onnecti on- I I 1 less

Figure 2.7 ATM Adaptation Layer Services

With these classes in mind, CCITT Recommendation 1.363 1111 has defined four types of AAL protocols to provide the senrices that the classes require:

a. &L Tym:provides CBR services such as traditional voice transport. Functions

which are provided by Type 1 include SAR of user information, handling of lost and

misinserted cells, handling of ce11 delay variation and source clock frequency recovery

at the receiver.

b. &U Tya:transports VBR video and audio information, keeping the timing rela-

tion between source and destination. It also provides functions similar to AAL Type 1.

c. BAL 314: supports both co~ection-onentedand connectionless variable bit

rate services. Initially, there were two distinct AAL Type 3 and 4, but they have been

merged into a unique AAL, named AAL 3/4 for historical reasons. d. -l: proposed for VBR services that do not require a timing relation

between the source and destination.

2.2.2 B-1SDN Network Concept

The information transfer and signalling capabilities of B-ISDN are described in

CCITT Recommendation L327 [IO] and are comprised of

a. broadband capabilities,

b. 64 kbitsls based ISDN capabilities,

c. user-to-network signalling,

d. inter-exchange signal ling and

e. user-to-user signalling.

As mentioned above the broadband transfer is done by ATM. The 5-byte ceIl

header carries the necessary information to identiQ cells belonging to the same virtual

channels. Also ATM guarantees ce11 sequence integrity, that is a ce11 belonging to a spe-

cific virtual channel connection cannot in the network overtake another cell of the same virtual channel connection that has been sent out. Identifien are assigned to links which

fom the connections at the ATM layers. These identifiers remain unchanged for the duration of the connection.

The ATM transport network functions are divided into two parts, physical layer transport functions and ATM layer transport functions. The physical layer has three levels: the transmission path, the digital section and the regenerator section levels. CCITT Rec- ornmendation 1.3 1 1 (81 has defined them as:

a. Transmission Path: It extends between network elements that assemble and disas- semble the payload of a transmission system.

b. Digital Section: It extends between network elements which assemble and disas-

semble continuous bit or byte streams.

c. Regenerator Section: It is a portion of a digi ta1 section extending between two adj a-

cent generators.

The ATM layer has two levels, virtual channel level and vimial path level which are defined in CCITT Recommendation 1.113 [6].Figure 2.8 demonstrates the relationship between VCs, VPs and the transmission path.

Figure 2.8 Relationship between Ws, VCs and Transmission Path

Also, CCITT Recommendation 1-321 [8] descri bes the di fference between links and connections:

a. Virtual Channel Link: a means of unidirectional transport of ATM cells between a

point where a VCI value is assigned and the point where that value is translated or

removed.

b. Virtual Path Link: the link is teminated by the points where a VPI value is assigned

and transtated or removed.

c. Virtual Channel Connection (VCC): a concatenation of VC links.

d. Virtual Path Connection (VPC): a concatenation of VP links.

The VCCsNPCs can be employed between user and user, user and network, and network and network. Al1 cells associated with a VCClVPC are transported dong the same route through the network and as mentioned above, ceIl sequence is preserved. User- to-user VCCs are able to carry data and signalling function information, user-to-network

VCCs may be used for local access connection, like user-network signalling, and network- to-network VCC applications could involve management and routing. For VPCs, at the user-to-user level, it provides a transmission pipe. For the user-to-network level, the

VPCs could be used to aggregate tracfrom customers to a network element such as a local exchange or a specific server. Finally, network-to-network VPCs cm be organized to satisQ the user by predefining the routing scheme for the trafic.

2.2.3 B-ISDN Reference Configurations

The concept of B-ISDN Reference Configurations are similar to what is found in Goldstein [27], except that everything is broadband oriented. That is, B-ISDN consists of a number of customer premises and a network of nodes and links providing connections between them. There are numerous functional groups as described in Handel and Huber

[28] (p. 64) and these are shown in Figure 2.9.

B-TA: Broadband Terminal Adapter B-TE 1 : Broadband Terminal Equipment 1 B-TE2: Broadband Terminal Equipment 2 B-NT1 : Broadband Network Termination 1 B-NT2: Broadband Network Termination 2

Figure 2.9 B-ISDN Reference Configuration This configuration defines the different interfaces between different entities of the network and its functions. The B-TE1 performs the temination of a11 end protocols from low layers to the high layers. B-TE2 is used for non-standard B-ISDN interfaces, however it needs a B-TA (terminal adapter) to attach the non-standard equipment to a B-

ISDN. B-NT2 performs higher layer functions, such as multiplexing/demultiplexing aaf- fic, bandwidth enforcement, buffering and resource allocation. B-NT1 refers to line transmission termination and is associated with the physical and electrical termination of the B-

ISDN on the user's premises. The B-NT1 can be controlled by a network provider, such as

Bell Canada, forming the network boundary.

Each reference point, such as R, SB and TB, has a specific role to play in this configuration. R provides a non-B-ISDN interface between non-standard user equipment and adaptor equipment. TB separates the network provider's equipment from the user's equipment. SB corresponds to the interface between the user's B-ISDN equipment and separates them from the network-related communication functions.

2.2.4 Future of B-ISDN

B-ISDN has not only been developed to support current services, but also new services that are limited only by the imagination. ATM has become a well known technology for university campuses and LANs, as detailed by Newman [34]. Washington Univer- sity has been deepiy involved with the development of an ATM campus network by Cox et al. [15], called Project Zeus, which is taking place at Washington University. This project was divided into three phases: a. Buse O: involves four 16-port broadcast packet switches, an ATM video interface,

an ATM Ethernet interface and a physician workstation to support medical imaging

applications. This phase was started in 1988 and was completed in 1992.

b. Phiu~L:involves developing a switch with up to 128 ports over a 155 Mbps link,

designing and implementing a workstation interface using a full 155 Mbps link,

designing and implernenting a multiport ATM router and establishing basic interopera-

bility between the campus network and the public network ATM switch. This phase

started in 1992 and was completed at the end of 1994.

c. Ehase2: involves the development of an ATM switch with 256 ports over a 622

Mbps link, designing and implementing a compatible ATM interface for multiple

workstations, including support for high definition television (HDTV) video and mul-

tiple coded video channels and extending the interoperability with the public network.

This phase will mn from 1994 through to the end of 1996.

Besides LANs and campus networks, B-ISDN has several other services that will be offered in the future and there has been numerous papers to that effect. Vickers et al. [40],for exarnple, have an excellent description of the use of connectionless service for

ATM networks using connectionless servers (CLS) and interworking units (W).Also, one of the main developrnents for B-ISDN/ATM supporters has been the creation of the

ATM Forum. This consortium, which involves usen and vendors of ATM equipment, has grown in its membership from six in 1991 to more than 500 today.

One of the most recent papers includes a discussion of the Customers Premises

Network (CPN). Casaca and Rocha [5] give a more detailed description, but the CPN will be developed in three phases: a EhasrtL: The introduction stage. The CPN will be used to interconnect between

existing LANs or PBXs and the main functions of CPN will be to serve as an ATM

multiplexer where Ethemet, FDDI etc. will be multiplexed to use the cost-effective

AlTPvi leased-line.

b. m:The expansion stage. This will include the incorporation of the broadband

terminal equipment (B-TE)to the network. This will enable the B-TEterminals to talk

to other non-broadband terminals using CPN.

c. Phase 3 : The diffusion stage. This will include the elimination of the ordinary voice

telephone which will be replaced by multimedia terminals. At this stage, it is expected

that B-TES will be used in the home.

This chapter covered the history of telecommunications descnbing the evolution of telecornmunication technology. It also included an overview of B-ISDN, its services and the ATM transport functions. The understanding of ATM technology is quite important for this thesis to bring some important issues like trafic requirements and costs to the forefront for the next chapters. The next chapter will describe the mathematical mode1 that will be used to find a topoiogy for an ATM based network for DND. It will also contain some details important for solving the objective function, which is to minimize the leasing cost of links. C hapter 3

Mathematical Mode1

Luhwuud The aim of this chapter is to introduce the mathematical model that will be used

to find the optimal topology for an ATM network for DND.Some fictional trafic data is

used to demonstrate the process of solving three and four-node network topology.

The cost of telecommunication networks is dificult to estimate, especially

since the technology has progressed so quickly. There have been numerous studies done to

try to estimate these costs, e.g. Cosgrove [14] with his detailed cost analysis of numerous

communication equipment and systems. The capacity planning process of various types of

communication networks have also been scnitinized in the past. Some of the studies have

been done taking into consideration that the trafic requirements, cost of capacity, number

of nodes, topology, etc., are assumed not to change over time. This is called SPCFA (sin-

gle-period capacity and flow allocation). Gavish et al. [22] demonstrate a nonlinear programming model to determine routing in a backbone cornputer communication network

(BCCN)assuming capacity assignments only are given. A similar approach was used by

Narashiiman et al. [33], where flow allocation methods have been used as the basis for

performing single penod capacity allocations. Gerla and Kleinrock [25] suggested four diEerent heuristics for this purpose, three of which iteratively solve a routine problem with fixed capacities, followed by a discrete capacity allocation problem with fixed flows, until a local minimum of the total line cost is obtained. In the fourth heuristic, discrete costs are interpolated with continuous concave costs and an iterative method is applied. An integer prograrnming model of the SPCFA for BCCNs is also discussed in

Gavish and Neuman [23] where capacity and flow are detennined. A characteristic of their approach is that the problem is verified through Lagrangian lower bounds. The model was improved by Gavish and Altinkemer [20] where the routes were irnplicitly given within the model. Also, Gavish et al. [21] describe a single-penod integer programming model for a circuit switched fiber optic ne~orkand Monma and Sheng [32] describe the Packet

Network Design and Analysis (PANDA) model for packet network design. The model iterates between two subproblems. The first one being a low cost network configuration and the second, calculations of end-to-end performance. Saksena [37] describes the topological analysis of nonhierarchical and hierarchical packet networks with an objective hnction so as to minimize the end-to-end delay for SPCFA.

However these studies were done in a static environment, i.e. the same traffic requirements were assumed, since it was for a single period. Then came studies conceming the multiperiod capacity and flow allocation problem WCFA) where the trade-off between future savings due to economies of scale and the cost of instailing current excess capacity were considered. A study done by Yaged [41] involved a three phase iterative solution to expand the capacity of a circuit switched telephone network. In this study, the network topology remained the sarne. Baybars and Kortanek [2] solved the MPCFA problem for a circuit switched network, allowing veiy simple routing using direct high usage tmnks and alternative trunks. Trafic loaded on each link is prespecified before making multiperiod capacity decisions. The problem with these studies is that most solution methods found for MPCFA are completely heuristic, and there have not been substantial attempts to obtain quantitative estimates of solution quality for the multiperiod problem. Dutta and Lim [18] have brought a new approach to the MPFCA, where the capacity and routing are jointly deterrnined over time. In that study, a Lagrangian relax- ation-based heuristic solution method is proposed. The resulting model can be solved using an integer program and the solution method used provides numencal verification through the Lagrangian lower bound. However the cost structure involved in that study would not be really applicable for the model proposed here, since the discounted installation cost of cable and its maintenance cost are included in their model and we are more interested in the leasing cost of telecornmunication lines.

This thesis minimizes the cost of ATM leased links for the rnodel developed in the following sections subjea to the condition that the link capacity will be enough, or can be increased, or an alternate routing will be found, if necessary.

3.2 Mode1 Formdatio~

In the model which follows, the following constants and variables are used:

N: the set of node locations,

L: the set of edges,

S: the set of capacity options,

R: the set of specified routes, one of which is the shortest path, a (s): the capacity of option type s O S (megabitdsec), h (1,s): installation cost of links type s O S on edge 1 O L,

1: set of source nodes,

J: set of destination nodes,

TF(i j): traffic requirement between node i O 1 and j O J (packets per sec), D: maximum permissible average network packet delay (sec per packet),

DI(1): length of edge 1 O L,

1 if route r E R (specified manually) between i E 1 and j E J includes edge 1 E L, y (iJJ71) = O otherwise

1 if capacity option s E S is installed on edge 1 E L ~0,s)= O otherwise y(i j,r) = integer variable: amount of iraflic between i E 1and j E J using route r E R

Capacity of the Link 1, CO):

Flow on linkl, f(l): f(I) = (i, j, r) x ~(i,J, r, I) x J) (2) ijr

Total network trafic, y:

For the average packet delay (Tanenbaum [39] pp. 56-67), which was derived from the mode! of M/M/1 queues,

But this delay constraint is nonlinear in the capacity and routing decision variables. But, as mentioned in Dutta and Lim [18], we could use the concept of link utilization. In their assessment, a suitable approximation is to equally distibute the value of the nght-hand side of equation (4), multiplied by the total traffic, over edges that exists. They noticed that it is possible to have unequal values of the right-hand side of (4). However, they feel that the ratio m)/((c(l) - @)) is constrained for each 1 E L. Ah,in their paper, they identified that some particular links could expect larger traffic fluctuations, which means longer delays on these particular links. However, it would be quite hard to identie those links from the start. Therefore, they emphasized the fact that the delay and the total traiEc flow should be distributed over al1 the links of the network. Multiplying both sides of the delay constraint (4) by y and dividing by the number of links (ILI) in the network results in:

Therefore the maximum permissible average packet delay, D, converts into a network wide lirnit on link utilization. The right hand side of (5) becomes equal to a constant K and re-formdating the equation to make it linear, we obtain:

f(r) x (l+K) -c(l) xKaO

Therefore the problem is formulated as follows:

Minimize Cost = (h(2, s) + m (1, s) x DI (0) x x (2, s) (7) SESIEL

x (1, s) < 1 b' I, only one capacity per link; (8) SES x (l, s) x y (z, j, r, I) 2 2 V nodes i, at least two links leave IELJEJ,~ERsES

node i using any route r, and Ji is the subset of nodes connected directly (one link) to

i (duplication for network survivability); (9)

y (jr) = TF (1, j) V (i j), the traffïc from i to j gets there ?ER

using al1 possible routes that were assigned from node i to j; (10)

f (l) x ( 1 + K) - c (l) x K a O V 1, liok utilization constraint; (11)

. c (ln- I) = c (ln) where n represents the (12) nurnber of Iinks

Note that if c(li), i being an odd number, is the link between node A to B then

c(li+,) is the link between node B to A.

The two terms h(l,s) and m@,s)in the objective fiction represent the installation cost for different types of links and the monthly charge per kilometer of the links,

respectively. We have not put in a constra.int ensuring that the flow is less than the capacity

since this is guaranteed by equation (9),which has been derived from the delay constraint, as explained in more detailed in Gerla and Kleinrock [25]. The route generator was cre- ated manually using the shortest path, and routes were added which are just a bit longer than the shortest path as second, third and fourth choices.

This problem, as mentioned in Dutta and Lim [18], was a MPCFA, but we have converted it into a single period capacity and flow allocation (SPCFA) model for the planning of the DND network However it diff'ers a bit more as well from Dutta and Lim [ 171.

They use the decision variable y(i j,r) as a binary variable. This approach has been proven successful in their paper, however it is hard to discover exactly where the traffic goes and to confinn that the flow is less than the capacity. In Our formulation, we defined y(i j,r) as a positive variable, which corresponds to the trafEc using a specific route. In addition, Our rnodei differs from Gavish and Neuman [23], since their objective function is a sum of link costs and delay costs whereas ours is only concerned with link costs. Our model treats the delay as a constraint and not as part as the objective function. Another difference is that their link costs include a component that is proportional to message volume, as would be appropriate when leasing from a value added network (Le. pay per use), which is not

Our case.--

3.2.1 General Algebraic Modeling System (GAMS) Program

Even though this model is combinatorially explosive (over 600 edges for the 25 node-network that we are going to use and five different types of links), there exist some commercial softwares that can solve it, e.g. GAMS. This software is designed to make the construction and solution of large and complex mathematical models more stmightfor- ward and more cornprehensible to users. Since the mathematical model is mixed integer,

GAMS will use its solver called Optimization Subroutine Libra~y(OSL). OSL was produced by IBM and it contains high performance solvers for linear programming (LP), rnixed integer programming (MIP) and quadratic programming (QP). OSL uses different algorithms and option parameters to solve the problem. We have used two of the options as discussed beIow:

a. branch-and-bound pre-processor (BBPREPROC):the pre-processor examines only

the 0-1 structure. It is a very good option to use with a MIP problem.

b. presolver: The presolver is called to try to reduce the size of the model. It elirni-

nates sorne redundant rows and is able to substitute out certain equations.

These two options were used in an option file for GAMS.

OSL begins by solving the problem as a linear program, using the prima1 sim- plex method to find an initial LP solution. For this model, the LP solution does not make sense, because GAMS uses fractions of links to solve the problem. Then, GAMS uses a branch and bound (B&B) search to find an improved solution (i.e. the integer constraints are added) and to vene optimality. The B&B procedure uses linear programming to corn- pute bounds.

3.2.2 Development

-Node New& In order to find a solution to this mathematical model, we used GAMS and we began with a three node network, because it is a simple model and we can easily verify the results of this model. The three-node network that was used is:

Figure 3.1 Three-Node Network By using the program shown in Annex A, modified since the network only has three nodes, and the option file mentioned in 3.2.1 above, we built the optimization with fictional trafic between nodes shown in Table 3.1 ::

Table 3.1: Trafic Between Bases

Node Pair Traff i c (kbps) -

HLF X-GRWD 3000 SM-GRWD 2000

Also, we allowed four different capacities for each link so that GAMS could find the best capacity, as shown in Table 3.2. Table 3.2: Possible Lin k Capacities

Name Capacity (kbps) S- 1 1500

Also al1 possible routes between each source-destination node were taken into consideration. With this in mind, we were able to find the optimal capacity of each link of the three-node network (L 1-L6), as show in Table 3 -3.

Table 3.3: Link Capacity for the Three-Node Network

Link Capacity Table 3.3: Link Capacity for the Three-Node Network

1 Link Capacity

A~SOthe capacity of Ll is the same capacity of L2 as the consiraints in equation

(12) dictates. The solution gave the traffic that appears on each link as shown in Table 3.4: Table 3.4: Trafic on Each Link

Link Traffic (kbps) L1 2727

To show that this program worked, we used another software called Quant Sys- tem, which has a LP solver in it and an MIE? We used the same constraints and the same objective function, as demonstrated in Annex B. As shown in the output file we obtained the same optimal value for the objective fundon, with the same link capacity between nodes and the sarne trafEc on each link. Therefore we were fairly sure that the GAMS program worked.

etw& To continue the expenments with the GAMS program, we developed a four- node network as shown in Figure 3.2. w Figure 3.2 Four Node Network

To solve the problem represented by this network, we again used fictional traffic between node pairs and which are shown in Table 3.5: Table 3.5: Traffic Between Bases

Node Pairs Traffc (kbps) HLFX-GRWD 3000 HLFX-SHWR

SHWR-GRWD 1 O00

1 GRWD-GAGE 1 1 000 1 GAGE-HLFX 1 2000 I GAGE-GRWD I 1O00 By using the same GAMS program as before, but adapted to the four-node network problem, we found the solution shown in Figure 3.3 :

Figure 33 Optimized Topology for a Four Node Network

As noted in equation (9), there are at least two links leaving each node. This constraint exists because of survivability, i.e. if one link goes dom, there is at least one other Iink that can be used to send the trafic. Table 3.6 shows the Iink capacities that were found in the optimization for this problem. Table 3.6: Link Capacity for Four-Node Network

Link Capacity (kbps) Table 3.6: Link Capacity for Four-Node Network

Link Capacity (kbps) L11 6000

As noted in Table 3.6, the links L3, L4, L9 and LI0 show O capacity. This implies that these links are not needed for the optimized four-node network. As with the three-node network, constraint (12) has been satisfied by having the same capacity behhreen the same node pair. Finally, each source-destination trafic was routed using one or two different routes and the summation of the trafic using al1 the routes corresponds to the total trafic between the node pair as dictated by constraint (10).

3.3 Smmag

In this chapter, we have shown the development of the mathematical model, presented the prograrn in Annex A with GAMS software and also the development and solution of the optimization with three and four-node networks. The next chapter will describe the methods we used to amalgamate al1 trafic analyses that were obtained to find the total network trafic and trafic leaving fiom base to base. Some estimation procedures of traEc rates will also be explained. Chapter 4

Network Traffic

-This chapter describes the trafic analyses that were done to the end of the century to find the forecasted traffic for DND. Ml projects mentioned in this thesis should be implemented by then.

With an ongoing advance in technology, it is hard to forecast the needs of organizations and corporations. DND has this problem every time it wants to implernent a new wide area network (WAN). In a recent study, numerous projects that join the Integrated

Data Network (IDN) have found that the speed IDN offers for the end-to-end links will not meet Dm's requirements in the very near hture. Brassard [3] recently produced a report concerning IDN. One of the major concems the Life Cycle Maintenance Manager

GCMM) for IDN has is the limitation of the links that exist between bases. The highest link capacity now in place is 56 kbps, which is acceptable for limited data, however recently, IDN has crashed a few times. One of the solutions the LCMM for IDN has proposed is the frarne relay technology associated with Tl (1 -544 Mbps) speed. To achieve this, IDN switching equipment capable of Tl speed and an appropriate electrical interface would have to be purchased. The other solution would be to move IDN into Ce11 Relay

Switching Technology with speeds of at least Tl and T3 (45 Mbps). Similar to frarne relay technology, DND would have to purchase ATM switc hing equipment and encrypti on devices which would be capable of speeds of T3 and above. As this thesis will demonstrate, ATM Cell Relay Technology is the way of the future for DND. To demonstrate the requirement of bandwidth needed for an ATM network, a trafic analysis is necessary to

forecaa the future requirements of DND until the end of the cenhiry.

This tr&c analysis includes three types of traffic:

a. telephondfax machines on bases,

b . videoconferencing and

c. data trafk frorn numerous information systems.

This study contains data collection from alrnost 60 different projects involving

a number of DND departrnents. Annex C gives a brief description of each project and the

method used to find the traEc requirement for each project The following sections will

provide a description of the traffiic andysis done by different consultants hired by Project

Managers as well as the estimation procedure and, finally, the estimates that were done for the projects that did not have a traffic study done on them.

4.2 Vu-

A study on telephone usage was done at CFB Kingston by the telecornmunication service section. During the period of 1-30 Nov 94, there were 273733 telephone calls made between 0800- 1600 hrs. The average duration of the cails, i .e the average holding time (llp), was 2.9 minutes per call. To measure the number of calls during an 8-hour working day, we used 20.75 working days per month as recommended in the

CF Manual of Cost [30]. Therefore we found that, for CFT3 Kingston, there were 1648.994 calls per hour, which correspond to 27.483233 cails per minute (A). The trafic study also included the number of faxes that one fax machine at CFB Kingston sends and receives.

During the period of 1 Oct to 30 Nov 94, this fax machine sent and received 559 faxes, with an average duration of 2.43 minute per fax. This made the arriva1 rate (A) of faxes of

0.028062 faxes per minute.

This data is used as the usage rate mode1 for al1 bases in Canada since it is difficult to estimate the usage rate of telephoneslfax machines for each base. Therefore, this will be an approximation per base for the number of faxes and phone calls made. Details can be found in hnex D.

Al1 Communication Groups were approached to find out exactly how many telephones that are in place at each base. The number of telephones per base also includes al1 those telephones at reserve units. Since we could not find the exact number of fax machines and secure telephones, we took a ratio of the number of telephones per base to the total number of phones at al1 bases and we took these ratios to find the number of fax and secure telephones per base. Again, Annex D gives a summary of the details to find the number of telephones (secure and non-secure) per base and the number of faxes.

With these results in hand we use the approximation that gives N, the number of

ûunks required, as a linear function of A (utilization parameter per trunk), including a probability of blocking (Pb)as specified by Schwartz [38]:

A = h/p

Pb= 1% N = 5.5+ 1.17A 5

Pb= 0.1% N = 7.8 + 1 .28A 5

Using the mallest probability of blocking (0.1%) for a better reliability, we were able to find the number of trunks (communication channel between two switching systems) per base. Each trunk has a capacity of 64 kbps. Table 4.1 gives an overview for the number of tninks required per base.

Table 4.1: Number of Trunks Required per Base Base Number of Trunks Masset 1 Comox 4 Esquimalt 22 Chilliwack 1 4 Edmonton 15 Calgary 5

Cold Lake 1 14

- Winnipeg North Bay 1 13 Petawawa 2 1 Ottawa 85

Toronto 1 12 Trenton

-- - Kingston Montreal 1 27

St-Jean 14 Valcartier 20

-- -- Gagetown Table 4.1: Number of Trunks Required per Base

Base Number of Trunks Greenwood 6 -. 1 Halifax 1 36 1

. . 1 St-John's 2 1 I 1 Gander 2 Goose Bay 12

------

As shown in Annex C, there is a project that is called Military Video Net which

is currently in service. A bit of guessing is required, however, to find the requirement for this service for the end of century for each base. However there are 10 videoconferencing stations which are currently used by different bases. By the end of the century, it will be quite feasible to forecast that each base will have access to videoconferencing. Currently, the 10 stations are using 114 of Tl, which is equal to 325 kbps, for the videoconferencing network, which is not of a very good quality for this application. To follow the technology of today and tomorrow, DND will require a better videoconferencing network, thus a large bandwidth. Onvural 1351 (p. 45) has suggested that the required bandwidth should be 2

Mbps for compressed video with full screen and high resolution. The number of terminals that each base will require to be efficient has been detemined by assigning 1 terminal per

157 telephones, determined by 74 Communication Group (confirmed by telephone con- versation between the author and 74 Communication Group Telephone Services). This ratio will be applied for ail bases. Table 4.2 shows the resulting number of videoconfer- ence terminais per base.

Table 4.2: Number of Videoconferencing Terminals Required per Base Number of Terminais

I Comox 1 Esquimalt 1 Chilliwack 1 Edmonton 1 12

Shilo 7

I Ottawa I 2 02 1 Borden 1 Il 1 Toronto 1 9 I Trenton I 17 1 Kingston 1 14 I Montreal

------St-Jean 11 Val cartier 19 1 Gagetown 1 10

Shearwater 7 Table 4.2: Number of Videoconferencing Termhals Required per Base Base 1 Nurnber ofTerminals 1 St-John's 2 Gander 2 . - - - - - Goose Bay 9

To calculate the average rate of the demand for video, we have used the data that we collected from the Military Video Network project based on 10 videoconferencing terminais as shown in Table 4.3 and shown in Figure 4.1 :

Table 4.3: Usage of Military Video Net

Average Oiom December per rnonih)

Halifax 33.19 16.55 34.58 6 1.57 63.49 51.55 43.48 (HL Fm

NDHQ 1 29.33 1 13.16 1 54.84 1 33.72 1 23.68 3 4.3 (OTWA) Trenton 1 13.59 1 7.30 1 7.30 1 11 1 10.30 (TREN)

Esquimalt 21.15 14.77 24.5 1 25.95 27.01 (ESQT) 70 - Military Video Net Traffic Usage 60

O Bases JUI A~~ sepQo~ Nov Dec

Figure 4.1 Military Video Nehvork Usage

The average for al1 terminals was 2 1-7 1963 hours per month or 1.046729 hours per day (20.75 working days in a month) per terminal. The following example illustrates how we found the required bandwidth for videoconferencing:

2 terminals (St-John's) x 1.046729 hours / 8 hours = 0.0261682 terminal

This gives the number of 2 Mbps terminals you need for St-John's. But the requirement is for at least 2 Mbps to operate, therefore you need 2 Mbps bandwidth for this base. The results for ail bases are shown in Table 4.4. Table 4.4: Bandwidth Requirement for Videoconferencing per Base

Base Bandwidth Requirement (Mb ps) Masset 2 I Comox I 2 1 Esquimalt 1 - 6 Chilliwack 2 Edmonton 2 Table 4.4: Bandwidth Requirement for Videoconferencing per Base Base Bandwidth Requirernent (Mbps)

Calgary 2 Sufield 2 1 Cold Lake 1 2

1 Winnipeg 1 4

I Ottawa I 26

1 Toronto 1 Trenton 1 4 1 Kingston 1 4

1 Gagetown 1 Greenwood 1 2 1 Halifax Shearwater 1 St-John's 1 2 I Gander 4AJ&mam There have been a few data traffic analyses done by different consultants for the majoiity of the projects that are part of our trafEc analysis ([13], [ 161, [17]and [29]). These data traffic analyses could differ quite a lot from one project to the other, and it would be very difficult to venw al1 the data, especidly for the first data trafic analysis that we wil1 explain.

4.4.1 IDN Capacity Management Plan

DCEPR's study [16] was done by the IDN engineering ce11 of the Project Ofice in Ottawa. The purpose of the study was to determine the current network usage and to forecast IDN resource requirernents for 19934996 in order to provide suficient capacity for current and future iDN users. The study was divided into four parts:

a. current capacity at each IDN site;

b. IDN current user entitlements;

c. known future user requirements; and

d. expansion capability at each IDN site.

Some assumpùons were made in the development of this study:

a. The IDN user information is based on DCEPR's survey dated March 1994; and

b. Ail the X.25 trafic generated has a packet size of 256 bytes;

With these assumptions in mind, this study converted al1 the trafic forecasts to data packets per second (dpps). Table 4.5 gives an example of their study report. A definition of the projects are detailed in Annex C. Table 4.5: Example of ïDN Study

Location

------CFSS 90.28 90.28 90.28 90.28 DDDS O O O O FIS MK III 18.76 18.76 18.76 18.76

1 LFIS

BADP O 4.69 4.69 4.69 rsx (SW) O O O O 1 ABACIS IRPS O O O O DG MOSYS O O O O 1 ADM (PER)WAN 1 O 10

With this in mind, the DNLCMM has made numerous recommendations for

KIN, most of them related to hardware. The total cost for DNimprovement resulting from the study will be $2.55 million by 1997. One of the main issues that was not covered in this study was whether the delay on the network was acceptable. Brassard [3] pointed out that one of the main problems of IDN is its end-to-end delay. Also, afier contacting numerous project managers, we realized that IDN's link capacities are not enough for the future requirements of DND. Also in Brassard [3], it is mentioned that the links between

16 bases should be increased to Tl (1.544 Mbps). This would enable DNto consolidate data, video and voice on the same link. The disadvantage with this approach is that DND would have to buy new switches for IDN from Northem Telecom.

4.4.2 IDN Defence Message Handling System (DMHS)

-This study was produced to see the effect of DMHS on the IDN. More details and descriptions are given by LGS Group [29]. DMHS is a new project that is aimed at replacing the obsolete Automated Defence Data Network (ADDN).There is a concem that the IDN network will not be able to handle the requirements of DMHS which would potentially generate numerous large file attachments for distribution.

The DMHS consists of two parts:

a. Department E-Mail System (DEMS), which includes unclassified and Protected A

messaging; and

b. Military Message Handling System (MMHS) for unclassified and classified trafic

(up to SECRET). c There will be approximately 34,000 desktop workstations across DND which will use DEMS by 1997. Based on a typical messaging system, a daily message rate of four messages per day per user would be generated. Assuming the industry 80/20 split, as proposed by LGS Group [29](80% of the tracis local and remains on the LAN, 20% of the trafic traverses the IDN) of e-mail -c, 20% (four messages per week) would go across IDN. It is also assumed by LGS Group [29] that 30% of the total daily traffi~c intended for IDN is sent across the network in the moming peak period (0900-1000), 30% in the afternoon peak period (1430-1 530) and the rernaining 40% uniformly distibuted over the rest of the day. c MMHS will provide support for military features such as precedence and spe- cial handling requirements and al1 security classification up to SECRET level. It is esti- - mated by LGS Group [29] that MMHS users will be 30% of the planned users, or approximately 10000 users DND wide, and it is assumed by LGS Group [29] that there will be 1 message per day per user which will be generated by MMHS. Like the DEMS

80/20 split, it is assumed that a MMHS user will generate five messages in five days, one of them going across IDN.

The DMHS shidy included numerous assumptions:

a. A link utilization of 75% or greater will result in degraded performance and

requires addi tional capacity ;

b. It is assumed that DND users would generate an average of 4 messages per day;

c. The industry standard of 80% localized and 20% external for e-mail -messageflow

is used for the study; d. 60% of the daily message load is uniformly distributed over the two peak periods,

0900-1 000 and 1430- 1 530, with the remaining 40% unifomly distributed over the rest

of the day;

e. The MMHS application will result in an additional message per working day, or

five per week, which will be added into IDN trafEc rate;

f Based on the consultant company's expenence as noted by LGS Group [29], the

average message size is as follows:

i . 1 0% are 500 byte messages,

ii. 80% are 5000 byte messages,

iii. 5% are 50,000 byte messages and

iv. 5% are 100,000 byte messages.

Frorn these figures, the overall average message size i s 1 1 .5 5 kbytes.

le Cal-

As documented by LGS Group [29],the following calculation was done with data collected from Yellowknife:

a. ( 100 users x 4 messages per user) = 400 messages per day average;

b. 20% of 400 messages = 80 messages per day going out over IDN;

c. With an average message size at 12.85 kbytes (including encryption) and using a

packet size of 265 bytes (including 9 bytes overhead), the traffi~cgoing out over IDN is

expected to be 1,064,140 bytes for the day.

d. 30% of this traffic goes out during each one hour peak penod which gives 3 19,242

bytes during each peak penod.

e. This number of bytes (2,553,936 bits) is divided by the speed of the link that is used at the moment (19.2 kbps) and we have that it is used for 133 seconds during the hou,

and we can conclude that the link has a percentage of utilization of only 3.69%. There-

fore the capacity of this line is suficient for accepting DMHS.

-This study has examined the impact of projected DMHS trafic on the current IDN and has concluded that IDN has the switch capacity and performance to handle

DMHS. However it was noted that certain access, network and tmnk Iinks need to be upgraded, as shown in Table 4.6.

Table 4.6: Upgrade Trunks Required for IDN

Observation Present Projected Uti lizati on Origin-Destination (based on Utilizati on(%) @Y 1997) projections) Edmonton-Borden 85.00 11 1.59 Overloaded 1 Shilo-Esquimalt 1 49.00 1 85.09 1 Overloaded ------1 Shilo-Ottawa 1 75.001 1 18.88 Overloaded 1 Borden-Halifax 1 78.00 1 97.57 1 Overloaded 1 Borden-Ottawa 1 63.00 1 93.75 1 Overloaded Borden-Edmonton 93 .O0 1 16.44 Overloaded Borden-Montreal 60.00 99.38 Overloaded

- 1 Ottawa-Shilo 1 95.00 1 167.49 Overloaded Ottawa-Borden 81.00 128.23 Overloaded Ottawa-Gagetown 80.00 117.12 Overloaded

- - Ottawa-Tunney's Pasture 78.00 148.42 Overloaded 1 Tunney's Pasture-Ottawa 1 50.00 1 90.69 1 Overloaded

1 Montreal-Tunney's Pasture ( 47.00 1 87.69 1 Overloaded Table 4.6: Upgrade Trunks Required for IDN

Observation Present Proj ected Util ization Ongin-Destination (based on Uti 1izati on(0/0) @Y 1997) proj ection s) Montreal43orden 73 .O0 109.83 Overloaded MontreaI-Val cartier 50.00 86.66 1 Overloaded 1 1 Gagetown-Ottawa 1 60.00 1 83 .O1 1 Overloaded 1 1 kagetown-~ali fax 1 56.00 1 80.15 1 0&Ga~I

As specified earlier, there will be a degraded performance if the tmnk utilization is 75% or greater. It was also noted in this study that the following access circuits should be upgraded to 56 kbps:

a. Winnipeg,

b. Borden,

c. Kingston,

d. St-Hubert (AWAN) and

e. National Defence HeadQuarters Metropolitan Area Network (NDHQ MAN) (2 x

56 kbps).

As well, it was found in this study that the following network links should be upgraded to 56 kbps:

a. Cold Lake-Edmonton,

b . Petawawa-Ottawa,

c. Greenwood-Gagetown and

d. NDHQ MAN-Ottawa. 4.4.3 Interfacility Data Comms Requirements Analysis for MAATS

-nie purpose of this study was to identie Military Automated Air Tdic Sys- tem (MAATS) interfacility data communications requirements. DND has a requirement to automate its existing Air Trafic Control (ATC)facilities in Canada and to provide a direct interface with the Transport Canada system, called Canadian Autornated Air Trafic Sys- tem (CAATS). The data that has been summarized can be found in more detail in Comgate i131.

The WAN data requirements developed in this report are based on the communication requirements of the following operational services offered to selected MAATS users:

a. IFR Control;

b. VFR Control;

c. Flight Planning;

d. Altitude Reservations;

e. Aircraft Movements Information Service (AMIS);

f. Aviation Weather;

g. Search and Rescue (SM) Alening; and

h. General Mail Service.

Table 4.7 details the MANSelement physical locations for DND Table 4.7: MAATS Element Physical Locations

Element Locations MTCU Montreal, Edmonton CAATS ACC Montreal, Edmonton, Vancouver, Winnipeg, Toronto Sensor Sites Comox, Cold Lake, Trenton, Bagotville, Goose Bay, Greenwood

--- FPSC 1 Various Locations FAU 1 Toronto, Petawawa, Valcartier -- - Towers 1 Shearwater, Edmonton, Gagetown TATS 1 Mobile . ---- - RCC 1 Trenton, Victoria, Edmonton, Halifax SOCC 1 North Bay MOC 1 Halifax, Victoria - EEC 1 North Bay Sqns 1 Trenton, Edmonton

The overall responsibility of the MiIitary Termina1 Control Unit (MTCU) is to provide Air Trafic Services (ATS). The CAATS Area Control Centre (ACC)'s role is to automatically acquire, process, distribute and display flight data. The Rescue Coordina- tion Centre @CC) is used for al1 SAR flight plans and air trafic control messages. The

Sector Operational Control Centre (SOCC) is used to coordinate Canadian airspace within the Air Defence Identification Zone (ADIZ), which permits identification of aircrafi and control of the ainpace. The Exercise Evaluation Ce11 (EEC) requires access to altitude reservation information provided by the Altitude Reservation Unit (ARU) from CAATS. The

Maritime Operation Centre (MOC) requires access to aeronautical information as well as altitude reservation information provided by the ARU.The Tactical Air Traffic System

(TATS) located with the two Air Transportable Communication and Control Units

(ATCCU) provides transportable communications and ATS for deployment to any location in the world. The Sensor Site, which includes MATS Tower and Precision Approach

Radar (PAR) facilities, processes information (flight data) from two radar sources; altime- ter information and time. The Towers, which inciudes the MAATS Stand-alone Towers, automate the functions of flight data acquisition, processing, display and information transfer. Also, it needs access to weather and aeronautical information. The Flight Plan- ning Service Connection (FPSC) provides site specific flight planning services. The Flight

Advisory Unit (FAU) provides flight advisory services and requires access to information that is equivalent to the Tower.

. . 44 Re- for C- MAATS will offer multiple services to different locations. Table 4.8 identifies the MAATS elements which are required.

Table 4.8: MAATS Operational Service Requirements

WTSServices h4AATS Anonau- Element VFR Flight Aliinidc Av~ation iicd SAR Gcneral A,IS Cantrol Co~ol Plannrng Resavauon Weaiha informa- Altrting %II uon MTCU X X X X X ACC X X X X X Sensor X X X X X X Site FPSC X X X X Table 4.8: MAATS Operational Service Requirements

h4AATS Services WTS Xcronau- Elernent c;FR Fligh! Alunide Avtauon tical SAR Gcnaal ilUIS Conuol Planning Raavaiion W~IU Monna- AIating Mai1 tion FAU Tower TATS RCC

MOC EEC

There are several communication services that have been identified in Com- gate's report:

a. Flight Data Service (FDS);

b. Radar and Sensor Data Service (RDS);

c. Flight Planning Data Service (FPDS);

d. Altitude Reservation Data Service (ARDS);

e. Aircraft Movernent Data Service (AMDS);

f Weather Data Service (WDS);

g. Aeronautical Data Service (ADS);

h. EmergencylAlert Message Service (EMS);

i. General Mail Service (GMS); and

j . Management Data Service (MDS).

Table 4.9 provides the required communication tools needed for the different rype of services that MAATS will be offering. Table 4.9: MAATS Communication Requirements Communication Tools I RSDS 1 FPDS 1 ARDS AMDS WDS ADS EMS GMS MDS MTCU X X X X X X ACC x Sensor X Site FPSC

Tower X TATS x RCC x socc x

43 'l SampleCalcYLatiPn

As detailed in Comgate [13], Table 4.10 is a summary of dataflow characteristics of the ten types of communication seMces needed by MAATS.

Table 4.10: Dataflow Characteristics

Communication Type of Data Services I I Flight Plan Data 90 200 400 12 /min Transfer of Con- 40 60 120 1 /min trol/Jun sdiction Data Table 4.10: Dataflow Characteristics

l Size (Byte: Communication Frequency Data Rate Type of Data Services Min Mean Max (bps) RSDS Radar 118 3 7,760 to 47,200 RSDS Weather

- - RSDS Sensor I I FPDS Filed Flight Plans 1 1 500 12 / min FPDS Flight Plans Adrnts 1 1 550 200-540/ month ARDS Aititude Res Stats 500 month I AMDS AMIS Flight Plan 330 < 1 / hour Data AMDS Data 1 WDS WDS Aerodrome Envi- 60 / hour ronment Weather AES Met Data hourlo0' 1 Weather Graph Twice a File day WDS Area Precipitation 30 / hour Intensity EMS IO / day EMS Occurrences 1 40 1 60 EMS Search Message ADS ADS NDBMF FiIe 1 / quar- Update ter I Table 4.10: Datafiow Characteristics

Size (Bytes) Communication Data Ra= Services Type of Data 1 Min , Mean , Max 1 Frequency(msges) @PSI GMS General External 160 6 / hour GMS General Interna1 160 60 / hour

As noted above, RSDS is the only communication service that represents the transfer of real-time radar and sensor data. This means that this information system needs the data rate al1 the time. As mentioned in Comgate [13], the delay acceptable for this system has to be below 50 msec for the network. Finally, Table 4.11 is a summary of data rates required for each MANS element required from the Packet Switched Data Network

(PSDN) and the Automated Data Interchange System (ADIS).. Table 4.11: Summary of Communication Access Requirements

MAAT S El ement PSDN (kbps) ADIS (kbps) MTCU 38.8 3 ACC 53 -4 3 SENSOR SITE

FPSC FAU TATS 1 38.8 1 3

- - RCC 26.8 3 SOCC 39.8 3

MOC EEC 1 5 -6 1 1.7 4.4.4 Canadian Forces Supply System Upgrade (CFSSU) P As mentioned in Annex C, CFSSU is an upgrade project to replace the aging supply system. This MICstudy was done in detail by the project office of CFSSU in

Ottawa. The purpose of the tdflc analysis was to determine the eaffic rate leaving each base from the Supply Section.

4.4.- For the purpose of calculating the traffik rate, the following assumptions were made by Systems House:

a. 22 working days per month (volumebics are given in transactions per rnonth);

b. 20% of daily transactions occur over Peak Busy Penod (PBP);

c. the PBP is one hour in duration;

d. the prime time is defined as 0400 hrs to 2000 hrs Central Time, Monday through

Friday ;

e. Maximum datagram size is 896 bytes;

f. Weekly planning and scheduling download: 332 bytes per schedule;

g. Replications and output transactions: 256 bytes per transaction;

h. Reports: 10% of users will request reports: 500 bytes for the request and 50 Kbytes

for the response;

i. Planning and Scheduling Adjustments: 332 bytes per adjustment

j. Supply and Service Canada Procurements: 2500 bytes per procurement; and

k. E-mail: 2500 bytes per message. C- C- In this trmc analysis, a number of factors were taken into consideration as fol-

lows:

a. for each of the tdicconûibutors, the project office identified the total number of

transactions over a given period, estimated the inquisr and response sizes, calculated

the arrivai rate of the transaction over PBP and detennined the total sizes of each

transaction, as shown in section 4.4.4.2, including overheads and BLACKER (encryp-

tion);

b. detemined if outgoing or incoming trafic;

c. cdculated the total amval rate of al1 transactions;

d. calculated the weighted mean transaction size;

e. solved the channel capacity using M/U/l queuing model; and

f. selected the appropriate line speed given a maximum desired utilization and corn-

mon line speed increments.

By using these factors above, the trafic analysis of CFSSU brought the results

for each base involved in the study and Table 4.12 and 4.13 are an example of the results obtained at CFB Edmonton. The results of the other bases can be found in the CFSSU traffic study.

Table 4.12: CFB Edmonton CFSSU Traf'fîc Study

Interactive Trac VOtumetrics Organiz ation Items in Fast Users Dernand Issue Proc Receipt Total Accts Movers

7 CFSD 147 1279 48892 20 11954 62145 234813 117407

Transw- No Out In V(transl I/S Out 1/S b VIS Out VIS In tions S? i 1 Outputs 62145 256 10 O. 1569 457 20 1 7 1.72 3 1.54 Table 4.12: CFB Edmonton CFSSU Trafic Study

r Interactive Traffic Volurnetrics Org aniz ation Items in Fast Demand Issue Pm Rrcei~t Users Movrrs

Reports 14 500 SM00 0.0008 896 53760 O.70 41.81

Plani 19 1 O 332 0.0005 O 457 O 0.22 Sc hedule

Table 4.13: CFB Edmonton CFSSU Results

. . ------. Total V (transactions) 1 -4497 trandsec WMTS 278 bitdtrans 1 ~apaciiy 1 3342 bps 1 IDN Packets per xcond 1 3 DPPS 1 Line Speed 1 9.6 kbps

4.4.5 Quality Assurance Management Information System (QUAMIS)

-As mentioned in Annex C, QUAMIS is an information system (1s) which con- trols and evaluates quality assurance and related operations on bases. The WAN trafic analysis was done by Director General Quality Assurance (DGQA). The purpose of this trac analysis was to determine the volume of data that will be transferred between IDN and QA WAN. The details of this trafic analysis can be found in DGQA 1171.

4.4.5.2 AsçumDtions There were two assumptions made in this repon. The first one is for the average message size, which was assumed to be 5,000 bytes. The second assumption involved the number of messages sent by QAHQ to QA remote sites. It was assumed that each site will send back as many messages as it receives. Table 4.14 shows the total number of messages

currently sent and received from each remote site and QAHQ per day.

Table 4.14: Messages per Day

Toronto

Ottawa 38 26 2 14

London 3.2 O O O

RECEIwD 44.2 30.2 3.2 17

4.4.5.3 1.ue Traffic In the analysis, there were three independent types of leased lines that were considered by QAHQ:

a. CFQAR to IDN leased line;

b. Remote LAN to CFQm leased line; and

c. Remote LAN to IDN leased Iine.

Therefore the total trafic on the leased lines was caiculated by summing al1 of the trafic that will travel over the line from QAHQ to al1 the units.

4.4.6 Estimated Trafic Analysis

Some of the projects that are reviewed in this thesis did not have a proper trafic analysis done by their project manager. Therefore some estimation procedure was required to enable us to find the total trafic leaving each base. The foliowing projects' dataflow were estimated as described below:

a. Equipment System Management (ESM): This project dataflow is the same as what

the IDN Capacity Management study found for the National Material Distribution

System (NMDS). ESM will have the sarne type of traffic as NMDS, that is e-mail and

forms.

b. LEME Ops System (LEMOS), AMMIS and NMMIS: These projects, as described

in Annex C, will each contain a database that will reflect the maintenance of our cur-

rent equipment for the Canadian Amy, Navy and Air Force. The dataflow to and from

these databases has been compared to the dataflow of the Maintenance Management

System (MMS) that DCEPR 1161 found in its study.

c. Land Forces Information System (LFIS): This project will use mostly an e-mail

type of correspondence between amy bases and Headquarters. It is assumed that there

will be a small amount of graphs, which take more space than regular e-mail, but most

of the trafic have an average message size of 5,000 bytes. Since this is similar to what

LGS Group [29] has found for DEMS. the estimated dataflow of LFIS is the same as

DEMS.

d. Military Personnel Information System (MPIS) and Computer Assisted Publication

and Electronic Records Retrieval System (CAPERRS): These two systems are a data-

base read and a database retrieval system. Therefore the dataflow used for its through-

put were taken from Onvural [35] (p. 70) which shows the throughput demands of

applications such as database read and database retrieval. By using these estimates, we finally amdgamated al! trafEc analyses and pro-

duced results that cm be found in Annex E.

4.4.7 Estimate of Network Trafic c As shown in Annex E, the total trafic leaving each base has been found. How-

ever these figures are only the sum of the project forecast within DND. As indicated in

Minoli [3 11, the forecasted total bandwidth on high speed digital networks in the U.S.has been a cumulative increase of 257% in 5 years or approximately 20% per year corn-

pounded (i.e. l00*(1.2)' * 257%), It would be a mistake not to take this into consideration. Therefore this thesis will use the following forecasts for the total trafk

a. total trafTic found in Annex E with 0% increase;

b. total traffic found in Annex E with IO%, 15% and 20% non-compounded over 5

years; and

c. total trafic found in Annex E with IO%, 15% and 20% compounded over 5 years.

These estimates will enable us to find a topology and an objective hnction which will minimize the cost of leasing links. This will be discussed in the next chapter.

4.4.8 Traffic Proportion

As indicated in Brassard [4], the trafEc proportion from base to base is different arnong bases, this is especially tme for Ottawa and Borden, where the data centres are located. Also, there has been a modification to the percentage of tracfrom base to base due to the recent federal budget (CFB Calgary and CFB Chilliwack closing) and the join- ing of the main Headquarten of the air, land and sea elements in Ottawa. Trac calculations were done with this in mind and the results are shown in Annex E and Annex F shows the Mc proportion between bues. Every atternpt has been made to ensure that these percentages are as realistic as possible.The total traff~cestimates that were found in

Annex E were multiplied by 2.4 (30% of trafic dunng one hour as assumed by LGS

Group [29]) to represent the average peak traffic rate (for an 8 hour working day) for al1 increases of the traffic. Table 4.15 is an exarnple of how the tracleaving Borden is pro- portioned to the other bases. Annex F contains more details of al1 the traffk proportions for each base. Table 4.15: CFB Borden Trafic Proportion 1 From To 1 %ofTraffic 1 Trafic@ps) 1 Borden Ottawa 12 1562901 I 1 I Ha1 i fax 9 Il72176 1

Greenwood 2 260483 Gagetown 2 260483

Kingston 4 520967 Trenton 2 260483 1 St-John's 1 130242

. -. Goose Bay 1 1 30242 r------/ 1 1 1 1 1 Toronto 1 4 1 520967 --- - - 1 I- 1 Cold Lake 1 3 1 390725 l Table 4.15: CFB Borden Traffic Proportion

1 From 1 To / % ofTra%c 1 Trac@ps) 1

North Bay 4 520967 W~nnipeg 3 390725 Petawawa 4 520967 1 Esquimalt 6 781450

I Comox 6 78 1450 Edmonton 9 1172176

-in this chapter, we have presented the trafic analyses that were done by communication consultants and by the JDN project office. Also, some estimates were done of

the data rate that some projects are expected to have, but no formal trafic analysis was

done. By having two data centres, one in Borden and the other one in Ottawa, an estimated

trafic sharing proportion was done, which will help to find the trafEc flow between node

pairs for the next chapter. Using the mathematical rnodel of Chapter 3 and the total trac

from base to base in this chapter, Chapter 5 will show the results of GAMS optimization

nins with the 25-node network that is developed for die future requirements of DND. Chapter 5

GAMS Results

The aim of this chapter is to amalgamate the mathematical mode1 of Chapter 3 and the totai trafic leaving bases from Chapter 4 and to find a topology that will meet

DND's future requirements.

5.2.1 Initial Network Topology

The aim of this thesis was to design an ATM network to satisQ the needs of

DND by the end of the century. Due to recent budget cuts in DND during the last two years, numerous basedstations that exist at the moment will close by the year 1997.

Therefore these bases were not taken into consideration in the topology of the new network. The initial topology of the resulting 25-node network is shown in Figure 5.1. The nomenclature is given in Annex G.

This topology was designed using the existing IDN topology, plus adding more links between nodes for survivability purposes.

5.2.2 GAMS Program

The 25-node ne~rorkwas solved using GAMS to find the optimal network. As mentioned previously, the objective fûnction in the problem is to minimize the cost of leased lines for DND. Since this problem is combinationally explosive with 25 nodes, the number of possible solutions were reduced by not allowing certain decisions, such as a link between Comox and Halifax. Therefore: the problem which was solved with GAMS has 98 links with each link shown in Figure 5.1 corresponding to two links with the same capacity. Finally a total of 654 possible routes were put into the program to reduce the number of non-zero variables. Also, each node pair was given at least four possible routes and at lest two independent routes, i.e. no common links, to reduce the number of non- zero variables, again for survivability reasons, and to let GAMS choose the best option. In addition, al1 data used for the program are the tme data, i.e. datatlow from Chapter 4.

There are five different capacities that are used:

a. T 1, 1-544 Mbps,

a. T2, 6.3 12 Mbps,

b. T3, 44.736 Mbps,

c. OC), 155 Mbps and

d. OC12,622 Mbps.

These links are, for the most part, available in Canada. However the telephone companies are very reluctant to talk about their rates. As noted in GTIS [36],the telephone companies have digerent rates for different city links. Also in Minoli [3 11, it is noted that the cost of Tl links has decreased by 70% over the last 5 years. Therefore the costs shown in Table 5.1 were used for the allocation problem, based on the decreased rate mentioned in Minoli [3 11 and the price range obtained in GTIS [36] Table 5.1: Cost of Links

Cost per month per Link Type Installation Cost ($) Kilom eter ($)

Most of the costs in Table 5.1 were estimated with the rates fiom GTIS [36].

These costs are monthly rates and are not discounted in any way. However, the only one that was not available was the OC 12 link cost. Therefore, based on the OC3 link cost, the

OC12 cost was estimated as follows:

(cost of OC3 link X speed of OC 12 link) 1 speed of OC3 link = cost of OC 12 link

5.2.3 Development

To solve the problem, the trafic 80w found in Chapter 4 was put into the

GAMS program as shown in Annex A. The table is the result of the accumulation of the data in Annex E and Annex F. Also as noted in Annex A, there is a constant called "inc", which will increment the tr&c depending on the ratiohcrease of 0% increase, IO%,

15%, 20% non-compounded td~c,and finally IO%, lS%, 20% compounded traffic flow.

This gives us a growth mode1 for the network since, as mentioned in Chapter 4, it is hard to properly forecast the telecommunication requirements for the future for DND.

5.2.4 Results

As previously developed with three and four-node networks, the 25-node network was run with 95% link capacity down to 50% link capacity and from 1 msec to 90 msec delay to look at any change in the topology, but also to examine the objective function. At 95% link utilization with a delay of 60 msec, the optimized topology is show in

Figure 5.2. Details of the results can be found in Annex H. GAMS found that the following links were not necessary for this network with 95% link utilization: Comox-Edmonton

(COMX-EDMT), Petawawa-Borden (PTWW-BRDN), Goose Bay-Halifax (GSBY-

HLFX), Borden-North Bay (BRDN-NRBY) and Winnipeg-Sufield (WNPG-SFFD).

Table 5.2 shows the results of the traffic and capacities of the links of the network with

95% link capacity.

Table 5.2: Results for Optimization at 95% Link Capacity

Link Pair (AjB) Trafic (kbps) (A/B) Capacity (kbps) Link Utilization (A!B)

BRDN-OTWA 3 8206142499 44736 3541.95

OTWA-KGTN 146611466 1544 .95/.95 OTWA-QUEB 1754013072 1 44736 -3921.687 OTWA-MTRL 2456/324 10 44736 .O5 51.724

Table 5.2: Results for Optimuation at 95% Link Capacity

Link Pair (MB) Trafic (kbps) (MB) Capacity (kbps) Link Utilization (AIB) TREN-KGTN 146614 14 1544 -951.268 KGTN-MTRL 13268/3692 44736 .297/.083 QUEB-MTRL 14086116087 44736 .3 151.36 1 QUEB-GAGE 1 3 763/5996 1 63 12 1 -5961.95

1 MTRL-GAGE 1 1579/409 2 1 63 12 1 -2501.648

1 GAGE-GRWD 1 88411466 1 1544 1 -5731.95

GAGE-SHWR 124/3 89 1544 .083/.252 GRWD-HLFX 4849/689 63 12 .7681.1 09

HLFX-GSBY 66 111466 I 544 .428/.95 HLFX-STJH 53 119821 44736 .O 121,220 .-

1 CDLK-WNWR / 5996/3837 1 63 12 1 .95/.608 1 1 CDLK-EDMT 1 1020/1466 1 1 544 1 .660/.95 1

1 SHIL-SFFD 1 16759142499 1 44736 1 .374/.95 1 Table 5.2: Results for Optimization at 95% Link Capacity

Link Pair (AB) Trafic (kbps) (AB) Capacity (kbps) Link Utiliuition (kB) ESQT-COMX 146611466 1544 .95/.95 ESQT-SFFD 1891615527 44736 .423/. 124 C OMX-SFFD 1 1546143 03 44736 .258/.096 EDMT-SFFD 953216948 44736 .213/. 155

The objective hinction value for 95% link capacity was $2.3240 M. Figure 5.3 shows the results when the link utilization is reduced from 95 to 50%. As shown, it is cheaper to use the highest link utilization (95%) than the lowest (50%). However, it is not wise for network management to plan a topology using 95% of the link utilization, as pointed out in numerous papers. Figure 5.4 shows what the results when the delay is increased from 1 to 90 msec. Again, it is cheaper to have a longer delay than a smaller delay as a criterion.

Percentage of Capacity vs. Cost 0% lncrease s --5 3.6 g 3.4 3.2 -t 3 .OY 5O 2.8 LL 2.6 0 .3- 2.4 m 2.2 1 I 3 O 50 60 70 80 90 100 Percentage of Capacity (%)

Figure 5.3 Link Utilization vs. Objective Function for 0% Increase given 60 msec delay Delay vs. Cost O % Increase

O 20 40 60 80 1O0 Delay (msec)

Figure 5.4 Delay vs. Objective Function for 0% Increase given 95% Link Utiluation

Figure 5.3 and 5.4 give a good idea what the cost will look like as a function of different delays and percentages of link utilization. It is recommended by the telephone companies that you should plan for a maximum of 75% capacity for any link. Therefore the cost for a 0% increase of the trac flow and a delay of 60 msec would be $2.742723

M, as show in Figure 5.3. Annex 1 contains some examples of different topologies that were found with the results of the optimization using GAMS and the different constraints of link utilization and delay. The following Figures are the results of the GAMS optimiza- f tion process for different percentages of increased trafic given a delay of 60 msec for the odd-numbered Figures and different delays given 95% link utilization for the even-nurn- bered Figures. Percentage of Capacity vs. Cost 10% lncrease

60 70 80 90 Percentage of Capacity (%)

Figure 5.5 Link UtiIization vs. Objective Fuaction for 10% Increase in Traffk Flow given 60 msec delay (Topologies are shown in Annex 1)

Delay vs. Cost 10% lncrease

20 40 60 80 100 Delay (msec)

Figure 5.6 Delay vs. Objective Function for 10% Increase in Trafic Flow given 95% Link Utilization (Topologies are shown in Annex I) Percentage of Capacity vs. Cost 15% lncrease

5.5 5 4.5 4 3.5 3 50 60 70 80 90 1O0 Percentage of Capacity (%)

Figure 5.7 Link Utilization vs. Objective Function for 15% Increase in Trafic Flow given 60 msec delay (Topologies are shown in Annex I)

Delay vs. Cost 15% lncrease

20 40 60 80 IO0 Delay (msec)

Figure 5.8 Delay vs. Objective Function for 15% Increase in Traffic Flow given 95% Link Utilization (Topologies are shown in Annex 1) Percentage of Capacity vs. Cost 20°h Increase

O 50 60 70 80 90 IO0 Percentage of Capacity (%)

Figure 5.9 Link Utilization vs. Objective Function for 20% Increase in Traffc Flow given 60 msec delay (Topologies are shown in Annex I)

Delay vs. Cost 20% Increase

20 40 60 80 100 Delay (msec) Figure 5.10 Delay vs. Objective Function for 20% Increase in Traffic Flow given 95% Link Utilization (Topologies are shown in Annex I) Percentage of Capacity vs. Cost, 10% lncrease Compounded

50 60 70 80 90 1O0 Percentage of Capacity (%)

Figure 5.11 Link Utilization vs. Objective Function for 10% Increase Compounded in Trafic Flow given 60 msec delay (Topologies are shown in Annex 1)

Delay vs. Cost 10% lncrease Compounded

Delay (msec)

Figure 5.12 Delay vs. Objective Function for 10% Increase Compounded in Traffic Flow given 95% Link Utilization (Topologies are shown in Annex I) Percentage of Capacity vs. Cost 15% Increase Compounded *--

Percentage of Capacity (%)

Figure 5.13 Link Utiluation vs. Objective Function for 15% Increase Compounded in Trafflc Flow given 60 msec delay (Topologies are shown in Annex I)

Delay vs. Cost 15% Increase Compounded

u O 20 40 60 80 100 Delay (msec)

Figure 5.14 Delay vs. Objective Function for 15% Increase Compounded in Traffic Flow given 95% Link Utilization (Topologies are shown in Annex I) Cost vs Percentage of Capacity 20% lncrease Compounded 6s ,7.5 O .-- 7 6.5 C .-u0 6 O 5 5.5

U.5Q) > 4.5 *=O 3a, 4 O 50 60 70 80 90 100 Percentage of Capacity (%)

Figure 5.15 Link Utilization vs. Objective Function for 20% Increase Compounded in Traffk Flow given 60 msec delay (Topologies are shown in Annex 9

Delay vs. Cost 20% lncrease Compounded

Delay (msec)

Figure 5.16 Delay vs. Objective Function for 20% Increase Compounded in Trafic Flow given 95% Link Utilization (Topologies are shown in Annex 1) -Chapter 5 has shown the GAMS results for this thesis, which is to exercise the mathematical mode1 formulated in Chapter 3 and incorporate the traffiic results found in Chapter 4.

The software program is organized as such that there are not twmany modifications to be done, i.e. to generate new topologies for the future requirements of Dm,one needs only to change the traffic table and rerun the program. The results obtained give numerous topologies depending on the percentage of the link's utilization and ais0 depends on the delay that the user plans to have in the network. Chapter 6 will now descnbe the simulation process that we went through to show that one of the topologies taken from the results of Chapter 5 will meet an acceptable quality of senrice, i.e. end-to-end delay and ce11 delay variation, for an Aï'M network. Chapter 6

Simulation Model

in Chapter 4, we used GAMS software to solve the optimizations that we produced to find a network topology with different trac rates. This chapter will now look at one particular topology and discover if this network will provide an acceptable quality of service (QOS) for an ASU network for DND. To simulate this network, we used the sofi- ware OPtimized Network Engineering Tools (OPNET).It is a comprehensive engineering system capable of simulating large communications networks and it is one of the most powefil and advanced simulation tools used today. OPNET provides detailed models and performance analysis. OPNET Version 2.5a also provides the ability to simulate ATM networks.

OPNET offers different simulation tools fiom small LAN simulation tools to an

ATM WAN simulation. To simulate our model, we use the ATM WAN simulator. How- ever there were numerous modifications that we had to make to simulate one of the topologies of Chapter 5. One of the interfaces that we modified the most was the ATM node model.

6.2.1 ATM Module Mode1

The ATM module model as shown in Figure 6.1 is divided into three parts. The first part is the traffic source (trcsrc), the second part is the trafic destination (tfcdest) and the third part is the digital crossconnect (xconn) switch uses by OPNET

Figure 6.1 ATM Module Model

One of the main parts in the simulation mode1 is the trafic source. Figure 6.2 shows in detail the interior of the trcsrc module.

Figure 6.2 ATM Node Model This module is divided into two interfaces:

a. AAL interfaces and

b. ATM intefiaces.

nie AAL interfaces have the traffi~csource (trcsrc) module which represents the tfic generator. The AAL module receives packets from higher layers and fowards them to the ATM Layer. During this phase, the AAL will segment the td~cinto cells. The

ATM interface is divided into four modules:

a. ATM Management module: its role is to process al1 control messages that are used

to establish and release connections and also route update messages. It also uses con-

trol messages to allocate VCCs for calls routed through the node.

b. ATM Translation module: receives al1 ATM cells aniving at a node. It gives a new

VPWCI value to al1 outgoing cells and the cells are sent to the ATM Switch module.

It also sends al1 data that are going to the current node to the ATM Layer.

c. ATM Switch module: is a fast packet switch for al1 outgoing cells. Its role is to

place the outgoing ATM cells to the right output port buffers.

d. ATM Layer module: receives cells from the ATM Translation module and sends

them to the AAL for the disassembly of cells. It also receives an input from the ATM

Management module with cells containing control information to other nodes.

One of the main modifications in this model has been the trafic generator. In the OPNET model, you can only send traffic from one node to a single destination. How- ever, as noted in Brassard [4] and as Annex F shows, we have to have multiple destina- tions for each base. To resolve this problem, we had to first find a way to represent the percentage of traffic leaving a base. To solve this. we designed a customized probability density function (PDF), which represents the trafic ratio from one base to another. As shown in Figure 6.3, where the X- axis represents the address that were given in the tra€fic destination and the Y-axis represents the proportion of trac leaving CFB Borden and directed to other bases. In Figure 6.3 the address of CFB Borden is 1, and the value of address 1 on the Y-axis is O. Annex G defines the address of each base. Annex J contains al1 the PDFs for each base needed for the simulations. Annex K contains the rnodified codes written in C for the trafic generator process.

Figure 6.3 Probabüity Density Function for the Trame Leaving CFB Borden

The traffk destination node (tfcdest), as show in Figure 6.1,contains the node's address. This node also includes a group of procedures, known as the Neighbour Notification Protocol O).This allows the processor and queue modules to identify their neighbours.

The aim of the environmental file is to group different attributes conceming the network and to put them into one file. Annex L details al1 the attributes that contribute to our mode1 and that are part of the environmental file. One of the attnbutes is the packet size, and since ATM uses three types of source, data, video and voice, we felt that it would be acceptable to amalgamate the packet size of each of the sources and make it into a average packet size for the network. Onwral [35] (p.75) suggests some interarrival rates for some applications as show in Table 6.1. Also, as noted in Minoli [3 11 (p. 13), the forecasted ratio of trafic trends will be as follows:

a. 50% LAN interconnection,

b. 10% traditional data,

c. 35% voice and

d. 5% video.

Table 6.1: Sources' Packet Size

Source Packet Size (bits) Interarrival Rate 10 Mbps Token Ring 7103 .O0070 13 Data) Voice 320 .O05 2 Mbps Cornpressed Video 1 56000 1 .O3333

By taking the packet size of each source from Table 6.1 and the prediction of

Minoli [3 11, we found that the average packet size for our simulations will be 71 74 bits. Also as noted in Annex L, we have a different interamval time for each base. This is due to the results of Annex F where the total trac rate leaving a base is different from another.

C- C-

Another modification of OPNET was the VP configuration file. This file contains static VP link definitions which includes the data rate of these links. The sample model uses only OC3 (155Mbps) as a data rate. We found in Chapter 5 that some of our links needed only a capacity Tl, T2 and T3 data rates. Therefore, as Annex M shows, we added them into this file and used them with the environmental file.

. .. 1.4 DJ The last modification of this module was the crossconnect switch that is represented in Figure 6.4. This mode1 implements VP and VC switching capabilities in the network. In the OPNET Aï'M model, the node could only switch to eight VP links. However, to satise the topology that we found in Chapter 5, we added more VP links and ports to its capabilities. Figure 6.4 Borden Crossconnect Switch

6.2.2 ATM Network Mode1

The aim of the thesis is to design and optimize an ATM network for the needs of DND in the future. There are numerous topologies that were found in Chapter 5 for different link utilizations and for different delays. In Figure 6.5, we show the topoiogy that we felt would meet an acceptable quality of service for an ATM network. This topology represents the network found in Chapter 5 using GAMS, with 70% link utilization for a noncompounded increase of 10% of the total trfic, given 60 msec of delay. This network is shown in Figure 6.5 and comprises 25 nodes like Chapter 5's network. Each link is identified with an user identification which corresponds to the user identification from the

VP configuration file as mentioned in section 6.2.1.3. Figure 6.5 ATM WAN for DND 6.2.3 ATM Model Routing

OPNET uses a routing scheme called Static Distributed Routing (SDR). Each node maintains its own routing table, which includes records of ail known routes to al1 known nodes for al1 classes of service. ATM routing must know al1 possible routes in case a link dong the best (shortest) route does not have enough bandwidth to support the cail at the cal1 setup time. This cm occur since the bandwidth is shared among several calls.

When the packet arrives at the node, its destination address is verified. If the address is the sarne as the current node, the packet is fonvarded to the higher layer. How- ever, if this node is not the packet's final destination, the network layer process searches the routing table for the best route to the final destination. If a link on this best route does not have enough bandwidth to support this call, the next best route is chosen. This routing table is constructed using the Bellman-Ford shortest path aigorithm 1261.

This algorithm considers first the shortest path to each node traversing at most one edge, then considers the shortest path traversing at most two edges and continues on until the shortest path traversing at most N-1 (N representing the number of nodes) edges has been found.

6.2.4 OPNET Model Limitations

OPNET Version 2.5a is a software intended for the purpose of simulation and certain performance estimation parts of the ATM protocol have been simplified or omit- ted. The ATM model supports VP and VC switching capability. Point-to-point, full-duplex connections can be established using this model, however the point-too-mu1ti point VCCs are not supported in this version. As mentioned in Chapter 2, ATM has four different types of AAL. OPNET only supports AALS data services and we used AALS for this part. 6.2.5 Results

In this section, the performance of the DND ATM WAN is studied. Numerous simulations were done to veriw if the topology that was found in Chapter 5 meets the

ATM quaiity of service.

The first group of simulations were done using the 0% traffic increase of Annex

D. There were 10 simulation mns done and the results are shown in Table 6.2.The average end-to-end delay is 0.0064337 sec, which is acceptable for an ATM network for al1 three types of sources, as noted in Onvural [35] (p.81). Figure 6.6 shows the details of one of these simulations of the end-to-end delay and Figure 6.7 shows the sarne simulation for the ce11 delay variation. Table 6.2: Simulation Results, Average End-to-End Delay for 0% Increase in Trafic

------Simulation Runs S tatist I I 1 1 I I I 1 I Figure 6.6 End-to-End Delay for O% Increase in Traffic Flow

Figure 6.7 Cell Delay Variation for 0% Increase in Trafic Flow é3 5.2 WAN with IO% lncrease The second group of simulations were done using the 10% tr&c increase of

Annex D. There were, again, 10 simulation runs done which enable us to compare the results of this simulation and the ones above. As shown in Table 6.3, the average end-to- end delay of these simulations is slightly longer (0.00647816 sec) than the one that we found in section 6.2.5.1. This is due by the interarrivaf traffic of these simulations that is faster than the previous one of section 6.2.5.1, though more trafic is on the links, therefore the traffic rate could slow down. Figure 6.8 shows the details of one of these simulations of the end-to-end delay and Figure 6.9 shows the same simulation for the ce11 delay variation. Table 6.3: Simulation Results, Average End-to-End Delay, for 10% Increase in Trafic Flow

Simulation Runs Statist ics r 1 2 3 4 5 6 7 8 9 1O

Mean 005592 00550 0067136 005931 (337487 007043 005605 006086 007985 006W (SEC)

StdDev 0 34697 15571.Y 2 M327 1 W9X 195835 156611 166841 ZS932X 5 J524X 1 S549X 1 ISECI 1 x104 1 IO-' 1 xin-5 1 in-' 1 xioJ 1 XIO-~1 xio-5 1 IO-' 1 10.' ( in-' 1 20

Simulation Time (sec) ru- (m.C>

Figure 6.8 End-to-End Delay for 10% Increase in Traftïc Flow

Figure 6.9 Ce11 Delay Variation for 10% Increase in Traffic Flow u5.3 WAN w.th 20O becampaunded

The third group of simulations were done using the 20% compounded tr*c increase of Annex D.There were, again, 10 simulation runs done which enable us to compare the results of this simulation and the ones above. As shown in Table 6.4, the average end-to-end delay of these simulations is longer (0.01050585 sec) than the ones that we found in section 6.2.5.1 and 6.2.5.2. This is, again, due to the interarrivai trafic of these simulations that is faster than the previous ones of sections 6.2.5.1 and 6.2.5.2.Figure 6.10 shows the details of one of these simulations of the end-to-end delay and Figure 6.1 1 shows the sarne simulation for the cell delay variation. Table 6.4: Simulation Results, Average End-to-End Delay, for 20% Increase Compounded in Traffic Flow

Simulation Runs ics 1 1 2 3 4 5 6 7 8 9 IO - Mcan 0083225 91136 01252 0lrJSl 01464 007448 00937 01145 OI03 908798 !=)

Std DN 3 357X 4WSX 16376X 1 1493X 2.089IX l jj3.Y fé457X j lj9gX 5 08662 3 83997 (=) IO -s 10 -$ IO-$ IO -s IO -$ IO -5 10-5 IO-5 XIO-' x1w5 Simulation Time (sec) U*r (sec)

Figure 6.10 End-to-End Delay for 20% Increase Compounded in Traffic Flow

Figure 6.11 Ce11 Delay Variation for 20% Increase Compounded in Traftïc Flow -In this chapter, we have chosen one of the topologies that we found in Chapter 5 and submitted it to different simulations using OPNET.We have shown that al1 the results of the simulations, using three types of tr&c rates, demonstrate that the topology used met acceptable level of seMce for DND, Le. end-to-end delay less than 60 msec and ce11 deiay variation. It was also determined also that this topology would handle DND's future bandwidth requirements. Chapter 7

Surnmary & Conclusion c nie importance of forecasting bandwidth is increasingly important in Our soci- ety today. It would be a corporation's nightmare if their computer network crashes in the middle of transactions, especially banks. It would be worst for DM> in a military operation, where lives can be at stake.

This thesis was divided into four main parts. First, we developed a mathemati- cd mode1 which is able to minimize the cost of leasing links for an ATM network for

DND.Second, we collected tr&c analyses that were done, and made some assumptionsl estimates for other projects to find out the totai trafic leaving each base. Also, to add to this estimate of network trafic, the traffic proportion leaving a base to other bases was approximated. Since it is hard to forecast the future requirement for DND with regard to bandwidth, we estimated the trafic rates using O%, 10Y0,15% and 20% increases corn- pounded and non-compounded. We have also increased the estimated traff~cby 2.4 which will represent the peak trafic rate for al1 bases. This total trafic analysis will give DND a tool to estimate its bandwidth requirement for the fuhire.

Third, we developed a prograrn using GAMS to optimize the objective function

(minimize leasing cost) using the mathematical mode1 and the estimated trafic rates for each base. With this in mind, we obtained different topologies, as a function of the link uti- lizationfpercentage of link capacity and depending on the delay. Over 160 different runs were made to demonstrate the different topologies. With each run, we obtained an objective fûnction (cos of leasing Iink) and we demonstrated that it is cheaper to have a network with higher link utilization or with a longer delay. With these costs done, DND can now forecast the cost of leasing bandwidth for its needs.

Finally, we used a simulation tool, cailed OPNET to demonstrate the topology that we chose met ATM qualiîy of service which was defined in earlier chapten. The simulation runs were done for O%, 10% increases in trafic non-compounded and a 20% increase in trafic compounded. Ail the simulation mns showed that the network we chose met ATM quality of service, i.e. end-to-end delay and ce11 delay variation.

There has been numerous projects that we used for the thesis that might be cm- celled due to budget cuts. However, it is also wise to over forecast bandwidth requirements than underestimate it. The following areas of study are suggested:

a. develop a traffiic management tool that will represent an ATM network for DND;

b. analyse the network for contingency/disaster recovery planning for DND;

c. develop a mathematical mode1 which will use delay as a quadratic formulation

instead of a fixed average end-to-end delay; and

d. cost effectiveness study for the evolution of IDN to an ATM network for DND. References.

[l] Armstrong M, Telecommunication Survey , Northern Telecomm, June 1994

[2] Baybars, 1. and Kortanek K. O., Transmission Faciiity Planning in Telecommunica- tions Networks: A Heuristic Approach, Eur Journal Operationai Research, 1984, Vol 16 pp 59- 83.

[3] Brassard, Brief on IDN Capacity Limitations, NDHQ DISEM 6, Mar 94.

[4] Brassard A., Capacity Analysis of the Integrated Data Network, Royal Military Col- lege of Canada, 1992.

[SI Casaca, A. and Rocha, R., Architecture of an ATM Based Customer Premises Net- work for a Residential Environment, Eleventh International Conference on Cornputer Comrnu- nication, Genoa, Italy, Oct 92, pp. 559-565.

[6] CCITT: Recommendation 1.1 13. B-ISDN Protocol Reference Mode1 and its application. Geneva, 1991.

[7] CCITT: Recommendation 1.11 5. Vocabulary of Terms for Broadband Aspects of B- ISDN, Geneva, 1991.

[8] CCITT: Recommendation L3 11 .BISDN General Network Aspects. Geneva, 1991.

[9] CCITT: Recornmendation 1.321. B-ISDN Protocol Reference. Blue Book, Fascicle III.8, Geneva, 1989.

[IO] CCITT: Recommendation L327. BISDN Functional Architecture. Geneva, 1991

1111 CCITT: Recommendation I.363. B-ISDN ATM Adaptation Layer (AAL) Specification, Geneva, 199 1.

[12] CCITT: Recommendation 1.4 13. Broadband Aspects of B-ISDN. Geneva, 1990.

[13] Comgate, Interfacility Data Communication Requirement Analysis for MAATS, Ottawa, July 93

[14] Cosgrove, T.C. and Chipp, R.D.Economic Considerations for Communication Sys- tems, IEEE Tram. Commun. COM-16, 5 13-525.1968

[15] Cox, Jerome R., Gaddis Michael E. and Turner Jonathan S., Project Zeus, IEEE Network, March 1993, pp 20-30.

[16] DCEPR, IDN Capacity Management, NDHQ DISEM 6, Mar 94 [17] DGQA, QA WAN Traff~cAnalysis, DGQA Ottawa, Sep 94

[18] Dutta, Amitava, and Lim, lay-Ick, A Multiperiod Capacity Planning Mode1 for Back- bone Computer Communication Networks, Operational Research Vol. 40, No. 4 July-August 1992, pp 689-705.

[19] Fotedar, Geria, Crocetti and Fratta, ATM Virtual Private Networks, Communication of the ACM, February 1995 Vo1.38, No 2.

[20] Gavish, B. and Altinkemer, K., Backbone Network Design Tools with Economics Tradeoffs,ORSA Journal Cornputers, 1990.

[21] Gavish, B. Trudeau, P. Dror, M. Gendreau, M, and Mason, L., Fiber Optic Circuit Net- work Design Under Reliability Constraints, IEEE Journal Selected Area in Communications, 1989 SAC-7, pp 1181-1187.

[22] Gavish, B. and Hantler, S.L., An Algonthm for Optimal Route Selection in SNA Net- works, IEEE Trans. Commun., COM-3 1, 1Z 54- 116 1.1983

[23] Gavish B. and Neuman, L, A System for Routing and Capacity Assignment in Corn- puter Communication Networks, IEEE Trans. Commun. COM-37,pp 360-366.1989.

[24] Gerla M., Topology Design and Bandwidth Allocation in ATM Nets, IEEE Journal on Selected Areas in Communications, 1989.

[25] Gerla, M. and Kleinrock, L., On the Topological Design of Distributed Cornputer Net- works, IEEE Trans. Commun. COM-25, pp 48-60.1977

[26] Gerla, Monteiro, and Pazos, Topology Design and Bandwith Allocation in ATM Nets, IEEE Journal on Selected Areas in Communications, 1989.

[27] Goldstein Fred R ISDN in Perspective, Addison-Wesley, 1992

[28] Handel, Rainer and Huber Manfred N. Integrated Broadband Networks, An Introduc- tion to ATM-Based Networks, Reading, 199 1, Addison-Wesley, pp 52-54.

[29] LGS Group, DMHS Analysis of Networking requirements as supported by IDN, DISEM 6-3, Jan 95

[30] Manual of Cost Factors, NDHQ Director of Costing SeMces, Mar 94.

[3 11 Minoli D., Entreprise Networking, Artech House, 1993,

[32] Monma, C. L. and Sheng, D. D., Backbone Network Design and Performance Analy- sis: A Methodology for Packet Switching Networks. IEEE Journal Selected Areas Cornmuni- cations, 1986, SAC-4, pp 946-965. [33] Narashiiman, S, Pirkul H. and De, P., Route Selection in Backbone Data Communica- tion Networks, Computer Networks ISDN System 15, 12 1- 133.1988

[34] Newman Peter, ATM Local Area Networks, IEEE Communications Magazine, March 1994, pp 86-98.

[35] Onvural, Asynchronous Transfer mode Networks: Performance Issues, Artech House, Norwood M.A., 1994

[36] Govemment Telecommunication Information System (GTIS), Products, Services and Rates Manual, May 1994, Ottawa.

1371 Saksena, Vikram R-,Topological Analysis of Packet Networks, IEEE Journal Selected Areas COmmunications, Vol 7, No 8. October 1989, pp 1243-1252.

[38] Schwartz, Mischa, Telecomm Networks, Protocol, Modelling and Analysis, Addison- Wesley, 1988, p 523.

[39] Tanenbaum, Andrew S., Computer Networks, Prentice-Hall, New Jersey, 1981

1401 Vickers Brett J. and Suda Tatsuya, Connectionless Service for Public ATM Networks, IEEE Communications Magazine, August 1994, pp 3442

[41] Yaged, B., Minimum Cost for Dynamic Network Models, Netwokrs 4, 1973, pp 193- 224.

[42] Casaca A and Rocha R., Architecture of an ATM Based Customer Premises Network for a Residential Environment, Eleventh International Conference on Corn puter Communi ca- tion, Genoa, Italy, Oct 92, pp. 559-565. GAMS Program

* This medel repcesents a ccmunication netxcrk. *This m~delwill aptimize Che ccsts cf leasing Links bepeen thcse DND bases.

set i cities / brdn, ctwa, tren, kgk, q~en,rntrl, gage, gn;d, hlfx, skxr, t3r2, gsby, tago, Xjn, stjh, cdlk, -mdr, shil, hnFp, nrby, ptdwesqt, cm%, eh:, sffn / s tes:t==?qy / s-I - 5-5 / t pcssiSle rcutes / t-l c-634

aliasti, ip, ipp, ipppl ;

set r ii, ip) dizected arc3

11 (i,ip; undireeted arcs ;

pa rarneter uarc ( i, tp) undirected arcs / brde .otua 340, brda.ntr1 500, brdn. t:en 160, otsra-kgtn ocwa. queb 455, tren. kgtn 200, kgtn-ntrl 268, rnCrl.queb queS. gage 428, mtzl-gage 5EE, gage-grxd 540, gage.hlfx gage. shxr 350, ntrl-hlfx LOCO, hlfx. shur 10, hlfx-??ad brdn. toro 80, ot;Ja. tren 220, otwa-ntrl 204, ot'wa.ttjn rntrl.stjn 30, ntr1.bagc 400, queb.bago 160, baga-pâby hlfx .gsby 1110, stjh.gsby 840, hlfx-stjh 907, tren. tora cdlk :-mur 1a0, knur. shil 640, cdlk.c:by 2320, snil .apç 'mpg.nrby 1360, nrby.pr.a L6û, nrby.brdr. 240, smpg-brdn pt;;x.o t-xa 160, pt..+w. brdn 240, zhil.brdn 1040, e5qt.ccmx esqt-sffd 920, com.Sffd 1le0, conx-edmt 920, edmr.cdlk edat .mwr 200, ednt-sffd 410, edrit.smpg 1308, sffa-shii sf fd.mpg 980/;

paramerers da:= ( i, Fp) di:es:ed arcs oriq lr, ip) crigtn ma~~ing; darc fi,ip) - 3ax (uazcli,i~) ,uarc [ip, i) ; r(i, ip) - yesSdarc ii, ipl ; u(i,f~l =yesSsarc(i,Fp); cr:;;i, i) = 1 ; r:i, il - 20; display darc, orig, r;

f tsl fixeà ==sr / 5-1 1050 , 5-2 :@?O, 9-3 6726, 3-4 21159, 5-5 â250C / v(s1 variable coit / s-: 11 , s-2 32.5, 9-3 55, s-4 225, 5-5 500 / =?den ( i;;

table den(i, ipl demands Zn daza ::a: fic fcr bandxidtb brdn otwa cen kg t:l q'J eb ntrl gage g-4 hlfx shwr stfn stfh WbY roro ba go cdik shil mur nrby P9 P edmt esqc corn SC fd t ztjn stjh gsby =CI:= bags cdlk shil Srdn 260 130 130 521 25C 390 120 ot-a 1063 531 5fL 4252 2535 2125 531 sf fd 175 emt 5E 5 PtW 385 nzby 326 336 smwr 2 20 shil rgtn tren toro Fueb nt:l cdlk bagc CC,%

+ edmt esq+ camx sffd Ordn 1172 781 751 521 Otira 5315 2656 1555 2535 sffd 17 8 edmt 555 'mkT ZR0 230 sbil 119 232 kg tn 250 ter. 526 526 qu es 260 mcrl 66 L cdlk 740 hl Ex 2050

3calar xc increase traific iz 5 years / 2 / ; todem(ij - sum(ip, del(i,ip)) * inc : table route (i,ip, t, ipp, ipp~) brc!n.otwa hrdn.ac:l Srdn. rren swa. bzdn urda. lgrz =:;sa .queb brdn.orxa .c-1 ? brdn.cc*&. c-2 hrdn.otua. t-3 brdn.hlfx.t-5 brdn.hlfx.c-6 b:dn.hlf%.C-7 brdn.hlfx.t-6 brdn.queb.t-5 krdn-qtieb-t-1C brdn.queb.t-11 brdn.queb.:-12 brdn.stitiz.r-l? bf3n.ahwf.t-14 brdn.snwr.:-15 brdn-shwr-t-16 brdn.shwr.t-17 krdn.shwr.t-16 Sfdn.g,wd.t-15 Src!c .gr&. t-23 brdn .grwd. t-2 1 b:dn.qmd.t-22 brdn. grdd. t-2 3 brdn-gr&. t-24 brdn.gage. c-25 brdn.9age.t-25 brdn-gage-t-27 bran.qage.t-28 brdn. gage. t-2 5 brdn.qage.t-30 brdn.mtr1.c-3i brdn.mtr1.t-32 brdn.mtr1.t-33 brdn.ntr1.t-34 5rdn.kgtn.t-35 b:dc.kgrn.t-36 brdn.kgtn.c-38 brdn.tren.t-39 brdn. tren. c-4 1 brdn.t:en.t-42 hlfx.brdn. t-50 b1Lx.brdn.t-53 qceb.otwa. t-5; queb.brdn .:-53 queb-brdn. t-61 gueb.mtrl.t-64 shwr.brdn.:-69 3age.brdn.t-76 tren-brdn. t-89 tren-bzdn-t-90 rzen-otwa. t-92 kgta-brdn-t-55 kgtn-oPwa. t-100 kgtn-mtr1.t-104 kgtn-mtr1.r-106 gr&-bcdn.t-108 gr&-otwa. t-112 rntrl-brdn.t-117 mtr1-brdn.z-118 strl .ore. t-120 mtrl-Zgtn-t-124 m' m' 1 L---- kgtn. t-125 mtrl.kgtn.t-126 ntr1.queb.t-127 !3trl-queb.t-~2~ 3tZL.q~eb.t-129 mtr1.qtreb.t-130 0tsra.brdn.t-131 otua-brdn. t-134 0Wa.hlfx.t-135 O--blfx. t-?36 0t;m.hlfx.t-137 3t'&-hlfx. t-138 Ot-da.queb. t-139 otwa.gueb.t-140 0twa.queh.t-141 ütm-sh~c.t-143 OtUa.ShW~.t-144 0tua.shwr.t-145 Otua-sfiwt. :-146 ot-.~a.gfid.:-:l7 oWa.grdù.t-148 ct'da.grdc!.c-349 otira.grwd.r-150 otm.gage. t-151 0tn.gage. t-152 oWa.gage. c-153 Ct'a. kgtn. t-155 oca. kgta.t-157 O-. lcgtn.t-158 otv*ra.rntrl. t-159 otw-stri.c-l60 0tsJa.mtrl.:-161 ot-da-ntrl.t-162 otua. cren. c-164 ot'cia. tren.:-165 stjh.brdn.c-169 qsby.brdn.c-179 g~~y.b~dn.t-iE2 st jn .ardn. t-140 ba9o.brdn.t-192 toro. brdn. t-206 brdn.s:jh. t-211 bzln-stjh. t-212 brdn.5tjh.t-213 brdn-stjh-t-214 otwa-stjh-r-215 otwa.stfh. t-217 brdn.gsby.t-223 brdo.gsby.t-224 brdn.9aby.t-225 brdn.gsby.t-226 stjn-0twa.t-229 otza.stfa. c-230 brdn.stin.t-231 brdn.stjn.t-232 brdn.srjn. t-233 brdn-scjn. c-234 brdn.ba9a.t-235 brdn-bago-t-236 brdn.bag0.t-238 0twa.bago.t-239 mcr?.baga.i-245 Or3n.rorr.t-246 kTdn.C3:0.:-244 brdn.tozo.:-250 oc.&. tom. t-253 cdlk.otfda .t-164 cdiS.0tM.t-265 cdLk.0tm.t-266 ~dlk.bag0.t-272 cdlk-bago-t-273 cd1k.bago.t-274 shil.otwa. t-207 shil-orwa. c-298 shfl .atm. t-289 Wwr.otua. t-303 mwr.O-.:-304 brdn-nz9y.t-318 nrSy.rt'da. t-320 nrSy.orma. t-321 brdn .m~g.t-334 srr.pg .atsm.:-335 bnpg .aciJa. t-336 mpg-owa. t-237 ken-pe&.c-348 pw.ot*.ia. t-352 brdn. pt-&. r-34 9 ptw.0hJa.t-353 0t.a. cdlk. t-268 otua.cd1k.t-265 0tsra-cd1k.t-270 bdgo.cd1k.t-276 bag0.cdlk.t-277 bago.cd1k.t-278 atn.shiL. t-291 otwa .ahil. t-2 52 otwa.shil.r-233 oPi.unwr. :-307 atwa.wnwr. t-300 nzSy.bzd3.t-214 otwa.n:by. t-324 ot'wa-nrby. z-325 wrlpg. brdn. c-320 0twa:mpg. t-339 0tsJa.mpq. t-340 ot'wa-unpg. t-341 ptw-brdn. t-344 at;a.pra. t-356 ca1L.Sagc.:-271 nrby .citua. t-322 esqt .otua. t-j67 e3qt.otwa.t-360 esqr.3tsra.t-370 esqt-h1fx.t-375 e3qt.hlfx.t-376 esqt.hlfx.:-377 esqt-h1fx.t-276 com.arwa. t-391 cnnx.a:ua. :-352 cnm,otwa.:-337 coax.at*a. t-354 camx.mtr1. t-400 camx.ntrl. t-402 edmt.ora. t-423 edmt .otwa. c-424 edmc.ot'.a. t-425 edrnt-atm.t-445 sffd.atn.t-439 sffd-atm.t-440 SI fCi.otwa.:-453 oCka.esqt. t-371 0twa.esqt.t-372 otwa. esqt. :-374 h1fx.esqt.t-379 !Ilfx.esqt. t-380 hlfx .esqt. t-301 hlfx-esqt. t-302 0twa.comx. c-395 ot;ia.comx.t-346 otwa.com. t-347 0t'"a .comx. t-398 comx.mtrL.t-359 ronx.mtrl.~-4bl mtrL.comx.t-404 zirl.camx.r-406 oca. edint .r-(27 otua.eùmt.t-42~ 0twa.edmt. t-429 0t'ra.edmt-t-450 Otm-~ffd-t-443 0tUa.sffd.t-444 Otm-sffd.t-4 54 nrby. tzen. t-4 99 nriy. baga. t-4 41 n:by. bago, t-4 92 queb-gage-t-513 ptw.queb, t-527 ptw-queb,t-520 edmt.queb.t-535 edmt .queb. t-536 edmt .queb. t-537 kgcn-queh-t-544 kgta-queb. c-545 tar0.ptv&. t-560 e&R. kgtn. t-SE6 toro. kgtn. t-630 toK0-kgtn.c-628 Cow. t:en. t-460 conx. tren .t-461 comx.czen. t-462 ednt. tren. t-4 75 ednt.tren. t-476 edmt.tren.t-477 edmt. tren .t-4 78 nrby.tren.t-487 nrSy. tzen.t-490 edmt.queb.t-538 ptw-mtrl. t-549 ptw.torc.t-558 pt'.. kgtn. t-565 e&t. lgtn. t-587 edmt.kgtn.:-589 edmt-kg:n.t-530 t0ro.Lgtn.t-629 tren.nr9y.t-465 5ago.nrby.t-496 queb .pV&. t-524 queb-edmt-t-531 queb. ednt .=-5 32 4ueb.edmt.t-533 Ft'&.tOr~.r-556 kgta-edmt. t-592 kgrn. toro. t-634 ptw.queb.c-530 queb.kgtn.t-540 ptw.ntr1.t-540 ptw.kgtn.t-563 mtr1.gage.t-457 .. .. . kqcn brdn .ora. t-4 brdn.hlfx.5-6 brdn.hlfx. t-7 btdn.queb.t-il brdn.shwr.t-15 b:dn.shwr. :-i6 brdn.gmd.t-21 brdn .grm. t-22 bn3n.gage.t-28 brdn-gage.t-29 brdn.9age.t-30 brdn.mtr1.t-33 brdn .mtrl. t-34 brde. kgtn. t-36 brdn.kgtn.t-37 brdn.kqtn.t-38 brdn. t ren. r-4 2 h1fx.otn.t-43 h1fx.otwa.t-44 h1fx.brdn.t-51 hlfx.S:dn.:-53 hlfx.brdn.:-54 queb .oca. c-56 queb. Srdn. :-6 ? qceb. bzdn . r-ri q~eb.atr:. 5-64 Annex A

shwr.brdn.t-70 sh.dr.otïa. t-7: shw:.otn. t-72 gage-bzdn.t-78 gage.otwa. t-79 tren-brdn.t-97 crt3n.brdn.t-90 txen.otwa. t-92 trea .ahsa. t-9 3 cren.0tsm.t-44 kgtn-brdn. t-95 kgt~.brdn. t-35 kgtn. brda. t-97 Lgtn-brdn-t-48 kgrn.o~+a.t-9; kqtn-ama.t-IGO kqtn.otsra.t-l01 kqtn.oPa. t-102 Zgtz.ntr1.t-:O3 kqrn .mtrl. :-LOI kgtn.mtr1.t-105 kgtn.mtr1.t-:96 gr~~i.owa.t-1L3 mtrl-btdn-t-116 mtr1.brdn.t-117 nrr1.brdn.t-1:E rntr1.otva.t-119 mtr1.kgtn.t-123 ntr1.queb.t-12E otn. brdn. t-132 ot-a.brdn.=-133 oc-a.brdn. t-134 0t.a .hlfx. t-136 ~t.&.klfx. t-137 otwa .queb. t-140 atwa .shws~r.:-?46 otisa.gnTi.t-149 0tba.qage.t-153 cm.lgtn. t-156 ocwa.kgtn.t-iS7 ct.*ra. kqtn. t-i 58 oc~.mrrl.~-159 otT& .su?.r-151 ctba. trea. '-155 3?&. tzen.t-t66 szjn-otza.:-LES stSa.brdn.r-188 stjc-brdn.t-Lf9 bago-brdn.t-294 roro. brdn. r-204 tcro.Srdn. :-205 toro.ot..a. :-Zog +or0 .otua.r-2 IO owa.stjn.z-229 brdn.stjn.:-232 bzdn .tara.:-250 ot'ria.coro. t-253 atm. taro. t-254 otva. ptsni. c-357 atua. nrïy. c-326 comx.mtr? .:-349 cam~.ntrl.s-401 mtrl .comx.z-403 ncrl .corn. t-405 t:en.ca.nx. :-464 rzen.com. '-465 tren.comx.t-466 tzen. edm: .t-4 7 9 tren.edmt.t-4e0 tren.edmt.t-4@1 tzen.edmt.t-482 cren.nrby.t-483 tcen.n:by. t-486 queb.pt'&. t-526 queb.edmt.:-534 edmt.queb.~-538 queb.kgtn.t-541 web. kgtn. t-5 39 ~~eb.kgtn.:-542 kgrn.queb.:-543 kgtn.queD.:-545 kgtn-queb.t-546 kg:n.queb.t-544 ptw.mtr1.t-549 ptw.mtrî. t-549 pew.mtr1.t-550 mtrl .pc~.t-552 mtrl,ptw.t-553 mtr1.ptw.t-554 t0ro.ptw.t-562 pt'a. kgtn. t-564 ptw.kgtn.t-565 ptw.kgtn.t-566 kgtn.ptsrw. t-567 kqtn.ptw. t-568 kgtn.pr&. t-563 kgtn.ptw. t-570 edmt. kgtx. t-597 edmt.kgtn.t-599 edmc.kgtn. t-590 kgtn.edmt. t-541 kgrn.eclmt. t-542 kgta-ednt. t-543 kgtn.edmt.t-534 tsr0.kgtn.c-627 tor0.kgtn.t-625 Pgtn. toro. c-631 kgtn. tara. t-of2 kgtn.raro.t-633 kgtn. taro. t-634 pt'dw-queb. t-530 + bzdn.hlfx.r-5 brdn.hlfx. t-a brdn.hlfx.:-7 bZdn.queb.:-9 brdn-queb-t-10 brdn-queb-t-Il brdn.queb.c-22 brdn.3hwr.t-13 brdn. a!wr. :-? 5 b=dn.ahw.t-L6 brdn.3kwr.t-17 brdn.3h~r.t-19 brbn.grwd.=-13 brdn.g~cnl.~-2C urdn.gr&. r-t f Stdn-gage. r-25 nrdn.gage.t-26 krdn.gage.r-29 Ordn.qage.t-10 blfx.oxwa. t-45 hlfx.0ts~a. t-46 hLfx.ora.r-47 blf%.otwa.=-4E hl tx. brdn. c-4 3 hlfx-brdn. t-50 hlfx.brdn. t-52 hlfx.brdn. =-54 queS.atm. t-55 queb.ocwa. t-56 queh-ocua.t-57 queb.otwa.c-5G queb. brdn. =-59 queb.brdn.t-60 queb.brdn. t-61 queb.brdn.t-62 queb.mtrl.t-63 queb .mtrl .c-64 queb.mtr1.t-56 shwc.brdn.t-6? shwr .brdn.=-6B shwr .brdn. t -6 5 5hwr.otwa.t-7 1 5h~r.~t~.t-73 shur.otwa.t-74 gage. b:dn .t -7 5 gage. brdn. t-76 gage. b:dn .:--7 çago.o:wa. t-3Q çage.orwa.:-32 THE AUTHOR IS AWARE THAT Page A-8 is not available and the thesis is filrned as is baqo-nrhy. t-4 45 Dago. nrby. t-4 96 baqo-nrby. t-4 48 shwr .g-M. t-502 g,~-rl. shwr. t-506 gage .queb. t-508 gage .queb. t-509 gage .queb. t-510 queb.qa9e.t-512 gage-h1fx.t-5le h1fx.gage.t-522 queb .ptw. t-523 queb .pt'rlw. :-524 queb .ptw. :-525 queb.ptqw. t-526 ptw.queb. t-524 ptw.queb.t-530 queb-edmt. t-531 queb-edmt-t-532 queb-edmt. t-533 queb.ednt.r-534 edmt .queb .:-538 queb-kgtn-t-539 queb. kgtn. c-540 queb-kgtn. t-541 kg5n.queb.t-543 kgtn.queb.t-546

+ queS. gage gage .que& gage .a:rl gaqe. qrad gage. hl-x gage. shwr brdn.hlfx.t-7 brdn. hlfx. t-8 bzdn. thwr .t-14 brdn-shwr. t-16 bzdn. shwr .t-17 brdn.sbdr. t-12 Srdn. gr&. :-19 brdn.grud. t-20 brdn. grdû. :-2 1 brdn.g,"Jd.c-22 Srdn. grdd. t-2 3 brdn-grdû. t-24 brdn. gage. t-2 6 brda .gage. t-2 7 krdn. gaqe. t-2 9 brdu.gage.:-30 kLfx.ot'a.t-44 hlfX.ot'~.t-46 h1fx.otwi.t-47 hlfx.ot.~a.t-4E hlfx.Srdn.:-50 hlfx. brdn. :-52 h1fx.b:dn.t-54 queb .rnt:i. :-6 5 3k.4: .brd~.t-57 shwz. brdn. r-Ç 5 shw=.otwa.t-7? ab+rr.ot'&. c-73 gage-brdn .t-75 ga9e.brdn.z-76 gage. brdn .c-7 7 gage.brdn.t-7; gage-orsra.c-74 gage-otva.:-BO gage.ocwa.t-BI gage-otwa . t-62 gage-mtrl. t-63 gage.mfr1.:-84 gage-mtrl.c-85 gage.mtr1. t-86 gmd. brdn, t-ID7 gr4.Ordn.t-Le8 grwd.brdn. t-109 gm.brdn. t-110 grud.ot'Ja. t-211 grad.otira. t-112 grud-otwa.t-113 Q~d.OtM.t-Li4 atwa.hlfx. t-f 35 ctsra.b?:x. t-'37 ott+ra.yhx.t-:43 3Wa.3hur. :-:4c otwa.gwd.=-147 o:wa.gr~.c-148 =rm.g-'Lid. t-L45 otwa.g~.t-150 ot-&.gage. t-151 stjh.hrdn. t-168 stjh.brUn.t-169 ~tjh-0cia.t-171 bago.mrc1.c-202 brdn,s:jh.t-2:2 brde-8tjh.t-Zr3 Otva.stjh.t-215 atrl .hago. c-246 esqt,hlCx.t-375 esqt.hlfx.t-376 hlfx.e5qt.t-379 hlfx-e5qt.t-300 mtri-gage. t-456 mrrL.gage. t-4 57 shïr.g-M. t-500 3k4r.pr.dd.Z-501 shwr .gr.ici. t-502 g-4.skwr.t-504 gBrd.s9wr.t-505 grwd.8hWr.t-506 queb-gaçe-t-511 web .gage. r-5 12 queb .gage. t-5 13 queb .gage. c-5 24 gage-hlfx. t-51s gage.hlfx.:-516 gage-tilfx. :-SI7 gage.hlfx. c-518 queb.kgtn.t-542 9age.queb.t-507 Pqtn.queb.r-546

C brdn.ahïr .:-L? b=dn.shwr.c-15 hlfx .acua. r-4 4 hlfx-ctzia.t-46 hlfx.0tM. t-47 h1fx.ocua. r-s o klfx.kr3e.c-52 hlfx-brdn.t-52 hlfx-btdn.t-54 3hwr.brdn. t-67 2hwr.brdn. '-58 shur .b:dn .t-6 4 shur-brdn.r-70 shur .oc-&. t-7 1 ~Ydz.ar.m. t-72 sh..rr.ocsJa.:-73 shur.atwa. c-74 gage-acrl. t-56 grdd-brdn-t-107 grud-brdn.t-L0e g~wci.brdn.c-109 grd. brdn.:-Li0 gt~d.~txa.:-L11 gr&.ctM, t-212 grdd.acUa.t-i13 g-cud.0cira.E-ll4 ctua.shwr. t-144 0tsra.xhUr.L-i45 otwa.swr. t-146 ~tjh.b:dn.t-160 3t:h.brdn.r-269 stjh-atm.t-171 h1fx.esqt.t-379 h1fx.esqt.t-je0 atrl .gage. t-456 shwr.grud.t-499 shvr.grud. t-500 shwr .gBrd. t-501 ~hwr-grwd.t-502 grdd.8hWr. t-503 grwù.3hwr.:-504 qr-d.z!?dr.:-5C5 gr;rd.shur. r-535 Anoex A

gage-hlfx. t-516 gage.hlfx.t-517 h1fx.gage.t-519 hlfx-gage. t-520 hlfx-gage, t-52:

+ hlfx-atrl hlfx-g-zwd mtrl .stria tren-cm brdn. tara tcro. tren b:dn .otua. t-2 1 Srdn.otva. t-3 1 brdn-at~.t-4 L 1 brdn.grwd.t-20 *1 brdn-grvd. t-22 ,A brdn-g-d. r-24 brdn.mtr1.t-34 5zdn.kgtn.t-36 9rdn.kqtn.t-37 brdn .tren .t-40 hlfx.oWa.t-43 hlfx.otwa. t-55 hlfx.otwa. t-47 hifx-bcdn. t-49 hifx-brdc. t-51 hlfx .brdn .c-53 queb.atsm. c-Se qteb.mtr1.t-66 5hwr. brdn. t-6a shwr .brdn. t-70 &wr.otwa. t-72 shwr .atm. t-74 gage .otwa. t-61 gage.ntrl .:-ES gage.rntr1.t-a6 tren.brdn. r-89 tren.oPda. t-91 tren.otwa. t-44 kgtn.0twa.t-101 grwd.brdn. t-109 ztrl.o:wa. r-121 ntrl. kgta. r-125 mtzl.queb.f-130 ctkm.grwd. :-148 5tjh.brdn.t-157 ~tjh.otira.c-L72 st)h.cttwa. t-174 g$hy.ct'i~a.t-i75 gsey*ot-a.=-177 gs~y.ot'&. '-17@ gshy.brdn.:-179 gsby.Srdn. t-190 stjn.ot'a.:-114 baga .otwa. '-196 bagO.ct-a. '-197 bago.otim. c-1% toro.Szdn. =-2G4 torc.S:dn.c-205 coro-Srdn.t-206 torc.otsJa. z-20e t0:O.ot'a.t-209 tOtO.Ot'4a. t-210 brdn.3tjn.t-233 Drdn .bago. :-23a mtrl .bago.r-245 Sr dn. tom. :-24 7 ottJa.tom. t-251 nrby.0tua.t-522 h1fx.esqt.z-3El hlfx.e~qr.+-352 atzl.corn.:-404 mtr1.com.t-406 mtrl .gage. t-457 camx.tren.:-459 tren-nrby-t-4E4 tren-nrby.t-465 5ago.nrSy.t-497 baga.crby. '-4 98 shwr.grud.t-439 3hw.t .grrid.t-500 s!wr .q,rwd. t-502 gr;jd.shxr. :-SC6 qu?b.gaqe.t-513 hlfx.gaqe.:-52: Annex A

hlfx.qage.:-522 queb .?W. t-525 kgtn.queb.c-545 ptw-mtri-t-550 ntr1.pckw.t-551

otm.mtr1 cTda. tren tren. taro toro.brdn rncrl.scjn stjn.mt=l

t:en.Srdn.=-!?4 kgtn.brdn.t-96 kgcn. brdn. t-37 otwa.brdn.c-132 ocwa-brdn.t-133 atwa-brdn.t-134 otwa.queb. t-142 otsm.qage. r-154 otwa.kgtn.c-156 otua.ntrl. t-161 otwa.t:ec.=-163 ocua.tren. t-166 stjn.otwa.c-184 stjn.o:wa.c-185 stjn.otwa. t-186 ztjn.bzdn.~-197 stjn.brdn.c-188 s5fn.Srdn.t-159 baqo.Srdn.t-i94 bago.ot;Ja.t-137 bagc.ntr1.c-201 tor0.brdn.t-203 =oro.otwa.t-207 ot'&.3tjh.c-2?6 otwa.st?h.~-218 atsm.g3ky.t-2?4 ot;m .qiby.~-221 otwa .g~by.'-222 brdc .qsby.c-223 cwa.3tjn.t-228 atm.stjn-r-229 ct.a.stf 3.c-230 brde .z:jn. t-231 8rdn.scjn.c-252 oti.~a.naqo.r-240 ctwa.bagc.r-221 CC- .bago.~-242 brdn.tor0.t-248 brdn.Cer0.r-249 brdn.toro.t-250 otwa.toro.r-252 acwa. tcr0.z-253 atwa. t0ro.r-254 ctwa.ptvdd.+-357 ocwa.ptww. C-!56 e3qt.hlfx.c-377 esqt.h?fx.t-378 comx.mtr1.t-400 comx.mtr1. c-402 tren.com. t-463 nrby.trec.t-408 nrby.tren.r-489 n:by.bago.:-493 nrby.bag0.t-494 gage-queb-t-509 ptw-queb.Z-529 queb.kgtn.:-541 ptw.nCr1 .C-547 scrl .Pt=.=-554 pv*w.:oro.t-557 pw.:9rr.:-55@ tcro.ptsl~.t-555 tsro.ptw.t-560 pw.kgtn. t-564 kgtn.ptw.t-570 coro. kgtn. t-623 tor3.kgtn.t-630 kqtn.tot0.t-631 kqtn. tora. t-632 + stjh-brdn. t-170 stjh.otwa.t-173 SC jh-atm.t-If 4 gsby.otwa.t-If6 qsby.ot~a.t-:?? g5by.orira.t-178 g3by.brdn-t-181 gsby.brdn.t-152 bag0.brdn.t-191 bago.bzdra.r-192 bago.brdn.t-153 Dage.brdn.t-194 kago.owa. t-195 bago.0tua.t-196 bagc. otwa. t-197 bagc.otTa.t-138 baqo.mtr1.t-149 bag0.mtri.t-200 baqo.rntr1.t-201 bago.mtr1.t-202 brdn-Stjh. t-214 otwa.3tjh.t-217 otwa.stfh.=-218 otwa.gsby. '-220 otwa. gjby. t-221 ot'da. gsby. t-222 brdn.gsby.t-225 brda.gsby.t-226 brda.baqa.t-235 brdn. baga. :-2 36 brdn. bago. :-2 37 brdn.bag0.t-238 ora.bago.t-235 ot-da.bago. r-240 or-a. 8ago. :-2 4 i owa. bago-t-242 rntz1.bago.t-243 mtrL.bag0.t-244 rntrl.Sago.:-245 atr1.baqo.t-246 cd1l.bago.t-271 cd1k.bdgo.t-272 cd1k.bago.t-273 cdlk.jagc.z-274 bago.cdlk.+-275 baço-cdlk-:-276 baga .cdik. t-277 bago.cd1k.t-278 nrby.bag0.t-431 nrby. baqc .t-4 92 nrby. baga. :-4 53 nrby .bago.t-4 94 bago-nrby. t-4 55 baq0.nrby.t-436 bago.nrby. t-497 bago. ntby. t-4 90 gage-queb-t-510 queb.gage.t-514 + gssy.s=;h ~tjh-gskystfh-hlfx hlfx.stjS gzby.hLfx hlf%.gsby stjh.brdn. t-167 1 st:h.brdn. t-266 1 stjh .Srdn. t-169 1 3tjh.brdn.z-170 stjh.otua.t-173 s:jh.ot~.t-174 stfh.0tn.t-17: stjh.ot'a.t-L72 g3by.otva.r-1'5 çsby.brdc.r-Y= qsby.btdz.:-~SC Annex A

brdn-stjh-t-2li btdn-scjh. t-Z12 brdn.stjh.t-213 brdn-stjh-f-214 owa.stjh.s-215 me.stjh - t-2 16 0tsra.stjh.t-217 oe'&.stjh. t-218 otwa-g~by.t-219 brdn.gaby.t-223 brdn-g3by.t-224 + stjn.ot*&. t-i33 stjn-brdc-t-i34 stjn-bzdn-t-130 bago-ow.=-:57 otwa.stjn. t-227 brdn.stjn.t-233 brdn-stjn. t-234 otwa.bago. t-24: cd1k.brdn.c-255 cd1k.brdn.t-256 cd1k.atwa. t-263 cdlk-O=. t-254 cd1k.bago.t-27L cd1k.bago.t-272 cd1k.bago.t-273 cd1k.brdn.t-257 cd1k.brdn.t-258 cdlk.oVa. t-255 cdlk.ot'ra. t-266 cd1k.bago.t-274 brdn.wwr.t-301 brdc.mwr. t-302 otwa.wnwt. t-310 bzdn.cd1k.t-261 brdn.cd1k.c-252 atsta.cd1k.t-264 otwa-cdlk.:-270 Dago.cd1k.t-278 .z.rr. brdn .t-2 97 smwr. brdn. t-248 wnwr.otua.+-306 wnwr. brdn .t-2 55 -a.-&.brdn .'-2 96 mu:.otn. =-303 wnwr .atm. t-304 mur.otua. t-305 cam.cdlk .t-409 c0mx.cd1k.t-410 cdlk.comx. :-dl2 cdlk.comx .C-4 14 edrnt.brdn.:-415 edmt.olsra.:-426 sZfd.0tsra.t-442 cd1k.nrby.t-467 cd1k.crby.t-468 cd1k.nrby.t-470 nrby.cd1k.t-472 nrby.cd1k.c-474 edmt.t:en.t-476 edit.wnwr. :-SB0 wnur.ednt .t-5a4 w.rr .edmt .c-595 wnwr.edmt .t-596 eant.shi1.t-597 edmc.shf l.t-598 shil.edmt .t-602 srnur.sIfd.:-607 sffd.shi1.t-614 smsrr.shi1.t-613

shi? .mwr shi1.-m.pg 3hi1. bzdn wnpg.shi? 'm~g.nrbysmpg. brdn 1 1 1 Annex A

ot'ja:adr. t-307 I otua.uriwr. t-306 L otsia .mwr .=-305 1 cdli.hrdn. t-258 cdlk-O~M.t-265 ahi1.brdn.t-280 shi1.brdn.t-281 shi1.Srdn.t-282 rhil.otwa. t-2@8 shil.at'&,t-289 shi1.ocza.t-250 sniwr .brdn, t-2 46 onwr-otsm. t-304 ïnwr.ot*.a. :-305 cd1k.Srdn.r-257 cdLk.otwa.:-266 cdlk.Sago.t-274 shF:.b:dn. t-279 shil .O-. t-297 -c.wr.krdn. t-2 55 -,mur .ct-xa. t-3C3 krdn.shi1.t-2E4 Srd~-Shil.t-255 Srdn.shi1.t-286 otim.ahi1. t-252 otwa.shi1.t-233 otsra.shiL. t-234 brdn.nrby.t-317 hn~q-brd.?.t-326 wnpq.brdn.t-329 wnpg.brdn.t-330 wnpg.otwa. t-336 ;mpg.ctwa.t-337 Wn~g.0tWa.td339 nrby-brdn-t-313 wnpq.Srdn. t-327 ;mpg.o:-a. t-335 e3qt.brdn.t-?6C esq:.brdn.:-362 esqt.otsra. t-36e esqt-atm. t-369 esqt.hLfx.z-376 esqt.h?fx.t-379 comn.brdn. t-384 corx.brdn. t-365 cenric.brdn.:-3E6 comx.ocua. c-392 comx.0tsm.t-293 c3mX.otwa.:-354 ccmx.mtrl. t-400 conuc.ntr1 .t-401 edatt-brdn. t-415 edmt. brdn. t-416 edmt.Szdn. t-417 edmt .lrdn.:-447 edmt.atwa.:-424 edmt .otwa. t-425 edmt.otwa. t-449 ~f fd .brdn. t-4 32 zffd.b:dn.:-433 sffd.brdn. t-434 3ftd.brdn. t-45: 3ffd.ot~a.t-440 sfZd.0m.t-441 sffd.otwa.t-453 ezqt.brdn.:-359 esqt. brdn.:-361 e3qt.otwa.t-367 esqt.0twa.t-370 esqt.blfx.c-375 esqt.hlLx.t-377 com.brdn.t-3E3 comx.otwa.t-391 comx.mtr1.r-399 comx.ntr1.t-402 e*c .Srdn. t-4 18 brdn.edmc.t-419 1 edrnr.atwa. t-423 sffd.Srdn. Z-431 sffd.~,~.r-433 k:dr.ecqt.=-354 Anner A

otsn-esqt.t-372 atwa.esqt.t-?73 hlfx.esqt. t-3oO brdc,colex. :-Je6 otwa.ccmx.r-356 mtr~.comx.:-~04 brdn.edmt.:-421 0tba.edmt. t-428 brdn.sffd.:-436 brdn.3ffd.c-438 atwa-sfti-t-444 otwa.sffd.t-445 cou. cdlk .E-4 10 comx. tren. t-459 c=mx. tren. :-450 CO=. tren. t-461 comx .:sen. '-462 tren.camx. t-465 cdlk-nrby. '-456 cd1k.nrSy.t-465 cdlk-nrby. t-470 nrby.cd1k.:-472 nrby.cd1k.t-474 edrit. tren. t-475 edmt .treo. t-476 ed3t.tren.t-459 edmt. tren. t-475 tren .edmt .:-490 edmt.queb.:-535 edmt .queb. t-536 edmt.queb.=-537 edmt .queb. c-538 edmt .unw:. t-581 edmt.wnur.t-SE2 edmt .kgtn. t-587 edmt. kgtn.:-559 edmt.kgtn.=-549 edrrit. kgtn. '-540 edrnt.shi1.z-546 3hil.ednic.t-500 shil.edat.t-5ûr shil .ednt.:-602 sffd.wnur.:-603 sffd.shi1.z-612 sff3.s!?il.:-cIl shil .sffd.=-516 ~hi1.sffd.C-617 sh:l.sffd.C-516 smwr.shil.:-620 mur.shil, t-522 shil .imwr. t-62 3 SI? L l :.mwr. :-024 shil .ïnwr. -426

+ arby-cdlic nzky.nzds nrby.p+-i-d pb-d.n:ky p-srd.=ri*> ~Td4.Erdn bzdn-cdlk. :-259 brdn.cd1k.t-260 L 1 otwa .cd1 k .:-2 67 L 1 otsm.cd1k. t-258 5 bago.cd1k.t-275 1 1 bdgo.cdlk.:-276 1 Odgo.cd1k.t-277 1 brdn.unwr.:-3Ci 1 1 nrdn,wnur .:-302 5 otwa.wnwr. t-310 1 1 cd1k.brdn.t-255 cdlk.otwa.:-264 cd1k.bago.c-273 3hil.hrdn.t-281 shil .otwa. t-289 ;mwr. bzdn. t-2 48 3rby.brdn.t-311 nrby .otTa.t-321 nrhy-0twa.t-322 WllFQ.btdn. t-328 wnpg.otxa. t-336 ptw. brdn .:-346 cdlk.Srdn. t-256 cdlk.ot~a.t-263 cdlL.b3q3.:-2': ~dlk.bdqC.'-2?2 Anoex A

shil .brdn.c-252 shil -ot.m.=-290 wnwr .brdn. t-2 97 àn~r.otua. t-305 un.& .ocw. t-306 nrby .brdn. t-312 nrby-Srdn-t-314 nrby.atwa. t-319 nrby-otwa. t-320 uripg-brdn. t-329 wnpg-brdn-t-330 'mpq.0tWa.t-337 ;mpg.otsra.t-338 brda-pm.t-350 brdn.shi1.c-286 3t.Wa.shil. t-294 C~.&.U~WK. :-309 brdn-nrby-t-316 brdn.czby.t-318 ctwa .nrby. t-323 0tua.arby.c-324 brdn.wn~g.=-3 33 Ordn .*.mpg. t-3 34 0tWa:fipg. t-341 otua-unpq.t-342 ptw.brdn.t-344 ptw-brdn.:-345 pbw-otua.t-351 ptw-brdn.t-343 p+w.otwa.t-352 ptw-O-. t-353 ptw.otua. t-354 esqt .atwa. t-369 edmt.otim. t-426 ~ffd.ot-.t-441 ~ffd.0W.t-442 otsJa.esqt.t-373 ot;ra.edmc. t-4 30 sf fd .brdn. t-4 34 oPda.sffd.=-445 oc7&l.3ff3.:-445 ~rby.cd1k.c-471 3fby.cdlk.t-474 Pren.nrhy.t-4E4 tzen.nrDy.r-456 nzby.tren.t-497 nrby.tren.c-458 n:Sy.tren.:-4e9 nrby. tren. t-4 50 nrby.bdgo.t-491 nrby .baga.t-4 52 nrby.bago.:-493 nrby .baga. t-4 94 bagc.nrly. c-4 95 bagc .nrby. t-497 bag0.nrby.t-49e ptsrd.pueh. t-527 pr;Jw.queb.t-529 ptinr.queb.t-529 pt'&.queb. t-530 ptw.mtrl.t-547 ptw.mt:l. t-549 ptw.rntr1.t-549 ptv&.rntrl. t-550 pt7&.toro.t-555 ptwd.torc.t-556 ptw. taro. t-557 ptw.tcr0.t-558 ptw.kgtn.t-563 prw.kgtn.t-564 p~d.kgtn. t-565 ptiiu. kgtn. t-566

+ otira.ptw brdn. ptww nrdz. nrby brdn.Wnpg brdn-$hi1 nrby-xnpp 0t~a.cd1k.t-267 1 bago.cd1k.t-275 1 o=wa.shil .t-294 1 1 otka .mur. t-309 1 1 otwa.;rnur.t-3la i brdn.rrSy.+-!:8 1 ot;ra.nrby.:-!23 brdn-wnpg. t-334 1 otba .smpg. t-342 I. SK~R.~CW.t-348 y brdn-pm. t-345 1 0tWa.pt.riw. c-355 1 brdn.cei1k.f-260 bag0.cdlk.t-276 brdn.3hil.t-280 brdn .mur. t-301 brdn.nrby.C-316 oPa.arby. t-324 brdn:-mpg. t-3 33 0twa.mpg. t-341 brdn.ptzw. t-347 otwa.pV&. t-356 3tWa. pt'.iIw. c-357 ot'&.pV&. t-35.5 brdn.cd1k.t-259 ~tWa.cdlk.:-256 uago.cd1k.t-277 b~dn.~hil.=-2G5 otwa.shiL.f-253 brdn :mdr. t-302 brdn-nrby-t-315 0twa.nrSy.t-325 otwa-nzby.t-326 Srdn .Xnpg. t-3 32 cP*a.wnpg. t-340 brdn.cd1k.t-252 atm.cdlk. t-269 brdn.~hFL.t-264 otim. shil. t-292 Srdn.mwr. t-300 otua.**mvr. t-306 brdn.nrby.t-317 brdn:mpg.t-331 otsra.-..rnpg.:-339 b~dn.cd1k.l-251 oC';i.cdik.Z-i70 bag0.cdlk.t-2'5 br3n.shti.t-213 oCwa.shi1. t-25L brdn :mwr. t-2 49 otsra .irr.wr. t-207 nrby.brdn.r-31: Srdn .esqt. t-363 bran.esqt.t-255 atm.esqt.=-171 utwa .esqc. c-374 h1fx.esqt.t-379 hlfx .esqt. t-351 brdn .corn. t-367 otwa.comx.~-335 mtrl.com.:-CO3 ntrl.c3mx.t-4C5 Srdn .edmt. C-122 otïa.edmt.t-~27 Scdn.3ffd.c-435 oV&,sffd.t-443 bfdn.e3qt.;-j54 brdc.e3qt.t-366 hlfx.esqt.+-360 h1fx.esqt.t-3e2 brdn.ccax.t-398 brdfl.cOmt.t-3E9 8rdn.comx.t-390 otwa .comx.t-396 3twa.ccmx.t-397 ot;ra.com.t-358 mtrl .c~mx.t-404 mtr1.comx.t-405 brdn.edmt.r-419 brdn .edmt .t-420 brdn.ed?ic.r-421 brdn .edmt .t-4 4 i2 otwa .edat. t-125 ctsm.ednr.t-429 otwa .edmt. t-450 brdn.sffd. t-436 brdn.3ffd.t-457 Sron.sffd.l-452 Annex A

atwa.~ffd.t-444 0t'da.~ffd.t-454 orsra-esqt.t-373 0tw.edmt.t-430 ~t'da-Sffd.t-445 otw-sffd. t-446 brdn.9ffd.t-438 tren .corn. t-463 tren .comx. t-464 tren-comx. t-465 tren .corn%. t-4 66 cd1k.nrby.t-470 nrhy.cd1k.t-472 nrby.cd1k.t-473 %bf.cdlk. t-4 74 :zen .edat. t-4 59 tren .edmt .;-4 El tren-ednt. :-452 r:en.n:hy.t-4â3 tren-nrby-t-484 tzen.ntby-t-455 tzen. nzky. t-4 e6 bago.crby. i-495 bago. nzby. t-4 56 bago .nrby. c-4 97 bago-nrby. t-4 98 quêb.pW~.t-523 queb-ptw.t-524 queb.ptw. t-525 queb.pC&. t-526 queb.ednt.t-531 queb .edmt. t-5 32 quet.edmt.t-533 çueb.ed3lc.t-534 mtrl .pC&r. t-55: atrl.pt;lM. t-552 nt,,.. c 1 -pt--W. t-553 mtr? .pr&. t-554 toro.pt-a.:-559 t0r~.p?&.t-560 tor9.ptsw. t-55: to:o.pt~. t-562 kqtn.pr&. t-567 kgt~.ptsrw.t-568 kqrn.pr&. t-563 kgtn.pcs~.t-570 kgtn.edmt.t-59: kgtn.ebt. t-552 kgtn.ed!t.r-553 kgtn.edmc. t-534

+ esqE.brdn.t-253 esgc .bzdn. :-360 esqt .brdn. t-262 esqc.a+sra.t-307 esqt.aCe.t-i68 esqt-otwa.t-369 esqt.otwa. t-370 esqt.hlfx.t-375 esqc.hlfx.:-376 esqt.hlEx.:-377 esqt.hLEx.t-378 e3qt.Srdn.=-?él corn .5rdn. t-393 corn%.brdn .t-384 cow.Srdn. t-386 car~~.ütsra.t-331 =omx.otwa.t-392 cornx.0twa.t-394 camx.mcr1.t-399 conx.mtr1. t-400 coax.mtr1. t-431 comx .mtrl .t-4 02 com.Cdlk. t-409 c0m.cdlk.t-4i0 edar .brdn. t-4 17 edmt.brdn.t-418 ednt .ctua.t-423 edzl .al;ra.Z-424 sffd.kcdz.t-421 Annex A

sf fl-brdn.t-4 32 sffd.brdr..t-434 sffd-ct~a-t-439 sLfd.ocua.t-446 sLfd.ct;ra.t-44L edmt .brdn. t-4 47 edmt.otwa.t-449 sf f3.brdn.t-451 sffd.ora.t-453 cdlk.~0f~~.t-4L3 hrdn.sffd.r-437 brdn.~fZd.t-446 con%. cren. t-459 cm%.tren. t-460 cc=. tren. t-461 corrx .tren .:-4 62 e&t.tren.t-477 edmt. tren. c-4 78 edic.tren.t-479 edmt.queb.t-515 e&r.queb.t-536 e~r.sf~d.~-571 edzt.sffd.t-573 edrt.3frd. t-574 3ffd.edmt.c-576 sf2d.ednt.t-578 eht:dnwr. c-5@1 edmt .wnwr. t-592 edm:.kgtn.t-508 ednt. kgtn-t-589 edat. kqtn. t-590 edmt.shi1.t-595 3f fd-mwr.t-663 af fd.wnwr .t-604 unwr.stfd. t-609 zffd.*nwr.=-6lO slf3.5hii. t-611 sffd.5hil.t-612 shi1.sffd.t-617 shf i.sffd.t-5:8 ;mwr.zhil.t-621 wwr.shi1 .C-622

+ edm: .cd1 k eds.t.uzwr edllt.wn?g ed~t.ccnx sffd.esqr a£f d.ccnx conx.cdik.:-ZC7 cs3.x.cdik.L-404 edm.oc'rta.t-426 3ffd.otsa.t-442 1 conx.cdlk.:-406 eaml.brdn.t-415 ccmx.brdn.c-3E5 CCZ!!.Ot'da.Z-333 edmt .brda. :-4 16 e&nt. ccwa. c-4 25 3ffd.brdc.Z-453 Crdn.conx. t-384 ctua.comK. t-397 dlL.cotrt~. t-411 cd1k.comx.t-4S2 brci~.erqt.=-363 hrdn-esqc-t-354 otxa.esq+. t-372 zr&.esqr. c-372 0r;ia.esqt.t-373 orwa.esqt.r-374 hlLx.esqt.t-379 h1fx.e~qt.c-390 h1fx.esqt.t-381 h1fx.esqt.t-3e2 brdn.esqr.t-365 brda.ccrrx.t-387 brdn.ccmx. '-386 brdn.coz+x.c-390 ct'da.coFx. t-335 cwa.ccm.t-396 ct;ia.ccrx. t-356 zttr1.ccnx.t-403 ntrl.corrx. t-404 m+rl.conx.c-405 x=l.c=mx. l-4C^ cdlk.cott~.Z-4;3 Annex A

tren.conut. t-4 64 tten-conx. t-465 tzen. coax. t-4 66 cd1k.nrby.t-469 n~by.cd1k.t-473 edmt. tren. t-475 ed&. tren. t-476 edmt. queb. t-537 edmc.queb.t-538 edPr.t.sffd.t-572 edmt.affd.t-573 edmt-3ffd.t-574 sff3.edmt.t-577 sffd.ed3it.t-57E edat.wnwr.c-579 ednt.wdr. t-520 eht.mt;z.c-5gz znsr .ednc. t-566 edrJt. kgtn. t-557 edmt .abil. t-5 56 edzit .sbil. t-537 ednt.ahi1.t-558 sffd.unwr. t-604 sffd.wnwz.t-605 sf fd.smw:. t-606 snur.sffd.t-506 ïnwz .sffd. t-610 sffd.shi1.c-513 ~ff3.shil.t-614 k~1wr.shF1.t-620 Shi 1 .wnwr. t-624 ~~~~~~dtwr. t-625 shif .s~nwr.t-626

9:dn.esqt.c-365 ~cm.9rcln.Z-395 c=~A.3cda.=-333 cOm.cdlk. t-407 c=w.cdu.r-40~ hrdn.com. t-389 0Y-a.ccmx. +-3 47 5rdn.ednt.t-420 3t-da.ed7l.t-424 brda.affd.t-437 Urdn.e5qt.r-?66 otsra.esqt.t-374 h?fx.esqt.t-382 bzdn. ccmx. t-3 90 Otsra. cm.t-3 98 ntrl.cornx.t-405 b:dn.edx.=-448 ctxa .eO?r. t-4 50 kr3n.sf fd. t-452 ot;Ja.~ffd. t-454 Cdlk.com. t-4?2 brdn.edmt. t-4 1; Cdlk.C0m.t-411 C~LL.COU.~-~~~ otwa.ednc. t-430 atwa.sfEd.:-445 tren.comx.t-463 tzen.com. t-464 nrby.cdik.t-473 tren-edmt-t-479 tzen .edmc. t-460 tren.edmt .t-492 queb.edmc.t-531 que5.ednt.t-533 queb. edmt .C-5 34 edm+.sffd.t-572 ed3it.sffd.t-574 sffd.edmt.t-576 sffd.ednt.t-577 sffd.et3zt.t-578 wwr.ednt. t-543 unwr .ednt. :-sa4

Annex A

+ brdn .gage brdn .nitr!. brdn. kqtn + brdn. kgtn brdn .tren hlfx.otsra + hlfx-brdn queb.otua queb .brdn

cpeb. brdn queb .mtrl rrhwr .Srdn shur .c twa + 3hw:. oc;m gage. brdn gage. otira gage .mtrl

+ gage.mtrl tren .nrdn tren .opda kgtn-trdn + kg:n .b,rdn kqtn .CM jcgrn-ncrl

+ nt rl. queb otxa .bzdn cwa.hifx

t atw-hlfx atm.queb oca.shur + otn.gr& atm.gaçe utsra. kgtn + ot'da. kgtn ctwa .mtrl atvda.tren + 3tjh.brdn 3tjh.otwa gsby .?t'da + t-177 t-178 t-179 t-ieo gsoy .OtVda 1 1 gsby. brdn 11 stjn.ctsm st:r..brdn baqo .Srdn baga. o twa + baga bago.ntrl toro .brdn + toro.otva brdn-stjh atwa .5': jh

+ bfdn.5ago am.ùago mtzi .Sago

Szdn. toro O-. taro cd?k .Srci!! + cdlZ.brdn

cagc,cdlk 3hil.'srda Srdn .shil

ntSy .brdn krdn.arky

0 bzdc .?.:by nrby .o?a czwa. zzby

4. mpg .brdn hrdn .ur.pg mpq. at'a w ln w' bt 1

Ul ai V b1I

O III O UI m m 'S ciI

Na1 9. 1 ci

r( m d II1

m t- Y LJI m r- v

a-coXY C: LI a rr CUU a.. .u S. u -1 fi si a LIU +Ud01 Annex A

queb .gage gage-hlfx * gage.hL,Cx hlfx-gage queb .prinr + ptw.queb queb .edmt ednt .queb + edmt .queb queS. kgtn kgtn.queb + pw-atrl mtrl .pt-iw pr*.Jv. cora

0 pt-.M. tora taro-priw pt'a. kgtn + kgtn-prxw e&t.sffd sf f d .ednt

t sffd.ednt edm t :mwr 'dzwr. e&nt

C edmt .kqtx icqtri .e&!c ednt-shil edn': .ski: ski1.e*t sf f3.;mr: - ;m~:. ~Efd sf fd.snit shil.sffd

+ shil.sffd ;m*dr.ski1 ah f l.wr.ur

+ roto. Lgtn kg tn .=sr0

variabLes b(i,ip,s; invesmenr cf type c f:on i cc ip x;i, ip,:) traffic c (i, ip1 capacity CCS: total invetsiten: ccsc ; positive variable x ; x.fx[i,i,t; - 0; Sinary variable b ; b.up(i,ip,s] Srti,ipl = 1; positive variaLie c ; equa t 1ons arcbal(i, ipl a:= capaci:y balance gnlyone( i, ip) selct cne technclcgy only capdef (i ,Fp) capacf ty def inition coscdef Cost der iaf licn dela (i,ip) delay =ûzcrain+ and link l~rrlization equal(i, :pl same rapa=::y Zn links Annex A

Lero(i,i,s) force the progcam not to take into consideration links between ncde i and itself traffic(i,ip); total craffic between i and ip bequal (i,ip,~l ; cosrdef.. tost le- sun((:,sl, (f!sl-~(zI~darc!r)1~b(r~s11;

equalti, ip) .. c(i, ip] Sr(i,ip) - c(ip, =1 Sr (i,ipl me- O;

mode1 canada / al1 /; canada .vorkspace - :l; option iterlim-L650000, reslim=?2500UO,cptcr-. 05,apr_ca=500ûO,limrc~0,limccl-0; parameter report i i, ip, '1 ; salve canada using rnip mininiring ccst ; report (r:i, ipl ,'mip0 1 - su((i~p, ~FPP, t1 , x. l ti~p,ippp, tl SCix(ipp, Lppp,t] *routeLi~p,ippp,:, r; ) ; display repo:?, b.L, c. 1; Aaner B

QS Input Data of The Problem THREENODE in ihu pgmnrhc follawing vuiabla ut usai:

(1) +100000L1Sl+1.00000LlS2+I.00000LlS3+1.000mL1S44 US1 +O LX29 L2S39 L2W L3S1-0 L3SZ -0 L3S34 US44 L4SI+O L4SZ+O L4S3 *O LW9 LSS1-0 L5S2+0 LSS3+0 LSS4 +O L6Sl+O L6S2-0 L6S310 L6S4+0 YRll -0 YR7l-O YR22+0 YR82+0 YR3IW YR91 4 YR434-0 YRtDtO YR52-0 YRll+o YR63 +O YR12=~1.00000

(2) +O LlSld LIS24 LlS3+0 LlS4+1.00000L2Sl +1.00000L2S2+1.00000L2S3-c1.0000dUS49 L3SI4 L3S2 +O L3S3W US49 L4sl+O L4S2+0 L4S3 10 L4S4+0 LSS19 LSSFO L5S3+O LSS4 -0 L6Sl+d L6S2+0 L6S3+0 L6S40 YRll 4 YR71+0 =+O YR82+0 YR3I-ü YEU1 *O YR43+0 YRlOcO YM29 YRII+O YR63 +O YR12=+1.00000

C3)+0 LIS19 LlS2W LIS34 LlS4+0 L2St +O LZS2cO US3* L2S+ 1.00rnL3S~~~.00000US2 +1.00000L3S3+1.00000L3S4+0 LPS 1-0 t4S3.0 L4S3 +O L4S4+0 US14 L5S2+0 LSS3-O LSM +O L6S19 US24 L6S3-0 L6S4+0 YRIl I +O YR71-0 YR224 YR824 YR3I-O YR91 +O YR43+0 YRIOtO WU29 YRll+O YR63 +O YR12= +1.00000

(4)-0 LlS1+0 LIS24 LIS34 LlS4-0 LZS! -0 L2S2-0 US3+0 L2S4+0 L3Sl-O L3SZ -0 L3S3-0 L3Sa-1.00000L4S 1-1 OOûOOL4SZ- 1.OOOûûL4S3 *100606L4S4+0 LSS1-0 L5S2+O LSS34 LSS4 +O L6S1-0 L6SZ4 L6S3-0 L6S4+O YRll -0 ïR71+0 YR224 YR82-0 YR31-6 YR91 0 YR4PO YRlo-CO YRS24 YRI1-0 YR63 -0 m12= -1.00000

(6)*0 LlSltO LIS24 LIS34 LIS4+0 L2Sl -0 L2S24 L2S3-0 L2S4+0 L3S140 L3S2 +O L3S39 US44 L4S1+0 L4S2+0 L4S3 +O L4S49 USlcO LSSZ+O LjS3d0 LSM + 1.00000L6SI+1.000OdL6S2*100000L6S3+1.00000L6S49 YRl 1 +O YR71+0 YRU4 YRBtrO YR31- YR91 +O YR43+0 YRlOCd YR5Z-û YRllI) YR63 +O YR12=+1.00000 Annex B

L1S19 LIS2+0 LIS3-0 LlWO L2SI L2S2+0 US34 L2W0 L3S1+0 L3S2 L3S3+0 WS4+0 L4Sl+O L4S2+O L4S3 L4S49 US14 L5S2+0 LSS3+0 L5S4 L6S14 L6S24 L6S3+0 L6S4+0 YRll YR7l+O YR229 YR82.t. t06000YW 1+. lOOOOOYR9l YR43+0 YRlOcO YR524 YRllcO YR63 YR12= +300.000

LlSl+O LlS24 LlS39 LlWO L2SI LZS24 L2S3M L2W L3SI+O L3S2 L3S39 WS4+0 L4S1+0 L4S2+0 L4S3 L4S4t0 L5S1+0 LSS2+0 LSS3+0 L5S4 L6S14 L6S29 L6SM L6S4+O YRI 1 YR71-0 YR229 KR82+0 YE314 YR91 YR43+0 YRIW.100000YRSZ+. lOOOOOYR11+0 YR63 YR12= +lOo.WO

(1519 LISl-Q LlS2+O L1S3-0 LlS4-0 L2Sl +O L2S2+0 L2S3+0 L2S4-1SO.OOOL3S1-300.00OL3S2 a00.WOL3S3-900.06dL3S44 L4SlIO LG24 L4S3 -0 LW9 US14 L5S2+0 LSS3+0 LSS4 +O L6S14 US29 L6S3-0 L6S4+0 YRll +O YR71+0 YR22+ 100000YR82+O YR3 1 100000 YR9 1 +O YR43+0 YRIO+ IOOOOOYIU2+0 YRII+O YR63 +O YRt2=O

(1614 LlSl+O LIS2cO LlS34 LlS4+0 L2Sl +O L2S24 US39 L2WO L3S1b0 L3S2 +o us39 L3S4-150.000L4S1-300.00(3L4S2aclo 000L4S3 -900.000L4SetO LSSl+O L5S2-0 LSS3+0 L5S4 -0 L6S14 L6S24 L6S3+0 L6S4+0 YRI I +1000dOYR71c0 YR22-4 YR8f-0 YR3I-0 YR91 -0 YR43+ 100000YRlr).O YFUkO YRl 1 - 1 OOOOOYR63 +O YR12=0 Inrcgrality and Baunds Var. no. Xamt 1 LISI 2 LIS2 3 LIS3 4 LIS4 5 L2sl 6 L2S2 7 L2s3 8 Lm 9 L3SI 10 L3S2 il L3S3 12 L3S4 13 t4S1 14 L4S2 15 L4S3 16 L4S4 17 LSS1 18 L5S2 19 L5S3 20 L5S4 21 L6S1 22 L6S2 23 US3 24 L6S4 25 Yi3112 26 YR712 27 YR221 28 ïR821 29 YR313 30 YR913 31 YR431 32 YR1031 33 ïR523 I .LLinimzcd OBI = 284 ltcra~on= 23 Elapscd CPU second = 39 55078 : : Bmnch delauon: Ncwa problan [ntcgcr talaance. -01 .Mat mode: 3 : Description of DND's Projects

1.1.1 Description This project provides a secure common-user messageldata network. The network is con- figured in three communication nodes se~ngusers through concentraton. It also provides an interface with allied military networks.

1.1.2 Traffic Analysis An ADDN trafic analysis was done using data obtained from Ottawa and transformed in bits per seconds.

1.2.1 Description This project provides DND with a secure telep hone network capability to suppon operational requirernents. This project is conducted in two phases: the first one was completed in 1990 providing a limited operational capability of 1400 secure telephones. The second phase, which started in 1994, will provide additional secure telephones, interfaces devices to extend the DSTN to tactical secure voice systems and secure conferencing with others.

1.2.2 Traffic Analysis A telephone study was done by Cm Kingston and an approximation of the number of trunks required was done and explained in Chapter 4. The secure and non-secure telephones, plus the fax machines were al1 put together to achieve the trafic study.

1.3.1 Description This project provides Command HQs with video communication capabilities to reduce temporary duty (TD) costs and time lost in travel of those that are able to use the Military Video Network. This network is a collection of existing (10) terminais and planned point- to-point video teleconference links. Annes C

1.3.2 Traffic Analysis A trafic shidy was done using the existing network to find out the usage of the network each day for this type of trafEc. This data was obtained from the network manager in Ottawa.

1.4.1 Description This project provides the capability of classified and non-classified transmission through a fax machine to support Canadia. Forces (CF) operations.

1.4.2 Traffic Analysis The results of this Micstudy were amalgamated with those results from the telephone and DSTN studies.

1.5.1 Description The FMC AWAN provides e-mail and authorized application services to FMC. This network will connect LANs at FMCHQ, Area HQs, Formation HQ and FMC bases. It is also planned to connect the WAN to the NDHQ MAN and to the Department Level Data Cen- tre in Ottawa.

1.5.2 Traffic Analysis The trafic rates for this project were forecasted by the IDN Capacity Management study.

1.6.1 Description The SEN project has been an amalgarnation of two NDHQ Information system projects: NDHQ Decision Support System and Corporate Management Information System. This project will provide executive information and automated decision suppon tools to senior leadership of DND and basesThe data forecasted for the trafk analysis has been corn- pleted.

1.6.2 Trafic Analysis The trafic rates for this project were forecasted by the DNCapacity Management study. Aunes C

1.7.1 Description This project will provide a command and control system to CFCC. CFCC CCIS will implement an integrated system comprised of doctrine, procedures, organizational stnic- ture, personnel, equipment, facilities and communication which wil1 provide CFCC with timely and adequate data to plan, direct, coordinate and control their operations-The data forecasted for the tMc analysis has been completed.

1.7.2 Traffic Analysis The trafEc rates for this project were forecasted by the IDN Capacity Management study.

This project will provide a secured autornated version of the present manual inventory control and management system used to manage DM> COMSEC material supplied by national NATO and international resources.The data forecasted for the trafEc analysis has been completed.

1.8.2 Traffic Analysis

The tmfEc rates for this project were forecasted by the IDN Capacity Management study.

1.9.1 Description This proj ect will develop an electronic key generation and distribution systern containing management, production, distribution and consumption activities.. This system will be similar to what the US militw services are now using.The data forecasted for the trafic anaiysis has been completed.

1.9.2 Traffic Analysis The trafic rates for this project were forecasted by the IDN Capacity Management study 1.10.1 Description This project will provide automated support to different administrative functions for CF bases al1 over Canada. This project will support the following:

a. Base Level Integrated Personnel Support System-Military (BLIPSS-Mil);

b. Base Level Integrated Personnel Support System-Civilian (BLIPSS-Ch);

c. Base Automated Transportabon Operations System (BATOPS);

d. Construction Engineering Management Information System (CEMIS);

e. Workshop Management System (WMS); and

f. Base Pharmacy Information System (B Pham 1s).

1.10.2 Traffic Analysis The traEc rates for this project were forecasted by the IDN Capacity Management study.

1.11.1 Description This project will provide an automated information system for al1 components of the Reserve Force. This system will be composed of five funaional components: pay, personnel, budget, training and logistics. This will enable the system to support the pnmary reserve in their administration and operational requirements in peacetime and for any mobilization activities.The data forecasted for the trafic analysis has been completed.

1.11.2 Traffic Analysis

The t-c rates for this project were forecasted by the IDN Capacity Management study.

trol Svstem (TFMCS)

1.12.1 Description The aim of this project, which has not yet been approved, is to plan CM taskings for personnel, equipment and administrative support. This project will involve al1 army bases Anncx C plus NDHQ, Command HQs and Joint Task HQ.

1.12.2 Traffic Analysis

The trafic analysis was done by taking the estimate from Onvural[35] (p.70).

1.13.1 Description This project will provide a national level military personnel information systern. It will include a redefinition and redesign of the Personnel Management Information System, database and the supporting processes to facilitate the positive control of individual data, allow more timely and accurate updating, provide improved support for mobilization and exercises requirements-The data forecasted for the tdEc analysis has been completed-

1.13.2 Traffic Analysis The traffk rates for this project were forecasted by the IDN Capacity Management study.

1.14.1 Description This projed will provide manpower distribution data in a wartime/mobilization scenario. This wil1 provide NDHQ and Command HQs personnel resource managers information on personnel establishments, strength, shortages, surpluses and casualties. It is concerned with the movement and reporting of types of personnel and not the individual personal information-Thedata forecasted for the trac analysis has been completed.

1.14.2 Traffic Analysis The trafic rates for this project were forecasted by the IDN Capacity Management study.

1.1S.l Description

This project will provide an establishment information on al1 positions within the CF including the Reserve Force-The data forecasted for the trafic analysis has been corn- pleted. Annex C

1.15.2 Traffic Analysis The traffic rates for this project were forecasted by the IDN Capacity Management study.

1.16.1 Description This project will provide and maintain a central record of individual training histoq and qualifications. It will be used as a training database and information system capable of reacting to the fûnctional and operational requirements of Cornrnanders and training rnan- agers. It will also improve methods of collecting, processing and disseminating training information ail over the CF. The data forecasted for the mc analysis has been completed.

1.16.2 Traffic Analysis The tfic rates for this project were forecasted by the IDN Capacity Management study.

1.17.1 Description This project will provide an information system to support the recruiting function. It will handle recruit functions of both Regular and Reserve personnel. It will be on-line to al1 recruiting centres in Canada. The functions that will be provided are career counselling, recruiting quota management and enrolment data (i.e.security and medical procedures). The data forecasted for the trafEc analysis has been completed.

1.17.2 Traffic Analysis The trafic rate for this project was obtained using the same method as the DMHS shidy

1.18.1 Description This system will provide a Civilian Personnel Management Information System. This will give the regionakommand Civilian Personnel Oficer (CPO)a tool to access data on civilian personnel in their ara of responsibility. This will provide assistance to the CPOs in the staffhg process, and will also have an Official Languages sub-system and human resources planning sub-systern. The data forecasted to the trafic analysis has been completed. Annex C

1.18.2 Traffic Analysis The WICrates for this project were forecasted by the IDN Capacity Management study.

19 In terin Reserve PmPersonn-

1.19.1 Description This project provides a network of personal cornputers (PCs), which will connect Reserve unit HQs, for the purpose of getting the personnel information necessary to pay the reserve force.

1.19.2 Traffic Analysis The MICrates for this project were forecasted by the IDN Capacity Management study.

1.20.1 Description This project will provide MIS capabilities to the CF medical treatment facilities to provide them with clinicai management requirements and will establi sh an automated CF medical services management system, a medical regulating system and a nationally automated heaith records management system. This project is an amalgarnation of two other medical IS projects : Canadian Forces Medical SeMces Management Information Sy stem and the Canadian Forces Management Information System.

1.20.2 Trafic Analysis

The trafic rate for this project was obtained through Onvural's estimation [35] (p.72) of medical imaging tfic rate and daim tracrate.

1.21.1 Description This project provides DND a department accounting and financial management system. The system updates al1 units' budgets on bases.

1.2 1.2 Traffic Analysis The trafic rates for this project were forecasted by the IDN Capacity Management study. 1.22.1 Description This system provides distributed data information, update and browse capacity to pay offices. It gives information on pay statements and other related functions to al1 pay offices across Canada and abroad.

1.22.2 Traffic Analysis

The tr&c rates for this project were forecasted by the IDN Capacity Management shidy.

1.23.1 Description This project will redesign the curent CFSS system. It will irnprove the capability to con- d~asupply operations, including first line fundons to units and supply support required at the second and third line supply field organizations.

1.23.2 Traffic Analysis The trafic rate for this project was obtained through the CFSSU office. A trafEc study was done as explained in Chapter 4.

1.24.1 Description This project will provide DND with an integrated system to improve the present manual traffi~csystem. It will allow to plan and control material movements in support of operational contingencies, mobilization and war. It will also provide an effective and efficient material movements capability in peace time. The data forecasted for the trafKc anal ysis has been completed.

1.24.2 Tra ffic Analysis The trafic rates for this project were forecasted by the IDN Capacity Management study. 1.25.1 Description This project is aimed at replacing the old batch system in order to control and evaluate quality assurance and related operations and to respond to current and fuhire information demands and user needs.

1.25.2 Traffic Analysis A trafic snidy was done by DGQA and is explained in detail in Chapter 4.

1.26.1 Description This project will provide DND with an effective equipment/weapon system management structure. It will enable to track spares usage, maintenance houa and cost hierarchically through sub-equipments and assemblies to specific weapon systems.This system will cover from an individual item to a system basis. The data forecasted for the trafic analysis has been completed.

1.26.2 Traffic Analysis The trafic rates for this project were forecasted by the IDN Capacity Management study.

1.27.1 Description This project will link and enhance the computerized information system supporting the life cycle maintenance management of land equipment and other department level systems such as the finance and supply systems. This system will be provided to al1 LCMMs. The data forecasted for the traff~canalysis has been completed.

1.27.2 Traffic Analysis The trafic rates for this projed were forecasted by the IDN Capacity Management study. Annex C

. 8 CS?.

1.28.1 Description This project will modernize the current outdated AMMIS system. This system will be intercomected to CFSSU and ADAM. There will be a main database like LEMOS, for the aircraft parts and the system will be used by the LCMMs. The data forecasted for the traffic analysis has been completed.

1.28.2 Traffic Analysis The tdicrates for this project were forecasted by the IDN Capacity Management study.

1.29.1 Description This project provides automated information system about specific aircrafi fleets. The system wifl be used for data collection and information on ail CF aircrdls. It will contain electronic logs, maintenance actions and status of aircraft and Iified/tracked components.

1.29.2 TraEc Analysis The traRic rates for this project were forecasted by the IDN Capacity Management study.

1.30.1 Description This project will automate al1 flight data at al1 CF airfields.

1.3O.2 Traffic Analysis

The tfic rate for this project was obtained through Comgate Consulting Company. They produced the tdc analysis which is explained in detail in Chapter 4.

C-IO Annex C

1.3 1.1 Description This project will provide an automated information processing and decision support Capa- bility for command and control for the Land Forces. It will provide an integration of tactical automation for formation level HQs, in garnison and in the field.

1.3 1.2 Traffic Analysis The td~crate for this project was obtained using the DMHS trafic analysis.

1.32.1 Description This project will update the information system for a better Maritime Comrnand and Con- trol System. This projea will support both a new p1atFon-n and a new network and update the functionality of MCOIN to meet current and future requirements. The data forecasted for the traf£ic analysis has been completed.

1.32.2 Traffic Analysis The trafic rates for this project were forecasted by the IDN Capacity Management study.

3 Naval MaintenanceManagement (IUMMïS)

1.33.1 Description

This project will provide automated support to the functions of LCMM and the maintenance of al1 naval ships and equipment. This system will replace the current Ship Mainte- nance Management Information System (SMMIS). The data forecasted for the traffic analysis has been completed.

1.33.2 Traffic Analysis The trafic rates for this project were forecasted by the IDN Capacity Management study. 4 I\lilitarv* * Police Sv-

LM. 1 Description This project will provide an automated, integrated CF-wide information system for secunty and military police operations. It will give the cornmanden of bases and stations timely access to information which are necessary for better security and military police services. The data forecasted for the tdc analysis has been completed.

1.34.2 Traffic Analysis The -c rates for this project were forecasted by the IDN Capacity Management study.

1.35.1 Description This project will provide an automated capability to DND for the creation, editing, approval, storage, distribution and retrieval of publications and documents including tech- nical documents. The data forecasted for the traf5c analysis has been completed.

1.35.2 Traffic Analysis The trafic rates for this project were forecasted by the IDN Capacity Management study.

1.36.1 Description This system provides automated payroll records for NPF personnel, monthly transmission of financial statements from each base to NDHQ for summary, quarterly reports From NDHQ of program updates, financial problem solving procedures frorn NDHQ to bases and other financial and management information as required by NDHQ.

1.36.2 Traffic Analysis

The trafic rates for this project were forecasted by the IDN Capacity Management study. Annex C

1.37.1 Description

This project will provide the Navy with an information system that will support thei r tacti- cd software inventory. It will enable the Navy to support the process control software inherent in shipboard combat and machinery systerns. The data forecasted for the traEc analysis has been completed.

1.37.2 Traffic Analysis

The tdc rates for this project were forecasted by the IDN Capacity Management study.

This information system is used by Communication Command/DISO to track the order- ing, administration and accounting of the communications equi pment and services ieased by DND Communication Groups frorn telephone companies and other vendors.

1.38.2 Trafic Analysis The traffic rates for this project were forecasted by the JDN Capacity Management study.

1.39.1 Description This project provides automateci and improved communications capabitity for military intelligence and secunty operations.

1.39.2 Trafic Analysis The Mc rates for this project were forecasted by the IDN Capacity Management study.

L40.1 Description This project will effect the life cycle upgrade to the complement of departmental personnel systems located at units, bases, commands and NDHQ. The data forecasted for the traffic anal ysis has been completed. Annex C

1.40.2 Traffic Analysis The tr&c rates for this project were forecasted by the IDN Capacity Management study.

1.41.1 Description

This project automates al1 documents related to the audit status process and supports the user roles of approver, responder and reader. It has an integrated database of audit reports, general comments, observations extracted fiom the DGA reports, OP1 response to an audit obsenration, milestones, etc.

1.41.2 Traffic Analysis The traffic rates for this project were forecasted by the IDN Capacity Management study.

1.42.1 Description This project will enable al1 project managers to have a data dictionary of al1 current projects. The data dictionary will contain an integrated database for al1 systems, present and future. The data forecasted for the trafic analysis has been completed.

1.42.2 Traffic Analysis

The -c rates for this project were forecasted by the IDN Capacity Management study.

1.43.1 Description This project enables ADM (Per) personnel to update administration tasks with NDHQ and Command HQ. E-mail and some specific applications to ADM (Per) are used in this system.

1.43.2 Traffic Analysis

The trac rates for this project were forecasted by the DNCapacity Management study. 1.44.1 Description This project will enable personnel of Receipt and Departure @&D) to imprcve their workioad for posting in and out military and civilian personnel. The data forecasted for the traff~canaiysis has been completed.

1.44.2 Traffic Analysis

The Mc rates for this project were forecasted by the IDN Capacity Management study.

1.45.1 Description This project will enable the automation of al1 patients files and examination forms between bases and NDMC.The data forecasted for the traffic analysis has been corn- pleted.

1.45.2 Trafic Analysis

The td~crates for this project were forecasted by the IDN Capacity Management study.

1.46.1 Description This project will enable personnel that are close to retirement to have access to cornputer applications for a review of their second career options. This system will automate al1 parts of FR SCAN.The data forecasted for the trafic analysis has been completed.

1.46.2 Traffic Analysis The traff~crates for this project were forecasted by the iDN Capacity Management study.

i 1.47.1 Description This project will provide an automated tool for updated naval information to LCMMs. This system will give information on the status of ships ashore for repair and overhaul. The data forecasted to the trafic analysis has been completed. Anncs C

1.47.2 Traffic Analysis The WICrates for this project were forecasted by the IDN Capacity Management study. Telephone and Faxes Trunk Study

NunDecolcakp«houpef~w(l2iraiyl 77 23703 3966265 1ôWI 38t8#57 8000321 4825823 4607711 621 2972 4720998 5668876 lu996 721 dû56 1546 149 7ôM257 Ml 3333 6697349 131308 109932B 2143û52 ôô20361 ô34OBH 1431 755ô514 MôW4 5162000 15$8217 155m 682 8474 Nunb« of cah por hou pubise (Mr-diy) IObbU 5918398 621 47 54253ûl lUOM8 7lô87Xi 721 1SW 1231 946 70âUB4 8503313 NOûû4 (Ob2 lûâ 2319223 1181838 1322 1OMôO2 lQ70819 lô48SS4 314578 1023û54 1251 lW 21485 11337t7 W32Ul 4W837 7743012 t398016 232512 891 2711 Nmtw of cab per mnlaIl2 hiday) 1287617 6610442 2801633 6028112 1500054 8t08705 6012Ul 13W26 7M166 9448126 2233168 1202343 15 76914 lll4373 14W9 11 18225 21 b97M 1832216 3571754 11 36727 1390154 a85 125û752 81-24 1005375 8803347 2665462 2583467 11 04746 NunbcioIcrkpe1mrdo(8h-doyl 193\426 9915863 420245 9û4216S 225MM (231456 1201926 2053243 11 62248 14 17219 33499 1803514 3665371 197 1559 1203333 16 74337 12Mô98 2748323 5357831 17W 2ûû5231 35.773 18- 1422139 75M2 12eosol 3W183 3875201 16ui18

mln 55* l17A homSdmfitChip103pr~e523 Pb 1% 78*12&

044kO6 i219463 966OôO4 207M9 51725âô 2-33 2785052 47- 2717814 387974 7700818 4 146008 8885911 453252 5065134 3848M1 7551032 8317945 1231839 3818746 4793634 8224138 4345874 3m2M 1725991 7068671 0818125 0890651 3109468 Fa8k dry 0 666ûû9 3 419194 14 49121 3 117869 7 7WB6 4 248399 4 14457Al 7 Oô0141 4 076721 4 886982 11 551M 6 219014 13 32M7 67 8848 7 597701 5 773577 11 3X55 9 476977 18 47459 5 87sB22 7 190451 12 33821 6 51558 4 805926 25 W74 450007 1 37M7 1 336216 5 714M2 Anncx D fni* icqum tu tu mcMn Anncx Ë

Traffic Analysis Anncx E

-- ....- 7.- ' '' 7 face Rduction ÇCAN . ' ' FRSCAN 9hlp Repulr Unlt IS . .. . SRUlS SARSAT NEUMIS ACAIRS MMS Anncr E Anncx E Annex F Traffic Analysis Sharing Proportion

(O % INCREASE) Real % TracSupplied Borden Ottawa 8 l6629Of 13O24174 Hali 6 1172176 Valcattier 5 911692 Shearwater 1.5 260483 GreenWood 1.5 264483 Gagetown 1.5 260483 Montreal 6 1172176 Kingston 3 620967 Trenton 1.5 2604ô3 St-John 1 130242 St-Jean 1.5 260483 BagotviIle 1.5 260483 Goose Bay 1 130242 Toronto 3 620967 Cold Lake 2 390725 Shilo 1 130242 Wainwig ht 1 130242 North Bay 3 620967 Winnipeg 2 390725 Petawawa 3 620967 Esquimalt 4 781460 Comox 4 7814Sû Edmonton 6 1172176 Suifield 3 620967

Borden 5 Haiii 6.5 VaIcartier 3 Sheaiwater 1.5 Greenwad 1.5 Gagetwon 1.5 Montreal 8 Kingston 2 Trenton 7 St-John 0.5 Bagatville 2 StJean 1.5 Gaosa Bay 0.5 Tomnto 6.5 Cald Lake 3 Shilo 0.5 Wainwright 0.5 NoRh Bay 2 Winnipeg 4.5 Petawawa 2 Esquimalt 4 Comox 2.5 Edmonton 8 Suttïeld 2

Halifax Barden 40 Qttawa 45 Esquimalt 10 Gagetawn 5

Ottawa 30 Borden 55 Montreal 5 Gagetawn 3 Petawawa 2 Edmonton 2 Kingstori 3

Shearwater Borden 38 6262202 Ottawa 58 Greenwood 4 Borden Ottaiira Montreal Valcartier Hari

Trenton Borden 13141255 Ottawa Comox Edmonton North Bay

Kingston Borden 12485071 Ottawa M-l Valcarüer Petawawa Edmonton Toronto

Borden OtCawa Kingston Valcartier Gagetawn Bsgonnlle Cornox Petawawa

St John's Ottawa 10871803 Borden

Goose Bay Ottawa 6413374 Borden

Borden Ottawa Montreal Cotd Lake North Bay

Toronto Borden 11584262 Ottawa Kingston Patawawa

Cold Lake Borden 6729619 Ottawa Bagotville Cornox North Bay

Borden Ottawa Suffierd Edmonton Wainwrig ht

Borden Ottawa Edmontan Shilo Sumeld North Bay Borden 11 lm78 mawa CoId Lake Trenton BagohriUe

Winnipeg 181 69267

Borden omwa Valcarüer Monbeal Toronto Kingston

Borden Ottawa Halifax

8orden Ottawa Montreal Cold Lake Trenton

Borden Ottawa Valcartier SuClield Wainwright S hiIo Kingston

Borden Ottawa Edmonton Wainwright Shilo Annex F

(1 0% NON-COMPOUNDED) Real % Borden Otbwa 8 195362 60 Haiii 6 ValcaWer 5 SheaMater 1.5 Greenwood 1-5 Gagetcwn 1.5 Montreal 6 Kingston 3 Trenton 1.5 St-John 1 St-Jean 1.5 Bagolville 1.5 Goose 0ay 1 Toronto 3 Cold Lake 2 Shilo 1 Wainwright 1 Notth Bay 3 Winnipeg 2 Petawawa 3 Esquimalt 4 Comox 4 Edmonton 6 Suffield 3

Ottawa Borden 79727029 Hafi Valcartier Sheamter Greenwood GageOHon Montreal Kingston Trenton St-John ûagotville St-Jean Goose Bay Toronto Cold Lake Shilo Wainwrig ht North Bay Winnipeg Petawawa Esquimalt Comox Edmonton Suffield

Oftawa Borden Montreal Gagetown Petawawa Edmonton Kingston

Borden Ottawa Greenwood Annen F Borden Ottawa Montreai Valcartier Halifax

Trenton Borden 18711 883 Ottawa Cornox Edmonton North Bay

Kingston Borden 18727607 Ottawa Montreal Valcartier Petawawa Edmcrnton Toronto

Borden Ottawa Shamater

Botden Ottawa Kingston Valca~er Gagetown Bagotville Comax PeCawawa

Ottawa Borden

Barden Ottawa Montreal Cold Lake NaRh Bay

Borden Ottawa Kingston PetawmNa

Cold Laka Borden l0094P29 Ottawa Eagotville Comox NoIth Bay

Shiio Borden 8935376 Ortawa Suffield Edmonton WainwrigM

Borden Ottawa Edmonton Shilo Sdiïeld Borden Ottswa Cold Lake Trenton BagoMlle

Winnipeg 27253901

Borden Ottawa Vafcarüer Montreal Toronto Kingston

Esquimalt Borden 28372601 Ottawa Halifax

Comox Borderi 17322023 Qttawa Montreal Cold Lake Trenton

Edmonton Borden 29237839 Ottawa Valcartier Sfield Wainwright S hiIo Kingston

Borden Ottawa Edmonton Wainwright Shilo Trafic Anaiysb Sharing proportion (15% NON COMPOUNDED) Real % Borden Ottawa 8 22792304 Hali 6 ValCartier S Shearwater 1.5 Gmnwod 1.s Gagetown 1.5 ManEnral 6 Kingston 3 Trenton 1.5 St-John 1 StJean 1.5 Bagotville 1.5 Bay 1 Toronto 3 Cold Lake 2 Shilo 1 Wainwright 1 North Bay 3 Winnipeg 2 Petawawa 3 Esquimalt 4 Comox 4 Edmonton 6 SMield 3

Borden Halifax Valcartier Sheamter Greenwood Gagetwon Montreal Kingston Trenton St-John ûagotville St-Jean Goose Bay Toronto Cold Lake Shiio Wainwright North Bay Winnipeg Petawanra Esquimalt Comox Edmonton SufIield

Borden Ottawa Esquimalt Gagetown

Valcartier Ottawa U783916 Borden Montreal Gagetown Petawavm Edmonton Kingston

Borden Ottawa Greemvcmd

Gageîown Borden 1 l99îl49 Ottawa Montreal Valcartier Haiii Trenton Borden 22997197 ottnm carnax Edmonton North Bay

Kingston Borden 21848875 othva MontreaI Valcartïer Petawaum Edmonton Toronto

Botden Ottawa Sheawater

Borden OmhQ Kingston Valcartier Gagetown Bagohnlle Coma Petawawa

Ottawa Borden

Borden Ottawa Montreal Cold Lake North Bay

Toronto Borden 20272459 Ottawa Kingston Petawwa

Cold Lake Borden 11776834 dttawa Bagotville Comox Noftfl Bay

Shilo Borden 10424606 Ottawa Suffield Edmonton WainwrigM

Borden Ottawa Edmonton S hilo Suî?ïeld

North Bay Borden 1957441 1 ottavm Cold Lake Trenton Bagoîville Anncr F

Borden otbwa Vaicarîier Montreal Toronto Kingston

Borden Ottawa Halifax

Comox Borden 2ûZ090;?7 Ottawa Monireal Cold Lake Trenton

Edmonton Borden 34110812 Ottawa Valcarüer Suiiïeld Wai-gM Shilo Kingston

Borden Ottawa Edmonton WaMgM S hilo Tamc Anaiysis Shafing proportion (20% NON COMPOUNDED) Real % % Borden Oaawa 8 12 26048347 Halifax 6 9 Valcauüer S 7 Sheamaîer 1.5 2 Greenwood 1.5 2 Gagetown 1.5 2 Montreal 6 9 Kingston 3 4 Trenton 1.5 2 St-John 1 t StJean 1.5 2 Bagatville 1.5 2 Goose Bay 1 1 Toronto 3 4 Cold Lake 2 3 Shilo 1 1 Wainwright 1 1 North Bay 3 4 Winnipeg 2 3 Petawawa 3 4 Esquimait 4 6 Comox 4 6 Edmonton 6 9 Sunield 3 4

Ottawa Borden 106302706 Halifax Valcartier Sheamter Greenwood Gagelwon Montreal Kingsîon Trenton St-John Bagatville St-Jean Bay Toronto Cold Lake Shilo Waimuright North Bay Winnipeg Petawawa Esquimait Comox Edmonton SuReid

Barden Ottawa Esquimalt Gagetown

Otfawa Borden Montreal Gagetown Petawawa Edmonton Kingston

Borden Ottawa Greenwood

Gagetown Borden l37ûS313 Ottawa Montreal Valcartier Harifax Annes F Borden Oitawa Coma* Edmonton North Bay

&den Ottawa Montreal Valcartier Peîawm Edmonton Toronto

Ottawa Borden

Ottawa 6orden

Borden Ottawa Montreal Cold Lake Nom Bay

Barden Ottawa Kingston Petawawa

Cold Lake 8orden 13459238 Ottawa Bagotville comox North Bay

Shilo Borden 1191 3835 Ottawa Suftïeld Edmonton Wainwrig ht

Borden Ottawa Edmonton S hi10 SUmeiû

North Bay Borden 22370755 Ottawa Cold Lake Trenton Eagotville Borden Ottawa

Borden Ottawa Valcartier Montreal Toronto Kingston

Barden Ottawa Montreal Cold Lake Trenton

Edmonton Borden otwm Valcartier Suffield WainvwigM Shilo Kingston

Borden Ottawa Edmonton WainWgM Shilo Trafîïc Analysis Sharing proporüon (10% COMPOUNDED) Borden Ottawa 20975562 Halii VaIcanier Sheammter Gremwoad Gagetown Montreal Kingston Trenton St-John St-Jean BagotviHe -Bay Toronto Cold Lake Shilo WainMg ht North Bay Winnipeg Petawawa Esquimait Cornax Edmonton Sunield

Ottawa Borden 85600785 Hari Valcartier S hearwater Green- Gagehum Montreal Kingston Trenton StJohn Bagotville St-Jean Goose Bay Toronto Cold Lake Shilo Wai-ght Nom Bay Wtnnipeg Petawawa Esquimait Camox Edmonton S field

Borden mawa Esquirnait Gagetown

(nrawa Botden Montreal Gagetown Petawam Edmonton Kingston

Barden Ottawa Greenwood Borden Ottawa Montreal Valcatüer Halk Trenton Borden 21 164123 Ottawa Camox Edmonton North Bay

Borden dttawa Montreal Vaicaitier Petawawa Edmonton Toronto

Sorden Ottawa S hanivater

Borden dttawa Kingston Valcartier Gagetawn Bagotville Cornox Peamwa

Goose Bay Ottawa 10328802 Barden

Ottawa Borden

Borden Ottawa Montreal Cald Lake North Ray

Toronto Borden 18656570 Ottawa Kingston Petawawa

Cold Lake Borden 108381 19 Ottawa Bagotvilte Comox North Bay

Shilo Borden 9593675 OtEawa Sfleld Edmonton WaiMght

Barden Ottawa Edmonton Shilo Sufï~eld

Noith Bay Botden 18014162 Ottawa Cold Lake Trenton Bagotville Aunes F Winnipeg 29261787

Barden Ottarva Montreal Cold Lake Trenton

Edmonton Borden 31397 888 Oltawa Valcartier Suffield WaiwgM Shilo Kingston

Barden ottavm Edmonton Waimnnight Shilo Aones F Traîï~cAnalysii Sharing proportion (15% COMPOUNDED) Real % Borden Ottawa 8 261 96265 Halifax 6 VakaRier 5 Shearwater 1.5 Greenwaod 1.5 Gagetawn 1.5 Montreal 6 Kingston 3 Trenton 1.5 St-John 1 St-Jean 1.5 Eagohnlle 1-5 Goose Bay 1 Tomnto 3 Cold Lake 2 Shilo 1 Wainwnght 1 North Bay 3 Winnipeg 2 Petawawa 3 Esguimalt 4 Comox 4 Edmonton 6 Sufield 3

Ottawa Barden Halifax Valcartier Shearwater Greenwood Gagetwon Montreal Kingston Trenton St-John Bagotville Çt-Jean Goose Bay Toronto Cold Lake Shilo Wainwn'ght North Bay Winnipeg Petawawa Esquimalt Camox Edmonton Stdi7eld

Haiii Borden Ottawa Esquimalt Gagetmm

Valcartier Ottawa 261 86625 Borden Montreal Gagetawn Petawawa Edmonton Kingston

&den Ottawa Greenwood

Borden Ottawa Montreal Valcartier Halifax Annea F

Kingston Borden 25111938 Ottawa Montreal Valcartier Petarvawa Edmonton Toronta

Borden Ottawa SheaMlater

Borden omua Kingston VaIcartier Gagetown Ragotville Cornac Petawawa

Ottawa Borden

Goose Bay Ottawa 12894585 Borâen

Ottawa Borden

Borden Ottawa Montreal Cold Lake North Bay

Borden Ottawa Kingston Petawawa

Borden Ottawa BagoMle Comox North Bay

Borùen Ottawa S field Edmonton Waimivnght

Borden ouawa Edmonton S hilo Sutïteld

Norîh Bay Borden 22497790 Ottawa Cold Lake Trenton Bagolville Borden omwa ValCartier Montreal Toronto Kingston

Burden Ottawa Montreal Cold Lala Trenton

Edmonton Borden Si05159 Ottawa VaIcanier Sutfield WainwrigM Shilo K~Qs~o~

Borden Ottawa Edmonton Wai-ght Shi10 TraCnc AnamSharing proportion (20% CûMPOUNDED) Borden Ottawa 3240831 2 Hari Vakartier SheaMlaler Greerrwood GagetcMm Monireal Kingston Trenton Stllohn St-Jean Bagohnlle G- Bay Toronto Cold Lake Shik Wainwright North Bay Winnipeg Petawawa Esquimait Comox Edmonton Suffield

Borden Halifax Valcarüer Shearwater Greenwood Gagetwon Montreal Kingsion Trenton St-John Bagotville StJean Goose Bay Toronto Cold take Shifo Wai-gM North Bay Winnipeg Petawawa Esquimalt Comox Edmonton Suffield

Halifax Borden 52010013 Ortawa Esquimalt Gagetown

Ottawd Borden Montreal Gagetawn Petawawa Edmonton Kingston

Shearwater 15582363

Gagetawn Borden 17051602 Ottawa Montreal Valcartier Halifax Barden Ottawa Comox Edmonton North Bay

Kingston Borden 31- omwa Montreal Vakartier P- P- Edmonton Toronto

Barden Ottawa Sheawater

Botden Ottawa Kingston Valcattier Gagetown Bagatville Comox Petâwawa

Ottawa Borden

Borden Ottawa Montreal Cold Lake North Bay

Borden Ottanra Kingston Petawawa

Barden Ottawa Bagotville Comox North Bay

Shilo Borden 1482271 7 Ottawa Sdîïeld Edmonton Wainwright

Wainwright Borden 14320349 Ottawa Edmonton Shilo Suffield

North Bay Borden 50 50 13916400 27832799 Olfmiva 40 40 11133120 Cold Lake 3 3 834984 Trenton 4 4 14 13312 Bagotville 3 3 834984 Annes F

Borden Ottawa Valcaltier Montreal Toronto Kingston

men Ottawa Halifax

Borden Ottawa Montreal &Id Lake Trenton

Edmonton Borden 48502067 Ottawa Valcartier Sutfield Wainwright Shi10 Kingston

Borden Ottawa Edmonton Waimnm'ght Shilo Base Nomenclature

1 Base 1 Abbmviation ( Addmu ( Base ( Abbteviotim ( Address Comox COMX 2 Esquimalt ESQT 3 Sufield SFFD 4 Edmonton EDMT 5 Cold Lake CDLK 6 Wainwright WNWR 7 1 Shi10 1 SHIL 1 8 1 Winnipeg ( WNPG 1 9 Borden BRDN 1 North Bay NRBY 10 Petawawa PTWW 11 Trenton TREN 12

Montreal MTRL 15 Ottawa OTWA O Quebec QuEB 16 Bagotville BAGO 17 Gagetown GAGE 18 St-Jean STJN 19 Halifax HLFX 20 Sheaxwater SHWR 2 1 Greenwood GRWD 22 Goose Bay GSBY 23 Annex H

GAMS Output File fox 25-Node Problem

VAR X This variable is used to find the specific route between the nade pair (i,j). The level as shown below is the "quantitywof traffic taking the route. Lowet, upper and marginal are not used for this -program-

LOWER LEVEL UPPER KARGf NAL BRDN.0TWA.T-1 . . +INF EPS BRDN. OTWA. T-2 . lS63.000 +INF . BRDN.0TWA.T-3 . +INF EPS BRDN. OTWA. T-4 . +INF EPS BRDN.TRE3l.T-39 . +INF EPS BRl2N.TREN.T-40 260.000 +INF . BRDN.TREN.T-41 . . +INF EPS BRDN.TREN.T-42 . +INF EPS BRDN. KGTN. T-35 . +INF EPS BRDN. KGTN-T-36 . +INF EPS BRDN-KGTN-T-37 . . +INF EPS BRDN.KGTN.T-38 . 521.000 +INF BRDN-QüEB.T-9 . . +INF EPS BRDN. QUEB .T-10 9ll.OOO +INF . 3RDNeQUEB.T-11 . +INF EPS BRDN. QUEB. T-12 . . +INF EPS BRDN. MTRL. T-31 . 1172.000 +INF BRDN.MTRL.T-32 . +ZNF EPS BRDN.MTRL.T-33 . . +INF EPS \ BRDN.MTRL.T-34 . +INF EPS 8RDN.GAGE.T-25 . . +INF EPS BRDN-GAGE-T-26 . 260.000 +INF 8RDN.GAGE.T-27 . +INF EPS BRDN-GAGE-T-28 . +INF EPS BRDN-GAGE-T-29 +INF EPS BRDN.GAGE.T-30 +INF EPS BRDN.GRWD.T-19 . 260.000 +INF . BRDN.GRWD.T-20 . . +INF EPS RRDN.GRWD.T-21 . +INF EPS BRDN.GRWD.T-22 +INF EPS BRDN.GRWD.T-23 . +INF EPS BRDN.GRWD.T-24 . +INF EPS BRDN .HLFX .T-5 . ll72.000 +INF . BRDN.HLFX.T-6 . +INF EPS BRDN.EiLFX.T-7 . +INF EPS BRJ3N.HLFX.T-8 . . +INF EPS BRDN. SHWR.T-13 . +INF EPS BRDN. SHWR. T-14 . . +INF EPS BRDN.SHWR.T-15 . 0 +INF EPS BRDN.SHWR.T-16 . . +INF EPS BRDN.SEWR.T-17 . 260.000 +INF l BRDN.SHWR.T-18 . . +INF EPS BRDN.TOR0.T-247 . . + INF EPS BRDN.TOR0.T-248 . 521.000 +INF BRDN.TOR0.T-249 . l + INF EPS BRDN. TORO. T-250 . . +INF EPS BRDN.GSBY.T-223 . +INF EPS BRDN.GSBY.T-224 l3O.OOO +INF Annex H

VAR X traf f ic UPPER MARGINAL BRDN.GSBY. T-225 +ZNF EPS BRDN.GSEY.T-226 +INF EPS BRON. BAGO. T-235 +INF EPS BRDN. BAGO. T-236 +INF EPS BRDN. BAGO. T-237 +INF BRDN.BAG0.T-238 +INF EPS BRDN. STJN.T-231 +rNF . BRDN.STJN.T-232 +INF EPS BRDN-STJN-T-233 +INF EPS BRDN. STJN. T-234 +INF EPS BRDN. STJH. T-211 +INF EPS BRDN.STJH.T-212 +fNF BRDN. STJH. T-2 13 +INF EPS BRDN. STJH,T-214 +INF EPS BRDN.CDLR.T-259 +Ira? EPS BRDN.CDLK.T-~~O +INF EPS BRDN. CDLK.T-261 +INF BRDN.CDLK,T-262 +INF EPS BRDN. WNWR. T-299 +INF BRDN. WNWR. T-300 +INF EPS BRDN.WNWR.T-301 +INF EPS BRDN.WNWR.T-302 +INF EPS BRDN. SHIL. T-283 +INF BRDN. SHIL. T-284 +INF EPS BRDN.SH1L.T-285 +INF EPS ' BRDN.SH1L.T-286 +INF EPS 8RDN.WNPG.T-331 +INF . BRDN.WNPG.T-332 +INF EPS BRDN.WNPG.T-333 +INF EPS BRDN. WNPG.T-334 +INF EPS BRDN.NREY .T-3lS +INF EPS BRDN-NRBY.T-316 +INF EPS BFtDN.NREY .T-3lï +INF œ BRûN. NRBY. T-318 +INF EPS BRDN.PTWb7.T-347 +INF EPS BRDN. PTWW. T-348 +INF EPS BRDN.PTWP7.T-349 i-INF EPS BRL3N.PTWW.T-350 +INF BRDN.ESQT.T-363 +INF EPS BRDN.ESQT.T-364 +INF EPS BRDN.ESQT.T-365 +INF EPS BRDN. ESQT. T-366 +INF BRDN.COMX.T-387 +INF BRDN.COMX.T-388 +INF EPS BRDN.COMX.T-389 +INF EPS BRDN.COMX.T-390 4INF EPS BRDN. EDMT. T-419 +INF EPS BRDN.EDI4T.T-420 +INF EPS BRDN.EDl4T.T-421 +INF EPS BRDN.EDMT.T-422 +INF . BRDN.EDMT.T-448 +INF EPS VAR X traffic

LEVEL UPPER MARGINAf, BRDN. SFFD. T-435 521.000 +INF . BRDN.SFFD.T-436 +INF EPS SFFD .T-437 BRDN, O +INF EPÇ BRDN. SFFD. T-438 O +INF EPS BRDN. SFFD .T-4SS O +INF EPS 0TWA.BRDN.T-131 3721.000 +INF 0TWA.BRDN.T-132 . +INF EPS 0TWA.BRDN.T-133 I +INF EPS OTWA. T-134 BRDN. O +INF EPS 0TWA.TREN.T-163 O +INF EPS OTWA. TREN. T-164 4OlO.8OO +INF . 0TWA.TREN.T-165 . +INF EPS 0TWA.TREN.T-166 772.200 +INF 0TWA.KGTN.T-155 LS9S.000 +INF OTWA. KGTN. T-156 . +INF EPS 0TWA.KGTN.T-157 O +TNP EPS 0TWA.KGTN.T-158 . +INF EPS 0TWA.QUEB.T-139 2126 .O00 +INF . 0TWA.QWEB.T-140 . +INF EPS 0TWA.QUEB.T-141 . +INF EPS 0TWA.QüEB.T-142 . +ZNF EPS 0TWA.MTRL.T-159 . +INF EPS 0TWA.MTRL.T-160 595.400 +INF . 0TWA.MTRL.T-161 I +INF EPS 0TWA.MTRL.T-162 4719.600 +INF . ' 0TWA.GAGE.T-151 lO63.OOO +INF 0TWA.GAGE.T-152 . +INF EPS 0TWA.GAGE.T-153 . +INF EPS 0TWA.GAGE.T-154 . +INF EPS 0TWA.GRWD.T-147 362.2OO +INF . 0TWA.GRWD.T-148 ïOO.8OO +INF 0TWA.GRWD.T-149 0 +INF EPS 0TWA.GRWD.T-150 9 +INF EPS 0TWA.HLFX.T-135 4252 .O00 +INF . 0TiA.HLFX.T-136 œ +INF EPS 0TWA.HLFX.T-137 . +INF EPS 0TWA.HLFX.T-138 . +INF EPS 0TWA.SHWR.T-143 . +INF EPS 0TWA.SHWR. T-144 lO63.OOO +INF 0TWA.SHWR.T-145 . 0 +INF EPS 0TWA.SEiWR.T-146 . +INF EPS 0TWA.TORO.T-251 4252.000 +INF 0TWA.TORO.T-252 . b +INF EPS 0TWA.TORO.T-253 . +INF EPS 0TWA.TORO.T-254 . +INF EPS 0TWA.GSBY.T-219 . +INF EPS 0TWA.GSBY.T-220 531.000 +INF . 0TWA.GSBY.T-221 . +INF EPS 0TWA.GSBY.T-222 . +XNF EPS 0TWA.BAGO.T-239 1595 .O00 +XNF . VAR X traf f ic

LOWER LEVEL UPPER MARGINAI, 0TWA.BAGO.T-240 . +INF EPS 0TWA.BAGO.T-241 . +INF EPS 0TWA.BAGO.T-242 . +INF EPS 0TWA.STJN.T-227 lO63.000 +INF . 0TWA.STJN.T-228 . . +INF EPS OTWA.ST3N.T-229 . . +INF EPS 0TWA.STJN.T-230 . . +INF EPS OTWA*STJH.T-215 +INF EPS 0TWA.STJH.T-216 O 531.000 +INF . 0TWA.STJH.T-217 . . +INF EPS 0TWA.STJH.T-218 . +INF EPS 0TWA.CDLK.T-267 . +INF EPS 0TWA.CDLK.T-268 . . +INF EPS OTWA. CDLK. T-269 2126.OOO +INF

0TWA.CDLR.T-270 O +INF EPS 0TWA.WlWR.T-307 . . +INF EPS 0TWA.WNWR.T-308 . 53l.000 +INF 0TWA.WNWR.T-309 . . +INF EPS 0TWA.WNWR.T-310 . . +INF EPS 0TWA.SHIL.T-291 . +INF EPS 0TWA.SHIL.T-292 . +INF EPS 0TWA.SHIL.T-293 . . +IN?? EFS 0TWA.SHIL.T-294 . 531.000 +INF O 0TWA.WNPG.T-339 . +INF EPS 0TWA.WNPG.T-340 . +INF EPS OTWA. WNPG. T-341 ) . O +INF EPS 0TWA.WNPG.T-342 3l89.000 +INF . 0TWA.NRBY.T-323 . lS95.000 +INF . 0TWA.NRBY.T-324 +INF EPS 0TWA.NRBY.T-325 . +INF EPS 0TWA.NRBY.T-326 . +INF EPS 0TWA.PTWW.T-355 . lS95.000 +INF O 0TWA.PTWW.T-356 . +INF EPS 0TWA.PTWW.T-357 . +INF EPS OTWA-PTWW-T-358 9 +INF EPS 0TWA.ESQT.T-371 9 2656.000 +INF . 0TWA.ESQT.T-372 . +INF EPS 0TWA.ESQT.T-373 . O +INF EPS 0TWA.ESQT.T-374 +INF EPS 0TWA.COMX.T-395 . 1595.000 +INF 0TWA.COMX.T-396 . . +INF EPS 0TWA.COMX.T-397 . +INF EPS 0TWA.COMX.T-398 9 +INF EPS

0TWA.EDMT.T-427 0 +INF EPS 0TWA.EDMT.T-428 . 53lS.OOO +INF . 0TWA.EDMT.T-429 . . +INF EPS 0TWA.EDMT.T-430 . . +INF EPS 0TWA.EDMT.T-450 . +INF EPS 0TWA.SFFD.T-443 . 1595.000 +INF . 0TWA.SFFD.T-444 . +INF EPS VAR X traf f ic

LOWER UPPER XARGINAL

OTWA. SFFD .T-445 O +INF EPS OTWA. SFFD-.T-446 . +INF EPS 0TWA.SFE'D.T-454 . +INF EPS TRJ3N.BRDN.T-87 O +INF TREN .BRûN .T-88 . +INF . TREN. BRDN. T-89 O +INF EPS TRl3N.BRDN.T-90 . +INF EPS TREN.0TWA.T-91 O +Irn . TREN .OTWA .T-92 +INF O TRENo OTWAo T-93 +INF . TRJ3N. OTWA .T-94 . +INF . TREN. NRBY .T-483 O +INF . TRSN. NRBY .T-484 +INF EPS TREN. NRBY .T-485 . +INF EPS TREN. NRBY .T-486 . +INF EPS TREN. COMX. T-463 +INF EPS TREN COMX T-464 +INF EPS TREN. COMX. T-465 . +INF EPS TREN. C0MX.T-466 . +INF TmN.EDMT. T-479 . +INF EPS TREN.EDl4T.T-480 . +INF . TREN.EDl4T.T-481 +INF EPS TREN.EDl4T.T-482 . +INF EPS KGTN.BRûN.T-95 +INF . KGTN .BRDN .T-9 6 O +INF EPS ) KGTN.BRDN.T-97 +INF EPS KGTN.BRDN.T-98 +INF EPS KGTN.0TWA.T-99 . +INF EPS KGTN.0TWA.T-100 O +INF EPS KGTN.0TWA.T-101 +INF KGTN.0TWA.T-102 +INF EPS KGTN.QUE3.T-543 O +INF . KGTN.QWI3B.T-544 +INF EPS KGTN-QUEB-T-545 . +INF EPS KGTN.QUI3B.T-546 . +INF EPS KGTN.MTRL.T-103 . +INF EPS KGTN.MTRL.T-104 +INF KGTN.MTRL.T-105 r +INF EPS KGTN.MTRL.T-106 . +INF EPS KGTN.TOR0.T-631 +INF EPS KGTN.TOR0.T-632 . +INF EPS KGTN.TOR0.T-633 +INF EPS KGTN.TOR0.T-634 +INF . KGTN. PTWW.T-567 . +INF O KGTN. PTWW.T-568 . +INF EPS KGTN.PTWW.T-569 +INF EPS KGTN. PTWW. T-570 . +INF EPS KGTN.EDMT. T-591 +INF EPS KGTN.EDMT. T-592 O +INF . KGTN.EDMT.T-593 . +INF EPS KGTN.EDI4T.T-594 +INF EPS QUEB. 3RDN.T-59 +INF EPS QUEB .BRDN .T-60 O +INF . VAR X traf f ic

LOWER UPPER MARGINAL QUEB .BRDN. T-61 +INF EPS QUEB .BRDN. T-62 . +INF EPS QüEB.0TWA.T-55 . +INF EPS QüJ3B.OTWA.T-56 . +INF EPS QUEB.0TWA.T-57 O +INF EPS QtJEB.0TWA.T-58 a +INF œ QUEB.KGTN.T-539 . +INF EPS QUI3B.KGTN.T-540 +XNF QUEB. ICGTN. T-541 . +INF EPS QUEB.KGTN.T-542 . +INF EPS QüEB .MTRL. T-63 +INF . QOEB.MTRL.T-64 +INF EPS QUI3B.MTRL.T-65 . +INF EPS QüEB .MTRL. T-66 . +INF EPS QUI3B.GAGE.T-511 . +INF . QüE8.GAGE.T-512 . +INF EPS QUEB.GAGE.T-513 . +INF EPS QUI3B.GAGE.T-514 . +INF EPS QUI3B.PTWW.T-523 . +INF EPS QUEB.PTWW.T-524 . +INF EPS QUI3B.PTWW.T-525 . +INF QUl3B.PTWW.T-526 +INF EPS QUEB.EDMT.T-531 +INF EPS QUJ3B.EDMT.T-532 +INF . QOEB.EDl4T.T-533 . +INF EPS QUJ3B.EDMT.T-534 . +INF EPS ' MTRL.BRDN.T-115 O iINF . MTRL.BRDN.T-116 . +INF EPS MTRL-BRDN-T-117 +INF EPS MTRL.BRDN.T-118 . +INF EPS MTRL.0TWA.T-119 +INF EPS MTRL. OTWA. T-120 . +INF EPS MTRL.6TWA.T-121 0 +INF MTXL.0TWA.T-122 +INF EPS I4TRL.KGTN.T-123 +INF EPS MTRL.KGTN.T-124 . +INF EPS MTRL .KGTN .T-12 5 +INF . i4TRL.KGTN.T-126 . +INF EPS I4TRL.QUEB.T-127 +INF

MTRL.QUI3B.T-128 O +INF EPS MTRL .QüEB .T-129 . +INF EPS MTRL. QüEB. T-130 +INF EPS I4TRL.GAGE.T-455 . +INF EPS i4TRL.GAGE.T-456 +INF EPS MTF4L.GAGE.T-457 . +INF MTF4L.GAGE.T-458 +INF EPS MTRL.BAG0.T-243 . +INF EPS MTRL.BAG0.T-244 . +INF . MTRL-BAW-T-245 +INF EPS MTRL.BAG0.T-246 . +INF EPS MTRL.PTWW.T-551 . +INF . VAR X traf f ic

LOWER LEVEL UPPER MARGINAL MTRL.PTWW.T-552 +INF EPS MTRL.PTWW.T-553 +INF EPS MTRL.PTWW.T-554 O +INF EPS l4TR.L.COMX.T-403 O O +INF EPS MTRL.COMX.T-404 +INF EPS MTRL.WM.X.T-405 . +INF EPS MTRL.COl4X.T-406 661.000 +INF . GAGE.BF4DN.T-75 . +INF EPS GAGE.BRDN.T-76 t1NF EPS GAGE.BRDN.T-77 2467.000 +INF GAGE,BRDN.T-78 . +INF EPS GAGE.0TWA.T-79 . +INF EPS GAGE.0TWA.T-80 +INF EPS GAGi3,OTWA.T-81 37OO.OOO +INF GAGE.0TWA.T-82 O +INF EPS GAGE.QUEB.T-507 +INF EPS GAGE.QUEB.T-508 + INF EPS GAGE.QUEB.T-509 9 274.000 +INF GAGE.Qt7EB.T-510 . +INF EPS GAGE.MTRL.T-83 +INF EPS GAGE.MTRL.T-84 . îO6.OOO +INF a GAGE.MTRL.T-85 . . +INF EPS GAGE.MTRL.T-86 +INF EPS GAGE.HLFX.T-515 206.000 +INF GAGE.HLFX.T-516 . +INF EPS GAGJ3.HLFX.T-517 +INF EPS GAGE.HLFX.T-518 +INF EPS GRWD.8RDN.T-107 . 36OO.OOO +INF . GRWD.BRDN.T-108 +INF EPS GRWD.BRDN.T-109 . . +INF EPS GRWD .BRDN.T-110 . +fNF EPS GRWD.0TWA.T-111 1087.600 +INF GRWD.0TWA.T-112 +INF EPS GRWD.0TWA.T-113 a +INF EPS GRWD.OTWA.T-114 1312.400 +INF . GRWI). SHWR. T-503 O 9 +INF EPS GRWD. Sm.T-504 . 9 +INF EPS GRWD.SHWR.T-505 . 316.000 +INF O GRWD.SHWR.T-506 O +INF EPS HLFX.BRDN.T-49 O . +INF EPS E3LFX.BRDN.T-50 . . +fNF EPS E3LFX.BRDN.T-51 9 +fNF EPS HLFX.BRI3N.T-52 8361.000 +INF HLFX.BRDN.T-53 +INF EPS HLFX .BRDN T-54 O +INF EPS HLFX.0TWA.T-43 . +INF EPS HLFX.0TWA.T-44 4Oï2.OOO +INF . HLFX.0TWA.T-45 +INF EPS HLFX.0TWA.T-46 . 4723.000 +INF HLFX.0TWA.T-47 O 361.600 +INF . HLFX.0TWA.T-48 . 249.400 +INF VAR X traf f ic LEVEL UPPER MARGINAL

lO45.OOO +INF 9 . +INF EPS . +INF EPS +INF EPS . +INF EPS SO9O.OOO +INF . HZ;FX.ESQT.T-~~~ . +INF EPS HLFX.ESQT.T-382 +INF EPS Sm.BRDN. T-67 +INF EPS Sm.BRDN. T-68 . +INF EPS SHWR. BRDN. T-69 238O.OOO +INF . SHWR. BRDN-Ta70 . +INF EPS SHWR. OTWA. T-71 2569.600 +INF . SHWR.0TWA.T-72 . +INF EPS SHWR.0TWA.T-73 lO62.4OO +INF . SHWR.0TWA.T-74 . +INF EPS SE3WR.GRWD.T-499 250.000 +INF SI3WR.GRWD.T-500 . +INF EPS SHTdR.GRb7D.T-501 . +INF EPS SHWR. GRWD. T-502 . +INF EPS TORO. BRDN.T-203 3244.000 +INF . TOR0.BRDN.T-204 +INF EPS TORO. BRDN-T-205 . +INF EPS TOR0.BRDN.T-206 O +INF EPS TORO.0TWA.T-207 7646.000 +INF . TORO.0TWA.T-208 . +INF EPS TORO.0TWA.T-209 +INF EPS TOR0.OTWA.T-210 +INF EPS TOR0oKGTN.T-627 . +INF EPS T0RO.KGTN.T-628 O +INF EPS TOR0.KGTN.T-629 232.000 +INF . T0RO.KGTN.T-630 +INF EPS TOR0.PTWW.T-559 +XNF . TOR0.PTWW.T-560 463.000 +INF . TOR0.PTWW.T-561 +INF EPS TOR0.PTWW.T-562 +INF EPS GSBY.BRDN.T-179 . +INF EPS GSBY0BRDN.T-180 1312.400 +INF . GSBY.BRDN.T-181 O +INF EPS GSBY. BRDN. T-182 1252.600 +fNF . GSBY.0TWA.T-175 . +INF EPS GSBY. OTWA. T-176 3846.000 +INF . GSBY.0TWA.T-177 . +INF EPS GSBY.0TWA.T-178 . +INF EPS BAW. BRDN. T-19 1 +INF EPS BAG0.BRDN.T-192 . +INF EPS BAG0.BRDN.T-193 78O.OOO +INF . BAG0.BRDN.T-194 +INF - EPS BAGO.0TWA.T-195 3903.000 +INF BAûû.0TWA.T-196 . +INF EPS 5AGO.OTWA.T-197 . +INF EPS BAGO.0TWA.T-198 +INF EPS BAG0.MTRL.T-199 . +INF EPS

H-8 Annex H

VARX traf fic

LEVEL UPPER MARGINAL

BAG0.MTRL.T-200 390.000 +INF BAG0.MTRL.T-201 . +INF EPS 8AW.MTRL.T-202 . +INF EPS BAG0.CDLK.T-275 +INF . BIIGO. CDLK. T-2 76 O +INF EPS BAG0.CDLK.T-277 . +INF EPS BAG0.CDLK.T-278 lO4l.OOO +INF BAG0.NRBY.T-495 . +INF EPS BAG0.NRBY.T-496 . +INF EPS BAW.NRBY.T-497 . +INF EPS BAW .NRBY .T-498 39O.OOO +INF . STJN-BRDN-T-187 1508.200 +INF . STJN.BRDN.T-188 . +INF EPS STJN.BRDN.T-189 . +INF . STJN. BRDN. T-190 1063,800 +INF STJN.0TWA.T-183 . +fNF EPS STJN.0TWA.T-184 3857.000 +INF . STJN.0TWA.T-185 O +INF EPS STJN.0TWA.T-186 . +INF EPS STJH.BRDN.T-167 . +INF EPS STJH. BRDN. T-168 4349.000 +INF . STJH. BRDNo Tg169 . +INF EPS STJH-BRDNOT-170 +INF EPS STJH.0TWA.T-171 6523.000 +INF . ' STJH.0TWA.T-172 +INF EPS ) STJH.0TWA.T-173 . +INF EPS STJH.0TWA.T-174 O +INF EPS CDLK.8RDN.T-255 . +INF EPS CDLK.BRDN.T-256 +INF EPS CDLK-BRDN-T-257 740.000 +INF . CDLK-BRDN-T-258 . +INF EPS CDLK.0TWA.T-263 +INF EPS CDLK.0TWA.T-264 . +INF EPS CDLK.0TWA.T-265 2288.000 +INF O CDLK.0TWA.T-266 . +INF EPS CDLK.BAG0.T-271 +INF EPS CDLK.BAG0.T-272 +XNF EPS CDLK.BAG0.T-273 O +INF EPS CDLK. BAG0-T-274 2625.000 +INF . CDLK.NRBY.T-467 +INF EPS CDLK.NRBY.T-468 . +INF EPS CDLK.NRBY.T-469 . +INF EPS CDLK-NRBY-T-470 336.000 +INF CDLK.COMX*T-411 . +INF EPS CDLK. COMX. T-412 O +INF EPS

CDLK.COl4X.T-413 74O.OOO +INF 8 CDLK.COMX-T-414 +INF EPS WNWR.BRDN.T-295 +INF EPS WNWR.BRDN.T-296 2Ol4.000 +INF . WNWl2.BRDN.T-297 . +INF EPS VAR X traf fic

LEVEL UPPER MARGf NAL WNWR.BRDN.T-298 . +f NF EPS WNWR.OTWA. T-303 . +INF EPS WNWR. OTWA. T-304 . +INF EPS WNWR.0TWA.T-305 3165.000 +INF . WNWR.0TWA.T-306 . +INF EPS WNWR.SH1L.T-619 230.000 +INF . WNWR.SH1L.T-620 . +INF EPS WNWR.SH1L.T-621 +INF EPS WNWR.SH1L.T-622 +ZNF EPS WNWR.EDMT.T-583 280.000 +INF . WNWR.EDl4T.T-584 +INF EPS WNWR.EDMT.T-585 . +INF EPS WNWR.EDl4T.T-586 . +INF EPS WNWR. SFFD. T-607 . +INF EPS WNWR.SFFD.T-608 +INF EPS WNWR.SFFD.T-609 230.000 +INF . WNWR.SFFD.T-610 +INF EPS SH1L.BRDN.T-279 . +INF EPS SHIL .BRDN. T-280 2O8S.OOO +INF . SHIL. BRDN. T-281 +INF EPS SH1L.BRDN.T-282 +INF EPS SHIL. OTWA. T-287 +INF EPS SH1L.OTWA.T-288 +INF EPS SH1L.OTWA.T-289 +INF EPS SH1L.OTWA.T-290 3276.000 +INF . SB1L.WNWR.T-623 +INF EPS SH1L.WNWR.T-624 . +INF EPS SH1L.WNWR.T-625 238.000 +INF SHIL. WNWR. T-626 +INF EPS SH1L.EDMT.T-599 . +INF EPS SH1L.EDMT.T-600 . +INF EPS SH1L.EDMT.T-601 ll9.000 +INF . SH1L.EDMT.T-602 . +INF EPS SH1L.SFFD.T-615 238.000 +INF . SH1L.SFFD.T-616 +iNF EPS SH1L.SFFD.T-617 . +INF EPS SH1L.SFFD.T-618 O +INF EPS WNPG. BRDN. T-327 7267,000 +INF . WNPG.BRJ3N.T-328 . +INF EPS WNPG.BRJ3N.T-329 +INF EPS WNPG.BI4DN.T-330 +INF EPS WNPG.0TWA.T-335 . +INF EPS WNPG.0TWA.T-336 lO9OS.OOO +INF WNPG.0TWA.T-337 +INF EPS WNPG.0TWA.T-338 . +INF EPS NI3BY.BRDN.T-311 +INF EPS NI3BY.BRDN.T-312 . +INF EPS NRBY. BRDN. T-313 5593.000 +INF . NRBY.BF4DN.T-314 +INF EPS NRBY .OTWA. T-319 4474.000 +INF . VAR X traff ic

LOWER LEVEL MARGINAL NRBY.0TWA.T-320 EPS NREY.0TWA.T-321 EPS NRBY OTWA*Tg322 EPS NRBY.TREN.T-487 . NRBY .TREN-T-488 EPS NRBY.TRI3N.T-489 EPS NRBY .TREN. T-490 EPS NRBY.BAG0.T-491 . NRBY.BAG0.T-492 EPS NRBY. BAGO. T-493 EPS NRBY.BAG0.T-494 EPS NRBY-CDLK-T-471 EPS NRBY.CDLK.T-472 . NRBY.CDLK.T-473 EPS NRBY.CDLK*T-474 EPS PTWW. BRDN. T-343 EPS PTWW.BRDNeT-344 EPS PTWW. ERDN. T-345 . PTWW. BRDN. T-346 EPS

PM-OTWA. T-351 H PTWW.0TWA.T-352 EPS PTWW.0TWA.T-353 EPS PTWW.0TWA.T-354 EPS PTWW.KGTN.T-563 . PTWW-KGTN-T-564 EPS ) PTWW.KGTN.T-565 EPS PTWW.KGTN.T-566 EPS PTWW-QUEBOT-527 . PTWW.QOEB.T-528 EPS PTWW.QUE5.T-529 EPS PTWW.QUJ3B.T-530 EPS PTWW.XTRL.T-547 . PTWW.MTF4L.T-548 EPS PTWW-MTRL-T-549 EPS PTWW.MTRL.T-550 EPS PTWW.TOR0.T-555 EPS PTWWoTORO.T-556 PTWW.TOR0.T-557 EPS PTWW.TOROoT-558 EPS ESQT ..BRDN 0.T-3 5 9 . ESQT*BRDN- T-360 EPS I3SQT.BRDN.T-361 EPS ESQT .SRDN T-3 62 EPS ESQT.0TWA.T-367 EPS ESQT.0TWA.T-368 EPS ESQT-OTWA.T-369 ESQT.0TWA.T-370 EPS ESQToHLFXoT-375 . ESQToHLFX-T-376 EPS ESQT.HLFX.T-377 EPS VAR X traf f ic

LOWER LEVEL UPPER MARGINAL ESQT.HLFX.T-378 . . +INF EPS COMX. BRDN.T-383 . 5658-000 +INF . C0MX.BRDN.T-384 . a +INF EPS C0MX.BRDN.T-385 œ . +INF EPS C0MX.BRDN.T-386 +INF EPS C0MX.OTWA.T-391 . 3695-O00 +INF COMX.OTWA-T-392 . +f NF EPS C0MX.OTWA.T-393 . . +fNF EPS C0MX.OTWA.T-394 . 0 +INF EPS C0MX.TREN.T-459 577.000 +INF . C0MX.TREN.T-460 . . +INF EPS C0MX.TREN.T-461 . +INF EPS C0MX.TREN.T-462 . +INF EPS C0MX.MTRL.T-399 . +INF EPS C0MX.MTRL.T-400 . œ +INF EPS C0MX.MTRL.T-401 . œ +INF EPS C0MX.MTRL.T-402 . 577.000 +INF C0MX.CDLK.T-407 1039 .O00 +INF C0MX.CDLK.T-408 . . +INF EPS COMX-CDLK.T-409 +INF EPS COMX-CDLK.T-410 . O +INF EPS i3DMT.BRDN.T-415 . 9356.000 +INF . EDMT. BRDN-T-416 . . +INF EPS EDMT.BRI3N.T-417 . +INF EPS EDMT. BRDN. T-418 . +INF EPS EDMT. BRDN. T-447 . +INF EPS EDKT.0TWA.T-423 O 3133.200 +INF . EDMT.0TWA.T-424 . . +INF EPS EDMT.0TWA.T-425 . +INF EPS EDMT.0TWA.T-426 . +INF . EDMT.0TWA.T-449 4468.800 +INF EDMT. TmN. T-47 5 . +INF EPS EDMT.TREN.T-476 . +INF EPS EDMT.TREN.T-477 . . +INF EPS EDMT.TREN.T-478 . +INF EPS EDi4T.KGTN.T-587 . . +INF EPS EDMT.KGTN.T-588 . . +INF EPS EDMT.KGTN.T-589 319.400 +INF . EDl4T.KGTN.T-590 îO.6OO +INF . EDI4T.QUEB.T-535 . +INF EPS ED24T.QUEB.T-536 390.000 +INF O EDMT.QüE5.T-537 . . +INF EPS EDMT.QüEB.T-538 . . +f NF . EDMT.WNb7R.T-579 S85.000 +INF . EDl4T.WNWR.T-580 O +INF EPS ED24T.WNWR.T-581 . . +INF EPS EDI4T.WNWR.T-582 . . +INF EPS EDMT.SH1L.T-595 . . +INF EPS EDMT.SH1L.T-596 . +INF EPS EDMT.SH1L.T-597 58S.000 +INF . VAR X traffic LEVEL UPPER MARGINAL EDMT.SH1L.T-598 . +INF EPS EDMT.SFFD.T-571 S8S.OOO +INF

EDi4T.SFFD.T-572 0 +INF EPS T3DMT.SFFD.T-573 . +INF EPS EDI4T.SFFD.T-574 +INF EPS SFFD.BRDN.T-431 . +INF EPS SFFD. BRDN. T-432 . +INF EPS SFFD.BRDN.T-433 . +INF EPS SFFD.BRDN.T-434 2965.000 +INF SFEï3.BRDN.T-451 . +INF EPS SFFD.0TWA.T-439 . +INF EPS SFFD .OTWA. T-440 . +INF EPS SFFD.0TWA.T-441 2372.000 +INF . SFFD.0TWA.T-442 . +INF EPS SFFD.OTV7A.T-453 . +INF EPS SFFD .WNWR.T-603 +INF EPS SFFD .WNWR.T-604 0 +INF EPS SFFD .WNWR.T-605 +INF EPS SFFD .M.T-606 237.000 +INF . SFFD.SH1L.T-611 . +INF EPS SFFD.SB1L.T-612 . +INF EPS SFFD.SH1L.T-613 . +INF EPS SFFD.SH1L.T-614 lï8.OOO +INF SFFD.EDMT.T-575 Iï8.000 +INF . SFFD.EDMT.T-576 . +INF EPS ) ÇFFD.EDMT.T-577 . +INF EPS SFFD.EDMT.T-578 . +INF EPS ---e VAR C This variable is used ta find out the type of capacity of each link of the 25-node network. LEVEL UPPER MARGINAL BRDN .OTWA 44736.000 BRDN. TREN 44736.000 BRDN .MTRL 44736.000 BRDN .TORO 44736.000 BRDN. SHIL 44736.000 BRDN ,WNPG 44736.000 BRDN. NRBY 44736.000 BRDN. Pm OTWA. BRDN 44736.000 OTWA. TREN . OTWA .KGTN 44736.000 OTWA .QüEB 44736.000 OTWA .MTRL 44736.000 OTWA .STJN 1544. 000 OTWA .Pm 44736,000 TREN .BRDN 44736.000 TREN .OTWA TREN .RGTN lS44.000 TREN .TORO lS44.000 KGTN .OTWA 44736.000 KGTN .TREN lS44.000 KGTN .MTRL 6312.000 QUEB .OTWA 44736.000 QüEB. MTRL 44736.000 ) QUEB.GAGE 44736.000 ' QUEB .BAGO 44736.000 MTRL .BRDN 44736.000 MTRL .OTWA 44736.000 MTRL .KGTN 6312.000 MTRL. QUEB 44736.000 MTRL .GAGE 44736.000 MTRL .HLFX 1544.000 MTRL .BAGO w MTRL .STJN 6312,000 GAGE. QUEB 447 36,000 GAGE. MTRL 44?36,OOO GAGE. GRWD 6312.000 GAGE. HLFX 44736.000 GAGE. SHWR 63l2.000 GRWD -GAGE 6312.000 GRWD .HLFX 1544.000 HLFX .MTRL 1544.000 EiLFX .GAGE 44736.000 HLFX .GRWD 1544.000 HLFX. SHWR l544.000 HLFX .GSBY 1544.000 HLFX. STJH 44736 .O00 SHWR. GAGE 63l2.000 SHWR. HLFX 1544.000 TORO. BRDN 44736.000 TORO. TREN 1544.000 GSBY. HLFX 1544.000 GSBY. BAGO 6312.000 ---- VAR C capacity

LOWER LEVEL UPPER MARGINAL

GSBY. STJH O lS44.000 +INF BAGO. QrnB 44736.000 +INF BAGO. MTRL . . +INF BAGO. GSBY . 6312 .O00 +INF STJN OTWA lS44.000 +INF STJN .MTRL L 6312.000 +INF ST3H. HLFX 0 44736.000 +INF STJH. GSBY . lS44.000 +INF CDLK. WNWR . 44736 .000 +INF CDLK .NRBY . . +INF CDLK. EDMT . 6312.000 +iNF WNWR .CDLK w 44736.000 +f NF WNWR. SRIL 44736.000 +INF WNWR .EDMT 44736.000 +INF SHIL. BRDN . 44736.000 +INF SHIL. WNWR . 44736.000 +INF SHIL. WNPG . 44736.000 +INF SHIL, SFFD . 44736.000 +INF WNPG .BRDN . 44736.000 +INF WNPG .SHXL 44736.000 +INF WNPG .NRBY 44736.000 +INF WNPG. ZDMT . +INF WNPG .SFFD . 6312.000 +INF NRBY. BRDN . 44736.000 +INF ) NRBY.CDLK . +INF NRBY. WNPG 44736.000 +INF NRBY .PTWW . 44736.000 +INF PTWW .BRDN . +INF PTWW. OTWA . 44736.000 +INF PTww.NRBY . 44736.000 +INF ESQT ,COMX 1544.000 +INF ESQT .SFFD . 44736.000 +INF COMX. ESQT 1544.000 +INF COMX .EDMT . 1544.000 +INF COMX. SFFD 44736 O00 +INF EDMT .CDLR 6312,OOO +INF EDMT ,WNWR . 44736.000 +INF EDMT .WNPG . . +INF EDMT .COMX . 1544.000 +INF EDMT .SFFD O 44736.000 +INF SFFD .SHIL . 44736.000 +INF SFFD .WNPG O 63 12.000 +INF SFFD .ESQT 44736.000 +INF SFFD COMX O 44736.000 +INF SFFD .EDMT . 44736.000 +INF LOWER LEWL UPPER MARGINAL ---- VAR COST COST total invetsment cost ---- 2240 PARAMETER REPORT This report shows the traffic that uses each link. This is the summation of al1 traffic using the links. BRDN .OTWA BRDN .TREN BRDN MTRL BRDN. TORO BRDN. SHIL BRDN .WNPG BRDN. NRBY OTWA .BRDN OTWA. KGTN OTWA .QUEB OTWA .MTRL OTWA .STJN OTWA. Pm TREN .BRDN TREN ,KGTN TREN .TORO KGTN .OTWA KGTN .TREN KGTN .MTRL QUEB .OmA QUEB .MTRL QUEB .GAGE QUEB .BAGO MTRL .BRDN MTRL .OTWA MTRL .KGTN MTRL. QUEB MT- .GAGE MTRL .HLFX MTRL .STJN GAGE .QüE B GAGE. MTRL GAGE. GRWD GAGE. HLFX GAGE. SHWR GRWD .GAGE GRWD .HLFX HLFX .MTRL HLFX .GAGE HLFX. GRWD RLFX .SHWR HLFX .GSBY HLFX. STJH SHWR .GAGE SHWR .HLFX TORO, BRDN TORO. TREN GSBY .HLFX GSBY, BAGO 2240 PARAMETER REPORT MZP

BAW. QUEB ll6O4,6OO BAGO ,GSBY 531.000 STJN. OTWA 1063.800 STJN ,MTRL 5365.200 STJH. HLFX 10872 ,000 CDLK-WNWR 5989.000 CDLK, EDUT 740,000 WNWR. CDLK 3893.000 WNWR. SHIL 2lSl7,OOO WNWR. EDMT lE5.000 SBIL. BRDN 30714.600 SRIL, WNWR Sl99.000 SHIL .WNPG 33196,000 SHIL. SFFD 17648,000 WNPG, BRDN 33719.400 WNPG, SHIL lO929.OOO WNPG .NRBY 28876.000 WNPG, SFFD i031.000 NRBY .BRDN l43l4.000 NRBY .WNPG 9649.000 NRBY. Pm l98l9.000 PTWW. OTWA 32256.000 Pm.NRBY SïO5.OOO ESQT. SFFD l8916.000 COMX .EDMT l276.OOO ! COHX.SFi?D lO5O7.OOO EDMT .CDLK lO39.OOO EDMT .WNWR lll79.000 EDMT .SFFD 9937.000 SFFD. SHIL 38025.600 SFFD ,WNPG 5365,200 SFFD. ESQT 4746.000 SFFD .COMX 4S40.000 SFFD .EDMT 7591.000 ---- 2240 VARIABLE B.L Finally, this variable is used to find the specificlinkcapacity, usingaletterto summarize what type of capacity each link haa.

BRDN .OTWA BRDNm TREN BRDN MTRL BRDN TORO BEtûN. SHIL BRDN. WNPG BRDN. NRBY OTWA- BRDN OTWA .KGTN OTWA. QUEB OTWA .MTRL OTWA. STJN OTWA .PTWW TREN .BRDN TREN .KGTN TREN a TORO KGTN .OTWA KGTN .TREN KGTN .MTRL QUEB .OTWA QUES. MTRL QUEB .GAGE QUEB BAGO i M,.B,, MTRL .OTWA MTRL .KGTN MTRL .QUEB MTRL .GAGE MTRL .HLFX MTRL. STJN GAGE. QUEB GAGE. MTRL GAGE. GRWD GAGE. HLFX GAGE. SHWR GRWD .GAGE GRWD .HLFX HLFX .MTRL HLFX .GAGE HLFX .GRWD HLFX. SHWR HLFX .GSBY HfiFX .STJH SHWR .GAGE SHWR.HLFX TORO. BRDN TORO. TFtEN GSBY .HLFX GSBY. BAGO GSBY. STJü BAGO &UEB BAW&S3Y STJN .OTWA STJN ATRL STJH. HLFX STJR. GSBY CDLK .WNWR CD=. EDMT WNWR. CDLK WNWR. SHIL WNWR.EDMT SHIL. BRDN SHIL IWNWR SHIL .WNPG SHIL -SFFD WNPG .BRDN WNPG .SHIL WNPG .NRBY WNPG .SFFD NRBY .BRDN NRBY .WNPG NRBY. PTWW PTWW*OTWA Pm.NRBY ESQT. COMX ESQT. SFFD ! COMX.ESQT COMX .EDMT COXX. SFFD EDMT. CDLK EDMT .WNWR EDMT .COMX EDMT .SFFD SFFD .SHIL SFFD .WNPG SFFD .ESQT SFFD. COMX SFFD .EDMT

Annex I

Annex 1

Annex I

Annex 1

Annex J

Probability Density Functions (PDF)

CFB BagoWe Annex J

CFB BORDEN

l ...... - CFB COLD LAlKE Annex J

CFB COMOX

CFB EDMONTON

CFB ESQUIMALT Annex J

CFB GAGETOWN

CFB GREENWQOD

CFB GOOSE BAY Annex J

CFB HALIFAX

CFB KINGSTON

CFB MONTREAL Annex J

CFB NORTH BAY

CFB OTTAWA

CFB PETAWAWA Annex J

CF% VALCARTIER (QUEBEC)

CFB SUF'FIELD

CFB Sm0 Annex J

CFB ST-JOHN'S

CFB ST-mm Annex J

CFB TORONTO

CFB TRENTON

CFB WINNIPEG Annex J Process Model Repott tfc~en-canada - .-1MonMay1511:W.411995 1 Pagelof17 , ..* . .. . . 1 O*. hnex R

xess Model Att ributes , ,m*bute value tvpe . default value interamval time promoted double 0.001 (seconds) packat size prcmoted integer 1000 (bits) cal1 wait time prornoted double 10 (seconds) cal duration promoted double 1,000 (seconds) . mv addr ~rom~ted inte~er -1 AAL type promoted integer 5 (1,234 or 5) QoS class momoted strincl A (A.8.C or D)

Rincltide "ams-interf aceç .h" #inchde "ams-aal-inter faces. h"

/* Thme are tmnsirion conditions. */ #define SIGNAL ((op-intrpt-w O == OPC-INTRPT-REMOTE) && \ (op-intrpt-code O =AMSC-INTEFFACE-SIGNAL))

#define ESTESTCON (primitive =AMSC-AALESTAB-Con)

#define RIZ-IND (primitive == AMSC-AALAAL,RIZEASE-Ind)

#defie REL-CON (primitive =AMSC-AAL-RELEASE-Con)

#define CALL-=ART ((op-intrpt-type O = OPC~~-S~&& \ (op-in trpt-code 0 == AMSC-TGEN-CALLSTARï))

#define CALL-END ((op-intrpt-type O = OPCtypeINTRPTSELF)&& \ (op-intrpt-code O =AMSC-TGEN-CALL-END))

#define NEIGHBOR-NOTIFY ((op-intrpt-type O = OPCtypcINTRPTINTRPTREMOTE)&& \ (op-intrpt-de O =AMSC,NEIGmOR-Nom)

#define NOTIFY-COMPLETE (ams~neigIibor_ootifyyisiscomplete(nbr-data-ptr) = OPC-TRUE)

/* These are the am-îrafjcn scl/inrcrnrpt codes. */ #define AMSC-TGEN-CA LL-START O #define AMSC-TGEN-CALL-END 1 #define AMSC-TGEN-DATA-GEN 2 1 Process Modef Report: tfcjen-canada 1 MmMay1511M41 1995 Page2of 17

p Variable Block . .

int ' ùiebug-mode: int backa-size; Distribution* %nt-amival-distptr; Distn'bidion* bii-wait-distptr; Distn'bution* bii-duration-distpu; Dismiution* 'uiest-addr-ptr; double hvg-rate; Objid bal-module-id; Ici* ksi-handie-iciptr; Evbandle kext-packet-arrival; Evhandle bill-end-intrpt: int West-addr; int ùny-addr; char kid-string [128]; int ho-aai-st team-index; Objid -id; int UL-type; int \qos-class: AmsT-Traf-Contract* Lraf-con-pt r; ArnsT-Neighbor-Data Libr-data-ptr;

Ternporaw Variable Block double in t-an-tirne; double dl-wai t-the; int primitive: double cail-duration: Pac ket* P~P~G Ici* if-iciptr; AmsT-Traf-Contract* tmp-traf-con-ptt; double pcak-cehate; char qos-clas-string [ml; double cdv-tolerance;

Function Block void am-traf-g-br- intrpt-proc (ndata-ptr, ndesc-ptr, state-ptr) AmsT-Neighbor-Data* ndata-ptr: K- 2 i Proces Model Report: tfc_gen_canada 1 Mon May 15 ll:M41 1995 1 Page3 of 17

1* SwiicA hedon the AMS ppe. switch hdesc-ptr->module-am~type) C case AMSC-MTYPE-AAL:

/*Build the ver@ desc data stmchtre. vdescmod-id = my-id: vde5c.n b r-i d = ndesc-ptr->modde,objid; vdesc.nb r-i d-pu = &aal,moduie,id; vdesc.mod,name = "AMS Traff ic ~enerator"; vdesc.nbr,narne - "AAL" ;

l* Vena thai the nckhbor Iras the correct /* characteristis. ams-neighbor-verify (&vdesc):

break; 1

default: C l* Inis is an unerpeczed wighbor noR@xan'on 1* I'ue emrmkge */ op-Sm-end ("~rocessreceived a nei~hbornotification from a module", "of an unexpec ted type. Simulation teminated .", OPC-m. OPC-ML);

break; 1 1

FOUT; 1

void ams_ttaf-gen~~puriow;signa1~handleO { Ici* if-iciptr; Ici* relcasecaSeif,iciptr; int primitive; Ici* 11-handte-iciptr; Packeî* ph'% -- r~rocessModel Report tfcjen-canada 1 Mon May15 11:04:.41 1995 1 Page4of 17 I

if (SIGNAL) ( P 7&ls ir a siplfmm the AAL

/* Obîah the ICIpointer. if-iciptr = op-intrpt-ici O;

/* Obtain the primitivefmm the ICI. op-ici-attrxet (if-iciptr, "primitive", &primitive) ;

I* Obrabt the 'lower Iayer Iu~ndZe'frornthe ICI. op-ici-amxet (i f-iciptr, "lower layer handle", &Il-handle-iciptr) ;

/* Swirch on rhe 'primitive'. */ switch (primitive) ( case MC-AAL-ESTAB-Ind: { /* This is an 'lestoblkh indi~~1~0n'~ornthe AAL

opjrgodb_p~t-major(pid-string, "Received spurious AAL ESTABLISH Request signal. ", "Cal1 not accepted .", "Sending AAL RELEASE Request signal. ", OPC-NIL); 1

/*Set the 'upper ùiyer hczndle' in the inteqace y 1* ICI for the 'establish indication' s-4 since */ /*the io wer layer expedr IIto befiIled in */ /*ICI is not desmye4 since thk is a fomd */ /* Vstemptand the lower hyer pmcess expecs */ 1* to obtaùt the hadefi-om the ICI whm the */ I* c0mI mm Y op-ici-attr-set (if-iciptr. "upper layer handle". OPC-W);

/* Simpiy send an AAt-RELE4SE-Reg to request thut V /*the comection be released */ release-if-iciptr = op-ici-create (AMSC-INTERFACE-ICD; op-ici-attr-set (rdease-if-iciptr, "primitive", AMSCAL-RELEASE-Req); op-ici-am-set (celeme-if-iciptr, *"lower layer handle". Il-hancile-iciptr); op-ici-install (release-if-iciptr) ;

/* Send a mote intempt which wiZZ cany the ICI to the AAL module. Y op-hû=pt-sc heduie-remote (op-sim-the O, AMSCJNTERFACE-SIGNAL, aal-moduie-id) ;

case AMSC-ML-RELEASE-Con: G.- K-4 Process Madel Report: WC-gen-canada ( MonMay 15 11:04:42 1995 1 Page 5 of 17 .*. . **.

P Th& is a 'releose confm'/i.om the AAL Y

if (LTRACE-ACTIVE) ( opqrg-odbgrinttmqjoc (pid-g, "Received spurious AAL RELEASE Conf irm signal. ", "This is in response to AAL RELEASE Request terminating spurious connection, 1

1* mis a response to our earlier 'eleuse /* request' whùh was a response to the Pspu~rrs'estab indicati;on'. l* Do nothhg other rhm demvy the ICI. op-ici-d-y (i f-itiptr) ;

default: { /* ï%&k some other cornpletely ~tnexpecred l* signaf Issue error message and tem-t te /* sùnulatiiin

op-sim-end ("~eceived unexpec t ed signal. " , " ", "'@ O t"'); } 1 1 eise if (op-intrpt-type O =OPCtypeiNTRPTINTRPTSTRM) { 1* This isa spuriorcs packet ammval.The am-tmfjen 1* just dmysthk packet if (LTRACE-ACTIVE) { op~rg-odbq~t-major(pid-string, "Received spurious DATA packe t ,.", "ûestroying the packet, ". OPC-NIL); 1

/* Get the packetfiornt the stream and datroy r% pkptr= opgkJet (op-intrpt-strm O); - opgk--y (pkptr): 1 else { 1* TMis some other cornpktely unexpected /* intempc. Isue emr message and tennkte /*simuhtion. op-sim-end (''~eceivedunexpec ted interrupt ."," "."", " "1: 1

FOUT; 1

Diaanostic Block Process Model Report: tfc~en-canada 1 Mon May 15 11.94:42 1995 1 Page 6 of 17 I

forcedstate lNlT . , am'bute value tvpe default value name INIT string st enter execs (See below.) textlkt (See below.) exit execs (empty) textlist (e mpty) status fomed toaclle unforced

tNlT /* DetennUte rhe inititll values ofthe mevarUlbles und set up */ 1* the initial state of thk rirstontiation of the am-tmfjen *1 /*procm */

/* Obmh the object ID ofthk process' pammodule, my-id = op-id-self 0;

/* Obtaùt the amibute valuesfor the packet ïnterammval */ /* the, sire, wait the between cal&, call duration, and */ /* destîmtion atfdms. These values are proeess amibutes. */ op,ima~bj-aîtr~et*id, "interarr ival time", &ht-an-thne); op-ima-obj-am-get (rnyid, "packe t size" .&packet-si& : op-ha-obj-attr_get -id. "cal1 wai t t irne", &~all,wait~thne); op-ha-obj-attrjet by-id, "cal1 durat ion". &call,duration): op-ha-objam~et -id, "rny addr " .&my,addr): 0-a-obj-attr~et Gny,id, "QOS cïass ".qùs,class_svin& op-ha-obj-attrjet by-id. "AAL type" ,&AAL-type ;

/* Convert the Qualis, ofSemice chschanteter UIto */ I* the irzdex value and check its valid@. */ ams-q~~~ciass-char~ta~hdex~~~nv~(qos,class-string [O], &qos-ciass): if (qos,class =z AMSC,QOS,CLASSSSüNDEF)

/* 77te QoS Cbvalue is Vlvalid Issue emrmessage */ /* adtennUtcIte the simulation */ op-sim-end ("~pecifiedQuality of Service Class attribute value is mvalid.", "Value must be 'A', 'B', 'CI, or 'D' .". "" .'lm 1; 1

f* tood in the packet inte~m'vaLcall woü and cdduratibn r* dism'butio~~~~, int-arrivai-disgr = op-dis-Ioad ( "exponent ial" , int-arr-time, 0.0) ; Ai-wai t-distpt r = op_distdistload(" exponent iaï", call,wait,time, 0.0) ; xiii-duration-distptr = opdistpdistdistIoad("exponent ial" ,call-duration. 0.0) ;

'* ïï&/rurction wiU select addresses correspondhg !O tlieir PDF */

switch (my-ad&) { case O: { dest-addr-ptr = op-dist-load ("O twa" ,O.O. 0.0): break 1 case 1: { dest-addrstr = op-dist_Ioad (" brdn".O.O. 0.0); K- 6 1 Process Model Report: tfc~en-canada 1 MonMay1511.94421995 1 Pageirof 17

break: 1 case 2: { dest-addr-ptr = op-dist-load ("shwr".O.O. 0.0); brieak; 1 case 3: ( destdestaddr-ptt=0p~dist~1oad ("esqt ",O.O, 0.0); break; 1 case 4: { dm-addr-ptr = opaddistdistload("comx",O.O, 0.0): break; 1 case 5: { dest-addr-ptr = op-dist-load ("edmt ".O.O. 0.0) ; break

break; 1 case 10: ( dest-addr-ptr = opaddistJ0ad("wnpg".O.O. 0.0) ; break; 1 case 11: ( dest-addr-ptr = op-dist-10ad ("nrbyt',O.O, 0.0); brieak; 1 case 12: ( da-addr-ptr = op-distdistIoad("ptww" ,O.O. 0.0); break: 1 case 13: { des-ad&-ptr = op-dist-load (" toro",O.O, 0.0); break; 1 case 14: { desî-ad&-ptr = op-dist-load (" t ren" ,O.O, 0.0); break; 1 case 15: { dest-addr-ptr = op-a-load ("kgtn" ,O.O. 0.0); break: 1

case 17: ( dest-addr-ptr = op-dist-load ("mtrl ".O.O. 0.0); break; 1 case 18: { dest-adrtr~tr= opaddistdistload(l'gsby".O.O, 0.0); break: 1 case 19: { dest-addrstr = op-dist-1oad ("queb" .O.O. 0.0): break; 1 case 20: ( destesteddr-ptr= op-dist-load ("s t jnm,O.O, 0.0); brieak; 1 K- 7 case 21: { dest-addr-ptr = op-dist-load ("gage"nO.O.O.O); break 1 case 22: { dest-addr-ptr = optrdistdistld("gswd".O.O, 0.0); bieak: 1 case 23: ( dest-addr-ptr = opLctiStctistlad(" st j h" ,O.O. 0.0); break 1 case 24: { dest-addr-ptr = op-distdist10ad("hl fx" ,O.O. 0.0); break; 1

/* Compte the peak cell mte in brts/secutd which is set to 5 */ /* *es the average cell rate in th& exanple. */ peak-cell-tare = (5.0 / int-rr,,time) * (packet-size / AMSC-ATM-CEU-DATA-SEE);

/* Use the defauit Cell Delay Variation (CDV) tole~ncefor the /*specijk QoS class. cdvYtoleraace = ams-CDV-tolerance-default-obtain (qos,cl ass) ;

/* Create a tram comctfor calk or@hnting/mm thk src /* There ts no retum tru$ï.c, but allocate a bit LI * PCR) of /* bandwùith anyway. traf-con-ptr = amsamst.raffic,convact-create(peak-œii-rate, peak-eii-tate * 0.1, cdv,talerance, cdv-tolerance) ;

/* detemine whether or no? the simularion tk in debug mode. debug_m& = op-sim-debug 0:

/*InitÜtlrie the AAL modub object ID to NWvalue. */ ad-module-id = OPC,OEJD-NuLi.;

/+ Genemte PID dtSpùiy sîring. */ mtf (pid-string. "ans-t racgen PID (%d ".opjro-id (opgm-seif O));

/* Obtain and se& our neighbor infomtiot */ nbt-data-ptr = am-neighbor-data-build O; ams,neig?hr,notify (nbr-datastr, AMSC-MTYPE-AAL-CLIENT);

, attrr'bute value type default value narne -1 string tr condition string \F executive string “or RGB333 color RGB333 nrin~stvle spline toaale s~line ?

unforced &te config attribute value me default value name config string st K- 8 1 Mon May1511:M421995 1 Page9of 17 1

iter execs (em pty) textlist (empty) exit execs (See below.) textlist (See below.) status unforced toarrle unforced

confia - /* Anis-trafjen apecis either a ne&hbor no~@ation Urremîpr; Y l* or a speuss@L Y if (NnGHBO~OTIFY) { /* Ink is a 'wi'ghbor notz~'si&aL Y if (LTRACEACTrW f op~r&,odbjrint_major(pid-g, "Received neighbor notification .", OPC-NIL); 1

, transition confiq -r confia attn'bute value fype defa ult value . name tr-0 string tr condition default string executive string

color RGB333 color RGB333 I I drawin~stvle soline toclale spline l I I / trami'tion confia -,schedule ' I , amibute value me defa ult value 1 1 name tr-2 string tr 1 / condition NOTIFY-COMPLETE string - executive string color RGB333 color RGB333 1 drawina stvle s~line tomle spline

L i 1

forced -te schedule #, attribute value - tyoe default value t name schedule string st i -?ter execs (See below.) textlist (See below.) I i : execs (e mpty) textf ist hpW) 1 -~atus forced toaale unforced 1 - mnsftion schedule -, idle . .

, affrr'trote . value . dehult value name tr-3 string tr condition string executive string color RGB333 color RGB333 drawin~style line tomle s~line

unforced &te idle

amoute value tvpe defaulf value - -- name id1 e stnng st enter execs (e mpty) textlist (em pty) exit execs (See below .) textl ist (See below.) 1 status unforced tomle unforced I

/*Am-mfjeen apectr two Utrempts: /* IIA self inrempt thars&uls a new calL /*2.A spuriom Wempt.

transition idle * idle ! , atû'i'bute value tme default value r' narne tr4 string tr 1 1 condition default string ! executive string I color RG8333 color RGB333 t , drawina style s~line tomle soline . f ( lLSihn idle * start .m'bute value tme defaulf value

name tr-5 string tr l condition CALL-START string executive string 1 ...... forceds&t& start . . ' , atfn06ute- . value defauli value narne staR string st enter execs (See below .) textiist (See below.) exit execs . (8mptv) textlist (empty) status forced toacrle unforced

~WXSstart /*Start a cail by -hg a cal1 open request to the AM Y /*adaptation layer. */ if (LTRACE-ACTIVE) { opqrg-odbgrint-major (pid-string, " Initiating cal1 SETUP. " , "Sending AAL ESTABLISH Reques t signal. ". OPC-m);

/* "Randomiy" select the desruIotion addressfFom the PDF

/* Cwteand set the fi& in the inter/ace ICI. Y if-iciptr = op-ici-create (AMSCJNTERFACE-ICI); op-ici-instaU (if-icipt r) ; op-ici-attr-set (iiciptr. "primitive".AMSCJAL-ESTAB-Req): op-ici-attr-set (iiciptr. " add ress ",destestad&) ; op-iuattr-set (if-iciptr, "cal led past y SAP " .AMSCAA'-~.APJ~NY); op_fQQattrttrset(if-iciptr, '*QOS cïass ", qosOSciass) ; op-id-attr-set (if-idptr, "upper layer handle " ,OPC-m):

op-id-attr-set (if-iciptr, l' AAL type". A&-type) ; op-ici-attr-set (if-iciptr, " t ra f f ic con t r ac t ",tmp-traf-con,ptr) ;

/*Send ta remote ùtrempt whkh wiflcany the ICI to the AAL /* module.

~altslkbn start-> EstCan attn'bute value me defaulfvalue tr-6 string tr string .xecutive string color RGB333 color RGB333 1 drawincl style s~line toasle spline *

K-11 Process Model Repor-t en canada ( MonMay1511W.431995 t Pagel2of 17 . . *W.

. . . ,, .. Cf~r~edstnicEs~CO~I . . ' . :. :atarBute .. . value ...... default value name EstCon string st enter ex- (empty) textiist (empty) exit execs (See below.) textlist (See below .) status unforced toggle unforced

if (SIGNAL)

/* Detemine wAat signal amived /* Obtaùr the Ulte@zce ICI pointer. if-iciptr = op-intrpt-ici O;

/* Obtaùt the priminve value. op-ici-attrjet (if-iciptr. "primitive", &primitive);

/* Swùch ofithe ptimitive value. Y switch (primitive) { case AMSC-AALAAL.ESTAB-Co~ ( /* The sI;Pml is an AAL ESTABLISH ConfislgnaL */ /* The co~ectwnhas been establrSIced */ if (LTRACE-Am) opqrg-dbqrht-major (pid-g, "~eceivedAAL ESTABLXSH ~onfinnsignal. ", "~onnectionestablished.", OPC-~);

/* SchedcIle the cal! end evenl, Y cdl-end-intrpt = op-intrpttscheduieLself (op-sim-time 0 + op_dist_outcorne (dl-duation&stptr). AMSC-TGEN-CALL-END) ;

case AMSC-AAL-RELEASE-hd: { /* me siplLr an AM RELEASE Indiadon siwL */ /* The connection Iras been temhated Y if (LTRACE-ACiïVE) op_pF&odbj~t-major(pid-string, ''~eceived AAL RELEASE fndicat ion signal. ", "Connect ion terminated .", OPC-m); 1 ~rocess~odd ~eport; tfc~en-canada 1 Mon May15 11:04:43 1995 1 Page 13of 17

tr-7 string , qdition default string .ecutive string color RG8333 color RGB333

A drawina stvle s~line toaale s~line

trmsitiùn EstCon -> data cren

affribute value me default value l name -1O string tr condition EST-CON string execut ive string color RGB333 color RGB333 drawina stvle s~line - togaie spline J

I tram*ihn EstCon -B schedule ! attribute value tme default value l1 tr 11 string tr i name 1 condition RËL-IND string i

executive string fA color RG8333 color RGB333 drawina stvle Iine toarrle spline 4

' -forcedstar data aen ribote value Me default value ,lame data gen string st enter execs (em pty) textlist (em P~Y) exit execs (See below.) textlist (See below.) , status unforced toaqle unforced , K- 13 1 MonMay1511:0443 1995 1 Page l40f 17 1

data aen . .

/*Detemine Yth& 3 an AAL SI&~ if (SIGNAL) { /+ Obtpin the hteglace ICI and encioseiiprimin've. if'iciptr = op-intrpt-ici 0; op-ici-*jet (ifJciptr, "primitive". &primitive):

/* Ifiheprimihve is 'release indiùztwn', */ /* cancel the cal1 end and data gen inhpts; */ /* othenvise, ilte primihve indicares a Y l*spuriOw s&?taL */ if (primitive =AMSC-AAL-RELEME-hd)

i* Thk & a 'rekase indication' sf;P~l */ if (LTTUCE-ACTiVE) ~pgrgodbgrint~rnajor(pidag, "Received AAL RRIEASE ïndicat ion signal. *' , "Connection terminateci. ". OPC-NIL);

/* Caneel the 'cal1 end' and 'genemtedata' eventr, op-ev-cancel (next-packet-adval); op-ev-cancel (cd1-end-intrpt) ;

/* Destroy the ICI.

'*Detemhe wkiher thk btierrupt k a se~inrempt '*th Uidicc1te.s the &-O fall :Ise if (W-END) { /* miS 13 a selfhtem~prthat indicates teh endaf-colt. if (LTRACE-ACTNE) { opqrg_odbjrint-major @id-string, n nit iat ing cal1 END. ". "Sending AAI, RELEASE Reques t signal. ", OPC-m); 1

P Cuncel the cumntpacket amnival htempt op-evV~lbextgacket-acrival);

1* NOL@ rkAAL tht the cal1 12 cornpiete. Y if-itiptt = op-ici-mate (AMSC-INTERFACEJCI); op-id-attr-sct (iiciptr. "primitive". AMSC-AAL-RELEASE-Req); op-ici-attr-set (if-iciptr, " lower layer handle". aai-hande-iciptr); 1 Process Madel Report: tfcsen-canada 1 Mon May15 1l:W.43 1995 1 Page 15of 17

else { /* mis is a @erute dota' event Y if &TRACE-ACTIVE) op>-odbq~t-major (pid-. "Sending DATA,", OPC-m);

/* Cmte a &ta packet and send to the A& pkptr = opqk--te (packet&& opgk-send (pkptr. to,aal,stream-index):

value dehult value i -12 string tr condition default string executive string color RGB333 color RGB333 drawina style s~line torisle spline I J1 &amirion data aen -> schedule 1 attribi.de value tme defauft value 1 name LI3 string tr i

condition REL-IND string Il executive string color RGB333 color RGB333 E . drawina style line tomle spline 1 xirion data gen - RelCon Aute value tme de fault va lue name tf-14 string tr condition CALL-END string executive string Process Modei Report: WC gen-canada 1 MonMay1511:M43 1995 1 Page l60f 17 *.*...

' . .. unforcedsiafe RelCon . .. _...... -...... amibute . , . .value. me . default value ' name ReiCon string st enter execs (empty) textlist (empty) exit execs . (See below.) textlist (See below.)

A status u nforced tomle u nforced

. . . .. /* nis smte expects wo pwible interup&.- Y /* 1. An AAL RELE4SE Con- sipl Y /*2A spu~ussI;QMI. Y

/* Detemine whtsijpi am-ved /* ObtaUs the litterface ICI and mclosedprUnfive. if (SIGNAL) { if-icipîr = op-intrpt-ici O: op-ici-attr~et (if-iciptr, "primitive". &primitive) ;

/* YrlirS & a 'AMRELEASE CoqfZh' sipL do nothhg; */ l* otherwke, th& isa spuriorcs srgML if (primitive =AMSC-AAL-RELUE-Con) { /* mis k a 'AAL RELEASE Confm'si~l, */ if (LTRACE-ACTIVE) opgrgodb9rint-major (pid-string, "Received RGLEAÇE Conf irm signal. ", "Cal1 END complete,","Connection terminated.",OPC,~);

/* Demvy the ICI.

&tion RelCon schedule artr!'bute value me default value narne tr-15 string tr condition REL-CON string executive string K- 16 Process Model Reportz tfc_gen-canada 1 MonMay 1511:M43 1995 1 Page 17of 17 ......

,lor RGB333 wlor RGB333 1 drawina style line toaale s~line

name tr-16 string tr condition default string execut ive string color RGB333 color RGB333

; drawint style soline toaale s~line Environmental File

# Environment File for network model: canada961 # Vimiai Path Link configuration file vp_conf?g-file:amsvp-configl # Defauit Cell Delay Variation (CDV)Tolzrance per QoS class. class-A-CDV_tolerance:0.000250 class~B~CDV~toleran~e:O.OOO5OO class-C-CDV-tolerance: 1 .O00000 class-D-CDV-tolerance: 1.O00000

# These attributes are used for each seperate simulation m. COMX.*.traf"src.interarrivalaltime:0.0008087 ESQT. * .traf'src.inter~vd~time:0.000493 8 EDMT.* .traf'src.interarrivalaltime:0.0004791 SFFD. * .traf'src.interarrivalaltime:O.OO15749 CDLK.* .trafnc.interdvaialtime:O.OO 1 3 878 WNWR. * .traf-src.interarrivalaltime:O.OO 16229 SHIL.*.traf-src.interarrivalaltime:O.OO 15678 WNPG.* .trafd~c.interarrivalaltime:0.000514 NRBY.*.traftrafsrc.interarrivalaltime:0.000835 Pm.* .td-src.inter~valaltime:0.0007207 OTWA.* .traftrafsrc.intedvalaltime:0.O001757 BRDN.* .traftrafsrc.interarrivaiaitime:0.0007171 TOR0.*.traf_src.interanivalaftime:0.0008062 TREN.*.traf src.interarrivalaltime:0.0007107 KGTN. * .traf~src.interanivalaltime:0.0007481 MTRL. * .traftrafsrc.inter~valaltime:0.0006501 BAGO. * .traf-src.inter~valaltirne:O.OO143% STIN.*.traf_src.intelzimvalaltime:O.OO 14527 QUEB .* .traf src.inter~vai~time:0.0007174 GAGE.* .trafsrc.inter~valaltime;O.OO13629 GRW. * .traf~m.interarrivalaltime:O.OO14786 HLFX.* .traf-src. interarrivalaltime:0.0004468 SHWR.*.traf~src.interarrivalaltime:O.OO149 14 . STJH. * .traf-sic. inter arrivai-time:0.000S 59 GSBY .* .traf-src.interarriva1-time:O.OO 14562

# Compound ce11 mode compound_cell-enabled: O # Global statistics collection ams-aal5-ete-delay: 1 ams-aal5-e te-delay-variation: 1 Annex L

ams-atm-ete-deiay :l amsatm-CDV: 1 ams-atrnQ0S-A-ete-delay : 1 amsatm QOS-B-ete-delay :l amsatm1~0s-c-ete-de~a~: 1 ams-am-QOS-D-ete-deIay : 1 ams atm QOS-A-CDV:l ~~~I~~~~QOS-BCDV:1 amsatm-QOS-C-CDV: 1 am-atmQOS-D-CDV: 1 ams-atxnQOS-A-CLR: 1 ams-atmQOS-B-CLR: 1 ams-atmQOS-C-CLK 1 ams-atm-QOS-D-CLR: 1

# Required for AMS custom animation netname: canada961 Annex M

Configuration File

# File: amsamsvpvpconfîg.gdf # Content: Example configuration file for static VP link definitions. # # Format: "user id" "data rate (Mbk)" "QoS class (0-4)" "delay (sec.)" ''bit error rate"

# Constraints: #1. Repeated "user id" vaiue indicates different WCon same VP link. #2. "data rate" values must be greater than or equal to 0.0. #3. "QoS ClassY7value must be A, B, C, or D; where: #A corresponds to "Class A QoS, Circuit emuiaîîon, CBR video" #B corresponds to ccCIassB QoS, VBR Audio and Video" #C corresponds to "Class C QoS, Connectionsriented Data Tramfer" #D corresponds to 'Class D QoS, Connectionless Data Transfer"