The increase of complex information results in the need of computer processing, and for the better utilization of computer systems and for fast and remote teleprocessing, it is naturally stressed to construct computer network systems.
This research involves two topics. One is the design and implementation of NOVA-CYBER Communication System(NCCS) which is a two mode computer to computer communication system, and the other is the statistical modeling and computations for minimal line cost network topology of Korean Computer Network(KCN) model.
NCCS has two modes-Batch mode and interactive model. Batch mode communication is performed by the characteristics of emulator of NCCS, and interactive mode communication is done by message relay function of NCCS. The preprocessor and postprocessor reside in disk and main communication processor is in a resident proportion of operating system.
KCN is a multidrop line organized terminal oriented computer network. KCN model is divided into 8 submodels according to the priority schemes and the line organizations, half duplex line and full duplex line. For each submodels, the statistical values of response time are computed using single channel-single station queuing theories.
The iterative algorithm to find the minimal line cost network topology of multidrop computer network is presented.
Lastly a various experimentations, computations, and their results are discussed.
본 연구는 NOVA-CYBER Communication System (NCCS) 의 설계와 Korean Computer Network (KCN) 의 통계적 모형을 이용한 최소 회선비용 네트윅의 설계에 관한 것이다.
NCCS 는 Two-node Computer Network System으로써 Batch mode 와 Interactive mode 를 갖고 있다. Batch mode operation 은 NCCS 의 Emulator 적인 속성에 의한 것이며 Interactive mode operation은 message relay 기능에 의한 것이다. 자료 통신을 위한 Preprocessor와 Postprocessor 는 Disk file 로 되어 있으며 Communication Processor는 Operating System 에 상주하고 있다.
KCN 은 multidrop 식으로 연결된 Terminal orient 된 Computer network 으로써 KCN mode은 우선 순위와 회선 구성 형식에 따라 8개의 statistical submodel 로 나누어 이들 각각에 대한 통계치들을 single-channel-single-station 대기 이론을 이용하여 계산하였으며 이들 결과를 이용하여 최소 회선 비용의 network topology 를 찾기 위한 iterative algorithm 을 소개한다.
