• Journal of Internet Computing and Services
• /
• v.16 no.1
• /
• pp.75-82
• /
• 2015

Major corporations and portals have implemented a link server that connects Content Management Systems (CMS) to the physical address of content in a database (DB) to support efficient content use in web-based environments. In particular, a link server automatically connects the physical address of content in a DB to the content URL shown through a web browser screen, and re-connects the URL and the physical address when either is modified. In recent years, the number of users of digital content over the web has increased significantly because of the advent of the Big Data environment, which has also increased the number of link validity checks that should be performed in a CMS and a link server. If the link validity check is performed through an existing URL-based sequential method instead of petabyte or even etabyte environments, the identification rate of dead links decreases because of the degradation of validity check performance; moreover, frequent link checks add a large amount of workload to the DB. Hence, this study is aimed at providing a link server that can recognize URL link deletion or addition through analysis on the B-tree-based Information Identifier count per interval based on a large amount of URLs in order to resolve the existing problems. Through this study, the dead link check that is faster and adds lower loads than the existing method can be performed.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.3
• /
• pp.29-38
• /
• 1998

This ppaer suggests a congestion control scheme for CL(ConnectionLess) overlay network using the feedback loops getween CL werver, between CL servers, and the header translation table of CL server. The CL overlay network for CBDS(Connectionless Broadband Data Service) defined by ITU0T(International Telecommunication Union-Telecommunication) consists of CL servers which route frames and links which connect between CL user and CL server or between CL servers. In this CL overlay network, two kinds of congestions, link congestion and CL server congestion, may occur. We suggest a scheme that can solve the congestion using ABR(Available Bit Rate) feedback control loop, the traffic control mechanism. This scheme is the link-by-link method suing the ABR feedback control loops between CL user and CL server or between CL servers, and the header translation table of CL server. As CL servers are always endpoints of ABR connections, the congestion staturs of the CL server can be informed to the traffic sources using RM(Resource Management) cell of the ABR feedback loops. Also CL server knows the trafffic sources making congestion by inspecting the source address field of CLNAP-PDUs(ConnectionLess Network Access Protocol - Protocol Data Units). Therefore this scheme can be implemeted easily using only both ABR feedback control loop of ATM layer and the congestion state table using the header translation table of CL server because it does not require separate feedback links for congestion control of CL servers.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.10
• /
• pp.42-51
• /
• 1998

This paper suggests a congestion control scheme for CL (ConnectionLess) overlay network using the feedback loops between CL user and CL server, between CL servers, and between end-to-end CL users, and the header translation table of CL server. The CL overlay network for CBDS(Connectionless Broadhand Data Service) defined by ITU-T((International Telecommunication Union-Telecommunication) consists of CL servers which route frames and links which connect between CL user and CL server or between CL servers. In the CL overlay network, two kinds of congestion, CL link congestion and CL server congestion, may occur. We considered the schemes to solve the congestion. link-by-link method[18] has used the ABR feedback loops of ATM layer between CL user and CL server or between CL servers, and the congestion table using header translation table of CL server. As in congestion of output virtual channel this method has an effect on all the traffic transmitting through the link, then it has an effect on the traffic that has not caused the congestion. As a result, the link utilization of output virtual channel that does not bring the congestion and outputs the traffic is decreased. To overcome this drawback of link-by-link, we proposed the hybrid method that are using the ABR feedback loops of link-by-link method, the feedback loop between CL users in end-to-end, the congestion table using and the header translation table. This scheme deals with teh congestion immediately by link-by-link loops and the header translation table, and then regulates the sending rate of CL user that causes the congestion by end-to-end loop.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.412-415
• /
• 1999

In this paper, we describe an implementation of the B-Link bus interface logic for a directory controller and a remote access cash controller in the SCI-based CC-NUMA multimedia server developed by ETRI . The CC-NUMA multimedia server is composed of a number of Pentium III SHV nodes and a SCI interconnection network. To communicate with remote nodes, each node has a CC-Agent which consists of a processor bus interface(PIF). a directory controller(DC), a remote access cash controller(RC), and two SCI 1ink controllers(LCs). The B-Link bus interface logic is developed for a directory controller and a remote access cash controller in order to communicate with a SCI link controller on a B-Link bus. It consists of a sending master controller a receiving slave controller, and asynchronous data buffers. And It performs a self-arbitration, a data packet transmission, a queue allocation, an early terminal ion. and a cut-through data path.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.8
• /
• pp.1018-1023
• /
• 2019

Since 2010, vehicle black boxes have become popular with many people, if there is no record of the vehicle accident scene, or if the offender deliberately deletes the image data, the victim succeeds. The biggest advantage of blockchain is that it is impossible to modify and delete data by data distribution storage. The biggest disadvantage is that sensitive data is also distributed. In this paper, we propose a blockchain method for the black box by using the advantage of shared block data and we intend to solve the problem of personal information leakage which is a disadvantage of blockchain by storing sensitive information stored in a blockchain in a private server by LINK blockchain with a private server. We also attached code(Github) and demonstration video(Youtube) linking LINK blockchain with the private server in this paper.

• Journal of IKEEE
• /
• v.2 no.1 s.2
• /
• pp.122-133
• /
• 1998

The CL network fer CBDS(Connectionless Broadband Data Service) defined by ITU-(International Telecommunication Union-Telecommunication) consists of CL(ConnectionLess) servers which route frames and links which connect between CL user and CL server or between CL servers[1][2]. In this configuration, two kinds of congestion, CL link congestion and CL server congestion may occur. Therefore this paper has proposed the scheme that can deal with the above congestion state of LAN traffic efficiently in interworking LANs in ATM network. Proposed schemes ale link-by-link scheme and hybrid scheme. Link-by-link scheme uses the ABR feedback loops of AIM layer between CL user and CL server or between CL servers, and the header translation table carrying out the routing function of frame. And hybrid scheme is the scheme that adds end-to-end loop to link-by-link scheme and then uses RM message using CLNAP-PDU(ConnectionLess Network Access Protocol - Protocol Data Units) of CL layer. These schemes can be implemented easily because of using the ABR loop of ATM layer, end-to-end loop of CL layer, and the routing function of CL server. In this paper the characteristic and effects of two schemes in CL server bas been compared and analyzed.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.247-253
• /
• 2008

Web 2.0 and Semantic Web technology will be merged to be a next generation Web that leads presentation-oriented Web to data-centric Web. In the next generation Web. semantic processing. Web Platform, and data fusion are most important technology factors. Resolving the Link Rot is the one of the essential technologies to enable these features. The Link Rot causes not only simple annoyances to users but also more serious problems including data integrity. loss of knowledge. breach of service. and so forth. We have suggested a new XRI-based persistent Web link architecture to cure the Link Rot that has been considered as a deep-seated Problem of the Web. The Proposed architecture is based on the XRI suggested by OASIS and it is designed to support a persistent link by using URL rewriting. Since the architecture is designed as a server-side technology, it is superior to existing research especially in Interoperability. Transparency and Adoptability. In addition to this, the architecture provides a metadata identification to be used fer context-aware link resolution.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.2
• /
• pp.645-655
• /
• 2008

As wireless connectivity is integrated into many handheld devices, streaming multimedia content among mobile ad-hoc peers is becoming a popular application. In this paper, we propose a dynamic service replication algorithm for providing guaranteed continuous streaming services to all nodes in mobile ad-hoc networks (MANETs). First, a MANET is comprised of logical grid hierarchy, and a streaming service is replicated to a lower server region of the logical grid hierarchy by considering the link availability between a mobile node and the streaming server within a server region or the popularity of the streaming service. We evaluate analytically the performance of the proposed algorithm, and compared with that of existing Qin's algorithm. Evaluation results show that our algorithm can achieve better streaming performance than Qin's algorithm. Therefore, the proposed algorithm not only improves the sharing availability of replicated streaming services but also controls efficiently the number of streaming service replications.

• The Journal of Information Technology
• /
• v.12 no.1
• /
• pp.15-20
• /
• 2009

In this paper, we aim that it solve to problem of the database hoarding because a week connectivity of wireless networks and cutting of link, Consistency of shared data, optimizing of the log include to Mobile Continuous Query Processing System under the mobile client and server environment. and we demonstrate of the superiority for the new Mobile Continuous Query Processing System compare C-I-S(Client-Intercept -Server)model with performance. and we perform to various experiment in order to establishment of superiority compare the index architecture and method for the realtime Continuous Query Processing. in this paper.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.5
• /
• pp.26-32
• /
• 2008

A pedestrian navigation system, an information delivery server, and a program for naturally guiding (such as speech-guiding) the user of a portable terminal at an intersection. An information delivery server comprises a map database containing data such as nodes including paths constituting intersections, links, and costs of the links. The node-link structure is the most important part in pedestrian navigation system. Functional requirements for the road map database vary in different navigation phases. though there are various road network models, their traditional node-link structures, unfortunately, do not solve the problem well. This paper proposes a node-link structure for pedestrian navigation system. The network topological structure in pedestrianl network is presented, which accords with the practical walking habit better than traditional way treating the entire road network.