• Journal of Environmental Science International
• /
• v.19 no.7
• /
• pp.871-877
• /
• 2010

The objectives of this study were to compare growth of Pllioblastus pygmaed and soil characteristics as affected by difference of soil thickness and mixture ratio in shallow-extensive green roof module system, and to identify the level of soil thickness and mixture as suitable growing condition to achieve the desired plants in green roof. Different soil thickness levels were achieved under 15cm and 25cm of shallow-extensive green roof module system that was made by woody materials for $500{\times}500{\times}300mm$. Soil mixture ratio were three types for perlit: peatmoss: leafmold=6:2:2(v/v/v, $P_6P_2L_2$), perlit: peatmoss: leafmold=5:3:2(v/v/v, $P_5P_3L_2$) and perlit: peatmoss: leafmold=4:4:2(v/v/v, $P_4P_4L_2$). On June 2006, Pllioblastus pygmaed were planted directly in a green roof module system in rows. All treatment were arranged in a randomized complete block design with three replication. The results are summarized below. In term of soil characteristics, Soil acidity and electric conductivity was measured in pH 6.0~6.6 and 0.12dS/m~0.19dS/m, respectively. Organic matter and exchangeable cations desorption fell in the order: $P_4P_4L_2$ > $P_5P_3L_2$ > $P_6P_2L_2$. $P_6P_2L_2$ had higher levels of the total solid phase and liquid phase, and $P_4P_4L_2$ had gas phase for three phases of soil in the 15cm and 25cm soil thickness. Although Pllioblastus pygmaed was possibled soil thickness 15cm, there was a trend towards increased soil thickness with increased leaf length, number of leaves and chlorophyll contents in 25cm. The growth response of Pllioblastus pygmaed had fine and sustain condition in order to $P_6P_2L_2$ = $P_5P_3L_2$ > $P_4P_4L_2$. However, The results of this study suggested that plants grown under $P_4P_4L_2$ appear a higher density ground covering than plants grown under $P_6P_2L_2$. Collectively, our data emphasize that soil thickness for growth of Pllioblastus pygmaed were greater than soil mixture ratio in shallow-extensive green roof module system.

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

Research about P2P system have recently a lot of attention in connection of form that pass early Centralized P2P and is Decentralized P2P. Specially, Structured P2P System of DHT base have a attention to scalability and systematic search and high search efficiency by routing. But, Structured P2P System of DHT base have problem, file can be located only their unique File IDs that although user may wish to search for files using a set descriptive keyword or do not have the exact File ID of the files. This paper propose extended-CAN mechanism that creates File ID of Contents base and use KID and CKD for commonness keyword processing to support keyword search in P2P System of DHT base.

• Journal of Intelligence and Information Systems
• /
• v.13 no.1
• /
• pp.59-79
• /
• 2007

P2P (Peer to Peer) techniques have been well applied to file sharing due to its cost-effectiveness and convenience. Dynamic network evolution is another good thing for P2P according to addition and deletion of nodes and change of files a node has. Our research proposes a P2P-based KMS (Knowledge Management System). Knowledge of enterprises spreads all over sub-organizations like oversea factories and sales departments and is changed in dynamic manner. P2P techniques are, therefore well matched with knowledge management domain. In order to increase search efficiency, we introduce social network theory into P2P-based KMS. Social network technique makes the most similar nodes (in KMS domain, nodes which has the most similar knowledge) its own neighbors, which makes eventually search efficiency increase. We developed our prototype system P2P-SN-KMS and evaluated by simulation.

• Journal of Internet Computing and Services
• /
• v.3 no.6
• /
• pp.25-33
• /
• 2002

The efficiency of the data share service of P2P method is decided by the maintaining guard method of a sharing list, This paper suggests the data sharing system of the P2P base that it should retain a shared data list at a client, The Server at a proposed system guards inclusively client. divided into several groups and at each individual group, a client appointed the TopHost uses the method guarding a free share list of a applicating group, The TopHost designs to execute it relating with server in case of the mergence and the division of a group as well as a maintaining management of a data share list, The efficiency of the suggested system regard the maintaining guard of groups formed of a client of the appropriate level of a kernel and exams examination to measure it through a really executed data share service.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.157-176
• /
• 2011

An interest-based P2P constructs the peer connections based on similarities for efficient search of resources. A clustering technique using peer similarities as data is an effective approach to group the most relevant peers. However, the separation of groups produced from clustering lowers the scalability of a P2P network. Moreover, the interest-based approach is only concerned with user-level grouping where topology-awareness on the physical network is not considered. This paper proposes an efficient scalable search for the interest-based P2P system. A scalable multi-ring (SMR) based on fuzzy clustering handles the grouping of relevant peers and the proposed scalable search utilizes the SMR for scalability of peer queries. In forming the multi-ring, a minimized route function is used to determine the shortest route to connect peers on the physical network. Performance evaluation showed that the SMR acquired an accurate peer grouping and improved the connectivity rate of the P2P network. Also, the proposed scalable search was efficient in finding more replicated files throughout the peer network compared to other traditional P2P approaches.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.705-715
• /
• 2005

A peer-to-peer web caching has been studied recently as it can reduce the traffic converged on the server side and can support the traditional web caching model. Although the peer-to-peer web caching has the merit of having additional cache space from the local caches of peers without additional infrastructure, several constraints such as dynamic participation and local caching strategy caused by the autonomy of peers in peer-to-peer networks nay limit the performance of the peer-to-peer web caching. To overcome these limitations, we propose an efficient directory-based peer-to-peer web caching system under dynamic participation of peers. In the proposed caching system, we present new peer selection and replica management schemes by introducing the concept of the object lifetime in P2P networks. We evaluate the effectiveness of the proposed system through trace-driven simulations with a web log dataset. Simulation results show that the proposed system has higher accuracy and fewer redirection failures than the conventional directory-based P2P web caching system in feasible peer-to-peer networks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.538-541
• /
• 2006

Recently researches of P2P media streaming have been actively published, but the research what kind of P2P overlay networks are better to delivering media data has not been attended. This paper designs a P2P streaming media system model. In this system, we constructs a Half-Structure P2P overlay protocol based on node's capability as the infrastructure of streaming application, which utilizes the heterogeneity of the nodes to maintain topology, presents a active contents diffusing algorithm and Two-stage search algorithm, make it possible for nodes in P2P system to collect information according their capacity and reduces the number of forwarding packet compared with flooding. Also, we give an optimal scheme to scheduling media data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12B
• /
• pp.758-766
• /
• 2007

IStreaming services with a client-server architecture have scalability problem because a server cannot accomodate clients more than its processing capability. This paper introduces a case study for implementing H.264 streaming system based on P2P architecture in order to provide scalable and stable broadcast streaming services over the internet. The prototype system called OmniCast264 consists of the H.264 encoding server, the streaming server, the proxy server, and peer nodes. The proxy server dynamically manages placement of the peer nodes on the P2P network. Omnicast264 has the concepts of distributed streaming loads, real-time playback, error-robustness and modularity. Thus, it can provide large-scale broadcast streaming services. Finally, we have built P2P streaming systems with 12 PCs connected serially or in parallel. The experiment shows that OmniCast264 can provide real-time playback.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.111-120
• /
• 2012

As the P2P System is a distributed system that shares resources of nodes that participate in the system, all the nodes serve as a role of server and client. Currently, although systematic, structured P2P systems such as Chord, Pastry, and Tapestry were suggested based on the distributed hash table, these systems are limited to $log_2N$ for performance efficiency. For this enhanced performance efficiency limited, the article herein suggests group routing algorithm. The suggested algorithm is a node-to-group routing algorithm which divides circular address space into groups and uses a concept of pointer representing each group, which is an algorithm where routing is performed based on pointer. To evaluate algorithm performance, a comparative analysis was conducted on average hops, routing table size, and delayed transmission for chord and routing, a signature algorithm in P2P systems. Therefore, enhanced performance is verified for comparative items from the simulation results.

• Journal of the Korea society of information convergence
• /
• v.1 no.1
• /
• pp.1-8
• /
• 2008

If the management through the center server is unnecessary and JXTA is connected to a network, a communication with any kind of devices or some device is possible. And features that a communication with heterogeneous P2P systems is possible have. The important module of the designed Data exchange system an interworking between the P2P system which it is made we used API and the each other different protocol the possible data for replacement Data exchange system were designed this kind of a feature was to the utmost utilized may account for the XML Parser Component(XPC) which we use it parses the or about a request and the generated request, and the structure of the XML Making Component(XMC) which we use in generating the inappropriate a request and response.