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 27, Issue 12C - Dec 2002
Volume 27, Issue 11C - Nov 2002
Volume 27, Issue 10C - Oct 2002
Volume 27, Issue 10A - Oct 2002
Volume 27, Issue 9C - Sep 2002
Volume 27, Issue 8C - Aug 2002
Volume 27, Issue 8B - Aug 2002
Volume 27, Issue 8A - Aug 2002
Volume 27, Issue 7C - Jul 2002
Volume 27, Issue 7B - Jul 2002
Volume 27, Issue 7A - Jul 2002
Volume 27, Issue 6C - Jun 2002
Volume 27, Issue 6B - Jun 2002
Volume 27, Issue 6A - Jun 2002
Volume 27, Issue 5C - May 2002
Volume 27, Issue 4C - Apr 2002
Volume 27, Issue 4B - Apr 2002
Volume 27, Issue 4A - Apr 2002
Volume 27, Issue 3C - Mar 2002
Volume 27, Issue 3B - Mar 2002
Volume 27, Issue 3A - Mar 2002
Volume 27, Issue 2B - Feb 2002
Volume 27, Issue 2A - Feb 2002
Volume 27, Issue 2C - Jan 2002
Volume 27, Issue 1C - Jan 2002
Volume 27, Issue 1B - Jan 2002
Volume 27, Issue 1A - Jan 2002
Volume 27, Issue 9 - 00 2002
Volume 27, Issue 8 - 00 2002
Volume 27, Issue 3 - 00 2002
Volume 27, Issue 12 - 00 2002
Volume 27, Issue 11 - 00 2002
Volume 27, Issue 10 - 00 2002
Selecting the target year
Design and Performance Evaluation of Offset Time Decision Algorithm for Guaranteeing the QoS in Optical Burst Switching Networks
So, Won-Ho ; Cha, Yun-Ho ; Roh, Sun-Sik ; Kim, Young-Chon ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 1C, 2002, Pages 1~10
With the explosive growth of the number of Internet users and Internet-related services, the research on construction of broadband Optical Internet by using WDM technologies is actively is actively progressed. In this paper, we design the offset time decision (OTD) algorithm for supporting the QoS in optical networks based on optical burst switching (OBS), which is the new switching paradigm, and evaluate the performance of it. The proposed algorithm determines a reasonable offset time considering traffic load of network and the number of wavelengths to guarantee the burst loss rate (BLR) of high priority Internet traffic as a QoS parameter. In order to design the proposed OTD algorithm, firstly we make the new burst loss formula, which includes the effect of offset time. The decision of offset time corresponding to the requested BLR, however, should use the reverse formula of proposed one, thus we are not able to use it without any changes. In this paper, we define the heuristic loss formula (HLF) that can be changed into reversed formula by using the proposed formula and proportional equation considering its characteristics. Finally we show the OTD algorithm to decide the offset time by using HLF. We show that the requested BLR is guaranteed under various traffic load with the determinded offset time by using the proposed OTD algorithm.
QoS control for real-time VBR video traffic using prediction-based dynamic resource allocation architecture
Yoo, Sang-Jo ; Hong, Sung-Hoon ; Kang, Sung-Won ; Hong, Kyoung-Pyo ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 1C, 2002, Pages 11~20
In this paper, we propose an efficient quality providing scheme to satisfy a diversify combination of delay bound and loss ratio requirements from users by a predictive dynamic resource allocation method for real-time video applications. For utilizing the network resources more efficiently while meeting the service requirements, we adjust the resources based on the predicted traffic and the currently provided quality level. We developed a simple delayed-packet counter updating scheme for real time QoS monitoring. Simulation results show that our proposed method can provide an accurate and flexible quality control.
Design and Implementation of Distributed QoS Management Architecture for Real-time Negotiation and Adaptation Control on CORBA Environments
Lee, Won-Jung ; Shin, Chang-Sun ; Jeong, Chang-Won ; Joo, Su-Chong ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 1C, 2002, Pages 21~35
Nowadays, in accordance with increasing expectations of multimedia stream service on the internet, a lot of distributed applications are being required and developed. But the models of the existing systems have the problems that cannot support the extensibility and the reusability, when the QoS relating functions are being developed as an integrated modules which are suited on the centralized controlled specific-purpose application services. To cope with these problems, it is suggested in this paper to a distributed QoS management system on CORBA, an object-oriented middleware compliance. This systems we suggested can provides not only for efficient control of resources, various service QoS, and QoS control functions as the existing functions, but also QoS control real-time negotiation and dynamic adaptation in addition. This system consists of QoS Control Management Module(QoS CMM) in client side and QoS Management Module(QoS MM) in server side, respectively. These distributed modules are interfacing with each other via CORBA on different systems for distributed QoS management while serving distributed streaming applications. In phase of design of our system, we use UML(Unified Modeling Language) for designing each component in modules, their method calls and various detailed functions for controlling QoS of stream services. For implementation of our system, we used OrbixWeb 3.1c following CORBA specification on Solaris 2.5/2.7, Java language, Java Media Framework API 2.0 beta2, Mini-SQL 1.0.16 and the multimedia equipments, such as SunVideoPlus/Sun Video capture board and Sun Camera. Finally, we showed a numerical data controlled by real-time negotiation and adaptation procedures based on QoS map information to GUIs on client and server dynamically, while our distributed QoS management system is executing a given streaming service.
A study on AX-Gateway System Design and Construction for Interfacing between MGCP and H.323
Kang, Jae-Kyung ; Kim, Hyeon-Gyu ; Oh, Eun-Rog ; Kang, Tae-Ik ; Kim, Chul-Ju ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 1C, 2002, Pages 36~47
MGCP ia standard protocol by IFTF, which is designed to facilitate inter-working with other protocols. Since the nature of protocol, it can be known as a proper solution to integrate heterogeneous networks consisted of various protocols and systems. In this paper MGCP is used for controlling VoIP gateways from external call control elements(MGCs) and introduces a method to improve interoperability for various MGC in a gateway based on MGCP. It presents implementation issues to provide the interoperability for MGC dependent parts such as call flows of message encoding, and a system architecture to resolve the issues.
An Efficient Dynamic Bandwidth Allocation Algorithm for VoDSL Services
Kim, Hoon ; Park, Jong-Dae ; Nam, Sang-Sig ; Park, Kwang-Chae ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 1C, 2002, Pages 48~58
As internet traffic increases, the problem that it should be efficiently accepted in to the existing voice network in the pending problem importantly to the existing communication corporations. The feature of next generation exchange network is made up of the form of integration network that connect data traffic(internet service. Etc) with the existing voice network and it can be showed with very diverse aspects according to the constitution time of network or the characteristics of business. The progress strategy that develop the existing circuit based communication network into packet-based communication network can be divided into two in a large scale according to the application position These are VoDSL application method(Technology that packetize access network) and softswitch technology application method(after packetizing relay network, packetizing that into the access network). In this paper, we will deduce the desirable technology that can construct packet-based next generation exchange networks in the structure of the existing communication network environment. We will perform the research on a device to offer the necessary core technique VoSDL service with realistic resolutions primarily.
An Efficient Data Delivery Information Exchange for Reliable Wireless Multicasting
Lim Ji-Yeong ; Chung Tai-Myeong ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 1C, 2002, Pages 59~68
In this paper we issue some problems occurring when a mobile host moves from a base station to another in a wireless multicasting and propose a solution. In the case of not being in the same multicast group, the old base station will pre-forward data to neighboring base stations to avoid transmission delay. However, if other mobile hosts move at short interval, the old base station may retransmit the same dta to the same neighboring base stations. Also, the old base station should retransmit data if the new base station has already discarded data even if the new base station is a member of the multicast group. In this paper we propose called Information Exchange Scheme (IES). In this scheme, each base station exchanges indirectly the data delivery information with the rest of the base stations in the same multicast group for efficient and reliable multicast and pre-forwards data not retransmitting the same data for minimizing transmission delay when a mobile host moves. We also present how IES is efficient by analyzing and simulating.
A Study on Implementation of the Fast Motion Estimation
Kim, Jin-Yean ; Park, Sang-Bong ; Jin, Hyun-Jun ; Park, Nho-Kyung ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 1C, 2002, Pages 69~77
Sine digital signal processing for motion pictures requires huge amount of data computation to store, manipulate and transmit, more effective data compression is necessary. Therefore, the ITU-T recommended H.26x as data compression standards for digital motion pictures. The data compression method that eliminates time redundancies by motion estimation using relationship between picture frames has been widely used. Most video conding systems employ block matching algorithm for the motion estimation and compensation, and the algorithm is based on the minimun value of cast functions. Therefore, fast search algorithm rather than full search algorithm is more effective in real time low data rates encodings such as H.26x. In this paper, motion estimation employing the Nearest-Neighbors algorithm is designed to reduce search time using FPGA, coded in VHDL, and simulated and verified using Xilink Foundation.
Approximate Reachability Analysis of Large Finite State Machines
Hong, You-Pyo ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 1C, 2002, Pages 78~83
Reachability analysis of finite state machines is very useful for many computer-aided design applications such as communication protocol or microprecessor design. We present new techniques to improve approximate reachability analysis. The key idea is to used an iterative approximate reachability analysis technique in which don't care sets derived from previous iterations are used to improve the approximation in subsequent iterations. Experimental results show that the new techniques can improve reachability analysis significantly compared to existing analysis techniques.
Viterbi Decoder Design of TCM Modem for Audio Wireless Transmission
Kim, Sung-Jin ; Chung, Heui-Suck ; Lee, Ho-Woong ; Kang, Chul-Ho ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 1C, 2002, Pages 84~89
In this paper the Viterbi decoder which is used for TCM decoding in wireless modem system under transmission of audio data for the high quality sound is designed by VHDL and implemented by FPGA. After making short explanation about TCM encoding and decoding. I show the effect of channel in computer by using encoder and decoder implemented in FOGA and the bit error rate according to change rate of (
Next-Generation File Transfer Protocol Which support concurrent file transmissions effectively in Internet
Choi, Jae-Nam ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 1C, 2002, Pages 90~95
Though the FTP(File Transfer Protocol) has been used widely and stable, It has the structural weakness that can't support current file transmissions so that we have to wait the completion of previous file transmission when try to transmit another file. If try to transmit multiple files concurrently using this FTP, It has to forking multiple FTP servers and clients in each user's PC and ISP's host machine it would result in the waist of memory, resource of network and the high workload of system. In order to solving previous problem, in this paper I have designed the new model of FTP which based on multi-thread and created NFTP(Next-Generation FTP)protocol so that may reduce the workload of system and support current file transmission effectively. I have implemented NFTP and also applied to real service, as a result It have provided reliable service by reducing the workload of system and saved the waiting time which would happened.
An Object-Oriented Redundant Fault Detection Scheme for Efficient Current Testing
Bae, Sung-Hwan ; Kim, Kwan-Woong ; Chon, Byoung-Sil ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 1C, 2002, Pages 96~102
Current testing(Iddq testing) on monitoring the quiescent power supply current is an efficient and effective method for CMOS bridging faults. The applicability of this technique, however, requires careful examination. Since cardinality of bridging fault is O(
) and current testing requires much longer testing time than voltage testing, it is important to note that a bridging fault is untestable if the two bridged nodes have the same logic values at all times. Such faults should be identified by a good ATPG tool; otherwise, the fault coverage can become skewed. In this paper, we present an object-oriented redundant fault detection scheme for efficient current testing. Experimental results for ISCAS benchmark circuits show that the improved method is more effective than the previous ones.
Paper Duplication Method Supported by Task
Lee, Jong-Chan ; Park, Sang-Joon ; Kang, Kwon-Il ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 1C, 2002, Pages 103~111
In RNC of IMT-2000, main control processors such as ASP, ACP and OMP are responsible for call control function, and the high reliability and real-time property should be provided for it. So, the study of real-time fault-tolerant for it is needed. In this paper, we proposes an Task based duplication method, in which Tasks in active side operated on message unit and send the updated data to standby side after operation, log in the message to standby side for recovery during take-over. This scheme decreases the dual down and the complexity of synchronization procedure, and performs the synchronization more exactly because Tasks control the synchronization of system. This paper also proposes the fault detection and the fault handing method for effective implementation of Task based duplication. This scheme focus on increasing the fault detection rate and intercepting originally that fault data is send to standby side.
Design of Hash Processor for SHA-1, HAS-160, and Pseudo-Random Number Generator
Jeon, Shin-Woo ; Kim, Nam-Young ; Jeong, Yong-Jin ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 1C, 2002, Pages 112~121
In this paper, we present a design of a hash processor for data security systems. Two standard hash algorithms, Sha-1(American) and HAS-1600(Korean), are implemented on a single hash engine to support real time processing of the algorithms. The hash processor can also be used as a PRNG(Pseudo-random number generator) by utilizing SHA-1 hash iterations, which is being used in the Intel software library. Because both SHA-1 and HAS-160 have the same step operation, we could reduce hardware complexity by sharing the computation unit. Due to precomputation of message variables and two-stage pipelined structure, the critical path of the processor was shortened and overall performance was increased. We estimate performance of the hash processor about 624 Mbps for SHA-1 and HAS-160, and 195 Mbps for pseudo-random number generation, both at 100 MHz clock, based on Samsung 0.5um CMOS standard cell library. To our knowledge, this gives the best performance for processing the hash algorithms.