• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.460-462
• /
• 2000

PC 보급 증대와 웹을 통한 네트워크의 발달은 많은 기업 비즈니스를 자동화시키고 있다. 본 논문에서는 SFA(Sales Force Automation)라는 기업 시스템 모델을 통해 기존 C/S 환경이 가졌던 여러 가지 단점들을 보완한 인터넷 환경의 컴포넌트화 된 새로운 SFA 시스템 구축 방법을 소개한다. 기존 C/S 환경은 Off-Line 방식의 업무처리, 각 지점의 PC 서버에 SFA 시스템의 인스톨로 인해 일부 프로그램상의 변경에도 모든 지점의 시스템을 유지 보수해야 하는 비효율.고비용의 시스템을 사용해왔다. 따라서 본 논문에서 제안하는 새로운 SFA 시스템은 EJB(Enterprise Java Beans)라는 표준 컴포넌트 구조를 이용해 SFA 시스템을 구축한 것으로써 전국에 있는 각 지점들이 인터넷을 통해 접근 가능한 메인 서버 중심의 SFA 시스템이다. 이로 인한 장점으로는 메인 서버의 SFA 시스템의 인스톨만으로 전국 각 지점의 터미널과 서비스가 가능하고 On-Line 상의 실시간 업무처리가 가능하다는 것이다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1119-1122
• /
• 2002

본 논문에서는 Ford와 Kaliski[6]가 제안한 패스워드 은닉 기술을 적용하여 클라이언트와 서버의 은닉 변수로 은닉된 값을 서버가 패스워드 검증자로 사용하는 새로운 패스워드 기반 키 교환 프로토콜을 제안한다. 제안하는 프로토콜은 패스워드 검증자를 비밀리에 보관하여야하는 다른 검증자 기반 방식과 달리 클라이언트와 서버의 은닉 변수가 적용된 검증자를 사용하여 서버의 패스워드 검증자에 대한 안전성을 증가시켰다. 또한 Nyberg-Ruppel 방식[4]을 적용하여, 한번의 통신으로 사용자 인증과 키 교환을 할 수 있다. 본 논문에서 제안하는 프로토콜 안전성은 이산대수문제인 DLP(Discrete logarithm Problem)와 DHP(Diffie-Hellman Problem)[6]에 의존한다. 따라서 DLP와 DHP의 가정하에, 제안된 프로토콜은 오프라인 사진공격(off-line dictionary attack), 서버 데이터 도청(server data eavesdropping), 전향적 안전성(forward secrecy), Denning-Sacco 공격[1]에 대하여 안전하다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3794-3803
• /
• 2000

In a Video-on-Demand system, admission control that is used to serve multimedia data efficiently has to be perfonned by an accurate grasp of the condition of surplus resources. Most of all. we need to adaptable admission control mechanism because the disk has irregular response time caused by external elements of disk, and also has high deviation of amount demanded. In previous admission control schemes, they determined whether a new user is granted or not through a theoretical value. Although they based on the measurement, they left much to be desired in dealing with the service state. Measurement ~based statistical admission control scheme, as we su~~ested in this research, perfonns 2 processes of off-line process and on-line process in real service environment. Through this processes, we can grasp the accurate resource state of system and adaptive!y detennine the admission according to circumstances. Therefore, it can guarantee both maximum resource utilization and QoS(Quality of Service). On performance evaluations, we show that the video server can utilize maximum resource utilization with QoS guarantee through precision of perfonnance by measurement and adaptable admission control according to the requested bandwidth.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.677-684
• /
• 2003

Most policies of VOD services are mainly studied about server system, and make no touch on clients buffer stabilization which is the basis of guaranteeing playback quality and playing without cut off. In this paper, we proposed a skipping frame transfer policy that can sending dynamic buffer control signal to server in accordance with clients buffer state of starvation or overrun, and server transfers a skipped frame to client after receive the control signal. And through a simulation, we show the suggested policy is more efficiency on playback quality by buffer stabilization which is by preventing loss and miss for receiving frame due to grow worse client buffer state.

• Journal of Broadcast Engineering
• /
• v.15 no.6
• /
• pp.845-852
• /
• 2010

Collecting statistics from client requests, the broadcast server partitions data items into hot and cold-item sets with the optimal cut-off point. Hot items are broadcast periodically with periods based on their access probabilities. In a time slot with no hot items scheduled, the server broadcasts a proper cold item considering the waiting time and the number of outstanding requests. We analyze the optimal the cut-off point by calculating average response time as a function of the cut-off point. Simulation results show that our proposed algorithm outperforms existing methods in various circumstances.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.9
• /
• pp.1245-1250
• /
• 2002

This paper is an intelligence type of remote medical examination system for both on-line and off-line mode to transcend time and space on web where anyone can participate ;on-line consultation among patient, doctor, Korean medical doctor, medical examination in off-line mode, transmission of prescription to the pharmacist designated by patient and preparation of medicine, and semi-eternal storage of medical examination data by storage and check of medical examination data ; and database is composed by using intelligence type of object control which enables effect of treatment for heredity including check and mutual holding of medical examination data among family, fast treatment effect pursuant to situation of past medical examination through control of private disease history, cooperated medical examination among doctors, and so on.

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.252-258
• /
• 2004

In this paper, we propose a new authenticated key exchange protocol in which client and sever can mutually authenticate and establish a session key over an insecure channel using only a human memorable password. The proposed protocol is based on Diffie-Hellman scheme and has many of desirable security attributes: It resists off-line dictionary attacks mounted by either Passive or active adversaries over network, allowing low-entropy Passwords to be used safely. It also offers perfect forward secrecy, which protects past sessions when passwords are compromised. In particular, the advantage of our scheme is that it is secure against an impersonation attack, even if a server's password file is exposed to an adversary. The proposed scheme here shows that it has better performance when compared to the previous notable password-based key exchange methods.

• Journal of KIISE:Information Networking
• /
• v.27 no.3
• /
• pp.301-314
• /
• 2000

As the number of World Wide Web (Web) users grows, Web traffic continues to increase at an exponential rate. Currently, Web traffic is one of the major components of Internet traffic. Also, high bandwodth usage due to Web traffic is observed during peak periods while leaving bandwidth usage idle during off-peak periods. One of the solutions to reduce Web traffic and speed up Web access is through the use of Web caching. Unfortunately, Web caching has limitations for reducing network bandwidth usage during peak periods. In this paper, we focus our attention on the use of a prefetching algorithm for reducing bandwidth during peak periods by using off-peak period bandwidth. We propose a statistical, batch, proxy-side prefetching scheme that improves cache hit rate while only requiring a small amount of storage. Web objects that were accessed many times in previous 24 hours but would be expired in the next 24 hours, are selected and prefetched in our scheme. We present simulation results based on Web proxy and show that this prefetching algorithm can reduce peak time bandwidth using off-peak bandwidth.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.4
• /
• pp.73-80
• /
• 2016

Multiplayer Online Games(MOG) using the Internet are typically organized based on a CS(client-server) or P2P(peer-to-peer) architecture. We then propose a method that combines a P2P architecture with a CS architecture in order to utilize their advantages. Most MOGs use a primary-copy replication approach that provides strong consistency control over an object. For each object and character there exists an authoritative copy, called primary copy and all other copies are secondary copies or replicas. Any update to the object has to be first performed on the primary copy. In the proposed hybrid architecture, primary copies may reside on the server or be held by clients. In this architecture, load balancing between a server and clients can be achieved by reducing the number of objects maintained by the server. Games consist of various types of actions with different consistency requirements. A multi-level approach to game consistency is sensible as it provides the best trade-off between consistency and performance. The performance for the hybrid game architecture with the primary-copy model is evaluated through simulation experiments and analysis in this paper.

• The Journal of the Korea Contents Association
• /
• v.4 no.1
• /
• pp.83-89
• /
• 2004

Instant messaging(IM) service is one of the useful communication means in the Intemet for exchanging simple messages between users. Usually, IM service is coupled with Presence service which provides status information of users. In this case, instant messages are sent and received directly between on-line users. Therefore, messages could not be exchanged when users are in off-line state. In this paper, We have implemented SIP based Instant Messaging System which includes message server that can store and manage instant messages. With this message server, messages could be exchanged legalness of user states. Furthermore, our system includes message waiting indication event package which provides useful informations about messages in the message server. And this system also includes the Caller Preference capabilities.