• International Journal of Contents
• /
• v.5 no.1
• /
• pp.21-26
• /
• 2009

Peer to Peer (P2P) utilizes the resources of an offered service without the need for a central server or preexistent server-client, making it a desirable network environment for data exchange based on direct connection between peers. Proposed by Sun Microsystems. JXTA(Juxtapose) is a typical P2P system and distributed computing model that does not require central service resources and is flexible to deal with various network configuration changes. Meanwhile. Mobile Ad-hoc NETwork(MANET) is a typical wireless network configured with mobile nodes and without an infrastructure. where a network is established by direct connection or through other peers in the propagation area. Thus, MANET maintains the latest path information by establishing paths and changing path information for communication between peers in a highly mobile wireless network. Accordingly. this article proposes the JXTAMANET method for wireless networks to enable JXTA to be applied to MANET. NS2 is used to evaluate the performance and the proposed architecture is shown to produce better results than a conventional flooding method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.153-162
• /
• 1997

M/G/1 queueing system is one of the most widely used one to model the real system. When operating a real systems, since it often takes cost, some control policies that change the operation scheme are adopted. In particular, the N-policy is the most popular among many control policies. Almost all researches on queueing system are based on the assumption that the arrival rates of customers into the queueing system is constant, In this paper, we consider the M/G/1 queueing system whose arrival rate varies according to the servers status : idle, set-up and busy states. For this study, we construct the steady state equations of queue lengths by means of the supplementary variable method, and derive the PGF(probability generating function) of them. The L-S-T(Laplace Stieltjes transform) of waiting time and average waiting time are also presented. We also develop an algorithm to find the optimal N-value from which the server starts his set-up. An analysis on the performance measures to minimize total operation cost of queueing system is included. We finally investigate the behavior of system operation cost as the optimal N and arrival rate change by a numerical study.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.19-26
• /
• 1998

Mobile database system address information processing based on database system in mobile computing environment. In the mobile database system, when a mobile transaction host enter a other radio coverage area called a cell while processing a transaction, it have to alter the communication network address to new database server. This is called transactional service handoff. This paper propose a transaction processing scheme for providing the proper function of this transactional service handoffs in mobile database system. This scheme apply coordinator migration mechanism which perform the transaction in new database server when posed to be the transaction service handoff. Fially, the proposed scheme will improve system performance by minimizing the tansmission of message for processing the transactions in mobile database system.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.7
• /
• pp.1003-1010
• /
• 2013

In this paper, TCP/IP based Machine-to-Machine (M2M) communication uses CDMA/GSM network for data communication. This communication method is widely used by offshore moored buoy for data transmission back to the system server. Due to weather and signal coverage, the TCP/IP M2M communication often experiences transmission failure and causing data losses in the server. Data losses are undesired especially for meteorological and oceanographic analysis. This paper discusses a software approach to minimize M2M data losses by handling transmission failure and re-attempt which meant to transmit the data for recovery. This implementation was tested for its performance on a meteorological buoy placed offshore.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.1
• /
• pp.87-99
• /
• 1998

In the multicasting communications, the quality of service is not guaranteed occasionally, according to the shortage of resources, because all resources such as communication buffer, processing power for the packet multiplication, and bandwidth, should be shared among each members. This problem can be solved through the hierarchical multicaster construction mechanism which guarantees that all multicaster can be operated within the required performance. This paper proposes the architecture of multipoint communication server based on hypercube type massively parallel computer. Through the simulation, it is verified that the traffic of links between each node of hypercube computer is under the some bandwidth. So, it is certified that the hypercube computer is suitable for the multicast communication servers supporting the various groups.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.08a
• /
• pp.91-94
• /
• 2008

As the mobile devices and the wireless networks have high-performance capabilities, it is possible to synchronize the spatio-temporal data of a server with the spatio-temporal data of a mobile device which are collected at a field. However, since the server process the synchronization which the model device requests, the whole synchronizations of mass mobile devices take long time. In this paper, we propose the scheme to process concurrently the synchronizations of mobile devices which does not conflict with others using the scheme of a multi-queue.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6A
• /
• pp.918-926
• /
• 2000

A huge storage and broad bandwidth are required to provide subscribers with VoD services. Hence, there is a huge amount of cost in establishing networks for VoD services. To determine how to reduce the cost, a number of studies involving such as distributed server systems, multicasting, program caching, stream sharing, are currently in progress. In this paper, a request criterion for multicast service and the ratio of required bandwidth for unicast to multicast are generated. The effect of multicast service on network bandwidth, server bandwidth, and buffer size was analyzed and validated through computer simulation. The results of this study could be applied to efficient designing networks for VoD services.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2608-2617
• /
• 1999

One of the most important functionality that commercial video storage servers should provide is to maximize the number of concurrent streams and to minimize the initial latency of new requests. In this paper, we propose a data placement scheme whose disk read unit size can be twice large than that of conventional striping methods. The proposed scheme can significantly increase the number of concurrent streams, since the ratio of rotational latency time is decreased and the disks are effectively utilized. The disk scheduling scheme we propose guarantees constant initial latency time. We also propose a procedural design method for a storage server by introducing the concept of allowed initial latency. The comparison with previous research shows that the proposed scheme provides better performance.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.5
• /
• pp.1143-1152
• /
• 1999

A Mobile computing environment is a new paradigm which provides users with the access to information irrespective of users' location. A transaction scheduling method for the mobile computing environment must be designed so that database consistency is maintained with considering the limited performance of mobile hosts and the narrow bandwidth of a wireless network. The scheduling method using a lock has some problems: the high message overhead between a server and a mobile host for maintaining a lock and the high abort ratio of the mobile transactions owing to violating the serializability when a mobile host uses a cache. So, in this paper, we propose an efficient transaction management method using timestamp to resolve these problems. The proposed method is used in the environment under which a mobile host uses a cache having two versions for each cached data item and a server maintains several versions for each data item. So, even though a mobile transaction is executed during several broadcasting interval, can be committed. As a result, the proposed method can improve the commit ratio of the mobile transactions by maintaining multiversion for each data item and does not require the additional message exchange to schedule transactions by using timestamp.

• Journal of Information Management
• /
• v.25 no.3
• /
• pp.1-27
• /
• 1994

CDLIB system, a CD-ROM network system constructed in the KTRC, made all the users connected with KTRC TRAN share the many CD-ROM drives and the massive information on the CD-ROM discs. The system is composed of CD-ROM network server, file server and the software which allows the users to retrieve CD-ROM discs through the network. This system has the following strong points : cost-effectiveness in the aspect of sharing the CD-ROM resources in the LAN environment and high system performance.