• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.277-286
• /
• 2000

Switch-based network is suitable for the environment of demanding high performance network. Traditional shared-medium Local Area Networks(LANs) do not provide sufficient throughput and latency. Specially, communication performance is more important with multimedia application. In these environments, switch-based network results in high performance. A kind of switch-based network provides higher bandwidth and low latency. Thus high-speed switch is essential to build switch-based LANs. An effective switch design is the most important factor of the switch-based network performance, and is required for the multicast message processing. In the previous cut-through switching technique, switch element reconfiguration has the capability of multicasting and deadlock-free. However, it has problems of low throughput as well as large scale of switch. Therfore, effective multicating can be implemented by using divided hardware unicast and multicast. The objective of this thesis is to suggest switch configuration with these features.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.3
• /
• pp.475-482
• /
• 2001

In this paper, I describe the implementation of the distributed lists based on socket and on RMI(Remote Method Invocation). First, I describe and implement an interface of distributed list based on socket using object stream in a distributed environment, when encapsulating the message in the distributed list. Second, the major purpose to implement a distributed list in RMI is to compare advantages and disadvantages with other networking mechanisms by implementing complicated applications. The major advantage in using RMI is to implement simply the programs without using application-level protocol. In terms of program efficiency, the applications using HMI can degrade the performance due to many TCP/IP connections generated every update. TCP/IP connection requires much less cost than RMI. Even though RMI has the mechanism processing many method calls using a sing]e network connection, RMI is less efficient than the direct use of socket. However, RMI makes it possible to communicate beyond firewall using HTTP proxying mechanism. Consequently, I present a modeling of networking mechanism in finding out optimization solution by comparing and analyzing the two systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.7
• /
• pp.1407-1411
• /
• 2005

Tn these server oriented network forms, users allowed to approach the a certain server only in slave and passive way, and are limited in sharing informations, and internet choose from a method of traditional centralized web server until now, so we pay a lot of money and have a problem of maintenance management. The P2P is the new solution of these limitations, but there is no verification about the possibility and validity of p2p as the business model. This parer offering to some solution for those problems using the JXTA technique and P2P compution. We will apply the JXTA platform that wireless environment as mobile environment. The JXTA technique can be interoperability between third-party. This paper is implementation of P2P communication system on mobile environment. It's implementation used by JXTA technique, J2ME and XML.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.543-548
• /
• 2016

Public electronic certificates, as an important means for identification, have been used as the main economic transactions, including banking, e-government, e-commerce. identification. However, damage cases of certificates have been increased by Illegally issued and by hacking practices. Also the users have a difficult in ensuring that their certificates when and where to use. Therefore, the proposed system gives the organization code for the Institutions using OCSP services in advance, the organization code embedded in extensions of OCSP request message structure when institutions ask the validation of certificate to CA(Certificate Authority). Also, OCSP server can extract the organization code from OCSP request message, confirm the institution, and record it in certificate history management table of DB. In this paper, we presented a system that could determine the certificate history check using OCSP service, public electronic certificate validation service, and implemented to prevent and cope immediately with financial incidents.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.360-363
• /
• 2007

In sensor network, the importance of transporting data with reliability is growing gradually to support communications. Data flow from sink to nodes needs reliability for the control or management, that is very sensitive and intolerable, however relatively, data flow from nodes to sink is tolerable. In this paper, with emphasis of the data flow from sink to nodes, we proposed the mechanism that establishes confidence interval for transport. Establishing confidence interval hop-by-hop, not end to end, if errors happen or there's missing data, this mechanism recovers them with selective acknowledgement using fixed window. In addition, this mechanism supports traffic congestion control depending on the buffer condition. Through the simulation, we showed that this mechanism has an excellent performance for error recovery in sensor network.

• The KIPS Transactions:PartC
• /
• v.13C no.6 s.109
• /
• pp.785-794
• /
• 2006

Nowadays, Internet is used worldwide and network traffic is increasing dramatically. Much of Internet traffic is due to the web applications. And I propose a new cooperative web caching scheme, called DCOORD which tries to minimize the overall cost of Web caching. DCOORD reduces the communication cost by coordinating the objects which are cached at each cache server. In this paper, I compare the Performance of DCOORD with two well-known cooperative Web caching schemes, ICP and CARP, using trace driven simulation. In order to reflect the cost factor in the network communication, I used the CSR(Cost-Saving Ratio) as our performance metric, instead of the traditional hit ratio. The performance evaluations show that DCOORD is more cost effective than ICP and CARP.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.225-233
• /
• 1999

One of the reasons that debugging distributed programs is much more difficult than sequential programs is the communication among processes. Even though there are many debuggers constructed on distributed system environment, no available debugger provides an efficient way to debug communication events.. In this paper, we show the way to debug RPC communication, which is regarded as one of the most popular communication protocol in distributed system development. This paper presents the implementation of the RPC event trace function based on the RPC event model, which is proposed to accommodate communication events into debugging objects. Analyzing conventional RPC protocols, we formalized library function calls as corresponding actions to sending and receiving of messages. B recognizing the locations of library calls the debugger can detect all occurrences of communication events, This RPC event trace function is implemented on the on-line distributed debugger UniVIEW system.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1297-1307
• /
• 1997

This paper presents a multimedia mail system which transmit and redeive multimedia mailing messges on Intemet.This mail system is an extension of the exsting e-mail system for multimedia uncluding,text,image,MPEG video,and binary data,The MIME(Multipurpose Intert Mail Extensions)format,which is an extension of REF-822 maill format,is used to reprssent multimedia,and SMTP(Simple Mail Transfer Protocol)is utilized as a mail transport prttocol.The IMAP(Intenet Mail Access Protcol)which privides more functions than the widely used POP(Post Office Protocol)is used as a mailbox retrival protocol.The mail client is complemented on a multimedia PC while the server is implemented on a UNIX system.In the mail system, a mail sending program allows a user to attach binary files such as Postscript files and MPEG compressed video,while a receiving program provides direct interface to application programs to play back received multimedia mail messages.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.2
• /
• pp.217-221
• /
• 2010

As the appearances of various new mobile devices and the explosive growth of mobile device users, many researches related to mobile P2P systems have been proceeded actively. In this paper, we propose a new search algorithm for the double-layered super peer system in the mobile environment. For the proposed search algorithm, we divide the entire experiment region into a grid of cells, each of which has the same size. The grid is configured properly by considering the communication range of a mobile device and the number of peers in the system. The proposed search algorithm is a partial flooding search method based on the directions of cells involved with the search. It reduces successfully the network traffic, but shows a low search hit ratio. To enhance the search hit ratio, we introduce a bridge-peer table for a super peer and utilize an n-way search. The experimental results show that the proposed algorithm made an average of 20~30% reduction in the number of message packets over the double-layered system. The success ratio was also improved about 2~5% over the double-layered system.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.6
• /
• pp.1390-1403
• /
• 1998

Database sharing system (DSS) refers to a system for high performance transaction processing. In DSS, the processing nodes are locally coupled via a high speed network and share a common database at the disk level. Each node has a local memory, a separate copy of operating system, and a DB'\fS. To reduce the number of disk accesses, the node caches database pages in its local memory buffer. However, since multiple nodes may be simultaneously cached a page, cache consistency must be cnsured so that every node can always access the'latest version of pages. In this paper, we propose efficient cache consistency schemes in DSS, where the database is logically partitioned using primary copy authority to reduce locking overhead, The proposed schemes can improve performance by reducing the disk access overhead and the message overhead due to maintaining cache consistency, Furthermore, they can show good performance when database workloads are varied dynamically.