• Title/Summary/Keyword: proxy server

Search Result 228, Processing Time 0.023 seconds

A Design of Web Proxy Server for Mobile Computer (이동컴퓨터를 위한 Web Proxy Server의 설계)

  • 이종국;김명철;마중수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10c
    • /
    • pp.537-539
    • /
    • 1999
  • 최근 이동컴퓨터(Mobile computer)는 사용자들이 기하급수적으로 늘고 있다. 그러나, 이동컴퓨터는 기존의 PC나 W/S을 사용하는 환경보다 이동성을 고려하므로, 화면 크기, 부속들의 크기와 무게, CPU에 사용되는 전력, 네트워크 인터페이스에서 제약성을 지니고 있다. 이런 제약으로 인해 이동컴퓨터는 기존의 컴퓨터 보다 성능이 떨어진다. 이런 환경에서 인터넷을 사용할 때 WWW같은 멀티미디어 전송 서비스는 원하는 시간 내에 처리하기 힘들다. 따라서, 현재 이동컴퓨터를 위한 인터넷 서비스들은 Proxy server를 이용하여 멀티미디어 데이터의 크기를 줄이거나 문자로 처리하게 하여 사용자들에게 좀 더 빠른 환경을 제공하고 있다. 그러나, 기존의 Proxy Server들에서 구현된 화면에서 보여지는 그래픽 파일(Graphic File)의 일방적인 size의 조정으로 파일의 양을 줄이기 때문에는 이동컴퓨터에게 똑같은 정보를 제공함으로써 환경이 다양한 이동컴퓨터에는 충분하지 못하다는 단점을 가지고 있다. 본 논문에서는 이동컴퓨터환경에서 사용자들이 원하는 WWW service를 빠른 시간에 받을 수 있게 하면서, 화면크기, 색 표현 능력 등이 각기 다른 이동컴퓨터의 H/W 사양에 맞추어서 효과적으로 보낼수 있게 포트(port)를 다양화한 Prosy server를 설계해 보도록 한다.

  • PDF

A Clustering based Wireless Internet Proxy Server (클러스터링 기반의 무선 인터넷 프록시 서버)

  • 곽후근;우재용;정윤재;김동승;정규식
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.101-111
    • /
    • 2004
  • As different from wired internet, wireless internet has limitations due to the following characteristics; low bandwidth, frequent disconnection, low computing power, small screen in user terminal, and user mobility. Also, wireless internet server should be scalable to handle a large scale traffic due to rapidly growing users. Wireless proxy servers are used for the wireless internet because their caching and transcoding functions are helpful to overcome the above limitation. TranSend was proposed as a clustering based wireless proxy server but its scalability is difficult to achieve because there is no systematic way to do it. In this Paper. we proposed a clustering based wireless internet proxy server which can be scalable in a systematic way. We performed experiments using 16 PCs and experimental results show 32.17% performance improvement of the proposed system compared to TranSend system.

The Design of Proxy for CORBA Traffic Monitoring Using OSI management technology (OSI 관리 기술을 이용한 CORBA 트래픽 모니터링 프록시 설계)

  • 박재성;송왕철
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.3 no.2
    • /
    • pp.355-362
    • /
    • 1999
  • Traffic monitoring, a part of the system management, is a vital function lot the proper operation of a system in use. Currently OMG has been trying to standardize CORBA system management. Besides, many companies and research laboratories have been developing and studying CORBA system management. In this paper, we have designed the proxy to monitor the CORBA traffic using the OSI management technology. To manage CORBA traffic resources, 6 parameters have been made into managed objects. The monitoring system consists of a CORBA server, a proxy object and an MIB. The CORBA server is made up of a service provider, a proxy server, and a event sewer. The proxy object acts as a process of a CORBA object, and is made up of a proxy client, a event client, and an IPC server.

  • PDF

Method for NoC Bottleneck Relaxation Using Proxy (프록시를 이용한 NoC의 병목현상 해소 방법)

  • Kim, Kyu-Chull;Kwon, Tai-Hwan
    • The KIPS Transactions:PartA
    • /
    • v.18A no.1
    • /
    • pp.25-32
    • /
    • 2011
  • NoC is actively being studied recently in order to overcome the limitations of shared-bus architecture. We proposed an NoC architecture which employs a buffer that plays a similar role of a proxy server in a computer network to enhance the communication efficiency of NoC architecture. In the proposed NoC architecture, whenever the master has a difficulty in communicating with the slave directly, the master communicates with the proxy server which is able to communicate with the slave on behalf of the master. With the proposed scheme in NoC, we can increase the speed and the bandwidth of communication channel. The experimental results showed that overall communication efficiency was significantly improved by sending the packets to the proxy server rather than holding them in the switch buffer.

A P2P Proxy Patching Scheme on VOD System (VOD 시스템 상에서 P2P 프록시 기반의 패칭기법)

  • Kwon, Chun-Ja;Choi, Chi-Kyu;Choi, Hwang-Kyu
    • Journal of Industrial Technology
    • /
    • v.24 no.B
    • /
    • pp.177-186
    • /
    • 2004
  • The main bottleneck for a VOD system is bandwidth of storage or network I/O due to the high bandwidth requirements and long-lived nature of digital video. Patching is one of the most efficient techniques to overcome the bottleneck of the VOD system through the use of multicast scheme. In this paper, we propose a new patching scheme, P2P proxy patching, for improving the typical patching technique by jointly using the proxy prefix caching scheme and the P2P proxy. In our proposed scheme, each client play a role in a proxy for multicasting a regular stream to other clients that request the same stream. Due the use of the P2P proxy and the prefix caching, the server bandwidth is required significantly less than that of the typical patching technique. In the performance study, we show that our patching scheme can reduce the server bandwidth requirements compared with the existing patching techniques.

  • PDF

A Selective Video Data Deletion Algorithm to Free Up Storage Space in Video Proxy Server (비디오 프록시 서버에서의 저장 공간 확보를 위한 선택적 동영상 데이터 삭제 알고리즘)

  • Lee, Jun-Pyo;Park, Sung-Han
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.4
    • /
    • pp.121-126
    • /
    • 2009
  • Video poxy server which is located near clients can store the frequently requested video data in storage space in order to minimize initial latency and network traffic significantly. However, due to the limited storage space in video proxy server, an appropriate deletion algorithm is needed to remove the old video data which is not serviced for a long time. Thus, we propose an efficient video data deletion algorithm for video proxy server. The proposed deletion algorithm removes the video which has the lowest request possibility based on the user access patterns. In our algorithm, we arrange the videos which are stored in video proxy server according to the requested time sequence and then, select the video which has the oldest requested time. The selected video is partially removed in order to free up storage space in video poky server. The simulation results show that the proposed algorithm performs better than other algorithms in terms of the block hit rate and the number of block deletion.

Design of a effective Authorization Mechanism based on Kerberos (커버로스 기반의 효율적인 허가 메커니즘 설계)

  • Kim, Eun-Hwan;Jun, Moon-Seog
    • The KIPS Transactions:PartC
    • /
    • v.10C no.3
    • /
    • pp.287-294
    • /
    • 2003
  • Authentication and authorization are essential functions for the security of distributed network environment. Authorization is determining and to decide whether a user or process is permitted to perform a particular operation. In this paper, we design an authorization mechanism to make a system more effective with Kerberos for authentication mechanism. In the authorization mechanism, Kerberos server operates proxy privilege server. Proxy privilege server manages and permits right of users, servers and services with using proposed algorithm. Also, privilege attribute certificate issued by proxy privilege server is used in delegation. We designed secure kerberos with proposed functions for effective authorization at the same time authentication of Kerberos mechanism.

Proxy-based Caching Optimization for Mobile Ad Hoc Streaming Services (모바일 애드 혹 스트리밍 서비스를 위한 프록시 기반 캐싱 최적화)

  • Lee, Chong-Deuk
    • Journal of Digital Convergence
    • /
    • v.10 no.4
    • /
    • pp.207-215
    • /
    • 2012
  • This paper proposes a proxy-based caching optimization scheme for improving the streaming media services in wireless mobile ad hoc networks. The proposed scheme utilizes the proxy for data packet transmission between media server and nodes in WLANs, and the proxy locates near the wireless access pointer. For caching optimization, this paper proposes NFCO (non-full cache optimization) and CFO (cache full optimization) scheme. When performs the streaming in the proxy, the NFCO and CFO is to optimize the caching performance. This paper compared the performance for optimization between the proposed scheme and the server-based scheme and rate-distortion scheme. Simulation results show that the proposed scheme has better performance than the existing server-only scheme and rate distortion scheme.

A Comparison of Hashing Algorithms for Cache Cooperation in a Wireless Internet Proxy Server Cluster (무선 인터넷 프록시 서버 클러스터에서 캐시간 협동을 위한 해싱 알고리즘 비교)

  • Kwak, Hu-Keun;Han, Kyung-Sik;Chung, Kyu-Sik
    • Proceedings of the IEEK Conference
    • /
    • 2004.06a
    • /
    • pp.99-102
    • /
    • 2004
  • Caching is one of essential functions in a wireless internet proxy server cluster. To serve best quality of service and choose suitable a proxy server for user, load balancer have to consider cache cooperation between proxy servers. Usually hashing is a simple way to support cache cooperation. In this paper, we compare and analysis static hashing and MD 5 that can be used for cache cooperation.

  • PDF

Improving Performance of Internet by Using Hierarchical Proxy Cache (계층적 프록시 캐쉬를 이용한 인터넷 성능 향상 기법)

  • 이효일;김종현
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.2
    • /
    • pp.1-14
    • /
    • 2000
  • Recently, as construction of information infra including high-speed communication networks remarkably expands, more various information services have been provided. Thus the number of internet users rapidly increases, and it results in heavy load on Web server and higher traffics on networks. The phenomena cause longer response time that means worse quality of service. To solve such problems, much effort has been attempted to loosen bottleneck on Web server, reduce traffic on networks and shorten response times by caching informations being accessed more frequently at the proxy server that is located near to clients. And it is also possible to improve internet performance further by allowing clients to share informations stored in proxy caches. In this paper, we perform simulations of hierarchical proxy caches with the 3-level 4-ary tree structure by using real web traces, and analyze cache hit ratio for various cache replacement policies and cache sizes when the delayed-store scheme is applied. According to simulation results, the delayed-store scheme increases the remote cache hit ratio, that improves quality of service by shortening the service response time.

  • PDF