• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8B
• /
• pp.786-796
• /
• 2009

Currently, web syndication is usually utilized in desktop environments, but not considering mobile environments. In this paper, we focus on the extension of the desktop based web syndication to the mobile internet. Simply adapting the desktop based web syndication to mobile devices can cause high wireless internet communication cost. We propose PMS(Proxy-based Mobile Syndication) model which achieves low cost mobile syndication. In the PMS model, MWProxy is defined as a proxy server between mobile devices and web sites. It can reduce the communication cost by peeking up modified items from the web sites and reducing the channel size. In this paper, we designed and implemented the PMS system in a mobile phone and evaluated the performance of the PMS system by conducting real experiments using mobile emulators.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.347-354
• /
• 2004

The provision of location tracking for mobile agents is designed to deliver a message to a moving object in a network. Most tracking methods exploit relay stations that hold location information to forward messages to a target mobile agent. In this paper, we propose an efficient location tracking method for mobile agents using the domain-based proxy as a relay station. Mobile agents can reduce the length of their migration paths by visiting hosts in the same domain first, rather than selecting hosts randomly. The proposed method exploits the domain-based moving patterns of mobile agents and minimizes registration and message delivery costs. Since the long proxy chain can contribute to the high message delivery cost, we also propose a compressing method to reduce the message delivery cost.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.2
• /
• pp.317-326
• /
• 2012

Internet service provider is able to collect personal information to prevent the violations of the rights of service providers and customers using internet. But there are still many debates going on between a personal privacy and a regulation. Proxy servers are used in various technical purposes include bypass access. Although the proxy server users are increasing but there are not any proper institutional mechanisms and regulations to protect users. In this study, we discuss the two sides of a proxy service includes its privacy protection function and the cyber-crime threat and propose supplementary measures to mediate between the interests of public and private.

• The KIPS Transactions:PartA
• /
• v.15A no.1
• /
• pp.53-60
• /
• 2008

Streaming media has contributed to a significant amount of today's Internet Traffic. Like traditional web objects, rich media objects can benefit from proxy caching, but caching streaming media is more of challenging than caching simple web objects, because the streaming media have features such as huge size and high bandwidth. And to support various bandwidth requirements for the heterogeneous ubiquitous devices, a transcoding proxy is usually necessary to provide not only adapting multimedia streams to the client by transcoding, but also caching them for later use. The traditional proxy considers only a single version of the objects, whether they are to be cached or not. However the transcoding proxy has to evaluate the aggregate effect from caching multiple versions of the same object to determine an optimal set of cache objects. And recent researches about multimedia caching frequently store initial parts of videos on the proxy to reduce playback latency and archive better performance. Also lots of researches manage the contents with segments for efficient storage management. In this paper, we define the 9-events of transcoding proxy using 4-atomic events. According to these events, the transcoding proxy can define the next actions. Then, we also propose the segment-based caching policy for the transcoding proxy system. The performance results show that the proposing policy have a low delayed start time, high byte-hit ratio and less transcoding data.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.415-426
• /
• 2005

Wireless internet, which becomes a hot social issue, has limitations due to the following characteristics, as different from wired internet. It has low bandwidth, frequent disconnection, low computing power, and small screen in user terminal. Also, it has technical issues to Improve in terms of user mobility, network protocol, security, and etc. Wireless internet server should be scalable to handle a large scale traffic due to rapidly growing users. In this paper, wireless internet proxy server clusters are used for the wireless Internet because their caching, distillation, and clustering functions are helpful to overcome the above limitations and needs. TranSend was proposed as a clustering based wireless internet proxy server but it has disadvantages; 1) its scalability is difficult to achieve because there is no systematic way to do it and 2) its structure is complex because of the inefficient communication structure among modules. In our former research, we proposed the All-in-one structure which can be scalable in a systematic way but it also has disadvantages; 1) data sharing among cache servers is not allowed and 2) its communication structure among modules is complex. In this paper, we proposed its improved scheme which has an efficient communication structure among modules and allows data to be shared among cache servers. We performed experiments using 16 PCs and experimental results show 54.86$\%$ and 4.70$\%$ performance improvement of the proposed system compared to TranSend and All-in-one system respectively Due to data sharing amount cache servers, the proposed scheme has an advantage of keeping a fixed size of the total cache memory regardless of cache server numbers. On the contrary, in All-in-one, the total cache memory size increases proportional to the number of cache servers since each cache server should keep all cache data, respectively.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.615-622
• /
• 2006

Caching in a Wireless Internet Proxy Server Cluster Environment has an effect that minimizes the time on the request and response of Internet traffic and Web user As a way to increase the hit ratio of cache, we can use a hash function to make the same request URLs to be assigned to the same cache server. The disadvantage of the hashing scheme is that client requests cannot be well-distributed to all cache servers so that the performance of the whole system can depend on only a few busy servers. In this paper, we propose an improved load balancing scheme using hashing and Round Robin scheme that distributes client requests evenly to cache servers. In the existing hashing scheme, if a hashing value for a request URL is calculated, the server number is statically fixed at compile time while in the proposed scheme it is dynamically fixed at run time using round robin method. We implemented the proposed scheme in a Wireless Internet Proxy Server Cluster Environment and performed experiments using 16 PCs. Experimental results show the even distribution of client requests and the 52% to 112% performance improvement compared to the existing hashing method.

• The KIPS Transactions:PartA
• /
• v.13A no.4 s.101
• /
• pp.343-350
• /
• 2006

In this paper, wireless internet proxy server clusters are used for the wireless internet because their caching, distillation, and clustering functions are helpful to overcome the limitations and needs of the wireless internet. A wireless Internet proxy server cluster needs a systematic scalability, simple communication structure, cooperative caching, and serving Hot Spot requests. In our former research, we proposed the CD-A structure which can be scalable in a systematic way and has a simple communication structure but it has no cooperative caching. A hash based load balancing can be used to solve the problem, but it can not deal with Hot Spot request problem. In this paper, we proposed a shared storage based wireless internet proxy server cluster which has a systematic scalability, simple communication structure, cooperative caching, and serving Hot Spot requests. The proposed method shares one cache directory and it has advantages: advantages of the existing CD-A structure, cooperative caching, and serving Hot Spot requests. We performed experiments using 16 PCs and experimental results show high performance improvement of the proposed system compared to the existing systems in Hot Spot requests.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.259-259
• /
• 2004

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.319-321
• /
• 2005

이동 애드 혹 네트워크은 빈번한 위상 변화가 일어난다. 이에 대처하기 위해 비상태 멀티캐스팅이나 위상 변화에 강한 특성을 지니는 오버레이 멀티캐스트 프로토콜들이 제안되고 있다. 하지만 이들의 대부분은 소규모 그룹에 대한 멀티캐스트만을 지원한다. 그러나 이동 애드 혹 네트워크의 대표적인 응용들은 대규모 그룹 통신을 사용하므로 확장성 문제는 해결되어야 한다. 따라서 본 논문에서는 이를 개선하기 위해 단일 홉 클러스터링과 프록시 노드 사용을 제안한다. 단일 홉 클러스터링은 구조적인 관리가 필요한 노드 수를 줄일 수 있으며 프록시 노드는 단일 홉 클러스터링으로 줄어든 노드들에게 계층화된 포워딩을 제공한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.300-305
• /
• 2007

무선 센서 네트워크 시스템에서의 각 노드의 에너지는 제한적이기 때문에 에너지 효율적인 무선 센서 네트워크 시스템에 대한 연구가 활발하게 이루어져왔다. 무선 센서 네트워크는 목적에 따라 무선 센서 네트워크 기반의 모니터링 시스템과 질의처리 시스템으로 분류할 수 있다. 모니터링 시스템은 각 센서노드에서 센싱 데이터의 값이 변화가 없더라도 각 주기마다 전송하기 때문에 모니터링 주기가 짧아질수록 더 많은 양의 에너지가 낭비된다. 또한 모니터링 주기가 길어질수록 생성된 데이터에 대한 신뢰도가 감소하는 문제가 발생한다. 질의처리 시스템의 경우 중복질의 처리를 위해 많은 양의 에너지가 낭비된다. 본 논문에서는 분산 데이터베이스 개념을 기반으로 무선 센서 네트워크에 프록시 시스템을 적용하여 에너지 효율적인 모니터링과 질의처리 방법을 제안한다.