• Title/Summary/Keyword: aP2

Search Result 79,368, Processing Time 0.091 seconds

A Distribution Scheme for Continuous Media Contens over Peer-to-Peer Networks (P2P 네트웍에서 연속형 미디어 컨텐츠의 분산형 배포 기법)

  • Kwon Jin Baek;Yeom Heon Young;Lee Jeong Bae
    • The KIPS Transactions:PartA
    • /
    • v.11A no.7 s.91
    • /
    • pp.511-520
    • /
    • 2004
  • A peer-to-peer model is very useful in solving the server link bottleneck problem of a client-server model. In this work, we discuss the problems of distributing multimedia content over peer-to-peer network. We focus on two problems in peer-to-peer media content distribution systems. The first is the transmission scheduling of the media data for a multi-source streaming session. We present a sophisticated scheduling scheme called fixed-length slotted scheduling, which results in minimum buffering delay. The second problem is on the fast distribution of media content in the peer-to-peer system that is self-growing. We propose a mechanism accelerating the speed at which the system's streaming ca-pacity increases, called FAST.

The Dynamic Group Authentication for P2P based Mobile Commerce (P2P 기반의 모바일 상거래를 위한 동적 그룹 인증)

  • Yun, Sunghyun
    • Journal of Digital Convergence
    • /
    • v.12 no.2
    • /
    • pp.335-341
    • /
    • 2014
  • To play the networked video contents in a client's mobile device in real time, the contents should be delivered to it by the contents server with streaming technology. Generally, in a server-client based commerce model, the server is in charge of both the authentication of the paid customer and distribution of the contents. The drawback of it is that if the customers' requests go on growing rapidly, the service quality would be degraded results from the problems of overloaded server or restricted network bandwidth. On the contrary, in P2P based networks, more and more the demand for service increasing, the service quality is upgraded since a customer can act as a server. But, in the P2P based network, there are too many servers to manage, it's possible to distribute illegal contents because the P2P protocol cannot control distributed servers. Thus, it's not suitable for commercial purposes. In this paper, the dymanic group authentication scheme is proposed which is suited to P2P based applications. The proposed scheme consists of group based key generation, key update, signature generation and verification protocols. It can control the seeder's state whether the seeder is joining or leaving the network, and it can be applied to hybrid P2P based commerce model where sales transactions are covered by the index server and the contents are distributed by the P2P protocol.

A Study on the Relationships of Family Support, Self-esteem and Life-satisfaction in Homeless Persons (노숙자에 대한 가족지지, 자아존중감 및 삶의 만족도에 관한 연구)

  • Kim, Kwuy-Bun;Won, Jeong-Sook
    • Journal of East-West Nursing Research
    • /
    • v.5 no.1
    • /
    • pp.50-64
    • /
    • 2000
  • The purpose of this study was to investigate the correlation of family support, self-esteem and life-satisfaction in homeless persons and to provide basic data to help them attain a better quality of life. From Jul. 1 to Oct. 10, 2000, 235 homeless persons, registered at the noninstitutionalized homeless and institutionalized homeless in Seoul, were accepted as subjects for the study. The instruments used for this study were a Family support scale of Park, Jee Won, life-satisfaction scale of Wood, Wylie & Sheafer and Rosenberg's Self-esteem Scale. The reliability of the scales were tested by Cronbach's Alpha. The collected data Were analyzed by the SPSS program using unpaired t-test and Pearson's Correlation Coefficients. The results were as follows : 1. There Was a statistically significant difference in the level of demographic between family support groups : age(t=2.74, P=.001), education background(f=5.48, P=.001), connection of family (t=2.29, P=.05), present illness(t=2.04, P=.05). 2. There Was a statistically significant difference in the level of demographic between self-esteem groups : education background(t=3.24, P=.05), connect of family (t=3.38, P=.001), types of disease(t=2.12, P=.05), job related to income (t=2.12, P=.05). 3. There Was a statistically significant difference in the level of demographic between life-satisfaction groups : education background(t=3.39, P=.05), connect of family(t=2.10, P=.01), smoking(t=2.38, P=.01), disease(t=1.92, P=.05), emotion states(t= 6.12, P=.001). 4. There was a positive correlation between family support and self-esteem for the homeless and it was statistically significant (r=.267, p=.001). 5. There was a positive correlation between family support and life-satisfaction for the homeless and it was statistically significant(r=.299, p=.001). 6. There was a positive correlation between life-satisfaction and self-esteem for the homeless and it was statistically significant(r=.179, p=.01).

  • PDF

FOURIER SERIES OF A STOCHASTIC PROCESS $X(t,\omega) \in L^2_{s.a.p.}$

  • Choo, Jong-Mi
    • Bulletin of the Korean Mathematical Society
    • /
    • v.21 no.2
    • /
    • pp.127-135
    • /
    • 1984
  • In this paper, we find the Fourier series of X(t, .omega.).mem. $L^{2}$$_{s.a.p.}$ and the Parseval relation of X(t, .omega.).mem. $L^{2}$$_{s.a.p.}$. In section 2, we investigate some basic properties of X(t, .omega.).mem. $L^{2}$$_{s.a.p.}$ In section 3, we show that the mean of X(t, .omega.).mem. $L^{2}$$_{s.a.p.}$ exists and in section 4, after showing the existence of Fourier exponents and Fourier coefficients of X(t, .omega.).mem. $L^{2}$$_{s.a.p.}$. we give the Parseval relation of X(t, .omega.).mem. $L^{2}$$_{s.a.p.}$. For convenience we will denote X(t, .omega.) as X(t) in what follows.hat follows.

  • PDF

Computation of Irrigation Interval and Amount as affected by Growing Substrate and Soil Depth Planted with Zoysia japonica in Green Roof during a Dry Summer (여름철 무강우 시 들잔디 옥상녹화 식재지반에 따른 관수주기 및 관수량 산정)

  • Ju, Jin-Hee;Bae, Gyu-Tae;Kim, Won-Tae;Yoon, Yong-Han
    • Journal of Environmental Science International
    • /
    • v.21 no.3
    • /
    • pp.289-296
    • /
    • 2012
  • The purpose of this study was to identify the irrigation intervals and the amount of suitable growing substrate needed to achieve the desired shallow-extensive green roof system during a dry summer in Korea. In terms of treatment, three types (SL, $P_6P_2L_2$, $P_4P_4L_2$) with varying soil mixture ratios and two types (15 cm, 25 cm) with varying soil depths were created. The results have been analyzed after measuring growth and soil water contents. The difference of growth by treatment was significant in terms of green coverage, height, leaf width and photosynthesis. In measurement of chlorophyll content, no difference was detected when measured against soil depth. According to the growth measurement of Zoysia japonica with respect to differing soil mixture ratios in the 15 cm-deep treatment, a statistical difference was detected at the 0.05 significance level in photosynthesis. In case of green coverage, height, chlorophyll content and leaf width, no statistical significance was observed. In case of the 25 cm-deep treatment, a statistical significance was observed in height and photosynthesis. In terms of green coverage, chlorophyll content and leaf width, no statistical significance was detected. In comparisons of soil moisture tension and soil water contents, the irrigation interval and amount were 8 days and 14.9 L in the SL (15 cm) treatment, respectively. The irrigation interval showed for 10 days a 1.3-fold increase, and the irrigation amount was 27.4 L 1.8-fold more than SL (25 cm), respectively. For $P_6P_2L_2$ (15 cm) treatment, the irrigation interval and amount were 12 days and 20.7 L, respectively. However, an irrigation interval under $P_6P_2L_2$ (25 cm) was for 15 days 1.3 times longer than $P_6P_2L_2$ (15 cm), and an irrigation amount of 40 L was 1.9 times more than that under $P_6P_2L_2$ (15 cm). In $P_4P_4L_2$ (15 cm) treatment, it was indicated that the irrigation interval was 15 days, and the irrigation amount was 19.2 L. It was not needed to irrigate for 16 days under $P_4P_4L_2$ (25 cm) treatment during the dry summer and the longest no-rain periods. The irrigation interval and amount under $P_4P_4L_2$ were 1.8-fold and 1.3-fold, respectively, more than SL treatment as affected by soil mixture ratio. Comparatively $P_4P_4L_2$ had more 1.3-fold and 0.9-fold in irrigation interval and amount more than $P_6P_2L_2$. Therefore, it can be noted that different soil depth and soil mixture ratios had a significant effect on the irrigation interval and amount.

Solid-State $^{31}P$ NMR Chemical Shielding Tensors in Binuclear Platinum Diphosphite Complexes

  • 우애자;Leslie G. Butler
    • Bulletin of the Korean Chemical Society
    • /
    • v.17 no.5
    • /
    • pp.457-460
    • /
    • 1996
  • The principal elements of the 31P NMR chemical shielding tensors have been determined for three binuclear platinum diphosphite complexes, K4[Pt2(P2O5H2)4·2H2O ("Pt2"), K4[Pt2(P2O5H2)4Cl2]·2H2O ("Pt2Cl2"), and K4[Pt2(P2O5H2)4Br2]·2H2O ("Pt2Br2"), by using a Herzfeld-Berger graphical method for interpreting the 31P MAS spectrum. The orientations of 31P chemical shielding tensor relative to the molecular axis system are partially assigned with combination of the longitudinal relaxation study of HPO32- and the reference to known tensor orientations of related sites; the most chemical shielding component, δ33, is directed along the P-Pt bond axis. A discussion is given in which the experimental principal elements of the 31P chemical shielding tensor are related with the Pt-Pt bond distances in binuclear platinum diphosphite complexes.

A Study on the Group Routing Algorithm in DHT-based Peer-to-Peer System (DHT 기반 P2P 시스템을 위한 그룹 라우팅 알고리즘에 관한 연구)

  • Park, Yong-Min
    • 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.

A Study of an Mobile Agent System Based on Hybrid P2P (변형 P2P 기반 시스템을 활용한 이동 에이전트 시스템에 관한 연구)

  • Lee, Seok-Hee;Yang, Il-Deung;Kim, Seong-Ryeol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.17 no.5
    • /
    • pp.19-28
    • /
    • 2012
  • Recently a grid and cloud computing collaboration have become a social issue. These collaborative network system, the P2P system based on this system. Distingui shed from the client/server systems, P2P systems in order to exchange information, its purpose and functions are divided according to the morphological Category. In accordance with the purposes and functions of information and data retrieval, remote program control and integration services for the offers. Most P2P systems client/server scalability, and management takes the form, but to overcome the disadvantages in terms of applying the mixed-mode system is increasing. And recently the distributed computing aspects of the service to users in order to provide suitable to accommodate the diverse needs of various types of mobile agent technology is needed. In this paper, as required by the mobile agent access to a remote resource access control and agent for the execution and management capabilities and improve the reliability of the mobile agent system designed to suggest.

False Data Reduction Strategy for P2P Environment (P2P 환경을 위한 허위 데이터 감축 정책)

  • Kim, Seung-Yun;Lee, Won-Joo;Jeon, Chang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.5
    • /
    • pp.93-100
    • /
    • 2011
  • In this paper, we propose a FDR(False Data Reduction) strategy for P2P environment that reduces false data. The key idea of our strategy is that we use FDR algorithm to stop transmitting of false data and to delete that. If a user recognizes false data in downloaded-data and the user's peer requests the others to stop the transmission of the false data immediately. Also, the FDR algorithm notifies the other peers to prohibit spreading of the false data in the environment. All this procedure is possible to be executed in each peer without any lookup server. The FDR algorithm needs only a little data exchange among peers. Through simulation, we show that it is more effective to reduce the network traffic than the previous P2P strategy. We also show that the proposed strategy improves the performance of network compared to previous P2P strategy. As a result, The FDR strategy is decreased 9.78 ~ 16.84% of mean true data transmission time.

P2P Systems based on Cloud Computing for Scalability of MMOG (MMOG의 확장성을 위한 클라우드 컴퓨팅 기반의 P2P 시스템)

  • Kim, Jin-Hwan
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.4
    • /
    • pp.1-8
    • /
    • 2021
  • In this paper, we propose an approach that combines the technological advantages of P2P and cloud computing to support MMOGs that allowing a huge amount of users worldwide to share a real-time virtual environment. The proposed P2P system based on cloud computing can provide a greater level of scalability because their more resources are added to the infrastructure even when the amount of users grows rapidly. This system also relieves a lot of computational power and network traffic, the load on the servers in the cloud by exploiting the capacity of the peers. In this paper, we describe the concept and basic architecture of cloud computing-based P2P Systems for scalability of MMOGs. An efficient and effective provisioning of resources and mapping of load are mandatory to realize this architecture that scales in economical cost and quality of service to large communities of users. Simulation results show that by controlling the amount of cloud and user-provided resource, the proposed P2P system can reduce the bandwidth at the server while utilizing their enough bandwidth when the number of simultaneous users keeps growing.