• Aucun résultat trouvé

Air Navigation

N/A
N/A
Protected

Academic year: 2021

Partager "Air Navigation"

Copied!
2
0
0

Texte intégral

(1)

X. AIR NAVIGATION *

Prof. L. J. Chu Prof. S. J. Mason Prof. R. B. Adler S. J. Fricker

The machine calculations for the case of aircraft flying without enroute control

(Case (1) in the Quarterly Progress Report of April 15, 1950) have been practically com-pleted, and graphs of the results are now available.

As mentioned in that report, runs for E = 1.0 and 0.95 had originally been carried out with a maximum stack of S planes assumed at the beginning of the sequence. This choice, called "saturation" in the case E = 1. 0, leads to the most pessimistic results.

In attempting to correlate the first and second moments of the enroute deviation distribu-tion with those of the stack delay distribudistribu-tion, it was found that this procedure introduced irregularities which obscured the relationships. Therefore, additional runs were made for E = 1. 0 and 0. 95 starting from zero stack at the first instant of time. These cases were calculated for boxcar, triangular, and "Gauss" enroute deviation statistics with S = 6, 12, 18, 24. While all the final plots of these cases are not yet available, it appears that the modification has made the relationship between enroute deviation and stack delay somewhat clearer. It is the aim of these numerical calculations to provide enough information so that the general form of the stack-delay distribution can be pre-dicted approximately, given the traffic density and any reasonable enroute deviation statistic which may arise. Inversely, the data should provide means to set the required limits on the spread (and possibly second moment) of the enroute deviation statistics when certain tolerable limits are fixed for the stack delay distribution and the traffic density.

An analytic method for deriving the stack delays has been found for cases in which E = 1.00 and the system is in "saturation". The analytic results check satisfactorily with the numerical ones from the IBM machine. It has also been possible to find an ana-lytic method for deriving the stack delays when E is very small, although the range of applicability of the method does not permit very much of the machine data to be checked. A combination of this method, where applicable, together with the more general method for E = 1. 0, does however provide a sufficient number of checks to warrant the placing

of confidence in the overall machine results.

It was mentioned in the Quarterly Progress Report, July 15, 1950 that Case (3), discrete control without rescheduling, had been formulated in a general way for machine computation. Since then, it has appeared that this case may not require such extensive machine calculation. It may be possible to reduce the effect of this particular type of enroute control to an "effective enroute deviation statistic" by convolution methods, and

The work reported in this section is supported in part by the Air Navigation Develop-ment Board of the DepartDevelop-ment of Commerce.

(2)

-70-(X. AIR NAVIGATION)

thus, by comparison with previously calculated cases, infer the form of the stack delay distribution directly. Work is proceeding now along these new lines.

At present the machines are being arranged to handle a problem which was formu-lated during a discussion with Drs. Ewing and Philpott of the Air Navigation and Devel-opment Board. This new problem deals with a modified scheduling procedure and does not involve any enroute control. Each plane is scheduled to arrive within a time block of length S' + 1. In each block not more than S' + 1 planes will ever be scheduled, but the precise number will vary from block to block in a random fashion. The overall average traffic density over a large number of such blocks will however be restricted to

E, as before. Within each block no effort is made to space planes regularly, and each plane scheduled within the block is assumed to have equal liklihood of being assigned to any one of the available S' + 1 arrival times. As before, each plane proceeds to the terminal with a possible enroute deviation having a boxcar distribution of spread S. Stack and total delay distributions are to be calculated for various values of S', S and E.

Références

Documents relatifs

The Canadian Primary Care Sentinel Surveillance Network, a Pan-Canadian project led by the CFPC that conducts standardized surveillance on selected chronic

It is not a problem if the contact person is not totally familiar with the topic 6 , but he/she must indicate the stakeholders having the most diverse opinions possible for each

The second line of inquiry has looked at the effects of disruptive and violent protest behavior and has opened a debate in the literature about whether the use of dis-

Mr Koïchiro Matsuura welcomed the Chairperson of the first session of the General Assembly, the Chairperson of the Intergovernmental Committee and

These criteria assume that an organization which meets this profile will continue to grow and that assigning a Class B network number to them will permit network growth

The IR or the registry to whom the IR has delegated the registration function will determine the number of Class C network numbers to assign to a network subscriber based on

Sometimes nameserver managers enter MX records in their zone files that point to external hosts, without first asking or even informing the systems managers of those external

The descriptions in RFC #74 were modified to conform to current Network protocols (NCP and ICP) and to conform to what we considered a general graphics description..