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
Performance of Coding Scheme for Various Service Types in AAL2 of ATM-PON
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1033~1039
The coding scheme according to service types in AAL2 of ATM-PON is proposed in this paper. The service types and the corresponding error correcting codes are indicated by two of six reserved bits in SSTED of AAL2. Several coding schemes such as BCH and convolutional codes are considered under using the same and different kind of coding schemes. As a result, the (127,120) and (127,106) BCH codes may be the best choice for voice and data service respectively among all the possible schemes.
Development of a Distributed Web Caching Network through Consistent Hashing and Dynamic Load Balancing
Hwan Chang ; Jong Ho Park ; Ju Ho Park ; Kil To Chong ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1040~1045
This paper focuses on a hash-based, distributed Wet caching network that eliminates inter-cache communication. An agent program on cache servers, a mapping program on the DNS server, and other components comprised in a distributed Web caching network were modified and developed to implement a so-called "consistent" hashing. Also, a dynamic load balancing algorithm is proposed to address the load-balancing problem that is a key performance issue on distributed architectures. This algorithm effectively balances the load among cache servers by distributing the calculated amount of mapping items that have higher popularity than others. Therefore, this developed network can resolve the imbalanced load that is caused by a variable page popularity, a non-uniform distribution of a hash-based mapping, and a variation of cache servers.
Subnetwork-based Segment Restoration for fast fault Recovery in the MPLS network
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1046~1054
In this paper, we propose a subnetwork-based segment restoration scheme to reduce the restoration time and restoration resources. And we compare and analyze the restoration performance according to the size of divided subnetworks. Segment restoration is based on network partitioning where a large network is divided into several small subnetworks and the end-to-end data path is divided into multiple segments according to the subnetworks. In segment restoration, the link/node failure is restored by segment instead of end-to-end path. Because most faults are restored within the subnetwork, the restoration performance can be improved. From the simulation analysis, we verified that the proposed segment restoration has advantage of restoration time and backup resource utilization.
Network Efficient Multi-metric Routing Algorithm for QoS Requiring Application
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1055~1063
In this paper, we have studied path selection problem using multiple metric. Current Internet selects a path using only one metric. The path selected by one metric is a best-effort service that can satisfy one requirements. In order to satisfy a call with various Qualify-of-Service(QoS) requirements, the path must satisfy multiple constraints. In many cases, path selection is NP-complete. The proposed algorithm is widest-least cost routing algorithm that selects a path based on cost metric which is basically a delay metric influenced by the network status. The proposed algorithm is a multiple metric path selection algorithm that has traffic distribution ability to select shortest path when network load is light and move traffic to other alternate path when the link load is high. We have compared the results with other routing algorithms.
Implementation and Performance Evaluation of the Wireless Transaction Protocol Using UML/SDL
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1064~1073
In this paper, we design and implement the Wireless Transaction Protocol (WTP) proposed by the Wireless Application Protocol (WAP) forum using a protocol development tool, SDL Development Tool (SDT). And we conduct a comparative performance evaluation of the WTP implementation with other three implementations that are based on different implementation models respectively: the server model, the coroutine model, and the activity-thread model. To implement WTP, we first use Unified Modeling Language (UML) for analyzing the protocol requirement and defining the protocol engine architecture. Next, we use Software Development Language (SDL) to design the protocol engine in details and then generate the WTP implementation automatically with the aid of SDT The code size of the WTP implementation generated by SDT is 62% larger than the other three implementations. However, its throughput and system response time for transaction processing is almost equal to the other three implementations when the number of concurrent clients is less than 3,000. If more than 5,000 concurrent clients tries, the transaction success rate abruptly decreases to 10% and system response time increases to 1,500㎳, due to the increased protocol processing time. But, it comes from the fact that the load overwhelms the capacity of the PC resource used in this experimentation.
A Study on the Algorithm of Improved One-Time Password using Time and Time Correction
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1074~1080
In clients/server environments, the one-time password scheme using time is especially useful because it solves the synchronization problem. However, it has the problem that is time-slippage, and causes the authentication to fail. In this paper, we propose an effective one-time password algorithm, which solves the time-slippage problem through the use of 1-bit information, which denotes the duration in which the authentication could be failed because of time-slippage. This algorithm is added easily and quickly to current one-time password systems using time without requiring any change of protocols: the proposed algorithm can be implemented by adding only 1-bit information to the user authentication information, not by modifying the one-time password authentication system protocol. And we propose also the algorithm of time correction, which can be implemented by adding 2-bit information on the proposed one-time password.
The Design and Implementation for Practical Risk Analysis Method ＆ Modules
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1081~1089
In these days many Organizations recognize risk of information asset by rapid change of information system environments, and need suitable management for that. Also many organization which operate important information-communication infrastructure take interest in threat, vulnerability and risk analysis of important asset by enforcement of Act on protection of information and communication infrastructure. But, it is most that methodology and tools that analyze risk for organization's information asset are developed in abroad up to now, domestic research of this field is insufficient stage. An research of this field is necessary in domestic because it can't reflect domestic actuality by depending on most foreign methodology or a tool. In this paper we proposed design and implementation for the risk analysis methodology, a prototype and important modules that considers the user convenience. We expect that the result of this paper will for step improvement of domestic risk analysis methodology and tool development.
The proposal of improved secure cookies system based on public-key certificate
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1090~1096
A Study on the Improvement of Tearing Artifact for Windows-Based Visual Monitoring Systems
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1097~1105
In display systems employing analog monitors, the tearing artifact such that an window screen is divided into two parts showing different scenes can occur when the change of scenes in the moving pictures is very fast, but the frame buffer's refresh rate does not match the monitor's scanning frequency. It is especially noticeable at high frame rate. DVR system is a recently popularized visual monitoring system. The tearing artifacts becomes more serious since the frame buffer's refresh rate is very high due to the requirement of multi channel display in the DVR. In this paper, we propose an improved display system for windows-based DVR systems which prevents the tearing artifacts without deterioration of display speed performance. The efficiency of the proposed display system is verified through experiments.
Enhanced watermarking scheme based on removal of local means
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1106~1111
This paper presents a new watermarking scheme to reduce the detection error probability through removal of local mean values of an original signal equivalently. At first, we show that the error probability is reduced by the removal of the local mean values. In the removal process, we are in need of a method that equivalently removes the local mean values without modification of the original signal since the process changes the original signal. The method is based on the principle that as the watermark with zero local mean values is embedded, the local mean values of the original signal is equivalently removed in detection of the watermark. The principle are analytically proven, and the superiority of the proposed method is verified by experiments for variety of watermarks.
An Efficient Algorithm of Network Bandwidth Allocations for Multimedia Services
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1112~1123
Providing a multimedia service requires efficient network bandwidth allocation scheduling. Typically, transmission of information with bursty characteristics, such as a video data stream, utilizes some type of smoothing technique that reduces the transmission rate fluctuation. While capable of a drastic reduction in the peak transmission rate, even the optimum smoothing algorithm proposed to date, however, is rather inadequate for multi-stream applications that share network bandwidth since such an algorithm has been designed and applied toward handling each independent stream. In this paper, we proposed an efficient bandwidth allocation algorithm that addresses these shortcomings. The proposed bandwidth allocation algorithm is divided into two steps, a static bandwidth allocation and a dynamic bandwidth allocation. In the former case, the peak rate reduction is achieved by maintaining the accumulated data in the user buffer at a high level, whereas the concept of real demand factor is employed to meet the needs of multi-stream bandwidth allocation in the latter case, Finally, the proposed algorithm's performance was verified with ExSpect 6.41, a Petri net simulation tool.
Input Port re-allocation technique for the elimination of the internal blocking in banyan ATM switches
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1124~1131
The banyan network is a popular and basic structure of the multi-stage ATM switches. This paper presents a novel approach to resolve the internal blocking of the banyan network by using a Non-Blocking Permutation Generator (NBPG). The NBPG performs two functions, i.e., the first is to extract the conflict cells from the incoming cells and Ole second is to re-assign new input port addresses to the conflict cells. As a result, NBPG generates non-blocking I/O permutations. To estimate the performance of the NBPG, we provide the results of several simulations.
Reducing Power Consumption of a Scheduling Algorithm for Optimal Selection of Supply Voltage under the Time Constraint
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1132~1138
This paper proposes a reducing power consumption of a scheduling algorithm for optimal selection of supply voltage. In scheduling of reduction power consumption, we determine the control steps of operations to be executed by exploiting the possibility of using variable voltage levels to reduce power consumption. In the optimal selection of supply voltage binding, we minimize the main factor of the power consumption of the switching activity on the registers using a graph coloring technique. From a set of experiments using high-level benchmark examples, we show that the proposed algorithm prefer to use optimal selection supply voltages rather than uniformed single voltage is effective in reducing power consumption.
The Performance Analysis of a Novel Optical Space Switch Employing Multihop Structure and Time Division Multiplexing
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1139~1151
In this paper, we propose the novel module-type optical space switch, employing time division multiplexing (TDM) method and multihop structure, in order to enlarge the capacity of the switching system. And we show that the proposed structure is superior over conventional ones, in terms of power loss, the number of the devices used, and signal to crosstalk (SXR). We also analyze the saturation throughput with the number of module M. As a result, the saturation throughput of the switching system with M modules is M+ 1-√(M
+1), when the number of input port in a module (N) is large. Finally, we confirmed the cell loss rate (CLR) performance with the proposed switch through simulation. For example, when p=0.9, M=8 and N=32, to get the CLR that is less than or equal to 10
-6/, the number of input buffers storage unit is greater than or equal to 6 and output buffers storage unit is greater than or equal to 52.
Implementation of an AAL2 processor for voice gateway application
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1152~1157
In this paper, a detailed procedure of development for an AAL2 processor widely used in voice gateway application is introduced. The processor supports CPS and SSCS with voice service and framed mode data service. It provides 4 ATM virtual connections, which include 1020 AAL2 channels. The processor has one UTOPIA Level 1 interface for an ATM cell interface and 4 TDM ports for a voice channel interface. The TDM ports carry PCM/ADPCM voice streams. Most AAL2 processors are implemented as software, or hardware and software, so its latency is large. But this processor has very low latency as to CPS and SSCS because all of them are implemented in hardware. Also, it allows not only loopback and switching of CPS packets, but loopback and switching of TDM channels. The key feature is that the internal structure of the CPS and SSCS in this processor seems like as each software function, so they are called whenever they are required. In addition, they are reusable for another design and are scalable for more channels.
The Relation of CLR and Blocking Probability for CBR Traffic in the Wireless ATM Access Network
Lee, Ha-Cheol ; Lee, Byung-Seub ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1158~1163
In this paper it is focused on the relation between CLR (Cell Loss Ratio) and blocking probability, GoS(Grade of Services) parameters in the wireless ATM (Asynchronous Transfer Mode) access network which consists of access node and wireless channel. Traffic model of wireless ATM access network is based on the cell scale, burst scale and call connection level. The CLR equation due to buffer overflow for wireless access node is derived for CBR (Constant Bit Rate) traffic. The CLR equation due to random bit errors and burst errors for wireless channel is derived. Using the CLR equation for both access node and wireless channel, the CLR equation of wireless ATM access network is derived. The relation between access network CLR and blocking probability is analyzed for CBR traffic.
The Implementation of Multi-Port UTOPIA Level2 Controller for Interworking ATM Interface Module and MPLS Interface Module
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1164~1170
In the ACE2000 MPLS system, MPLS Interface Module(MIM) is composed of an ATM Interface Module and a HFMA performing a packet forwarding. In the MIM, the HFMA RSAR receive cells from the Physical layer and reassemble the cells. And the IP Lookup controller perform a packet forwarding after packet classification. Forwarded packet is segmented into cells in the HFMA TSAR and transfer to the ALMA for the transmission to an ATM cell switch. When the MIM make use of an ATM Interface Module, it directly connect the ALMA with a PHY layer using the UTOPIA Level2 interface. Then, an ALMA performs Master Mode. Also, the HFMA TSAR performs the Master Mode in the MIM. Therefore, the UTOPIA-L2 Controller of the Slave Mode require for interfacing between an ALMA and a HFHA TSAR. In this paper, we implement the architecture and cell control mechanism for the UTOPIA-L2 Controller supporting Multi-ports.
A High Speed IP Packet Forwarding Engine of ATM based Label Edge Routers for POS Interface
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1171~1177
In this paper, we proposed a high speed IP(Internet Protocol) packet forwarding engine of ATM(Asynchronous Transfer Mode) based label edge routers for POS(Packet over SONET) interface. The forwarding engine uses TCAM(Ternary Content Addressable Memory) for high performance lookup processing of the packet received from POS interface. We have accomplished high speed IP packet forwarding in hardware by implementing the functions of high speed IP header Processing and lookup control into FPGA(Field Programmable Gate Array). The proposed forwarding engine has the functions of label edge routers as the lookup controller supports MPLS(Multiprotocol Label Switching) packet processing functionality.
The Economic Effects of Local Loop Unbundling: Focusing on the EU Case Study
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1178~1188
Local Loop Unbundling(LLU) has been understood as the way of facilitate the competition on the access and the local telephone service market. There are major benefits of stimulating the competition in the local service, avoiding access network duplication and reducing in environmental disruption. However, LLU has several disadvantages such as removing incentives for building alternative access networks, undermining existing investment in alternative access networks, introducing new substantial costs to the industry and requiring prolonged and detailed regulatory intervention. The economic effects of LLU generally will be different according to the special situation of each countries and the object of LLU. In case of EU, most of countries have already introduced and implemented LLU. But EU can't expect the economic effects on LLU emerged in the early stage of introducing it and faced with dilemma. To be realized the successful implementation of LLU, I think, it is required to be reviewed about the main issues such as the problem of regulation, the reasonable level of LLU pricing and the technical & operational problems.
Development of Evaluation Model in Telecommunication Business Incubator
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 11C, 2002, Pages 1189~1195
Recently, a number of Telecommunication Business Incubators have been established and operated with aims to promote start-ups of small and venture business. To give satisfactory results of governmental policy, there are required developing the evaluation model to support effective operations of business incubators using the objective and rational criteria. This study based on classification of evaluation factors by analytic hierarchy process. We analysed the weights of this factors and suggested the evaluation model of business incubator using the evaluation scale. Also, we evaluated 39 business incubators by suggested model, and were revealed the scores of ranging from 67 to 77 in the graduated firm's data from business incubators.