• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5455-5475
• /
• 2016

In this article, we model the distributed relay assignment network as a many-to-one matching market with peer effects. We discuss two scenarios for throughput optimization of relay networks: the scenario of aggregate throughput optimization and the scenario of fairness performance optimization. For the first scenario, we propose a Mutual Benefit-based Deferred Acceptance (MBDA) algorithm to increase the aggregate network throughput. For the second scenario, instead of using the alternative matching scheme, a non-substitution matching algorithm (NSA) is designed to solve the fairness problem. The NSA improves the fairness performance. We prove that both two algorithms converge to a globally stable matching, and discuss the practical implementation. Simulation results show that the performance of MBDA algorithm outperforms existing schemes and is almost the same with the optimal solution in terms of aggregate throughput. Meanwhile, the proposed NSA improves fairness as the scale of the relay network expands.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.268-281
• /
• 2008

It is difficult to construct streaming services based on the overlay networks without any loss of scalability. DONet is one of the most representative streaming overlay network protocols without managing any specific structure. Since DONet does not support the nodes on private networks, it can be considered that the performance of the overlay is not the best. Hole Punching is one of the famous techniques participating the nodes on private networks to streaming overlay networks by using a rendezvous server. However, using only a single rendezvous server cannot be suggested in P2P environment, because it can cause problems in terms of scalability and so on. In this paper, we propose DONet-p, an extension of DONet with Distributed Hole Punching techniques. It supports the nodes on private networks without toss of scalability. The experimental results show the better performance and scalability than DONet with a minimum overhead for additional control messages.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2285-2301
• /
• 2012

Peer-to-Peer (P2P) networks are becoming more and more popular in video content delivery services, such as Video on Demand (VoD). Scalability feature of P2P allows a higher number of simultaneous users at a given server load and bandwidth to use stream service. However, the quality of service (QoS) in these networks is difficult to be guaranteed because of the free-riding problem that nodes download the recourses while never uploading recourses, which degrades the performance of P2P VoD networks. In this paper, a distributed trust model is designed to reduce node's free-riding phenomenon in P2P VoD networks. In this model, the P2P network is abstracted to be a super node hierarchical structure to monitor the reputation of nodes. In order to calculate the reputation of nodes, the Hidden Markov Model (HMM) is introduced in this paper. Besides, a distinction algorithm is proposed to distinguish the free-riders and malicious nodes. The free-riders are the nodes which have a low frequency to free-ride. And the malicious nodes have a high frequency to free-ride. The distinction algorithm takes different measures to response to the request of these two kinds of free-riders. The simulation results demonstrate that this proposed trust model can improve QoS effectively in P2P VoD networks.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.271-273
• /
• 2006

초기의 비구조적인 피어-투-피어 방식은 플러딩(flooding) 방식의 검색 기법을 사용하는데, 이 기법은 통신비용이 매우 많이 소요되어 비효율적이다. 따라서 효율적인 검색 기법으로 임의 경로(random walk) 검색 방식이 제안되었다. 이 검색 기법은 메시지가 임의로 노드를 이동하기 때문에, 검색의 성공률이 낮다. 이를 보완하기 위하여 효율적인 복제기법이 요구된다. 현재 나와 있는 복제 기법은 여러 방법이 있으나, 모두 통신에 고비용을 요구한다. 따라서 복제 기법에서는 통신비용을 최소화하는 효율적인 복제 기법이 필요하다. 본 논문에서는 캐시를 사용하여 직접적인 데이터 통신비용을 최대로 줄이는 한편, 복제를 질의가 많이 도착하는 곳에 위치시켜 검색률의 저하를 막고, 잘못된 캐시 관리 기법을 통해 동적인 환경에서도 잘못된 캐시로 인한 검색의 실패를 최소할 수 있는 기법을 제안한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.797-799
• /
• 2012

The cognitive radio (CR) network has been studied in the form of open source by vast number of communities, and the potential expectation is very high since the CR is based on reprogrammable platform. However, as the peer-to-peer software has been abused, so high is the chance that the CR network can be abused public wide. Consequently, the benefit from the study of next-generation wireless network can be at risk because law breakers could abuse the CR. In this contribution, we analyze the issues and the problems of the CR and discuss an efficient measure against security attacks.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.217-219
• /
• 2003

무선 인터넷 서비스 사용자의 증가 및 초고속 멀티미디어의 출현으로 셀룰러 망(Cellular Network)의 부하가 증가하고 대역폭의 부족 현상을 초래하게 되었다. 셀룰러 망에서 모든 단말기들은 기지국(Base Station)을 통해서만 데이터 전송을 할 수 있어 기지국과 단말들 간에 셀룰러 대역폭 사용의 증가를 초래 할 수 있다. 본 논문에서는 이러한 셀룰러 망의 대역폭 부족 현상을 해결할 수 있는 기법으로 단말기들간의 Peer-to-Peer통신이 가능한 이동 Ad Hoc 망을 셀룰러 망에 통합함으로써, 셀룰러 망의 부하를 줄일 수 있는 방안들을 제안한다 이들 제안된 기법들에서의 공통적인 특징은 특정 데이터를 이미 가지고 있는 단말기가 같은 데이터의 액세스를 원하는 다른 단말기를 위한 가상의 캐쉬로 동작하며, 가능할 때마다 이 가상 캐쉬로부터 원하는 파일을 획득함으로써 셀룰러 망의 부하를 줄일 수 있다는 것이다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.566-568
• /
• 2003

본 논문은 급속히 추진되는 유무선망 통합에 따른 P2P 서비스의 효과적인 제공을 위한 새로운 아키텍쳐를 개발하고, 이를 바탕으로 다양한 응용들을 개발한다. 제안하는 P2P 플랫폼은 무선환경의 채널의 불안정성과 모바일 디바이스의 열악한 자원 및 컴퓨팅 성능 둥을 고려한 개념이 도입되어 모바일 사용자의 비접속상태에서도 지속적인 P2P 연결성을 제공할 수 있도록 설계되었다. 플랫폼의 실용성을 높이기 위하여 방화벽이나 NAT 같은 침투성을 막는 장치에 대해 http 전송방식을 대행하는 Relay server의 기능을 강화시켜 모바일 단말의 Prexy server 기능을 추가하여 통신 효율을 높인다. 응용으로는 인스턴트 메시징과 파일 공유 서비스를 구현하여 그 성능을 검증한다.

• Journal of Korea Multimedia Society
• /
• v.11 no.10
• /
• pp.1409-1419
• /
• 2008

Inauthentic resources can be easily spread by P2P (Peer-to-Peer) participants due to the openness and anonymity of P2P networks. A possible way to restrict the distribution of inauthentic resources and prevent malicious peers from joining P2P networks is to exploit peers' reputation which reflect their past behaviors and are also helpful to predict peers' future behaviors. There is a possibility that some peers intentionally plays along with other peers in order to increase/decrease its reputation through false feedback exchanges. Therefore, we propose a new reputation management scheme, called TrustRRep (Trustable Resource sharing service using Reputation) scheme, which improves the trustworthiness and efficiency of P2P networks by identifying peers who give false feedback. The TrustRRep scheme is also capable of providing peers with the trustworthiness of shared resources by discriminating resources distributed by malicious peers. We implement the proposed TrustRRep scheme on the NS-2 simulator for evaluating its performance compared to the recent reputation management work available in literature. A case study on simulations shows that the proposed reputation management scheme yields efficient performance in terms of the minimal download ratio and dissemination of inauthentic resources, the efficient identification of peers who give false feedback, and the provisioning of the trustworthiness of peers' reputation. It also shows that the proposed TrustRRep scheme imposes the restrictions of participating P2P networks on a malicious peers by diminishing its trust value.

• Korean Journal of School Psychology
• /
• v.18 no.1
• /
• pp.31-48
• /
• 2021

The purpose of this study was to determine whether the retention of university freshmen could be predicted using their peer relationships in a specific department. In this study, retention was defined as a student staying enrolled in their university for a certain period of time. Social relationships are formed through interaction between people, so both students' self-perceptions and others' perceptions of them must be accounted for, so we used a social network analysis that did so. We examined social networks visualizations that allowed for a rich interpretation of numerical information. Participants in this study were freshmen who enrolled in an undergraduate program in 2017, 2018, or 2019. We used the name generator method to determine how quantitative friendship network variables predicted the academic retention up to the first semester of 2020. Cox proportional hazard model analysis showed that the weighted indegree centrality with intimacy positively predicted retention. The results of this study can be used to identify and conduct interventions for students who may be likely to disenroll. However all of the students did not participate in the department, it was difficult to examine their entire peer networks. Thus, this study's results cannot be generalized because the participants are students of a specific major, so further research is needed to produce more generalizable results.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.829-834
• /
• 2004

Nodes communicate through wireless channels under peer-to-peer level in ad-hoc mobile networks. The nodes are free to move around in a geographical area and are loose]y bounded by the transmission range of the wireless channels. Also, a node is completely free to move around, there is no fixed final topology. Hence, to manage the inter-node communication and data exchange among them a leader node is required. In this paper we introduce an efficient leader election algorithm for mobile ad hoc networks where inter-node communication is allowed only among the neighboring nodes. Furthermore we present the result of performance evaluation through simulation. The algorithm is efficient and practical since it uses least amount of wireless resources and does not affect the movement of the nodes.