• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.1
• /
• pp.57-64
• /
• 2006

Multiprocessor system on chip (MPSoC) platforms has set a new innovative trend for the SoC design. Quality of service parameters and performance matrix are leading to the adoption of new design methodology for SoC, which will incorporate highly scalable, reusable, predictable, cost and energy efficient platform not only for underlying communication backbone but also for the entire system architecture of NOC. Like the layered architecture for the communication backbone of NOC, we have proposed the entire system architecture for NOC to be a seven layered architecture in itself. Such a platform can separate the domain specific issues which will model concurrency along with the synchronization issues more effectively. For such a layered architecture, model of computation will provide a framework to that can model concurrency and synchronization issues which are natural for any application. Therefore it becomes extremely important to use a right computation model in a specific NOC region.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.10a
• /
• pp.384-389
• /
• 2005

The objective on this project is to develop a cooperative Field Robot (FR), by using a customize Open Control Platform (OCP) as design and development process. An OCP is a CORBA-based solution for networked control system, which facilitates the transitioning of control designs to embedded targets. In order to achieve the cooperation surveillance system, two FRs are distributed by navigation messages (GPS and sensor data) using CORBA event-channel communication, while graphical information from IR night vision camera is distributed using CORBA Asynchronous Method Invocation (AMI). The QoS features of AMI in the network are to provide the additional delivery method for distributing an IR camera Images will be evaluate in this experiment. In this paper also presents an empirical performance evaluation from the variable chunk sizes were compared with the number of clients and message latency, some of the measurement data's are summarized in the following paragraph. In the AMI buffers size measurement, when the chuck sizes were change, the message latency is significantly change according to it frame size. The smaller frame size between 256 bytes to 512 bytes is more efficient fur the message size below 2Mbytes, but it average performance in the large of message size a bigger frame size is more efficient. For the several destination, the same experiment using 512 bytes to 2 Mbytes frame with 2 to 5 destinations are presented. For the message size bigger than 2Mbytes, the AMI are still able to meet requirement far more than 5 clients simultaneously.

• Journal of Information Technology and Architecture
• /
• v.10 no.1
• /
• pp.101-111
• /
• 2013

Internet traffic volume has been increasing rapidly due to popularization of various smart devices and Internet development. In particular, HTTP-based traffic volume of smart devices is increasing rapidly in addition to desktop traffic volume. The increased mobile traffic can cause serious problems such as network overload, web security, and QoS. In order to solve these problems of the Internet overload and security, it is necessary to accurately detect applications. Traditionally, well-known port based method is utilized in traffic classification. However, this method shows low accuracy since P2P applications exploit a TCP/80 port, which is used for the HTTP protocol; to avoid firewall or IDS. Signature-based method is proposed to solve the lower accuracy problem. This method shows higher analysis rate but it has overhead of signature generation. Also, previous signature-based study only analyzes applications in HTTP protocol-level not application-level. That is, it is difficult to identify application name. Therefore, previous study only performs protocol-level analysis. In this paper, we propose a signature generation method to classify HTTP-based traffics in application-level using the characteristics of typical semi HTTP header. By applying our proposed method to campus network traffic, we validate feasibility of our method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7B
• /
• pp.481-488
• /
• 2005

As the demand on the multimedia application increases, the congestion control algorithm for the multimedia applications becomes an important research issue. The ultimate goal of congestion control is to adapt the trans-mission rate at the sender to the mont of network resource available on the forward path. In general, the congestion control algorithms use the round trip time(RTT) to estimate the network congestion on the forward path. however, since the RTT includes the delay on both forward and backward paths, it is possible for the algorithms using the RTT to make a wrong decision such as deciding the congestion on the forward path due to the congestion built on the backward path. In this paper, we enhance the performance of RRC-OTT(Receiver-based rate control with one-way Trip Time) algorithm, which uses the one-way trip time(OTT) to estimate the network congestion. By separating the estimation mechanism on the forward path from the backward path, the performance of RRC-OTT algorithm is hardly affected by the congestion built on the backward path.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4835-4855
• /
• 2015

TV white space (TVWS) is showing promise to become the first widespread practical application of cognitive technology. In fact, regulators worldwide are beginning to allow access to the TV band for secondary users, on the provision that they access the geolocation database. Device-to-device (D2D) can improve the spectrum efficiency, but large-scale D2D communications that underlie TVWS may generate undesirable interference to TV receivers and cause severe mutual interference. In this paper, we use an established geolocation database to investigate the power allocation problem, in order to maximize the total sum throughput of D2D links in TVWS while guaranteeing the quality-of-service (QoS) requirement for both D2D links and TV receivers. Firstly, we formulate an optimization problem based on the system model, which is nonconvex and intractable. Secondly, we use an effective approach to convert the original problem into a series of convex problems and we solve these problems using interior point methods that have polynomial computational complexity. Additionally, we propose an iterative algorithm based on the barrier method to locate the optimal solution. Simulation results show that the proposed algorithm has strong performance with high approximation accuracy for both small and large dimensional problems, and it is superior to both the active set algorithm and genetic algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.685-688
• /
• 2008

A Next Generation Network (NGN) is a packet-based network able to provide services including Telecommunication Services and able to make use of multiple broadband, QoS-enabled transport technologies and in which service-related functions are independent from underlying transport-related technologies. It offers unrestricted access by users to different service providers. It supports generalized mobility which will allow consistent and ubiquitous provision of services to users in this paper. we describe the trend of standardization activity related with open services environment capabilities which had been finally approved at September 2008 in ITU-T. ITU-T SG13 is responsible for studies relating to the architecture, evolution and convergence of next generation networks including frameworks and functional architectures, signalling requirements for NGN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.27-38
• /
• 2005

IP Multicast has not been deployed because of hardware problems. So a new scheme that is called Overlay Multicast for group communication has been emerged. It supports IP Multicast functions, which is located on application level. For developing it, we have been focused on efficient overlay tree construction among group members with low stretch and stress. However, we should consider a variety of transmission or receipt condition since a real internet environment has users with various transmission/receipt rates. Thus, we make one-time source specific tree depending on required bandwidth informationof group members when a member requests data transmission. Our mechanism provides satisfied data quality limited maximum transmission rate of the source to each group members. Furthermore, we manage a large group enough as distributing control information to cores that are designated membersfor maintaining host member information. Lastly, we prove that our tree guarantees data quality to each group members, and show low tree consruction time is required. In addition, for evaluating group scalability, we analyze control information increasing rate via group size, and validate its scalability.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.79-88
• /
• 2015

In this paper, we examine Ethernet based vehicle network which is recently emerging technology. Current MOST for entertainment will be soon replaced with the emerging Ethernet based vehicle network. Although legacy standard Ethernet has several advantages it is not suitable for vehicle backbone network without any modification. As a result, many researches are happening on extending and modification of the Ethernet function for realtime and reliability. Time-triggered Ethernet, one of many trials known as AS6802, is investigated on the architecture and functionalities. We design the traffic model on Time-triggered Ethernet and analyse the latency of the network. We also consider the QoS requirement and environment of operating configuration for vehicle network.

• Journal of Korea Game Society
• /
• v.16 no.4
• /
• pp.57-68
• /
• 2016

As the size of the data used in the game application increase gradually, the physical resources of game server grow. Accordingly, it is necessary to/it is required to introduce I/O virtualization in game server to improve I/O performance of the server. But it is difficult to ensure high responsiveness in game server where I/O delay change from time to time. To maximize the benefit of I/O virtualization, guaranteeing I/O response time is very important and it is necessary to have I/O scheduling techniques to manage the I/O latency in the order of priority of virtual machines. In this paper, we propose an efficient delay-constrained scheduling algorithm in a virtualization environment to ensure maximum I/O latency. In addition, a reduced amount of loss of the packet was found to increase the fairness of scheduling in the experiments with the proposed scheme.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.259-274
• /
• 2005

In this paper, we propose a methodology to estimate the number of users in e-Commerce systems. There have been a lot of previous work under the closed-LAN system environment. But the study on the number of acceptable users in real network environment is hard to find in the literature. Our research applies a Hybrid Simulation by using QoS results for end-to-end high-speed Internet service, and experiments are performed with regard to LAN and WAN, network equipments, and various network bandwidth. As result of the experiments we observed that the response time of high-speed Internet service media(Wireless LAN, ADSL, Cable, VDSL) depends heavily on the sequence and depth of transactions and on the ratio of transactional and non-transactional interactions. That is, as the network and application get more loads, the number of acceptable users decreases. By adding a cache server and an L4 switch to the simulation model, we analysed the changes in the number of users and client response time.