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 :
Volume & Issues
Volume 24, Issue 12B - Dec 1999
Volume 24, Issue 12A - Dec 1999
Volume 24, Issue 11A - Nov 1999
Volume 24, Issue 10B - Oct 1999
Volume 24, Issue 10A - Oct 1999
Volume 24, Issue 9B - Sep 1999
Volume 24, Issue 9A - Sep 1999
Volume 24, Issue 8B - Aug 1999
Volume 24, Issue 8A - Aug 1999
Volume 24, Issue 7B - Jul 1999
Volume 24, Issue 7A - Jul 1999
Volume 24, Issue 6B - Jun 1999
Volume 24, Issue 6A - Jun 1999
Volume 24, Issue 5B - 00 1999
Volume 24, Issue 5A - 00 1999
Volume 24, Issue 4B - 00 1999
Volume 24, Issue 4A - 00 1999
Volume 24, Issue 3B - 00 1999
Volume 24, Issue 3A - 00 1999
Volume 24, Issue 2B - 00 1999
Volume 24, Issue 2A - 00 1999
Volume 24, Issue 1B - 00 1999
Volume 24, Issue 1A - 00 1999
Volume 24, Issue 12 - 00 1999
Volume 24, Issue 11B - 00 1999
Selecting the target year
Anytime Multimedia Service based on In-Home Storage
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1211~1219
High quality real-time interactive multimedia services like VOD gained huge momentum by information technology industries during the middle of 1990, but failed successful commercial service deployment despite of the expectations. Among the number of reasons, lack of high bandwidth and QoS support from the network infrastructure have become main cause of the failure. On the other hand, the advance of computer industry-driven storage technologies has been reducing the price of in-home storage dramatically. This fact and the delivery of audio-visual material in a digital form to the home storage make very interesting multimedia service applications possible. It enables anytime content delivery (e.g., during off-peak time) without user interaction and anytime content play and, also, enhances utilization by reducing the loads applied to servers and networks using multicast network infrastructure. In this paper, we propose design and implementation of our anytime multimedia service system based on in-home storage, called IMPRESS-AMS.
Effective Heuristic Procedures for Solving a Gateway Location and fiber Routing Problem in Designing Multimedia Telecommunication Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1220~1228
In this paper, we deal with an important network design problem in providing multimedia telecommunication services. The problem is to find an optimal gateway location and fiber routing, while minimizing the total cost. The cost elements are the installation cost of add-drop multiplexer and fiber cables. We have developed effective heuristic procedures for the problem. The performance of the developed heuristic shows promising computational results.
Implicit Scheduling Algorithm for Dynamic Slot Assignment in Wireless ATM Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1229~1238
To maximize the statistical multiplexing gain in wireless ATM MAC, a centralized scheduling function must be provided for the dynamic slot assignment in the wireless ATM access point. Exploiting the dynamic parameters received in the wireless ATM access point, the centralized scheduler will execute a dynamic slot assignment to determine bandwidth required for individual wireless terminal. In this paper, we propose a new scheduling algorithm, which can effectively reduce a burden of the explicit signaling requirement of transmitting the dynamic parameters in a timely manner. We have demonstrated that the proposed approach outperforms the existing schemes in terms of the timeliness of transmitting the dynamic parameters, which is a critical factor to the performance of delay-sensitive service classes, and works as an effective means of dynamic slot assignment without heavily relying on the dynamic parameters in the wireless ATM networks.
A QoS-based Inter-Domain Routing Scheme for Distributed Multimedia Applications in a High Wide Area Network
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1239~1251
In this paper a scalable QoS-based hierarchical inter-domain routing scheme for distributed multimedia applications in a high speed wide area network. The problem of QoS-based routing is formulated as a multicriteria shortest path problem, known as NP-complete[21,30]. Our routing scheme consists of two phases. In Phase 1, two graph construction algorithms are performed to model the network under consideration as a graph. The graph contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. In Phase 2, a heuristic call-by-call algorithm is performed for selecting a feasible path efficiently in depth first search-like manner on the graph and tailoring to each application's QoS requirements, beginning at a vertex that represents the source node. In this paper, a simple rule is also produced, by which the visiting order of outgoing edges at each vertex on the graph is determined. The rule is based on each edge's the minimum normalized slackness to the QoS requested. The proposed routing scheme extends the PNNI-type hierarchical routing framework. Note that our routing scheme is one of a few QoS-based hierarchical routing schemes that address explicitly the issue of selecting a path with multiple metrics.
Priority Collision Resolution Algorithm on HFC Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1252~1260
The HFC network has a architecture of a star topology in fiber optic trunks, and tree and branch topology is used in the part of coaxial cable. It is well known that the HFC upstream channel is noisy. Ingress, common mode distortion and impulse noise exist in the upstream channel. In order to provide Quality of Service(QoS) to users with real-time data such as voice, video and interactive services, the evolving IEEE 802.14 standard for HFC networks must include an effective priority scheme. The scheme separates and resolves collisions between stations in a priority order. It is important to simulate protocols under a practical environment. The proposed algorithm in this paper is simulated with the assumption that the collision detector made certain mistake due to noises. Simulation results show that the proposed algorithm is more efficient than existing tree-based algorithm under practical environment.
Performance Analysis of Frame Relay Traffic for the Interworking of Frame Relay and ATM
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1261~1267
Frame relay (FR) service via an FR interface over a common asynchronous transfer mode (ATM) backbone network requires an FR-to-ATM interworking unit (IWU), the functionality of which directly impacts the engineering of the overall network in terms of capacity required, quality of service (QoS), and the interference among different types of services. This paper presents performance analysis of frame relay traffic in IWU. Additionally frame relay traffic policing using leaky bucket algorithm in this traffic model is carried out through computer simulation. Three measurements, the percentage of frames accepted as committed, the percentage of frames that accepted but marked eligible for diacard, and the percentage of frames that accepted that are discarded because of insufficient number of credits, are simulated variously in this paper.
A Study on Dimensioning of Traffic Descriptors for VBR Video Sources on ATM Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1268~1278
In this paper, we propose an analytic method for dimensioning of traffic descriptors at the leaky bucket-based UPC for VBR MPEG video traffic on ATM networks. We analytically derive cell violation probabilities at the UPC by using the proposed scene-based video traffic model, and then we show that it is possible to select sets of traffic descriptors that have the same required violation probability. For two example video traces, numerical results show that our proposed traffic descriptors dimensioning method can approximate well the simulation-based traffic control results of the real video traces. When the effective bandwidth allocation method of an ON/OFF model is used for the call admission control in the networks, we present an efficient traffic descriptor selection method by studying the allocated bandwidth to each possible traffic descriptor set.
Performance Modeling and Analysis of ATM-based Network System Using DEVS Methodology
Lee, Kyon-Ho ; Kim, Tag-Gog ; Lee, Joon-Won ;
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1279~1288
DEVSim++ is a C++ based, object-oriented modeling/simulation environment which realizes the hierarchical, modular DEVS formalism for discrete event systems specification. The paper describes a methodology for performance modeling and analysis of an ATM-based network system within the DEVSim++ environment. The methodology develops performance models for the system using the DEVS framework and implement the models in C++. Performance indices measured are the length of queues located at connection of the system and cell waiting times with respect to QoS grades for a network bandwidth of 155 Mbps.
A Study on Imput/Output Queueing Management for High Performance Switching
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1289~1295
A Usage Parameter Control based on Cell Loss Priority
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1296~1304
In this paper, we propose an enhanced usage parameter control algorithm, which is one of the preventive traffic control method in ATM networks. Proposed algorithm is based on the cell loss priority bit in the ATM cell header. This algorithm can eliminate the measurement phasing problem in cell conformance testing in ATM networks. Proposed algorithm can minimize the cell loss ratio of high priority cell(CLP = 0) and resolve the burstiness of cells which may be introduced in traffic multiplexing and demultiplexing procedure. For the performance evaluation, we simulate the proposed algorithm with discrete time input traffic model, the results show that the performance of proposed algorithm is better than that of ITU-T usage parameter control algorithm.
A study on Certification System Model Development of Information and Communication Interoperability testing
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1305~1312
To improve the quality of standards of information and communication, well-structured testing and certification procedure for interoperability must be established. Thus, the testing and certification by well-known organizations is very imperative to verify whether standards meet requirements of minimum components properly that are essential to implement products and services in practice focusing on interoperability testing area. In this paper, we investigate cases of abroad and the current situation of our country in order to establish the well-structured testing and certification system and promote researches for the testing and certification system as a national policy in coincidence with revision of relating systems in interoperability testing area. And then we intend to introduce desirable direction for the testing and certification system.
An Effective Method Guaranteeing Mutual Exclusion of Lock Waiting Information for Deadlock Detection in Main Memory Databases
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1313~1321
The two-phase locking protocol(2PL) is the most widely-used concurrency control mechanism for guaranteeing logical consistency of data in a database environment where a number of transactions perform concurrently. The problem inherent in the 2PL protocol is a deadlock, where a set of transactions holding some locks indefinitely wait an additional lock that is already held by other transactions in the set. The deadlock detector is a DBMS sub-component that examines periodically whether a system is in a deadlock state based on lock waiting information of transactions. The deadlock detector and transactions execute concurrently in a DBMS and read and/or write the lock waiting information simultaneously. Since the lock waiting information is a shared one, we need an efficient method guaranteeing its physical consistency by using mutual exclusion. The efficiency of the mutual exclusion method is crucial especially in a main memory DBMS with high performance since it seriously affects the performance of an entire system. In this paper, we propose a new method that effectively guarantees physical consistency of lock waiting information. Two primary goals of our method are to minimize the processing overhead and to maximize system concurrency.
New Sequence Number(SN*) Algorithm for Cell Loss Recovery in ATM Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1322~1330
The major source of errors in high-speed networks such as Broadband ISDN(B-ISDN) is buffer overflow during congested conditions. These congestion errors are the dominant sources of errors in high-speed networks and result in cell losses. Conventional communication protocols use error detection and retransmission to deal with lost packets and transmission errors. As an alternative, we have presented a method to recover consecutive cell losses using forward error correction(FEC) in ATM(Asynchronous Transfer Mode) networks to reduce the problem. The method finds the lost cells by observing new cell sequence number(
). We have used the LI field together with SN and ST fields to consider the
which provides more correcting coverage than SN in ATM standards. The
based on the additive way such as the addition of LI capacity to original SN capacity is numbered a repeatedly 0-to-80 cycle. Another extension can be based on the multiplicative way such that LI capacity is multiplied by SN capacity. The multiplicative
is numbered in a repeatedly 0-to-1025 cycle.
WebDBs : A User oriented Web Search Engine
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1331~1341
This paper propose WebDBs(Web Database system) which retrieves information registered in web using query language similar to SQL. This proposed system automatically extracts information which is needed to retrieve from HTML documents dispersed in web. Also, it has an ability to process SQL based query intended for the extracted information. Web database system takes the most of query processing time for capturing documents going through network line. And so, the information previously retrieved is reused in similar applications after stored in cache in perceiving that most of the web retrieval depends on web locality. In this case, we propose cache mechanism adapted to user applications by storing cached information associated with retrieved query. And, Web search engine is implemented based on these concepts.
Development of 2.45GHz Microwave Identification System
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1342~1350
In this paper, we have developed and analyzed the 2.45GHz microwave RFID system. Which is composed tag and interrogator using custom IC, and we have made the software driving the hardware for the bidirectional data transmission method. Using 3.6V power supply was used, the optimal identification range in the information transmission of the designed microwave RFID system operating at 9,600bps was l0m. In the control circuit of the tag, the low current consumption of 15
and the tag data transmission rate of 90% when the moving velocity was 80km/h.
Performance Analysis of DMF Acquisition System in Frequency-Selective Rayleigh Fading Channel
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1351~1360
In frequency selective channels, conventional PN code acquisition schemes are not ideal candidates. This is because they are primarily designed for the AWGN channel. In this paper, a direct-sequence spread-spectrum(DSSS) PN code acquisition system based on digital matched filtering (DMF) with automatic threshold control(ATC) algorithm is presented and analyzed with regards to probability of detection and probability of false alarm. These two important probabilities, the probability of detection (
) and the probability of false alarm (
) are derived and analyzed in considering Doppler shift, sampling rate, mean acquisition time, and PN chip rate in frequency selective Rayleigh fading channel when using serial-search method as detection technique. From computer simulation results of a DMF acquisition system model, it is shown that the performance of the acquisition system using ATC algorithm is better than that of constant threshold system.
Distortion invariant pattern recognition using Modified synthetic HMT
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1361~1369
A hit-miss transform(HMT) using modified synthetic structuring elements(SEs) for distortion-invariant recognition of multiple objects is proposed. A fundamental problem in an HMT is the determination of the optimal SE needed to improve the false alarm rate, and detect distorted objects with various shapes. The proposed synthetic methods of SE provide good solutions against this problem. One is the multistage synthesis of each true class SE using only set theory, and the other is the multistage synthesis of each true class and false class SE using set theory and SDF(synthetic discriminant function) synthesis method. Simulation results show the proposed methods can be used for the recognition of distorted intraclass objects and the discrimination of similar interclass objects.
Video compression using motion information in Wavelet transform domain
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1370~1377
A technique for an efficient video coding based on characteristics of human visual response in relation to motion is described in this paper. An input frame is segmented into low frequency bands and high frequency bands by wavelet transformation. The non-sensitivity parts of the segmented bands are removed according to spatial and directional frequency sensitivity, which is related to motion property in a frame. Experimental results of the proposed method show good performance in PSNR with keeping on without degradation of subjective quality with 21-30:1 coding rate.
The Variable Block-based Image Compression Technique using Wavelet Transform
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1378~1383
In this paper, an effective variable-block-based image compression technique using wavelet transform is proposed. Since the statistical property of each wavelet subband is different, we apply the adaptive quantization to each wavelet subband. In the proposed algorithm, each subband is divided into non-overlapping variable-sized blocks based on directional properties. In addition, we remove wavelet coefficients which are below a certain threshold value for coding efficiency. To compress the transformed data, the proposed algorithm quantizes the wavelet coefficients using scalar quantizer in LL subband and vector quantizers for other subbands to increase compression ratio. The proposed algorithm shows improvements in compression ratio as well as PSNR compared with the existing block-based compression algorithms. In addition, it does not cause any blocking artifacts in very low bit rates even though it is also a block-based method. The proposed algorithm also has advantage in computational complexity over the existing wavelet-based compression algorithms since it is a block-based algorithm.
Error Concealment Technique for Erroneous Video Using Overlapped Block Motion Compensation
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1384~1392
A high compression rate is required to transmit video sequences over low bit rate networks such as low bit rate communication channels. When highly compressed videos are transmitted over mobile channels of high error rate, bitstreams corrupted by channel errors are not only difficult to be decoded, but also have fatal effects on the other parts of the bitstreams. In this Paper, we propose an error concealment algorithm for recovering the blocks which can not be decoded due to damaged bitstreams. The proposed error concealment algorithm recovers the damaged blocks using the information of adjacent blocks which are correctly decoded. In the proposed algorithm, the motion vector of the damaged block is estimated using the overlapped block motion compensation(OBMC) and block boundary matching(BBM) techniques. Experiment results show that the proposed algorithm exhibits better performance in PSNR than existing error concealment methods.
=1/3, K=9 Convolutional Codec Using Viterbi Algorithm
The Journal of Korean Institute of Communications and Information Sciences, volume 24, issue 7B, 1999, Pages 1393~1399
In this paper, a VLSI design of the convolutional codec chip of code rate r=l/3, and constraint length K=9 is presented, which is able to correct errors of the received data when transmitted data is corrupted in channels. The circuit design mainly aimed for simple implementation. In the decoder, Viterbi algorithm with 3-bit soft-decision is employed. For information sequence updating and storage, the register exchange method is employed, where the register length is 5
K(45 stages). The codec chip is designed using VHDL language and Design Analyzer and VHDL Simulator of Synopsys are used for simulation and synthesis. The chip is composed of ENCODER block, ALIGN block, BMC block, ACS block, SEL_MIN block and REG_EXCH block. The operation of the codec chip is verified though the logic simulations, where several error conditions are assumed. As a result of the timing simulation after synthesis, the decoding speed of 325.5Kbps is achieved, and 6,894 gates is used.