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 29, Issue 12C - Dec 2004
Volume 29, Issue 12B - Dec 2004
Volume 29, Issue 12A - Dec 2004
Volume 29, Issue 11C - Nov 2004
Volume 29, Issue 11B - Nov 2004
Volume 29, Issue 11A - Nov 2004
Volume 29, Issue 10C - Oct 2004
Volume 29, Issue 10B - Oct 2004
Volume 29, Issue 10A - Oct 2004
Volume 29, Issue 9C - Sep 2004
Volume 29, Issue 9B - Sep 2004
Volume 29, Issue 9A - Sep 2004
Volume 29, Issue 8C - Aug 2004
Volume 29, Issue 8B - Aug 2004
Volume 29, Issue 8A - Aug 2004
Volume 29, Issue 7C - Jul 2004
Volume 29, Issue 7B - Jul 2004
Volume 29, Issue 7A - Jul 2004
Volume 29, Issue 6C - Jun 2004
Volume 29, Issue 6B - Jun 2004
Volume 29, Issue 6A - Jun 2004
Volume 29, Issue 5C - May 2004
Volume 29, Issue 5B - May 2004
Volume 29, Issue 5A - May 2004
Volume 29, Issue 4C - Apr 2004
Volume 29, Issue 4B - Apr 2004
Volume 29, Issue 4A - Apr 2004
Volume 29, Issue 3C - Mar 2004
Volume 29, Issue 3B - Mar 2004
Volume 29, Issue 3A - Mar 2004
Volume 29, Issue 2C - Feb 2004
Volume 29, Issue 2B - Feb 2004
Volume 29, Issue 2A - Feb 2004
Volume 29, Issue 1C - Jan 2004
Volume 29, Issue 1B - Jan 2004
Volume 29, Issue 1A - Jan 2004
Selecting the target year
A Scheduler and Scheduling Algorithm for Time Slot Assignment based on Wavelength
Kim Kyoung-Mok ; Oh Young-Hwan ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 1B, 2004, Pages 1~7
Increase of internet users and new type of applied traffic such as game, news, distributed computing, online image conference, and real time audio and video have leaded to demand for more bandwidth for each application. This algorithm represents a complex optical exchanger having typical wavelength switching function and time-slotted transmission function. Performance assessment of the proposed OXC (Optical Cross connect) sttucture defines LFS (Limit Frame Size) and VFS (Variable Frame Size) for classification by packet type and calculates the channel effect and loss probability depending the demanded bandwidth by access node increase. Optical exchanger in this type of structure can guarantee future network expansion as well as decrease of frame collision resulted from node increase.
Channel Condition Adaptive Error Concealment using Scalability Coding
Han Seung-Gyun ; Park Seung-Ho ; Suh Doug-Young ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 1B, 2004, Pages 8~17
In this paper: we propose the adaptive error concealment technique for scalable video coding over wireless network error prove environment. We prove it is very effective that Error concealment techniques proposed in this paper are applied to scalable video data. In this paper, we propose two methods of error concealment. First one is that the en·or is concealed using the motion vector of base layer and previous VOP data. Second one is that according to existence of motion vector in error position, the error is concealed using the same position data of base layer when the motion vector is existing otherwise using the same position data of previous VOP when the motion vector is 0(zero) adaptively. We show that according to various error pattern caused by condition of wireless network and characteristics of sequence, we refer decoder to base layer data or previous enhancement layer data to effective error concealment. Using scalable coding of MPEG-4 In this paper, this error concealment techniques are available to be used every codec based on DCT.
A New Pipelined Binary Search Architecture for IP Address Lookup
Lim Hye-Sook ; Lee Bo-Mi ; Jung Yeo-Jin ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 1B, 2004, Pages 18~28
Efficient hardware implementation of address lookup is one of the most important design issues of internet routers. Address lookup significantly impacts router performance since routers need to process tens-to-hundred millions of packets per second in real time. In this paper, we propose a practical IP address lookup structure based on the binary tree of prefixes of different lengths. The proposed structure produces multiple balanced trees, and hence it solve the issues due to the unbalanced binary prefix tree of the existing scheme. The proposed structure is implemented using pipelined binary search combined with a small size TCAM. Performance evaluation results show that the proposed architecture requires a 2000-entry TCAM and total 245 kbyte SRAMs to store about 30,000 prefix samples from MAE-WEST router, and an address lookup is achieved by a single memory access. The proposed scheme scales very well with both of large databases and longer addresses as in IPv6.
On the efficient buffer management and early congestion detection at a Internet gateway based on the TCP flow control mechanism
Yeo Jae-Yung ; Choe Jin-Woo ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 1B, 2004, Pages 29~40
In this paper, we propose a new early congestion detection and notification technique called QR-AQM. Unlike RED and it's variation, QR-AQM measures the total traffic rate from TCP sessions, predicts future network congestion, and determine the packet marking probability based on the measured traffic rate. By incorporating the traffic rate in the decision process of the packet marking probability, QR-AQM is capable of foreseeing future network congestion as well as terminating congestion resolution procedure in much more timely fashion than RED. As a result, simulation results show that QR-AQM maintains the buffer level within a fairly narrow range around a target buffer level that may be selected arbitrarily as a control parameter. Consequently, compared to RED and its variations, QR-AQM is expected to significantly reduce the jitter and delay variance of packets traveling through the buffer while achieving nearly identical link utilization.
A Framework for OAM in OBS Networks
Shin Jong-Dug ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 1B, 2004, Pages 41~51
Operation and maintenance (OAM) in optical burst switching (OBS) networks has not yet been addressed even though OBS has been gaining research interest in recent years. In this paper, we defined five OBS functions such as Burst Termination (BT), Burst Transmission (BTX), Burst Switching (BSW), Routing and Switching Control (RSC), and Protection and Restoration (PAR). A functional model for OBS networks and an OAM architecture are designed to meet the operational requirements. We present the first framework to realize OAM in OBS networks, including OAM activities, OAM-capable OBS nodes such as ingress edge, core, and egress edge nodes, OAM information and communication models and protocols. A number of examples of possible network failures are pointed out and the corresponding reactions to these using the proposed OAM architecture are presented
Packet loss pattern modeling of cdma2000 mobile Internet channel for network-adaptive multimedia service
Suh Won-Bum ; Park Sung-Hee ; Suh Doug-Young ; Shin Ji-Tae ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 1B, 2004, Pages 52~63
Packet loss process of cdma2000 mobile Internet channel deployed in Korea is modeled as a two state Markov process known as Gilbert model. This paper proposes the procedures to derive four parameters of the our modified Gilbert model from packet loss trace taken from two major cdma2000 networks in Korea. These four parameters are derived in various situations, that is, with fixed and moving terminals, in open field and urban areas. They can be used to produce synthetic packet loss patterns for study of the channel. Moreover, if they are calculated on-line during multimedia service, they can be used to make loss protection controls adaptive to network condition.
Controlled Bandwidth Borrowing with Extended RSVP-TE to Maximize Bandwidth Utilization
Kim Chul ; Kim Young-Tak ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 1B, 2004, Pages 64~72
Multiprotocol Label Switching (MPLS) has been developed as a key technology to enhance the reliability, manageability and overall quality of service of core If networks with connection-oriented tunnel LSP and traffic engineering such as constraint-based routing, explicit routing, and restoration. In this paper, we propose a control bandwidth borrowing scheme that maximizes the utilization of tunnel LSPs or physical links by an extension to the RSVP-TE label distribution protocol. MPLS-based core switching network and VPN services rely on the establishment of connection-oriented tunneled LSPs that are configured or predefined by network management systems. The mechanism of network management system varies from (i) a relatively static LSP establishment accounting, to (ii) a dynamic QoS routing mechanisms. With the use of hierarchical LSPs, the extra bandwidth that is unused by the trunk (outer) LSPs should be fully allocated to their constituent end-to-end user traffic (inner) LSPs in order to maximize their utilization. In order to find out the unused extra bandwidth in tunnel LSP or physical link and redistribute these resources to constituent LSPs, we expend the functionality of RSVP-TE and the found unused extra bandwidth is redistributed with a weight-based recursive redistribution scheme. By the extended RSVP-TE and proposed recursive redistributed scheme, we could achieve the instantaneous maximized utilization of tunnel LSP or physical link suffering from the potential under-utilization problem and guarantee the end-to-end QoS requirements. With the proposed scheme, network manager can manage more effectively the extra available bandwidth of hierarchical LSPs and maximize the instantaneous utilization of the tunneled LSP resources.
Design and Implementation of XML based Global Peer-to-Peer Engine
Kwon Tae-suk ; Lee Il-su ; Lee Sung-young ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 1B, 2004, Pages 73~85
SIn this paper, we introduce our experience for designing and implementing new concept of a global XML-based Peer-to-Peer (P2P) engine to support various P2P applications, and interconnection among PC, Web and mobile computing environments. The proposed P2P engine can support to heterogeneous data exchanges and web interconnection by facilitating with the text-base XML while message exchange are necessary. It is also to provide multi-level security functions as well as to apply different types of security algorithms. The system consist of four modules; a message dispatcher to scheduling and filtering the message, a SecureNet to providing security services and data transmission, a Discovery Manager to constructing peer-to-peer networking, and a Repository Manager to processing data management including XML documents. As a feasibility test, we implement various P2P services such as chatting as a communication service, white-board as an authoring tool set during collaborative working, and a file system as a file sharing service. We also compared the proposed system to a Gnutella in order to measure performance of the systems.
A Modified REDP Aggregate Marker for improving TCP Fairness of Assured Services
Hur Kyeong ; Eom Doo-Seop ; Tchah Kyun-Hyon ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 1B, 2004, Pages 86~100
To provide the end-to-end service differentiation for assured services, the random early demotion and promotion (REDP) marker in the edge router at each domain boundary monitors the aggregate flow of the incoming in-profile packets and demotes in-profile packets or promotes the previously demoted in-profile packets at the aggregate flow level according to the negotiated interdomain service level agreement (SLA). The REDP marker achieves UDP fairness in demoting and promoting packets through random and early marking decisions on packets. But, TCP fairness of the REDP marker is not obvious as for UDP sources. In this paper, to improve TCP fairness of the REDP marker, we propose a modified REDP marker where we combine a dropper, meters and a token filling rate configuration component with the REDP marker. To make packet transmission rates of TCP flows more fair, at the aggregate flow level the combined dropper drops incoming excessive in-profile packets randomly with a constant probability when the token level in the leaky bucket stays in demotion region without incoming demoted in-profile packets. Considering the case where the token level cannot stay in demotion region without the prior demotion, we propose a token filling rate configuration method using traffic meters. By using the token filling rate configuration method, the modified REDP marker newly configures a token filling rate which is less than the negotiated rate determined by interdomain SLA and larger than the current input aggregate in-profile traffic rate. Then, with the newly configured token filling rate, the token level in the modified REDP marker can stay in demotion region pertinently fir the operation of the dropper to improve TCP fairness. We experiment with the modified REDP marker using ns2 simulator fur TCP sources at the general case where the token level cannot stay in demotion region without the prior demotion at the negotiated rate set as the bottleneck link bandwidth. The simulation results demonstrate that through the combined dropper with the newly configured token filling rate, the modified REDP marker also increases both aggregate in-profile throughput and link utilization in addition to TCP fairness improvement compared to the REDP marker.
Development of SIP based Call Processing Language Server System
Yi Jong-Hwa ; Min Kyung-Joo ; Kang Shin-Gak ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 1B, 2004, Pages 101~108
SIP(Session Initiation Protocol) is a suitable protocol for supporting Internet telephony services and currently market requirements fur developing supplementary telephony services such as unconditional call forwarding, call forwarding on busy or no answer, call filtering services have recently grown. CPL(Call Processing Language) is a standard technology that can be used to describe and control internet telephony services. In this paper, we describe the CPL system for supplementary Internet telephony services using SIP as an application level call signaling protocol. Those supplementary services are composed of CPL client which is a SIP UA, SIP Proxy server, Registrar and CPL server In this paper, we describe the design and implementation of the CPL server system in detail which is developed in Linux 7.2 using C and C++ programming languages.
An Analysis on the Burst Assembly Schemes in the Optical Burst Switched Networks.
Park Dong-Hee ; Yoo Myungsik ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 1B, 2004, Pages 109~116
Optical Burst Switching (OBS) technology has drawn much attention as a promising solution for IP/WDM networks. OBS has the features such as the offset time, the delayed reservation and the burst assembly. In particular, the burst assembly, which assembles IP packets into the data bursts, has a great impact on the performance of OBS network. In this paper, we compare the performance of three different burst assembly schemes and investigate their impact on the performance of OBS network.
A Study on Implementation of 3D Player based on MPEG-4 Using Java Language
Park Young-Kyung ; Kim Yong-Ho ; Jung Jong-Jin ; Kim Joong-Kyu ; Ahn Sang-Woo ; Choi Jin-Soo ; Kim Jin-Woong ; Ahn Chie-Teuk ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 1B, 2004, Pages 117~124
With MPEG-4 3D mesh coding(3DMC), the problem of the need of a wide bandwidth can be solved to store and transmit 3D information because of its high compression rate. And to realize the 3D information service with broadcasting or internet, one needs to transmit not only the 3D contents but also the 3D player. Therefore, in this paper we implement a 3D player based on MPEG-4 using a java language. A well-known java language employed in this paper provides the player with a wider range of applications, for example, when the O/S or the platform are different, due to its properties of scalability and universality. The implemented player which has functions (translation, rotation, etc) that can manipulate contents decodes the 3D contents and displays them. In addition, the player has a network function that receives a 3D content from the server. This paper explains the architecture and characteristics of the player and shows its simulation results.
Advanced QoS Provisioning Scheme using CDMA Traffic Measurement in All-IP Networks
Kim Seok-Hoon ; Ryoo In-Tae ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 1B, 2004, Pages 125~132
In this paper, we propose an advanced QoS provisioning scheme (AQPS) that can provide satisfied QoS for multimedia applicatios based on accurate traffic measurements. We first consider the 1xEV-DV system as a target system, extract QoS requirements or the system, and then develop a corresponding QoS provisioning method using CDMA traffic measurement. The AQPS has been verified to outperform the existing system used in the current 1xEV-DV network and to efficiently manage network resources by computer simulations.
A Cross-National Study on the Relationship of Service Quality, Customer Satisfaction and Customer Loyalty in Mobile Telecommunication Services
Kim Min-Young ; Kim Moon-Koo ; Park Myeong-Cheol ;
The Journal of Korean Institute of Communications and Information Sciences, volume 29, issue 1B, 2004, Pages 133~144
This research aimed to do an empirical study, by comparing the relationships of service quality, customer satisfaction and customer loyalty in mobile telecommunications between Korea and China which possess different growth phases. For this purpose, six factors in service quality, customer satisfaction and customer loyalty have been under a regression analysis to verify the causal relationship. The key findings of this study are as follows. Both Korea and China showed the causal relationship between customer satisfaction and customer loyalty; the service support which applies as the core services, have been found to be the most important factors in customer satisfaction and customer loyalty. And this study has been able to establish strategic views on reinforcing customer bases in mobile telecommunication service markets in both countries.