• Management Science and Financial Engineering
• /
• v.14 no.1
• /
• pp.23-34
• /
• 2008

In this study, we consider stationary waiting times in a Poisson driven single-server m-node queues in series. We assume that service times at nodes are independent, and are either deterministic or non-overlapped. Each node excluding the first node has a finite waiting line and every node is operated under a FIFO service discipline and a communication blocking policy (blocking before service). By applying (max, +)-algebra to a corresponding stochastic event graph, a special case of timed Petri nets, we derive the explicit expressions for stationary waiting times at all areas, which are functions of finite buffer capacities. These expressions allow us to compute the performance measures of interest such as mean, higher moments, or tail probability of waiting time. Moreover, as applications of these results, we introduce optimization problems which determine either the biggest arrival rate or the smallest buffer capacities satisfying probabilistic constraints on waiting times. These results can be also applied to bounds of waiting times in more general systems. Numerical examples are also provided.

• Journal of Korea Multimedia Society
• /
• v.10 no.3
• /
• pp.401-410
• /
• 2007

Multimedia streams transmitted through the Internet have a strict playback delay time. Multimedia data arriving aster the playback time cannot be played in the receiver and are discarded. Thus, this paper proposed a protocol, in which the multimedia stream server determines whether data can be played in the receiver before sending the data. The proposed model has a PSCTP sub-layer on top of existing PR-SCTP and decides whether to send data messages, which have come from the multimedia applicationserver, and which PR-SCTP stream the data will be sent to. In addition, the proposed model uses the differentiated retransmission function of PR-SCTP. We evaluated the performance of SCTP, PR-SCTP and PSCTP using NS2 simulator. According to the results of the evaluation, the PSCTP protocol decreased the volume of transmission and increased the video decodable ratio compared to other protocols.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.2
• /
• pp.209-217
• /
• 2014

Of several approaches for future Internet, separating two properties of IP address into locator and identifier, is being considered as a highly likely solution. IETF's LISP (Locator ID Separation Protocol) is proposed for this architecture. In particular, the LISP model easily allows for device mobility through simple update of information at MS (Mapping Server) without a separate protocol. In recent years, some of the models supporting device mobility using such LISP attributes have emerged; however, most of them have the limitation for seamless mobility support due to the frequent MS information updates and the time required for the updates. In this paper, PMIPv6 (Proxy Mobile IPv6) model is applied for mobility support in LISP model. PMIPv6 is a method that can support mobility based on network without the help of device; thus, this we define anew the behavior of functional modules (LMA, MAG and MS) to fit this model to the LISP environment and present specifically procedures of device registration, data transfer, route optimization and handover. In addition, our approach improves the communication performance using three tunnels identified with locators between mobile node and corresponding node and using a route optimized tunnel between MN's MAG and CN's MAG. Finally, it allows for seamless mobility by designing a sophisticated handover procedure.

• Journal of Korea Multimedia Society
• /
• v.4 no.6
• /
• pp.534-542
• /
• 2001

Recent content-based image retrieval systems make use of a local single server contained a limited number of images. So these systems are not satisfactory for the Web user's needs that make request for various images on the Web. A content-based image retrieval system that has regard for a great number of Web images has to stand on the basis of real-time first of all. Therefore, to implement the above system we have to resolve a problem of large waste time to take for an image collection and feature extractions. In recent, PC clusters with a load distribution are implemented for the purpose of high-performance data processing. In this paper, we decreased the whole retrieval time by distributing the tasks of image collection and feature extraction to take much time among the slave computers of the PC cluster, and so we found the possibility of the real-time processing in the retrieval of Web images.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.208-214
• /
• 2006

Participants of a NVE(networked virtual environment) may have different hardwares and network environments, and to guarantee the fairness, messages of participants should be synchronized. A solution for the synchronization problem is to wait for a certain amount of time until the server processes the message. It is not easy to determine a suitable waiting period because of the trade-off between the fairness and the responsiveness. In this paper we propose a method to decide a waiting period by considering only the participants with small network delays and perform experiments for the performance evaluation. Experiments show that the proposed method leads to significant improvement of responsiveness, while retaining fairness.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.8
• /
• pp.1743-1749
• /
• 2011

The multimedia data for video-on-demand(VOD) service has large, continuous and real time characteristics. The frequent disk I/O operations takes much time and decrease the system performance in multimedia services. Therefore the efficient buffer management is needed in order to reduce the disk accesses to multimedia data. This paper addresses how to increase the buffer hit ratio and the number of users in a multimedia service like VOD by increasing the utility of buffer. This paper also simulated various resource management algorithms and strategies and evaluated, compared and analyzed their performances.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.6
• /
• pp.1077-1082
• /
• 2009

Wireless Mesh Network(WMN) is wireless backbone networks technique which has ease of network configuration and cost of advantage. Recently, WNM released a new product, but most of existing research and technology analysis the performance through the simulation. This paper build the wireless mesh network testbed for actual situation. Testbed supports multi-channel multi-interface using bridge, the Wireless Distribution System and dynamic location-based routing protocol. This routing protocol strongly design against wireless interference using metric for link channel change and real distance. Then, the address of mesh clients assigned by the centralized address management server. Mesh clients is designed and implemented to manage network through Simple Network Management Protocol.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.642-645
• /
• 2012

MANET has disadvantage for information intrusion caused from non-infra structure. That is based on mixed problems caused from terminal devices has no capability of various resources using abilities to run intrusion prevention function, and also from difficulty of no easy using infra structural server like as firewall. In this paper, transmission performances, be effected from information intrusion and IDS(Intrusion Detection System), are analyzed for large scale MANET, and weakness from information intrusion of MANET are studied. This study is for large scale MANET which has some large communication area and lots of nodes, voice traffic, based on VoIP protocols, is considered as application services be transmitted over MANETs. Computer simulation using NS-2 is used to measure and show MOS and call connection ratios.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.117-124
• /
• 2003

The system implemented in this paper partitions and stores specimen data captured by a light microscope on distributed or parallel systems. Users ran observe images on computers as we use a physical microscope. Based on the client-server computing model, the system consists of client, coordinator, and data manager. Three components communicate messages. For retrieving images, we implemented the client program with necessary functions for educational applications such at image mark and text annotation, and defined the communication protocol. We performed the experiment for introducing a tape storage which stores a large volume of data. The experiment results showed performance improvement by data partitioning and indexing technique.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.12 no.6
• /
• pp.545-553
• /
• 1987

An approximation algorithm has been obtained to analyze the network of single server tandem queues with a finite length. In the queueing network with a finite queue length, the blocking which is mutually dependent, occure due to the limitation of the queue length. Thus, it is difficults to analyze such a queueing network. In this paper each queue has been regarded as the independent M/M/1/K system to analyze the queueing network with the blocking, which is based on the assumption that an arrival rate to the present station is increased by the blocking of the following stations. The performance measures, such as state probability, average queue length and tha waiting time, can be easily obtained using the proposed algorithm. In order to justify this approximation algorithm, comparison of the results of this algorithm with those of state transition simultaneous equations has been made an verified with computer simulation.