• 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.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.313-320
• /
• 2005

The increasing popularity of multimedia streaming services introduces new challenges in content distribution. Especially, it is important to provide the QoS guarantees as they are increasingly expected to support the multimedia applications. Multimedia streams typically experience the high start-up delay due to the large protocol overhead, the delay, and the loss properties of the wireless networks. The service providers can improve the performance of multimedia streaming by caching the initial segment (prefix) of the popular streams at proxies near the requesting clients. The proxy can initiate transmission to the client while requesting the remainder of the stream from the server. In this paper, we propose the traffic based caching algorithm (TSLRU) to improve the performance of caching proxy. TSLRU classifies the traffic into three types, and improve the performance of caching proxy by reflecting the several elements such as traffic types, recency, frequency, object size when performing the replacement decision. In simulation, TSLRU performs better than the existing schemes in terms of byte hit rate, hit rate, startup latency, and throughput.

• 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.

• 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.

• Journal of Advanced Navigation Technology
• /
• v.15 no.3
• /
• pp.364-371
• /
• 2011

In P2P distribution mobile networks, QoS of streaming media services are under heavy influence from overheads such as congestion, latency, and interference. The problem is further complicated by the fact that the popularity of media objects changes over time. This paper proposes a new FSMS+ (Fuzzy Similarity-based Multi-level Streaming Scheme) which minimizes performance degradation of streaming services due to overhead. We then utilize fuzzy similarity-based relevance that can dynamically stream the streaming media object with minimum overhead. The simulation result showed that the proposed scheme has better performance in retransmission rate, congestion control rate and latency rate than the other existing methods of distance method, DC (disk caching) method, and prefix method.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.405-415
• /
• 2005

Indexing techniques are used to implement selective tuning in wireless environments Indices are broadcast together with data to help mobile clients locate the required information. As a result, clients stay in doze mode most of the time. The drawback of this solution is that broadcast cycles are lengthened due to additional index information. In location-aware mobile services(LAMSs), it is important to reduce the query response time, since a late query response nay contain out-of-date information. In this paper, we present a broadcast-based spatial query processing method (BBS) designed to support k-NN query processing. In the BBS, broadcasted data objects are sorted sequentially based on their locations, and the server broadcasts the location dependent data along with an index segment. The performance of this scheme is investigated in relation to various environmental variables, such as the distributions of the data objects, the average speed of the clients and the size of the service area.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.6
• /
• pp.203-210
• /
• 2008

Recently, as wireless communication are becoming more and more popular, Internet users is becoming increasingly demand HTTP-based web service in mobile computing environment. But, overall performance of web services may slow down, because mobile device are generally equipped with lower capability. Therefore, the most important factor to design wireless internet delivery system should be scalable to handle a large scale traffic due to rapidly growing users. But, in case of some preceding research, they not present a basic efficiency reform measure until currently. Therefore, In this paper, We propose a Web Service Delivery System for mobile environment that alleviates problems that occurred while executing web services in mobile environment and are helpful to overcome the above needs. The system composed of HTML/WML Converter, SOAP message processor. We compare the existing system with the proposed system.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.280-288
• /
• 2019

In the CR-enabled MANET, routing paths can be easily destroyed due to node mobility and channel unavailability (due to the emergence of the PU of a channel), resulting in significant overhead to maintain/recover the routing path. In this paper, network caching is actively used for route maintenance, taking into account the properties of the CR. In the proposed scheme, even if a node detects that a path becomes unavailable, it does not generate control messages to establish an alternative path. Instead, the node stores the packets in its local cache and 1) waits for a certain amount of time for the PU to disappear; 2) waits for a little longer while overhearing messages from other flow; 3) after that, the node applies local route recovery process or delay tolerant forwarding strategy. According to the simulation study using the OPNET simulator, it is shown that the proposed scheme successfully reduces the amount of control messages for path recovery and the service latency for the time-sensitive traffic by 13.8% and 45.4%, respectively, compared to the existing scheme. Nevertheless, the delivery ratio of the time-insensitive traffic is improved 14.5% in the proposed scheme.

• Journal of KIISE:Software and Applications
• /
• v.26 no.8
• /
• pp.974-987
• /
• 1999

이동 컴퓨팅 환경에서 자주 접근하는 데이터에 대한 캐싱은 무선 채널의 좁은 대역폭에서 경쟁을 줄일 수 있는 유용한 기술이다. 그러나, 트랜잭션 캐시 일관성을 지원하는 전통적인 클라이언트/서버 전략은 클라이언트와 서버간에 많은 양의 통신을 필요로 하기 때문에 이동 클라이언트/서버 컴퓨팅 환경에서는 적절하지 않다. 본 논문에서는 브로드캐스트-기반 캐시 무효화 정책을 사용하면서 트랜잭션 캐시 일관성을 지원하는 OCC-UTS (Optimistic Concurrency Control with Update TimeStamp) 프로토콜을 제안한다. 접근한 데이터에 대한 일관성 검사 및 완료 프로토콜은 캐시 무효화 과정의 내부 과정으로 완전 분산 형태로 효율적으로 구현되며, 일관성 체크의 대부분이 이동 클라이언트에서 수행된다. 또한, 분석 모델에 기반한 성능 비교를 통해, 본 논문에서 제안하는 OCC-UTS 프로토콜이 다른 경쟁 프로토콜보다 높은 트랜잭션 처리율을 얻으며, 데이터 항목을 자주 접근하면 할수록 지역 캐시를 사용하는 OCC-UTS 프로토콜이 더 효율적임을 보인다. 이동 클라이언트의 접속 단절에 대해서는 무효화 브로드캐스트 윈도우를 크게 하여 접속 단절에 적절히 대처할 수 있다.Abstract In a mobile computing environment, caching of frequently accessed data has been shown to be a useful technique for reducing contention on the narrow bandwidth of the wireless channels. However, the traditional client/server strategies for supporting transactional cache consistency that require extensive communications between a client and a server are not appropriate in a mobile client/server computing environment. In this paper, we propose a new protocol, called OCC-UTS (Optimisitic Concurrency Control with Update TimeStamp), to support transactional cache consistency in a mobile client/server computing environment by utilizing the broadcast-based solutions for the problem of invalidating caches. The consistency check on accessed data and the commitment protocol are implemented in a truly distributed fashion as an integral part of cache invalidation process, with most burden of consistency check being downloaded to mobile clients. Also, our experiments based on an analytical model substantiate the basic idea and study the performance characteristics. Experimental results show that OCC-UTS protocol without local cache outperforms other competitor protocol, and the more frequent a mobile client accesses data items the more efficient OCC-UTS protocol with local cache is. With respect to disconnection, the tolerance to disconnection is improved if the invalidation broadcast window size is extended.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.5
• /
• pp.282-296
• /
• 2006

In a wireless client server environment, data broadcasting is an efficient data dissemination method; a server broadcasts data, and some of broadcasted data are cached in a mobile client's cache to save the narrow communication bandwidth, limited resources, and data access time. A server also broadcasts invalidation reports to maintain the consistency between server data and a client's cached data. Most of existing works on the cache consistency problems simply purge the entire cache when the disconnection time is long enough to miss the certain amount(window size) of IRs. This paper presents a cache invalidation method to increase mobile clients' cache reusability in case of a long disconnection. Instead of simply dropping the entire cache regardless of its consistency, a client estimates the cost of purging all the data with the cost of selective purge. If the cost of dropping entire cache is higher, a client maintains the cache and selectively purge inconsistent data using uplink bandwidth for validation request. The simulation results show that this scheme increases the cache reusability since it effectively considers the update rates and the broadcast frequencies of cached data in estimating the cost of cache maintenance.