• Title/Summary/Keyword: Server Overload

Search Result 111, Processing Time 0.021 seconds

A Study on the Distribution of Overload in Academic Affairs Management System Using Replication Server (데이터 복제 서버를 이용한 학사 관리 시스템의 부하 분산에 관한 연구)

  • Han, Gwang-Rok;Lee, Seung-Won
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.605-612
    • /
    • 2001
  • In order to solve the overload of academic affairs management system, we propose a method builds a distributed Replication server and uses this server with the present centralized system. Normal query transactions which are not required for data modification are composed of almost all DML sentences. So we construct the distributed replication servers according to the data characteristics and make them perform the query transaction without modification. In this way, we can simultaneously distribute users and data, and cut down processing time for every transaction. Also Replication server has the advantages of implemental efficiency and economical because it uses resources of present centralized system without and additional configurations. Usually, to distribute the overload of server, they can use way, Client-side overload distribution that user program get present overload status then can choose a less overloaded server, and the other way, Server-side overload distribution that make use of Application Layer Scheduling Technique and IP Layer Scheduling Technique. Our Replication server can reduce the overload of centralized system by eliminating or complementing those defects of overload distribution, referred to in the forehead.

  • PDF

Design and Implementation of the EEIS Considering the Load of DB Server

  • Kim, Chang-Geun;Park, Byeong-Jin;Tack, Han-Ho
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.3 no.1
    • /
    • pp.37-43
    • /
    • 2003
  • Current Internet system of the entrance exam information to the university that is depending on searching key to solve the overloaded problem in the network and DB server or other tools to support HTML edit, haven't satisfied user's wants by supplying uniformed searching system. So this thesis will establish EEIS(Entrance Examination Information System) to prevent database overload phenomena when many users request a great amount of data at the same time and improve the decrease of speed and overload problem in DB server. EEIS playa role of bridge between outside client and DB server by placing VVS(Virtual View Server) between web server and DB server. By that method this system give users several usefulness in convenience and variety by supplying realtime data searching function to user. EEIS also give inner system manager more efficiency and speed in control the management system by solving those problem. This system is design and implementation to satisfy user's desire and give them more convenience and bring up the confidence of university that adopt this system at the end.

Design and Implementation of the EEIS Considering the Load of DB Sewer (DB 서버 부하를 고려한 EEIS 시스템의 설계 및 구현)

  • 최병진;김창근;김봉기;김홍준
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.545-551
    • /
    • 2001
  • Current Internet system of the entrance exam information to the university that is depending on searching key to solve the overloaded p개blem in the network and DB server or other tools to support HTML edit, haven't satisfied user's wants by supplying uniformed searching system. So this thesis will establish EEIS(Entrance Examination Information System) to prevent database overload phenomena when many users request a great amount of data at the same time and improve the decrease of speed and overload problem in DB server. EEIS play a role of bridge between outside client and DB server by placing VVS(Virtual View Server) between web server and DB server. By that method this system give users several usefulness in convenience and variety by supplying realtime data searching function to user EEIS also give inner system manager more efficiency and speed in control the management system by solving those problem. This system is design and implementation to satisfy user's desire and give them more convenience and bring up the confidence of university that adopt this system at the end.

  • PDF

Efficient and scalable Online Game Server Architecture for Massive Users (대규모 사용자들을 수용하기 위한 효율적인 서버 확장이 가능한 온라인 게임 서버 구조)

  • Kim, Jeong-Hoon
    • Journal of Korea Game Society
    • /
    • v.2 no.2
    • /
    • pp.20-27
    • /
    • 2002
  • In this paper, I tried to propose efficient online game server architecture that decrease server overload. I used replicated distributed sever type together with non-replicated distributed sever type. Replicated distributed sever type has the advantage to maintain efficient distribution of server overload and non-replicated distributed sever type has the advantage to move a game server to a different game server freely in one server group. I used these advantages suitably in this proposal, and I will show the efficiency of online game server architecture.

  • PDF

A Non-Linear Overload Control Scheme for SIP Proxy Queues (SIP 프록시 큐의 비선형적 과부하 제어 방법)

  • Lee, Jong-Min;Jeon, Heung-Jin;Kwon, Oh-Jun
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.4
    • /
    • pp.43-50
    • /
    • 2010
  • Recently, the Internet telephony has been used rather than the traditional telephony by many Internet users, with low cost. Session Initiation Protocol(SIP) is the standard of application layer protocol for establishment and disconnection of the session for Internet telephony. SIP mainly runs over the UDP for transport. So in case of the loss of the INVITE request message, the message is retransmitted by an appropriate timer for reliable transmission of the UDP message. Though the retransmission is useful for ensuring the reliability of SIP messages sent by the users, it may cause the overload traffic in the SIP proxy server. The overload in SIP proxy servers results in the loss of many input messages. This paper presents a non-linear overload control algorithm to resolve the overload condition of the server. we simulate our proposed algorithm using the network simulator ns-2. The simulation results show that the throughput of the server with the proposed algorithm have been improved about 12% compared to the existing linear control algorithm.

An Onboard Printer Server Based on Embedded Linux (Embedded Linux 기반의 내장형 프린터 서버)

  • Cha, Kyung-Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.2
    • /
    • pp.309-314
    • /
    • 2009
  • PC users could experience some inconvenience when they use their PC that was physically connected to network printers shared by other People in the network due to the overload. This paper shows how to resolve this kind of overload problem and established the embedded printer system based on embedded Linux system which performs the printer server in order for any users in the of ice to do printing work more smoothly via current network. It's own capabilities and functions were verified throughout the various tests in practical environment.

The Overload Control Scheme Using a Delay Queue in the SIP Signalling Networks (SIP 시그널링 네트워크에서 지연 큐를 이용한 과부하 제어 방법)

  • Lee, Jong-Min;Jeon, Heung-Jin;Kwon, Oh-Jun
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.8
    • /
    • pp.1038-1047
    • /
    • 2012
  • The SIP(Session Initation Protocol) is an application layer protocol that is used to establish, release, and change the call session of the IP telephony. In the SIP signalling networks, when the number of the UA(User Agent) requested the call session increase, the number of messages to be processed by SIP proxy server increase. It often will be caused the overload of the SIP proxy server. In this paper, we proposed the overload control method with a normal queue and a delay queue in the SIP proxy server. When it is estimated the overload of the server by the excess of the high threshold in the normal queue, new INVITE messages will be put into the delay queue to reduce the load of the server. It results in some delay of the call session from the INVITE message. Subsequently when the number of messages in the normal queue is reduced below the low threshold, the INVITE messages in the delay queue is processed. The simulation results showed that the number of the retransmission messages by our proposed method was 45% less than the one by the method with single queue. The results also showed that the average call success rate by the proposed method was 2% higher than the one by the method with single queue.

A Design of Mobile Web Server Framework for SOAP Transaction and Performance Enhancement in Web2.0 (웹2.0에서 SOAP 처리와 성능 향상을 위한 모바일 웹 서버 프레임워크의 설계)

  • Kim, Yong-Tae;Jeong, Yoon-Su;Park, Gil-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.10
    • /
    • pp.1866-1874
    • /
    • 2008
  • Existing web server lowers the whole capacity of system because of the problem on the processing load of server by closing connection increasing code handshake operation, and remarkable decrease of server capacity if it is the state of overload. Also, there occurs disadvantages of increasing connection tine about client's request and response time because handling of client's multi-requests is not smooth because of thread block and it requests a lot of time and resources for revitalization of thread. Therefore, this paper proposes the extended web server which provides the technique for delay handling and improves the overload of server for better system capacity, communication support, and the unification which is the advantage of web service. And it evaluates the existing system(implemented at Tomcat 5.5) and the proposed mobile web server architecture. The extended server architecture provides excellent exchange condition for system capacity and evaluates improved web server architecture which combines multi-thread with thread pool. The proposed web service architecture in this paper got the better result of improved capacity benefit than the evaluation result of original Tomcat 5.5.

NetDraino: Saving Network Resources via Selective Packet Drops

  • Lee, Jin-Kuk;Shin, Kang-G.
    • Journal of Computing Science and Engineering
    • /
    • v.1 no.1
    • /
    • pp.31-55
    • /
    • 2007
  • Contemporary end-servers and network-routers rely on traffic shaping to deal with server overload and network congestion. Although such traffic shaping provides a means to mitigate the effects of server overload and network congestion, the lack of cooperation between end-servers and network-routers results in waste of network resources. To remedy this problem, we design, implement, and evaluate NetDraino, a novel mechanism that extends the existing queue-management schemes at routers to exploit the link congestion information at downstream end-servers. Specifically, NetDraino distributes the servers' traffic-shaping rules to the congested routers. The routers can then selectively discard those packets-as early as possible-that overloaded downstream servers will eventually drop, thus saving network resources for forwarding in-transit packets destined for non-overloaded servers. The functionality necessary for servers to distribute these filtering rules to routers is implemented within the Linux iptables and iproute2 architectures. Both of our simulation and experimentation results show that NetDraino significantly improves the overall network throughput with minimal overhead.

Operation Policy for Enhancing Availability of a Web Server against DoS Attacks (서비스 거부 공격에 대응한 웹서버 가용성 향상을 위한 운용 정책 방안)

  • Baik, Nam-Kyun;Jung, Sou-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8B
    • /
    • pp.735-744
    • /
    • 2008
  • This paper proposes a 'secure node' to be robust against network-based DoS attacks. The secure node selectively accepts new sessions based on the Zipf's law while a link is in the overload state. Our scheme calculates a threshold value for overload state, and provides a dynamic service mechanism for enhancing availability of a web server. The simulation results show performance improvement of the proposed scheme in terms of completion/connection ratios.