Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The Journal of Korean Institute of Communications and Information Sciences
Journal Basic Information
Journal DOI :
The Korean Institute of Communications and Information Sciences
Editor in Chief :
Kyung-Hi Chang / Song Chong / Jong-Taek Oh / Jae-Jin Lee / Myung-Sik Yoo
Volume & Issues
Volume 25, Issue 12B - Dec 2000
Volume 25, Issue 12A - Dec 2000
Volume 25, Issue 11B - Nov 2000
Volume 25, Issue 11A - Nov 2000
Volume 25, Issue 10B - Oct 2000
Volume 25, Issue 10A - Oct 2000
Volume 25, Issue 9B - Sep 2000
Volume 25, Issue 9A - Sep 2000
Volume 25, Issue 8B - Aug 2000
Volume 25, Issue 8A - Aug 2000
Volume 25, Issue 7B - Jul 2000
Volume 25, Issue 7A - Jul 2000
Volume 25, Issue 6B - Jun 2000
Volume 25, Issue 6A - Jun 2000
Volume 25, Issue 5B - May 2000
Volume 25, Issue 5A - May 2000
Volume 25, Issue 4B - Apr 2000
Volume 25, Issue 4A - Apr 2000
Volume 25, Issue 3B - Mar 2000
Volume 25, Issue 3A - Mar 2000
Volume 25, Issue 1B - Jan 2000
Volume 25, Issue 1A - Jan 2000
Volume 25, Issue 9 - 00 2000
Volume 25, Issue 8 - 00 2000
Volume 25, Issue 7 - 00 2000
Volume 25, Issue 5 - 00 2000
Volume 25, Issue 4 - 00 2000
Volume 25, Issue 2B - 00 2000
Volume 25, Issue 2A - 00 2000
Volume 25, Issue 1 - 00 2000
Volume 25, Issue 12 - 00 2000
Volume 25, Issue 10 - 00 2000
Selecting the target year
Design and Implementation of Rule-based Routing Configuration Fault Management System
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1085~1095
In this paper, we have defined the rules and the algorithm for diagnosis and recovery of routing configuration fault on a system. By using them, we have implemented the Java-based system that can manage routing configuration fault automatically. To manage routing configuration fault, the production rule for network configuration management, the production rule for routing configuration fault diagnosis, and the production rule for routing configuration fault recovery have been proposed. Rule-based routing configuration fault management system has been implemented on the basis of backward chaining algorithm and applied for meta rules for the purpose of interconnecting the production rules. We have derived the experimental result from transition process of the rules, the Blackboard, the goals based on scenarios. Through the implementation of dynamically applicable system in heterogeneous and rapidly changing network environments, we have proposed the methodology for network configuration fault management. Also, we expect that network configuration manager can reduce time and cost wasted for routing configuration fault management.
Performance Analysis of Default Sever Replication Strategy for Query Processing in Mobile Computing
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1096~1103
The default server strategy is commonly used for location and state managements of mobile host in mobile computing. With this strategy, we can find the cell of destination mobile host to send data by querying the default server. In SDN(single Default Notification) strategy which is a kind of default server strategy, the call is established after the location and state of the callee is acquired to the query server by querying the default server. But the communication cost overhead from the default server is increased if there are large number of cells and query requests, and if it is too far from the default server to a base station. Still more it will be unable to establish any calls to a mobile host when there is a fault in the default server of this host. In this paper, we suggest add evaluate a default server replication strategy to reduce the communication cost overhead and to make the service available.
Design of Duplicate System based on Commercial OS
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1104~1114
If the control system that works important job fails, economical loss occurred. Hence, to guarantee high reliability, it must be duplicated. In the case of traditional duplication mechanism, dedicated operating system with duplication functions were built. This required much development and maintenance cost. They can be saved, if we use commercial operating system and its development environment.This paper proposes a duplication mechanism for the system based on commercial 0S. The system that explained in this paper is BSC(Base Station Controller). The duplicated BSC system uses concurrent write memory for synchronization and VxWorks as an operating system. We propose how the task supporting duplication functions is executed without delay and preemption, how to synchronize standby's memory with active' s, and how to use concurrent-write memory easily with VxWorks' s partition. We also describe the takeover procedure when the active detects its hardware fault and when the standby recognizes the failure of the active.
A Web Cache Algorithm for Small Organizations
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1115~1123
Most of the existing web caches are used in huge organizations. But many internet users belong to small organizations such as a venture company or a PC room. Users are in general in multiple window environments, and use several programs concurrently with rapid preference change within a relatively short period of time. We develop a network-path based algorithm. It organizes a cache according to the network paths of the requested URLs and builds a network cache farm where caches are logically connected with each other and each cache has its own preference over certain network paths. The algorithm has been implemented and tested in a real site. The performance results show that the new algorithm outperforms the existing algorithms in the hit ratio and response time dramatically with low cost.
Analysis of Delay Characteristics in Advanced Intelligent Network-Intelligent Peripheral (AIN IP)
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1124~1133
Advanced Intelligent Network Intelligent Peripheral (AIN IP) is one of the AIN elements which consist of Service Control Point (SCP), Service Switching Point (SSP), and IP for AIN services, such as play announcement, digit collect, voice recognition/synthesis, voice prompt and receipt. This paper, featuring ISUP/INAP protocols, describes the procedures for call setup/release bearer channels between SSP/SCP and IP, todeliver specialized resources through the bearer channels, and it describes the structure and procedure for AIN services such as Automatic Collect Call (ACC), Universal Personal Telecommunication (UPT), and teleVOTing(VOT). In this environments, the delay characteristics of If system is investigated as the performance analysis, Policy establishment.
Guaranteeing delay bounds based on the Bandwidth Allocation Scheme
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1134~1143
We propose a scheduling algorithm, Bandwidth Allocation Scheme (BAS), that guarantees bounded delay in a switching node. It is based on the notion of the GPS (Generalized Processor Sharing) mechanism, which has clarified the concept of fair queueing with a fluid-flow hypothesis of traffic modeling. The main objective of this paper is to determine the session-level weights that define the GPS sewer. The way of introducing and derivation of the so-called system equation' implies the approach we take. With multiple classes of traffic, we define a set of service curves:one for each class. Constrained to the required profiles of individual service curves for delay satisfaction, the sets of weights are determined as a function of both the delay requirements and the traffic parameters. The schedulability test conditions, which are necessary to implement the call admission control, are also derived to ensure the proposed bandwidth allocation scheme' be able to support delay guarantees for all accepted classes of traffic. It is noticeable that the values of weights are tunable rather than fixed in accordance with the varying system status. This feature of adaptability is beneficial towards the enhanced efficiency of bandwidth sharing.
A Design of TINA-based Performance Management Architecture
Seoung-Woo Kim ; Young-Tak Kim ;
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1144~1152
In order to guarantee the user-requested quality-of-service(QoS) and keep the network utilization at maximum it is required to manage the network performance continuously after the network installation. The performance management function should provide the useful information for the network expansion and the capacity reallocation in the future. Currently the TINA provides the specification of the management function of configuration management connection management and fault management ; but the management function of performance management and security management are not well-defined yet. In this paper we propose a TINA-based performance management architecture for the efficient performance management of the heterogeneous networks or NEs with TMN and SNMP management functions. And we examine the proposed architecture into the ATM network (with SNMP and TMN) monitoring. The proposed architecture is based on the distributed processing architecture and the concept the TMN perfo mance management. The proposed architecture have been designed and implemented in multiprocess and multithread structure.
Prediction Algorithm of Threshold Violation in Line Utilization using ARIMA model
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1153~1159
This paper applies a seasonal ARIMA model to the timely forecasting in a line utilization and its confidence interval on the base of the past data of the lido utilization that QoS of the network is greatly influenced by and proposes the prediction algorithm of threshold violation in line utilization using the seasonal ARIMA model. We can predict the time of threshold violation in line utilization and provide the confidence based on probability. Also, we have evaluated the validity of the proposed model and estimated the value of a proper threshold and a detection probability, it thus appears that we have maximized the performance of this algorithm.
Traffic Management Scheme for Supporting QoS of VBR/ABR Services in ATM Switching Systems
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1160~1168
This paper presents a real-time integrated traffic management (RITM) scheme that can effectively manage variable bit rate (VBR) and available bit rate (ABR) traffics having unpredictable characteristics in asynchronous transfer mode (ATM) networks. An unique feature of this scheme is that it has a special ATM cell control block which makes it possible to monitor bursty traffics in real-time so that the delay incurred to measure cell arrival rate is minimized. Additionally, the proposed scheme intends to dynamically reassign the leftover network resources to VBR/ABR connections without any deterioration in quality of service (QoS) of the existing connections. The RITM scheme has been verified to reliably monitor incoming traffics and to efficiently manage network resources by computer simulations. The capability of managing the incoming ATM traffics in real-time helps determine an optimal acceptable number of user connections for a given network condition. We can use this value as a threshold to protect the network from being congested and to find out a cost-effective buffer design method.
Label Assignment Schemes for MPLS Traffic Engineering
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1169~1176
In this paper, label assignment schemes considering the IP flow model for the efficient MPLS traffic engineering are proposed and evaluated. Based on the IP flow model, the IP flows are classified into transient flows and base flows. Base flows, which last for a long time, transmit data in high bit rate, and be composed of many packets, have good implications for the MPLS traffic engineering, because they usually cause network congestion. To make use of base flows for the MPLS traffic engineering, we propose two base flow classifiers and label assignment schemes where transient flows are allocated to the default LSPs and base flows to explicit LSPs. Proposed schemes are based on the traffic-driven label triggering method combined with a routing tabel. The first base flow classifier uses both flow size in packet counts and routing entries, and the other one, extending the dynamic X/Y flow classifier, is based on a cut-through ratio. Proposed schemes are shown to minimize the number of labels, not degrading the total cut-through ratio.
A ENA algorithm for Performance Enhancement of Satellite Link using TCP
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1177~1185
In this paper, We report on the performance issues faced by TCP based applications on satellite link having long propagation delay and high probability of bit erros and propose ENA(Error Notification Ack) algorithm for TCP Performance Enhancement. TCP Protocol cannot distinguish errored segments(in noisy medium) from losses of genuine network congestion and react as if there is network congestion. Therefore, Slow Start and Congestion avoidance mechanism are initiated. It happen this case in satellite link. Therefore it reduce the transmission rate and drop the performance. So, in this paper We propose ENA algorithm which is distinguished errored segments from losses of network congestion. And We propose the method of algorithm's implementation. And We evaluate the Performance of Tahoe, Reno, Sack TCP with ENA. As results, TCP Performance is better
A study on the estimation performance for Dedicated Short Range Communication(DSRC) system in 5.8GHz
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1186~1197
In this paper, we investigated performance for 5.8GHz Dedicated Short Range Communication(DSRC) packet communication system which will be applied to domestic Intelligent Transportation System(ITS) services and analyzed modulation technique and interference cancellation method to improve performance in physical layer. We presented the most suitable DSRC uplink protocol to apply to multiple access protocol for DSRC system. Finally, we presented channel model to estimate performance between Roadside Unit(RSU) and Onborad Unit(OBE), and showed their validity through the result of numerical analysis.
Analysis of Adaptive Multiuser Detector using the improved input Signal
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1198~1205
In this paper, we introduce a modified interference cancellation scheme to overcome MAI in DS-CDMA. Among ICs(Interference Cancellers), PIC(Parallel IC) requires the more complexity, and SIC(Successive IC) faces the problems of the long delay time. Most of all, the adaptive detector achieves the good BER performance using the adaptive Inter conducted iteration algorithm. So it requires many iterations. To resolve the problems of them, we propose an improved adaptive detector that the received signal removed MAI through the sorting scheme and the cancellation method are fed into the adaptive filter. Because the improved input signal is fed into the adaptive filter, it has the same BER performance only using smaller iterations than the conventional adaptive detector, and the proposed detector having adaptive filter requires less complexity than the other detectors.
The Study on The Voice Channel Expansion Using Code Division Multiplexing
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1206~1212
The subscriber loop subnet at domestic wired telephony networks uses one circuit per one subscriber and the transmission network subnet uses TDM that is composed to 30 voice channels and is assigned to 64kbps per one voice channel of 2.048Mbps in El. On the contrary, the subscriber networks for cellular networks is extent to channel capacity and make it efficiency use CDMA method but the transmission network is used to the same as telephony. In this paper, The subscriber loop at wired network also is shown to increasing effective and lower expensive using CDM.
The Implementation Method and its IPCN(Inter-Processor Communication Network) Performance Evaluation for Internet Access Service
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1213~1222
We have considered and developed a subsystem of switching system which provides Internet access service, taking into considerations of traffic and quality problems. In this paper, Internet subsystem with a structure and function has been presented that turns the switching system into the optimized gateway between switching system and Internet. And, this paper developed simulation model and analyzed a performance of inter-processor communication unit which practically functions as an Internet traffic transfer.
Effect of a cell loading on the soft handoff of a DS-CDMA cellular system
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1223~1230
In this paper, we proposed a handoff decision method based on signal-to-interference ratio(SIR) of the pilot channel in order to perform a handoff more effectively and to complement disadvantages - deterioration quality of a call, decreasing capacity of the system, and wasting power of the mobile station - which is caused when handoff is performed by the classical method that execute a handoff based on received signal strength. Moreover, when we change that the minimum threshold, the cell loading which is defined active traffic channels to total traffic channels ratio, and the fraction of the transmit power from base station allocated to the pilot channel on the forward link of a DS-CDMA system, we analyzed mean numbers of handoff depending on hysteresis level during the mobile station moving from one base station to another base station.
A New Bit Allocation Algorithm for DMT based VDSL System
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1231~1237
Efficient Message Scheduling Protocol for Variable-sized Messages in a WDM-based Local Network with Nonzero Tuning Time
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1238~1246
In a multi-channel network based on wavelength division multiplexing (WDM), an efficient protocol is needed for transmitter and receiver to be tuned to same wavelength during message transmission time. This paper proposes a message scheduling protocol that can efficiently support variable-sized messages, where tunable transceiver has nonzero tuning time. In this protocol, once a node reserves one data channel, it can persistently use the reserved channel till message transmission is finished. Therefore, overhead due to tuning time of the tunable transceiver can be reduced. Moreover, the protocol does not require any global information. Therefore, it can operate independently of the change of the number of nodes, and any new node can join the network at anytime without requiring network initialization. With this protocol, one can avoid data channel and destination conflicts. The protocol is analyzed with a finite population model and the throughput-delay characteristics are investigated as performance measures.
Cost-Effective Traffic Grooming in WDM Ring Networks : Uniform-Traffic Case
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1247~1253
To fully utilize the capabilities of a SONET/ADM network, traffic grooming is needed to multiplex a number of lower-rate traffic streams into a higher-rate stream, and vice versa. Although the capacity of a SONET ring network can be upgraded by operating it over multiple wavelengths, the corresponding network design may be costly if it employs a large number of ADMs. A cost-effective design attempts to minimize the total number of ADMs used in the network while carrying the offered traffic. We introduce and evaluate the performance characteristics of a new traffic-grooming approach for WDM ring networks, called multihop. The multihop implementation places an ADM at each node based on the requested traffic in the traffic-demand matrix then, it tries to groom the wavelengths which can be groomed. We select one of the nodes to be the "hub" node which has an ADM for each wavelength. The hub node, therefore, can "bridge" traffic between all of the wavelengths. The algorithm is specified and illustrated by a simple example. Our results demonstrate that it is beneficial to use a single-hop approach, but for a large grooming ratio and node number, we advocate the use of the multihop approach.e multihop approach.
Efficient Iteration Control Method with low complexity and New Interleaver for Turbo Codes
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1254~1264
In this paper, we propose a new turbo interleaver and an efficient iteration control method with low complexity for turbo decoding. Turbo codes has better performance as the number of iteration and the interleaver size increases. However, as the interleaver size is increased, it require much delay and computation for decoding. Thus we propose a new efficient turbo magic interleaver using the Magic square matrix. Simulation results show that the proposed interleaver realizes a good performance like GF, Mother interleaver proposed to IMT-2000. And as the decoding approaches the performance limit, any further iteration results in very little improvement. Therefore, we propose an efficient algorithm of decoding that can reduce the delay and computation. Just like the conventional stop criterion, it effectively stop the iteration process with very little performance degradation.
An Efficient Algorithm for Incremental View Maintenance In a Data Warehouse
The Journal of Korean Institute of Communications and Information Sciences, volume 25, issue 8A, 2000, Pages 1265~1272
A data warehouse is able to accommodate efficient data mining query processing and subsequent response by providing information needed for decision making. In such an environment, the data warehouse stores materialized view derived from various sources to enhance query processing. The compensating algorithm to maintain materialized view is well known for a single source site environment. In the compensating algorithm, several problems arise to get results in view maintenance. The problems are due to the overhead in query management within the data warehouse, increased complexity to manage queries in the warehouse as updates occur and increased volume of message traffic between the data source and the warehouse. In this paper, we propose a new algorithm that reduces the overhead in managing queries for new maintenance and that enhances the correctness. We also measured the performance of the new algorithm by evaluating the performance of the existing recomputing view and compensating algorithm and comparing the results with the proposed algorithm.