• Journal of the Korea Society of Computer and Information
• /
• v.13 no.3
• /
• pp.161-168
• /
• 2008

A standard Web server or web application servers require the Web Servlet container to execute SOAP messages. But it requires additional process to make web service modules and need communication port. Also, Recently many web applications is becoming increasingly demand against the dynamic document than the static documnet. But a recent study has found that Apache Web Server always does not show the better performance. The more it have the dynamic documents, rather it can show worse performance. To solve this problem, we propose a new High-Speed Message Processing System, in which the SOAP_MP and the WSDL builder are used. The WSDL builder convert HTML/XML to WSDL files automatically and the SOAP_MP minimize SOAP massage processing time by eliminating the Tomcat Servlet container in the mobile Web Services implementation. We compare and analyze the System, which was proposed by us, with the standard Web Service system.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.143-150
• /
• 2009

In trust-based networks, it is very important how to decide a node is trustworthy when one node performs communications with other node. In current networks based on trust, a node creates a new trust value from observation and then establishes an intercommunication path through the process of evaluating a targeted communication node. In our paper, we propose four trust models in which a new node enters a cluster and finds a target node to create a communication in ad-hoc networks. The proposed models have been classified according to the existence of reputation server and the trust evaluation functions. Through the proposed model, we found that new node finds target node more quickly in which there exists a reputation server in the cluster and considers neighbor node's recommendation as well as own experience information when calculates trust values. As our performance analysis, we focus the communication delay time to generate a final trust value for each trust model.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.699-709
• /
• 1999

This paper is aimed at defining items of analysis using SNMP MIB-II for the purpose of managing the Internet based network running on TCP/IP protocol, and then utilize these items, in conjunction with various Web technology and JAVA to design and implement a Web based interface of a management system to analyze the performance and status of the Internet. Among the required items in order to accomplish this task are utilization, interface packet transmission rate, I/O traffic ratio, and so on. Based on these items, the actual analysis is carried out by the Web interface according to the type of analysis. For instance, the interface executes the function of real-time analysis, collection processing, elementary analysis and detailed analysis. The demand of the user is fed into the Web interface which carried out a real-time analysis with the client system which in turn will eventually produce the results of the analysis. In order words, the interface acts as a mediator server for the analysis system. Furthermore, a protocol for exchange of data and messages between the server and the analysis system, the MATP protocol, was also designed. Finally, the results obtained through the system presented in this paper were displayed on screen according to the type of analysis. The system realized in this paper uses We technology and is independent of platform and allows the user to determine the performance of Internet at his/her own host according to the selected items of analysis.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.775-782
• /
• 2005

In this paper, we propose multicast technique in order to reduce the required network bandwidth by n times, by merging the adjacent multicasts depending on the number of HENs (Head-End-Nodes) n that request the same video. Allowing new clients to immediately join an existing multicast through patching improves the efficiency of the multicast and offers services without any initial latency. A client might have to download data through two channels simultaneously, one for multicast and the other for patching. The more the frequency of requesting the video is, the higher the probability of caching it among HENs increases. Therefore, the requests for the cached video data can be served by HENs. Multicast from server is generated when the playback time exceeds the amount of cached video data. Since the interval of multicast can be dynamically expanded according to the popularity of videos, it can be reduced the server's workload and the network bandwidth. We perform simulations to compare its performance with that of conventional multicast. From simulation results, we confirm that the Proposed multicast technique offers substantially better performance.

• Smart Media Journal
• /
• v.8 no.4
• /
• pp.46-52
• /
• 2019

The size of data generated and collected at industrial sites or in public institutions is growing rapidly. The existing data processing server often handles the increasing data by increasing the performance by scaling up. However, in the big data era, when the speed of data generation is exploding, there is a limit to data processing with a conventional server. To overcome such limitations, a distributed cluster computing system has been introduced that distributes data in a scale-out manner. However, because distributed cluster computing systems distribute data, inefficient use of network bandwidth can degrade the performance of the cluster as a whole. In this paper, we propose a scheme that compresses data when transmitting data in a Hadoop cluster considering network bandwidth. The proposed scheme considers the network bandwidth and the characteristics of the compression algorithm and selects the optimal compression transmission scheme before transmission. Experimental results show that the proposed scheme reduces data transfer time and size.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.223-231
• /
• 2003

Video-on-Demand (VOD) service needs high resource consumption because of high bandwidth and long playback duration which are characteristics of multimedia. Various techniques such as Patching and Channel-Reserving Patching have been proposed to reduce the demand on the network-I/O bandwidth. Patching allows new clients to join an existing multicast for realization of true VOD, and Channel-Reserving Patching reserves the part of total channel capacity of video server in order to serve the requests for popular videos on which requests of users concentrate. To improve the performance of Channel-Reserving Patching, we propose the method that determines the reserved channel capacity of video server for the popular videos in this paper. The performance of our method is evaluated in terms of average servile latency, defection ratio and fairness through simulation, and is compared with those of Patching and another Channel-Reserving Patching.

• KNOM Review
• /
• v.21 no.2
• /
• pp.26-34
• /
• 2018

With the proliferation of cloud computing and services, the internet traffic and the demand for better quality of service are increasing. For this reason, server virtualization and network virtualization technology, which uses the resources of internal servers in the data center more efficiently, is receiving increased attention. However, the existing hardware Test Access Port (TAP) equipment is unfit for deployment in the virtual datapaths configured for server virtualization. Virtual TAP (vTAP), which is a software version of the hardware TAP, overcomes this problem by duplicating packets in a virtual switch. However, implementation of vTAP in a virtual switch has a performance problem because it shares the computing resources of the host machines with virtual switch and other VMs. We propose a vTAP implementation technique based on the extended Berkeley Packet Filter (eBPF), which is a high-speed packet processing technology, and compare its performance with that of the existing vTAP.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.254-256
• /
• 2014

In this paper, using the Android App to remote database monitoring system is proposed. Existing remote database monitoring scheme CS(Client / Server) based. Conventional CS based systems are space constraints and a plurality of administrator to access the database at that degrade performance disadvantages. The advantage of the proposed system first, because the web -based interface allows the application program, and also the ease of maintenance, through a web browser, if you have Internet access anytime, anywhere environment without restrictions of time and space monitoring. Second, the proposed system because the App -based technology due to an increase in connection session and query execution does not affect the performance of your database. Third, if there is a problem with the remote database through which social networks immediately notify the administrator of the smartphone in real time so that the administrator can identify the problem.

• Convergence Security Journal
• /
• v.17 no.5
• /
• pp.3-10
• /
• 2017

Standard Protocol Optimized for Resource-Constrained IoT Environment Constrained Application Protocol (CoAP) supports web-based communication between a sensor node in the IoT environment and a client on the Internet. The CoAP is a Request / Response model that responds to the client's CoAP Request message by responding with a CoAP Response message from the server. CoAP recommends the use of CoAP-DTLS for message protection. However, validation of the use of DTLS in the IoT environment is underway. We analyze CoAP and DTLS security mode, evaluate performance of secure channel creation time, security channel creation step time, and RAM / ROM consumption through Cooja simulator and evaluate the possibility of real environment application.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.14 no.4
• /
• pp.300-306
• /
• 2021

Due to the development of IT technology, hardware technologies applied to IoT equipment have recently been developed, so smart systems using low-cost, high-performance RF and computing devices are being developed. However, in the infrastructure environment where a large amount of IoT devices are installed, big data collection causes a load on the collection server due to a bottleneck between the transmitted data. As a result, data transmitted to the data collection server causes packet loss and reduced data throughput. Therefore, there is a need for an efficient big data collection technique in an infrastructure environment where a large amount of IoT devices are installed. Therefore, in this paper, we propose an efficient big data collection technique in an infrastructure environment where a vast amount of IoT devices are installed. As a result of the performance evaluation, the packet loss and data throughput of the proposed technique are completed without loss of the transmitted file. In the future, the system needs to be implemented based on this design.