• Journal of Sensor Science and Technology
• /
• v.7 no.2
• /
• pp.124-130
• /
• 1998

High-speed 3D vision systems are essential for autonomous robot or vehicle control applications. In our study, a stereo vision process has been developed. It consists of three steps : extraction of edges in right and left images, matching corresponding edges and calculation of the 3D map. This process is implemented in a VME 150/40 Imaging Technology vision system. It is a modular system composed by a display, an acquisition, a four Mbytes image frame memory, and three computational cards. Programmable accelerator computational modules are running at 40 MHz and are based on TMS320C31 DSP with a $64{\times}32$ bit instruction cache and two $1024{\times}32$ bit internal RAMs. Each is equipped with 512 Kbytes static RAM, 4 Mbytes image memory, 1 Mbytes flash EEPROM and a serial port. Data transfers and communications between modules are provided by three 8 bit global video bus, and three local configurable pipeline 8 bit video bus. The VME bus is dedicated to system management. Tasks between DSPs are distributed as follows: two DSPs are used to edges detection, one for the right image and the other for the left one. The last processor computes the matching process and the 3D calculation. With $512{\times}512$ pixels images, this sensor generates dense 3D maps at a rate of about 1 Hz depending of the scene complexity. Results can surely be improved by using a special suited multiprocessors cards.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.847-854
• /
• 2001

The Web continues to grow fast rate in both a large aclae volume of traffic and the size and complexity of Web sites. Along with growth, the complexity of tasks such as Web site design Web server design and of navigating simply through a Web site have increased. An important input to these design tasks is the analysis of how a web site is being used. The is paper proposes a Page logging System(PLS) identifying reliably user sessions required in Web mining system PLS consists of Page Logger acquiring all the page accesses of the user Log processor producing user session from these data, and statements to incorporate a call to page logger applet. Proposed PLS abbreviates several preprocessing tasks which spends a log of time and efforts that must be performed in Web mining systems. In particular, it simplifies the complexity of transaction identification phase through acquiring directly the amount of time a user stays on a page. Also PLS solves local cache hits and proxy IPs that create problems with identifying user sessions from Web sever log.

• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.629-640
• /
• 2003

A shared disk (SD) cluster couples multiple nodes for high performance transaction processing, and all the coupled nodes share a common database at the disk level. In the SD cluster, a transaction routing corresponds to select a node for an incoming transaction to be executed. An affinity-based routing can increase local buffer hit ratio of each node by clustering transactions referencing similar data to be executed on the same node. However, the affinity-based routing is very much non-adaptive to the changes in the system load, and thus a specific node will be overloaded if transactions in some class are congested. In this paper, we propose a dynamic transaction routing scheme that can achieve an optimal balance between affinity-based routing and dynamic load balancing of all the nodes in the SD cluster. The proposed scheme is novel in the sense that it can improve the system performance by increasing the local buffer hit ratio and reducing the buffer invalidation overhead.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.4
• /
• pp.313-322
• /
• 2016

This paper presents a method to improve the performance of Scalable Multicast Protocol deployed in wired and wireless network by adding retransmission function on base stations. When using Scalable Multicast Protocol over wireless and wired networks, packet drops on the wireless link produce the initiation of retransmission request packets and the implosion of retransmission packets, which deteriorate the multicast session performance. The efficient reliable multicast mechanism in wireless networks utilizing the retransmission function on the base station is addressed in this paper. We explain the design of a retransmission function which improves the performance of Scalable Multicast Protocol sessions in wireless and wirednetwork. The main idea is to cache Scalable Multicast Protocol packets at the base station and perform local retransmissions across the wireless link. ARENA has been used to simulate and to get performance for reducing signaling overhead and processing delay through the comparison of the proposed function to the Scalable Multicast Protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4268-4290
• /
• 2015

Future mobile communications face enormous challenges as traditional voice services are replaced with increasing mobile multimedia and data services. To address the vast data traffic volume and the requirement of user Quality of Experience (QoE) in the next generation mobile networks, it is imperative to develop efficient content distribution technique, aiming at significantly reducing redundant data transmissions and improving content delivery performance. On the other hand, in recent years cloud computing as a promising new content-centric paradigm is exploited to fulfil the multimedia requirements by provisioning data and computing resources on demand. In this paper, we propose a cooperative caching framework which implements State based Content Distribution (SCD) algorithm for future mobile networks. In our proposed framework, cloud service providers deploy a plurality of cloudlets in the network forming a Distributed Cloud Service Network (DCSN), and pre-allocate content services in local cloudlets to avoid redundant content transmissions. We use content popularity and content state which is determined by content requests, editorial updates and new arrivals to formulate a content distribution optimization model. Data contents are deployed in local cloudlets according to the optimal solution to achieve the lowest average content delivery latency. We use simulation experiments to validate the effectiveness of our proposed framework. Numerical results show that the proposed framework can significantly improve content cache hit rate, reduce content delivery latency and outbound traffic volume in comparison with known existing caching strategies.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.705-715
• /
• 2005

A peer-to-peer web caching has been studied recently as it can reduce the traffic converged on the server side and can support the traditional web caching model. Although the peer-to-peer web caching has the merit of having additional cache space from the local caches of peers without additional infrastructure, several constraints such as dynamic participation and local caching strategy caused by the autonomy of peers in peer-to-peer networks nay limit the performance of the peer-to-peer web caching. To overcome these limitations, we propose an efficient directory-based peer-to-peer web caching system under dynamic participation of peers. In the proposed caching system, we present new peer selection and replica management schemes by introducing the concept of the object lifetime in P2P networks. We evaluate the effectiveness of the proposed system through trace-driven simulations with a web log dataset. Simulation results show that the proposed system has higher accuracy and fewer redirection failures than the conventional directory-based P2P web caching system in feasible peer-to-peer networks.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.2
• /
• pp.123-128
• /
• 2009

In ubiquitous computing environments, service discovery to search for an available service is an important issue. In this paper, we propose an efficient service discovery scheme that is combined a node id-based clustering service discovery scheme and a P2P caching-based information spreading scheme. To search quickly a service, proposed scheme store key information in neighbor's local cache and search services using it's information. We do not use a central look up server and do not rely on flooding. Through simulation, we show that the proposed scheme improves the performance of response time and network load compared to other methods.

• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.138-148
• /
• 2000

In the mobile computing environment, in order to make copies of important files available when being disconnected the mobile host(client) must store them in its local cache while the connection is maintained. In this paper, we propose the prefetching mechanism for the client to save files which may be accessed in the near future. Our mechanism utilizes analyzer, prefetch-list producer, and prefetch manager. The analyzer records file access patterns of the user in a FAP(File Access Patterns) profile. Using the profile, the prefetch-list producer creates the prefetch-list. The prefetch manager requests a file server to return this list. We set the parameter TRP(Threshold of Reference Probability) to ensure that only reasonably related files can be prefetched. The prefetch-list producer adds the files to a prefetch-list if their reference probability is greater than the TRP. We also use the parameter TACP(Threshold of Access Counter Probability) to reduce the hoarding size required to store a prefetch-list. Finally, we measure the metrics such as the cache hit ratio, the number of files referenced by the client after disconnection and the hoarding size. The simulation results show that the performance of our mechanism is superior to that of the LRU caching mechanism. Our results also show that prefetching with the TACP can reduce the hoard size while maintaining similar performance of prefetching without TACP.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2430-2447
• /
• 2013

In recent years, HTTP adaptive streaming (HAS) has attracted considerable attention as the state-of-the-art technology for video transport. HAS dynamically adjusts the quality of video streaming according to the network bandwidth and device capability of users. Content-Centric Networking (CCN) has also emerged as a future Internet architecture, which is a novel communication paradigm that integrates content delivery as a native network primitive. These trends have led to the new research issue of harmonizing HAS with the in-network caching provided by CCN routers. Previous research has shown that the performance of HAS can be improved by using the H.264/SVC(scalable video codec) in the in-network caching environments. However, the previous study did not address the misbehavior that causes video freeze when overestimating the available network bandwidth, which is attributable to the high cache hit rate. Thus, we propose a new SVC-based adaptation algorithm that utilizes a drop timer. Our approach aims to stop the downloading of additional enhancement layers that are not cached in the local CCN routers in a timely manner, thereby preventing excessive consumption of the video buffer. We implemented our algorithm in the SVC-HAS client and deployed a testbed that could run Smooth-Streaming, which is one of the most popular HAS solutions, over CCNx, which is the reference implementation of CCN. Our experimental results showed that the proposed scheme (SLA) could avoid video freeze in an effective manner, but without reducing the high hit rate on the CCN routers or affecting the high video quality on the SVC-HAS client.

• Journal of the Korea Convergence Society
• /
• v.7 no.4
• /
• pp.25-32
• /
• 2016

When using reliable multicast protocol over air links, the multicast packets lost in the air link cause the initiation of retransmission request packets and the implosion of retransmission packets, which deteriorate multicast session performance. This paper proposes on the efficient reliable multicast mechanism in wireless networks utilizing the Agents. In this paper we show the design of a retransmission agent which improves the performance of reliable multicast sessions in wireless network. The main idea is to cache reliable multicast packets at the base station and perform local retransmissions across the wireless link. MATLAB has been used to simulate and to get performance results for signaling overhead and processing delay through the comparison of the proposed agent model to the Multicast File Transfer Protocol. It has been proven from the simulation results that the proxy module make pass trials shorter in Multicast File Transfer Protocol.