• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.2
• /
• pp.393-402
• /
• 2013

For 0 < $p$ < ${\infty}$, ${\alpha}$ > -1 and 0 < $r$ < 1, we show that if $f$ is in the space of Dirichlet type $\mathfrak{D}^p_{p-1}$, then ${\int}_{1}^{0}M_{p}^{p}(r,f^{\prime})(1-r)^{p-1}rdr$ < ${\infty}$ and ${\int}_{1}^{0}M_{(2+{\alpha})p}^{(2+{\alpha})p}(r,f^{\prime})(1-r)^{(2+{\alpha})p+{\alpha}}rdr$ < ${\infty}$ where $M_p(r,f)=\[\frac{1}{2{\pi}}{\int}_{0}^{2{\pi}}{\mid}f(re^{it}){\mid}^pdt\]^{1/p}$. For 1 < $p$ < $q$ < ${\infty}$ and ${\alpha}+1$ < $p$, we show that if there exists some positive constant $c$ such that ${\parallel}f{\parallel}_{L^{q(d{\mu})}}{\leq}c{\parallel}f{\parallel}_{\mathfrak{D}^p_{\alpha}}$ for all $f{\in}\mathfrak{D}^p_{\alpha}$, then ${\parallel}f{\parallel}_{L^{q(d{\mu})}}{\leq}c{\parallel}f{\parallel}_{\mathcal{B}_p(q)}$ where $\mathcal{B}_p(q)$ is the weighted Besov space. We also find the condition of measure ${\mu}$ such that ${\sup}_{a{\in}D}{\int}_D(k_a(z)(1-{\mid}a{\mid}^2)^{(p-a-1)})^{q/p}d{\mu}(z)$ < ${\infty}$.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.682-685
• /
• 2007

P2P 기술의 발달로 기존 클라이언트-서버 형태인 중앙 집중형 방식의 단점을 극복하고 있다. 이러한 P2P 기술의 진화로 P2P 응용 기술에 대한 많은 발전이 있었다. 현재 P2P 구조에서 사용자는 P2P 네트워크에 참여하여 자신이 원하는 자료를 찾는 검색과정이 필요하다. 본 논문은 이러한 과정을 최소화하여서 검색과정을 줄일 수 있는 방법을 다룬다. P2P 네트워크에 존재하는 서비스 프로파일 목록들을 서비스를 제공하는 주체가 서비스를 소비하는 주체에게 보내주게 된다면 사용자는 최신의 서비스 목록을 유지하여 서비스 목록 검색 시간을 최소화 시킬 수 있다. 본 논문에서는 P2P 오버레이 네트워크상에서의 서비스 푸시 시스템에 대한 정의, 각 피어들의 행동모델을 정의 및 시스템 설계에 대해서 소개한다.

• Journal of Industrial Technology
• /
• v.24 no.B
• /
• pp.177-186
• /
• 2004

The main bottleneck for a VOD system is bandwidth of storage or network I/O due to the high bandwidth requirements and long-lived nature of digital video. Patching is one of the most efficient techniques to overcome the bottleneck of the VOD system through the use of multicast scheme. In this paper, we propose a new patching scheme, P2P proxy patching, for improving the typical patching technique by jointly using the proxy prefix caching scheme and the P2P proxy. In our proposed scheme, each client play a role in a proxy for multicasting a regular stream to other clients that request the same stream. Due the use of the P2P proxy and the prefix caching, the server bandwidth is required significantly less than that of the typical patching technique. In the performance study, we show that our patching scheme can reduce the server bandwidth requirements compared with the existing patching techniques.

• International journal of advanced smart convergence
• /
• v.4 no.2
• /
• pp.38-45
• /
• 2015

Peer-to-Peer(P2P) systems are generally classified into two categories; hybrid and pure P2P. Hybrid systems have a single central index server keeping the details of shared information, so that undesirable effects such as heavy load on that server and lack of fault-tolerance can be caused. Pure P2P causes the other problems such as message flooding and scalability although it shows high degree of fault-tolerance. Recently, mobile agent-based distributed computing has been receiving wide attention for its potential to support disconnected operations, high asynchrony, and thus saving network bandwidth. In this paper, a new scheme of peer coordination is proposed for a decentralized P2P network with self-organizing structure. We deployed mobile agents for incorporating the advantages of usage of mobile agents into our P2P network. Proposed P2P network has both advantages of hybrid and pure P2P. The problems of heavy load on the server and lack of fault-tolerance are improved by using multiple special peers called super-peers. And the problems of pure P2P can be reduced by using mobile agents.

• Proceedings of the Microbiological Society of Korea Conference
• /
• 2001.11a
• /
• pp.16-25
• /
• 2001

A genomic library of biphenyl-degrading strain Comamonas sp. SMN4 was constructed by using the cosmid vector pWE15 and introduced into Escherichia coli. Of 1,000 recombinant clones tested, two clones that expressed 2,3-dihydroxybiphenyl 1,2-dioxygenase activity were found (named pNB 1 and pNB2). From pNB1 clone, subclone pNA210, demonstrated 2,3-dihydroxybiphenyl 1,2-dioxygenase activity, is isolated. 2,3-Dihydroxybiphenyl 1,2-dioxygenase (23DBDO, BphC) is an extradiol-type dioxygenase that involved in third step of biphenyl degradation pathway. The nucleotide sequence of the Comamonas sp. SMN4 gene bphC, which encodes 23DBDO, was cloned into a plasmid pQE30. The His-tagged 23DBDO produced by a recombinant Escherichia coli, SG 13009 (pREP4)(pNPC), and purified with a Ni-nitrilotriacetic acid resin affinity column using the His-bind Qiagen system. The His-tagged 23DBDO construction was active. SDS-PAGE analysis of the purified active 23DBDO gave a single band of 32 kDa; this is in agreement with the size of the bphC coding region. The 23DBDO exhibited maximum activity at pH 9.0. The CD data for the pHs, showed that this enzyme had a typical a-helical folding structures at neutral pHs ranged from pH 4.5 to pH 9.0. This structure maintained up to pH 10.5. However, this high stable folding strucure was converted to unfolded structure in acidic region (pH 2.5) or in high pH (pH 12.0). The result of CD spectra observed with pH effects on 23DBDO activity, suggested that charge transition by pH change have affected change of conformational structure for 23DBDO catalytic reaction. The $K_m$ for 2,3-dihydroxybiphenyl, 3-metylcatechol, 4-methylcatechol and catechol was 11.7 $\mu$M, 24 $\mu$M, 50 mM and 625 $\mu$M.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.481-490
• /
• 2006

In a super-peer based P2P network, The network is clustered and each cluster is managed by a special peer, called a super-peer which has information of all peers in its cluster. This clustered P2P model is known to have efficient information search and less traffic load. In this paper, we first estimate the message traffic cost caused by peer's query, join and update actions within a cluster as well as between the clusters and with these values, we present the optimal number of super-peers that minimizes the traffic cost for the various size of super-peer based P2P networks.rks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1955-1964
• /
• 2011

With fast deployment of high-speed networks and various online services, the demand for massive content distribution is also growing fast. An approach that is increasingly visible in communication research community and in industry domain is peer-to-peer (P2P) networks. The P2P swarming technique enables a content distribution system to achieve higher throughput, avoid server or network overload, and be more resilient to failure and traffic fluctuation. Moreover, as a P2P-based architecture pushed the computing and bandwidth cost toward the network edge, it allows scalability to support a large number of subscribers on a global scale, while imposing little demand for equipment on the content providers. However, the P2P swarming burdens message exchange overheads on the system. In this paper, we propose a new protocol which provides confidentiality, authentication, integrity, and access control to P2P swarming. We implemented a prototype of our protocol on Android smart phone platform. We believe our approach can be straightforwardly adapted to existing commercial P2P content distribution systems with modest modifications to current implementations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.65-73
• /
• 2016

Peer-to-Peer (P2P) systems with super-peer overlay networks show combined advantages of both hybrid and pure P2P systems. Super-peer is a special peer acting as a server to a cluster of generic peers. Organizing a super-peer network is one of important issues for P2P systems with super-peer networks. Conventional P2P systems are based on two-level hierarchies of peers. One is a layer for generic peers and the other is for super-peers. And it is usual that super-peer networks have forms of random graphs. However, for accommodating a large-scale collection of generic peers, the super-peer network has also to be extended. In this paper, we propose a scheme of hierarchically constructing super-peer networks for large-scale P2P systems. At first, a two-level tree, called a simple super-peer network, is proposed, and then a scheme of generalizing and then extending the simple super-peer network to multi-level super-peer network is presented to construct a large-scale super-peer network. We call it an extended super-peer network. The simple super-peer network has several good features, but due to the fixed number of levels, it may have a scalability problem. Thus, it is extended to k-level tree of a super-peer network, called extended super-peer network. It shows good scalability and easy management of generic peers for large scale P2P system.

• 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.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.1
• /
• pp.121-126
• /
• 2013

In the past several years there has been increasing the studies using P2P technology in the distributed system areas. In these P2P systems, the server to support the contents-information have less overloads than the composed system as the server to have resources generally. In this paper, we propose the system to support a social network P2P service based on the social network P2P system. The object of this study was to widen the use of this menu system to determine the price based on visual information by a software agent. Therefore, this system is suitable for micro, small and medium industries in the use of P2P servers and is more usable system interface for owners than previous study.