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

현재 많이 사용되고 있는 P2P 개념으로는 순수 F2P와 변형 F2P구조가 있다. 순수 P2P의 모델에는 Gnutella와 Ktella 등의 형태가 존재하고 변형 P2P로는 무수히 많은 형태가 존재한다. 순수 P2P 모델의 경우에는 정보 공유에서 연결성을 장점으로 Gnutella의 형태를 응용한 형태로 많이 사용되고 있지만 정보를 검색하거나 제공하기 위해 많은 트래픽을 소모하게 된다. 이와는 달리 변형 P2P모델들 중 정보 공유 모델들이 존재하는데 이 모델들은 사용자에게 효율적이고 빠른 검색과 색인을 제공하기 위해 기존의 서버/클라이언트 형태를 취하고 있지만 제공하는 서버의 능력에 의존할 수 밖에 없다. 파일공유 모델의 Peer들에 대해 연결성 유지를 위한 많은 부하와 사용자에 있어서 그룹에 대한 형태의 문제점 그리고 서버의 Fail로 인한 비 연결성에 대한 문제점을 해결하기 위해 본 논문에서는 라우팅 프로토콜 기법에서의 접근과 계층적 구조를 적용하고 Backup 시스템을 포함해서 효율적인 그룹관리와 동적인 서버의 지정으로 신뢰성을 유지하기 위한 시스템을 설계하고 구현하였다.

• Journal of the Chungcheong Mathematical Society
• /
• v.35 no.4
• /
• pp.315-327
• /
• 2022

In this paper, we investigate the transferred superstability for the p-radical sine functional equation $$f\(\sqrt[p]{\frac{x^p+y^p}{2}}\)^2-f\(\sqrt[p]{\frac{x^p-y^p}{2}}\)^2=f(x)f(y)$$ from the p-radical functional equations: $$f({\sqrt[p]{x^p+y^p}})+f({\sqrt[p]{x^p-y^p}})={\lambda}g(x)g(y),\;\\f({\sqrt[p]{x^p+y^p}})+f({\sqrt[p]{x^p-y^p}})={\lambda}g(x)h(y),$$ where p is an odd positive integer, λ is a positive real number, and f is a complex valued function. Furthermore, the results are extended to Banach algebras. Therefore, the obtained result will be forced to the pre-results(p=1) for this type's equations, and will serve as a sample to apply it to the extension of the other known equations.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2098-2115
• /
• 1999

One of the unsolved problems in Neural Networks is the interpretation of hidden layers. This paper defines the Core-Net which has an input(p levels) and an output(q levels) with 2-layers as a basic circuit of neural network. In have suggested an equation, {{{{ {a}_{p,q} = {{q}^{2}} over {2}p(p-1)- { q} over {2 } (3 { p}^{2 } -7p+2)+ { p}^{2 }-3p+2}}}}, whichs ws the capacity of the Core-Net and have proved it by using the mathematical induction. It has been also shown that some of the problems with hidden layers can be solved by using the Core-Net and using simulation of an example.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.5
• /
• pp.1279-1300
• /
• 2021

Let P be a finite point set in ℝ² with the set of distance n-chains defined as ∆_n(P) = {(|p₁ - p₂|, |p₂ - p₃|, …, |p_n - p_n+1|) : p_i ∈ P}. We show that for 2 ⩽ n = O_|P|(1) we have ${\mid}{\Delta}_n(P){\mid}{\gtrsim}{\frac{{\mid}P{\mid}^n}{{\log}^{\frac{13}{2}(n-1)}{\mid}P{\mid}}}$. Our argument uses the energy construction of Elekes and a general version of Rudnev's rich-line bound implicit in [28], which allows one to iterate efficiently on intersecting nested subsets of Guth-Katz lines. Let G is a simple connected graph on m = O(1) vertices with m ⩾ 2. Define the graph-distance set ∆_G(P) as ∆_G(P) = {(|p_i - p_j|)_{i,j}∈E(G) : p_i, p_j ∈ P}. Combining with results of Guth and Katz [17] and Rudnev [28] with the above, if G has a Hamiltonian path we have ${\mid}{\Delta}_G(P){\mid}{\gtrsim}{\frac{{\mid}P{\mid}^{m-1}}{\text{polylog}{\mid}P{\mid}}}$.

• Honam Mathematical Journal
• /
• v.31 no.3
• /
• pp.369-380
• /
• 2009

Let $X,X_1,X_2,\;{\cdots}$ be identically distributed and negatively associated random variables with mean zeros and positive, finite variances. We prove that, if $E{\mid}X_1{\mid}^r$ < ${\infty}$, for 1 < p < 2 and r > $1+{\frac{p}{2}}$, and $lim_{n{\rightarrow}{\infty}}n^{-1}ES^2_n={\sigma}^2$ < ${\infty}$, then $lim_{{\epsilon}{\downarrow}0}{\epsilon}^{{2(r-p}/(2-p)-1}{\sum}^{\infty}_{n=1}n^{{\frac{r}{p}}-2-{\frac{1}{p}}}E\{{{\mid}S_n{\mid}}-{\epsilon}n^{\frac{1}{p}}\}+={\frac{p(2-p)}{(r-p)(2r-p-2)}}E{\mid}Z{\mid}^{\frac{2(r-p)}{2-p}}$, where $S_n\;=\;X_1\;+\;X_2\;+\;{\cdots}\;+\;X_n$ and Z has a normal distribution with mean 0 and variance ${\sigma}^2$.

• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.246-255
• /
• 2007

Due to the bandwidth-consuming characteristics of the heavy-hitter P2P applications, it has become critical to have the capability of pinpointing and mitigating P2P traffic. Traditional port-based classification scheme is no more adequate for this purpose because of newer P2P applications, which incorporating port-hopping techniques or disguising themselves as HTTP-based Internet disk services. Alternatively, packet filtering scheme based on payload signatures suggests more practical and accurate solution for this problem. Moreover, it can be easily deployed on existing IDSes. However, it is significantly difficult to maintain up-to-date signatures of P2P applications. Hence, the automatic signature generation method is essential and will be useful for successful signature-based traffic identification. In this paper, we suggest an automatic signature generation method for Internet disk P2P applications and provide an experimental results on CNU campus network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1783-1789
• /
• 2004

It is evaluated that there is infinit capability of creating new e business using P2P program. but the research for the method to protect the copyright of digital contents is urgent even for development of the p2p service because the problem of copyright protection for digital contents is not solved. Though this article, it can be induced that reliable contents sharing use to a flow fund by secure settlement architecture, user authentication and contents encryption and then it as the problem of copyright fee is solved, it is able to discontinue which trouble with a creation work for copyright fee and protection it's once again as growth of p2p market, p2p protocal is will be grow into a important protocal of advanced network. In this article, When users send digital contants to each other in internet, we proposed the P2P DRM algorism to offer a security function which using the technology of copyright management to use a AES Algorithm based on PKI.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.567-574
• /
• 2013

Recently, many researches on P2P overlay network-based multimedia streaming services have been actively performed because of their high scalability and cost-efficiency advantages. However, P2P overlay networks also have the shortcoming of generating higher traffic owing to their unicast-based one-to-many multimedia deliveries. In order to reduce the traffic generated by the P2P streaming overlay network, we propose an ISP and locality-based parent node discovery method and check its feasibility through an implementation of a prototype streaming system. The measurement of RTTs and hop counts for random nodes having different ISPs and localities shows the proposed method to be able to shorten about 32% RTTs and about 17% Hop counts.

• Journal of Digital Contents Society
• /
• v.12 no.1
• /
• pp.133-139
• /
• 2011

Structured P2P (peer-to-peer) networks have received much attention in research communities and the industry. The data stored in structured P2P networks can be located in a log-scale time without using central severs. The link-structure of structured P2P networks should be maintained for keeping log-scale search performance of it. When nodes join or leave structured P2P networks frequently, some links become unavailable and search performance is degraded by these links. To sustain search performance of structured P2P networks, periodic link recovery scheme is generally used. However, when the link recovery period is short or long compared with node join and leave rates, it is possible that sufficient number of links are not restored or excessive messages are used after the link-structure is restored. We propose the adaptive link recovery determination algorithm to maintain the link-structure of structured P2P networks when the rates of node joining and leaving are changed dynamically. The simulation results show that the proposed algorithm can maintain similar QoS under various node leaving rates.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.325-332
• /
• 2004

For a P2P network, the contents distribution is a very important service because the contents provider is not fixed. And in the P2P media streaming, a request peer replays and saves media data simultaneously, and after streaming it acts as a new source peer providing media files to other peers. Therefore streaming and file saying operations should be simultaneously carried out in order to distribute contents through the P2P network. In this paper, a P2P multi-source media streaming system which can replay the contents data during downloading is proposed and implemented. The system reduces the user response time and the number of simultaneous user increases more than two times. Moreover, transmitting a part of media file makes fast distribution and diffusion of contents possible.