Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartC
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 9C, Issue 6 - Dec 2002
Volume 9C, Issue 5 - Oct 2002
Volume 9C, Issue 4 - Aug 2002
Volume 9C, Issue 3 - Jun 2002
Volume 9C, Issue 2 - Apr 2002
Volume 9C, Issue 1 - Feb 2002
Volume 9, Issue 6 - 00 2002
Volume 9, Issue 5 - 00 2002
Volume 9, Issue 1 - 00 2002
Selecting the target year
A Digital Image Watermarking Scheme using ElGamal Function
Lee, Jean-Ho ; Kim, Tai-Yun ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 1~8
DOI : 10.3745/KIPSTC.2002.9C.1.001
Digital image watermarking is a technique for the purpose of protecting the ownership of the image by embedding proprietary watermarks in a digital image. It is required for the digital image watermarking scheme to pursue the robustness against water marking attacks and the perceptual Invisibility more than usual in steganography area, to guarantee not a hidden watermarking algorithm but the publicity of water-marking algorithm details and hidden use of key, which can protect the unauthorized user access from detection. In this paper we propose a new copyright watermarking scheme, which is barred on one-way hash functions using ElGamal functions and modular operations. ElGamal functions are widely used in cryptographic systems. Our watermarking scheme is robust against LSB(least significant bit) attacks and gamma correction attack, and also perceptually invisible. We demonstrate the characteristics of our proposed watermarking scheme through experiments. It is necessary to proceed as the future work the algorithm of achieving at the same time both the pseudo-randomness for the steno-key generation and the asymmetric-key generation
WebCam : A Web-based Remote Recordable Surveillance System using Index Search Algorithm
Lee, Myeong-Ok ; Lee, Eun-Mi ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 9~16
DOI : 10.3745/KIPSTC.2002.9C.1.009
As existing analog video surveillance systems could save and retrieve data only in a limited space within short distance, it had many constraints in developing into various application systems. However, on the back of development of the Internet and computer technologies, digital video surveillance systems can be controlled from a remote location by web browser without space limits. Moreover, data compression and management technologies with Index Search algorithm make it possible to efficiently handling, storing, and retrieving a large amount of data and further motion detection algorithm enhances a recording speed and efficiency for a practical application, that is, a practical remote recordable video surveillance system using our efficient algorithms as mentioned, called WebCam. The WebCam server system can intelligently record and save video images digitized through efficient database management, monitor and control cameras in a remote place through user authentication, and search logs.
A Fast Authentication Algorithm For Smooth Handoff
Kim, In-Su ; Kim, Gi-Cheon ; Kim, Hyeon-Gon ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 17~20
DOI : 10.3745/KIPSTC.2002.9C.1.017
IMT-2000 technologies are divided 3G packet data system that using mobile IP and GPRS that based on the GSM networks. These technologies Push introduce mobile IP to support seamless roaming. In mobile If environments, use AAA server such as RADIUS or DIAMETER to provide authentication service for dial-up computers. This factor is important for mobile nodes. Mobile If require strong authentication between mobile nodes and home agents. We propose application of AAA protocols for smooth handoff mechanism in IMT-2000 environments.
Fair Queuing Algorithm Minimizing Packet Delay in Enterprise Network
Youn, Yeo-Hoon ; Kim, Tai-Yun ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 21~30
DOI : 10.3745/KIPSTC.2002.9C.1.021
Nowadays the fair queuing field is studied actively for solving the unfair queuing problem which degrades the service performance of various applications on network. Above all DRR is a scheme that has lower work complexity and can be implemented easily. It guarantees the fair service by serving each queue every round Service Quantum(SQ) that includes the service deficit of the previous round. But it increases the delay by the numbers of unnecessary resetting of SQ or round circulation for the service that have the packet size over maximum several kbyte. In this paper, We propose the method that sets SQ dynamically to minimize this problem and the method that minimizes the work complexity on processing of packet. The proposed scheme minimizes the delay on various applications in enterprise environment by setting SQ dynamically and processing the packet simply.
An Effective Control Scheme for Unstructued Dataset in the Communication Environments
Bae, Myung-Nam ; Choi, Wan ; Lee, Dong-Chun ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 31~38
DOI : 10.3745/KIPSTC.2002.9C.1.031
Communication systems, such as Switching System, are operated in the restricted conditions that the suggested events must finish in the time-constraints. Therefore, the data in the systems requires not only rapid access time, but also completion in the restricted time. Many existing data systems have been developed and used in the communication environments. But, the system construct a structural scheme and provide users with basic data services only. In recent, as the complexity of data in the communication area is rapidly increasing, it requires the data system which can represent the unstructured dataset and complete the data access in this dataset on the restricted condition. In this paper, we propose the data model which is suitable to the unstructured multi-dataset environment. The data model supports the rapid data access for unstructured dataset and enables users to easily retrieve data needed at the execution. In addition to, we define the several algorithms to clarify the structure of our model.
Performance Improvement Method of TCP Protocol using Splitting Acknowledgement Packet in Integrated Wired-Wireless Network
Jin, Gyo-Hong ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 39~44
DOI : 10.3745/KIPSTC.2002.9C.1.039
In this paper, in order to improve the performance of TCP short traffic application services in wireless Internet environments, the Split-ACKs (SPACK) scheme is proposed. In wireless networks, unlike wired networks, packet losses will occur more often due to high bit error rates. Therefore, each packet loss over wireless lints results in congestion control procedure of TCP being invoked at the source. This causes severe end-to-end Performance degradation of TCP. In this paper, to alleviate the TCP Performance, the SPACK method, split acknowledgement Packets in the base station, is proposed. Using computer simulation, the performance of TCP using SPACK is analysed and shows better performance than traditional TCP Protocol.
The Dynamic Flow Admission Control for Providing DiffServ Efficiently in MPLS Networks
Im, Ji-Yeong ; Chae, Gi-Jun ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 45~54
DOI : 10.3745/KIPSTC.2002.9C.1.045
MPLS(Multiprotocol Label Switching) is regarded as a core technology for migrating to the next generation Internet. In this paper, we propose an dynamic flow admission control supporting DiffServ(Differentiated Services) to provide QoS in MPLS networks. Our proposed model dynamically adjusts the amount of admissible traffic based on transmittable capacity over one outgoing port. It then transmits the Packets while avoiding congested area resulting traffic loss. Ingress LSRs find out the congested area by collecting network state information at QoS state update for QoS routing table. Our Proposed model manages the resource efficiently by protecting the waste of resources that is a critical Problem of DiffServ and makes much more flows enter the network to be served.
Design of a Forwarding Engine Supporting Application-based Differential Services in MPLS ATM System
Kim, Eung-Ha ; Jo, Yeong-Jong ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 55~64
DOI : 10.3745/KIPSTC.2002.9C.1.055
A number of MPLS ATM systems have been proposed to increase the access speed of current rooters, which only support the beat-effort service. However, the MPLS ATM systems have to support the so-called differential service, which discriminates the applications according to the servile clads because they do not be satisfied the Internet users who use diverse applications. In this paper, to support this differential service a detailed forwarding procedure based on a LSP control method and an application-based marking algorithm is suggested. The LSP control method establishes several different LSPs for each FEC according to the service class and the application-based marking algorithm chooses a proper differential service depending on the application category. Also, a design scheme of forwarding engine, which can be easily implemented with a minimum modification of existing MPLS ATM systems is proposed. And, the best simulation result of high priority application category is gained when the proposed forwarding algorithm is compared with existing algorithms.
A Study on Implementation of a VC-Merge Capable High-Speed Switch on MPLS over ATM
Kim, Young-Chul ; Lee, Tae-Won ; Lee, Dong-Won ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 65~72
DOI : 10.3745/KIPSTC.2002.9C.1.065
In this paper, we implement a high-speed swatch tilth the function for label integration to enhance the expansion of networks using the label space of routers efficiently on MPLS over ATM networks. We propose an appropriate hardware structure to support the VC-merge function and differentiated services simultaneously. In this paper, we use the adaptive congestion control method such as EPD algorithm in carte that there is a possibility of network congestion in output buffers of each core LSR. In addition, we justify the validity of the proposed VC-merge method through simulation and comparison to conventional Non VC-merge methods. The proposed VC-merge capable switch is modeled in VHDL. synthesized, and fabricated using the SAMSUNG 0.5um SOG process.
A Study on the Bandwidth Assignment Scheme for Video Data Using Dynamic Parameters in the Wireless ATM Networks
Jang, Dong-Hyeok ; Kim, Seung-Hwan ; Lee, Sun-Sook ; Kwon, Oh-Seok ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 73~78
DOI : 10.3745/KIPSTC.2002.9C.1.073
In WATM networks, in order to perform dynamic slot allocation required slots of mobile terminals are estimated based on DP (Dynamic Parameter) reflecting characteristics of traffic. In VBR (Variable Bit Rate) traffic, slot allocation is done at MT considering both time-dependent characteristics and QoS (Quality of Service) requirements. In this paper, DPs-buffer state information and buffer state change-are transmitted through in-band signaling. BS (Base Station) performs dynamic slot allocation considering traffic characteristics of each MT (Mobile Terminal), in other words, buffer state information informs the potentiality of `buffer full state`to BS if MT buffer is over the specific threshold value and buffer state change notifies change in buffer state of incoming cells to MT. If buffer state information is equal to `low (more than threshold)` and `abrupt increase` it generates `buffer full` state cell transmission delay or cell loss might occur. At this time BS should assign additional slots to MT, and then MT consumes cells in its buffer. In simulation, the proposed scheme shows better performance in cell delay and loss than EPSA (Estimation-Prorated Slot Assignment) in-band scheme.
A Distributed Proxy Server System for Wireless Mobile Web Service
Lee, Hyuk-Joon ; Kim, Dong-Won ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 79~88
DOI : 10.3745/KIPSTC.2002.9C.1.079
Transcoding proxy strategy has been widely used as a means to reduce the delay in retrieving Web pages over wireless mobile data service networks. However, this strategy has the serious drawbacks of being a potential point of failure or a bottleneck of the service. We developed a distributed proxy server system in which multiple proxy servers are installed at geographically dispersed locations and share the workloads among them by serving mobile hosts only within assigned regions. A new handoff message protocol to enable handoffs between proxies as the mobile hosts move between regions is proposed. According to the proxy server handoff protocol, a client agent at the mobile horst requests a proxy server to start handoff processing by which two proxy servers synchronize distilled data belonging to a HTTP session that must be maintained across the handoff. Also, we introduce the architecture of the proxy server and the client agent that handles the proxy server handoff. Finally, we evaluate the proposed system through performance test.
An Enhanced Handoff Mechanism for Cellular IP
Kim, Gyeong-A ; Kim, Jong-Gwon ; Park, Jae-Yun ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 89~96
DOI : 10.3745/KIPSTC.2002.9C.1.089
Handoff is one of the most important factors that ma? degrade the performance of TCP connections in wireless data networks. In this paper, we present a lossless and duplication free handoff scheme called LPM (Last Packet Marking) for improving Cellular If semisoft handoff. LPM signals the safe handoff cue by sending a specially marked packet to mobile hosts. SPM (Semisoft rePly Message) is the only newly introduced control packet. Our performance study shows that LPM achieves lossless packet delivery without duplication and increases TCP throughput significantly.
The Seamless Handoff Algorithm based on Multicast Group Mechanism among RNs in a PDSN Area
Shin, Dong-Jin ; Kim, Su-Chang ; Lim, Sun-Bae ; Oh, Jae-Chun ; Song, Byeong-Kwon ; Jeong, Tae-Eui ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 97~106
DOI : 10.3745/KIPSTC.2002.9C.1.097
In 3GPP2 standard, MIP is used and a PDSN performs the function of FA to support macro mobility. When a MS is roaming from a PDSN area to another, the mobility supported is called macro mobility, while it is called micro mobility when a MS is roaming from a RN area to another in a PDSN area. Since a PDSN performs the function of FA in 3GPP2 standard, it is possible to support mobility but its mechanism is actually for supporting macro mobility, not for micro mobility, thus it is weak in processing fast and seamless handoff to support micro mobility. In this paper, we suggest the seamless handoff algorithm barred on multicast group mechanism to support micro mobility. Depending on the moving direction and velocity of a MS, the suggested algorithm constructs a multicast group of RNs on the forecasted MS`s moving path, and maximally delays RNs`joining to a multicast group to increase the network efficiency. Moreover, to resolve the buffer overhead problem of the existent multicast scheme, the algorithm suggests that each RN buffers data only after the forecasted handoff time. To prove deadlock freeness and liveness of the algorithm. we use state transition diagrams, a Petri-net modeling and its reachability tree. Then, we evaluate the performance by simulation.
Development of a Scalable Clustering A/V Server for the Internet Personal-Live Broadcasting
Lee, Sang-Moon ; Kang, Sin-Jun ; Min, Byung-Seok ; Kim, Hag-Bae ; Park, Jin-Bae ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 107~114
DOI : 10.3745/KIPSTC.2002.9C.1.107
In these days, rapid advances of the computer system and the high speed network have made the multimedia services popularized among various applications and services in the internet. Internet live broadcasting, a part of multimedia services, makes it possible to provide not only existing broadcasting services including audio and video but also interactive communications which also expand application scopes by freeing from both temporal and spatial limitation. In the Paper, an interned Personal-live broadcasting server system is developed by allowing individual users to actively create or join live-broadcasting services with such basic multimedia devices as a PC camera and a sound card. As the number of broadcasters and participants increases, concurrent multiple channels are established and groups are to be expanded. The system should also guarantee High Availability (HA) for continuous services even in the presence of partial failure of the cluster. Furthermore, a transmission mode switching is supported to consider network environments in the user system.
A New Web Cluster Scheme for Load Balancing among Internet Servers
Kim, Seung-Young ; Lee, Seung-Ho ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 115~122
DOI : 10.3745/KIPSTC.2002.9C.1.115
This paper presents a new web cluster scheme based on dispatcher which does not depend on operating system for server and can examine server`s status interactively. Two principal functions are proposed for new web cluster technique. The one is self-controlled load distribution and the other is transaction fail-safe. Self-controlled load distribution function checks response time and status of servers periodically, then it decides where the traffic goes to guarantee rapid response for every query. Transaction fail-safe function can recover lost queries including broken transaction immediately from server errors. Proposed new web cluster scheme is implemented by C language on Unix operating system and compared with legacy web cluster products. On the comparison with broadcast based web cluster, proposed new web cluster results higher performance as more traffic comes. And on the comparison with a round-robin DNS based web cluster, it results similar performance at the case of traffic processing. But when the situation of one server crashed, proposed web cluster processed traffics more reliably without lost queries. So, new web cluster scheme Proposed on this dissertation can give alternative plan about highly increasing traffics and server load due to heavy traffics to build more reliable and utilized services.
A Study on the Performance Analysis and synthesis for a Differentiated Service Networks
Jeon, Yong-Hui ; Park, Su-Yeong ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 123~134
DOI : 10.3745/KIPSTC.2002.9C.1.123
The requirement for QoS (Quality of Service) has become an important Issue as real-time or high bandwidth services are increasing, such as Internet Telephony, Internet broadcasting, and multimedia service etc. In order to guarantee the QoS of Internet application services, several approaches are being sought including IntServ (Integrated Service) DiffServ(Differentiated Srvices), and MPLS(Multi-Protocol Label Switching). In this paper, we describe the performance analysis of QoS guarantee mechanism using the DiffServ. To analyze how the DiffServ performance was affected by diverse input traffic models and the weight value in WFQ(Weighted Fair Queueing), we simulated and performed performance evaluation under a random, bursty, and self-similar input traffic models and for diverse input parameters. leased on the results of performance analysis, it was confirmed that significant difference exist in packet delay and loss depending on the input traffic models used. However, it was revealed that QoS guarantee is possible to the EF (expedited Forwarding) class and the service separation between RF and BE (Best Effort) classes may also be achieved. Next, we discussed the performance synthesis problem. (i. e. derived the conservation laws for a DiffServ networks, and analysed the performance variation and dynamic behavior based on the resource allocation (i.e., weight value) in WFQ.
An efficient Load Balanced Cost Calculation Scheme for QoS Routing
Hong, Jong-Joon ; Kim, Seung-Hoon ; Lee, Kyoon-Ha ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 135~140
DOI : 10.3745/KIPSTC.2002.9C.1.135
An efficient QoS routing scheme needs to find a path that satisfies a given QoS requirements while consuming as few resources as Possible. In this paper, we propose two schemes of calculating resources`costs one for on-demand and one for precomputation QoS routing schemes. These schemes are effective in respect to the global network utilization and the balanced use of network resources. We also propose a QoS routing scheme for transit and Intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multip1e paths between all pairs of ingress and ogress border routers while considering balancing of the expected load. We, therefore, expect that the paths are bettor than any other paths in respect to reserving the network resources on Paths. The routine: scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. cote that our cost calculation schemes for both kinds of traffic could be used in existing QoS routing protocols without and modification in small and large scale of networks.
A study of Distributed QoS Routing Performance with Implicit 2-level Information
Han, Jeong-Su ; Jeong, Jin-Uk ;
The KIPS Transactions:PartC, volume 9C, issue 1, 2002, Pages 141~148
DOI : 10.3745/KIPSTC.2002.9C.1.141
In this paper, we study the various performance of Distributed QoS Routing according to how many level of routing table information in router. And we study Flooding and recently proposed 2-level forwarding, and compare with performance of implicit 3-level forwarding. Performance factors are message overhead that is generated on Distributed QoS Routing and Route Setup success Rate, Connection blocking rate, Network Utilization. They can decide the accuracy of routing information in rouser. Our simulation shows that more level of routing table information have, lower message overhead generate but lower performance at other factors because of inaccuracy of routing information