• Title/Summary/Keyword: interest-based P2P

Search Result 258, Processing Time 0.03 seconds

Scalable Search based on Fuzzy Clustering for Interest-based P2P Networks

  • Mateo, Romeo Mark A.;Lee, Jae-Wan
    • 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.

Interest Based Clustering Mechanism for Hybrid P2P (하이브리드 P2P를 위한 관심분야 기반 클러스터링)

  • Lee, Lee-Sub
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.1
    • /
    • pp.69-75
    • /
    • 2006
  • P2P services occupy more then 50% of the internet traffics. A huge number of query packets are generated since pure P2P based models rely on message flooding for their query mechanisms. In this study, the numbers of query messages generated in the pure P2P and hybrid P2P model are analyzed. The results show that hybrid P2P models also could suffer from message flooding. To reduce the message flooding, this study proposes an interest based clustering mechanism for hybrid P2P services. By applying this clustering algorithm, it could reduce 99.998% of the message flooding. The proposed algorithm also reduces the cost of the joining operations by storing previous supernodes.

  • PDF

Management Techniques of Interest Area Utilizing Subregions in MMORPG based on Cloud and P2P Architecture (클라우드와 P2P 구조 기반의 MMORPG에서 소영역을 활용하는 관심 구역의 관리 기법)

  • Jin-Hwan Kim
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.3
    • /
    • pp.99-106
    • /
    • 2023
  • In this paper, we propose subregion-based area of interest management techniques for MMORPG(massively multiplayer online role playing games) integrating P2P(peer-to-peer) networking and cloud computing. For the crowded region, the proposed techniques partition it into several subregions and assign a player to manage each subregion as a coordinator. These techniques include a load balancing mechanism which regulates communication and computation overhead of such player below the specified threshold. We also provide a mechanism for satisfying the criterion, where subregions overlapped with each player's view must be switched quickly and seamlessly as the view moves around in the game world. In the proposed techniques where an efficient provisioning of resources is realized, they relieve a lot of computational power and network traffic, the load on the servers in the cloud by exploiting the capacity of the players effectively. Simulation results show that the MMORPG based on cloud and P2P architecture can reduce the considerable bandwidth at the server compared to the client server architecture as the available resources grow with the number of players in crowding or hotspots.

An Approach for P2P Overlay Network to Provide Interest-based Media Content Discovery in the Digital Home Community (디지털 홈 커뮤니티 환경에서 사용자 관심 기반 미디어 콘텐츠 검색을 위한 P2P 오버레이 네트워크 구성)

  • Lee, Hyun-Ryong;Kim, Jong-Won
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.514-516
    • /
    • 2005
  • 국내외적으로 흠 네트워크의 보급이 활발히 이루어지고 있으며, 이러한 홈 네트워크는 현재의 데이터 네트워크 및 제어 네트워크 중심에서 향후 다수의 미디어 콘텐츠를 보유하는 A/V 흠 네트워크로 발전될 전망이다. 이런 환경 하에서 사용자들은 현재 P2P 파일 공유 시스템에서 이루어지는 것처럼 자신들의 관심에 기초하여 다른 홈 네트워크에 있는 미디어 콘텐츠들을 공유할 것으로 보인다. 본 논문에서는 이처럼 예상되는 사용자들의 요구를 효율적으로 지원하기 위하여 사용자들의 관심 사항을 효과적으로 반영하며 보장된 응답시간 내에 미디어 콘텐츠 검색을 제공하기 위한 P2P 오버레이 네트워크 구성 방안인 IGN (Interest-based Grouping Network)을 제시한다. Chord와 드브루인 (do Bruijn) 그래프로 구성되는 IGN은 structured P2P의 세밀한 검색 지원에 대한 한계와 unstructured P2P의 보장되지 않은 최대 검색 시간의 문제점을 해결하며, 보장된 최대 검색 시간 내에 사용자들의 관심 사항을 세일하게 반영하는 검색을 지원할 것으로 예상된다.

  • PDF

The Effect of Cooperative Learning method in Home Economics on students′Interest and Attitude about Subject matter (가정과 수업의 협동학습이 학생의 교과에 대한 흥미와 태도에 미치는 영향)

  • 양정혜;신상옥
    • Journal of Korean Home Economics Education Association
    • /
    • v.10 no.1
    • /
    • pp.137-151
    • /
    • 1998
  • The purpose of this study is (1)to develop the teaching plan based on Cooperative Learning approach and (2)to investigate the effect of students'Interest on Subject matter and Teaching method and Attitudes to others of the area of Foreign food in Home Economics class. Among those various types of Cooperative Learning's models, this study adopted 'Learning Together'developed by Johnsons. To investigate these purpose, subject matter were analyzed and reconstructed for Cooperative Learning. The tests were developed to evaluate the interest on the Subject matter and teaching methods, and the attitude to others of the students. 108 femail high school students were divided into two groups with 54 students-traditional learning condition, Cooperative Learning condition-and had a 5 session. The subject of the class was Foreign food including Western, Chinese, and Japanes food. Before and after the class, students were tested. The statistical methods used for the study methods used for the study were t-test. The research findings are as follows : When the students in the Cooperative Learning classes were compared before and after the test, (1)Interest on Subject matter were improved considerably(p〈.001) (2)Interest on Teaching methods were improved considerably(p〈.05) (3)Attitude to Others were improved considerably(p〈.001) Therefore when the teaching-learning model based on Cooperative Liarning was used in Home Economics class, their interest on the subject and teaching methods and attitude to others were improved.

  • PDF

The Relationship between Political, Economic, Sociocultural Interest and Intention of maintaining the Nursing Job of the MZ Generation Nursing Students (MZ세대 간호대학생의 정치·경제·사회문화적 관심과 간호직 유지의도와의 관계)

  • Ok-Hee, Koo
    • Journal of Industrial Convergence
    • /
    • v.21 no.2
    • /
    • pp.33-42
    • /
    • 2023
  • This study was conducted to investigate the relationship between political interest, economic interest, sociocultural interest and intention of maintaining the nursing job against 291 nursing students from a university in C city from August to September 2022. The collected data were analyzed by t-test, ANOVA, and Pearson's correlations. The study showed political interest 3.35(maximum 5 points), economic interest 3.76(maximum 5 points), sociocultural interest 4.15(maximum 5 points), and intention of maintaining the nursing job were 3.40(maximum 5 points). In the correlation between variables, the correlation coefficient between political interest and sociocultural skill(r=.385, p<.01) was high, and economic interest and overall sociocultural interest were the most correlated(r=.534, p<.01). For the correlation with intention of maintaining the nursing job, sociocultural behavioral intention(r=.158, p<.01) and attitude(r=.131, p<.01) were statistically significant. Based on the results, repeated studies including political, economic, and sociocultural interest as variables influencing intention of maintaining the nursing job and future research on systematic and diverse educational programs including sociocultural attitudes and behavioral intention are suggested so the nursing job can be maintained for longer time as a profession.

Dynamic AOI Management for P2P MMOGs (P2P MMOGs에 대한 동적 AOI 관리기법)

  • Lim, Chae-Gyun;Rho, Kyung-Taeg
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.6
    • /
    • pp.269-273
    • /
    • 2010
  • Massively Multiplayer Online Game (MMOG) is one of diverse applications where more than hundreds of users enjoy experiencing virtual worlds. Voronoi-based Overlay Network (VON) is proposed to reduce a bandwidth consumption in P2P MMOGs and Vorocast also is made using message forwarding in VON. We propose a dynamic area of interest (AOI) management method that solves problems such as less consistency and high latency due to sending position updates to more neighbor nodes from the message originator in forwarding scheme. Our scheme provides the higher consistency and reduces latency by combining direct connection scheme and Vorocast scheme compared to existing schemes. The proposed model is evaluated through simulations.

A P2P-based Management Method for Dynamic AOI (동적 AOI를 위한 P2P 기반 관리기법)

  • Lim, Chae-Gyun;Rho, Kyung-Taeg
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.5
    • /
    • pp.211-216
    • /
    • 2011
  • Networked virtual environments (NVEs) are distributed systems where geographically dispersed users interact with each other in virtual worlds by exchanging network messages. Massively Multiplayer Online Game (MMOG) is one of diverse applications where more than hundreds of users enjoy experiencing virtual worlds. A limited area called area of interest (AOI) in MMOG is reduced the load caused by message exchange between users. Voronoi-based Overlay Network (VON) is proposed to reduce the bandwidth consumption in P2P environments and Vorocast also is made using message forwarding in VON. We propose a dynamic AOI management method that solves problems such as a consistency and latency due to forwarding position updates to neighbor nodes from the message originator in forwarding scheme. Our scheme provides the consistency and reduces latency by combining direct connection scheme and Vorocast scheme compared to existing schemes. The communication between a user and users existing in center circle within AOI of the user is directly connected and the communication between the user and users existing outside the center area within AOI is using Vorocast scheme. The proposed model is evaluated through simulations.

An Exploratory Analysis on Performance Measurement Framework of Organizational Communities of Practice (기업 실행공동체(Communities of Practice) 성과측정체계의 탐색적 분석)

  • Choi, In-Myung;Jeon, Su Hwan;Kim, Young Gul
    • Knowledge Management Research
    • /
    • v.8 no.2
    • /
    • pp.17-30
    • /
    • 2007
  • Firm which implement knowledge management initiatives have found interest in nurturing voluntary knowledge sharing organizations, called communities of practice(CoP). One of the fundamental problems for adopting or implementing CoP is how the firms can measure the performance of CoP. Despite interest in CoP by firms, empirical studies on CoP performance measurement are rare. Thus, this study intends to help the organizations by introducing CoP performance measurement framework based on the previous researches. The framework is further validated by comparing with the eight actual cases. Finally, we propose three propositions regarding the CoP performance measurement.

  • PDF

Globally Optimal Recommender Group Formation and Maintenance Algorithm using the Fitness Function (적합도 함수를 이용한 최적의 추천자 그룹 생성 및 유지 알고리즘)

  • Kim, Yong-Ku;Lee, Min-Ho;Park, Soo-Hong;Hwang, Cheol-Ju
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.1
    • /
    • pp.50-56
    • /
    • 2009
  • This paper proposes a new algorithm of clustering similar nodes defined as nodes having similar characteristic values in pure P2P environment. To compare similarity between nodes, we introduce a fitness function whose return value depends only on the two nodes' characteristic values. The higher the return value is, the more similar the two nodes are. We propose a GORGFM algorithm newly in conjunction with the fitness function to recommend and exchange nodes' characteristic values for an interest group formation and maintenance. With the GORGFM algorithm, the interest groups are formed dynamically based on the similarity of users, and all nodes will highly satisfy with the information recommended and received from nodes of the interest group. To evaluate of performance of the GORGFM algorithm, we simulated a matching rate by the total number of nodes of network and the number of iterations of the algorithm to find similar nodes accurately. The result shows that the matching rate is highly accurate. The GORGFM algorithm proposed in this paper is highly flexible to be applied for any searching system on the web.