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 31, Issue 12C - Dec 2006
Volume 31, Issue 12B - Dec 2006
Volume 31, Issue 12A - Dec 2006
Volume 31, Issue 11C - Nov 2006
Volume 31, Issue 11B - Nov 2006
Volume 31, Issue 11A - Nov 2006
Volume 31, Issue 10C - Oct 2006
Volume 31, Issue 10B - Oct 2006
Volume 31, Issue 10A - Oct 2006
Volume 31, Issue 9C - Sep 2006
Volume 31, Issue 9B - Sep 2006
Volume 31, Issue 9A - Sep 2006
Volume 31, Issue 8C - Aug 2006
Volume 31, Issue 8B - Aug 2006
Volume 31, Issue 8A - Aug 2006
Volume 31, Issue 7C - Jul 2006
Volume 31, Issue 7B - Jul 2006
Volume 31, Issue 7A - Jul 2006
Volume 31, Issue 6C - Jun 2006
Volume 31, Issue 6B - Jun 2006
Volume 31, Issue 6A - Jun 2006
Volume 31, Issue 5C - May 2006
Volume 31, Issue 5B - May 2006
Volume 31, Issue 5A - May 2006
Volume 31, Issue 4C - Apr 2006
Volume 31, Issue 4B - Apr 2006
Volume 31, Issue 4A - Apr 2006
Volume 31, Issue 3C - Mar 2006
Volume 31, Issue 3B - Mar 2006
Volume 31, Issue 3A - Mar 2006
Volume 31, Issue 2C - Feb 2006
Volume 31, Issue 2B - Feb 2006
Volume 31, Issue 2A - Feb 2006
Volume 31, Issue 1C - Jan 2006
Volume 31, Issue 1B - Jan 2006
Volume 31, Issue 1A - Jan 2006
Selecting the target year
Distributed CSMA/CA Medium Access Control for Incomplete Medium Sharing Systems with General Channel Access Constraints
Lee Byoung-Seok ; Jeon Byoung-Wook ; Choe Jin-Woo ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 5B, 2006, Pages 365~377
We define the incomplete medium sharing system as a multi-channel shared medium communication system where any types of constraints are imposed to the set of channels that may be allocated to any transmitter-receiver node pair. A set of distributed MAC schemes are proposed, all of which are based on the CSMA/CA scheme employed in IEEE 802. 11 WLAN standards. Distributed MAC schemes are proposed in three different forms, which can be differentiated by the number and the location of back-off timers; that is, (1) one timer for all queues destined for different receiver nodes, (2) multiple timers at individual transmission queues, (3) multiple timers for individual channels. Through an extensive set of computer simulations, the performances of the proposed MAC schemes show that the MAC scheme with timers at individual transmission queues outperform the others in terms of throughput and delay for most cases considered. The complexity of the proposed schemes is also compared, and the first scheme obviously turned out to be the simplest, and the complexity of the second and third schemes depends on the number of receiver nodes and the number of channels, respectively.
A Global IPv6 Unicast Address Lookup Scheme Using Variable Multiple Hashing
Park Hyun-Tae ; Moon Byung-In ; Kang Sung-Ho ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 5B, 2006, Pages 378~389
An IP address lookup scheme has become a critical issue increasingly for high-speed networking techniques due to the advent of IPv6 based on 128bit. In this paper, a novel global IPv6 unicast address lookup scheme is proposed for next generation internet routers. The proposed scheme perform a variable multiple hashing based on prefix grouping. Accordingly, it should not only minimize overflows with the proper number of memory modules, but also reduce a memory size required to organize forwarding tables. It has the fast building and searching mechanisms for forwarding tables during only a single memory access. Besides, it is easy to update forwarding tables incrementally. In the simulation using CERNET routing data as a 6bone test phase, we compared the proposed scheme with a similar scheme using a uniform multiple hashing. As a result, we verified that the number of overflows is reduced by 50% and the size of memory for forwarding tables is shrunken by 15% with 8 tables.
Active PDP Discovery for PBNM in MANETs
Lee Kyung-Jin ; Song Wang-Cheol ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 5B, 2006, Pages 390~396
Policy-based Network Management(PBNM) in the Mobile Ad-hoc network(MANETs) requires additional, reliable and efficient mechanism over PBNM in wired network. Thus, it is important that the management system in MANETs should cluster the moving nodes and manage their movements in an effective manner. In this thesis, I propose a mechanism for the policy-based management in ad hoc networks in which I consider several methods to discover the Policy Decision Point(PDP), set the management area, and manage the movements of Policy Enforcement Point(PEP) nodes in the PBNM system. Moreover, COPS-PR is extended for the mechanism. Finally, I analyze and validate the results through simulations.
Methodology of Resilient Dynamic Path Management in GMPLS Network under Multiple Link Failures
Park Jong-Tae ; Lee Wee-Hyuk ; Kwon Jung-Ho ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 5B, 2006, Pages 397~404
As an increase in recent optical network-based IP services, GMPLS management framework becomes more important than ever before. In this paper, we propose the dynamic GMPLS path management algorithm, which can satisfy the users with their traffic engineering recovery requirements and find out the best backup service path under multiple link failures. To be more specific, we are deriving the soluble conditions of a backup path which is satisfied in a GMPLS network. In addition, through proposing the fast backup path selection algorithm, we can sufficiently satisfy a user's recovery requirement and minimally protect the suspension of the service against a link failure.
Automated Testing of Online Game Servers by Agents
Lee Hun-Joo ; Jung Yong-Woo ; Lim Bum-Hyun ; Shim Kwang-Hyun ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 5B, 2006, Pages 405~412
In this paper, we present an efficient method for simulating massively virtual clients in an online game environment. Massively multi-player online games and other multi-user based networked applications are becoming more attractive to the gamer players. Such kind of technology has long been researched in the area called Networked Virtual Environments. In the game development process, a set of beta tests is used to ensure the stability of online game servers. A set of testing processes consumesa lot of development resources such as cost, time, and etc. The purpose of VENUS system is to provide an automated beta test environment to the game developers to efficiently test the online games to reduce development resources.
Slective Buffering Macro Handover Which Applies The F-SNOOP in Hierarchical structure
Ahn Chi-Hyun ; Kim Dong-Hyun ; Kim Hyoung-Chul ; Ryou Hwang-Bin ; Lee Dae-Young ; Jun Kye-Suk ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 5B, 2006, Pages 413~420
HMIPv6 is designed to reduce the signaling load to external network and improve handover speed of MN by including Mobility Anchor Point(MAP) in local handover. However in this case of macro handover, it's just used pervious MIPv6 handover algorithm. So, it occurs packet loss and transmission delay problem. In this paper, we propose the mechanism applying the HMIPv6 for Fast Handover to choose suitable to the condition buffering handover. The condition for the selection is result distance measurement between MN and CN, between MN and NAR. Furthermore, using F-SNOOP protocol, it is possible to improve wireless network performance. Wireless network has high Bit Error Rate(BER) characteristic because of path loss, fading, noise and interference. TCP regards such errors as congestion and starts congestion control. This congestion control makes packet transmission rate low. However, F-SNOOP improves TCP performance based on SNOOP and Freeze TCP that use Zero Window Advertisement(ZWA) message when handoff occurs in wireless network.
Performance of Capability Aware Spanning Tree Algorithm for Bridged Networks
Koo Do-Jung ; Yoon Chong-Ho ; Lim Jae-Myung ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 5B, 2006, Pages 421~429
In this paper, we suggest a new capability aware spanning tree(CAST) algorithm for Ethernet bridged network which consists of both legacy Ethernet bridges and synchronous Ethernet ones. The legacy spanning tree algorithm specified in IEEE 802.1D standard select root bridge and construct tree based on each bridge's identifier without consideration of each bridge's capability. Thus we note that if the legacy STP may assign a synchronous bridge as a root bridge, the bridge may become a bottleneck for asynchronous trafficbecause of bandwidth limitation for asynchronous traffic. In this paper, the CAST algorithm constructsmultiple spanning tree by using of bridge capability and makes different transmission path for each traffics, can removes this kind of defect. From the simulation results, we can see that the proposed CAST algorithm has better end-to-end delay performance than legacy spanning tree algorithm in high traffic load and multiple hops environment.
UPnP-based QoSAgent for QoS-guaranteed Streaming Service in Home Networks
Lee Hyun-Ryong ; Moon Sung-Tae ; Kim Jong-Won ; Shin Dong-Yun ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 5B, 2006, Pages 430~441
As the various A/V devices and home networks are delivered to users, home networks are changing to an entertainment network. It is expected that the required network bandwidth and the amount of usage of media content in home entertainment networks will be increased. Although the access networks and home networks becoming a high speed network, there remains the problems for QoS-guaranteed media content transfer in home networks. Also, in the home network, there can be network traffic caused by applications like video conferencing, video telephone, and VoIP(voice over IP) as well as inner network traffic of home network. Since media content transfer requires the real-time delivery, it is very important and basic requirement that is to transfer media content to A/V device user wants while keeping the media quality. Even though there are many middleware protocol for home networking, they provide basic device discovery and control or simple functions for QoS-guaranteed media content transfer that are not enough to provide QoS-guaranteed media transfer service that user wants. Thus, in this paper, we propose the technique based on UPnP(universal plug and play) protocol for QoS-guaranteed media content transfer in the home network. The proposed technique is compatible with UPnP and can be used with UPnP as additional functions. In this paper, we utilize VideoLAN application to verify the proposed technique. We add the additional modules that support the proposed technique's function to VideoLAN and we verify the its functions through various test scenarios.
PID algorithm-based Adaptive Bandwidth Control(ABC) System with Incoming Traffic in Home Gateway
Choi Dong-Hee ; Kim Seong-Hoon ; Park Hong-Seong ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 5B, 2006, Pages 442~448
This paper considers a home gateway(HG) that processes VOD services and controls home appliances. This paper proposes a PID algorithm-based adaptive bandwidth control method used in the HG, which guarantees QoS of incoming traffic such as VOD and real-time control data via control of outgoing traffic and have little effects on the CPU computation time. The proposed method is validated via implementation of real test environment.
Adaptive Limited Dynamic Bandwidth Allocation Scheme for EPON
Hwang Jun-Ho ; Yoo Myung-Sik ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 5B, 2006, Pages 449~455
Due to advance in multimedia applications and integrated Internet services, the optical access networks have been actively studied. In particular, Ethernet passive optical network (EPON) has received much attention due to high bandwidth provision with low cost. In EPON system, the data transmission is carried out in two directions: downstream (from OLT to ONU) and upstream (from ONU to OLT). The downstream data is broadcasted to every ONUs, while the upstream data is point-to-point transmitted between each ONU and OLT, where the uplink is shared by all ONUs in the form of TDMA. The bandwidth allocation algorithm is required to efficiently manage the bandwidth on the uplink. The limited algorithm was proposed to enhance the capability of dynamic bandwidth allocation. In this paper, we propose the adaptive limited algorithm to enhance the shortcomings of limited algorithm. The adaptive limited algorithm enhances the dynamics on bandwidth allocation, and at the same time controls the fairness on packet delay. Through the computer simulations, it is shown that the adaptive limited algorithm achieves high dynamic on bandwidth allocation, maintains a good fairness on packet delay between ONUs, and keeps the fairness on the bandwidth on the demand basis.
On the Optimal Selection of Wireless Access in Interoperating Heterogeneous Wireless Networks
Cho Geun-Ho ; Choe Jin-Woo ; Jun Sung-Ik ; Kim Young-Sae ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 5B, 2006, Pages 456~477
Due to advances in wireless communication technology and increasing demand for various types of wireless access, cellular, WLAN, and portable internet(such as WiBro and IEEE 802.16) systems are likely to be integrated into a unified wireless access system. This expectation premises the availability of multi-mode handsets and cooperative interworking of heterogenous wireless access networks allied by roaming contracts. Under such environments, a user may lie in the situation where more than one wireless accesses are available at his/her location, and he/she will want to choose the 'best' access among them. In this paper, we define the 'best' access(es) as the access(es) that charges minimum cost while fulfilling the required QoS of wireless access, and address the problem of choosing the optimal set of accesses theoretically by introducing a graph representation of service environment. Two optimal selection algorithms are proposed, which individually consider cases where single or multiple wireless access can be supported by multi-mode handsets.
A Study on the Effective Method of Generating the Dynamic Web Documents in the Multi-user System
Lee Hyun-Chang ; Lee Jong-Eon ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 5B, 2006, Pages 478~485
In this paper, we analyze the conditions of generating the dynamic Web documents in multi-user server and propose effective method for it. PSSI technique leads to replace the complex process of modifying a CGI source program by simply correcting the HTML Web document in the external file form. This technique has the strong points of CGI, flexibility and security of programming as well as those of SSI, easiness of modifying Web documents. Due to the characteristics of PSSI that Web source documents are in the form of external file, we show that with a single CGI program an individual user can design and modify his own Web documents in his directory. This means that PSSI technique has more advantage in managing the server than the CGI method which requires CGI program to be set up whenever that service is needed.
Analysis on Information Security Manpower Policy by the Analytic Hierarchy Process
Kim Tae-Sung ; Jun Hyo-Jung ;
The Journal of Korean Institute of Communications and Information Sciences, volume 31, issue 5B, 2006, Pages 486~493
As information threats to information systems diffuse, the information security becomes a major concern. Information security manpower who produce and implement information security products, and who are in charge of information security in organizations, has been important. Korean government has implemented various policies to promote the information security manpower. Those policies have been successful to supply enough number of information security manpower, but not successful to supply information security manpower to meet the various requirements of the manpower demand. In this study we adopt analytic hierarchy process(AHP) to analyze the priorities of information security technology categories to meet the demand. Results of the study suggest that the government should concentrate on promotion of manpower for the field of the 'System and Network Security Technology'.