• IE interfaces
• /
• v.4 no.2
• /
• pp.35-42
• /
• 1991

Many authors derived MTTF/MTBF for an operating system by analyzing its actual life time data. However, it is difficult to derive MTTF/MTBF when few breakdowns accur throughout a year. In this paper, we address a new approach to solve that problem under a preventive maintenance policy, in which few breakdowns occur, and also introduce a case study using the results obtained.

• Electronics and Telecommunications Trends
• /
• v.37 no.5
• /
• pp.54-61
• /
• 2022

Data are an essential resource for artificial intelligence-based services. It is considered a vital resource in the 4th industrial revolution era based on artificial intelligence. However, it is well-known that only a few giant platforms that provide most of the current online services tend to monopolize personal data. Therefore, some governments have started enforcing personal data protection and mobility regulations to address this problem. Additionally, there are some notable activities from a technical perspective, and Web 3.0 is one of these. Web 3.0 focuses on distributed architecture to protect people's data sovereignty. An important technical challenge of Web 3.0 is how to facilitate the personal data storage technology to provide valuable data for new data-based services while providing data for producers' sovereignty. This study reviews some currently proposed personal data storage technologies. Furthermore, we discuss the domestic countermeasures from MyData perspective, which is a typical project for data-based businesses in Korea.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.213-216
• /
• 2000

In this paper, we propose a new scheme which improves the IP address lookup time. The new scheme is composed of two core technologies, named the prefix alignment and the prefix distance ordering. Now, as the Internet is being used commonly by improving the data transmission capacity, the need for enlarging the bandwidth of the Internet is on the rise. IP address lookup performance problem is an important obstacle in the router executing high speed packet forwarding. This results from the fact that the prefixes routing table is composed of and the traffic being processed in unit time are largely on the increase. The proposed lookup scheme is divided into two parts in technology, the one is the algorithm forming a routing database(routing table), the other is the lookup procedure in the actual packet processing.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.4
• /
• pp.60-68
• /
• 1998

In this paper, content addressable momory(CAM) using neural network algorithm is proposed to decrease cell loss and process the large amount of data in streaming mode connectionless server at high speed. To overcome problems of area and power dissipation in look-up table using conventional CAM, the proposed neural network CAM is designed to increase linearly address storage bit about increase of address input bit. Its design and imulation is performed by using VHDL and Compass Tool. Also, its layout is performed by using chip compiler, cell-base P&R tool of compass, in 0.8 .mu.m design rule environment.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1193-1196
• /
• 2005

In this paper, we presents a new multimedia service transmit method using IPv6. The IPv6 provides the address system of 128 bit and the address space which is infinite it provides. But it will not become the IPv4 and interchange not to be, it uses the DSTM Transition mechanism which will reach and the IPv4 center in the packet header the service type it will be able to support the service class of multi type (TOS) it secures the weak point of data transfer delay it puts a base in the IPv6. The efficiency of this proposed technique have been proven by MPEG-4 streaming video streaming of the IPv6 namely, 6Xtream embodied a order form/live streaming server and the client which it uses to be possible in base and real-time decoding method.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1858-1867
• /
• 1996

This paper describes a platform for video conferencing on Information Super Highway. In this paper we de-sign a Multi-Multicast Server(MCS) and the platform. The platform uses Multi-MultiCast Server for multitasking IP Multicast data on IP over ATM. Based on Multicast Address Resolution Server (AMRS) which was proposed in this paper the platform maps from D class IP addresses to ATM addresses. MARS handles a recovery in case of MCS down. This paper also presents a solving mechanism for handling botteneck by using the MCS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.2
• /
• pp.145-154
• /
• 1991

In this dissertation, the same reading and writing operation of general SRAM, the algonthm and hardware of 8 bit $\times$16 word CAM(Content Addressable Memory) which carry out the parallel that search is presented. The designed CAM chip consists of five functional blocks (CAM cell array, Address Deceden, Address Encoden. Data Selector, Sense Amplifier). The smulation is performed using logic smmulator on Apollo workstation and PSPICE eitcut simulation on PC/AT. The designed CAM was fabricated by 3um CMOS N Well process (ETRI) design nitles and testing was performed.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.81-83
• /
• 2006

This Paper suggests efficient design method which is used by Bit_Inerleaver in the IEEE 802.15,3.a. Bit_Interleaver is consist of Symbol_Interleaver and Tone_Interleaver Each Interleaver is designed by using memory. In other to resolve burst error, Block Interleaver is using different leading and writing address for mixing the data. However This method has a different reading and writing memory address to realize Block Interleaver so this schematic is some complex. This Paper suggests efficient and simple Bit_Interleaver Method which classify the memory of Bit_Interleavr to reduce complexity of shcemeatic.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2840-2853
• /
• 2015

A major challenge in network service providers is to provide adequate resources in service level agreements based on forecasts of future demands. In this paper, we address the problem of capacity provisioning in a network subject to demand uncertainty such that a network coded multicast is applied as the data delivery mechanism with limited budget to purchase extra capacity. We address some particular type of uncertainty sets that obtain a tractable constrained capacity provisioning problem. For this reason, we first formulate a mathematical model for the problem under uncertain demand. Then, a robust optimization model is proposed for the problem to optimize the worst-case system performance. The robustness and effectiveness of the developed model are demonstrated by numerical results. The robust solution achieves more than 10% reduction and is better than the deterministic solution in the worst case.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.394-396
• /
• 2000

Currently, lots of research s going on in the field of the load distribution within HTTP. RR-DNS and SWEB are the most representative load distribution research. But, there are still many problems: unbalancing of load, load increase of web server and cost increase. Also, clients that require lots of data like multimedia happens to increase network load. To solve these, research about client/agent/server architecture is going on. But, the clients must know the agent's address and there are complexity and migration problems for design of such as protocol. This paper proposes TBSMS that is capable of choosing the optimal server considering the service capacity of the server as well as the network load. This paper demonstrates that TBSMS uses the web to solve the problem that client must know the agent's address and uses SNMP to solve the complexity and migration problem.