• Journal of Industrial Technology
• /
• v.15
• /
• pp.41-50
• /
• 1995

This paper presents a technique for estimating distribution of data stored in a database. This technique is very useful for accurate selectivity estimation, which is essential in query optimization and physical database design. To maintain data distribution, we employ the directory of the multilevel grid file, a multidimensional dynamic file organization. The major advantage of our technique is that data distribution information is maintained dynamically in the multilevel grid file. In contrast, other static methods such as the histogram method use static date structures, which requires periodic restructuring. Furthermore, we propose a method for keeping the abstract information of data distribution in main memory. This is advantageous in the situation where the size of main memory is not sufficient. Finally, We also suggest formulas for calculating selectivies of various queries based on our data distribution information.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.545-548
• /
• 2005

Recently, the computing environment of P2P come out to solve the excessive load of the server in the computing environment of the client/server. Currently, operated computing environment of P2P is mainly spreading out P2P system of read name or anonymity base about a publisher, sender and receiver of the file. But, to the current file protection there is three problem. The first problem is to a host become attack target. The second is to received file loose attack of Brute Force. The third is to define target of attack of DOS. To solve the this problem. it divide file into block unit. Each block is safely scattered peers. This paper propose the distribution P2P system of file division. Both proposing system solve the this problem and promote efficiency of file application.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.1
• /
• pp.65-72
• /
• 2007

This paper aims to provide information to generate a statistical load model of an educational server by analyzing workload of an e-Learning sewer at Dankook University. The result of the analysis shows file size distribution, access frequency and transmission volume for each file type, access interval, changes in preference and clients access rate by networks. In particular, it had different results from previous studies about video file's size distribution and file distribution based on access frequency. This is because the characteristics of e-learning are influenced by using authoring tools for making into video file and by freeing the number of students who register for a course. The result in this paper can be used as a basic data for studies designed to improve e-learning system architecture and server performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.183-189
• /
• 2018

This paper proposes distributed file placement and coverage expansion techniques for mitigating the traffic bottleneck in backhaul for small-cell networks. In order to minimize the backhaul load with limited memory space, the proposed scheme controls the coverage and file placement of base station according to file popularity distribution and memory space of base stations. In other words, since the cache hit ratio is low when there is small memory capacity or widespread file popularity distribution, the base stations expand its coverage and cache different set of files for the user located in overlapped area to exploit multiple cached file sets of base stations. Our simulation results show that the proposed scheme outperforms the conventional cache strategy in terms of network throughput when there is small memory capacity or widespread file popularity distribution.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.8
• /
• pp.1669-1675
• /
• 2005

Recently, the small sized wireless terminals have problems of processing of large sized file because of the trends of a small sized terminals and a large sized files. Moreover, the web servers or the file servers have problems of the overload because of the concentration with many number of files to the them. Also, There is a security vulnerability of the data processing caused by the processing with a unit of the independent file. To resolve the problems, this paper proposes a new scheme of fat splining distribution using the P2P networks with the mesh topology. The proposed scheme is to distribute blocks of file into any peer of P2P networks. It can do that the small sized wireless terminals can process the large size file, the overload problems of a web or file servers can solve because of the decentralized files, and, the security vulnerability of the data processing is mitigated because of the distributed processing with a unit of the blocks to the peers.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.22 no.4
• /
• pp.71-74
• /
• 1986

The author tried to clarify the distribution of the total length and body weight of the file h, Navodos modcstus, caught by trawl net during July, 1984 in the southern sea korea. Among the catches of five times fishing operation, 1540 individuals were randomly sampled for the measurement. The results are summarized as follows; " The distribution of total length showed bimodal type, wbich was able to analyzed into two normal distributions N(17.46, 1. 02^2) and N(22.09, 1. 77^2). And smaller group was much than older one. The age of the sample estimated from the total length distribution of. smaller group was 1. 5 to 2, and the larger group 2. 5 to 4. The relationship between the total length and the body weight can be presented as following equation: $$W=0.01726 L^{2.8507}$$ ' or $$W= 0.01109 L^{3.0}$$ or $$W= 0.01109 L^{3.0}$$.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.709-720
• /
• 2006

In this paper, we suggest a simple and efficient multiple-forwarder-based file distribution method which can work with a tree-based application layer multicast. Existing multiple-forwarder approaches require high control overhead. The proposed method exploits the assumption that receivers join a session at different times. In tree-based application layer multicast, a set of data packets is delivered from its parent after a receiver has joined but before the next receiver joins without overlapping that of other receivers. The proposed method selects forwarders from among the preceding receivers and the forwarder forwards data packets from the non-overlapping data packet set. Three variations of forwarder selection algorithms are proposed. The impact of the proposed algorithms is evaluated using numerical analysis. A performance evaluation using PlanetLab, a global area overlay testbed, shows that the proposed method enhances throughput while maintaining the data packet duplication ratio and control overhead significantly lower than the existing method, Bullet.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.7
• /
• pp.499-507
• /
• 2007

In the areas of CAE, CAD and CAO integration & automation technology, the word 'File Wrapping' means a virtualization of TEXT files that supports variables-based I/Os like variable assignments in programming languages. This File Wrapping process is one of the cornerstones of CAE, CAD and GAO integration & automation, and the performance of File Wrapping process, which is depending on the sire of a TEXT file to be accessed and the number of regions and their distribution, has a critical effect on the total performance of the CAE, CAD and CAO integration & automation systems. In this paper, we define TEXT File Region Management which generalizes the main functions of the File Wrapping process, and describe a prototype of TEXT file Region Management which is implemented as a Grid service. After that, the validity of the proposed model and the TEXT File Region Management service are discussed with evaluation results of the prototype.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.709-735
• /
• 2010

The reciprocal virtue of peer-to-peer networking has stimulated an explosion of peer population and service capacity, ensuring rapid content distribution in peer-to-peer networks. Critical issues such as peer churn, free riding, and skewed workload significantly affect performance results such as service agility, fairness, and resource utilization. To resolve these problems systematically, this study proposes a peer assignment scheme that supports fair peer-to-peer file sharing applications. The proposed scheme exploits the peer duality of both server-oriented peer capacity and client-oriented peer contribution. Accordingly, the system server can prioritize download requests and appropriately assign server peers to uploading file objects. Several functional extensions, including peer substitution and elimination, bandwidth adjustment, and distributed modification, help cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results show this design is examined under both centralized and distributed peer-to-peer environments. Performance results confirm that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.259-273
• /
• 2009

Most of large-scale distributed file systems decouple a metadata operation from read and write operations for a file. In the distributed file systems, a certain server named a metadata server (MDS) maintains metadata information in file system such as access information for a file, the position of a file in the repository, the namespace of the file system, and so on. But, the existing systems used restrictive metadata management schemes, because most of the distributed file systems designed to focus on the distributed management and the input/output performance of data rather than the metadata. Therefore, in the existing systems, the metadata throughput and expandability of the metadata server are limited. In this paper, we propose a new non-shared metadata management scheme in order to provide the high metadata throughput and scalability for a cluster of MDSs. First, we derive a dictionary partitioning scheme as a new metadata distribution technique. Then, we present a load balancing technique based on the distribution technique. It is shown through various experiments that our scheme outperforms existing metadata management schemes in terms of scalability and load balancing.