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 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
QoS Supporting Scheme Considering Service-Differentiation Ratio in Optical Burst Switching Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 12C, 2002, Pages 1197~1206
Recently, the research on the construction of optical Internet backbone networks using WDM has been actively progressed. In this paper, we propose the offset based service-differentiation scheme in optical burst switching (OBS) networks. We classify the services into two classes; high class and low class. The proposed scheme decides the offset time of high class so as to satisfy the required burst loss rate (BLR) of services according to the service-differentiation ratio (SDR). The SDR may be set depending on the environment of OBS network and user's requirements, our scheme decides the BLR of high class by using the required SDR and conservation law. Finally, we use the offset time decision (OTD) algorithm to determine the offset time of high class. The proposed scheme is evaluated through simulation. The result of simulation is compared with that of analysis to verify the proposed scheme.
Credit-Based Round Robin for High Speed Networks
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 12C, 2002, Pages 1207~1214
A scheduling scheme for high speed networks requires a low time complexity to schedule packets in a packet transmission time. High speed networks support a number of connections, different rates for each connection and variable packet length. Conventional round robin algorithms have a time complexity of O(1), but their short time fairness, latency and burstiness depend on the quantum of a connection due to serving several packets for a backlogged connection once a round. To improve these properties, we propose in this paper an efficient packet scheduling scheme which is based on the credits of a connection and has a time complexity of O(1). We also analyzed its performance in terms of short time fairness, latency and burstiness. The analysis results show that the proposed scheme can improve the performance compared with traditional round robin schemes. The proposed scheme can be easily utilized in high speed packet networks.
A New Genetic Algorithm for Shortest Path Routing Problem
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 12C, 2002, Pages 1215~1227
This paper presents a genetic algorithmic approach to shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for encoding the problem. The crossover operation that exchanges partial chromosomes (partial-routes) at positionally independent crossing sites and the mutation operation maintain the genetic diversity of the population. The proposed algorithm can cure all the infeasible chromosomes with a simple repair function. Crossover and mutation together provide a search capability that results in improved quality of solution and enhanced rate of convergence. Computer simulations show that the proposed algorithm exhibits a much better quality of solution (route optimality) and a much higher rate of convergence than other algorithms. The results are relatively independent of problem types (network sizes and topologies) for almost all source-destination pairs.
Designed and Implementation of Layered Configuration Management for the Efficient Management of Intranet
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 12C, 2002, Pages 1228~1237
Network management is composed of five major functional areas, fault, configuration, account, performance and security management in the ITU standards. Configuration management identifies, exercises control over, collects data from network element node system and provides data to the management systems. The proposed architecture is designed based on the Distributed Processing Environment of CORBA(Common Object Request Broker Architecture) Spec v2.3. In this paper, configuration management system has been designed and implemented with layered managed object. It provides that integrated management of various data link layer technology. We suggest MIB(Management Information Base)/MIT(Management Information Tree) to support integrated management and distributed environment.
Implementation of Secure VoIP System based on H.235
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 12C, 2002, Pages 1238~1244
In this paper, H.235-based security mechanism for H.323 multimedia applications was implemented. H.235 covers authentication using HMAC, Diffie-Hellman key exchange, session key management for voice channel, and encryption functions such as DES, 3DES, RC2. Extra encryption algorithms such as SEED, and AES were also included for possible use in the future. And, we also analyzed the quality of service (QoS), the requirement of implementation, and interoperability to the result in this study. The results could be applied to secure simple IP phone terminals, gateways, or gatekeepers.
Cellular IP and RSVP based on IPv6
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 12C, 2002, Pages 1245~1250
For recent years, the environment of use on internet has been changed from the wired internet access to the wireless internet access increasingly, and the use of real time application data has been increased. Therefore the research and evolution of wireless network for providing of user's mobility and QoS at the same time must be essential. IETF already proposed Mobile IPv6 for providing mobility and RSVP for QoS through resource reservation. These future are expected to be used not only wired network but also wireless network. But there are not yet proposed the integration and efficient interworking of two mechanism. For the solution of problem on efficient interworking issue, for instance signaling overhead and reservation delay increasing due to often handoff, this paper first proposed to use of IETF Cellular IP based on Mobile IPv6 for wireless network model with fast mobility and a improved RSVP mechanism using the flow label field in IPv6 header.
Design and Implementation of an MPEG-2 AAC Format-based Audio Streaming System
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 12C, 2002, Pages 1251~1264
Currently, audio streaming services such as on-demand service and live service support only a limited number of clients. They also suffer from a lack of stability and degradation of service quality due to their inefficient use of network resources. Futhermore, since the streaming services usually do not consider dynamic services, they are very inconvenience to use. In order to resolve these drawbacks, we propose a novel audio streaming system based on MPEG-2 AAC file format which are facilitated with the network bandwidths efficiently. The proposed system supports QoS for audio streaming as well as guarantees a stability while streaming service is undergoing. Moreover, the system provides a dynamic interface which enables us to use the streaming service more easily and to manage streaming servers with convenient manner. On the contrary, most of the current available static interface streaming services are mainly depending only on a single fixed web page between client and server, which in consequence lead us to use unflexible static service environment. Our implementation results show the proposed system improves the performance compared to those of the currently existing systems that use MP3 file format. It also provides some benefits such as a stability of service and a easy to management of streaming servers.
Adaptive Network Monitoring Strategy for SNMP-Based Network Management
Cheon, Jin-young ; Cheong, Jin-ha ; Yoon, Wan-oh ; Park, Sang-bang ;
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 12C, 2002, Pages 1265~1275
In the network management system, there are two approaches; the centralized approach based on SNMP and the distributed approach based on mobile agent. Some information changes with time and the manager needs to monitor its value in real time. In such a case, the polling is generally used in SNMP because the manager can query agents periodically. However, the polling scheme needs both request and response messages for management information every time, which results in network traffic increase. In this paper, we suggest an adaptive network monitoring method to reduce the network traffic for SNMP-based network management. In the proposed strategy, each agent first decides its on monitoring period. Then, the manager collects them and approves each agent's period without modification or adjusts it based on the total traffic generated by monitoring messages. After receiving response message containing monitoring period from the manager, each agent sends management information periodically without the request of manager. To evaluate performance of the proposed method, we implemented it and compared the network traffic and monitoring quality of the proposed scheme with the general polling method.
The Improvement of Translucent Cryptography
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 12C, 2002, Pages 1276~1281
Bellare and Rivest proposed the translucent cryptography which was a kind of key recovery system. Translucent cryptography is a system in which the third party can recover encrypted message with the probability p(0
1). The key recovery agency doesn't need to store the user's private key in advance. The balance between key recovery agency and user can be controlled by the value of p. For example, if p is set to be 0.4 then the key recovery agency can recover 40 out of 100 encrypted messages. In this paper, we show that user can easily deceive the key recovery agency in the translucent cryptography. Then we propose the solution of this problem.
A design of HomePNA2.0 PHY.
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 12C, 2002, Pages 1282~1287
In this Paper, we present the design of 10Mbps HomePNA(Home Phoneline Networking Alliance) PHY which is Home Network Technology using phone-line. It is connected with external interface through MII(Media Independent Interface) and AFE(Analog Front End) Interface. 10Mbps HomePNA PHY is composed with Management Block IEEE 802.3 CSMA/CD MAC(Media Access Control) Block Modulator block and Demodulator block. For their verification, we designed a prototype FPGA PCB board using XPC860T made in Motorola. We verified HomePNA frame data transmission using a driver program based Linux kernel. we verified rate negotiation by HomepNA 2.0 Link Layer Protocol.
Design of a Bit-Serial Divider in GF(2
) for Elliptic Curve Cryptosystem
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 12C, 2002, Pages 1288~1298
To implement elliptic curve cryptosystem in GF(2
m/) at high speed, a fast divider is required. Although bit-parallel architecture is well suited for high speed division operations, elliptic curve cryptosystem requires large m(at least 163) to support a sufficient security. In other words, since the bit-parallel architecture has an area complexity of 0(m
m/), it is not suited for this application. In this paper, we propose a new serial-in serial-out systolic array for computing division operations in GF(2
m/) using the standard basis representation. Based on a modified version of tile binary extended greatest common divisor algorithm, we obtain a new data dependence graph and design an efficient bit-serial systolic divider. The proposed divider has 0(m) time complexity and 0(m) area complexity. If input data come in continuously, the proposed divider can produce division results at a rate of one per m clock cycles, after an initial delay of 5m-2 cycles. Analysis shows that the proposed divider provides a significant reduction in both chip area and computational delay time compared to previously proposed systolic dividers with the same I/O format. Since the proposed divider can perform division operations at high speed with the reduced chip area, it is well suited for division circuit of elliptic curve cryptosystem. Furthermore, since the proposed architecture does not restrict the choice of irreducible polynomial, and has a unidirectional data flow and regularity, it provides a high flexibility and scalability with respect to the field size m.
Design of Microstrip array antennas for Tx/Rx dual operation at X-band
The Journal of Korean Institute of Communications and Information Sciences, volume 27, issue 12C, 2002, Pages 1299~1305
Tx/Rx dual microstrip array antennas for satellite communications are designed, fabricated, and measured in this paper. They have a Right Handed Circular Polarization (RHCP) for Tx and Left Handed Circular Polarization (LHCP) for Rx. Two stacked patches are used for wideband characteristics and corner-truncated square patches are adopted for a circular polarization. To enhance bandwidth characteristics of a circular polarization, 2
1 sequential rotation mays are applied. From the measured results, 8
1 microstrip may antennas have a good agreement with those of the simulation. Therefore the array antennas are applicable to satellite communication antennas, active phased may antennas, and radiators in other antennas.