• Title/Summary/Keyword: Server Response Time

Search Result 282, Processing Time 0.077 seconds

Double Queue Management for Reducing disk I/O of Web Servers (이중 큐 구조를 갖는 웹 서버)

  • Yeom, Mi-Ryeong
    • The KIPS Transactions:PartA
    • /
    • v.8A no.4
    • /
    • pp.293-298
    • /
    • 2001
  • This paper propose the DoubleQ web server that classifies incoming requests according to whether the requested document is cached or not. Requests that demand a cached document is put into the Service Queue while other requests are added to the Defer Queue. The DoubleQ web server services requests that are in the Service Queue before it services requests in the Defer Queue. This strategy is used to reduce disk accesses that have been the predominant overhead of traditional web servers. Experimental results using synthetic data show that improvements in the average user response time and the throughput of the web server may be achieved.

  • PDF

A Study on Efficient Load Balancing Mechanism in Distributed Web Cluster System (분산 웹 클러스터 시스템에서의 효율적인 부하 균등 기법에 관한 연구)

  • Lee, Bog-Ki
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.8
    • /
    • pp.11-18
    • /
    • 2011
  • The increasing of web users load to the excessive transmission traffic and system overload problems. To solve these problems, cluster systems are studied. In conventional cluster systems, when the request size is large owing to such types as multimedia and CGI, the particular server load and response time tend to increase even if the overall loads are distributed evenly. In this paper, we consider the methodology of efficient resource usage, specially distributed web cluster system. We develope an algorithm that distributes the load on the web cluster system to use the system resources, such as system memory equally. The response time is chosen as a performance measure on the various clustering models. And based on the concurrent user to the web cluster system, the response time is also examined as the number of users increases. Simulation experience with this algorithm shows that the response time and average throughput seems to have a good results compare to those with the other algorithm.

The Development of the Automatic Demand Response Systems Based on SEP 2.0 for the Appliances's Energy Reduction on Smart Grid Environments (스마트 그리드 환경에서 가전기기의 에너지 저감을 위한 SEP 2.0 기반의 자동수요반응 시스템 개발)

  • Jung, Jin-uk;Kim, Su-hong;Jin, Kyo-hong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.9
    • /
    • pp.1799-1807
    • /
    • 2016
  • In this paper, we propose the automatic demand response systems which reduce the electric power consumption for the period automatically distinct from the existing passive demand response that a subscriber directly controls the energy consumption. The proposed systems are based on SEP 2.0 and consist of the demand response management program, the demand response server, and the demand response client. The demand response program shows the current status of the electric power use to a subscriber and supports the function which the administrator enables to creates or cancels a demand response event. The demand response server transmits the demand response event received from the demand response management program to the demand response client through SEP 2.0 protocol, and it stores the metering data from the demand response client in a database. After extracting the data, such as the demand response the start time, the duration, the reduction level, the demand response client reduces the electric power consumption for the period.

Security in the Password-based Identification

  • Park, Byung-Jun;Park, Jong-Min
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.4
    • /
    • pp.346-350
    • /
    • 2007
  • Almost all network systems provide an authentication mechanism based on user ID and password. In such system, it is easy to obtain the user password using a sniffer program with illegal eavesdropping. The one-time password and challenge-response method are useful authentication schemes that protect the user passwords against eavesdropping. In client/server environments, the one-time password scheme using time is especially useful because it solves the synchronization problem. It is the stability that is based on Square Root Problem, and we would like to suggest PBSI(Password Based Secure Identification), enhancing the stability, for all of the well-known attacks by now including Off-line dictionary attack, password file compromise, Server and so on. The PBSI is also excellent in the aspect of the performance.

One-Pass Identification Processing Password (한 단계로 신원확인을 위한 패스워드)

  • Kim Yong-Hun;Cho Beom-Joon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.3
    • /
    • pp.627-632
    • /
    • 2005
  • Almost all network systems provide an authentication mechanism based on user ID and password. In such system, it is easy to obtain the user password using a sniffer program with illegal eavesdropping. The one-time password and challenge-response method are useful authentication schemes that protect the user passwords against eavesdropping. In client/ server environments, the one-time password scheme using time is especially useful because it solves the synchronization problem. It is the stability that is based on Square Root problem, and we would like to suggest OPI(One Pass Identification), enhancing the stability for all of the well-known attacks by now including Free-playing attack, off-line Literal attack, Server and so on. OPI does not need to create the special key to read the password. OPI is very excellent in identifying the approved person within a very short time.

Performance Enhancement of ECC Algorithm-based Mobile Web Service System (ECC 알고리즘 기반 모바일 웹 서비스 시스템의 성능 향상)

  • Kim, Yong-Tae;Jeong, Yoon-Su;Park, Gil-Cheol
    • The KIPS Transactions:PartD
    • /
    • v.15D no.5
    • /
    • pp.699-704
    • /
    • 2008
  • By the dependence on Web from popularization of internet and increasing number of users, web services capability and security problem of communication is becoming a great issue. Existing web services technology decrease the capability of web application server by limiting the number of synchronous client, decreasing the processing load and increasing average response time. The encryption process to secure communication and the early expense of handshake decrease transmission speed and server capability by increasing the calculation time for connecting. Accordingly, this paper executes an encryption procedure by elliptical encryption algorithm to satisfy secure demands, improve the overload of server for web services and get reliability and security of web server architecture and proposes an improved mobile web sever which provides better ability and the techniques for deferred processing.

A Study on Latency Time Improvement of Electronic Commerce System Using Local Server and Web Cashing (로컬서버와 웹캐싱을 이용한 전자상거래 시스템의 지연속도 개선에 관한 연구)

  • Yoon,, Yong-Ki;Ko, Il-Seok;Leem, Choon-Seong
    • The KIPS Transactions:PartB
    • /
    • v.9B no.5
    • /
    • pp.555-562
    • /
    • 2002
  • Increasing of electronic commerce users and high-capacity multimedia data is the main causes of increasing of load and network traffic in electronic commerce system. Increasing of load and network traffic brings the delay of service about client's request. And it's becoming factor that decreases customer satisfaction and corporation's competitive ability. So it is needed to research that consider efficient management and response time of electronic commerce system. In this paper, we designed electronic commerce system based on local server with web cashing function in order to solve load problem of electronic commerce system. And we proposed web cashing algorithm for local web server and analyzed performance by an experiment.

A Study of Basic Design Method for High Availability Clustering Framework under Distributed Computing Environment (분산컴퓨팅 환경에서의 고가용성 클러스터링 프레임워크 기본설계 연구)

  • Kim, Jeom Goo;Noh, SiChoon
    • Convergence Security Journal
    • /
    • v.13 no.3
    • /
    • pp.17-23
    • /
    • 2013
  • Clustering is required to configure clustering interdependent structural technology. Clustering handles variable workloads or impede continuity of service to continue operating in the event of a failure. Long as high-availability clustering feature focuses on server operating systems. Active-standby state of two systems when the active server fails, all services are running on the standby server, it takes the service. This function switching or switchover is called failover. Long as high-availability clustering feature focuses on server operating systems. The cluster node that is running on multiple systems and services have to duplicate each other so you can keep track of. In the event of a node failure within a few seconds the second node, the node shall perform the duties broken. Structure for high-availability clustering efficiency should be measured. System performance of infrastructure systems performance, latency, response time, CPU load factor(CPU utilization), CPU processes on the system (system process) channels are represented.

A Study on the Extraction and Integration of Learning Object Meta-data using Web Service of Databases (DBMS의 웹서비스를 이용한 학습객체 메타데이터 추출 및 통합에 관한 연구)

  • Choe, Hyun-Jong
    • Journal of The Korean Association of Information Education
    • /
    • v.7 no.2
    • /
    • pp.199-206
    • /
    • 2003
  • XML is becoming a new developing tool of web technology because of its ability of data management and flexibility in data presentation. So it's well researched that the reusability and integration with learning objects such as text, image, sound, video and plug-in programs of web contents in computer education. But the research for storing, extracting and integrating metadata about learning object was needed prior to implementing online learning system to integrate and manage it. Therefore this study propose a new method of using web service of DBMS for extracting learning object's metadata in database server which located in 3-tier system. To evaluate the efficiency of proposed method, The test server and two DBMSs(MS SQL Server 2000 and Oracle 9i) which have 30 metadata was implemented and the response time of it was measured. The response time of it was short, but in order to using this method the additional programming with SAX/DOM was necessary.

  • PDF

Optimal Number and Placement of Web Proxies in the Internet : The Linear & Tree Topology (인터넷으로 웹 프락시의 최적 개수와 위치 : 선형 구조와 트리구조)

  • Choi, Jung-Im;Chung, Haeng-Eun;Lee, Sang-Kyu;Moon, Bong-Hee
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.2
    • /
    • pp.229-235
    • /
    • 2001
  • With the explosive popularity of the World Wide Web, the low penonnance of network often leads web clients to wait a long time for web server's response. To resolve this problem, web caching (proxy) has been considered as the most efficient technique for web server to handle this problem. The placement of web proxy is critical to the overall penonnance, and Li et al. showed the optimal placement of proxies for a web server in the internet with the linear and tree topology when the number of proxies, ]M, is given [4, 5]. They focused on minimizing the over all access time. However, it is also considerable for target web server to minimize the total number of proxies while each proxy server guarantees not to exceed certain res(Xlnse time for each request from its clients. In this paper, we consider the problem of finding the optimal number and placement of web proxies with the lin~ar and tree topology under the given threshold cost for delay time.

  • PDF